LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/StateManager.cpp
// Function: StateManager::swapValuesByPositions(unsigned long, int, int)
PackedState StateManager :: swapValuesByPositions(PackedState state, int blankPosition, int neighborPosition) {
    
    uint64_t maskToGetNeighborValue = INITIAL_MASK;
    maskToGetNeighborValue = maskToGetNeighborValue << 4*neighborPosition;
    uint64_t neighborValue = state & maskToGetNeighborValue;
    
    // cleans neighbor position
    uint64_t maskToCleanNeighborPosition = ~maskToGetNeighborValue;
    uint64_t stateWithBlankNeighbor = state & maskToCleanNeighborPosition;
    
    // moves neighbor value to blank position
    if (neighborPosition < blankPosition)
        neighborValue = neighborValue << 4*(blankPosition-neighborPosition);
    else
        neighborValue = neighborValue >> 4*(neighborPosition-blankPosition);

    return stateWithBlankNeighbor | neighborValue;
}

// Assembly:
movl %ecx, %r8d
movq 0x8(%rdi), %rax
leal (,%r8,4), %ecx
shlq %cl, %rax
movq %rax, %rdi
andq %rsi, %rdi
movl %r8d, %ecx
subl %edx, %ecx
jge 0x3676
subl %r8d, %edx
shll $0x2, %edx
movl %edx, %ecx
shlq %cl, %rdi
jmp 0x367c
shll $0x2, %ecx
shrq %cl, %rdi
notq %rax
andq %rsi, %rax
orq %rdi, %rax
retq
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/StateManager.cpp
// Function: StateManager::produceNextPackedStates(unsigned long)
vector<PackedState> StateManager :: produceNextPackedStates(PackedState state) {
    vector<PackedState> neighbors;
    int blankPosition = getBlankTilePosition(state);
    short numberOfTiles = getNumberOfTiles(state);
    vector<int> neighborsPositions = getNeighborsPositions(numberOfTiles, blankPosition);
    for (auto neighboorPosition : neighborsPositions) {
        PackedState neighbor = swapValuesByPositions(state, blankPosition, neighboorPosition);
        neighbors.insert(neighbors.begin(), neighbor);
    }
    return neighbors;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
movq %rsi, %rdi
movq %rdx, %rsi
callq 0x33f0
movl %eax, %ebp
movq 0x8(%r15), %rax
movq %rax, %rcx
shlq $0x38, %rcx
shlq $0x34, %rax
orq %rcx, %rax
andq %r14, %rax
cmpq $0x1, %rax
movl $0x4, %edx
sbbl $0x0, %edx
leaq 0x10(%rsp), %rdi
movl %ebp, %ecx
callq 0x3796
movq 0x10(%rsp), %r13
movq 0x18(%rsp), %r12
cmpq %r12, %r13
je 0x3748
movl (%r13), %esi
movq 0x8(%r15), %rax
leal (,%rsi,4), %ecx
shlq %cl, %rax
movq %rax, %rdx
andq %r14, %rdx
movl %esi, %ecx
subl %ebp, %ecx
jge 0x371e
movl %ebp, %ecx
subl %esi, %ecx
shll $0x2, %ecx
shlq %cl, %rdx
jmp 0x3724
shll $0x2, %ecx
shrq %cl, %rdx
notq %rax
andq %r14, %rax
orq %rdx, %rax
movq %rax, 0x8(%rsp)
movq (%rbx), %rsi
movq %rbx, %rdi
leaq 0x8(%rsp), %rdx
callq 0x3b68
addq $0x4, %r13
jmp 0x36ef
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x3757
callq 0x2200
movq %rbx, %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
jmp 0x3780
movq %rax, %r14
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x3780
callq 0x2200
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x378d
callq 0x2200
movq %r14, %rdi
callq 0x2330
nop
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/StateManager.cpp
// Function: StateManager::getNeighborsPositions(short, int)
vector<int> StateManager :: getNeighborsPositions(short numberOfTiles, int blankPosition) {
    vector<int> neighbors;
    if (blankPosition < numberOfTiles*(numberOfTiles-1))
        neighbors.insert(neighbors.begin(), blankPosition+numberOfTiles);
    if ((blankPosition+1) % numberOfTiles != 0)
        neighbors.insert(neighbors.begin(), blankPosition+1);
    if (blankPosition % numberOfTiles != 0)
        neighbors.insert(neighbors.begin(), blankPosition-1);
    if (blankPosition > numberOfTiles-1)
        neighbors.insert(neighbors.begin(), blankPosition-numberOfTiles);
    return neighbors;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movl %ecx, %r14d
movl %edx, %r15d
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
leal -0x1(%r15), %eax
imull %edx, %eax
cmpl %ecx, %eax
jle 0x37d7
movq (%rbx), %rsi
leal (%r15,%r14), %eax
leaq 0xc(%rsp), %rdx
movl %eax, (%rdx)
movq %rbx, %rdi
callq 0x42d8
leal 0x1(%r14), %ecx
movl %ecx, %eax
cltd
idivl %r15d
testl %edx, %edx
je 0x37f7
movq (%rbx), %rsi
leaq 0xc(%rsp), %rdx
movl %ecx, (%rdx)
movq %rbx, %rdi
callq 0x42d8
movl %r14d, %eax
cltd
idivl %r15d
testl %edx, %edx
je 0x3818
movq (%rbx), %rsi
leal -0x1(%r14), %eax
leaq 0xc(%rsp), %rdx
movl %eax, (%rdx)
movq %rbx, %rdi
callq 0x42d8
subl %r15d, %r14d
jl 0x3830
movq (%rbx), %rsi
leaq 0xc(%rsp), %rdx
movl %r14d, (%rdx)
movq %rbx, %rdi
callq 0x42d8
movq %rbx, %rax
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
jmp 0x3843
jmp 0x3843
jmp 0x3843
movq %rax, %r14
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x3853
callq 0x2200
movq %r14, %rdi
callq 0x2330
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/StateManager.cpp
// Function: getValueAtPosition(unsigned long, int)
int getValueAtPosition(PackedState state, int position) {
    uint64_t maskToGetNeighborValue = 15;
    maskToGetNeighborValue = maskToGetNeighborValue << 4*position;
    uint64_t neighborValue = state & maskToGetNeighborValue;
    neighborValue = neighborValue >> 4*(position);
    return (int) neighborValue;
}

// Assembly:
leal (,%rsi,4), %ecx
movl $0xf, %eax
shlq %cl, %rax
andq %rdi, %rax
shrq %cl, %rax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/StateManager.cpp
// Function: StateManager::calculateNeighborHeuristic(State, int, int)
int StateManager :: calculateNeighborHeuristic(State state, int blankPosition, int newPosition) {
    int valAtNewPosition = getValueAtPosition(state.value, newPosition);
    int expectedPosition = heuristicCalculator.getExpectedPositionForNumber(valAtNewPosition);
    int diffToSubtract = heuristicCalculator.calculateDistanceBeetwenPositions(newPosition, expectedPosition);
    int diffToAdd = heuristicCalculator.calculateDistanceBeetwenPositions(blankPosition, expectedPosition);
    return state.heuristic - diffToSubtract + diffToAdd;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movl %r8d, %r14d
movl %ecx, %ebp
movq %rdx, %rbx
leal (,%r14,4), %ecx
movl $0xf, %eax
shlq %cl, %rax
movq %rdi, %r15
andq %rax, %rsi
shrq %cl, %rsi
addq $0x10, %r15
movq %r15, %rdi
callq 0x2fb6
movl %eax, %r12d
movq %r15, %rdi
movl %r14d, %esi
movl %eax, %edx
callq 0x2fc0
movl %eax, %r14d
movq %r15, %rdi
movl %ebp, %esi
movl %r12d, %edx
callq 0x2fc0
movzbl %bl, %ecx
subl %r14d, %ecx
addl %ecx, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, %r14
movq %rdx, %r15
movq %rdi, %rbx
leaq 0x18(%rsp), %rax
movq %rax, -0x10(%rax)
leaq 0x3dce(%rip), %rdx      # 0x9081
leaq 0x8(%rsp), %rdi
movq %rdx, %rsi
callq 0x2d2c
xorps %xmm0, %xmm0
movups %xmm0, (%rbx)
movq %rbx, (%rsp)
movq $0x0, 0x10(%rbx)
movq 0x8(%r15), %rbp
testq %rbp, %rbp
je 0x533b
movq (%r15), %r13
xorl %ebx, %ebx
leaq 0x3d9a(%rip), %r15      # 0x9081
leaq 0x8(%rsp), %r12
movb (%r13,%rbx), %al
cmpb (%r14), %al
jne 0x5328
movq %r12, %rdi
movq %r15, %rsi
callq 0x2060
testl %eax, %eax
je 0x5333
movq (%rsp), %rdi
movq %r12, %rsi
callq 0x5c8e
movq 0x10(%rsp), %rdx
movq %r12, %rdi
xorl %esi, %esi
movq %r15, %rcx
xorl %r8d, %r8d
callq 0x22e0
jmp 0x5333
movsbl %al, %esi
movq %r12, %rdi
callq 0x21c0
incq %rbx
cmpq %rbx, %rbp
jne 0x52ec
leaq 0x3d3f(%rip), %rsi      # 0x9081
leaq 0x8(%rsp), %rdi
callq 0x2060
testl %eax, %eax
je 0x535e
leaq 0x8(%rsp), %rsi
movq (%rsp), %rdi
callq 0x5c8e
movq 0x8(%rsp), %rdi
leaq 0x18(%rsp), %rax
cmpq %rax, %rdi
je 0x5372
callq 0x2200
movq (%rsp), %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x5387
movq %rax, %r14
movq (%rsp), %rdi
callq 0x5ccc
movq 0x8(%rsp), %rdi
leaq 0x18(%rsp), %rax
cmpq %rax, %rdi
je 0x53a7
callq 0x2200
movq %r14, %rdi
callq 0x2330
nop
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %rbx
movq %rsi, %rbx
leaq 0x3de5(%rip), %rsi      # 0x91a0
movq %rbx, %rdi
callq 0x2060
testl %eax, %eax
je 0x541c
leaq 0x3dd7(%rip), %rsi      # 0x91a5
movq %rbx, %rdi
callq 0x2060
testl %eax, %eax
je 0x5420
leaq 0x3dca(%rip), %rsi      # 0x91ab
movq %rbx, %rdi
callq 0x2060
testl %eax, %eax
je 0x5427
leaq 0x3dbe(%rip), %rsi      # 0x91b2
movq %rbx, %rdi
callq 0x2060
testl %eax, %eax
je 0x542e
leaq 0x3db1(%rip), %rsi      # 0x91b8
movq %rbx, %rdi
callq 0x2060
movl %eax, %ecx
xorl %eax, %eax
negl %ecx
sbbl %eax, %eax
orl $0x4, %eax
jmp 0x5433
xorl %eax, %eax
jmp 0x5433
movl $0x1, %eax
jmp 0x5433
movl $0x2, %eax
jmp 0x5433
movl $0x3, %eax
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/camargodev[P]n-tile-puzzle/src/InputReader.cpp
// Function: InputReader::parseStates(int, char**, bool)
vector<UnpackedState> InputReader :: parseStates(int argc, char** argv, bool isTxt) {
    string input = parseStatesToString(argc, argv, isTxt);
    vector<string> strStates;
    if(isTxt){
        strStates = split(input, '\n');
    }
    else{
        strStates = split(input, ',');
    }
    vector<UnpackedState> states;
    for (auto state : strStates) 
        states.push_back(getStateFromString(state));
    return states;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa8, %rsp
movl %r8d, %ebp
movq %rdi, 0x8(%rsp)
leaq 0x88(%rsp), %rdi
callq 0x5436
xorps %xmm0, %xmm0
movaps %xmm0, 0x30(%rsp)
movq $0x0, 0x40(%rsp)
leaq 0x50(%rsp), %rcx
testl %ebp, %ebp
je 0x5934
movb $0xa, (%rcx)
leaq 0x10(%rsp), %rdi
leaq 0x88(%rsp), %rdx
callq 0x528c
leaq 0x30(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x5d3c
jmp 0x5958
movb $0x2c, (%rcx)
leaq 0x10(%rsp), %rdi
leaq 0x88(%rsp), %rdx
callq 0x528c
leaq 0x30(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x5d3c
leaq 0x10(%rsp), %rdi
callq 0x5ccc
xorps %xmm0, %xmm0
movq 0x8(%rsp), %rax
movups %xmm0, (%rax)
movq $0x0, 0x10(%rax)
movq 0x30(%rsp), %rbx
movq 0x38(%rsp), %r14
cmpq %r14, %rbx
je 0x5a16
leaq 0x20(%rsp), %r13
leaq 0x78(%rsp), %rbp
leaq 0x68(%rsp), %r15
leaq 0x50(%rsp), %r12
movq %r13, 0x10(%rsp)
movq (%rbx), %rsi
movq 0x8(%rbx), %rdx
addq %rsi, %rdx
leaq 0x10(%rsp), %rdi
callq 0x2c9c
movq %rbp, 0x68(%rsp)
movq 0x10(%rsp), %rsi
movq 0x18(%rsp), %rdx
addq %rsi, %rdx
movq %r15, %rdi
callq 0x2c9c
movq %r12, %rdi
movq %r15, %rdx
callq 0x5696
movq 0x8(%rsp), %rdi
movq %r12, %rsi
callq 0x5e84
movq %r12, %rdi
callq 0x2c16
movq 0x68(%rsp), %rdi
cmpq %rbp, %rdi
je 0x59fe
callq 0x2200
movq 0x10(%rsp), %rdi
cmpq %r13, %rdi
je 0x5a0d
callq 0x2200
addq $0x20, %rbx
cmpq %r14, %rbx
jne 0x599c
leaq 0x30(%rsp), %rdi
callq 0x5ccc
leaq 0x98(%rsp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x5a36
callq 0x2200
movq 0x8(%rsp), %rax
addq $0xa8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x5a4f
movq %rax, %r14
leaq 0x10(%rsp), %rdi
callq 0x5ccc
jmp 0x5aa9
jmp 0x5a60
movq %rax, %r14
jmp 0x5aa9
movq %rax, %r14
jmp 0x5a9f
movq %rax, %r14
jmp 0x5a90
movq %rax, %r14
jmp 0x5a81
movq %rax, %r14
leaq 0x50(%rsp), %rdi
callq 0x2c16
movq 0x68(%rsp), %rdi
cmpq %rbp, %rdi
je 0x5a90
callq 0x2200
movq 0x10(%rsp), %rdi
cmpq %r13, %rdi
je 0x5a9f
callq 0x2200
movq 0x8(%rsp), %rdi
callq 0x2c56
leaq 0x30(%rsp), %rdi
callq 0x5ccc
leaq 0x98(%rsp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x5ac9
callq 0x2200
movq %r14, %rdi
callq 0x2330
nop
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, %r14
movl %edx, %ebp
movq %rsi, %r15
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
leaq 0x10(%rsp), %rax
movq %rax, -0x10(%rax)
leaq 0x3578(%rip), %rdx      # 0x9081
movq %rsp, %rdi
movq %rdx, %rsi
callq 0x2d2c
movslq %ebp, %rax
movq -0x8(%r14,%rax,8), %r12
leaq 0x30(%rsp), %r13
movq %r13, -0x10(%r13)
movq (%rsp), %rsi
movq 0x8(%rsp), %rdx
addq %rsi, %rdx
leaq 0x20(%rsp), %rdi
callq 0x2c9c
leaq 0x20(%rsp), %rdi
movq %r12, %rsi
callq 0x2370
movq %rsp, %rdi
leaq 0x20(%rsp), %r12
movq %r12, %rsi
callq 0x2250
movq (%r12), %rdi
cmpq %r13, %rdi
je 0x5b66
callq 0x2200
leaq 0x3654(%rip), %rsi      # 0x91c1
movq %rsp, %rdi
movl $0x4, %ecx
xorl %edx, %edx
callq 0x2320
movq %rax, %r12
movslq (%r15), %rax
movq (%r14,%rax,8), %rsi
leaq 0x20(%rsp), %rdi
leaq 0x40(%rsp), %rdx
callq 0x20a0
leaq 0x20(%rsp), %r13
movq %r13, %rsi
callq 0x53b0
movl %eax, 0x18(%rbx)
movq (%r13), %rdi
leaq 0x30(%rsp), %rax
cmpq %rax, %rdi
je 0x5bb8
callq 0x2200
xorl %r8d, %r8d
cmpq $-0x1, %r12
setne %r8b
leaq 0x40(%rsp), %rdi
movq %r15, %rsi
movl %ebp, %edx
movq %r14, %rcx
callq 0x58ce
xorps %xmm0, %xmm0
leaq 0x20(%rsp), %rdi
movaps %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
movups (%rbx), %xmm0
movq 0x10(%rbx), %rax
leaq 0x40(%rsp), %r14
movaps (%r14), %xmm1
movups %xmm1, (%rbx)
movq 0x10(%r14), %rcx
movq %rcx, 0x10(%rbx)
movq 0x10(%rdi), %rcx
movq %rax, 0x10(%rdi)
movaps (%rdi), %xmm1
movaps %xmm0, (%rdi)
movaps %xmm1, (%r14)
movq %rcx, 0x10(%r14)
callq 0x2c56
movq %r14, %rdi
callq 0x2c56
movq (%rsp), %rdi
leaq 0x10(%rsp), %rax
cmpq %rax, %rdi
je 0x5c39
callq 0x2200
movq %rbx, %rax
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x5c63
jmp 0x5c63
movq %rax, %r14
movq 0x20(%rsp), %rdi
cmpq %r13, %rdi
je 0x5c66
callq 0x2200
jmp 0x5c66
movq %rax, %r14
movq (%rsp), %rdi
leaq 0x10(%rsp), %rax
cmpq %rax, %rdi
je 0x5c7e
callq 0x2200
jmp 0x5c7e
movq %rax, %r14
movq %rbx, %rdi
callq 0x2c56
movq %r14, %rdi
callq 0x2330
// File: /workspace/github_cpp_makefile_star2_O1/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, (%rdi)
movq %rdx, 0x8(%rdi)
movb %cl, 0x10(%rdi)
movl %r8d, 0x14(%rdi)
retq
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movl %ecx, %ebp
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, 0x10(%rsp)
leaq 0x30(%rsp), %rdi
movw $0x0, (%rdi)
movq $0xf, 0x8(%rdi)
callq 0x3136
testb %al, %al
je 0x84ab
movb $0x1, %bpl
xorl %r13d, %r13d
jmp 0x8538
testl %ebp, %ebp
jle 0x8523
movq 0x10(%rsp), %rax
movq (%rax), %rdi
callq 0x4678
leaq 0x18(%rsp), %r13
leaq 0x30(%rsp), %rsi
movq %r13, %rdi
movq %r15, %rdx
callq 0x3686
movq (%r13), %r12
movq 0x8(%r13), %rbx
cmpq %rbx, %r12
je 0x8527
decl %ebp
movl %ebp, 0xc(%rsp)
movq (%r12), %rsi
movb $0x1, %al
cmpq %r14, %rsi
je 0x8512
movq 0x10(%rsp), %rdi
movq %r15, %rdx
movl 0xc(%rsp), %ecx
callq 0x846a
movl %eax, %ebp
movq %rdx, %r13
xorb $0x1, %al
movl %ebp, %ecx
andb $0x1, %cl
movzbl %cl, %ecx
addq %rcx, %r13
testb $0x1, %al
je 0x8529
addq $0x8, %r12
cmpq %rbx, %r12
jne 0x84e4
xorl %ebp, %ebp
jmp 0x8529
xorl %ebp, %ebp
jmp 0x8538
xorl %ebp, %ebp
movq 0x18(%rsp), %rdi
testq %rdi, %rdi
je 0x8538
callq 0x2200
movl %ebp, %eax
movq %r13, %rdx
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x18(%rsp), %rdi
testq %rdi, %rdi
je 0x855e
callq 0x2200
movq %rbx, %rdi
callq 0x2330
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x20, %rsp
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x8(%rsp), %r12
movw $0x0, (%r12)
movq $0xf, 0x8(%r12)
movq (%rsi), %rdi
callq 0x46a2
movq (%r14), %r13
movq %r12, %rdi
movq %r15, %rsi
callq 0x38d8
movq %r13, %rdi
movl %eax, %esi
callq 0x46b8
xorl %r12d, %r12d
movq %r14, %rdi
movq %r15, %rsi
xorl %edx, %edx
movl %r12d, %ecx
callq 0x846a
incl %r12d
testb $0x1, %al
je 0x85b4
movq (%r14), %rdi
movl %edx, %esi
callq 0x46b2
movq (%r14), %rdi
callq 0x4680
movq (%r14), %rax
movq 0x30(%rax), %rcx
movq %rcx, 0x30(%rbx)
movups (%rax), %xmm0
movups 0x10(%rax), %xmm1
movups 0x20(%rax), %xmm2
movups %xmm2, 0x20(%rbx)
movups %xmm1, 0x10(%rbx)
movups %xmm0, (%rbx)
movq %rbx, %rax
addq $0x20, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/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, (%rdi)
movq %rcx, 0x8(%rdi)
movb %r8b, 0x10(%rdi)
movl $0xffffffff, 0x14(%rdi) # imm = 0xFFFFFFFF
retq
// File: /workspace/github_cpp_makefile_star2_O1/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:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x50(%rsp), %rdi
movw $0x0, (%rdi)
movq $0xf, 0x8(%rdi)
movq %rdx, %rsi
callq 0x38d8
movslq %eax, %r12
movq (%r14), %rdi
callq 0x46a2
movq (%r14), %rdi
movl %r12d, %esi
callq 0x46b8
movq (%r14), %rdi
movl %r12d, %esi
callq 0x46be
movzbl %r12b, %ebp
orl $0xff00, %ebp           # imm = 0xFF00
leaq 0x38(%rsp), %r13
cmpq $-0x1, %r12
je 0x8962
movq %r15, 0x20(%rsp)
movq %rbp, 0x28(%rsp)
movb $0x0, 0x30(%rsp)
movl $0xffffffff, 0x34(%rsp) # imm = 0xFFFFFFFF
movq 0x30(%rsp), %rax
movq %rax, 0x10(%rsp)
movups 0x20(%rsp), %xmm0
movups %xmm0, (%rsp)
movq %r13, %rdi
movq %r14, %rsi
xorl %edx, %edx
movl %r12d, %ecx
callq 0x867c
movq 0x48(%rsp), %r12
testb $0x1, 0x38(%rsp)
je 0x88ff
movq 0x40(%rsp), %rsi
movq (%r14), %rdi
callq 0x46b2
movq (%r14), %rdi
callq 0x4680
jmp 0x896f
movq (%r14), %rdi
movl $0x7fffffff, %esi       # imm = 0x7FFFFFFF
callq 0x46b2
movq (%r14), %rax
movq 0x30(%rax), %rcx
movq %rcx, 0x30(%rbx)
movups (%rax), %xmm0
movups 0x10(%rax), %xmm1
movups 0x20(%rax), %xmm2
movups %xmm2, 0x20(%rbx)
movups %xmm1, 0x10(%rbx)
movups %xmm0, (%rbx)
movq %rbx, %rax
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/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
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rcx, 0x18(%rsp)
movq %rdx, 0x10(%rsp)
movq %rdi, 0x30(%rsp)
cmpl $0x0, (%rdi)
jle 0x2586
movq %rsi, %r15
leaq 0x1(%rsi), %rax
movq %rax, 0x28(%rsp)
movq %rsi, %rax
notq %rax
movq %rax, 0x20(%rsp)
xorl %r13d, %r13d
movq 0x18(%rsp), %rax
movl $0x0, (%rax,%r13,4)
movq 0x10(%rsp), %rax
movslq 0x8(%rax), %rbx
cmpq %rbx, 0x28(%rsp)
jae 0x2572
movq 0x10(%rsp), %rax
movq (%rax), %rbp
addq 0x20(%rsp), %rbx
leal (%r13,%r13,2), %eax
movl %eax, 0xc(%rsp)
movl $0xffffffff, %r12d      # imm = 0xFFFFFFFF
movq %rbp, %rdi
movl %r15d, %esi
movl %r13d, %edx
callq 0x2ed0
cmpl %r12d, %eax
jae 0x256a
movl %eax, %r14d
movq %rbp, %rdi
movl %r15d, %esi
movl 0xc(%rsp), %edx
callq 0x2ed0
movq 0x18(%rsp), %rcx
movl %eax, (%rcx,%r13,4)
movl %r14d, %r12d
incq %rbp
decq %rbx
jne 0x2539
incq %r13
movq 0x30(%rsp), %rax
movslq (%rax), %rax
cmpq %rax, %r13
jl 0x2500
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nopl (%rax)
// File: /workspace/github_cpp_makefile_star2_O1/brc7[P]DiversitySampling/src/io.cpp
// Function: SequenceFeaturesPE(std::istream&, 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>>&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
bool SequenceFeaturesPE(std::istream& in1, std::istream& in2, std::string& sequence, std::string& chunk1, std::string& chunk2, std::string fastWhat){
    bool success1 = SequenceFeatures(in2, sequence, chunk2, fastWhat); 
    bool success2 = SequenceFeatures(in1, sequence, chunk1, fastWhat); 

    if (!success1){
        std::cerr<<"Error reading first "<<fastWhat<<" file"<<std::endl; 
        return false; 
    }
    if (!success2){
        std::cerr<<"Error reading second "<<fastWhat<<" file"<<std::endl; 
        return false; 
    }
    return (success1 && success2); 

}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %r9, %rbx
movq %r8, %r13
movq %rcx, 0x10(%rsp)
movq %rdx, %r15
movq %rsi, %rbp
movq %rdi, 0x8(%rsp)
leaq 0x48(%rsp), %r12
movq %r12, -0x10(%r12)
movq (%r9), %rsi
movq 0x8(%r9), %rdx
addq %rsi, %rdx
leaq 0x38(%rsp), %r14
movq %r14, %rdi
callq 0x2e3e
movq %rbp, %rdi
movq %r15, %rsi
movq %r13, %rdx
movq %r14, %rcx
callq 0x2598
movl %eax, %ebp
movq 0x38(%rsp), %rdi
cmpq %r12, %rdi
je 0x2bb0
movq 0x48(%rsp), %rsi
incq %rsi
callq 0x2190
leaq 0x28(%rsp), %r12
movq %r12, -0x10(%r12)
movq (%rbx), %rsi
movq 0x8(%rbx), %rdx
addq %rsi, %rdx
leaq 0x18(%rsp), %r14
movq %r14, %rdi
callq 0x2e3e
movq 0x8(%rsp), %rdi
movq %r15, %rsi
movq 0x10(%rsp), %rdx
movq %r14, %rcx
callq 0x2598
movl %eax, %r14d
movq 0x18(%rsp), %rdi
cmpq %r12, %rdi
je 0x2c00
movq 0x28(%rsp), %rsi
incq %rsi
callq 0x2190
testb %bpl, %bpl
je 0x2c25
movb $0x1, %al
testb %r14b, %r14b
jne 0x2c90
movq 0x53d9(%rip), %rdi      # 0x7ff0
leaq 0x255e(%rip), %rsi      # 0x517c
movl $0x15, %edx
jmp 0x2c38
movq 0x53c4(%rip), %rdi      # 0x7ff0
leaq 0x252e(%rip), %rsi      # 0x5161
movl $0x14, %edx
callq 0x21c0
movq (%rbx), %rsi
movq 0x8(%rbx), %rdx
movq 0x53a5(%rip), %rdi      # 0x7ff0
callq 0x21c0
movq %rax, %rbx
leaq 0x251c(%rip), %rsi      # 0x5176
movl $0x5, %edx
movq %rax, %rdi
callq 0x21c0
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2180
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2040
movq %rax, %rdi
callq 0x2120
xorl %eax, %eax
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x18(%rsp), %rdi
jmp 0x2cb1
movq %rax, %rbx
movq 0x38(%rsp), %rdi
cmpq %r12, %rdi
je 0x2cc2
movq (%r12), %rsi
incq %rsi
callq 0x2190
movq %rbx, %rdi
callq 0x22a0
// File: /workspace/github_cpp_makefile_star2_O1/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
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, %rbx
movq %rsi, %r12
movq %rdi, %r14
leaq 0x38(%rsp), %rbp
movq %rbp, -0x10(%rbp)
movq (%rcx), %rsi
movq 0x8(%rcx), %rdx
addq %rsi, %rdx
leaq 0x28(%rsp), %r13
movq %r13, %rdi
callq 0x2e3e
movq %r14, %rdi
movq %r12, %rsi
movq %rbx, %rdx
movq %r13, %rcx
callq 0x2598
movl %eax, %r12d
movq 0x28(%rsp), %rdi
cmpq %rbp, %rdi
je 0x2d2f
movq 0x38(%rsp), %rsi
incq %rsi
callq 0x2190
leaq 0x22ce(%rip), %rsi      # 0x5004
movq %r15, %rdi
callq 0x2080
testl %eax, %eax
movb %r12b, 0x7(%rsp)
je 0x2d65
leaq 0x29d7(%rip), %rsi      # 0x5725
movq %r15, %rdi
callq 0x2080
xorl %r13d, %r13d
testl %eax, %eax
sete %r13b
shll $0x2, %r13d
jmp 0x2d6b
movl $0x2, %r13d
leaq 0x18(%rsp), %rbp
movq %rbp, -0x10(%rbp)
movq $0x0, -0x8(%rbp)
movb $0x0, (%rbp)
incl %r13d
leaq 0x8(%rsp), %r15
leaq 0x2327(%rip), %r12      # 0x50b6
decl %r13d
je 0x2ddd
movq (%r14), %rax
movq -0x18(%rax), %rdi
testb $0x5, 0x20(%r14,%rdi)
jne 0x2ddd
addq %r14, %rdi
movl $0xa, %esi
callq 0x2180
movsbl %al, %edx
movq %r14, %rdi
movq %r15, %rsi
callq 0x22c0
movq 0x8(%rsp), %rsi
movq 0x10(%rsp), %rdx
movq %rbx, %rdi
callq 0x2090
movq %rbx, %rdi
movq %r12, %rsi
callq 0x22d0
jmp 0x2d8f
movq 0x8(%rsp), %rdi
cmpq %rbp, %rdi
je 0x2df4
movq 0x18(%rsp), %rsi
incq %rsi
callq 0x2190
movb 0x7(%rsp), %al
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x28(%rsp), %rdi
cmpq %rbp, %rdi
je 0x2e35
movq 0x38(%rsp), %rsi
jmp 0x2e2d
movq %rax, %rbx
movq 0x8(%rsp), %rdi
cmpq %rbp, %rdi
je 0x2e35
movq 0x18(%rsp), %rsi
incq %rsi
callq 0x2190
movq %rbx, %rdi
callq 0x22a0
nop
// File: /workspace/github_cpp_makefile_star2_O1/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 %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rdi, %r14
movw $0x14d, 0x18(%rdi)      # imm = 0x14D
movq %rsi, (%rdi)
movq %rdx, 0x8(%rdi)
imulq %rsi, %rbx
movq %rbx, %rax
shrq $0x3e, %rax
shlq $0x2, %rbx
xorl %ecx, %ecx
negq %rax
sbbq %rcx, %rcx
orq %rcx, %rbx
movq %rbx, %rdi
callq 0x2030
movq %rax, %r15
movq %rax, %rdi
xorl %esi, %esi
movq %rbx, %rdx
callq 0x20e0
movq %r15, 0x10(%r14)
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/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:
movq (%rdi), %rcx
testq %rcx, %rcx
je 0x3034
movq 0x8(%rdi), %r8
movq 0x10(%rdi), %rdi
xorl %r9d, %r9d
movslq (%rsi,%r9,4), %rax
xorl %edx, %edx
divq %r8
movq %r8, %rax
imulq %r9, %rax
leaq (%rdi,%rax,4), %rax
incl (%rax,%rdx,4)
incq %r9
cmpq %r9, %rcx
jne 0x3015
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/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:
movq (%rdi), %rcx
testq %rcx, %rcx
je 0x3082
movq 0x8(%rdi), %r8
movq 0x10(%rdi), %rdi
xorpd %xmm0, %xmm0
xorl %r9d, %r9d
movslq (%rsi,%r9,4), %rax
xorl %edx, %edx
divq %r8
movq %r8, %rax
imulq %r9, %rax
leaq (%rdi,%rax,4), %rax
movl (%rax,%rdx,4), %r10d
xorps %xmm1, %xmm1
cvtsi2sd %r10, %xmm1
addsd %xmm1, %xmm0
incl %r10d
movl %r10d, (%rax,%rdx,4)
incq %r9
cmpq %r9, %rcx
jne 0x304d
jmp 0x3086
xorpd %xmm0, %xmm0
movq %rcx, %xmm1
punpckldq 0x212d(%rip), %xmm1 # xmm1 = xmm1[0],mem[0],xmm1[1],mem[1]
subpd 0x2135(%rip), %xmm1     # 0x51d0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
addsd %xmm1, %xmm2
divsd %xmm2, %xmm0
retq
// File: /workspace/github_cpp_makefile_star2_O1/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:
movq (%rdi), %rcx
testq %rcx, %rcx
je 0x3124
movq 0x8(%rdi), %r8
movq 0x10(%rdi), %rdi
xorpd %xmm0, %xmm0
xorl %r9d, %r9d
movslq (%rsi,%r9,4), %rax
xorl %edx, %edx
divq %r8
movq %r8, %rax
imulq %r9, %rax
leaq (%rdi,%rax,4), %rax
movl (%rax,%rdx,4), %eax
xorps %xmm1, %xmm1
cvtsi2sd %rax, %xmm1
addsd %xmm1, %xmm0
incq %r9
cmpq %r9, %rcx
jne 0x30f7
jmp 0x3128
xorpd %xmm0, %xmm0
movq %rcx, %xmm1
punpckldq 0x208b(%rip), %xmm1 # xmm1 = xmm1[0],mem[0],xmm1[1],mem[1]
subpd 0x2093(%rip), %xmm1     # 0x51d0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
addsd %xmm1, %xmm2
divsd %xmm2, %xmm0
retq
// File: /workspace/github_cpp_makefile_star2_O1/brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::serialize(std::ostream&)
void RACE::serialize(std::ostream &out){
	/*
	Input: A BINARY ostream out. You can open a binary output stream
	with the flag: std::ios::binary | std::ios::out
	Format: (Big Endian) 
	magic_number (uint8_t); file_version_number (uint8_t); R (uint64_t); range (uint64_t);
	Then every element in the sketch, as a uint32_t
	*/

	// 0. Determine if system is big-endian or little-endian 
	// 1. Write magic numbers and parameters to file 
	// 2. For each element in sketch, cast element to standard-sized element 
	// 3. Depending on (1), bitflip so that it is big-endian (network order)
	// 4. Write to stream 

	// 1. Determine if system is big-endian or little-endian
	uint32_t n = 1; 
	bool is_little_endian = *(uint8_t*)(&n);

	// 0. Write magic number and file version. Dont worry about endianness, as these are bytes 
	out.write(reinterpret_cast <const char *>(&magic_number), sizeof(uint8_t));
	out.write(reinterpret_cast <const char *>(&file_version_number), sizeof(uint8_t));

	// 0. Write the parameters to the file 
	uint64_t sketch_param = _R; 
	if (is_little_endian)
		sketch_param = __builtin_bswap64(sketch_param);
    out.write(reinterpret_cast <char *>(&sketch_param), sizeof(uint64_t));
	
	sketch_param = _range; 
	if (is_little_endian)
		sketch_param = __builtin_bswap64(sketch_param);
    out.write(reinterpret_cast <char *>(&sketch_param), sizeof(uint64_t));

	// 2. For each element in sketch
	for (size_t r = 0; r < _R; r++){
		for (size_t i = 0; i < _range; i++){
			// 2. Cast element to standard-sized element
			uint32_t value = _sketch[r*_range + i];
			// 3. Depending on (1), bitflip so that it is big-endian (network order)
			if (is_little_endian)
				value = __builtin_bswap32(value);
			// 4. Write to stream 
			out.write(reinterpret_cast <char *>(&value), sizeof(uint32_t));
		}
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x18(%rdi), %rsi
movl $0x1, %edx
movq %rbx, %rdi
callq 0x2210
leaq 0x19(%r14), %rsi
movl $0x1, %edx
movq %rbx, %rdi
callq 0x2210
movq (%r14), %rax
bswapq %rax
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movl $0x8, %edx
movq %rbx, %rdi
movq %r15, %rsi
callq 0x2210
movq 0x8(%r14), %rax
bswapq %rax
movq %rax, (%r15)
movl $0x8, %edx
movq %rbx, %rdi
movq %r15, %rsi
callq 0x2210
cmpq $0x0, (%r14)
je 0x322b
xorl %r12d, %r12d
leaq 0xc(%rsp), %r15
xorl %r13d, %r13d
movq 0x8(%r14), %rax
testq %rax, %rax
je 0x321f
xorl %ebp, %ebp
imulq %r12, %rax
addq 0x10(%r14), %rax
movl (%rax,%rbp,4), %eax
bswapl %eax
movl %eax, 0xc(%rsp)
movl $0x4, %edx
movq %rbx, %rdi
movq %r15, %rsi
callq 0x2210
incq %rbp
movq 0x8(%r14), %rax
cmpq %rax, %rbp
jb 0x31f2
incq %r13
addq $0x4, %r12
cmpq (%r14), %r13
jb 0x31e7
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::deserialize(std::istream&)
void RACE::deserialize(std::istream& in){
  	/*   
	Input: A BINARY istream in. You can open a binary input stream
	with the flag: std::ios::binary | std::ios::in

	beware: frees sketch
	*/

	// 0. Determine if system is little-endian
	uint32_t n = 1;
	bool is_little_endian = *(uint8_t*)(&n);

	uint8_t magic, version;
	uint64_t R, range;

	in.read(reinterpret_cast<char *>(&magic), sizeof(uint8_t)); 
	in.read(reinterpret_cast<char *>(&version), sizeof(uint8_t)); 
	
	if (magic != magic_number)
		return;

	in.read(reinterpret_cast<char *>(&R), sizeof(uint64_t));
	in.read(reinterpret_cast<char *>(&range), sizeof(uint64_t));

	// fix endian-ness of parameters
	if (is_little_endian){
		R = __builtin_bswap64(R); 
		range = __builtin_bswap64(range);
	}

	_R = R; _range = range; 
	uint32_t* recovered_sketch = new uint32_t[_R*_range]; 

	// now read the sketch into recovered_sketch
	in.read(reinterpret_cast <char *>(recovered_sketch), _R*_range*sizeof(uint32_t));

	delete[] _sketch;
	_sketch = new unsigned int[_R *_range];

	for (size_t r = 0; r < _R; r++){
		for (size_t i = 0; i < _range; i++){
			uint32_t value = recovered_sketch[r*_range + i];
			// 3. Depending on (1), bitflip so that it is big-endian (network order)
			if (is_little_endian)
				value = __builtin_bswap32(value);
			// 4. Save to our sketch 
			_sketch[r*_range + i] = value;
		}
	}
	delete[] recovered_sketch; 
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r15
movq %rdi, %rbx
leaq 0x7(%rsp), %r14
movl $0x1, %edx
movq %rsi, %rdi
movq %r14, %rsi
callq 0x21f0
leaq 0x6(%rsp), %rsi
movl $0x1, %edx
movq %r15, %rdi
callq 0x21f0
movb (%r14), %al
cmpb 0x18(%rbx), %al
jne 0x337d
movabsq $0x3fffffffffffffff, %rbp # imm = 0x3FFFFFFFFFFFFFFF
leaq 0x10(%rsp), %r14
movl $0x8, %edx
movq %r15, %rdi
movq %r14, %rsi
callq 0x21f0
leaq 0x8(%rsp), %r12
movl $0x8, %edx
movq %r15, %rdi
movq %r12, %rsi
callq 0x21f0
movq (%r14), %rax
bswapq %rax
movq %rax, (%r14)
movq (%r12), %r13
bswapq %r13
movq %r13, (%r12)
movq %rax, (%rbx)
movq %r13, 0x8(%rbx)
imulq %rax, %r13
movq %r13, %rax
shrq $0x3e, %rax
shlq $0x2, %r13
xorl %edi, %edi
negq %rax
sbbq %rdi, %rdi
orq %r13, %rdi
callq 0x2030
movq %rax, %r14
movq %r15, %rdi
movq %rax, %rsi
movq %r13, %rdx
callq 0x21f0
movq 0x10(%rbx), %rdi
testq %rdi, %rdi
je 0x330e
callq 0x2200
movq (%rbx), %r15
movq 0x8(%rbx), %r12
movq %r12, %rax
imulq %r15, %rax
leaq (,%rax,4), %rcx
cmpq %rbp, %rax
movq $-0x1, %rdi
cmovbeq %rcx, %rdi
callq 0x2030
movq %rax, 0x10(%rbx)
testq %r15, %r15
je 0x3375
leaq (,%r12,4), %rcx
xorl %edx, %edx
movq %r14, %rsi
testq %r12, %r12
je 0x3367
xorl %edi, %edi
movl (%rsi,%rdi,4), %r8d
bswapl %r8d
movl %r8d, (%rax,%rdi,4)
incq %rdi
cmpq %rdi, %r12
jne 0x3354
incq %rdx
addq %rcx, %rsi
addq %rcx, %rax
cmpq %r15, %rdx
jne 0x334d
movq %r14, %rdi
callq 0x2200
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/brc7[P]DiversitySampling/src/RACE.cpp
// Function: RACE::pprint(std::ostream&, int, bool)
void RACE::pprint(std::ostream& out, int width, bool format){
	for (size_t r = 0; r < _R; r++){
		if (format)
			out << std::string((width+1)*_range + 1, '-') << std::endl; 
		for (size_t i = 0; i < _range; i++)
			out << '|' << std::setw(width) << _sketch[r*_range + i];
		out << '|' << std::endl; 
	}
	if (format)
		out << std::string((width+1)*_range + 1, '-') << std::endl; 
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movl %ecx, 0xc(%rsp)
movq %rdx, 0x30(%rsp)
movq %rsi, %rbx
movq %rdi, %r14
cmpq $0x0, (%rdi)
je 0x34f6
movq 0x30(%rsp), %rcx
leal 0x1(%rcx), %eax
cltq
movq %rax, 0x38(%rsp)
movslq %ecx, %r15
xorl %ebp, %ebp
leaq 0x10(%rsp), %r12
xorl %eax, %eax
movq %rax, 0x40(%rsp)
cmpb $0x0, 0xc(%rsp)
je 0x3456
movq 0x8(%r14), %rsi
imulq 0x38(%rsp), %rsi
incq %rsi
leaq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
movq %r12, %rdi
movl $0x2d, %edx
callq 0x21d0
movq 0x10(%rsp), %rsi
movq 0x18(%rsp), %rdx
movq %rbx, %rdi
callq 0x21c0
movq %rax, %r13
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r13, %rdi
movl $0xa, %esi
callq 0x2180
movsbl %al, %esi
movq %r13, %rdi
callq 0x2040
movq %rax, %rdi
callq 0x2120
movq 0x10(%rsp), %rdi
leaq 0x20(%rsp), %rax
cmpq %rax, %rdi
je 0x3456
movq 0x20(%rsp), %rsi
incq %rsi
callq 0x2190
cmpq $0x0, 0x8(%r14)
je 0x34a2
xorl %r13d, %r13d
movb $0x7c, 0x10(%rsp)
movl $0x1, %edx
movq %rbx, %rdi
movq %r12, %rsi
callq 0x21c0
movq (%rax), %rcx
movq -0x18(%rcx), %rcx
movq %r15, 0x10(%rax,%rcx)
movq 0x8(%r14), %rcx
imulq %rbp, %rcx
addq 0x10(%r14), %rcx
movl (%rcx,%r13,4), %esi
movq %rax, %rdi
callq 0x2110
incq %r13
cmpq 0x8(%r14), %r13
jb 0x3460
movb $0x7c, 0x10(%rsp)
movl $0x1, %edx
movq %rbx, %rdi
movq %r12, %rsi
callq 0x21c0
movq %rax, %r13
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r13, %rdi
movl $0xa, %esi
callq 0x2180
movsbl %al, %esi
movq %r13, %rdi
callq 0x2040
movq %rax, %rdi
callq 0x2120
movq 0x40(%rsp), %rax
incq %rax
addq $0x4, %rbp
cmpq (%r14), %rax
jb 0x33ce
cmpb $0x0, 0xc(%rsp)
je 0x357a
movq 0x30(%rsp), %rax
incl %eax
movslq %eax, %rsi
imulq 0x8(%r14), %rsi
incq %rsi
leaq 0x20(%rsp), %r14
movq %r14, -0x10(%r14)
leaq 0x10(%rsp), %rdi
movl $0x2d, %edx
callq 0x21d0
movq 0x10(%rsp), %rsi
movq 0x18(%rsp), %rdx
movq %rbx, %rdi
callq 0x21c0
movq %rax, %rbx
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2180
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2040
movq %rax, %rdi
callq 0x2120
movq 0x10(%rsp), %rdi
cmpq %r14, %rdi
je 0x357a
movq 0x20(%rsp), %rsi
incq %rsi
callq 0x2190
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x359a
movq %rax, %rbx
movq 0x10(%rsp), %rdi
cmpq %r14, %rdi
jne 0x35b1
jmp 0x35be
movq %rax, %rbx
jmp 0x35be
movq %rax, %rbx
movq 0x10(%rsp), %rdi
leaq 0x20(%rsp), %rax
cmpq %rax, %rdi
je 0x35be
movq 0x20(%rsp), %rsi
incq %rsi
callq 0x2190
movq %rbx, %rdi
callq 0x22a0
nop
// File: /workspace/github_cpp_makefile_star2_O1/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:
movq (%rdi), %rcx
movq 0x8(%rdi), %rdx
subq %rcx, %rdx
setne %al
je 0x42105
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
sarq $0x3, %rdx
movabsq $-0x5555555555555555, %rdi # imm = 0xAAAAAAAAAAAAAAAB
imulq %rdx, %rdi
movq (%rsi), %r12
movq 0x8(%rsi), %rdx
movq %rdx, -0x48(%rbp)
movq %rdx, %rsi
subq %r12, %rsi
movq %rsi, %rdx
sarq $0x5, %rdx
movq %rdx, -0x38(%rbp)
xorl %r15d, %r15d
movq %rcx, -0x58(%rbp)
movq %rdi, -0x50(%rbp)
movq %rsi, -0x40(%rbp)
leaq (%r15,%r15,2), %rdx
movq (%rcx,%rdx,8), %r14
movq 0x8(%rcx,%rdx,8), %rdx
subq %r14, %rdx
cmpq %rdx, %rsi
jne 0x420e8
movb %al, -0x29(%rbp)
cmpq %r12, -0x48(%rbp)
je 0x420d1
movl $0x1, %r13d
xorl %ebx, %ebx
movq %rbx, %rax
shlq $0x5, %rax
movq 0x8(%r14,%rax), %rdx
cmpq 0x8(%r12,%rax), %rdx
jne 0x420d3
testq %rdx, %rdx
je 0x420c3
leaq (%r14,%rax), %rcx
addq %r12, %rax
movq (%rax), %rsi
movq (%rcx), %rdi
callq 0x53e0
testl %eax, %eax
jne 0x420d3
movl %r13d, %ebx
incl %r13d
cmpq %rbx, -0x38(%rbp)
ja 0x42095
jmp 0x420d3
xorl %ebx, %ebx
cmpq %rbx, -0x38(%rbp)
movq -0x58(%rbp), %rcx
movb -0x29(%rbp), %al
movq -0x50(%rbp), %rdi
movq -0x40(%rbp), %rsi
je 0x420f7
incl %r15d
cmpq %r15, %rdi
seta %al
ja 0x4206f
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
andb $0x1, %al
retq
// File: /workspace/github_cpp_makefile_star2_O1/nikosgalanis[P]Vectors-Similarity-Search-and-Clustering/programs/common/io_utils.cc
// Function: parse_clustering_args(int, char**, char**, char**, char**, bool*, char**)
void parse_clustering_args(int argc, char* argv[], char** input,
	char** output, char** config, bool* complete, char** method) {
		// default arguments
		*complete = false;
		// parse through comand line arguments
		for (int i = 1; i < argc; i++) {
			if (!strcmp(argv[i], "-i")) {
				*input = strdup(argv[++i]);
			}
			if (!strcmp(argv[i], "-c")) {
				*config = strdup(argv[++i]);
			}	
			if (!strcmp(argv[i], "-o")) {
				*output = strdup(argv[++i]);
			}
			if (!strcmp(argv[i], "-m")) {
				*method = strdup(argv[++i]);
			}
			if (!strcmp(argv[i], "-complete")) {
				*complete = true;
			}
		}
		assert(*input && *config && *output && *method);
	}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %r8, 0x10(%rsp)
movq %rcx, 0x8(%rsp)
movq %rdx, 0x18(%rsp)
movq %r9, 0x20(%rsp)
movb $0x0, (%r9)
cmpl $0x2, %edi
jl 0x2d7c
movq %rsi, %r13
movl %edi, %ebp
movl $0x1, %r14d
leaq 0x549d(%rip), %r12      # 0x8136
leaq 0x5499(%rip), %rbx      # 0x8139
movslq %r14d, %r15
movq (%r13,%r15,8), %rdi
leaq 0x5481(%rip), %rsi      # 0x8130
callq 0x22d0
testl %eax, %eax
jne 0x2cce
leal 0x1(%r15), %r14d
movq 0x8(%r13,%r15,8), %rdi
callq 0x2420
movq 0x18(%rsp), %rcx
movq %rax, (%rcx)
movslq %r14d, %r15
movq (%r13,%r15,8), %rdi
leaq 0x5456(%rip), %rsi      # 0x8133
callq 0x22d0
testl %eax, %eax
jne 0x2cfc
leal 0x1(%r15), %r14d
movq 0x8(%r13,%r15,8), %rdi
callq 0x2420
movq 0x10(%rsp), %rcx
movq %rax, (%rcx)
movslq %r14d, %r15
movq (%r13,%r15,8), %rdi
leaq 0x531b(%rip), %rsi      # 0x8026
callq 0x22d0
testl %eax, %eax
jne 0x2d2a
leal 0x1(%r15), %r14d
movq 0x8(%r13,%r15,8), %rdi
callq 0x2420
movq 0x8(%rsp), %rcx
movq %rax, (%rcx)
movslq %r14d, %r15
movq (%r13,%r15,8), %rdi
movq %r12, %rsi
callq 0x22d0
testl %eax, %eax
jne 0x2d54
leal 0x1(%r15), %r14d
movq 0x8(%r13,%r15,8), %rdi
callq 0x2420
movq 0x60(%rsp), %rcx
movq %rax, (%rcx)
movslq %r14d, %rax
movq (%r13,%rax,8), %rdi
movq %rbx, %rsi
callq 0x22d0
testl %eax, %eax
jne 0x2d70
movq 0x20(%rsp), %rax
movb $0x1, (%rax)
incl %r14d
cmpl %ebp, %r14d
jl 0x2ca0
movq 0x18(%rsp), %rax
cmpq $0x0, (%rax)
je 0x2db7
movq 0x10(%rsp), %rax
cmpq $0x0, (%rax)
je 0x2db7
movq 0x8(%rsp), %rax
cmpq $0x0, (%rax)
je 0x2db7
movq 0x60(%rsp), %rax
cmpq $0x0, (%rax)
je 0x2db7
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x5385(%rip), %rdi      # 0x8143
leaq 0x528c(%rip), %rsi      # 0x8051
leaq 0x539f(%rip), %rcx      # 0x816b
movl $0xa0, %edx
callq 0x2160