LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: bool Graph::gatherNeighborsWithRemoved<std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int>>, std::vector<unsigned int, std::allocator<unsigned int>>>(unsigned int const&, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int>>&, std::vector<unsigned int, std::allocator<unsigned int>>&) const
bool gatherNeighborsWithRemoved(const uint32_t &node, Container &neighbors, ContainerRemoved &removedNeighbors) const {
        uint32_t pos = (!mapping ? node : idToPos->at(node));
        uint32_t nextNodeOffset = (pos == nodeIndex.size()-1 ? edgeBuffer->size() : nodeIndex[pos+1].offset);
        for (uint32_t offset = nodeIndex[pos].offset ; offset < nextNodeOffset ; offset++) {
            uint32_t nPos = (!mapping ? (*edgeBuffer)[offset] : idToPos->at((*edgeBuffer)[offset]));
            if (!nodeIndex[nPos].removed) {
                neighbors.insert(neighbors.end(), (*edgeBuffer)[offset]);
            } else {
                removedNeighbors.insert(removedNeighbors.end(), (*edgeBuffer)[offset]);
            }
        }
    }

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rcx, %rbx
movq %rdx, %r14
movq %rdi, %r15
cmpb $0x1, 0x3c(%rdi)
jne 0xa860
movq 0x40(%r15), %rdi
callq 0xb880
movq %rax, %rsi
movl (%rsi), %eax
movq (%r15), %rcx
imulq $0xc, %rax, %rax
movl (%rcx,%rax), %r13d
leaq 0x8(%r14), %r12
shlq $0x2, %r13
cmpb $0x0, 0x3c(%r15)
je 0xa891
movq 0x18(%r15), %rax
movq 0x40(%r15), %rdi
movq (%rax), %rsi
addq %r13, %rsi
callq 0xb880
jmp 0xa89b
movq 0x18(%r15), %rax
movq (%rax), %rax
addq %r13, %rax
movl (%rax), %eax
movq (%r15), %rcx
imulq $0xc, %rax, %rax
cmpb $0x0, 0x8(%rcx,%rax)
je 0xa8c3
movq 0x8(%rbx), %rsi
movq 0x18(%r15), %rax
movq (%rax), %rdx
addq %r13, %rdx
movq %rbx, %rdi
callq 0xc434
jmp 0xa8d8
movq 0x18(%r15), %rax
movq (%rax), %rdx
addq %r13, %rdx
movq %r14, %rdi
movq %r12, %rsi
callq 0xb0bc
addq $0x4, %r13
jmp 0xa875
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: Graph::getFirstValidNeighborOffset(unsigned int const&) const
uint32_t getFirstValidNeighborOffset(const uint32_t &pos) const {
        bool validNeighbor = false;
        uint32_t offset = nodeIndex[pos].offset;
        uint32_t nextNodeOffset = (pos == nodeIndex.size()-1 ? edgeBuffer->size() : nodeIndex[pos+1].offset);
        for ( ; offset < nextNodeOffset ; offset++) {
            uint32_t nPos = (!mapping ? (*edgeBuffer)[offset] : idToPos->at((*edgeBuffer)[offset]));
            if (!nodeIndex[nPos].removed) {
                validNeighbor = true;
                break;
            }
        }
        return (validNeighbor ? offset : NONE);
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %rbx
movl (%rsi), %esi
movq (%rdi), %rcx
movq 0x8(%rdi), %rax
imulq $0xc, %rsi, %rdx
movl (%rcx,%rdx), %r14d
subq %rcx, %rax
pushq $0xc
popq %rdi
cqto
idivq %rdi
decq %rax
cmpq %rsi, %rax
jne 0xac76
movq 0x18(%rbx), %rdx
movq 0x8(%rdx), %rax
subq (%rdx), %rax
shrq $0x2, %rax
jmp 0xac7f
incl %esi
imulq $0xc, %rsi, %rax
movl (%rcx,%rax), %eax
movl %eax, %r15d
leaq (,%r14,4), %r12
pushq $-0x1
popq %rbp
cmpq %r15, %r14
jae 0xacd3
cmpb $0x0, 0x3c(%rbx)
je 0xacb0
movq 0x18(%rbx), %rax
movq 0x40(%rbx), %rdi
movq (%rax), %rsi
addq %r12, %rsi
callq 0xb880
movq (%rbx), %rcx
jmp 0xacba
movq 0x18(%rbx), %rax
movq (%rax), %rax
addq %r12, %rax
movl (%rax), %eax
imulq $0xc, %rax, %rax
cmpb $0x1, 0x8(%rcx,%rax)
jne 0xacd0
incq %r14
addq $0x4, %r12
jmp 0xac8d
movl %r14d, %ebp
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::run(unsigned int const&)
void Reductions::run(const uint32_t &theta) {
    if (!graph.nodeIndex.size()) {
        return;
    }
    switch(theta) {
        case 8:
        case 7:
        case 6:
            reduce6(theta);
            break;
        case 5:
            reduce5(theta);
            break;
        case 4:
            reduce4(theta);
            break;
        case 3:
            reduce3(theta);
            break;
        default:
            assert(false);
    }
}

// Assembly:
pushq %rax
movq (%rdi), %rax
movq 0x8(%rax), %rcx
cmpq (%rax), %rcx
je 0xdf79
movl (%rsi), %eax
addl $-0x3, %eax
cmpl $0x5, %eax
ja 0xdf8b
leaq 0x9966(%rip), %rcx      # 0x178d0
movslq (%rcx,%rax,4), %rax
addq %rcx, %rax
jmpq *%rax
popq %rax
jmp 0xdfa8
popq %rax
retq
popq %rax
jmp 0xe0b2
callq 0xe274
callq 0xe1d6
leaq 0x9956(%rip), %rdi      # 0x178e8
leaq 0x9955(%rip), %rsi      # 0x178ee
leaq 0x9961(%rip), %rcx      # 0x17901
pushq $0x21
popq %rdx
callq 0x2100
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce6(unsigned int const&)
void Reductions::reduce6(const uint32_t &theta) {
    bool firstTime = true;
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        removeUnconfinedNodes();
    } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r14
movq %rdi, %rbx
pushq $0x38
popq %r12
movq %r12, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
pushq $0x1
popq %r13
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movq %r12, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %r12
movq %rax, (%r12)
leaq 0x7(%rsp), %r13
movq %rbx, %rdi
callq 0xe2e4
movb $0x0, 0x7(%rsp)
movq %rbx, %rdi
movq %r14, %rsi
movq %r15, %rdx
movq %r12, %rcx
movq %r13, %r8
callq 0xe326
testb %al, %al
jne 0xe029
movq 0x10(%rsp), %r15
testq %r15, %r15
je 0xe060
movq %r15, %rdi
callq 0xad26
movq %r15, %rdi
callq 0x2160
movq 0x8(%rsp), %r15
testq %r15, %r15
je 0xe07a
movq %r15, %rdi
callq 0xad26
movq %r15, %rdi
callq 0x2160
movq %rbx, %rdi
callq 0xe3d6
movq %rbx, %rdi
movq %r14, %rsi
callq 0xe5f2
movq (%rbx), %rdi
addq $0x10, %rbx
movq %rbx, %rsi
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2c22
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce5(unsigned int const&)
void Reductions::reduce5(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            removeUnconfinedNodes();
        } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
    } while (removeShortFunnels(theta));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r14
movq %rdi, %rbx
pushq $0x38
popq %r12
movq %r12, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
pushq $0x1
popq %r13
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movq %r12, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %r12
movq %rax, (%r12)
leaq 0x7(%rsp), %r13
movq %rbx, %rdi
callq 0xe2e4
movb $0x0, 0x7(%rsp)
movq %rbx, %rdi
movq %r14, %rsi
movq %r15, %rdx
movq %r12, %rcx
movq %r13, %r8
callq 0xe326
testb %al, %al
jne 0xe133
movq %rbx, %rdi
movq %r14, %rsi
callq 0xe936
testb %al, %al
jne 0xe133
movq 0x10(%rsp), %r15
testq %r15, %r15
je 0xe179
movq %r15, %rdi
callq 0xad26
movq %r15, %rdi
callq 0x2160
movq 0x8(%rsp), %r15
testq %r15, %r15
je 0xe193
movq %r15, %rdi
callq 0xad26
movq %r15, %rdi
callq 0x2160
movq %rbx, %rdi
callq 0xe3d6
movq %rbx, %rdi
movq %r14, %rsi
callq 0xeee2
movq %rbx, %rdi
movq %r14, %rsi
callq 0xe5f2
movq (%rbx), %rdi
addq $0x10, %rbx
movq %rbx, %rsi
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2c22
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce4(unsigned int const&)
void Reductions::reduce4(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            do {
                do {
                    foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes);
                } while (removeDominatedNodes(theta));
            } while (removeUnconfinedNodes());
        } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes, true));
    } while (removeShortFunnels(theta));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %r14
pushq $0x38
popq %r15
movq %r15, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
pushq $0x1
popq %r13
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r12
movq %rax, (%r12)
movq %r15, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %rcx
movq %rax, (%rcx)
leaq 0x7(%rsp), %r8
movb $0x0, (%r8)
movq %r14, %rdi
movq %rbx, %rsi
movq %r12, %rdx
callq 0xe326
movq %r14, %rdi
movq %rbx, %rsi
callq 0xf5f2
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce3(unsigned int const&)
void Reductions::reduce3(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            do {
                do {
                    do {
                        removeDominatedNodes(theta);
                    } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
                } while (removeUnconfinedNodes());
            } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes, true));
        } while (removeShortFunnels(theta));
    } while (removeDesks());
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
pushq $0x38
popq %r15
movq %r15, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
pushq $0x1
popq %r12
movq %r12, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
movq %r15, %rdi
callq 0x2190
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r12, 0x8(%rax)
movups %xmm0, 0x10(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
movq %r14, %rdi
movq %rbx, %rsi
callq 0xf5f2
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeUnconfinedNodes()
bool Reductions::removeUnconfinedNodes() {
    //cout << "\n**Performing unconfined nodes reduction**" << endl;
    ReduceInfo old = reduceInfo;
    removeUnconfinedNodes2();
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        return false;
    }
    do {
        old = reduceInfo;
        removeUnconfinedNodes2();
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl 0x10(%rdi), %ebp
callq 0xffb4
movl 0x10(%rbx), %r14d
cmpl %r14d, %ebp
je 0xe315
movl %r14d, %r15d
movq %rbx, %rdi
callq 0xffb4
movl 0x10(%rbx), %eax
cmpl %eax, %r15d
movl %eax, %r15d
jne 0xe302
cmpl %r14d, %ebp
setne %al
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::foldCompleteKIndependentSets(unsigned int const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, bool const&)
bool Reductions::foldCompleteKIndependentSets(const uint32_t &theta, unordered_set<uint32_t> **oldCandidateNodes, unordered_set<uint32_t> **newCandidateNodes, const bool &theta4) {
    //cout << "\n**Performing K-Independent set folding reduction**" << endl;
    (*oldCandidateNodes)->clear();
    ReduceInfo old = reduceInfo;
    foldCompleteKIndependentSets2(theta, true, **oldCandidateNodes, **newCandidateNodes, theta4);
    swap(oldCandidateNodes, newCandidateNodes);
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        return false;
    }
    do {
        old = reduceInfo;
        foldCompleteKIndependentSets2(theta, false, **oldCandidateNodes, **newCandidateNodes, theta4);
        swap(oldCandidateNodes, newCandidateNodes);
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r12
movq %rdi, %r13
movq (%rdx), %rdi
callq 0xad42
movl 0x10(%r13), %ebp
leaq 0xf(%rsp), %rdx
movb $0x1, (%rdx)
movq (%r15), %rcx
movq (%r14), %r8
movq %r13, %rdi
movq %r12, %rsi
movq %rbx, %r9
callq 0xfb90
movq (%r15), %r8
movq (%r14), %rax
movq %rax, (%r15)
movq %r8, (%r14)
movl 0x10(%r13), %eax
movl %ebp, 0x14(%rsp)
movl %eax, 0x10(%rsp)
cmpl %eax, %ebp
je 0xe3bc
movl 0x10(%rsp), %ebp
movb $0x0, 0xe(%rsp)
movq (%r15), %rcx
movq %r13, %rdi
movq %r12, %rsi
leaq 0xe(%rsp), %rdx
movq %rbx, %r9
callq 0xfb90
movq (%r15), %r8
movq (%r14), %rax
movq %rax, (%r15)
movq %r8, (%r14)
movl 0x10(%r13), %eax
cmpl %eax, %ebp
movl %eax, %ebp
jne 0xe38b
movl 0x10(%rsp), %eax
cmpl %eax, 0x14(%rsp)
setne %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeEasyInstances(unsigned int const&)
void Reductions::removeEasyInstances(const uint32_t &theta) {
    vector<unordered_map<uint32_t, vector<uint32_t>* >::iterator> removedCCs;
    for (auto it = ccToNodes.begin() ; it != ccToNodes.end() ; it++) {
        vector<uint32_t> *cc = it->second;
            if (theta == 5 && cc->size() <= 28 || theta == 4 && cc->size() <= 23 || theta == 3 && cc->size() <= 20) {
                //cout << "Removing easy instance component " << it->first << "\n";
                findMis(*cc);
                graph.remove(*cc, reduceInfo, true);
                removedCCs.push_back(it);
            }
        }
    if (removedCCs.empty()) {
        //cout << "No nodes removed" << endl;
    } else {
        for (auto cc : removedCCs) {
            delete cc->second;
            ccToNodes.erase(cc);
        }
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %r14
movq %rdi, %r15
leaq 0x10(%rsp), %r12
andq $0x0, 0x10(%r12)
xorps %xmm0, %xmm0
movaps %xmm0, (%r12)
leaq 0x18(%rdi), %rbx
leaq 0x28(%rdi), %rax
leaq 0x10(%rdi), %r13
movq (%rax), %rax
movq %rax, 0x8(%rsp)
testq %rax, %rax
je 0xefb1
movq 0x10(%rax), %rbp
movl (%r14), %ecx
cmpl $0x3, %ecx
je 0xef5c
cmpl $0x4, %ecx
je 0xef4c
cmpl $0x5, %ecx
jne 0xef15
movq 0x8(%rbp), %rcx
subq (%rbp), %rcx
cmpq $0x74, %rcx
jae 0xef15
jmp 0xef6a
movq 0x8(%rbp), %rcx
subq (%rbp), %rcx
cmpq $0x60, %rcx
jae 0xef15
jmp 0xef6a
movq 0x8(%rbp), %rcx
subq (%rbp), %rcx
cmpq $0x53, %rcx
ja 0xef15
movq %r15, %rdi
movq %rbp, %rsi
callq 0xf7e4
movq (%r15), %rdi
movb $0x1, 0x7(%rsp)
movb $0x0, 0x6(%rsp)
movq %rbp, %rsi
movq %r13, %rdx
leaq 0x7(%rsp), %rcx
xorl %r8d, %r8d
leaq 0x6(%rsp), %r9
callq 0x9e48
movq %r12, %rdi
leaq 0x8(%rsp), %rsi
callq 0x105e0
movq 0x8(%rsp), %rax
jmp 0xef15
movq 0x10(%rsp), %r12
movq 0x18(%rsp), %r13
cmpq %r13, %r12
je 0xeff3
cmpq %r13, %r12
je 0xeff3
movq (%r12), %r14
movq 0x10(%r14), %r15
testq %r15, %r15
je 0xefda
movq %r15, %rdi
callq 0xb872
movq %r15, %rdi
callq 0x2160
movq %rbx, %rdi
movq %r14, %rsi
callq 0x10dde
addq $0x8, %r12
jmp 0xefc0
leaq 0x10(%rsp), %rdi
callq 0x10c92
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0xf010
jmp 0xf010
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x10c92
movq %rbx, %rdi
callq 0x22c0
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeUnconfinedNodes2()
void Reductions::removeUnconfinedNodes2() {
    Graph::GraphTraversal graphTraversal(graph);
    while (graphTraversal.curNode != NONE) {
        bool isUnconfined = false;
        unordered_set<uint32_t> extendedGrandchildren;
        graph.getExtendedGrandchildren(graphTraversal, extendedGrandchildren, &isUnconfined);
        if (isUnconfined || !graph.isIndependentSet(extendedGrandchildren)) {
            graph.remove(graphTraversal.curNode, reduceInfo);
        }
        graph.getNextNode(graphTraversal);
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdi, %rbx
movq (%rdi), %rsi
leaq 0x18(%rsp), %r14
movq %r14, %rdi
callq 0x270e
leaq 0x50(%rsp), %r13
leaq 0x10(%rbx), %rax
movq %rax, 0x10(%rsp)
xorl %r15d, %r15d
leaq 0x20(%rsp), %r12
leaq 0xe(%rsp), %rbp
cmpl $-0x1, 0x18(%rsp)
je 0x10088
movb %r15b, 0xf(%rsp)
movq %r13, 0x20(%rsp)
movq $0x1, 0x28(%rsp)
xorps %xmm0, %xmm0
movups %xmm0, -0x20(%r13)
movl $0x3f800000, 0x40(%rsp) # imm = 0x3F800000
movups %xmm0, -0x8(%r13)
movq (%rbx), %rdi
movb %r15b, 0xe(%rsp)
movq %r14, %rsi
movq %r12, %rdx
leaq 0xf(%rsp), %rcx
movq %rbp, %r8
callq 0x3868
cmpb $0x0, 0xf(%rsp)
jne 0x10058
movq (%rbx), %rdi
movq %r12, %rsi
xorl %edx, %edx
xorl %ecx, %ecx
callq 0x10702
testb %al, %al
jne 0x10070
movq (%rbx), %rdi
movb $0x0, 0xe(%rsp)
movq %r14, %rsi
movq 0x10(%rsp), %rdx
movq %rbp, %rcx
callq 0x2bae
movq (%rbx), %rdi
movq %r14, %rsi
callq 0x9cf8
movq %r12, %rdi
callq 0xad26
jmp 0xfff0
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x1009b
jmp 0x1009b
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xad26
movq %rbx, %rdi
callq 0x22c0
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::findClique(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>*, unsigned int const&)
bool Reductions::findClique(vector<Graph::GraphTraversal> &clique, vector<Graph::GraphTraversal> *previousClique, const uint32_t &cliqueSize) {
    Graph::GraphTraversal graphTraversal = clique[0];
    if (graphTraversal.curNode == NONE) {
        return false;
    }
    while (clique.size() < cliqueSize) {
        uint32_t neighbor = (*graph.edgeBuffer)[graphTraversal.curEdgeOffset];
        bool existsInPreviousClique = (previousClique == NULL ? false : find(neighbor, *previousClique));
        if (!existsInPreviousClique && !find(neighbor, clique) && isSubsetOfNeighbors(clique, neighbor, graph)) {
            graph.goToNode(neighbor, graphTraversal);
            clique.push_back(graphTraversal);
        } else {
            if (!Graph::advance(clique, graphTraversal, graph)) {
                return false;
            }
        }
    }
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, %rbx
movq (%rsi), %rax
movq (%rax), %rcx
movq %rcx, 0x10(%rsp)
cmpl $-0x1, %ecx
jne 0x100d8
xorl %eax, %eax
jmp 0x1018c
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0xc(%rsp), %r13
leaq 0x10(%rsp), %rbp
movq 0x8(%r15), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
movl (%rbx), %eax
cmpq %rax, %rcx
jae 0x1018a
movq (%r12), %rax
movq 0x18(%rax), %rax
movl 0x14(%rsp), %ecx
movq (%rax), %rax
movl (%rax,%rcx,4), %eax
movl %eax, 0xc(%rsp)
testq %r14, %r14
je 0x1012b
movq %r13, %rdi
movq %r14, %rsi
callq 0x10892
testb %al, %al
jne 0x10169
movq %r13, %rdi
movq %r15, %rsi
callq 0x10892
testb %al, %al
jne 0x10169
movq (%r12), %rdx
movq %r15, %rdi
movq %r13, %rsi
callq 0x108ba
testb %al, %al
je 0x10169
movq (%r12), %rdi
movq %r13, %rsi
movq %rbp, %rdx
callq 0x9dde
movq %r15, %rdi
movq %rbp, %rsi
callq 0x10968
jmp 0x10182
movq (%r12), %rdx
movq %r15, %rdi
movq %rbp, %rsi
xorl %ecx, %ecx
callq 0x10986
testb %al, %al
je 0x100d1
movq (%r15), %rax
jmp 0x100eb
movb $0x1, %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::findMisInComponent(std::vector<unsigned int, std::allocator<unsigned int>> const&)
void Reductions::findMisInComponent(const vector<uint32_t> &cc) {
    unordered_set<uint32_t> removedNodes;
    for (auto node : cc) {
        if (removedNodes.find(node) == removedNodes.end()) {
            mis.getMis().push_back(node);
            Graph::GraphTraversal graphTraversal(graph, node);
            while (graphTraversal.curEdgeOffset != NONE) {
                removedNodes.insert((*graph.edgeBuffer)[graphTraversal.curEdgeOffset]);
                graph.getNextEdge(graphTraversal);
            }
        }
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdi, %rbx
leaq 0x50(%rsp), %rax
movq %rax, -0x30(%rax)
movq $0x1, -0x28(%rax)
xorps %xmm0, %xmm0
movups %xmm0, -0x20(%rax)
movl $0x3f800000, -0x10(%rax) # imm = 0x3F800000
movups %xmm0, -0x8(%rax)
movq (%rsi), %rbp
movq 0x8(%rsi), %rax
movq %rax, 0x10(%rsp)
leaq 0x20(%rsp), %r14
leaq 0x4(%rsp), %rsi
leaq 0x18(%rsp), %r12
movl $0xffffffff, %r15d      # imm = 0xFFFFFFFF
cmpq 0x10(%rsp), %rbp
je 0x1026b
movl (%rbp), %eax
movl %eax, 0x4(%rsp)
movq %r14, %rdi
movq %rsi, %r13
callq 0xc35a
testq %rax, %rax
movq %r13, %rsi
jne 0x10265
movq %rbp, 0x8(%rsp)
movq 0x8(%rbx), %rdi
movq %rsi, %rbp
callq 0xa1ac
movq (%rbx), %rsi
movq %r12, %rdi
movq %rbp, %rdx
callq 0x2720
movq 0x8(%rsp), %rbp
movl 0x1c(%rsp), %esi
cmpq %r15, %rsi
je 0x10262
movq (%rbx), %rax
movq 0x18(%rax), %rax
shlq $0x2, %rsi
addq (%rax), %rsi
movq %r14, %rdi
callq 0xbc1a
movq (%rbx), %rdi
movq %r12, %rsi
callq 0xa1ca
jmp 0x10236
movq %r13, %rsi
addq $0x4, %rbp
jmp 0x101f1
leaq 0x20(%rsp), %rdi
callq 0xad26
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x1028a
jmp 0x1028a
jmp 0x1028a
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xad26
movq %rbx, %rdi
callq 0x22c0
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: bool Graph::isIndependentSet<std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>>(std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>> const&, unsigned int*, unsigned int*) const
bool isIndependentSet(const Container &set, uint32_t *node1 = NULL, uint32_t *node2 = NULL) const {
        for (auto i = set.begin() ; i != set.end() ; i++) {
            for (auto j = std::next(i, 1) ; j != set.end() ; j++) {
                if (edgeExists(*i, *j)) {
                    if (node1 != NULL && node2 != NULL) {
                        *node1 = *i;
                        *node2 = *j;
                    }
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, 0x10(%rsp)
movq %rdx, 0x8(%rsp)
movq %rsi, %rbx
movq %rdi, %r12
addq $0x10, %rbx
pushq $0x1
popq %rsi
movq (%rbx), %rbx
testq %rbx, %rbx
je 0x10791
movq %rbx, %rdi
movq %rsi, %r15
callq 0x111ce
movq %rax, %r13
leaq 0x8(%rbx), %rbp
testq %r13, %r13
je 0x10762
leaq 0x8(%r13), %r14
movq %r12, %rdi
movq %rbp, %rsi
movq %r14, %rdx
callq 0x9e3a
testb %al, %al
jne 0x10767
movq (%r13), %r13
jmp 0x10741
movq %r15, %rsi
jmp 0x10727
cmpq $0x0, 0x8(%rsp)
sete %al
cmpq $0x0, 0x10(%rsp)
sete %cl
orb %al, %cl
jne 0x10791
movl (%rbp), %eax
movq 0x8(%rsp), %rcx
movl %eax, (%rcx)
movl (%r14), %eax
movq 0x10(%rsp), %rcx
movl %eax, (%rcx)
testq %rbx, %rbx
sete %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::nodeDegreesEqualTo(std::vector<unsigned int, std::allocator<unsigned int>>&, unsigned int const&, Graph const&)
static bool nodeDegreesEqualTo(std::vector<uint32_t> &nodes, const uint32_t &degree, const Graph &graph) {
        for (auto node : nodes) {
            if (graph.getNodeDegree(node) != degree) {
                return false;
            }
        }
        return true;
    }

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rdx, %rbx
movq %rsi, %r14
movq (%rdi), %rcx
movq 0x8(%rdi), %r12
leaq 0xc(%rsp), %r15
movq %rcx, %r13
cmpq %r12, %rcx
je 0x1087d
movl (%r13), %eax
movl %eax, 0xc(%rsp)
movq %rbx, %rdi
movq %r15, %rsi
callq 0xa5ce
leaq 0x4(%r13), %rcx
cmpl (%r14), %eax
je 0x10859
cmpq %r12, %r13
sete %al
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::find(unsigned int const&, std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>> const&)
static bool find(const uint32_t &node, const std::vector<Graph::GraphTraversal> &set) {
        for (uint32_t i = 0 ; i < set.size() ; i++) {
            if (set[i].curNode == node) {
                return true;
            }
        }
        return false;
    }

// Assembly:
movq (%rsi), %rcx
movq 0x8(%rsi), %rax
subq %rcx, %rax
sarq $0x3, %rax
movl (%rdi), %edx
xorl %edi, %edi
movl %edi, %esi
cmpq %rsi, %rax
jbe 0x108b3
leal 0x1(%rsi), %edi
cmpl %edx, (%rcx,%rsi,8)
jne 0x108a4
cmpq %rsi, %rax
seta %al
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::isSubsetOfNeighbors(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>> const&, unsigned int const&, Graph const&)
static bool isSubsetOfNeighbors(const std::vector<Graph::GraphTraversal> &subset, const uint32_t &node, const Graph &graph) {
        uint32_t pos = graph.getPos(node);
        uint32_t count = subset.size();
        uint32_t nextNodeOffset = (pos == graph.nodeIndex.size()-1 ? graph.edgeBuffer->size() : graph.nodeIndex[pos+1].offset);
        for (uint32_t offset = graph.nodeIndex[pos].offset ; count && offset < nextNodeOffset ; offset++) {
            if (find((*graph.edgeBuffer)[offset], subset)) {
                count--;
            }
        }
        return !count;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rdi, %r14
movq %rdx, %rdi
callq 0x1064c
movq 0x8(%r14), %r15
subq (%r14), %r15
shrq $0x3, %r15
movl %eax, %ecx
movq (%rbx), %rsi
movq 0x8(%rbx), %rax
subq %rsi, %rax
pushq $0xc
popq %rdi
cqto
idivq %rdi
decq %rax
cmpq %rcx, %rax
jne 0x1090b
movq 0x18(%rbx), %rdx
movq 0x8(%rdx), %rax
subq (%rdx), %rax
shrq $0x2, %rax
jmp 0x10915
leal 0x1(%rcx), %eax
imulq $0xc, %rax, %rax
movl (%rsi,%rax), %eax
imulq $0xc, %rcx, %rcx
movl (%rsi,%rcx), %r12d
movl %eax, %r13d
leaq (,%r12,4), %rbp
testl %r15d, %r15d
je 0x10953
cmpq %r13, %r12
jae 0x10953
movq 0x18(%rbx), %rax
movq (%rax), %rdi
addq %rbp, %rdi
movq %r14, %rsi
callq 0x10892
movzbl %al, %eax
subl %eax, %r15d
incq %r12
addq $0x4, %rbp
jmp 0x10928
testl %r15d, %r15d
sete %al
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: Graph::advance(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, Graph::GraphTraversal&, Graph const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>*)
static bool advance(std::vector<Graph::GraphTraversal> &frontier, Graph::GraphTraversal &graphTraversal, const Graph &graph, std::unordered_set<uint32_t> *set = NULL) {
        bool validNeighbor = false;
        while(!validNeighbor) {
            graphTraversal = frontier.back();
            graph.getNextEdge(graphTraversal);
            frontier.back() = graphTraversal;
            if (graphTraversal.curEdgeOffset != NONE) {
                validNeighbor = true;
            } else {
                graphTraversal = frontier.back();
                if (set != NULL) {
                    set->erase(graphTraversal.curNode);
                }
                frontier.pop_back();
                if (frontier.empty()) {
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
xorl %r13d, %r13d
movl %r13d, %ebp
testb $0x1, %r13b
jne 0x10a0a
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
movq %r14, %rdi
movq %r15, %rsi
callq 0xa1ca
movq 0x8(%r12), %rax
movq (%r15), %rcx
movq %rcx, -0x8(%rax)
cmpl $-0x1, 0x4(%r15)
setne %r13b
jne 0x109a0
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
testq %rbx, %rbx
je 0x109f3
movq %rbx, %rdi
movq %r15, %rsi
callq 0xb93a
movq (%r12), %rax
movq 0x8(%r12), %rcx
addq $-0x8, %rcx
movq %rcx, 0x8(%r12)
cmpq %rcx, %rax
jne 0x109a0
andb $0x1, %bpl
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::SearchNode::SearchNode(Alg::SearchNode const&, unsigned int const&)
Alg::SearchNode::SearchNode(const SearchNode &searchNode, const uint32_t &parentNode) {
    id = NONE;
    theta = searchNode.theta;
    branchingRule = BranchingRule();
    graph = searchNode.graph;
    mis = searchNode.mis;
    reductions = new Reductions(graph, mis);
    parent = parentNode;
    leftChild = NONE;
    rightChild = NONE;
    finalMis = NULL;
    hasCut = false;
    cutIsDone = false;
    cut = searchNode.cut;
    c1 = searchNode.c1;
    c2 = searchNode.c2;
    actualComponent1 = searchNode.actualComponent1;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rdx, 0x18(%rsp)
movq %rsi, %r13
movq %rdi, %r12
leaq 0x8(%rdi), %rbp
movabsq $-0x100000000, %rax     # imm = 0xFFFFFFFF00000000
movq %rax, 0x8(%rdi)
orl $-0x1, 0x10(%rdi)
leaq 0x18(%rdi), %rax
movq %rax, 0x10(%rsp)
leaq 0x30(%rdi), %r14
andq $0x0, 0x60(%rdi)
xorps %xmm0, %xmm0
movups %xmm0, 0x50(%rdi)
movb $0x0, 0x6c(%rdi)
movups %xmm0, 0x70(%rdi)
leaq 0x80(%rdi), %r15
movups %xmm0, 0x18(%rdi)
movups %xmm0, 0x28(%rdi)
movups %xmm0, 0x38(%rdi)
movq %r15, %rdi
callq 0x12334
leaq 0x130(%r12), %rcx
leaq 0x160(%r12), %rax
movq %rax, 0x130(%r12)
movq $0x1, 0x138(%r12)
xorps %xmm0, %xmm0
movups %xmm0, 0x140(%r12)
movl $0x3f800000, 0x150(%r12) # imm = 0x3F800000
leaq 0x168(%r12), %rax
movq %rax, 0x8(%rsp)
movups %xmm0, 0x158(%r12)
movups %xmm0, 0x168(%r12)
movups %xmm0, 0x178(%r12)
movups %xmm0, 0x188(%r12)
orl $-0x1, (%r12)
leaq 0x180(%r12), %rax
movq %rax, (%rsp)
movl 0x4(%r13), %eax
movl %eax, 0x4(%r12)
leaq 0x30(%rsp), %rbx
movabsq $-0x100000000, %rax     # imm = 0xFFFFFFFF00000000
movq %rax, -0x10(%rbx)
orl $-0x1, -0x8(%rbx)
movups %xmm0, (%rbx)
andq $0x0, 0x10(%rbx)
leaq 0x20(%rsp), %rsi
movq %rbp, %rdi
movq %rcx, %rbp
callq 0x1237a
movq %rbx, %rdi
callq 0xb872
leaq 0x30(%r13), %rsi
movq %r14, %rdi
callq 0x25f2
leaq 0x80(%r13), %rsi
movq %r15, %rdi
callq 0x1239c
pushq $0x50
popq %rdi
callq 0x2190
movq %r14, (%rax)
movq %r15, 0x8(%rax)
andl $0x0, 0x10(%rax)
movq %rax, %rcx
addq $0x48, %rcx
movq %rcx, 0x18(%rax)
movq $0x1, 0x20(%rax)
xorps %xmm0, %xmm0
movups %xmm0, 0x28(%rax)
movl $0x3f800000, 0x38(%rax) # imm = 0x3F800000
movups %xmm0, 0x40(%rax)
movq %rax, 0x108(%r12)
movq 0x18(%rsp), %rax
movl (%rax), %eax
movl %eax, 0x110(%r12)
orq $-0x1, 0x114(%r12)
andq $0x0, 0x120(%r12)
xorl %eax, %eax
movb %al, 0x128(%r12)
movb %al, 0x199(%r12)
leaq 0x130(%r13), %rsi
movq %rbp, %rdi
callq 0xb2ce
leaq 0x168(%r13), %rsi
movq 0x8(%rsp), %rdi
callq 0x9be8
leaq 0x180(%r13), %rsi
movq (%rsp), %rdi
callq 0x9be8
movb 0x198(%r13), %al
movb %al, 0x198(%r12)
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq (%rsp), %rdi
callq 0xb872
movq 0x8(%rsp), %rdi
callq 0xb872
movq %rbp, %rdi
callq 0xad26
movq %r15, %rdi
callq 0x123d4
movq %r14, %rdi
callq 0x269e
movq 0x10(%rsp), %rdi
callq 0xb872
movq %rbx, %rdi
callq 0x22c0
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::SearchNode::handleCuts()
bool Alg::SearchNode::handleCuts() {
    bool connected;
    if (graph.getArticulationPoints(cut, c1, c2, actualComponent1, connected) || connected && (graph.getSeparatingPairs(cut, c1, c2, actualComponent1) || graph.getSeparatingTriplets(cut, c1, c2, actualComponent1))) {
        branchingRule.type = BranchingRule::Type::CUT;
        hasCut = true;
        return true;
    } else {
        return false;
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
leaq 0x30(%rdi), %r14
leaq 0x130(%rdi), %r15
leaq 0x168(%rdi), %r12
leaq 0x180(%rdi), %r13
leaq 0x198(%rdi), %rbp
leaq 0x7(%rsp), %r9
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x6114
testb %al, %al
je 0x11eed
movl $0x8, 0x8(%rbx)
movb $0x1, 0x128(%rbx)
movb $0x1, %al
jmp 0x11f26
cmpb $0x1, 0x7(%rsp)
jne 0x11f24
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x6f76
testb %al, %al
jne 0x11edb
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x8c4c
testb %al, %al
jne 0x11edb
xorl %eax, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::SearchNode::print() const
void Alg::SearchNode::print() const {
    cout << "Nodes: " << graph.getNodeCountWithEdges() <<
    "\nParent: " << (parent == NONE ? "NONE" : to_string(parent)) << "\nLeft: " << (leftChild == NONE ? "NONE" : to_string(leftChild)) <<
    "\nRight: " << (rightChild == NONE ? "NONE" : to_string(rightChild));
    if (finalMis != NULL) {
        cout << "\nMis: " << finalMis->size();
    }
    cout << "\n";
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x70, %rsp
movq %rdi, %r14
movq 0x10058(%rip), %rdi     # 0x21fd0
leaq 0x55e5(%rip), %rsi      # 0x17564
callq 0x2170
movq %rax, %rbx
leaq 0x30(%r14), %rdi
callq 0x6e32
movl %eax, %esi
movq %rbx, %rdi
callq 0x2110
leaq 0x5b14(%rip), %rsi      # 0x17ab5
movq %rax, %rdi
callq 0x2170
movq %rax, %r15
movl 0x110(%r14), %ebx
cmpl $-0x1, %ebx
je 0x11fc6
leaq 0x50(%rsp), %rdi
movl %ebx, %esi
callq 0x13644
jmp 0x11fdc
leaq 0x5b13(%rip), %rsi      # 0x17ae0
leaq 0x50(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x2080
leaq 0x50(%rsp), %rsi
movq %r15, %rdi
callq 0x2150
leaq 0x5acf(%rip), %rsi      # 0x17abf
movq %rax, %rdi
callq 0x2170
movq %rax, %r15
movl 0x114(%r14), %ebp
cmpl $-0x1, %ebp
je 0x12015
leaq 0x30(%rsp), %rdi
movl %ebp, %esi
callq 0x13644
jmp 0x1202b
leaq 0x5ac4(%rip), %rsi      # 0x17ae0
leaq 0x30(%rsp), %rdi
leaq 0xe(%rsp), %rdx
callq 0x2080
leaq 0x30(%rsp), %rsi
movq %r15, %rdi
callq 0x2150
leaq 0x5a88(%rip), %rsi      # 0x17ac7
movq %rax, %rdi
callq 0x2170
movq %rax, %r12
movl 0x118(%r14), %r15d
cmpl $-0x1, %r15d
je 0x12066
leaq 0x10(%rsp), %rdi
movl %r15d, %esi
callq 0x13644
jmp 0x1207c
leaq 0x5a73(%rip), %rsi      # 0x17ae0
leaq 0x10(%rsp), %rdi
leaq 0xd(%rsp), %rdx
callq 0x2080
leaq 0x10(%rsp), %rsi
movq %r12, %rdi
callq 0x2150
leaq 0x10(%rsp), %rdi
callq 0x22f8
cmpl $-0x1, %r15d
leaq 0x30(%rsp), %rdi
callq 0x22f8
cmpl $-0x1, %ebp
leaq 0x50(%rsp), %rdi
callq 0x22f8
cmpl $-0x1, %ebx
cmpq $0x0, 0x120(%r14)
je 0x120e8
movq 0xff0e(%rip), %rdi      # 0x21fd0
leaq 0x5a07(%rip), %rsi      # 0x17ad0
callq 0x2170
movq 0x120(%r14), %rcx
movq 0x8(%rcx), %rsi
subq (%rcx), %rsi
sarq $0x2, %rsi
movq %rax, %rdi
callq 0x2110
movq 0xfee1(%rip), %rdi      # 0x21fd0
leaq 0x5494(%rip), %rsi      # 0x1758a
callq 0x2170
addq $0x70, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
leaq 0x10(%rsp), %rdi
callq 0x22f8
jmp 0x1211a
movq %rax, %r14
cmpl $-0x1, %r15d
jmp 0x1212d
movq %rax, %r14
jmp 0x12137
movq %rax, %r14
jmp 0x12149
movq %rax, %r14
leaq 0x30(%rsp), %rdi
callq 0x22f8
cmpl $-0x1, %ebp
jmp 0x1213f
movq %rax, %r14
leaq 0x50(%rsp), %rdi
callq 0x22f8
cmpl $-0x1, %ebx
movq %r14, %rdi
callq 0x22c0
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::SearchNode::SearchNode(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, bool const&)
SearchNode(const std::string &inputFile, const bool &checkIndependentSet) : id(NONE), graph(inputFile, checkIndependentSet), reductions(new Reductions(graph, mis)), parent(NONE), leftChild(NONE), rightChild(NONE), finalMis(NULL), hasCut(false), cutIsDone(false) {
            uint32_t maxDegreeNode;
            graph.getMaxNodeDegree(maxDegreeNode, theta);
            if (theta > 8) {
                theta = 8;
            } else if (theta < 3) {
                theta = 3;
            }
        }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
orl $-0x1, (%rdi)
movabsq $-0x100000000, %rax     # imm = 0xFFFFFFFF00000000
movq %rax, 0x8(%rdi)
orl $-0x1, 0x10(%rdi)
xorps %xmm0, %xmm0
movups %xmm0, 0x18(%rdi)
andq $0x0, 0x28(%rdi)
leaq 0x30(%rdi), %r14
movq %r14, %rdi
callq 0x922e
leaq 0x80(%rbx), %r15
movq %r15, %rdi
callq 0x12334
pushq $0x50
popq %rdi
callq 0x2190
movq %r14, (%rax)
movq %r15, 0x8(%rax)
andl $0x0, 0x10(%rax)
movq %rax, %rcx
addq $0x48, %rcx
movq %rcx, 0x18(%rax)
pushq $0x1
popq %rcx
movq %rcx, 0x20(%rax)
xorps %xmm0, %xmm0
movups %xmm0, 0x28(%rax)
movl $0x3f800000, %edx       # imm = 0x3F800000
movl %edx, 0x38(%rax)
movups %xmm0, 0x40(%rax)
movq %rax, 0x108(%rbx)
orq $-0x1, 0x110(%rbx)
orl $-0x1, 0x118(%rbx)
andq $0x0, 0x120(%rbx)
xorl %eax, %eax
movb %al, 0x128(%rbx)
leaq 0x130(%rbx), %r13
leaq 0x160(%rbx), %rsi
movq %rsi, 0x130(%rbx)
movq %rcx, 0x138(%rbx)
movups %xmm0, 0x140(%rbx)
movl %edx, 0x150(%rbx)
movb %al, 0x199(%rbx)
movups %xmm0, 0x158(%rbx)
movups %xmm0, 0x168(%rbx)
movups %xmm0, 0x178(%rbx)
movups %xmm0, 0x188(%rbx)
leaq 0x4(%rbx), %r12
movq %rsp, %rcx
orl $-0x1, (%rcx)
leaq 0x4(%rsp), %rsi
movq %r14, %rdi
movq %r12, %rdx
callq 0x2732
movl (%r12), %eax
cmpl $0x8, %eax
jbe 0x1226e
pushq $0x8
jmp 0x12275
cmpl $0x2, %eax
ja 0x1227a
pushq $0x3
popq %rax
movl %eax, (%r12)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r12
leaq 0x180(%rbx), %rdi
leaq 0x168(%rbx), %rbp
callq 0xb872
movq %rbp, %rdi
callq 0xb872
movq %r13, %rdi
callq 0xad26
jmp 0x122b4
movq %rax, %r12
movq %r15, %rdi
callq 0x123d4
movq %r14, %rdi
callq 0x269e
jmp 0x122c9
movq %rax, %r12
addq $0x18, %rbx
movq %rbx, %rdi
callq 0xb872
movq %r12, %rdi
callq 0x22c0
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::chooseCutBranch(Alg::SearchNode*)
void chooseCutBranch(SearchNode *parent) {
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        if (leftChild->finalMis->size() == rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_1;
        } else { //if (leftChild->finalMis->size() > rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_2;
        }/* else {
            assert(false);
        }*/
        delete rightChild->finalMis;
        delete searchTree.back();
        searchTree.pop_back();
        parent->cutIsDone = true;
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rsi
cmpq %rcx, %rsi
jne 0x128b8
movl 0x114(%rbx), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x128b8
movq %rdi, %r14
movq (%rax,%rcx,8), %rcx
movq (%rax,%rsi,8), %rax
movq 0x120(%rax), %rax
movq 0x8(%rax), %rdx
subq (%rax), %rdx
movq 0x120(%rcx), %r15
movq 0x8(%r15), %rax
subq (%r15), %rax
xorl %ecx, %ecx
cmpq %rax, %rdx
setne %cl
addl $0x9, %ecx
movl %ecx, 0x8(%rbx)
movq %r15, %rdi
callq 0xb872
movq %r15, %rdi
callq 0x2160
movq 0x8(%r14), %rax
movq -0x8(%rax), %r15
testq %r15, %r15
je 0x1289e
movq %r15, %rdi
callq 0x11a96
movq %r15, %rdi
callq 0x2160
addq $-0x8, 0x8(%r14)
movb $0x1, 0x199(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x52d8(%rip), %rdi      # 0x17b97
leaq 0x521f(%rip), %rsi      # 0x17ae5
leaq 0x5324(%rip), %rcx      # 0x17bf1
movl $0x15e, %edx            # imm = 0x15E
callq 0x2100
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::concatMis(Alg::SearchNode*)
void concatMis(SearchNode *parent) {
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        for (auto i: *leftChild->finalMis) {
            for (auto j: *rightChild->finalMis) {
                if (i == j) {
                    assert(0);
                }
            }
        }
        parent->finalMis = leftChild->finalMis;
        parent->finalMis->insert(parent->finalMis->end(), rightChild->finalMis->begin(), rightChild->finalMis->end());
        parent->graph.collectZeroDegreeNodes();
        parent->mis.unfoldHypernodes(parent->graph.zeroDegreeNodes, *(parent->finalMis));

        delete rightChild->finalMis;
        delete searchTree.back();
        searchTree.pop_back();
        delete searchTree.back();
        searchTree.pop_back();
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %r14
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rsi
cmpq %rcx, %rsi
jne 0x12a28
movl 0x114(%r14), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x12a28
movq %rdi, %rbx
movq (%rax,%rcx,8), %r15
movq (%rax,%rsi,8), %rax
movq 0x120(%rax), %rdi
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
cmpq %rcx, %rax
je 0x1295f
movl (%rax), %edx
movq 0x120(%r15), %rsi
movq (%rsi), %r8
movq 0x8(%rsi), %rsi
cmpq %rsi, %r8
je 0x12959
leaq 0x4(%r8), %r9
cmpl (%r8), %edx
movq %r9, %r8
jne 0x12943
jmp 0x12a09
addq $0x4, %rax
jmp 0x1292e
movq %rdi, 0x120(%r14)
movq 0x8(%rdi), %rsi
movq 0x120(%r15), %rax
movq (%rax), %rdx
movq 0x8(%rax), %rcx
callq 0xa81c
leaq 0x30(%r14), %rdi
callq 0x608e
leaq 0x80(%r14), %rdi
movq 0x120(%r14), %rdx
addq $0x50, %r14
movq %r14, %rsi
callq 0x14b5a
movq 0x120(%r15), %r14
testq %r14, %r14
je 0x129b4
movq %r14, %rdi
callq 0xb872
movq %r14, %rdi
callq 0x2160
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x129d1
movq %r14, %rdi
callq 0x11a96
movq %r14, %rdi
callq 0x2160
movq 0x8(%rbx), %rax
leaq -0x8(%rax), %rcx
movq %rcx, 0x8(%rbx)
movq -0x10(%rax), %r14
testq %r14, %r14
je 0x129f6
movq %r14, %rdi
callq 0x11a96
movq %r14, %rdi
callq 0x2160
addq $-0x8, 0x8(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x4678(%rip), %rdi      # 0x17088
leaq 0x50ce(%rip), %rsi      # 0x17ae5
leaq 0x51fb(%rip), %rcx      # 0x17c19
movl $0x14b, %edx            # imm = 0x14B
callq 0x2100
leaq 0x5168(%rip), %rdi      # 0x17b97
leaq 0x50af(%rip), %rsi      # 0x17ae5
leaq 0x51dc(%rip), %rcx      # 0x17c19
movl $0x147, %edx            # imm = 0x147
callq 0x2100
nop
// File: /workspace/github_cpp_makefile_star2_O2/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::chooseMaxMis(Alg::SearchNode*)
void chooseMaxMis(SearchNode *parent) {
        //std::cout << "no next child" << std::endl;
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        parent->id = leftChild->id;
        parent->finalMis = leftChild->finalMis;
        std::vector<uint32_t> *min = rightChild->finalMis;
        if (rightChild->finalMis->size() > parent->finalMis->size()) {
            parent->id = rightChild->id;
            parent->finalMis = rightChild->finalMis;
            min = leftChild->finalMis;
        }
        delete min;
        delete searchTree.back();
        searchTree.pop_back();
        delete searchTree.back();
        searchTree.pop_back();
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rdi
cmpq %rcx, %rdi
jne 0x12b32
movl 0x114(%rsi), %edi
addq $-0x2, %rdx
cmpq %rdi, %rdx
jne 0x12b32
movq (%rax,%rcx,8), %rcx
movq (%rax,%rdi,8), %rax
movl (%rax), %edx
movl %edx, (%rsi)
movq 0x120(%rax), %rdx
movq %rdx, 0x120(%rsi)
movq 0x120(%rcx), %r14
movq 0x8(%r14), %rdi
subq (%r14), %rdi
movq 0x8(%rdx), %r8
subq (%rdx), %r8
cmpq %r8, %rdi
jbe 0x12ace
movl (%rcx), %ecx
movl %ecx, (%rsi)
movq %r14, 0x120(%rsi)
movq 0x120(%rax), %r14
testq %r14, %r14
je 0x12b2d
movq %r14, %rdi
callq 0xb872
movq %r14, %rdi
callq 0x2160
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x12af3
movq %r14, %rdi
callq 0x11a96
movq %r14, %rdi
callq 0x2160
movq 0x8(%rbx), %rax
leaq -0x8(%rax), %rcx
movq %rcx, 0x8(%rbx)
movq -0x10(%rax), %r14
testq %r14, %r14
je 0x12b18
movq %r14, %rdi
callq 0x11a96
movq %r14, %rdi
callq 0x2160
addq $-0x8, 0x8(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
xorl %r14d, %r14d
jmp 0x12ad6
leaq 0x505e(%rip), %rdi      # 0x17b97
leaq 0x4fa5(%rip), %rsi      # 0x17ae5
leaq 0x50f4(%rip), %rcx      # 0x17c3b
movl $0x134, %edx            # imm = 0x134
callq 0x2100
nop