LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::split(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, char const&)
const vector<string> InputReader :: split(const string& input, const char& delimiter) {
	string buffer{""};
	vector<string> parts;
	
	for(auto character : input) {
		if(character != delimiter) {
            buffer += character; 
        } else if(character == delimiter && buffer != "") { 
            parts.push_back(buffer); 
            buffer = ""; 
        }
	}
	if(buffer != "") 
        parts.push_back(buffer);
	
	return parts;
}

// Assembly:
subq $0x98, %rsp
movq %rdi, 0x8(%rsp)
movq %rdi, %rax
movq %rax, 0x10(%rsp)
movq %rdi, 0x90(%rsp)
movq %rsi, 0x88(%rsp)
movq %rdx, 0x80(%rsp)
movq %rcx, 0x78(%rsp)
leaq 0x57(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x34b0
movq 0x18(%rsp), %rdx
leaq 0xb0ae(%rip), %rsi      # 0x1903a
leaq 0x58(%rsp), %rdi
callq 0x3390
jmp 0xdf98
leaq 0x57(%rsp), %rdi
callq 0x3310
movq 0x8(%rsp), %rdi
movb $0x0, 0x43(%rsp)
callq 0xecf0
movq 0x80(%rsp), %rax
movq %rax, 0x38(%rsp)
movq 0x38(%rsp), %rdi
callq 0x32d0
movq %rax, 0x30(%rsp)
movq 0x38(%rsp), %rdi
callq 0x34e0
movq %rax, 0x28(%rsp)
leaq 0x30(%rsp), %rdi
leaq 0x28(%rsp), %rsi
callq 0xed00
testb $0x1, %al
jne 0xdff4
jmp 0xe0da
leaq 0x30(%rsp), %rdi
callq 0xed40
movb (%rax), %al
movb %al, 0x27(%rsp)
movsbl 0x27(%rsp), %eax
movq 0x78(%rsp), %rcx
movsbl (%rcx), %ecx
cmpl %ecx, %eax
je 0xe06f
movsbl 0x27(%rsp), %esi
leaq 0x58(%rsp), %rdi
callq 0x31a0
jmp 0xe026
jmp 0xe0c9
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
leaq 0x57(%rsp), %rdi
callq 0x3310
jmp 0xe13b
movq 0x8(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x48(%rsp)
movl %eax, 0x44(%rsp)
callq 0xee10
leaq 0x58(%rsp), %rdi
callq 0x3180
jmp 0xe13b
movsbl 0x27(%rsp), %eax
movq 0x78(%rsp), %rcx
movsbl (%rcx), %ecx
cmpl %ecx, %eax
jne 0xe0c7
leaq 0xafb3(%rip), %rsi      # 0x1903a
leaq 0x58(%rsp), %rdi
callq 0xed50
movb %al, 0x7(%rsp)
jmp 0xe097
movb 0x7(%rsp), %al
testb $0x1, %al
jne 0xe0a1
jmp 0xe0c7
movq 0x8(%rsp), %rdi
leaq 0x58(%rsp), %rsi
callq 0xed80
jmp 0xe0b2
leaq 0xaf81(%rip), %rsi      # 0x1903a
leaq 0x58(%rsp), %rdi
callq 0x3380
jmp 0xe0c5
jmp 0xe0c7
jmp 0xe0c9
jmp 0xe0cb
leaq 0x30(%rsp), %rdi
callq 0xedf0
jmp 0xdfdc
leaq 0xaf59(%rip), %rsi      # 0x1903a
leaq 0x58(%rsp), %rdi
callq 0xed50
movb %al, 0x6(%rsp)
jmp 0xe0f1
movb 0x6(%rsp), %al
testb $0x1, %al
jne 0xe0fb
jmp 0xe10e
movq 0x8(%rsp), %rdi
leaq 0x58(%rsp), %rsi
callq 0xed80
jmp 0xe10c
jmp 0xe10e
movb $0x1, 0x43(%rsp)
testb $0x1, 0x43(%rsp)
jne 0xe124
movq 0x8(%rsp), %rdi
callq 0xee10
leaq 0x58(%rsp), %rdi
callq 0x3180
movq 0x10(%rsp), %rax
addq $0x98, %rsp
retq
movq 0x48(%rsp), %rdi
callq 0x34a0
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::getAlgorithmId(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&)
int InputReader :: getAlgorithmId(const string& algorithm) {
    if (algorithm == "-bfs")
        return BFS_ID;
    if (algorithm == "-gbfs")
        return GREEDY_ID;
    if (algorithm == "-astar")
        return ASTAR_ID;
    if (algorithm == "-idfs")
        return IDFS_ID;
    if (algorithm == "-idastar")
        return IDASTAR_ID;
    return INVALID_ID;
}

// Assembly:
subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
movq %rsi, (%rsp)
movq (%rsp), %rdi
leaq 0xb018(%rip), %rsi      # 0x19180
callq 0xee70
testb $0x1, %al
jne 0xe173
jmp 0xe180
movl $0x0, 0x14(%rsp)
jmp 0xe208
movq (%rsp), %rdi
leaq 0xaffa(%rip), %rsi      # 0x19185
callq 0xee70
testb $0x1, %al
jne 0xe196
jmp 0xe1a0
movl $0x1, 0x14(%rsp)
jmp 0xe208
movq (%rsp), %rdi
leaq 0xafe0(%rip), %rsi      # 0x1918b
callq 0xee70
testb $0x1, %al
jne 0xe1b6
jmp 0xe1c0
movl $0x2, 0x14(%rsp)
jmp 0xe208
movq (%rsp), %rdi
leaq 0xafc7(%rip), %rsi      # 0x19192
callq 0xee70
testb $0x1, %al
jne 0xe1d6
jmp 0xe1e0
movl $0x3, 0x14(%rsp)
jmp 0xe208
movq (%rsp), %rdi
leaq 0xafad(%rip), %rsi      # 0x19198
callq 0xee70
testb $0x1, %al
jne 0xe1f6
jmp 0xe200
movl $0x4, 0x14(%rsp)
jmp 0xe208
movl $0xffffffff, 0x14(%rsp) # imm = 0xFFFFFFFF
movl 0x14(%rsp), %eax
addq $0x18, %rsp
retq
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::parseStatesToString[abi:cxx11](int, char**, bool)
const string InputReader :: parseStatesToString(int argc, char** argv, bool isTxt) {
    string stringStates;
    if(isTxt){
        ifstream ifs(argv[argc-1]);
        stringStates.assign( (istreambuf_iterator<char>(ifs) ),
                (istreambuf_iterator<char>()    ) );
    }
    else{
        stringStates = "";
        for (int i = ALGORITHM_INDEX+1; i < argc-1; i++) {
            stringStates = stringStates + argv[i] + " ";
        }
        stringStates = stringStates + argv[argc-1];
    }    
    return stringStates;
}

// Assembly:
subq $0x2e8, %rsp            # imm = 0x2E8
movq %rdi, 0x8(%rsp)
movb %r8b, %al
movq %rdi, %r8
movq %r8, 0x10(%rsp)
movq %rdi, 0x2e0(%rsp)
movq %rsi, 0x2d8(%rsp)
movl %edx, 0x2d4(%rsp)
movq %rcx, 0x2c8(%rsp)
andb $0x1, %al
movb %al, 0x2c7(%rsp)
movq 0x2d8(%rsp), %rax
movq %rax, 0x18(%rsp)
movb $0x0, 0x2c6(%rsp)
callq 0x33a0
testb $0x1, 0x2c7(%rsp)
je 0xe351
movq 0x2c8(%rsp), %rax
movl 0x2d4(%rsp), %ecx
decl %ecx
movslq %ecx, %rcx
movq (%rax,%rcx,8), %rsi
leaq 0xb8(%rsp), %rdi
movl $0x8, %edx
callq 0x34d0
jmp 0xe2b3
leaq 0x98(%rsp), %rdi
leaq 0xb8(%rsp), %rsi
callq 0xef70
leaq 0x88(%rsp), %rdi
callq 0xefd0
movq 0x8(%rsp), %rdi
movq 0x98(%rsp), %rsi
movl 0xa0(%rsp), %edx
movq 0x88(%rsp), %rcx
movl 0x90(%rsp), %r8d
callq 0xeea0
jmp 0xe300
leaq 0xb8(%rsp), %rdi
callq 0x3060
jmp 0xe466
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
jmp 0xe48f
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
leaq 0xb8(%rsp), %rdi
callq 0x3060
jmp 0xe48f
movq 0x8(%rsp), %rdi
leaq 0xacdd(%rip), %rsi      # 0x1903a
callq 0x3380
jmp 0xe364
movq 0x18(%rsp), %rax
movl (%rax), %eax
addl $0x1, %eax
movl %eax, 0x84(%rsp)
movl 0x84(%rsp), %eax
movl 0x2d4(%rsp), %ecx
subl $0x1, %ecx
cmpl %ecx, %eax
jge 0xe424
movq 0x8(%rsp), %rsi
movq 0x2c8(%rsp), %rax
movslq 0x84(%rsp), %rcx
movq (%rax,%rcx,8), %rdx
leaq 0x40(%rsp), %rdi
callq 0xd910
jmp 0xe3b3
leaq 0xac7d(%rip), %rdx      # 0x19037
leaq 0x60(%rsp), %rdi
leaq 0x40(%rsp), %rsi
callq 0x3ef0
jmp 0xe3cb
movq 0x8(%rsp), %rdi
leaq 0x60(%rsp), %rsi
callq 0x3340
leaq 0x60(%rsp), %rdi
callq 0x3180
leaq 0x40(%rsp), %rdi
callq 0x3180
movl 0x84(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x84(%rsp)
jmp 0xe375
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
leaq 0x40(%rsp), %rdi
callq 0x3180
jmp 0xe48f
movq 0x8(%rsp), %rsi
movq 0x2c8(%rsp), %rax
movl 0x2d4(%rsp), %ecx
decl %ecx
movslq %ecx, %rcx
movq (%rax,%rcx,8), %rdx
leaq 0x20(%rsp), %rdi
callq 0xd910
jmp 0xe44d
movq 0x8(%rsp), %rdi
leaq 0x20(%rsp), %rsi
callq 0x3340
leaq 0x20(%rsp), %rdi
callq 0x3180
movb $0x1, 0x2c6(%rsp)
testb $0x1, 0x2c6(%rsp)
jne 0xe482
movq 0x8(%rsp), %rdi
callq 0x3180
movq 0x10(%rsp), %rax
addq $0x2e8, %rsp            # imm = 0x2E8
retq
movq 0x8(%rsp), %rdi
callq 0x3180
movq 0xb0(%rsp), %rdi
callq 0x34a0
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::getStateFromString(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
const UnpackedState InputReader :: getStateFromString(string str) {
    vector<string> values = split(str, ' ');
    UnpackedState state;
    Line stateLine;
    int numOfTiles = sqrt(values.size()); 
    int counter = 1;
    for (auto value : values) {
        stateLine.push_back(stoi(value));
        if (counter == numOfTiles) {
            state.push_back(stateLine);
            counter = 0;
            stateLine.clear();
        }
        counter++;
    }
    return state;
}

// Assembly:
subq $0xd8, %rsp
movq %rdi, 0x18(%rsp)
movq %rdi, %rax
movq %rax, 0x10(%rsp)
movq %rdi, 0xd0(%rsp)
movq %rsi, 0xc8(%rsp)
movq %rdx, 0xc0(%rsp)
movq 0xc8(%rsp), %rsi
movb $0x20, 0xa7(%rsp)
leaq 0xa8(%rsp), %rdi
movq %rdi, 0x20(%rsp)
leaq 0xa7(%rsp), %rcx
callq 0xdf40
movq 0x18(%rsp), %rdi
movb $0x0, 0xa6(%rsp)
callq 0x6ca0
leaq 0x88(%rsp), %rdi
callq 0x6cb0
movq 0x20(%rsp), %rdi
callq 0xf040
movq %rax, %rdi
callq 0xf000
movsd %xmm0, 0x28(%rsp)
jmp 0xe53f
movsd 0x28(%rsp), %xmm0
cvttsd2si %xmm0, %eax
movl %eax, 0x84(%rsp)
movl $0x1, 0x70(%rsp)
leaq 0xa8(%rsp), %rax
movq %rax, 0x68(%rsp)
movq 0x68(%rsp), %rdi
callq 0xf060
movq %rax, 0x60(%rsp)
movq 0x68(%rsp), %rdi
callq 0xf090
movq %rax, 0x58(%rsp)
leaq 0x60(%rsp), %rdi
leaq 0x58(%rsp), %rsi
callq 0xf0c0
testb $0x1, %al
jne 0xe59b
jmp 0xe670
leaq 0x60(%rsp), %rdi
callq 0xf100
movq %rax, %rsi
leaq 0x38(%rsp), %rdi
callq 0x30f0
jmp 0xe5b4
xorl %eax, %eax
movl %eax, %esi
leaq 0x38(%rsp), %rdi
movl $0xa, %edx
callq 0xf140
movl %eax, 0xc(%rsp)
jmp 0xe5cd
movl 0xc(%rsp), %eax
movw %ax, 0x36(%rsp)
leaq 0x88(%rsp), %rdi
leaq 0x36(%rsp), %rsi
callq 0xf110
jmp 0xe5ea
movl 0x70(%rsp), %eax
cmpl 0x84(%rsp), %eax
jne 0xe64c
movq 0x18(%rsp), %rdi
leaq 0x88(%rsp), %rsi
callq 0xf190
jmp 0xe60b
movl $0x0, 0x70(%rsp)
leaq 0x88(%rsp), %rdi
callq 0xf200
jmp 0xe64c
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
jmp 0xe691
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
leaq 0x38(%rsp), %rdi
callq 0x3180
jmp 0xe691
movl 0x70(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x70(%rsp)
leaq 0x38(%rsp), %rdi
callq 0x3180
leaq 0x60(%rsp), %rdi
callq 0xf220
jmp 0xe583
movb $0x1, 0xa6(%rsp)
leaq 0x88(%rsp), %rdi
callq 0x52e0
testb $0x1, 0xa6(%rsp)
jne 0xe6c1
jmp 0xe6b7
leaq 0x88(%rsp), %rdi
callq 0x52e0
movq 0x18(%rsp), %rdi
callq 0x40f0
leaq 0xa8(%rsp), %rdi
callq 0xee10
jmp 0xe6db
movq 0x18(%rsp), %rdi
callq 0x40f0
leaq 0xa8(%rsp), %rdi
callq 0xee10
movq 0x10(%rsp), %rax
addq $0xd8, %rsp
retq
movq 0x78(%rsp), %rdi
callq 0x34a0
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::parseInput(int, char**)
Input InputReader :: parseInput(int argc, char** argv) {
    Input input;

    string teste = "";
    teste = teste + argv[argc-1];
    std::size_t found = teste.find(".txt");
    bool isTxt = false;
    if(found!=std::string::npos){
        isTxt = true;
    }

    input.algorithm = getAlgorithmId(argv[ALGORITHM_INDEX]);
    input.states = parseStates(argc, argv, isTxt);
    return input;
}

// Assembly:
subq $0x108, %rsp            # imm = 0x108
movq %rdi, 0x18(%rsp)
movq %rdi, %rax
movq %rax, 0x20(%rsp)
movq %rdi, 0x100(%rsp)
movq %rsi, 0xf8(%rsp)
movl %edx, 0xf4(%rsp)
movq %rcx, 0xe8(%rsp)
movq 0xf8(%rsp), %rax
movq %rax, 0x28(%rsp)
movb $0x0, 0xe7(%rsp)
callq 0xf580
leaq 0xbf(%rsp), %rdi
movq %rdi, 0x30(%rsp)
callq 0x34b0
movq 0x30(%rsp), %rdx
leaq 0xa57f(%rip), %rsi      # 0x1903a
leaq 0xc0(%rsp), %rdi
callq 0x3390
jmp 0xeaca
leaq 0xbf(%rsp), %rdi
callq 0x3310
movq 0xe8(%rsp), %rax
movl 0xf4(%rsp), %ecx
decl %ecx
movslq %ecx, %rcx
movq (%rax,%rcx,8), %rdx
leaq 0x88(%rsp), %rdi
leaq 0xc0(%rsp), %rsi
callq 0xd910
jmp 0xeb06
leaq 0xc0(%rsp), %rdi
leaq 0x88(%rsp), %rsi
callq 0x3340
leaq 0x88(%rsp), %rdi
callq 0x3180
leaq 0xc0(%rsp), %rdi
leaq 0xa66a(%rip), %rsi      # 0x191a1
xorl %eax, %eax
movl %eax, %edx
callq 0x3520
movq %rax, 0x80(%rsp)
movb $0x0, 0x7f(%rsp)
cmpq $-0x1, 0x80(%rsp)
je 0xeb9e
movb $0x1, 0x7f(%rsp)
jmp 0xeb9e
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
leaq 0xbf(%rsp), %rdi
callq 0x3310
jmp 0xecd9
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
jmp 0xecb3
movq 0x28(%rsp), %rcx
movq 0xe8(%rsp), %rax
movslq (%rcx), %rcx
movq (%rax,%rcx,8), %rax
movq %rax, 0x8(%rsp)
leaq 0x57(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x34b0
movq 0x8(%rsp), %rsi
movq 0x10(%rsp), %rdx
leaq 0x58(%rsp), %rdi
callq 0x3390
jmp 0xebdc
movq 0x28(%rsp), %rdi
leaq 0x58(%rsp), %rsi
callq 0xe150
movl %eax, 0x4(%rsp)
jmp 0xebf1
movq 0x18(%rsp), %rax
movl 0x4(%rsp), %ecx
movl %ecx, 0x18(%rax)
leaq 0x58(%rsp), %rdi
callq 0x3180
leaq 0x57(%rsp), %rdi
callq 0x3310
movq 0x28(%rsp), %rsi
movl 0xf4(%rsp), %edx
movq 0xe8(%rsp), %rcx
movzbl 0x7f(%rsp), %r8d
andl $0x1, %r8d
leaq 0x38(%rsp), %rdi
callq 0xe6f0
jmp 0xec3b
movq 0x18(%rsp), %rdi
leaq 0x38(%rsp), %rsi
callq 0xf590
leaq 0x38(%rsp), %rdi
callq 0x4180
movb $0x1, 0xe7(%rsp)
leaq 0xc0(%rsp), %rdi
callq 0x3180
testb $0x1, 0xe7(%rsp)
jne 0xeccc
jmp 0xecc2
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
jmp 0xeca9
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0xb0(%rsp)
movl %eax, 0xac(%rsp)
leaq 0x58(%rsp), %rdi
callq 0x3180
leaq 0x57(%rsp), %rdi
callq 0x3310
leaq 0xc0(%rsp), %rdi
callq 0x3180
jmp 0xecd9
movq 0x18(%rsp), %rdi
callq 0x4170
movq 0x20(%rsp), %rax
addq $0x108, %rsp            # imm = 0x108
retq
movq 0x18(%rsp), %rdi
callq 0x4170
movq 0xb0(%rsp), %rdi
callq 0x34a0
// File: camargodev[P]n-tile-puzzle/src/algorithms/GreedyBestFirstSearch.cpp
// Function: buildGBFSNode(State, int, int)
Node buildGBFSNode(State state, int cost, int index) {
    Node node;
    node.state = state;
    node.cost = cost;
    node.index = index;
    return node;
}

// Assembly:
movq %rdi, %rax
movq %rsi, -0x10(%rsp)
movq %rdx, -0x8(%rsp)
movl %ecx, -0x14(%rsp)
movl %r8d, -0x18(%rsp)
movq -0x10(%rsp), %rcx
movq %rcx, (%rdi)
movq -0x8(%rsp), %rcx
movq %rcx, 0x8(%rdi)
movl -0x14(%rsp), %ecx
movb %cl, 0x10(%rdi)
movl -0x18(%rsp), %ecx
movl %ecx, 0x14(%rdi)
retq
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/algorithms/GreedyBestFirstSearch.cpp
// Function: GreedyCompare::operator()(Node, Node)
bool operator() (Node node1, Node node2) {
        int h1 = node1.state.heuristic;
        int h2 = node2.state.heuristic;
        if (h1 != h2)
            return h1 > h2;
        return node1.index < node2.index;
    }

// Assembly:
leaq 0x20(%rsp), %rax
movq %rax, -0x28(%rsp)
leaq 0x8(%rsp), %rcx
movq %rcx, -0x20(%rsp)
movq %rdi, -0x10(%rsp)
movzbl 0x8(%rcx), %ecx
movl %ecx, -0x14(%rsp)
movzbl 0x8(%rax), %eax
movl %eax, -0x18(%rsp)
movl -0x14(%rsp), %eax
cmpl -0x18(%rsp), %eax
je 0x16776
movl -0x14(%rsp), %eax
cmpl -0x18(%rsp), %eax
setg %al
andb $0x1, %al
movb %al, -0x1(%rsp)
jmp 0x1678f
movq -0x28(%rsp), %rcx
movq -0x20(%rsp), %rax
movl 0x14(%rax), %eax
cmpl 0x14(%rcx), %eax
setl %al
andb $0x1, %al
movb %al, -0x1(%rsp)
movb -0x1(%rsp), %al
andb $0x1, %al
retq
nopw %cs:(%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/algorithms/AStar.cpp
// Function: AStarCompare::operator()(Node, Node)
bool operator() (Node node1, Node node2) {
        int f1 = node1.state.heuristic;
        int f2 = node2.state.heuristic;
        int h1 = f1 + node1.cost;
        int h2 = f2 + node2.cost;
        if (h1 != h2)
            return h1 > h2;
        if (f1 != f2)
            return f1 > f2;
        return node1.index < node2.index;
    }

// Assembly:
leaq 0x20(%rsp), %rcx
movq %rcx, -0x30(%rsp)
leaq 0x8(%rsp), %rdx
movq %rdx, -0x28(%rsp)
movq %rdi, -0x10(%rsp)
movzbl 0x8(%rdx), %eax
movl %eax, -0x14(%rsp)
movzbl 0x8(%rcx), %eax
movl %eax, -0x18(%rsp)
movl -0x14(%rsp), %eax
movzbl 0x10(%rdx), %edx
addl %edx, %eax
movl %eax, -0x1c(%rsp)
movl -0x18(%rsp), %eax
movzbl 0x10(%rcx), %ecx
addl %ecx, %eax
movl %eax, -0x20(%rsp)
movl -0x1c(%rsp), %eax
cmpl -0x20(%rsp), %eax
je 0x17b32
movl -0x1c(%rsp), %eax
cmpl -0x20(%rsp), %eax
setg %al
andb $0x1, %al
movb %al, -0x1(%rsp)
jmp 0x17b68
movl -0x14(%rsp), %eax
cmpl -0x18(%rsp), %eax
je 0x17b4f
movl -0x14(%rsp), %eax
cmpl -0x18(%rsp), %eax
setg %al
andb $0x1, %al
movb %al, -0x1(%rsp)
jmp 0x17b68
movq -0x30(%rsp), %rcx
movq -0x28(%rsp), %rax
movl 0x14(%rax), %eax
cmpl 0x14(%rcx), %eax
setl %al
andb $0x1, %al
movb %al, -0x1(%rsp)
movb -0x1(%rsp), %al
andb $0x1, %al
retq
nop
// File: camargodev[P]n-tile-puzzle/src/algorithms/IDFS.cpp
// Function: IDFS::depthLimitedSearch(unsigned long, unsigned long, int)
IDFS::Solution IDFS :: depthLimitedSearch(PackedState state, PackedState parent, int depthLimit){
    IDFS::Solution solution;
    StateManager stateManager;

    if (stateManager.isGoalState(state)){
        solution.isSolution = true;
        solution.cost = 0;
        return solution;
    }
    
    if(depthLimit > 0){
        this->result->increaseExpandedNodes();
        for (auto successorState : stateManager.produceNextPackedStates(state)) {
            if(successorState != parent){
                solution = depthLimitedSearch(successorState, state, depthLimit-1);
                if(solution.isSolution == true){
                    solution.cost++;
                    return solution;
                }
            }            
        }
    }  

    solution.isSolution = false;
    return solution;
}

// Assembly:
subq $0xc8, %rsp
movq %rdi, 0xb0(%rsp)
movq %rsi, 0xa8(%rsp)
movq %rdx, 0xa0(%rsp)
movl %ecx, 0x9c(%rsp)
movq 0xb0(%rsp), %rax
movq %rax, 0x18(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x3eb0
movq 0xa8(%rsp), %rsi
leaq 0x80(%rsp), %rdi
callq 0x5890
testb $0x1, %al
jne 0x1819b
jmp 0x181b4
movb $0x1, 0xb8(%rsp)
movq $0x0, 0xc0(%rsp)
jmp 0x18328
cmpl $0x0, 0x9c(%rsp)
jle 0x18320
movq 0x18(%rsp), %rax
movq (%rax), %rdi
callq 0xccb0
movq 0xa8(%rsp), %rdx
leaq 0x60(%rsp), %rdi
leaq 0x80(%rsp), %rsi
callq 0x6510
leaq 0x60(%rsp), %rax
movq %rax, 0x78(%rsp)
movq 0x78(%rsp), %rdi
callq 0x7720
movq %rax, 0x58(%rsp)
movq 0x78(%rsp), %rdi
callq 0xab40
movq %rax, 0x50(%rsp)
leaq 0x58(%rsp), %rdi
leaq 0x50(%rsp), %rsi
callq 0x18450
testb $0x1, %al
jne 0x18231
movl $0x2, 0x4c(%rsp)
jmp 0x18309
leaq 0x58(%rsp), %rdi
callq 0xb020
movq (%rax), %rax
movq %rax, 0x40(%rsp)
movq 0x40(%rsp), %rax
cmpq 0xa0(%rsp), %rax
je 0x182f8
movq 0x18(%rsp), %rdi
movq 0x40(%rsp), %rsi
movq 0xa8(%rsp), %rdx
movl 0x9c(%rsp), %ecx
decl %ecx
callq 0x18140
movq %rdx, 0x8(%rsp)
movb %al, 0x17(%rsp)
jmp 0x18281
movq 0x8(%rsp), %rax
movb 0x17(%rsp), %cl
movb %cl, 0x30(%rsp)
movq %rax, 0x38(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0xb8(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0xc0(%rsp)
movb 0xb8(%rsp), %al
andb $0x1, %al
movzbl %al, %eax
cmpl $0x1, %eax
jne 0x182f6
movq 0xc0(%rsp), %rax
addq $0x1, %rax
movq %rax, 0xc0(%rsp)
movl $0x1, 0x4c(%rsp)
jmp 0x18309
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x28(%rsp)
movl %eax, 0x24(%rsp)
leaq 0x60(%rsp), %rdi
callq 0x7810
jmp 0x1833f
jmp 0x182f8
jmp 0x182fa
leaq 0x58(%rsp), %rdi
callq 0x18490
jmp 0x18211
leaq 0x60(%rsp), %rdi
callq 0x7810
movl 0x4c(%rsp), %eax
subl $0x1, %eax
je 0x18328
jmp 0x1831e
jmp 0x18320
movb $0x0, 0xb8(%rsp)
movb 0xb8(%rsp), %al
movq 0xc0(%rsp), %rdx
addq $0xc8, %rsp
retq
movq 0x28(%rsp), %rdi
callq 0x34a0
nopl (%rax)
// File: camargodev[P]n-tile-puzzle/src/algorithms/IDFS.cpp
// Function: IDFS::execute(unsigned long)
Result IDFS :: execute(PackedState initialState){

    StateManager stateManager;

    this->result->startCountingTime();
    this->result->setInitialHeuristicValue(stateManager.calculateHeuristic(initialState));
    
    int depthLimit = 0;
    IDFS::Solution solution;

    while(true){
        solution = depthLimitedSearch(initialState, 0, depthLimit);
        if (solution.isSolution == true) {
            this->result->setOptimalSolutionLenght(solution.cost);
            this->result->stopCountingTime();
            return *(this->result);
        }
        depthLimit++;
    }

}

// Assembly:
subq $0x78, %rsp
movq %rdi, 0x8(%rsp)
movq %rdi, 0x10(%rsp)
movq %rsi, 0x70(%rsp)
movq %rdx, 0x68(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x18(%rsp)
leaq 0x50(%rsp), %rdi
callq 0x3eb0
movq 0x18(%rsp), %rax
movq (%rax), %rdi
callq 0xcd30
movq 0x18(%rsp), %rax
movq (%rax), %rax
movq %rax, 0x20(%rsp)
movq 0x68(%rsp), %rsi
leaq 0x50(%rsp), %rdi
callq 0x6aa0
movq 0x20(%rsp), %rdi
movl %eax, %esi
callq 0xcd80
movl $0x0, 0x4c(%rsp)
movq 0x18(%rsp), %rdi
movq 0x68(%rsp), %rsi
movl 0x4c(%rsp), %ecx
xorl %eax, %eax
movl %eax, %edx
callq 0x18140
movb %al, 0x28(%rsp)
movq %rdx, 0x30(%rsp)
movq 0x28(%rsp), %rax
movq %rax, 0x38(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0x40(%rsp)
movb 0x38(%rsp), %al
andb $0x1, %al
movzbl %al, %eax
cmpl $0x1, %eax
jne 0x1843d
movq 0x18(%rsp), %rax
movq (%rax), %rdi
movq 0x40(%rsp), %rax
movl %eax, %esi
callq 0xcd60
movq 0x18(%rsp), %rax
movq (%rax), %rdi
callq 0xccf0
movq 0x18(%rsp), %rax
movq 0x8(%rsp), %rdi
movq (%rax), %rsi
movl $0x38, %edx
callq 0x3250
movq 0x10(%rsp), %rax
addq $0x78, %rsp
retq
movl 0x4c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x4c(%rsp)
jmp 0x183b9
nopl (%rax)
// File: camargodev[P]n-tile-puzzle/src/algorithms/IDAStar.cpp
// Function: IDAStar::buildNode(State, int)
Node IDAStar :: buildNode(State state, int cost) {
    Node node;
    node.state = state;
    node.cost = cost;
    node.index = -1;
    return node;
}

// Assembly:
movq %rdi, %rax
movq %rdx, -0x10(%rsp)
movq %rcx, -0x8(%rsp)
movq %rsi, -0x18(%rsp)
movl %r8d, -0x1c(%rsp)
movq -0x10(%rsp), %rcx
movq %rcx, (%rdi)
movq -0x8(%rsp), %rcx
movq %rcx, 0x8(%rdi)
movl -0x1c(%rsp), %ecx
movb %cl, 0x10(%rdi)
movl $0xffffffff, 0x14(%rdi) # imm = 0xFFFFFFFF
retq
nopw (%rax,%rax)
// File: camargodev[P]n-tile-puzzle/src/algorithms/IDAStar.cpp
// Function: IDAStar::execute(unsigned long)
Result IDAStar :: execute(PackedState initialState){
    StateManager stateManager;
    unsigned long long int fLimit = stateManager.calculateHeuristic(initialState);
    
    this->result->startCountingTime();
    this->result->setInitialHeuristicValue(fLimit);
    this->result->increaseTotalHeuristicValue(fLimit);

    State initial;
    initial.value = initialState;
    initial.heuristic = fLimit;
    initial.parentBlankPos = -1;
    Node initialNode = IDAStar::buildInitialNode(initial);
    
    IDAStar::Solution solution;

    while(fLimit != ULLONG_MAX){
        solution = recursiveSearch(initialNode, 0, fLimit);
        if(solution.isSolution == true){
            this->result->setOptimalSolutionLenght(solution.cost);
            this->result->stopCountingTime();
            return *(this->result);
        }
        fLimit = solution.limit;
    }

    this->result->setOptimalSolutionLenght(INT_MAX);
    return *(this->result);
}

// Assembly:
subq $0xe8, %rsp
movq %rdi, 0x20(%rsp)
movq %rdi, 0x28(%rsp)
movq %rsi, 0xe0(%rsp)
movq %rdx, 0xd8(%rsp)
movq 0xe0(%rsp), %rax
movq %rax, 0x30(%rsp)
leaq 0xc0(%rsp), %rdi
callq 0x3eb0
movq 0xd8(%rsp), %rsi
leaq 0xc0(%rsp), %rdi
callq 0x6aa0
movl %eax, %ecx
movq 0x30(%rsp), %rax
movslq %ecx, %rcx
movq %rcx, 0xb8(%rsp)
movq (%rax), %rdi
callq 0xcd30
movq 0x30(%rsp), %rax
movq (%rax), %rdi
movq 0xb8(%rsp), %rax
movl %eax, %esi
callq 0xcd80
movq 0x30(%rsp), %rax
movq (%rax), %rdi
movq 0xb8(%rsp), %rax
movl %eax, %esi
callq 0xcda0
movq 0x30(%rsp), %rsi
movq 0xd8(%rsp), %rax
movq %rax, 0xa8(%rsp)
movq 0xb8(%rsp), %rax
movb %al, 0xb0(%rsp)
movb $-0x1, 0xb1(%rsp)
movq 0xa8(%rsp), %rax
movq %rax, 0x80(%rsp)
movq 0xb0(%rsp), %rax
movq %rax, 0x88(%rsp)
movq 0x80(%rsp), %rdx
movq 0x88(%rsp), %rcx
leaq 0x90(%rsp), %rdi
callq 0x184f0
cmpq $-0x1, 0xb8(%rsp)
je 0x18b68
movq 0x30(%rsp), %rsi
movq 0x90(%rsp), %rax
movq %rax, 0x38(%rsp)
movq 0x98(%rsp), %rax
movq %rax, 0x40(%rsp)
movq 0xa0(%rsp), %rax
movq %rax, 0x48(%rsp)
movq 0xb8(%rsp), %rax
movl %eax, %ecx
leaq 0x50(%rsp), %rdi
leaq 0x38(%rsp), %rax
xorl %edx, %edx
movq (%rax), %r8
movq %r8, (%rsp)
movq 0x8(%rax), %r8
movq %r8, 0x8(%rsp)
movq 0x10(%rax), %rax
movq %rax, 0x10(%rsp)
callq 0x185d0
movq 0x50(%rsp), %rax
movq %rax, 0x68(%rsp)
movq 0x58(%rsp), %rax
movq %rax, 0x70(%rsp)
movq 0x60(%rsp), %rax
movq %rax, 0x78(%rsp)
movb 0x68(%rsp), %al
andb $0x1, %al
movzbl %al, %eax
cmpl $0x1, %eax
jne 0x18b56
movq 0x30(%rsp), %rax
movq (%rax), %rdi
movq 0x70(%rsp), %rax
movl %eax, %esi
callq 0xcd60
movq 0x30(%rsp), %rax
movq (%rax), %rdi
callq 0xccf0
movq 0x30(%rsp), %rax
movq 0x20(%rsp), %rdi
movq (%rax), %rsi
movl $0x38, %edx
callq 0x3250
jmp 0x18b91
movq 0x78(%rsp), %rax
movq %rax, 0xb8(%rsp)
jmp 0x18a81
movq 0x30(%rsp), %rax
movq (%rax), %rdi
movl $0x7fffffff, %esi       # imm = 0x7FFFFFFF
callq 0xcd60
movq 0x30(%rsp), %rax
movq 0x20(%rsp), %rdi
movq (%rax), %rsi
movl $0x38, %edx
callq 0x3250
movq 0x28(%rsp), %rax
addq $0xe8, %rsp
retq
nop
// File: brc7[P]DiversitySampling/src/SequenceMinHash.cpp
// Function: SequenceMinHash::getHash(unsigned long, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, int*)
void SequenceMinHash::getHash(size_t k, const std::string& sequence, int* hashes){
    // getHash(size_t k, std::string& sequence, int* hashes)
    // hashes had better be pre-allocated to _numhashes!!
    // I do this because this is faster in a loop 
    #pragma omp parallel for 
    for (int n=0; n < _numhashes; n++) {

        unsigned int hashed_value;
        unsigned int minhashed_value;

        minhashed_value = std::numeric_limits<unsigned int>::max(); 
        hashes[n] = 0; 

        const char* seq = sequence.c_str(); 
        int len = sequence.length(); 

        // for each kmer in the sequence
        for (int start = 0; (start + k + 1) < len; start++){
            hashed_value = MurmurHash(seq + start, sizeof(char)*k, n); 

            if (hashed_value < minhashed_value){
                minhashed_value = hashed_value;
                hashes[n] = MurmurHash(seq + start, sizeof(char)*k, n*3); 
                // proxy for returning the string itself
            }
        }

    }
    return; 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x50, %rsp
movq %rdi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movq %rdx, -0x18(%rbp)
movq %rcx, -0x20(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x48(%rbp)
movl $0x0, -0x24(%rbp)
movq -0x48(%rbp), %rcx
movl -0x24(%rbp), %eax
cmpl (%rcx), %eax
jge 0x2758
callq 0x2760
movl %eax, -0x2c(%rbp)
movq -0x20(%rbp), %rax
movslq -0x24(%rbp), %rcx
movl $0x0, (%rax,%rcx,4)
movq -0x18(%rbp), %rdi
callq 0x20d0
movq %rax, -0x38(%rbp)
movq -0x18(%rbp), %rdi
callq 0x2340
movl %eax, -0x3c(%rbp)
movl $0x0, -0x40(%rbp)
movslq -0x40(%rbp), %rax
addq -0x10(%rbp), %rax
addq $0x1, %rax
movslq -0x3c(%rbp), %rcx
cmpq %rcx, %rax
jae 0x2748
movq -0x38(%rbp), %rdi
movslq -0x40(%rbp), %rax
addq %rax, %rdi
movq -0x10(%rbp), %rax
shlq $0x0, %rax
movl %eax, %esi
movl -0x24(%rbp), %edx
callq 0x31d0
movl %eax, -0x28(%rbp)
movl -0x28(%rbp), %eax
cmpl -0x2c(%rbp), %eax
jae 0x273b
movl -0x28(%rbp), %eax
movl %eax, -0x2c(%rbp)
movq -0x38(%rbp), %rdi
movslq -0x40(%rbp), %rax
addq %rax, %rdi
movq -0x10(%rbp), %rax
shlq $0x0, %rax
movl %eax, %esi
imull $0x3, -0x24(%rbp), %edx
callq 0x31d0
movl %eax, %edx
movq -0x20(%rbp), %rax
movslq -0x24(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x273d
movl -0x40(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x40(%rbp)
jmp 0x26cd
jmp 0x274a
movl -0x24(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x24(%rbp)
jmp 0x2687
addq $0x50, %rsp
popq %rbp
retq
nop
// File: brc7[P]DiversitySampling/src/io.cpp
// Function: SequenceFeaturesI(std::istream&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
bool SequenceFeaturesI(std::istream& in, std::string& sequence, std::string& chunk, std::string fastWhat){
    bool success = SequenceFeatures(in, sequence, chunk, fastWhat); 

    // now tack on another few lines for the second chunk of the interleaved file! 
    int chunksize = 0; 
    int linesread = 0; 
    if (fastWhat == "fasta") {
        chunksize = 2;
    } else if (fastWhat == "fastq") {
        chunksize = 4;
    }
    std::string buffer;
    while((linesread < chunksize) && (in)){
        std::getline(in, buffer); 
        linesread++; 
        chunk += buffer; 
        chunk += "\n"; 
    }
    return success; 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0xc0, %rsp
movq %rcx, -0xb8(%rbp)
movq %rsi, %rax
movq -0xb8(%rbp), %rsi
movq %rsi, -0xb0(%rbp)
movq %rdi, -0x8(%rbp)
movq %rax, -0x10(%rbp)
movq %rdx, -0x18(%rbp)
movq %rsi, -0x20(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0xa8(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0xa0(%rbp)
movq -0x18(%rbp), %rax
movq %rax, -0x98(%rbp)
leaq -0x48(%rbp), %rdi
movq %rdi, -0x90(%rbp)
callq 0x20e0
movq -0xa8(%rbp), %rdi
movq -0xa0(%rbp), %rsi
movq -0x98(%rbp), %rdx
movq -0x90(%rbp), %rcx
callq 0x2770
movb %al, -0x81(%rbp)
jmp 0x304d
leaq -0x48(%rbp), %rdi
callq 0x2120
movb -0x81(%rbp), %al
movq -0xb0(%rbp), %rdi
andb $0x1, %al
movb %al, -0x21(%rbp)
movl $0x0, -0x58(%rbp)
movl $0x0, -0x5c(%rbp)
leaq 0x2f87(%rip), %rsi      # 0x6004
callq 0x31a0
testb $0x1, %al
jne 0x3088
jmp 0x30ab
movl $0x2, -0x58(%rbp)
jmp 0x30cd
movq %rax, %rcx
movl %edx, %eax
movq %rcx, -0x50(%rbp)
movl %eax, -0x54(%rbp)
leaq -0x48(%rbp), %rdi
callq 0x2120
jmp 0x318f
movq -0xb0(%rbp), %rdi
leaq 0x364c(%rip), %rsi      # 0x6705
callq 0x31a0
testb $0x1, %al
jne 0x30c4
jmp 0x30cb
movl $0x4, -0x58(%rbp)
jmp 0x30cd
leaq -0x80(%rbp), %rdi
callq 0x22f0
movl -0x5c(%rbp), %ecx
xorl %eax, %eax
cmpl -0x58(%rbp), %ecx
movb %al, -0xb9(%rbp)
jge 0x310f
movq -0x8(%rbp), %rdi
movq (%rdi), %rax
movq -0x18(%rax), %rax
addq %rax, %rdi
callq 0x2280
movb %al, -0xba(%rbp)
jmp 0x3101
movb -0xba(%rbp), %al
movb %al, -0xb9(%rbp)
jmp 0x310f
movb -0xb9(%rbp), %al
testb $0x1, %al
jne 0x311b
jmp 0x316c
movq -0x8(%rbp), %rdi
leaq -0x80(%rbp), %rsi
callq 0x2070
jmp 0x312a
movl -0x5c(%rbp), %eax
incl %eax
movl %eax, -0x5c(%rbp)
movq -0x18(%rbp), %rdi
leaq -0x80(%rbp), %rsi
callq 0x22a0
jmp 0x3141
movq -0x18(%rbp), %rdi
leaq 0x2f6a(%rip), %rsi      # 0x60b6
callq 0x21a0
jmp 0x3153
jmp 0x30d6
movq %rax, %rcx
movl %edx, %eax
movq %rcx, -0x50(%rbp)
movl %eax, -0x54(%rbp)
leaq -0x80(%rbp), %rdi
callq 0x2120
jmp 0x318f
movb -0x21(%rbp), %al
movb %al, -0xbb(%rbp)
leaq -0x80(%rbp), %rdi
callq 0x2120
movb -0xbb(%rbp), %al
andb $0x1, %al
addq $0xc0, %rsp
popq %rbp
retq
movq -0x50(%rbp), %rdi
callq 0x2390
nopl (%rax,%rax)
// File: brc7[P]DiversitySampling/src/MurmurHash.cpp
// Function: MurmurHash(void const*, int, unsigned int)
unsigned int MurmurHash (const void * key, int len, unsigned int seed)
{
	// 'm' and 'r' are mixing constants generated offline.
	// They're not really 'magic', they just happen to work well.

	const unsigned int m = 0x5bd1e995;
	const int r = 24;

	// Initialize the hash to a 'random' value

	unsigned int h = seed ^ len;

	// Mix 4 bytes at a time into the hash

	const unsigned char * data = (const unsigned char *)key;

	while(len >= 4)
	{
		unsigned int k = *(unsigned int *)data;

		k *= m; 
		k ^= k >> r; 
		k *= m; 
		
		h *= m; 
		h ^= k;

		data += 4;
		len -= 4;
	}
	
	// Handle the last few bytes of the input array

	switch(len)
	{
	case 3: h ^= data[2] << 16;
	case 2: h ^= data[1] << 8;
	case 1: h ^= data[0];
	        h *= m;
	};

	// Do a few final mixes of the hash to ensure the last few
	// bytes are well-incorporated.

	h ^= h >> 13;
	h *= m;
	h ^= h >> 15;

	return h;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl $0x5bd1e995, -0x14(%rbp) # imm = 0x5BD1E995
movl $0x18, -0x18(%rbp)
movl -0x10(%rbp), %eax
xorl -0xc(%rbp), %eax
movl %eax, -0x1c(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x28(%rbp)
cmpl $0x4, -0xc(%rbp)
jl 0x3256
movq -0x28(%rbp), %rax
movl (%rax), %eax
movl %eax, -0x2c(%rbp)
imull $0x5bd1e995, -0x2c(%rbp), %eax # imm = 0x5BD1E995
movl %eax, -0x2c(%rbp)
movl -0x2c(%rbp), %eax
shrl $0x18, %eax
xorl -0x2c(%rbp), %eax
movl %eax, -0x2c(%rbp)
imull $0x5bd1e995, -0x2c(%rbp), %eax # imm = 0x5BD1E995
movl %eax, -0x2c(%rbp)
imull $0x5bd1e995, -0x1c(%rbp), %eax # imm = 0x5BD1E995
movl %eax, -0x1c(%rbp)
movl -0x2c(%rbp), %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
movq -0x28(%rbp), %rax
addq $0x4, %rax
movq %rax, -0x28(%rbp)
movl -0xc(%rbp), %eax
subl $0x4, %eax
movl %eax, -0xc(%rbp)
jmp 0x31fd
movl -0xc(%rbp), %eax
movl %eax, -0x30(%rbp)
subl $0x1, %eax
je 0x3299
jmp 0x3263
movl -0x30(%rbp), %eax
subl $0x2, %eax
je 0x3288
jmp 0x326d
movl -0x30(%rbp), %eax
subl $0x3, %eax
jne 0x32b0
jmp 0x3277
movq -0x28(%rbp), %rax
movzbl 0x2(%rax), %eax
shll $0x10, %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
movq -0x28(%rbp), %rax
movzbl 0x1(%rax), %eax
shll $0x8, %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
movq -0x28(%rbp), %rax
movzbl (%rax), %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
imull $0x5bd1e995, -0x1c(%rbp), %eax # imm = 0x5BD1E995
movl %eax, -0x1c(%rbp)
movl -0x1c(%rbp), %eax
shrl $0xd, %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
imull $0x5bd1e995, -0x1c(%rbp), %eax # imm = 0x5BD1E995
movl %eax, -0x1c(%rbp)
movl -0x1c(%rbp), %eax
shrl $0xf, %eax
xorl -0x1c(%rbp), %eax
movl %eax, -0x1c(%rbp)
movl -0x1c(%rbp), %eax
popq %rbp
retq
nopw (%rax,%rax)
// File: brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::RACE(unsigned long, unsigned long)
RACE::RACE(size_t R, size_t range){
	// parameters: R = number of ACE repetitions
	// range = size of each ACE array 
	_R = R, 
	_range = range; 

	_sketch = new race_sketch_t[ _R*_range ](); 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x30, %rsp
movq %rdi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movq %rdx, -0x18(%rbp)
movq -0x8(%rbp), %rcx
movq %rcx, -0x20(%rbp)
movb $0x4d, 0x18(%rcx)
movb $0x1, 0x19(%rcx)
movq -0x10(%rbp), %rax
movq %rax, (%rcx)
movq -0x18(%rbp), %rax
movq %rax, 0x8(%rcx)
movq (%rcx), %rax
imulq 0x8(%rcx), %rax
movl $0x4, %ecx
mulq %rcx
movq %rax, %rdi
seto %cl
movq $-0x1, %rax
testb $0x1, %cl
cmovneq %rax, %rdi
movq %rdi, -0x30(%rbp)
callq 0x2030
movq -0x30(%rbp), %rdx
movq %rax, %rdi
movq %rdi, -0x28(%rbp)
xorl %esi, %esi
callq 0x2100
movq -0x28(%rbp), %rcx
movq -0x20(%rbp), %rax
movq %rcx, 0x10(%rax)
addq $0x30, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::add(int*)
void RACE::add(int *hashes){
	/* 
	Input: A set of R integer hash values, one hash value for each ACE repetition
	*/
	#pragma omp parallel for
	for (size_t r = 0; r < _R; r++){
		size_t index = hashes[r] % _range; 
		_sketch[r*_range + index] = _sketch[r*_range + index] + 1; 
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x28(%rbp)
movq $0x0, -0x18(%rbp)
movq -0x28(%rbp), %rcx
movq -0x18(%rbp), %rax
cmpq (%rcx), %rax
jae 0x349e
movq -0x28(%rbp), %rsi
movq -0x10(%rbp), %rax
movq -0x18(%rbp), %rcx
movslq (%rax,%rcx,4), %rax
xorl %ecx, %ecx
movl %ecx, %edx
divq 0x8(%rsi)
movq %rdx, -0x20(%rbp)
movq 0x10(%rsi), %rax
movq -0x18(%rbp), %rcx
imulq 0x8(%rsi), %rcx
addq -0x20(%rbp), %rcx
movl (%rax,%rcx,4), %edx
addl $0x1, %edx
movq 0x10(%rsi), %rax
movq -0x18(%rbp), %rcx
imulq 0x8(%rsi), %rcx
addq -0x20(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
movq -0x18(%rbp), %rax
addq $0x1, %rax
movq %rax, -0x18(%rbp)
jmp 0x343c
popq %rbp
retq
// File: brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::query_and_add(int*)
double RACE::query_and_add(int *hashes){
	/* 
	Input: A set of R integer hash values, one hash value for each ACE repetition
	Performs: Update to RACE array
	Returns: query value of RACE array 
	*/
	double mean = 0; 
	for (size_t r = 0; r < _R; r++){
		size_t index = hashes[r] % _range; 
		mean = mean + _sketch[r*_range + index]; 
		_sketch[r*_range + index] = _sketch[r*_range + index] + 1; 
	}
	mean = mean / _R; 
	return mean; 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x30(%rbp)
xorps %xmm0, %xmm0
movsd %xmm0, -0x18(%rbp)
movq $0x0, -0x20(%rbp)
movq -0x30(%rbp), %rcx
movq -0x20(%rbp), %rax
cmpq (%rcx), %rax
jae 0x355b
movq -0x30(%rbp), %rsi
movq -0x10(%rbp), %rax
movq -0x20(%rbp), %rcx
movslq (%rax,%rcx,4), %rax
movq 0x8(%rsi), %rcx
xorl %edx, %edx
divq %rcx
movq %rdx, -0x28(%rbp)
movsd -0x18(%rbp), %xmm0
movq 0x8(%rsi), %rdx
movq 0x10(%rsi), %rax
movq -0x20(%rbp), %rcx
imulq %rdx, %rcx
movq -0x28(%rbp), %rdx
addq %rdx, %rcx
movl (%rax,%rcx,4), %eax
cvtsi2sd %rax, %xmm1
addsd %xmm1, %xmm0
movsd %xmm0, -0x18(%rbp)
movq 0x10(%rsi), %rax
movq -0x20(%rbp), %rcx
imulq 0x8(%rsi), %rcx
addq -0x28(%rbp), %rcx
movl (%rax,%rcx,4), %edx
addl $0x1, %edx
movq 0x10(%rsi), %rax
movq -0x20(%rbp), %rcx
imulq 0x8(%rsi), %rcx
addq -0x28(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
movq -0x20(%rbp), %rax
addq $0x1, %rax
movq %rax, -0x20(%rbp)
jmp 0x34c4
movq -0x30(%rbp), %rax
movsd -0x18(%rbp), %xmm0
movq (%rax), %xmm1
movaps 0x2c31(%rip), %xmm2     # 0x61a0
punpckldq %xmm2, %xmm1    # xmm1 = xmm1[0],xmm2[0],xmm1[1],xmm2[1]
movapd 0x2c35(%rip), %xmm2     # 0x61b0
subpd %xmm2, %xmm1
movaps %xmm1, %xmm2
unpckhpd %xmm1, %xmm1            # xmm1 = xmm1[1,1]
addsd %xmm2, %xmm1
divsd %xmm1, %xmm0
movsd %xmm0, -0x18(%rbp)
movsd -0x18(%rbp), %xmm0
popq %rbp
retq
nopw (%rax,%rax)
// File: brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::query(int*)
double RACE::query(int *hashes){

	double mean = 0; 
	for (size_t r = 0; r < _R; r++){
		size_t index = hashes[r] % _range;
		mean = mean + _sketch[r*_range + index]; 
	}
	mean = mean / _R; 
	return mean; 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x30(%rbp)
xorps %xmm0, %xmm0
movsd %xmm0, -0x18(%rbp)
movq $0x0, -0x20(%rbp)
movq -0x30(%rbp), %rcx
movq -0x20(%rbp), %rax
cmpq (%rcx), %rax
jae 0x36ad
movq -0x30(%rbp), %rcx
movq -0x10(%rbp), %rax
movq -0x20(%rbp), %rdx
movslq (%rax,%rdx,4), %rax
movq 0x8(%rcx), %rcx
xorl %edx, %edx
divq %rcx
movq -0x30(%rbp), %rax
movq %rdx, -0x28(%rbp)
movsd -0x18(%rbp), %xmm0
movq 0x8(%rax), %rdx
movq 0x10(%rax), %rax
movq -0x20(%rbp), %rcx
imulq %rdx, %rcx
movq -0x28(%rbp), %rdx
addq %rdx, %rcx
movl (%rax,%rcx,4), %eax
cvtsi2sd %rax, %xmm1
addsd %xmm1, %xmm0
movsd %xmm0, -0x18(%rbp)
movq -0x20(%rbp), %rax
addq $0x1, %rax
movq %rax, -0x20(%rbp)
jmp 0x3644
movq -0x30(%rbp), %rax
movsd -0x18(%rbp), %xmm0
movq (%rax), %xmm1
movaps 0x2adf(%rip), %xmm2     # 0x61a0
punpckldq %xmm2, %xmm1    # xmm1 = xmm1[0],xmm2[0],xmm1[1],xmm2[1]
movapd 0x2ae3(%rip), %xmm2     # 0x61b0
subpd %xmm2, %xmm1
movaps %xmm1, %xmm2
unpckhpd %xmm1, %xmm1            # xmm1 = xmm1[1,1]
addsd %xmm2, %xmm1
divsd %xmm1, %xmm0
movsd %xmm0, -0x18(%rbp)
movsd -0x18(%rbp), %xmm0
popq %rbp
retq
nopl (%rax)
// File: aalto-speech[P]ftk/test/emtest.cc
// Function: includes_path(std::vector<std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>>, std::allocator<std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>>>>&, std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>>&)
bool includes_path(vector<vector<string> > &all_paths, vector<string> &path) {
    for (unsigned int i=0; i<all_paths.size(); i++) {
        if (path.size() != all_paths[i].size()) continue;
        unsigned int j=0;
        for (; j<path.size(); j++)
            if (all_paths[i][j] != path[j]) break;
        if (j==path.size()) return true;
    }
    return false;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x50, %rsp
movq %rdi, -0x10(%rbp)
movq %rsi, -0x18(%rbp)
movl $0x0, -0x1c(%rbp)
movl -0x1c(%rbp), %eax
movq %rax, -0x28(%rbp)
movq -0x10(%rbp), %rdi
callq 0x2ede0
movq %rax, %rcx
movq -0x28(%rbp), %rax
cmpq %rcx, %rax
jae 0x888ee
movq -0x18(%rbp), %rdi
callq 0xcba0
movq %rax, -0x30(%rbp)
movq -0x10(%rbp), %rdi
movl -0x1c(%rbp), %eax
movl %eax, %esi
callq 0xbfdc0
movq %rax, %rdi
callq 0xcba0
movq %rax, %rcx
movq -0x30(%rbp), %rax
cmpq %rcx, %rax
je 0x8884b
jmp 0x888e0
movl $0x0, -0x20(%rbp)
movl -0x20(%rbp), %eax
movq %rax, -0x38(%rbp)
movq -0x18(%rbp), %rdi
callq 0xcba0
movq %rax, %rcx
movq -0x38(%rbp), %rax
cmpq %rcx, %rax
jae 0x888bc
movq -0x10(%rbp), %rdi
movl -0x1c(%rbp), %eax
movl %eax, %esi
callq 0xbfdc0
movq %rax, %rdi
movl -0x20(%rbp), %eax
movl %eax, %esi
callq 0xcbf0
movq %rax, -0x40(%rbp)
movq -0x18(%rbp), %rdi
movl -0x20(%rbp), %eax
movl %eax, %esi
callq 0xcbf0
movq -0x40(%rbp), %rdi
movq %rax, %rsi
callq 0x27520
testb $0x1, %al
jne 0x888ad
jmp 0x888af
jmp 0x888bc
jmp 0x888b1
movl -0x20(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x20(%rbp)
jmp 0x88852
movl -0x20(%rbp), %eax
movq %rax, -0x48(%rbp)
movq -0x18(%rbp), %rdi
callq 0xcba0
movq %rax, %rcx
movq -0x48(%rbp), %rax
cmpq %rcx, %rax
jne 0x888de
movb $0x1, -0x1(%rbp)
jmp 0x888f2
jmp 0x888e0
movl -0x1c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x1c(%rbp)
jmp 0x887f7
movb $0x0, -0x1(%rbp)
movb -0x1(%rbp), %al
andb $0x1, %al
addq $0x50, %rsp
popq %rbp
retq
nopl (%rax)
// File: nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/Hypercube/../../utils/math_utils.h
// Function: our_math::compute_w_value(std::vector<std::vector<double, std::allocator<double>>, std::allocator<std::vector<double, std::allocator<double>>>>, int)
inline double compute_w_value(std::vector<std::vector<double>>feature_vectors, int n_images) {
		// Initialize the BF class
		BruteForce<double> bf_instant(n_images, feature_vectors.at(1).size(), feature_vectors);
		int sum_result = 0;
		for (int i = 0; i < n_images; i++) {
			list<pair<int, double>> kBF = bf_instant.kNeighboursBF(feature_vectors.at(i), 2);
			// ge the second element of the list, as the first is the vector itself
			int distance_from_nn = kBF.back().second;
			sum_result += distance_from_nn;
		}
		return sum_result / (n_images * 1.0);
	}

// Assembly:
subq $0xc8, %rsp
movq %rdi, 0x18(%rsp)
movq %rdi, 0xc0(%rsp)
movl %esi, 0xbc(%rsp)
movl 0xbc(%rsp), %eax
movl %eax, 0x20(%rsp)
movl $0x1, %esi
callq 0x6640
movq %rax, %rdi
callq 0x3f20
movq 0x18(%rsp), %rsi
movl %eax, 0x24(%rsp)
leaq 0x80(%rsp), %rdi
movq %rdi, 0x28(%rsp)
callq 0x6540
movl 0x20(%rsp), %esi
movl 0x24(%rsp), %edx
movq 0x28(%rsp), %rcx
leaq 0x98(%rsp), %rdi
callq 0x6d20
jmp 0x63df
leaq 0x80(%rsp), %rdi
callq 0x3570
movl $0x0, 0x70(%rsp)
movl $0x0, 0x6c(%rsp)
movl 0x6c(%rsp), %eax
cmpl 0xbc(%rsp), %eax
jge 0x64dc
movq 0x18(%rsp), %rdi
movslq 0x6c(%rsp), %rsi
callq 0x6640
movq %rax, 0x10(%rsp)
jmp 0x6423
movq 0x10(%rsp), %rsi
leaq 0x38(%rsp), %rdi
callq 0x4560
jmp 0x6434
leaq 0x50(%rsp), %rdi
leaq 0x98(%rsp), %rsi
leaq 0x38(%rsp), %rdx
movl $0x2, %ecx
callq 0x7c40
jmp 0x6452
leaq 0x38(%rsp), %rdi
callq 0x3510
leaq 0x50(%rsp), %rdi
callq 0x8a30
cvttsd2si 0x8(%rax), %eax
movl %eax, 0x34(%rsp)
movl 0x34(%rsp), %eax
addl 0x70(%rsp), %eax
movl %eax, 0x70(%rsp)
leaq 0x50(%rsp), %rdi
callq 0x89b0
movl 0x6c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x6c(%rsp)
jmp 0x63fc
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x3570
jmp 0x6529
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
jmp 0x651c
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
leaq 0x38(%rsp), %rdi
callq 0x3510
jmp 0x651c
cvtsi2sdl 0x70(%rsp), %xmm0
cvtsi2sdl 0xbc(%rsp), %xmm1
movsd 0xbce5(%rip), %xmm2     # 0x121d8
mulsd %xmm2, %xmm1
divsd %xmm1, %xmm0
movsd %xmm0, 0x8(%rsp)
leaq 0x98(%rsp), %rdi
callq 0x89c0
movsd 0x8(%rsp), %xmm0
addq $0xc8, %rsp
retq
leaq 0x98(%rsp), %rdi
callq 0x89c0
movq 0x78(%rsp), %rdi
callq 0x23c0
nopw %cs:(%rax,%rax)
nopl (%rax)
// File: nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/Hypercube/../../utils/../algorithms/Search/BruteForce/headers/../../../common/metrics.h
// Function: double metrics::ManhatanDistance<double>(std::vector<double, std::allocator<double>>, std::vector<double, std::allocator<double>>, int)
T ManhatanDistance(std::vector<T>x, std::vector<T>y, int dim) {
		T result{};
		for (int i = 0; i < dim; i++) {
			result += std::abs(x[i] - y[i]);
		}
		return result;
	}

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x10(%rsp)
movq %rsi, 0x18(%rsp)
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movl %edx, 0x34(%rsp)
xorps %xmm0, %xmm0
movsd %xmm0, 0x28(%rsp)
movl $0x0, 0x24(%rsp)
movl 0x24(%rsp), %eax
cmpl 0x34(%rsp), %eax
jge 0x9357
movq 0x10(%rsp), %rdi
movslq 0x24(%rsp), %rsi
callq 0x9600
movq 0x18(%rsp), %rdi
movsd (%rax), %xmm0
movsd %xmm0, 0x8(%rsp)
movslq 0x24(%rsp), %rsi
callq 0x9600
movsd 0x8(%rsp), %xmm0
subsd (%rax), %xmm0
callq 0x95e0
addsd 0x28(%rsp), %xmm0
movsd %xmm0, 0x28(%rsp)
movl 0x24(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x24(%rsp)
jmp 0x92fd
movsd 0x28(%rsp), %xmm0
addq $0x48, %rsp
retq
nopw %cs:(%rax,%rax)
nopl (%rax)
// File: nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/Hypercube/../../algorithms/Search/Hypercube/headers/hypercube.h
// Function: Hypercube<double>::hash_to_hypercube(std::vector<double, std::allocator<double>>)
int hash_to_hypercube(std::vector<T> vec) {
			// store the string produced
			std::string bucket_str;
			// hash k times
			int k = 0;
			for (std::list<lsh::HashFunction>::iterator it = hash_fns.begin(); 
				it != hash_fns.end(); it++) {
					// hash with the i-th hash fn
					int res = it->hash(vec);
					// find its pre-maped result of a coin flip
					bool bit = flipped_coins.at(k)[res];
					// append the 0/1 value to the string
					bucket_str += to_string(bit);
			}
			// convert the string into an integer
			return (int)std::bitset<32>(bucket_str).to_ulong();
		}

// Assembly:
subq $0xe8, %rsp
movq %rsi, 0x30(%rsp)
movq %rdi, 0xe0(%rsp)
movq %rsi, 0xd8(%rsp)
movq 0xe0(%rsp), %rax
movq %rax, 0x38(%rsp)
leaq 0xb8(%rsp), %rdi
callq 0x2280
movq 0x38(%rsp), %rdi
movl $0x0, 0xb4(%rsp)
addq $0x58, %rdi
callq 0x10360
movq %rax, 0xa8(%rsp)
movq 0x38(%rsp), %rdi
addq $0x58, %rdi
callq 0xb800
movq %rax, 0xa0(%rsp)
leaq 0xa8(%rsp), %rdi
leaq 0xa0(%rsp), %rsi
callq 0x10390
testb $0x1, %al
jne 0xa14b
jmp 0xa279
leaq 0xa8(%rsp), %rdi
callq 0x103b0
movq 0x30(%rsp), %rsi
movq %rax, 0x28(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x4560
jmp 0xa171
movq 0x28(%rsp), %rdi
leaq 0x80(%rsp), %rsi
callq 0x103d0
movl %eax, 0x24(%rsp)
jmp 0xa189
leaq 0x80(%rsp), %rdi
callq 0x3510
movl 0x24(%rsp), %eax
movq 0x38(%rsp), %rdi
movl %eax, 0x9c(%rsp)
addq $0x70, %rdi
movslq 0xb4(%rsp), %rsi
callq 0x10640
movq %rax, 0x18(%rsp)
jmp 0xa1be
movq 0x18(%rsp), %rdi
leaq 0x9c(%rsp), %rsi
callq 0x10680
movq %rax, 0x10(%rsp)
jmp 0xa1d7
movq 0x10(%rsp), %rax
movb (%rax), %al
andb $0x1, %al
movb %al, 0x73(%rsp)
movzbl 0x73(%rsp), %esi
andl $0x1, %esi
leaq 0x50(%rsp), %rdi
callq 0x106b0
jmp 0xa1f8
leaq 0xb8(%rsp), %rdi
leaq 0x50(%rsp), %rsi
callq 0x2240
jmp 0xa20c
leaq 0x50(%rsp), %rdi
callq 0x2110
leaq 0xa8(%rsp), %rdi
xorl %esi, %esi
callq 0x107f0
movq %rax, 0x48(%rsp)
jmp 0xa117
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
jmp 0xa2c4
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
leaq 0x80(%rsp), %rdi
callq 0x3510
jmp 0xa2c4
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x78(%rsp)
movl %eax, 0x74(%rsp)
leaq 0x50(%rsp), %rdi
callq 0x2110
jmp 0xa2c4
xorl %eax, %eax
movl %eax, %edx
leaq 0x40(%rsp), %rdi
leaq 0xb8(%rsp), %rsi
callq 0x10820
jmp 0xa291
leaq 0x40(%rsp), %rdi
callq 0x10890
movq %rax, 0x8(%rsp)
jmp 0xa2a2
movq 0x8(%rsp), %rax
movl %eax, 0x4(%rsp)
leaq 0xb8(%rsp), %rdi
callq 0x2110
movl 0x4(%rsp), %eax
addq $0xe8, %rsp
retq
leaq 0xb8(%rsp), %rdi
callq 0x2110
movq 0x78(%rsp), %rdi
callq 0x23c0
nopl (%rax,%rax)
// File: nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/Hypercube/../../utils/math_utils.h
// Function: our_math::modular_power(int, int, int)
inline int modular_power(int x, int y, int p) {
		int res = 1;

		x = x % p;
		while (y > 0) {
			if (y & 1)
				res = (res * x) % p;
			y = y >> 1;
			x = (x * x) % p;
		}
		return res;
	}

// Assembly:
movl %edi, -0x4(%rsp)
movl %esi, -0x8(%rsp)
movl %edx, -0xc(%rsp)
movl $0x1, -0x10(%rsp)
movl -0x4(%rsp), %eax
cltd
idivl -0xc(%rsp)
movl %edx, -0x4(%rsp)
cmpl $0x0, -0x8(%rsp)
jle 0xa7d4
movl -0x8(%rsp), %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0xa7b6
movl -0x10(%rsp), %eax
imull -0x4(%rsp), %eax
cltd
idivl -0xc(%rsp)
movl %edx, -0x10(%rsp)
movl -0x8(%rsp), %eax
sarl %eax
movl %eax, -0x8(%rsp)
movl -0x4(%rsp), %eax
imull -0x4(%rsp), %eax
cltd
idivl -0xc(%rsp)
movl %edx, -0x4(%rsp)
jmp 0xa791
movl -0x10(%rsp), %eax
retq
nopl (%rax)
// File: nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/Hypercube/../../utils/math_utils.h
// Function: our_math::hamming_distance(int, int)
inline int hamming_distance(int a, int b) {
		int x = a ^ b;
		int bits = 0;

		while (x > 0) {
			bits += x & 1;
			x >>= 1;
		}

		return bits;
	}

// Assembly:
movl %edi, -0x4(%rsp)
movl %esi, -0x8(%rsp)
movl -0x4(%rsp), %eax
xorl -0x8(%rsp), %eax
movl %eax, -0xc(%rsp)
movl $0x0, -0x10(%rsp)
cmpl $0x0, -0xc(%rsp)
jle 0x11b0e
movl -0xc(%rsp), %eax
andl $0x1, %eax
addl -0x10(%rsp), %eax
movl %eax, -0x10(%rsp)
movl -0xc(%rsp), %eax
sarl %eax
movl %eax, -0xc(%rsp)
jmp 0x11aec
movl -0x10(%rsp), %eax
retq
nopw %cs:(%rax,%rax)
nopl (%rax)