LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/yasz24[P]eau2/tests/./../src/application/application.h
// Function: Trivial::run_()
void run_() {
    size_t SZ = 1000*1000;
    double* vals = new double[SZ];
    double sum = 0;
    for (size_t i = 0; i < SZ; ++i) sum += vals[i] = i;
    Key key("triv",0);
    DistributedDataFrame* df = DistributedDataFrame::fromArray(&key, kv_, SZ, vals);
    assert(df->get_double(0,1) == 1);
    Deserializable* ds = new Deserializable();
    DistributedDataFrame* df2 = dynamic_cast<DistributedDataFrame*>(ds->deserialize(kv_->get(&key)->data, kv_));
    for (size_t i = 0; i < SZ; ++i) sum -= df2->get_double(0,i);
    assert(sum==0);
    delete df; delete df2;
  }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x28, %rsp
movq %rdi, %r14
movl $0x7a1200, %edi         # imm = 0x7A1200
callq 0x7030
movq %rax, %rbx
xorpd %xmm1, %xmm1
xorl %eax, %eax
xorps %xmm0, %xmm0
cvtsi2sd %rax, %xmm0
movsd %xmm0, (%rbx,%rax,8)
addsd %xmm0, %xmm1
incq %rax
cmpq $0xf4240, %rax          # imm = 0xF4240
jne 0x1c693
movsd %xmm1, -0x20(%rbp)
leaq 0x44fd(%rip), %rsi      # 0x20bb8
leaq -0x40(%rbp), %r15
movq %r15, %rdi
xorl %edx, %edx
callq 0xac74
movq 0x10(%r14), %rsi
movl $0xf4240, %edx          # imm = 0xF4240
movq %r15, %rdi
movq %rbx, %rcx
callq 0x1c7f4
movq %rax, %rbx
movl $0x1, %edx
movq %rax, %rdi
xorl %esi, %esi
callq 0x1c930
cmpl $0x1, %eax
jne 0x1c7a6
movl $0x1, %edi
callq 0x7200
movq %rax, %r15
movq 0x10(%r14), %rdi
leaq -0x40(%rbp), %rsi
callq 0x14c4e
movq 0x10(%rax), %rsi
movq 0x10(%r14), %rdx
movq %r15, %rdi
callq 0x1d386
testq %rax, %rax
je 0x1c744
leaq 0xeb5a(%rip), %rsi      # 0x2b288
leaq 0x1051b(%rip), %rdx     # 0x2cc50
movq %rax, %rdi
xorl %ecx, %ecx
callq 0x7230
movq %rax, %r14
jmp 0x1c747
xorl %r14d, %r14d
movsd -0x20(%rbp), %xmm1
xorl %r15d, %r15d
movsd %xmm1, -0x20(%rbp)
movq %r14, %rdi
xorl %esi, %esi
movq %r15, %rdx
callq 0x1c930
movsd -0x20(%rbp), %xmm1
xorps %xmm0, %xmm0
cvtsi2sd %eax, %xmm0
subsd %xmm0, %xmm1
incq %r15
cmpq $0xf4240, %r15          # imm = 0xF4240
jne 0x1c74f
xorpd %xmm0, %xmm0
ucomisd %xmm0, %xmm1
jne 0x1c7c5
jp 0x1c7c5
movq (%rbx), %rax
movq %rbx, %rdi
callq *0x8(%rax)
movq (%r14), %rax
movq %r14, %rdi
callq *0x8(%rax)
addq $0x28, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
leaq 0x4410(%rip), %rdi      # 0x20bbd
leaq 0x4422(%rip), %rsi      # 0x20bd6
leaq 0x443e(%rip), %rcx      # 0x20bf9
movl $0x2e, %edx
callq 0x7130
leaq 0x444a(%rip), %rdi      # 0x20c16
leaq 0x4403(%rip), %rsi      # 0x20bd6
leaq 0x441f(%rip), %rcx      # 0x20bf9
movl $0x32, %edx
callq 0x7130
// File: /workspace/github_cpp_makefile_star2_O1/i32ropie[P]n-queen-microservice/./reinas.hpp
// Function: al::lugar(int const&, std::vector<int, std::allocator<int>> const&)
bool lugar(const int &k, const std::vector<int> &x){
        for(int i = 0 ; i < k ; ++i){
            if( x[i] == x[k] || abs(x[i] - x[k]) == abs(i - k))
                return false;
        }
        return true;
    }

// Assembly:
movslq (%rdi), %rcx
testq %rcx, %rcx
setle %al
jle 0x241b
pushq %rbp
movq %rsp, %rbp
movq (%rsi), %rdx
movl (%rdx,%rcx,4), %esi
movl (%rdx), %r9d
cmpl %esi, %r9d
je 0x241a
movl %ecx, %edi
negl %edi
movl $0x1, %r8d
subl %esi, %r9d
movl %r9d, %r10d
negl %r10d
cmovsl %r9d, %r10d
leal (%rdi,%r8), %r9d
decl %r9d
movl %r9d, %r11d
negl %r11d
cmovsl %r9d, %r11d
cmpl %r11d, %r10d
je 0x241a
cmpq %rcx, %r8
setae %al
je 0x241a
movl (%rdx,%r8,4), %r9d
incq %r8
cmpl %esi, %r9d
jne 0x23e3
popq %rbp
andb $0x1, %al
retq
// File: /workspace/github_cpp_makefile_star2_O1/i32ropie[P]n-queen-microservice/./extra_functions.hpp
// Function: imprimir_tablero(std::vector<int, std::allocator<int>> const&)
void imprimir_tablero(const std::vector<int> &sol){
    for(int i = 0 ; i < sol.size() ; ++i){
        for(int j = 0 ; j < sol.size() ; ++j){
            if(j == sol[i]){
                std::cout << "\e[101m  ";
            }
            else if((i+j)%2==0){
                std::cout << "\e[47m  ";
            }
            else{
                std::cout << "\e[40m  ";
            }
        }
        std::cout << "\e[m" << std::endl;
    }
    std::cout << std::endl;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq 0x8(%rdi), %rax
cmpq (%rdi), %rax
je 0x24fc
movq %rdi, %rbx
xorl %r13d, %r13d
movq 0x3b92(%rip), %r14      # 0x5fd8
leaq 0x1bb7(%rip), %r12      # 0x4004
movq (%rbx), %rax
cmpq %rax, 0x8(%rbx)
je 0x24aa
xorl %r15d, %r15d
movl (%rax,%r13,4), %eax
cmpq %rax, %r15
jne 0x246f
movl $0x8, %edx
movq %r14, %rdi
movq %r12, %rsi
jmp 0x248f
leal (%r15,%r13), %eax
movl $0x7, %edx
movq %r14, %rdi
testb $0x1, %al
jne 0x2488
leaq 0x1b87(%rip), %rsi      # 0x400d
jmp 0x248f
leaq 0x1b86(%rip), %rsi      # 0x4015
callq 0x2190
incq %r15
movq (%rbx), %rax
movq 0x8(%rbx), %rcx
subq %rax, %rcx
sarq $0x2, %rcx
cmpq %r15, %rcx
ja 0x2459
movl $0x3, %edx
movq %r14, %rdi
leaq 0x1b64(%rip), %rsi      # 0x401d
callq 0x2190
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x2150
movsbl %al, %esi
movq %r14, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20c0
incq %r13
movq 0x8(%rbx), %rax
subq (%rbx), %rax
sarq $0x2, %rax
cmpq %r13, %rax
ja 0x244d
movq 0x3ad5(%rip), %rbx      # 0x5fd8
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2150
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x20c0
// File: /workspace/github_cpp_makefile_star2_O1/i32ropie[P]n-queen-microservice/./extra_functions.hpp
// Function: mostrar_soluciones(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>> const&)
void mostrar_soluciones(const std::vector<std::vector<int>> &soluciones){
    for(int k = 0 ; k < soluciones.size() ; ++k){
        std::cout << "Solución " << k+1 << std::endl;
        std::vector<int> sol = soluciones[k];
        imprimir_tablero(sol);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq 0x8(%rdi), %rax
cmpq (%rdi), %rax
je 0x2600
movq %rdi, %rbx
xorl %r14d, %r14d
leaq -0x40(%rbp), %r12
xorl %r13d, %r13d
movl $0xa, %edx
movq 0x3a69(%rip), %r15      # 0x5fd8
movq %r15, %rdi
leaq 0x1aa8(%rip), %rsi      # 0x4021
callq 0x2190
incq %r13
movq %r15, %rdi
movl %r13d, %esi
callq 0x2210
movq %rax, %r15
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r15, %rdi
movl $0xa, %esi
callq 0x2150
movsbl %al, %esi
movq %r15, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20c0
movq (%rbx), %rsi
addq %r14, %rsi
movq %r12, %rdi
callq 0x2e34
movq %r12, %rdi
callq 0x241e
movq -0x40(%rbp), %rdi
testq %rdi, %rdi
je 0x25da
callq 0x2140
movq 0x8(%rbx), %rax
subq (%rbx), %rax
sarq $0x3, %rax
movabsq $-0x5555555555555555, %rcx # imm = 0xAAAAAAAAAAAAAAAB
imulq %rcx, %rax
addq $0x18, %r14
cmpq %r13, %rax
ja 0x2563
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x40(%rbp), %rdi
testq %rdi, %rdi
je 0x2620
callq 0x2140
movq %rbx, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/i32ropie[P]n-queen-microservice/main.cpp
// Function: main
int main(int argc, char *argv[]) {
    int n = atoi(argv[1]);
    al::Reinas r(n);
    r.resolver_backtracking();
    std::cout << exportar_soluciones(r.get_soluciones());
    return 0;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %rbx
subq $0x68, %rsp
movq 0x8(%rsi), %rdi
callq 0x21e0
xorl %ecx, %ecx
leaq -0x70(%rbp), %rdi
movq %rcx, 0x10(%rdi)
xorps %xmm0, %xmm0
movaps %xmm0, (%rdi)
movl %eax, 0x18(%rdi)
movq %rcx, 0x20(%rdi)
callq 0x2eb4
leaq -0x20(%rbp), %rdi
leaq -0x70(%rbp), %rsi
callq 0x3472
leaq -0x40(%rbp), %rdi
leaq -0x20(%rbp), %rsi
callq 0x2628
movq -0x40(%rbp), %rsi
movq -0x38(%rbp), %rdx
movq 0x3212(%rip), %rdi      # 0x5fd8
callq 0x2190
leaq -0x30(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2ddd
callq 0x2140
leaq -0x20(%rbp), %rdi
callq 0x300c
leaq -0x70(%rbp), %rdi
callq 0x300c
xorl %eax, %eax
addq $0x68, %rsp
popq %rbx
popq %rbp
retq
movq %rax, %rbx
leaq -0x30(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2e12
callq 0x2140
jmp 0x2e12
movq %rax, %rbx
leaq -0x20(%rbp), %rdi
callq 0x300c
jmp 0x2e22
jmp 0x2e1f
movq %rax, %rbx
leaq -0x70(%rbp), %rdi
callq 0x300c
movq %rbx, %rdi
callq 0x2220
nop
// File: /workspace/github_cpp_makefile_star2_O1/i32ropie[P]n-queen-microservice/./reinas.hpp
// Function: al::Reinas::resolver_backtracking()
void resolver_backtracking() {
            if( _reinas <= 3 )
                return;
            _soluciones.clear();
            std::vector<int> aux(_reinas, -1);
            int k = 0;
            while( k >= 0 ){
                do{
                    aux[k]++;
                }while( aux[k] < _reinas && !lugar(k, aux));
                if( aux[k] < _reinas ){
                    if( k == _reinas-1 ){
                        _soluciones.push_back(aux);
                    }
                    else{
                        ++k;
                        aux[k] = -1;
                    }
                }
                else{
                    --k;
                }
            }
        }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
cmpl $0x4, 0x18(%rdi)
jl 0x2fe4
movq %rdi, %rbx
callq 0x3156
movslq 0x18(%rbx), %rsi
leaq -0x30(%rbp), %rdx
movl $0xffffffff, (%rdx)     # imm = 0xFFFFFFFF
leaq -0x48(%rbp), %r14
leaq -0x29(%rbp), %rcx
movq %r14, %rdi
callq 0x3198
xorl %r15d, %r15d
movl %r15d, %eax
movq -0x48(%rbp), %rcx
testl %r15d, %r15d
sete %dl
movl (%rcx,%rax,4), %edi
incl %edi
movl %edi, (%rcx,%rax,4)
movl 0x18(%rbx), %esi
cmpl %esi, %edi
setl %r8b
jge 0x2fbb
movl %r15d, %edi
negl %edi
movl %edx, %r9d
testl %r15d, %r15d
je 0x2f83
movl (%rcx,%rax,4), %r9d
movl (%rcx), %r10d
subl %r9d, %r10d
je 0x2f88
movl %r10d, %r11d
negl %r11d
cmovsl %r10d, %r11d
cmpl %r15d, %r11d
je 0x2f88
movl $0x1, %r11d
movq %r11, %r10
cmpq %r11, %rax
je 0x2f7c
movl (%rcx,%r10,4), %r11d
subl %r9d, %r11d
je 0x2f7c
movl %r11d, %r12d
negl %r12d
cmovsl %r11d, %r12d
leal (%rdi,%r10), %r11d
movl %r11d, %r13d
negl %r13d
cmovsl %r11d, %r13d
leaq 0x1(%r10), %r11
cmpl %r13d, %r12d
jne 0x2f4a
cmpq %rax, %r10
setae %r9b
testb %r9b, %r9b
jne 0x2fa1
movl (%rcx,%rax,4), %r8d
incl %r8d
movl %r8d, (%rcx,%rax,4)
movl 0x18(%rbx), %esi
cmpl %esi, %r8d
setl %r8b
jl 0x2f21
jmp 0x2fbb
testb $0x1, %r8b
je 0x2fbb
decl %esi
cmpl %esi, %r15d
jne 0x2fc9
movq %rbx, %rdi
movq %r14, %rsi
callq 0x3220
jmp 0x2fbe
decl %r15d
testl %r15d, %r15d
jns 0x2ef8
jmp 0x2fd6
incl %r15d
movl $0xffffffff, 0x4(%rcx,%rax,4) # imm = 0xFFFFFFFF
jmp 0x2fbe
movq -0x48(%rbp), %rdi
testq %rdi, %rdi
je 0x2fe4
callq 0x2140
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x48(%rbp), %rdi
testq %rdi, %rdi
je 0x3004
callq 0x2140
movq %rbx, %rdi
callq 0x2220
// File: /workspace/github_cpp_makefile_star2_O1/ridgelab[P]Kmer-SSR/test/src/findSSRs.cpp
// Function: fillSSRSetFromFile(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, std::set<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::less<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>>>>*)
void fillSSRSetFromFile(const string &fn, set<string>* ssrs)
{
	ifstream fd;
	fd.open(fn.c_str());

	string line;
	getline(fd, line); // skip past the header line
	while(getline(fd, line))
	{
		ssrs->insert(line);
	}

	fd.close();
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x228, %rsp            # imm = 0x228
movq %rsi, %rbx
movq %rdi, %r15
leaq 0x20(%rsp), %r14
movq %r14, %rdi
callq 0x4360
movq (%r15), %rsi
movq %r14, %rdi
movl $0x8, %edx
callq 0x41e0
leaq 0x10(%rsp), %r12
movq %r12, -0x10(%r12)
movq $0x0, -0x8(%r12)
movb $0x0, (%r12)
movq 0x20(%rsp), %rax
addq -0x18(%rax), %r14
movq %r14, %rdi
movl $0xa, %esi
callq 0x42e0
movsbl %al, %edx
leaq 0x20(%rsp), %r14
movq %rsp, %rsi
movq %r14, %rdi
callq 0x4590
movq %rsp, %r15
movq 0x20(%rsp), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x42e0
movsbl %al, %edx
movq %r14, %rdi
movq %r15, %rsi
callq 0x4590
movq (%rax), %rcx
movq -0x18(%rcx), %rcx
testb $0x5, 0x20(%rax,%rcx)
jne 0x6b5a
movq %rbx, %rdi
movq %r15, %rsi
callq 0x6f80
jmp 0x6b1b
leaq 0x20(%rsp), %rdi
callq 0x40a0
movq (%rsp), %rdi
cmpq %r12, %rdi
je 0x6b7a
movq 0x10(%rsp), %rsi
incq %rsi
callq 0x4310
leaq 0x20(%rsp), %rdi
callq 0x40d0
addq $0x228, %rsp            # imm = 0x228
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rax, %rbx
jmp 0x6bb3
jmp 0x6b9a
movq %rax, %rbx
movq (%rsp), %rdi
cmpq %r12, %rdi
je 0x6bb3
movq 0x10(%rsp), %rsi
incq %rsi
callq 0x4310
leaq 0x20(%rsp), %rdi
callq 0x40d0
movq %rbx, %rdi
callq 0x4550
// File: /workspace/github_cpp_makefile_star2_O1/ridgelab[P]Kmer-SSR/test/src/findSSRs.cpp
// Function: actualOutputMatchedExpected(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&)
bool actualOutputMatchedExpected(const string &actual_fn, const string &expected_fn)
{
	bool ret_val = true;
	
	set<string>* actual = new set<string>();
	set<string>* expected = new set<string>();
	
	fillSSRSetFromFile(actual_fn, actual);
	fillSSRSetFromFile(expected_fn, expected);

	if (actual->size() != expected->size())
	{
		ret_val = false;
	}
	else
	{
		set<string>::iterator a_itr = actual->begin();
		set<string>::iterator e_itr = expected->begin();
		while (e_itr != expected->end() && a_itr != actual->end()) // expected.size() == actual.size()
		{
			if (*e_itr != *a_itr)
			{
				ret_val = false;
				break;
			}

			++e_itr;
			++a_itr;
		}
	}

	delete actual;
	delete expected;

	return ret_val;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, (%rsp)
movq %rdi, %r13
movl $0x30, %edi
callq 0x4300
movq %rax, %rbx
leaq 0x8(%rax), %rbp
xorps %xmm0, %xmm0
movaps %xmm0, 0x10(%rax)
movaps %xmm0, 0x20(%rax)
movaps %xmm0, (%rax)
movq %rbp, 0x18(%rax)
movq %rbp, 0x20(%rax)
xorl %r12d, %r12d
movq %r12, 0x28(%rax)
movl $0x30, %edi
callq 0x4300
movq %rax, %r14
leaq 0x8(%rax), %r15
xorps %xmm0, %xmm0
movaps %xmm0, 0x10(%rax)
movaps %xmm0, 0x20(%rax)
movaps %xmm0, (%rax)
movq %r15, 0x18(%rax)
movq %r15, 0x20(%rax)
movq %r12, 0x28(%rax)
movq %r13, %rdi
movq %rbx, %rsi
callq 0x6aa6
movq (%rsp), %rdi
movq %r14, %rsi
callq 0x6aa6
movq 0x28(%rbx), %rax
cmpq 0x28(%r14), %rax
jne 0x6cb6
movq 0x18(%rbx), %r12
movq 0x18(%r14), %r13
cmpq %r15, %r13
setne %al
cmpq %rbp, %r12
setne %cl
andb %al, %cl
cmpb $0x1, %cl
jne 0x6cae
movq 0x28(%r13), %rdx
cmpq 0x28(%r12), %rdx
jne 0x6cb3
testq %rdx, %rdx
je 0x6c8e
movq 0x20(%r12), %rsi
movq 0x20(%r13), %rdi
callq 0x4320
testl %eax, %eax
jne 0x6cb3
movq %r13, %rdi
callq 0x4380
movq %rax, %r13
movq %r12, %rdi
callq 0x4380
cmpq %r15, %r13
je 0x6cae
movq %rax, %r12
cmpq %rbp, %rax
jne 0x6c6c
movb $0x1, %r12b
jmp 0x6cb6
xorl %r12d, %r12d
movq %rbx, %rdi
callq 0x6d42
movl $0x30, %esi
movq %rbx, %rdi
callq 0x4310
movq %r14, %rdi
callq 0x6d42
movl $0x30, %esi
movq %r14, %rdi
callq 0x4310
movl %r12d, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/eryxcc[P]lois/tests/../include/loisextra.h
// Function: lois::lsetof<lois::lpair<lois::elem, lois::elem>> lois::operator|<lois::lpair<lois::elem, lois::elem>>(lois::lsetof<lois::lpair<lois::elem, lois::elem>> const&, lois::lsetof<lois::lpair<lois::elem, lois::elem>> const&)
lsetof<T> operator | (const lsetof<T>& x, const lsetof<T>& y) { 
  lsetof<T> xy;
  for(const T& e: x) xy += e;
  for(const T& e: y) xy += e;
  return xy;
  }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x60, %rsp
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, 0x10(%rdi)
movups %xmm0, (%rdi)
movq $0x0, 0x20(%rdi)
leaq 0x3b54b(%rip), %rsi     # 0x56358
movq (%rsi), %rax
movq %rax, (%rdi)
addq $0x8, %rdi
addq $0x8, %rsi
callq 0x11046
movq %rsp, %rdi
movq %r15, %rsi
xorl %edx, %edx
callq 0x1e8f4
leaq 0x30(%rsp), %rdi
movq %r15, %rsi
movl $0x77359400, %edx       # imm = 0x77359400
callq 0x1e8f4
movq %rsp, %r15
movslq 0x8(%rsp), %rax
testq %rax, %rax
js 0x1ae6a
movq (%rsp), %rcx
movq 0x18(%rcx), %rdx
subq 0x10(%rcx), %rdx
sarq $0x4, %rdx
cmpq %rax, %rdx
jbe 0x1ae6a
cmpl 0x38(%rsp), %eax
setne %al
jmp 0x1ae8b
movslq 0x38(%rsp), %rax
testq %rax, %rax
js 0x1aeb2
movq 0x30(%rsp), %rcx
movq 0x18(%rcx), %rdx
subq 0x10(%rcx), %rdx
sarq $0x4, %rdx
cmpq %rax, %rdx
seta %al
testb %al, %al
je 0x1aeb2
movq 0x10(%rsp), %rsi
movq %rbx, %rdi
callq 0x1b44e
movq %r15, %rdi
callq 0x1f8b8
incl 0x8(%rsp)
movq %r15, %rdi
callq 0x1e940
jmp 0x1ae42
leaq 0x30(%rsp), %rdi
callq 0x1e8c4
movq %rsp, %rdi
callq 0x1e8c4
movq %rsp, %rdi
movq %r14, %rsi
xorl %edx, %edx
callq 0x1e8f4
leaq 0x30(%rsp), %rdi
movq %r14, %rsi
movl $0x77359400, %edx       # imm = 0x77359400
callq 0x1e8f4
movq %rsp, %r14
movslq 0x8(%rsp), %rax
testq %rax, %rax
js 0x1af0e
movq (%rsp), %rcx
movq 0x18(%rcx), %rdx
subq 0x10(%rcx), %rdx
sarq $0x4, %rdx
cmpq %rax, %rdx
jbe 0x1af0e
cmpl 0x38(%rsp), %eax
setne %al
jmp 0x1af2f
movslq 0x38(%rsp), %rax
testq %rax, %rax
js 0x1af56
movq 0x30(%rsp), %rcx
movq 0x18(%rcx), %rdx
subq 0x10(%rcx), %rdx
sarq $0x4, %rdx
cmpq %rax, %rdx
seta %al
testb %al, %al
je 0x1af56
movq 0x10(%rsp), %rsi
movq %rbx, %rdi
callq 0x1b44e
movq %r14, %rdi
callq 0x1f8b8
incl 0x8(%rsp)
movq %r14, %rdi
callq 0x1e940
jmp 0x1aee6
leaq 0x30(%rsp), %rdi
callq 0x1e8c4
movq %rsp, %rdi
callq 0x1e8c4
movq %rbx, %rax
addq $0x60, %rsp
popq %rbx
popq %r14
popq %r15
retq
jmp 0x1af79
jmp 0x1af7e
movq %rax, %r14
jmp 0x1af96
movq %rax, %r14
jmp 0x1af9e
jmp 0x1af89
jmp 0x1af89
jmp 0x1af89
movq %rax, %r14
leaq 0x30(%rsp), %rdi
callq 0x1e8c4
movq %rsp, %rdi
callq 0x1e8c4
movq %rbx, %rdi
callq 0x1b2c6
movq %r14, %rdi
callq 0x8430
// File: /workspace/github_cpp_makefile_star2_O1/ArashPartow[P]exprtk-extras/exprtk_testgen.cpp
// Function: main
int main(int argc, char* argv[])
{
   if (argc != 2)
   {
      printf("usage: exprtk_testgen <file name>\n");
      return 1;
   }

   const std::string file_name = argv[1];
   test_gen<double>(file_name);

   return 0;
}

// Assembly:
pushq %rbx
subq $0x30, %rsp
cmpl $0x2, %edi
jne 0x11b383
movq 0x8(%rsi), %rsi
leaq 0x10(%rsp), %rbx
leaq 0xf(%rsp), %rdx
movq %rbx, %rdi
callq 0x11b468
movq %rbx, %rdi
callq 0x11b4a5
leaq 0x20(%rsp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x11b37f
movq 0x20(%rsp), %rsi
incq %rsi
callq 0x1180c0
xorl %eax, %eax
jmp 0x11b394
leaq 0x1b7079(%rip), %rdi    # 0x2d2403
callq 0x118500
movl $0x1, %eax
addq $0x30, %rsp
popq %rbx
retq
movq %rax, %rbx
leaq 0x20(%rsp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x11b3b8
movq 0x20(%rsp), %rsi
incq %rsi
callq 0x1180c0
movq %rbx, %rdi
callq 0x118310
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/Graph.cpp
// Function: Graph::doWalk(unsigned int, unsigned int, FastPRNG&, char*) const
size_t Graph::doWalk(uint node, uint32_t walk_len, FastPRNG & prng, char * const out) const
{
	// Write start node to output string
	char * outPos = out;

	{
		unsigned const wrote = writeInt(outPos, node);
		outPos += wrote;
	}

	while(--walk_len)
	{
		// Determine the number of outgoing transitions (from the current node)
		uint const outgoingTransitions = getNumTransitions(node);
		if(!outgoingTransitions)
		{
			fprintf(stderr, "Node %d has no outgoing transitions\n", node);
			break;
		}

		// Choose a successor node
		node = getNode(node, prng.uniformInRange<uint>(outgoingTransitions - 1));

		// Write node number to output
		{
			*(outPos++) = ',';
			unsigned const wrote = writeInt(outPos, node);
			outPos += wrote;
		}
	}

	*outPos = '\0';

	return outPos - out;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %rbx
movq %rcx, 0x10(%rsp)
movl %edx, %ebp
movl %esi, %r13d
movq %rdi, %r12
movq %r8, %rdi
callq 0x3afd
movl %eax, %r15d
movq %rbx, 0x8(%rsp)
addq %rbx, %r15
decl %ebp
je 0x257d
xorl %ebx, %ebx
movl %r13d, %r14d
cmpl %r13d, 0x8(%r12)
jbe 0x2519
movq 0x10(%r12), %rax
movl 0x8(%rax,%r14,8), %ebx
subl (%rax,%r14,8), %ebx
testl %ebx, %ebx
je 0x2560
leal -0x1(%rbx), %esi
movq 0x10(%rsp), %rdi
callq 0x303c
movq 0x10(%r12), %rcx
movq (%rcx,%r14,8), %rcx
shlq $0x2, %rcx
addq 0x18(%r12), %rcx
movl %eax, %eax
movl (%rcx,%rax,4), %r13d
leaq 0x1(%r15), %rdi
movb $0x2c, (%r15)
movl %r13d, %esi
callq 0x3afd
movl %eax, %eax
addq %rax, %r15
incq %r15
testl %ebx, %ebx
jne 0x24fb
jmp 0x257d
movq 0x6a79(%rip), %rax      # 0x8fe0
movq (%rax), %rdi
leaq 0x3aef(%rip), %rsi      # 0x6060
movl %r13d, %edx
xorl %eax, %eax
callq 0x2220
jmp 0x255a
movb $0x0, (%r15)
subq 0x8(%rsp), %r15
movq %r15, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/Graph.cpp
// Function: Graph::toString[abi:cxx11]() const
std::string Graph::toString() const
{
	unsigned const maxDigits = hasDigits(getNumNodes() - 1);

	char asString[maxDigits];

	std::string res;
	res.reserve((maxDigits * 2 + 5) * getNumTransitions());

	for(uint node = 0; node < numNodes; ++node)
	{
		uint const numTrans = getNumTransitions(node);

		for(uint trans = 0; trans < numTrans; ++trans)
		{
			// Add source node
			unsigned len = writeInt(asString, node);
			res.append(asString, len);
			// Add " ->"
			res.append(" -> ", 4);
			// Add destination node
			len = writeInt(asString, getNode(node, trans));
			res.append(asString, len);
			res.append(1, '\n');
		}
	}

	return res;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movl 0x8(%rsi), %eax
decl %eax
cvtsi2sd %rax, %xmm0
callq 0x20c0
callq 0x2060
cvttsd2si %xmm0, %rax
movl %eax, %ecx
movq %rsp, %r15
addq $0xf, %rcx
andq $-0x10, %rcx
subq %rcx, %r15
movq %r15, %rsp
leaq 0x10(%rbx), %rcx
movq %rcx, -0x30(%rbp)
movq %rcx, (%rbx)
movq $0x0, 0x8(%rbx)
movb $0x0, 0x10(%rbx)
leal 0x5(,%rax,2), %esi
movq 0x10(%r14), %rax
movl 0x8(%r14), %ecx
imulq (%rax,%rcx,8), %rsi
movq %rbx, %rdi
callq 0x2260
cmpl $0x0, 0x8(%r14)
je 0x2701
xorl %r12d, %r12d
movq 0x10(%r14), %rcx
movq 0x8(%rcx,%r12,8), %rax
subq (%rcx,%r12,8), %rax
testl %eax, %eax
je 0x26f1
movl %eax, %eax
movq %rax, -0x38(%rbp)
xorl %r13d, %r13d
movq %r15, %rdi
movl %r12d, %esi
callq 0x3afd
movl %eax, %edx
movq %rbx, %rdi
movq %r15, %rsi
callq 0x2050
movl $0x4, %edx
movq %rbx, %rdi
leaq 0x39e4(%rip), %rsi      # 0x6085
callq 0x2050
movq 0x10(%r14), %rax
movq (%rax,%r12,8), %rax
shlq $0x2, %rax
addq 0x18(%r14), %rax
movl (%rax,%r13,4), %esi
movq %r15, %rdi
callq 0x3afd
movl %eax, %edx
movq %rbx, %rdi
movq %r15, %rsi
callq 0x2050
movq 0x8(%rbx), %rsi
movl $0x1, %ecx
movq %rbx, %rdi
xorl %edx, %edx
movl $0xa, %r8d
callq 0x22b0
incq %r13
cmpq %r13, -0x38(%rbp)
jne 0x267a
incq %r12
movl 0x8(%r14), %eax
cmpq %rax, %r12
jb 0x265c
movq %rbx, %rax
leaq -0x28(%rbp), %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x2715
movq %rax, %r14
movq (%rbx), %rdi
cmpq -0x30(%rbp), %rdi
je 0x2726
callq 0x2160
movq %r14, %rdi
callq 0x2290
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/Graph.cpp
// Function: Graph::readInt(char const*, char const*, unsigned int&)
uint Graph::readInt(char const * const start, char const * const end, unsigned & readLen)
{
	char const * pos = start;
	read_t result = 0;

	// Skip space characters
	while(pos < end && *pos > 0 && *pos <= ' ') ++pos;

	// Ensure that the first non-space character is a digit
	if(pos >= end || *pos < '0' || *pos > '9') {fprintf(stderr, "Not a number: %c\n", *pos); exit(1);}

	// Read digit by digit until a non-digit occurs
	for(; pos < end; ++pos)
	{
		char const c = *pos;
		if(c < '0' || c > '9') break;

		result *= 10;
		result += c - '0';

		if(result > ((uint)-1)) printError("Specified integer type is too small to hold this number.");
	}

	readLen = pos - start;

	// Return the number
	return (uint) result;
}

// Assembly:
pushq %rax
cmpq %rsi, %rdi
setb %al
jae 0x27e1
movb (%rdi), %r8b
decb %r8b
movq %rdi, %rcx
cmpb $0x1f, %r8b
ja 0x278b
leaq 0x1(%rdi), %rcx
cmpq %rsi, %rcx
je 0x27de
movb (%rcx), %al
decb %al
incq %rcx
cmpb $0x1f, %al
jbe 0x2772
decq %rcx
cmpq %rsi, %rcx
setb %al
testb %al, %al
je 0x2815
movb (%rcx), %al
addb $-0x3a, %al
cmpb $-0xa, %al
jb 0x2815
xorl %eax, %eax
cmpq %rsi, %rcx
jae 0x27d8
xorl %eax, %eax
movzbl (%rcx), %r9d
leal -0x30(%r9), %r8d
cmpb $0x9, %r8b
ja 0x27c7
leaq (%rax,%rax,4), %rax
andl $0xf, %r9d
leaq (%r9,%rax,2), %rax
movq %rax, %r9
shrq $0x20, %r9
jne 0x2809
cmpb $0x9, %r8b
ja 0x27d8
incq %rcx
cmpq %rsi, %rcx
jb 0x27a4
movq %rsi, %rcx
subl %edi, %ecx
movl %ecx, (%rdx)
popq %rcx
retq
movq %rsi, %rdi
movq 0x67f8(%rip), %rax      # 0x8fe0
movq (%rax), %rax
movsbl (%rdi), %edx
leaq 0x3895(%rip), %rsi      # 0x608a
movq %rax, %rdi
xorl %eax, %eax
callq 0x2220
movl $0x1, %edi
callq 0x21e0
leaq 0x388c(%rip), %rdi      # 0x609c
callq 0x3955
movq %rcx, %rdi
jmp 0x27e1
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/./FastPRNG.hpp
// Function: unsigned int FastPRNG::uniformInRange<unsigned int>(unsigned int)
T FastPRNG::uniformInRange(T max)
{
	// If PRNG 2 was used 256 times ...
	if(++prngResetCounter > 0xffff)
	{
		prngResetCounter = 0;

		// Re-Seed PRNG 2 with output of PRNG 1
		g2.seed(g1());
	}

	return std::uniform_int_distribution<T>(0, max)(g2);
}

// Assembly:
pushq %rbp
pushq %rbx
pushq %rax
movl %esi, %ebp
movq %rdi, %rbx
movl 0x1390(%rdi), %eax
incl %eax
movl %eax, 0x1390(%rdi)
cmpl $0x10000, %eax          # imm = 0x10000
jb 0x30a7
movl $0x0, 0x1390(%rbx)
movq %rbx, %rdi
callq 0x318a
movq %rax, %rcx
movabsq $0x200000005, %rdx      # imm = 0x200000005
mulq %rdx
movq %rcx, %rax
subq %rdx, %rax
shrq %rax
addq %rdx, %rax
shrq $0x1e, %rax
movq %rax, %rdx
shlq $0x1f, %rdx
subq %rdx, %rax
leaq (%rcx,%rax), %rdx
cmpq $0x1, %rdx
adcq %rcx, %rax
movq %rax, 0x1388(%rbx)
movq %rsp, %rdi
movl $0x0, (%rdi)
movl %ebp, 0x4(%rdi)
addq $0x1388, %rbx           # imm = 0x1388
movq %rbx, %rsi
movq %rdi, %rdx
callq 0x32f2
addq $0x8, %rsp
popq %rbx
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: readFile[abi:cxx11](char const*)
std::string readFile(char const * const fileName)
{
	// Open file
	FILE * const file = fopen(fileName, "r");
	if(!file) printError("File could not be opened for reading");

	// Determine file size
	fseek(file, 0L, SEEK_END);
	size_t const fileSize = ftell(file);
	fseek(file, 0L, SEEK_SET);

	// Create buffer array
	char * const result = (char *) malloc(fileSize * sizeof(*result) + 1);

	// Read whole file
	size_t const read = fread(result, 1, fileSize, file);
	result[read] = '\n';

	// Error if file size and number of bytes read are different
	if(fileSize != read)
	{
		fprintf(stderr, "File size: %lu, but read: %lu\n", (unsigned long) fileSize, (unsigned long) read);
		exit(1);
	}

	// Close file
	fclose(file);

	std::string const res = std::string(result, fileSize);
	
	free(result);
	
	return res;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rax
movq %rdi, %rbx
leaq 0x280c(%rip), %rsi      # 0x619c
movq %rax, %rdi
callq 0x21c0
testq %rax, %rax
je 0x3a2a
movq %rax, %r14
movq %rax, %rdi
xorl %esi, %esi
movl $0x2, %edx
callq 0x2190
movq %r14, %rdi
callq 0x2030
movq %rax, %r15
movq %r14, %rdi
xorl %esi, %esi
xorl %edx, %edx
callq 0x2190
leaq 0x1(%r15), %rdi
callq 0x21f0
movq %rax, %r12
movl $0x1, %esi
movq %rax, %rdi
movq %r15, %rdx
movq %r14, %rcx
callq 0x2240
movb $0xa, (%r12,%rax)
cmpq %rax, %r15
jne 0x3a36
movq %r14, %rdi
callq 0x2170
leaq 0x10(%rbx), %rax
movq %rax, (%rbx)
addq %r12, %r15
movq %rbx, %rdi
movq %r12, %rsi
movq %r15, %rdx
callq 0x40c8
movq %r12, %rdi
callq 0x21d0
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
leaq 0x26c7(%rip), %rdi      # 0x60f8
callq 0x3955
movq %r15, %rdi
movq %rax, %rsi
callq 0x2315
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: writeFile(char const*, char const*)
void writeFile(char const * const fileName, char const * const content)
{
	size_t const len = strlen(content);

	// Open file
	FILE * const file = fopen(fileName, "w");
	if(!file) printError("File could not be opened for writing");

	// Write to file
	size_t const w = fwrite(content, sizeof(*content), len, file);
	if(w < len) printError("Could not write full file content");

	// Close file
	fclose(file);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x20a0
movq %rax, %r14
leaq 0x26de(%rip), %rsi      # 0x613c
movq %r15, %rdi
callq 0x21c0
testq %rax, %rax
je 0x3a93
movq %rax, %r15
movl $0x1, %esi
movq %rbx, %rdi
movq %r14, %rdx
movq %rax, %rcx
callq 0x22c0
cmpq %r14, %rax
jb 0x3a9f
movq %r15, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x2170
leaq 0x26a4(%rip), %rdi      # 0x613e
callq 0x3955
leaq 0x26bd(%rip), %rdi      # 0x6163
callq 0x3955
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: toInt(char const*)
uint32_t toInt(char const * str)
{
	register uint64_t res = 0;

	// For every character in str ...
	for(; *str != '\0'; ++str)
	{
		// Check if character is a number
		if(*str < '0' || *str > '9') printError("Argument is not a number");

		// Adapt result according to character
		res *= 10;
		res += *str - '0';

		// Check for integer overflow
		if(res > 0xffffffff) printError("Number in argument is too large");
	}

	return (uint32_t) res;
}

// Assembly:
pushq %rax
movb (%rdi), %cl
testb %cl, %cl
je 0x3ae1
incq %rdi
xorl %eax, %eax
leal -0x3a(%rcx), %edx
cmpb $-0xb, %dl
jbe 0x3ae5
leaq (%rax,%rax,4), %rax
addb $-0x30, %cl
movzbl %cl, %ecx
leaq (%rcx,%rax,2), %rax
movq %rax, %rcx
shrq $0x20, %rcx
jne 0x3af1
movb (%rdi), %cl
incq %rdi
testb %cl, %cl
jne 0x3ab7
jmp 0x3ae3
xorl %eax, %eax
popq %rcx
retq
leaq 0x2699(%rip), %rdi      # 0x6185
callq 0x3955
leaq 0x26a6(%rip), %rdi      # 0x619e
callq 0x3955
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: writeInt(char*, unsigned int)
unsigned writeInt(char * const target, uint number)
{
	register char * pos = target;

	// For every decimal digit of number (at least once)
	do
	{
		// Add digicimal digit to output
		*pos++ = ((char)(number % 10)) + '0';
		// Remove decimal digit from number
		number /= 10;
	}while(number);

	// Reverse output
	std::reverse(target, pos);

	// Return number of written characters
	return pos - target;
}

// Assembly:
leaq -0x1(%rdi), %rcx
xorl %eax, %eax
movl $0xcccccccd, %edx       # imm = 0xCCCCCCCD
movl %esi, %r8d
imulq %rdx, %r8
shrq $0x23, %r8
leal (%r8,%r8), %r9d
leal (%r9,%r9,4), %r9d
movl %esi, %r10d
subl %r9d, %r10d
orb $0x30, %r10b
movb %r10b, 0x1(%rcx)
incq %rcx
incl %eax
cmpl $0x9, %esi
movl %r8d, %esi
ja 0x3b08
cmpq %rdi, %rcx
jbe 0x3b59
incq %rdi
movb -0x1(%rdi), %dl
movb (%rcx), %sil
movb %sil, -0x1(%rdi)
movb %dl, (%rcx)
decq %rcx
leaq 0x1(%rdi), %rdx
cmpq %rcx, %rdi
movq %rdx, %rdi
jb 0x3b3e
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: prepareAdjList(unsigned int const*, unsigned long, unsigned int)
read_t * prepareAdjList(uint const * const list, size_t const size, uint maxVal)
{
	// Allocate adjacency list
	read_t * const adj = (read_t*) calloc((maxVal + 2), sizeof(*adj));
	if(!adj) printError("Memory allocation failed");
	read_t * const counts = adj + 1;

	// Count occurences of each index
	for(register uint const * pos = list; pos < (list + size); ++pos) ++(counts[*pos]);

	// Convert occurency counts to real adjacency list
	read_t * const adjEnd = adj + maxVal + 1;
	adj[0] = 0;
	for(register read_t * adjPos = adj; adjPos < adjEnd; ++adjPos) adjPos[1] += adjPos[0];

	// Return adjacency list
	return adj;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movl %edx, %ebx
movq %rsi, %r15
movq %rdi, %r14
leal 0x2(%rbx), %edi
movl $0x8, %esi
callq 0x20f0
testq %rax, %rax
je 0x3d6b
testq %r15, %r15
jle 0x3d30
leaq (%r14,%r15,4), %rcx
movl (%r14), %edx
incq 0x8(%rax,%rdx,8)
addq $0x4, %r14
cmpq %rcx, %r14
jb 0x3d1f
movl %ebx, %ecx
leaq (%rax,%rcx,8), %rdx
addq $0x8, %rdx
movq $0x0, (%rax)
cmpq %rdx, %rax
jae 0x3d65
leaq (%rax,%rcx,8), %rcx
movq (%rax), %rdx
movq %rax, %rsi
addq $-0x8, %rsi
addq 0x10(%rsi), %rdx
movq %rdx, 0x10(%rsi)
addq $0x8, %rsi
cmpq %rcx, %rsi
jb 0x3d54
popq %rbx
popq %r14
popq %r15
retq
leaq 0x244c(%rip), %rdi      # 0x61be
callq 0x3955
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: countSort(unsigned int*, unsigned long)
void countSort(uint * const list, size_t const size)
{
	// Determine maximum list value
	uint const maxVal = maxValue(list, size);

	// Allocate counter list
	read_t * const counts = (read_t*) calloc((maxVal + 1), sizeof(*counts));
	if(!counts) printError("Memory allocation failed");

	// Count occurences of each index
	for(uint const * pos = list; pos < (list + size); ++pos) ++(counts[*pos]);

	// Write counted elements back to list
	register uint val = 0;
	for(register read_t pos = 0; pos < size; ++pos)
	{
		// Go to next count greater zero
		while(!counts[val]) ++val;
		
		// Add value to list
		list[pos] = val;
		--counts[val];
	}
	
	free(counts);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
leaq (%rdi,%rsi,4), %r15
testq %rsi, %rsi
jle 0x3da4
xorl %edi, %edi
movq %r14, %rax
movl (%rax), %ecx
cmpl %edi, %ecx
cmoval %ecx, %edi
addq $0x4, %rax
cmpq %r15, %rax
jb 0x3d90
incl %edi
jmp 0x3da9
movl $0x1, %edi
movl $0x8, %esi
callq 0x20f0
testq %rax, %rax
je 0x3e07
testq %rbx, %rbx
jle 0x3dcf
movq %r14, %rcx
movl (%rcx), %edx
incq (%rax,%rdx,8)
addq $0x4, %rcx
cmpq %r15, %rcx
jb 0x3dc0
testq %rbx, %rbx
je 0x3dfa
xorl %ecx, %ecx
xorl %edx, %edx
movl %edx, %esi
movq (%rax,%rsi,8), %rdi
incl %edx
testq %rdi, %rdi
je 0x3dd8
decl %edx
movl %edx, (%r14,%rcx,4)
decq %rdi
movq %rdi, (%rax,%rsi,8)
incq %rcx
cmpq %rbx, %rcx
jne 0x3dd8
movq %rax, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x21d0
leaq 0x23b0(%rip), %rdi      # 0x61be
callq 0x3955
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: boolSort(unsigned int*, unsigned long)
void boolSort(uint * const list, size_t const size)
{
	// Determine maximum list value
	uint const maxVal = maxValue(list, size);

	std::vector<bool> bitSet(maxVal + 1, false);

	// Set the corresponding bit in bitSet for every value in the list
	for(uint const * pos = list; pos < list + size; ++pos)
	{
		// If bit is already set ...
		if(bitSet[*pos])
		{
			// Print warning and call countSort as fallback
			printf("Value occures multiple times. Fallback tack countSort.\n");
			countSort(list, size);
			return;
		}
		else bitSet[*pos] = true;
	}

	// Write the found values back to the list
	register uint val = 0;
	for(register uint * pos = list; pos < list + size; ++pos)
	{
		while(!bitSet[val]) ++val;
		*pos = val++;
	}
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movq %rsi, %r14
movq %rdi, %rbx
leaq (%rdi,%rsi,4), %r15
testq %rsi, %rsi
jle 0x3e44
xorl %esi, %esi
movq %rbx, %rax
movl (%rax), %ecx
cmpl %esi, %ecx
cmoval %ecx, %esi
addq $0x4, %rax
cmpq %r15, %rax
jb 0x3e30
incl %esi
jmp 0x3e49
movl $0x1, %esi
leaq 0x7(%rsp), %rdx
movb $0x0, (%rdx)
leaq 0x8(%rsp), %rdi
leaq 0x6(%rsp), %rcx
callq 0x30cc
testq %r14, %r14
jle 0x3e96
movq 0x8(%rsp), %rax
movq %rbx, %rdx
movl (%rdx), %ecx
movl $0x1, %esi
shlq %cl, %rsi
movl %ecx, %edi
shrl $0x6, %edi
movq (%rax,%rdi,8), %r8
btq %rcx, %r8
jb 0x3ec5
orq %r8, %rsi
movq %rsi, (%rax,%rdi,8)
addq $0x4, %rdx
cmpq %r15, %rdx
jb 0x3e6d
testq %r14, %r14
jle 0x3edc
xorl %eax, %eax
movq 0x8(%rsp), %rcx
movl %eax, %edx
shrl $0x6, %edx
movq (%rcx,%rdx,8), %rdx
movl %eax, %esi
incl %eax
btq %rsi, %rdx
jae 0x3ea2
leal -0x1(%rax), %edx
movl %edx, (%rbx)
addq $0x4, %rbx
cmpq %r15, %rbx
jb 0x3ea2
jmp 0x3edc
leaq 0x233e(%rip), %rdi      # 0x620a
callq 0x2250
movq %rbx, %rdi
movq %r14, %rsi
callq 0x3d77
movq 0x8(%rsp), %rdi
testq %rdi, %rdi
je 0x3f04
callq 0x2160
xorl %eax, %eax
movq %rax, 0x8(%rsp)
movl %eax, 0x10(%rsp)
movq %rax, 0x18(%rsp)
movl %eax, 0x20(%rsp)
movq %rax, 0x28(%rsp)
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/HelperFunctions.cpp
// Function: countSort2D(std::vector<unsigned int*, std::allocator<unsigned int*>>, unsigned long)
void countSort2D(std::vector<uint *> const lists, size_t const rows)
{
	// Determine maximum index
	uint const maxIndex = maxValue(lists[0], rows);

	// Allocate adjacency list
	read_t * const adj = prepareAdjList(lists[0], rows, maxIndex);

	uint * const arrCpy = (uint*)malloc(rows * sizeof(*arrCpy));
	if(!arrCpy) printError("Memory allocation failed");

	// Sort all lists (except the first one) with respect to values in first list
	for(size_t i = 1; i < lists.size(); ++i)
	{
		// Copy arr
		memcpy(arrCpy, lists[i], rows * sizeof(*arrCpy));

		// Move rows back to arr but to the correct position
		for(register size_t pos = 0; pos < rows; ++pos)
		{
			uint const targetRow = adj[lists[0][pos]];
			lists[i][targetRow] = arrCpy[pos];
			++adj[lists[0][pos]];
		}

		memmove(adj + 1, adj, (maxIndex + 1) * sizeof(*adj));
		adj[0] = 0;
	}

	// Sort the first list
	memcpy(arrCpy, lists[0], rows * sizeof(*arrCpy));

	for(register size_t pos = 0; pos < rows; ++pos)
	{
		uint const targetRow = adj[arrCpy[pos]];
		lists[0][targetRow] = arrCpy[pos];
		++adj[arrCpy[pos]];
	}

	// Clean up
	free(arrCpy);
	free(adj);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %rbx
movq %rdi, 0x10(%rsp)
movq (%rdi), %rax
movq (%rax), %rdi
testq %rsi, %rsi
jle 0x3f91
leaq (%rdi,%rbx,4), %rax
xorl %ebp, %ebp
movq %rdi, %rcx
movl (%rcx), %edx
cmpl %ebp, %edx
cmoval %edx, %ebp
addq $0x4, %rcx
cmpq %rax, %rcx
jb 0x3f7f
jmp 0x3f93
xorl %ebp, %ebp
movq %rbx, %rsi
movl %ebp, %edx
callq 0x3cf7
movq %rax, %r14
leaq (,%rbx,4), %rdi
movq %rdi, 0x8(%rsp)
callq 0x21f0
testq %rax, %rax
je 0x40bc
movq %rax, %r12
movq 0x10(%rsp), %rax
movq (%rax), %r13
movq 0x8(%rax), %rax
subq %r13, %rax
cmpq $0x9, %rax
jb 0x4066
movq %r14, %rax
addq $0x8, %rax
movq %rax, 0x18(%rsp)
incl %ebp
shlq $0x3, %rbp
movl $0x1, %r15d
movq %rbp, 0x20(%rsp)
movq (%r13,%r15,8), %rbp
movq %r12, %rdi
movq %rbp, %rsi
movq 0x8(%rsp), %rdx
callq 0x2140
testq %rbx, %rbx
je 0x4032
movq (%r13), %rax
xorl %ecx, %ecx
movl (%rax,%rcx,4), %edx
movl (%r14,%rdx,8), %edx
movl (%r12,%rcx,4), %esi
movl %esi, (%rbp,%rdx,4)
movl (%rax,%rcx,4), %edx
incq (%r14,%rdx,8)
incq %rcx
cmpq %rcx, %rbx
jne 0x4014
movq 0x18(%rsp), %rdi
movq %r14, %rsi
movq 0x20(%rsp), %rdx
callq 0x2270
movq $0x0, (%r14)
incq %r15
movq 0x10(%rsp), %rax
movq (%rax), %r13
movq 0x8(%rax), %rax
subq %r13, %rax
sarq $0x3, %rax
cmpq %rax, %r15
jb 0x3ff4
movq (%r13), %r15
movq %r12, %rdi
movq %r15, %rsi
movq 0x8(%rsp), %rdx
callq 0x2140
testq %rbx, %rbx
je 0x409e
xorl %eax, %eax
movl (%r12,%rax,4), %ecx
movq (%r14,%rcx,8), %rdx
movl %edx, %esi
movl %ecx, (%r15,%rsi,4)
incq %rdx
movq %rdx, (%r14,%rcx,8)
incq %rax
cmpq %rax, %rbx
jne 0x4081
movq %r12, %rdi
callq 0x21d0
movq %r14, %rdi
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x21d0
leaq 0x20fb(%rip), %rdi      # 0x61be
callq 0x3955
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/WeightedGraph.cpp
// Function: WeightedGraph::WeightedGraph(WeightedGraph&&)
WeightedGraph::WeightedGraph(WeightedGraph && other) : Graph(other.numNodes, other.nodes, other.transitions), weights(other.weights)
{
	other.numNodes = 0;
	other.nodes = 0;
	other.transitions = 0;
	other.weights = 0;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movl 0x8(%rsi), %esi
movq 0x10(%rbx), %rdx
movq 0x18(%rbx), %rcx
callq 0x248c
leaq 0x4be1(%rip), %rax      # 0x8d80
movq %rax, (%r14)
movq 0x20(%rbx), %rax
movq %rax, 0x20(%r14)
movl $0x0, 0x8(%rbx)
xorps %xmm0, %xmm0
movups %xmm0, 0x10(%rbx)
movq $0x0, 0x20(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/WeightedGraph.cpp
// Function: WeightedGraph::doWalk(unsigned int, unsigned int, FastPRNG&, char*) const
size_t WeightedGraph::doWalk(uint node, uint32_t walk_len, FastPRNG & prng, char * const out) const
{
	// Write start node to output string
	char * outPos = out;

	{
		unsigned const wrote = writeInt(outPos, node);
		outPos += wrote;
	}

	while(--walk_len)
	{
		// Determine the number of outgoing transitions (from the current node)
		uint const outgoingTransitions = getNumTransitions(node);
		if(!outgoingTransitions)
		{
			fprintf(stderr, "Node %d has no outgoing transitions\n", node);
			break;
		}

		// Choose a successor node
		uint const accWeight = weights[nodes[node + 1] - 1];
		node = getNodeByWeight(node, prng.uniformInRange<uint>(accWeight - 1));

		// Write node number to output
		{
			*(outPos++) = ',';
			unsigned const wrote = writeInt(outPos, node);
			outPos += wrote;
		}
	}

	*outPos = '\0';

	return outPos - out;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %rbx
movq %rcx, 0x10(%rsp)
movl %edx, %ebp
movl %esi, %r13d
movq %rdi, %r12
movq %r8, %rdi
callq 0x3afd
movl %eax, %r15d
movq %rbx, 0x8(%rsp)
addq %rbx, %r15
decl %ebp
je 0x42a2
movb $0x1, %bl
movl %r13d, %r14d
cmpl %r13d, 0x8(%r12)
jbe 0x421e
movq 0x10(%r12), %rax
movl 0x8(%rax,%r14,8), %ecx
cmpl (%rax,%r14,8), %ecx
sete %bl
testb %bl, %bl
jne 0x4285
movq 0x10(%r12), %rax
movq 0x20(%r12), %rcx
incl %r13d
movq (%rax,%r13,8), %rax
movl -0x4(%rcx,%rax,4), %esi
decl %esi
movq 0x10(%rsp), %rdi
callq 0x303c
movq 0x10(%r12), %rdx
movq 0x20(%r12), %rcx
movl (%rdx,%r14,8), %edx
movl %edx, %esi
incl %edx
cmpl %eax, (%rcx,%rsi,4)
jbe 0x4251
movq 0x18(%r12), %rax
movl (%rax,%rsi,4), %r13d
leaq 0x1(%r15), %rdi
movb $0x2c, (%r15)
movl %r13d, %esi
callq 0x3afd
movl %eax, %eax
addq %rax, %r15
incq %r15
testb %bl, %bl
je 0x41f9
jmp 0x42a2
movq 0x4d54(%rip), %rax      # 0x8fe0
movq (%rax), %rdi
leaq 0x1dca(%rip), %rsi      # 0x6060
movl %r13d, %edx
xorl %eax, %eax
callq 0x2220
jmp 0x427b
movb $0x0, (%r15)
subq 0x8(%rsp), %r15
movq %r15, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/./HelperFunctions.hpp
// Function: unsigned int const* binaryFind<unsigned int const, unsigned int>(unsigned int const*, unsigned int const*, unsigned int)
inline ITER * binaryFind(ITER * const first, ITER * const last, T const val) noexcept
{
	size_t const off = (last - first) >> 1;
	ITER * const mid = last - off;

	if(off < 8) return std::lower_bound(first, last, val);

	return (*mid > val) ? binaryFind(first, mid, val) : binaryFind(mid, last, val);
}

// Assembly:
movq %rdi, %rax
movq %rsi, %rcx
subq %rax, %rcx
movq %rcx, %rdi
sarq $0x3, %rdi
cmpq $0x7, %rdi
jbe 0x4fea
shlq $0x2, %rdi
movq %rsi, %rcx
subq %rdi, %rcx
cmpl %edx, (%rcx)
ja 0x4fe5
movq %rcx, %rax
jmp 0x4fbf
movq %rcx, %rsi
jmp 0x4fbf
sarq $0x2, %rcx
testq %rcx, %rcx
jle 0x501d
movq %rcx, %rsi
shrq %rsi
movq %rsi, %rdi
notq %rdi
addq %rcx, %rdi
leaq (%rax,%rsi,4), %rcx
addq $0x4, %rcx
cmpl %edx, -0x4(%rcx)
cmovaeq %rsi, %rdi
cmovbq %rcx, %rax
movq %rdi, %rcx
testq %rdi, %rdi
jg 0x4ff3
retq
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/walk.cpp
// Function: readParam(int, char const* const*, char const*)
char const * readParam(int argc, char const * const * const argv, char const * argName)
{
	size_t const argLen = strlen(argName);

	//    --argName <value>
	// or --argName=<value>
	if(!strcmp(argv[0] + 2, argName))
	{
		if(argc > 1) return argv[1];
		else
		{
			printf("Missing argument for option %s\n\n", argName);
			printHelp();
			exit(1);
		}
	}
	else if(!strncmp(argv[0] + 2, argName, argLen) && argv[0][argLen + 2] == '=') return argv[0] + argLen + 3;

	// If argument not found ... return NULL
	return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r15
movl %edi, %ebp
movq %rdx, %rdi
callq 0x20a0
movq %rax, %r14
movq (%r15), %r13
leaq 0x2(%r13), %r12
movq %r12, %rdi
movq %rbx, %rsi
callq 0x2210
testl %eax, %eax
je 0x568d
movq %r12, %rdi
movq %rbx, %rsi
movq %r14, %rdx
callq 0x20b0
testl %eax, %eax
je 0x5698
xorl %eax, %eax
jmp 0x56a9
cmpl $0x2, %ebp
jl 0x56b8
movq 0x8(%r15), %rax
jmp 0x56a9
xorl %eax, %eax
cmpb $0x3d, 0x2(%r13,%r14)
leaq 0x3(%r13,%r14), %rcx
cmoveq %rcx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0xd12(%rip), %rdi       # 0x63d1
movq %rbx, %rsi
xorl %eax, %eax
callq 0x2040
callq 0x56d8
movl $0x1, %edi
callq 0x21e0
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/walk.cpp
// Function: printHelp()
void printHelp()
{
	printf("Usage:\n");
	printf("walk [options]\n\n");
	printf("Options (mandatory):\n");
	printf("--if <input file>\n");
	printf("--of <output file>\n");
	printf("--length <walk length>\n");
	printf("--walks <number of walks>\n");
	printf("\n");
	printf("Options (optional):\n");
	printf("-o, --optiTransOrder: Optimize order of transitions\n");
	printf("-p, --print: Print graph\n");
	printf("-r, --reflect: Reflects all transitions (even if counterpart exists)\n");
	printf("-u, --undirected: Converts the graph to an undirected graph\n");
	printf("-w, --weighted: Runs walks on weighted graph\n");
}

// Assembly:
pushq %rax
leaq 0xd12(%rip), %rdi       # 0x63f2
callq 0x2250
leaq 0xd0d(%rip), %rdi       # 0x63f9
callq 0x2250
leaq 0xd11(%rip), %rdi       # 0x6409
callq 0x2250
leaq 0xd1a(%rip), %rdi       # 0x641e
callq 0x2250
leaq 0xd20(%rip), %rdi       # 0x6430
callq 0x2250
leaq 0xd27(%rip), %rdi       # 0x6443
callq 0x2250
leaq 0xd32(%rip), %rdi       # 0x645a
callq 0x2250
movl $0xa, %edi
callq 0x2200
leaq 0xd36(%rip), %rdi       # 0x6474
callq 0x2250
leaq 0xd3e(%rip), %rdi       # 0x6488
callq 0x2250
leaq 0xd66(%rip), %rdi       # 0x64bc
callq 0x2250
leaq 0xd73(%rip), %rdi       # 0x64d5
callq 0x2250
leaq 0xdac(%rip), %rdi       # 0x651a
callq 0x2250
leaq 0xddc(%rip), %rdi       # 0x6556
popq %rax
jmp 0x2250
// File: /workspace/github_cpp_makefile_star2_O1/EnderGed[P]fast-random-walk/walk.cpp
// Function: doWalk(Graph const&, unsigned int, unsigned int, unsigned int, unsigned int, Out&)
void doWalk(Graph const & graph, uint from, uint const to, uint32_t const walk_len, uint32_t const numWalks, Out &out)
{
	FastPRNG prng;

	// Malloc array for output string
	unsigned const maxDigits = hasDigits(graph.getNumNodes() - 1);
	char * const walk = (char *) malloc((maxDigits + 1) * sizeof(*walk) * walk_len);

	for(uint startNode = from; startNode < to; ++startNode) // For every assigned start node
	{
		// Ensure that the node really exists (has outgoing transitions)
		if(graph.getNumTransitions(startNode) == 0) continue;

		for(uint32_t i = 0; i < numWalks; ++i)
		{
			size_t out_len = graph.doWalk(startNode, walk_len, prng, walk);

			walk[out_len++] = '\n';

			// Write output string to file
			out.write(walk, out_len);
		}
	}

	free(walk);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x13b8, %rsp           # imm = 0x13B8
movq %r9, 0x18(%rsp)
movl %r8d, 0xc(%rsp)
movl %ecx, %ebx
movl %edx, %ebp
movl %esi, %r13d
movq %rdi, %r14
xorl %edi, %edi
callq 0x2150
leaq 0x20(%rsp), %rdi
movq %rax, %rsi
callq 0x589c
movl 0x8(%r14), %eax
decl %eax
cvtsi2sd %rax, %xmm0
callq 0x20c0
callq 0x2060
cvttsd2si %xmm0, %rax
incl %eax
movl %ebx, %edi
imulq %rax, %rdi
callq 0x21f0
movq %rax, %r12
cmpl %ebp, %r13d
jae 0x5882
movl %r13d, %r13d
movl %ebp, %eax
movq %rax, 0x10(%rsp)
leaq 0x20(%rsp), %rcx
movl 0x8(%r14), %eax
cmpq %rax, %r13
jae 0x5878
cmpl $0x0, 0xc(%rsp)
sete %al
movq 0x10(%r14), %rsi
movl 0x8(%rsi,%r13,8), %edx
cmpl (%rsi,%r13,8), %edx
sete %dl
orb %al, %dl
jne 0x5878
movl 0xc(%rsp), %ebp
movq (%r14), %rax
movq %r14, %rdi
movl %r13d, %esi
movl %ebx, %edx
movl %ebx, %r15d
movq %rcx, %rbx
movq %r12, %r8
callq *0x10(%rax)
movb $0xa, (%r12,%rax)
leaq 0x1(%rax), %rdx
movq 0x18(%rsp), %rdi
movq %r12, %rsi
callq 0x5926
movq %rbx, %rcx
movl %r15d, %ebx
decl %ebp
jne 0x5841
incq %r13
cmpq 0x10(%rsp), %r13
jne 0x5818
movq %r12, %rdi
callq 0x21d0
addq $0x13b8, %rsp           # imm = 0x13B8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq