LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/preprocessorinterface.cpp
// Function: maxPreprocessor::PreprocessorInterface::printMap(std::ostream&)
void PreprocessorInterface::printMap(ostream& output) {
		output<<solverVarToPPVar.size()<<" "<<variables<<" "<<originalVariables<<'\n';
		for (int t : solverVarToPPVar) {
			output<<t<<" ";
		}
		output<<'\n';
		output<<preprocessor.trace.operations.size()<<'\n';
		for (unsigned i = 0; i < preprocessor.trace.operations.size(); i++) {
			output<<preprocessor.trace.operations[i]<<" ";
			output<<preprocessor.trace.data[i].size()<<" ";
			for (int a : preprocessor.trace.data[i]) {
				output<<a<<" ";
			}
			output<<'\n';
		}
		output.flush();
	}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq 0x1870(%rdi), %rsi
subq 0x1868(%rdi), %rsi
sarq $0x2, %rsi
movq %rbx, %rdi
callq 0x31e0
leaq 0x66ae(%rip), %r15      # 0x301f4
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
movl (%r14), %esi
movq %rax, %rdi
callq 0x3480
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
movl 0x4(%r14), %esi
movq %rax, %rdi
callq 0x3480
pushq $0xa
popq %rsi
movq %rax, %rdi
callq 0x3320
movq 0x1868(%r14), %r12
movq 0x1870(%r14), %r13
cmpq %r13, %r12
je 0x29bae
movl (%r12), %esi
movq %rbx, %rdi
callq 0x3480
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
addq $0x4, %r12
jmp 0x29b8c
pushq $0xa
popq %rbp
movq %rbx, %rdi
movl %ebp, %esi
callq 0x3320
movq 0x308(%r14), %rsi
subq 0x300(%r14), %rsi
sarq $0x2, %rsi
movq %rbx, %rdi
callq 0x31e0
movq %rax, %rdi
movl %ebp, %esi
callq 0x3320
xorl %r12d, %r12d
leaq 0x660b(%rip), %r15      # 0x301f4
movl %r12d, %r12d
movq 0x300(%r14), %rax
movq 0x308(%r14), %rcx
subq %rax, %rcx
sarq $0x2, %rcx
cmpq %r12, %rcx
jbe 0x29c91
movl (%rax,%r12,4), %esi
movq %rbx, %rdi
callq 0x3480
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
movq 0x318(%r14), %rax
imulq $0x18, %r12, %rbp
movq 0x8(%rax,%rbp), %rsi
subq (%rax,%rbp), %rsi
sarq $0x2, %rsi
movq %rbx, %rdi
callq 0x31e0
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
movq 0x318(%r14), %rax
movq (%rax,%rbp), %r13
movq 0x8(%rax,%rbp), %rbp
cmpq %rbp, %r13
je 0x29c7e
movl (%r13), %esi
movq %rbx, %rdi
callq 0x3480
movq %rax, %rdi
movq %r15, %rsi
callq 0x32a0
addq $0x4, %r13
jmp 0x29c5c
movq %rbx, %rdi
pushq $0xa
popq %rsi
callq 0x3320
incl %r12d
jmp 0x29be9
movq %rbx, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x31f0
nop
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/cardinalityconstraint.cpp
// Function: maxPreprocessor::CardinalityConstraint::HSort(std::vector<int, std::allocator<int>> const&, int, int, maxPreprocessor::CardinalityConstraint::Formula&, bool, bool)
vector<int> CardinalityConstraint::HSort(const vector<int>& A, int l, int r, Formula& F, bool d1, bool d2) {
	int le = r-l+1;
	assert(le >= 2);
	assert(le%2 == 0);
	if (le == 2) {
		vector<int> a = {A[l]};
		vector<int> b = {A[r]};
		return HMerge(a, b, F, d1, d2);
	}
	else {
		int m = (l+r)/2;
		vector<int> a = HSort(A, l, m, F, d1, d2);
		vector<int> b = HSort(A, m+1, r, F, d1, d2);
		return HMerge(a, b, F, d1, d2);
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movl %r8d, %eax
subl %ecx, %eax
jle 0x2b193
testb $0x1, %al
je 0x2b1b2
movl %r8d, %r15d
movq %rdx, %r12
movq %rdi, %rbx
movb 0x88(%rsp), %bpl
movb 0x80(%rsp), %r13b
cmpl $0x1, %eax
jne 0x2b0ef
movq %r9, %r14
movslq %ecx, %rax
movq (%r12), %rcx
movl (%rcx,%rax,4), %eax
leaq 0x10(%rsp), %rsi
movl %eax, (%rsi)
leaq 0x28(%rsp), %rdi
pushq $0x1
popq %rdx
leaq 0x4(%rsp), %rcx
callq 0x18af6
movslq %r15d, %rax
movq (%r12), %rcx
movl (%rcx,%rax,4), %eax
leaq 0x4(%rsp), %rsi
movl %eax, (%rsi)
leaq 0x10(%rsp), %rdi
pushq $0x1
popq %rdx
leaq 0x3(%rsp), %rcx
callq 0x18af6
subq $0x8, %rsp
movzbl %bpl, %eax
movzbl %r13b, %r9d
leaq 0x30(%rsp), %rdx
leaq 0x18(%rsp), %rcx
movq %rbx, %rdi
movq %r14, %r8
pushq %rax
callq 0x2a2b6
popq %rax
popq %rcx
leaq 0x10(%rsp), %rdi
callq 0x7512
leaq 0x28(%rsp), %rdi
callq 0x7512
jmp 0x2b181
movq %rbx, 0x8(%rsp)
leal (%r15,%rcx), %eax
pushq $0x2
popq %rdi
cltd
idivl %edi
movl %eax, %ebx
movzbl %bpl, %r14d
movzbl %r13b, %ebp
leaq 0x28(%rsp), %rdi
movq %r12, %rdx
movq %rsi, 0x40(%rsp)
movl %eax, %r8d
movq %r9, %r13
pushq %r14
pushq %rbp
callq 0x2b026
popq %rax
popq %rcx
incl %ebx
leaq 0x10(%rsp), %rdi
movq 0x40(%rsp), %rsi
movq %r12, %rdx
movl %ebx, %ecx
movl %r15d, %r8d
movq %r13, %r9
pushq %r14
pushq %rbp
callq 0x2b026
popq %rax
popq %rcx
subq $0x8, %rsp
leaq 0x30(%rsp), %rdx
leaq 0x18(%rsp), %rcx
movq 0x10(%rsp), %rdi
movq %r13, %r8
movl %ebp, %r9d
pushq %r14
callq 0x2a2b6
popq %rax
popq %rcx
leaq 0x10(%rsp), %rdi
callq 0x7512
leaq 0x28(%rsp), %rdi
callq 0x7512
movq 0x8(%rsp), %rbx
movq %rbx, %rax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x61e6(%rip), %rdi      # 0x31380
leaq 0x5fef(%rip), %rsi      # 0x31190
leaq 0x61e0(%rip), %rcx      # 0x31388
movl $0x80, %edx
callq 0x31c0
leaq 0x623f(%rip), %rdi      # 0x313f8
leaq 0x5fd0(%rip), %rsi      # 0x31190
leaq 0x61c1(%rip), %rcx      # 0x31388
movl $0x81, %edx
callq 0x31c0
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x7512
jmp 0x2b1f2
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x7512
jmp 0x2b1f7
movq %rax, %rbx
jmp 0x2b1f7
movq %rax, %rbx
leaq 0x28(%rsp), %rdi
callq 0x7512
jmp 0x2b206
movq %rax, %rbx
movq %rbx, %rdi
callq 0x3490
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/cardinalityconstraint.cpp
// Function: maxPreprocessor::CardinalityConstraint::Card(std::vector<int, std::allocator<int>> const&, int, int, int, maxPreprocessor::CardinalityConstraint::Formula&, bool, bool)
vector<int> CardinalityConstraint::Card(const vector<int>& A, int l, int r, int k, Formula& F, bool d1, bool d2) {
	int n = (r-l+1);
	assert(n%k == 0);
	if (n == k) {
		return HSort(A, l, r, F, d1, d2);
	}
	else {
		vector<int> a = Card(A, l, l+k-1, k, F, d1, d2);
		vector<int> b = Card(A, l+k, r, k, F, d1, d2);
		assert((int)a.size() == k && (int)b.size() == k);
		return SMerge(a, b, F, d1, d2);
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rdx, %r13
movq %rsi, %r15
movl %r8d, %esi
subl %ecx, %esi
incl %esi
movl %esi, %eax
cltd
idivl %r9d
testl %edx, %edx
jne 0x2b35f
movl %r9d, %r14d
movl %r8d, %ebp
movq %rdi, %rbx
movb 0x90(%rsp), %dl
movb 0x88(%rsp), %al
movq 0x80(%rsp), %r11
cmpl %r9d, %esi
jne 0x2b283
movzbl %dl, %r10d
movzbl %al, %eax
movq %rbx, %rdi
movq %r15, %rsi
movq %r13, %rdx
movl %ebp, %r8d
movq %r11, %r9
pushq %r10
pushq %rax
callq 0x2b026
popq %rax
popq %rcx
movq %rbx, %rax
jmp 0x2b350
movq %rbx, 0x10(%rsp)
leal (%r14,%rcx), %esi
movl %esi, 0xc(%rsp)
leal (%r14,%rcx), %r8d
decl %r8d
subq $0x8, %rsp
movzbl %dl, %ebx
movzbl %al, %r12d
leaq 0x38(%rsp), %rdi
movq %r15, %rsi
movq %r13, %rdx
movl %r14d, %r9d
pushq %rbx
pushq %r12
pushq %r11
callq 0x2b20e
addq $0x20, %rsp
subq $0x8, %rsp
leaq 0x20(%rsp), %rdi
movq %r15, %rsi
movq %r13, %rdx
movl 0x14(%rsp), %ecx
movl %ebp, %r8d
movl %r14d, %r9d
pushq %rbx
pushq %r12
movq 0x98(%rsp), %rax
movq %rax, %r15
pushq %rax
callq 0x2b20e
addq $0x20, %rsp
movq 0x38(%rsp), %rax
subq 0x30(%rsp), %rax
shrq $0x2, %rax
cmpl %r14d, %eax
jne 0x2b37e
movq 0x20(%rsp), %rax
subq 0x18(%rsp), %rax
shrq $0x2, %rax
cmpl %r14d, %eax
jne 0x2b37e
subq $0x8, %rsp
leaq 0x38(%rsp), %rdx
leaq 0x20(%rsp), %rcx
movq 0x18(%rsp), %r14
movq %r14, %rdi
movq %r15, %r8
movl %r12d, %r9d
pushq %rbx
callq 0x2a8b0
popq %rax
popq %rcx
leaq 0x18(%rsp), %rdi
callq 0x7512
leaq 0x30(%rsp), %rdi
callq 0x7512
movq %r14, %rax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x609c(%rip), %rdi      # 0x31402
leaq 0x5e23(%rip), %rsi      # 0x31190
leaq 0x6097(%rip), %rcx      # 0x3140b
movl $0x90, %edx
callq 0x31c0
leaq 0x60fa(%rip), %rdi      # 0x3147f
leaq 0x5e04(%rip), %rsi      # 0x31190
leaq 0x6078(%rip), %rcx      # 0x3140b
movl $0x97, %edx
callq 0x31c0
movq %rax, %rbx
leaq 0x18(%rsp), %rdi
callq 0x7512
jmp 0x2b3af
movq %rax, %rbx
leaq 0x30(%rsp), %rdi
callq 0x7512
movq %rbx, %rdi
callq 0x3490
nop
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/cardinalityconstraint.cpp
// Function: maxPreprocessor::CardinalityConstraint::getLessNetwork(int, std::vector<int, std::allocator<int>>)
pair<CardinalityConstraint::Formula, int> CardinalityConstraint::getLessNetwork(int freeVar, vector<int> input) {
	int k = 1;
	while (k <= K) k *= 2;
	Formula F(freeVar);
	while ((int)input.size()%k != 0) {
		F.clauses.push_back({-F.freeVar});
		input.push_back(F.freeVar++);
	}
	vector<int> output = Card(input, 0, (int)input.size()-1, k, F, true, iff);
	return {F, -output[K]};
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, %r15
movq %rdi, 0x48(%rsp)
movq %rsi, 0x50(%rsp)
movl 0x38(%rsi), %eax
pushq $0x1
popq %rcx
movl %ecx, %r12d
leal (%r12,%r12), %ecx
cmpl %eax, %r12d
jle 0x2b3e3
leaq 0x20(%rsp), %rax
andq $0x0, 0x10(%rax)
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movl %edx, 0x18(%rax)
leal -0x1(%r12), %ebx
leaq 0x8(%rsp), %rbp
pushq $0x1
popq %r14
leaq 0x3(%rsp), %r13
movq 0x8(%r15), %r8
subq (%r15), %r8
shrq $0x2, %r8
testl %r8d, %ebx
je 0x2b473
xorl %eax, %eax
subl 0x38(%rsp), %eax
movl %eax, 0x4(%rsp)
movq %rbp, %rdi
leaq 0x4(%rsp), %rsi
movq %r14, %rdx
movq %r13, %rcx
callq 0x18af6
leaq 0x20(%rsp), %rdi
movq %rbp, %rsi
callq 0x1cb40
movq %rbp, %rdi
callq 0x7512
movl 0x38(%rsp), %eax
leal 0x1(%rax), %ecx
movl %ecx, 0x38(%rsp)
movl %eax, 0x8(%rsp)
movq %r15, %rdi
movq %rbp, %rsi
callq 0x19ed4
jmp 0x2b415
decl %r8d
movq 0x50(%rsp), %rbx
movzbl 0x58(%rbx), %eax
subq $0x8, %rsp
leaq 0x10(%rsp), %rdi
movq %rbx, %rsi
movq %r15, %rdx
xorl %ecx, %ecx
movl %r12d, %r9d
pushq %rax
pushq $0x1
leaq 0x38(%rsp), %rax
pushq %rax
callq 0x2b20e
addq $0x20, %rsp
movslq 0x38(%rbx), %rax
movq 0x8(%rsp), %rcx
movl (%rcx,%rax,4), %ebx
leaq 0x20(%rsp), %rsi
movq 0x48(%rsp), %r14
movq %r14, %rdi
callq 0x2d50a
negl %ebx
movl %ebx, 0x20(%r14)
leaq 0x8(%rsp), %rdi
callq 0x7512
leaq 0x20(%rsp), %rdi
callq 0x6aa2
movq %r14, %rax
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x2b4f5
jmp 0x2b504
jmp 0x2b504
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x7512
jmp 0x2b507
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0x6aa2
movq %rbx, %rdi
callq 0x3490
nop
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/cardinalityconstraint.cpp
// Function: maxPreprocessor::CardinalityConstraint::getGreaterNetwork(int, std::vector<int, std::allocator<int>>)
pair<CardinalityConstraint::Formula, int> CardinalityConstraint::getGreaterNetwork(int freeVar, vector<int> input) {
	int KK = (int)input.size() - K;
	int k = 1;
	while (k < KK) k *= 2;
	Formula F(freeVar);
	for (int& lit : input) {
		lit = -lit;
	}
	while ((int)input.size()%k != 0) {
		F.clauses.push_back({-F.freeVar});
		input.push_back(F.freeVar++);
	}
	vector<int> output = Card(input, 0, (int)input.size()-1, k, F, iff, true);
	return {F, output[KK-1]};
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, %r14
movq %rdi, 0x48(%rsp)
movq (%rcx), %rax
movq 0x8(%rcx), %r8
movq %r8, %rcx
subq %rax, %rcx
shrq $0x2, %rcx
movq %rsi, 0x50(%rsp)
movslq 0x38(%rsi), %rsi
movslq %ecx, %rbx
subq %rsi, %rbx
pushq $0x1
popq %rcx
movl %ecx, %r12d
leal (%r12,%r12), %ecx
cmpl %ebx, %r12d
jl 0x2b553
andq $0x0, 0x20(%rsp)
xorps %xmm0, %xmm0
movaps %xmm0, 0x10(%rsp)
movl %edx, 0x28(%rsp)
movq %rax, %rcx
cmpq %r8, %rcx
je 0x2b581
negl (%rcx)
addq $0x4, %rcx
jmp 0x2b574
leal -0x1(%r12), %r15d
leaq 0x30(%rsp), %rbp
leaq 0xb(%rsp), %r13
subq %rax, %r8
shrq $0x2, %r8
testl %r8d, %r15d
je 0x2b5f1
xorl %eax, %eax
subl 0x28(%rsp), %eax
movl %eax, 0xc(%rsp)
movq %rbp, %rdi
leaq 0xc(%rsp), %rsi
pushq $0x1
popq %rdx
movq %r13, %rcx
callq 0x18af6
leaq 0x10(%rsp), %rdi
movq %rbp, %rsi
callq 0x1cb40
movq %rbp, %rdi
callq 0x7512
movl 0x28(%rsp), %eax
leal 0x1(%rax), %ecx
movl %ecx, 0x28(%rsp)
movl %eax, 0x30(%rsp)
movq %r14, %rdi
movq %rbp, %rsi
callq 0x19ed4
movq (%r14), %rax
movq 0x8(%r14), %r8
jmp 0x2b590
decl %r8d
movq 0x50(%rsp), %rsi
movzbl 0x58(%rsi), %eax
subq $0x8, %rsp
leaq 0x38(%rsp), %rdi
movq %r14, %rdx
xorl %ecx, %ecx
movl %r12d, %r9d
pushq $0x1
pushq %rax
leaq 0x28(%rsp), %rax
pushq %rax
callq 0x2b20e
addq $0x20, %rsp
movq 0x30(%rsp), %rax
leaq (%rax,%rbx,4), %rdx
addq $-0x4, %rdx
leaq 0x10(%rsp), %rsi
movq 0x48(%rsp), %rbx
movq %rbx, %rdi
callq 0x2d494
leaq 0x30(%rsp), %rdi
callq 0x7512
leaq 0x10(%rsp), %rdi
callq 0x6aa2
movq %rbx, %rax
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x2b66b
jmp 0x2b67a
jmp 0x2b67a
movq %rax, %rbx
leaq 0x30(%rsp), %rdi
callq 0x7512
jmp 0x2b67d
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x6aa2
movq %rbx, %rdi
callq 0x3490
nop
// File: /workspace/github_cpp_makefile_star2_O2/Laakeri[P]maxpre/src/cardinalityconstraint.cpp
// Function: maxPreprocessor::CardinalityConstraint::getBestLessNetwork(int, std::vector<int, std::allocator<int>>)
pair<CardinalityConstraint::Formula, int> CardinalityConstraint::getBestLessNetwork(int freeVar, vector<int> input) {
	auto cLess = getLessNetwork(freeVar, input);
	auto cGreater = getGreaterNetwork(freeVar, input);
	if (cLess.F.size() <= cGreater.F.size()) {
		return cLess;
	}
	else {
		return cGreater;
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x88, %rsp
movq %rcx, %r12
movl %edx, %ebp
movq %rsi, %r15
movq %rdi, %rbx
leaq 0x20(%rsp), %r13
movq %r13, %rdi
movq %rcx, %rsi
callq 0x19284
leaq 0x38(%rsp), %r14
movq %r14, %rdi
movq %r15, %rsi
movl %ebp, %edx
movq %r13, %rcx
callq 0x2b3c2
leaq 0x20(%rsp), %rdi
callq 0x7512
leaq 0x8(%rsp), %rdi
movq %r12, %rsi
callq 0x19284
leaq 0x60(%rsp), %r12
leaq 0x8(%rsp), %rcx
movq %r12, %rdi
movq %r15, %rsi
movl %ebp, %edx
callq 0x2b51a
leaq 0x8(%rsp), %rdi
callq 0x7512
movq 0x40(%rsp), %rax
subq 0x38(%rsp), %rax
movq 0x68(%rsp), %rcx
subq 0x60(%rsp), %rcx
cmpq %rcx, %rax
movq %r14, %rsi
cmovaq %r12, %rsi
movq %rbx, %rdi
callq 0x2d4b2
movq %r12, %rdi
callq 0x6aa2
movq %r14, %rdi
callq 0x6aa2
movq %rbx, %rax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x7512
jmp 0x2bc4a
movq %rax, %rbx
leaq 0x38(%rsp), %rdi
callq 0x6aa2
jmp 0x2bc63
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0x7512
movq %rbx, %rdi
callq 0x3490
nop
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_growth_policy.h
// Function: tsl::rh::power_of_two_growth_policy<2ul>::power_of_two_growth_policy(unsigned long&)
explicit power_of_two_growth_policy(std::size_t& min_bucket_count_in_out) {
        if(min_bucket_count_in_out > max_bucket_count()) {
            TSL_RH_THROW_OR_TERMINATE(std::length_error, "The hash table exceeds its maxmimum size.");
        }
        
        if(min_bucket_count_in_out > 0) {
            min_bucket_count_in_out = round_up_to_power_of_two(min_bucket_count_in_out);
            m_mask = min_bucket_count_in_out - 1;
        }
        else {
            m_mask = 0;
        }
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq (%rsi), %rdi
movabsq $-0x7fffffffffffffff, %rax # imm = 0x8000000000000001
cmpq %rax, %rdi
jae 0x17dd
testq %rdi, %rdi
je 0x17d0
movq %rsi, %r14
callq 0x1916
movq %rax, (%r14)
decq %rax
jmp 0x17d2
xorl %eax, %eax
movq %rax, (%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
pushq $0x10
popq %rdi
callq 0x1080
movq %rax, %rbx
leaq 0x18e7(%rip), %rsi      # 0x30d6
movq %rax, %rdi
callq 0x1120
movq 0x37e2(%rip), %rsi      # 0x4fe0
movq 0x37cb(%rip), %rdx      # 0x4fd0
movq %rbx, %rdi
callq 0x1180
movq %rax, %r14
movq %rbx, %rdi
callq 0x10d0
movq %r14, %rdi
callq 0x1190
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::rehash_on_extreme_load()
bool rehash_on_extreme_load() {
        if(m_grow_on_next_insert || size() >= m_load_threshold) {
            rehash_impl(GrowthPolicy::next_bucket_count());
            m_grow_on_next_insert = false;
            
            return true;
        }
        
        if(m_try_skrink_on_next_insert) {
            m_try_skrink_on_next_insert = false;
            if(m_min_load_factor != 0.0f && load_factor() < m_min_load_factor) {
                reserve(size() + 1);
                
                return true;
            }
        }
        
        return false;
    }

// Assembly:
pushq %rbx
movq %rdi, %rbx
cmpb $0x0, 0x44(%rdi)
jne 0x1c95
movq 0x30(%rbx), %rsi
cmpq 0x38(%rbx), %rsi
jae 0x1c95
cmpb $0x1, 0x4c(%rbx)
jne 0x1d08
movb $0x0, 0x4c(%rbx)
movss 0x48(%rbx), %xmm0
xorps %xmm1, %xmm1
ucomiss %xmm1, %xmm0
jne 0x1c85
jnp 0x1d08
movq 0x28(%rbx), %rax
testq %rsi, %rsi
js 0x1cb0
cvtsi2ss %rsi, %xmm1
jmp 0x1cc7
movq %rbx, %rdi
callq 0x1db4
movq %rbx, %rdi
movq %rax, %rsi
callq 0x1d0c
movb $0x0, 0x44(%rbx)
movb $0x1, %al
jmp 0x1d0a
movq %rsi, %rcx
shrq %rcx
movl %esi, %edx
andl $0x1, %edx
orq %rcx, %rdx
cvtsi2ss %rdx, %xmm1
addss %xmm1, %xmm1
movq %rax, %rdx
shrq %rdx
movl %eax, %ecx
andl $0x1, %ecx
orq %rdx, %rcx
testq %rax, %rax
js 0x1ce1
cvtsi2ss %rax, %xmm2
jmp 0x1cea
cvtsi2ss %rcx, %xmm2
addss %xmm2, %xmm2
xorps %xmm3, %xmm3
je 0x1cf6
divss %xmm2, %xmm1
movaps %xmm1, %xmm3
ucomiss %xmm3, %xmm0
jbe 0x1d08
incq %rsi
movq %rbx, %rdi
callq 0x1e24
jmp 0x1cac
xorl %eax, %eax
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::rehash_impl(unsigned long)
void rehash_impl(size_type count) {
        robin_hash new_table(count, static_cast<Hash&>(*this), static_cast<KeyEqual&>(*this), 
                             get_allocator(), m_min_load_factor, m_max_load_factor);
        
        const bool use_stored_hash = USE_STORED_HASH_ON_REHASH(new_table.bucket_count());
        for(auto& bucket: m_buckets_data) {
            if(bucket.empty()) { 
                continue; 
            }
            
            const std::size_t hash = use_stored_hash?bucket.truncated_hash():
                                                     new_table.hash_key(KeySelect()(bucket.value()));
                                                     
            new_table.insert_value_on_rehash(new_table.bucket_for_hash(hash), 0, 
                                             bucket_entry::truncate_hash(hash), std::move(bucket.value()));
        }
        
        new_table.m_nb_elements = m_nb_elements;
        new_table.swap(*this);
    }

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdi, %rbx
movss 0x40(%rdi), %xmm1
movss 0x48(%rdi), %xmm0
leaq 0x8(%rsp), %r14
leaq 0x7(%rsp), %r8
movq %r14, %rdi
movq %rbx, %rdx
movq %rbx, %rcx
callq 0x169a
movq 0x8(%rbx), %r15
movq 0x10(%rbx), %r12
addq $0x4, %r15
leaq -0x4(%r15), %rax
cmpq %r12, %rax
je 0x1d73
cmpw $-0x1, (%rax)
je 0x1d6d
movl (%r15), %ecx
movl 0x8(%rsp), %esi
andl %ecx, %esi
movq %r14, %rdi
xorl %edx, %edx
movq %r15, %r8
callq 0x1e7c
addq $0xc, %r15
jmp 0x1d48
movq 0x30(%rbx), %rax
leaq 0x8(%rsp), %rdi
movq %rax, 0x30(%rdi)
movq %rbx, %rsi
callq 0x1ed8
leaq 0x10(%rsp), %rdi
callq 0x162e
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x162e
movq %rbx, %rdi
callq 0x1190
nop
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::insert_value_on_rehash(unsigned long, short, unsigned int, std::pair<unsigned int, unsigned int>&&)
void insert_value_on_rehash(std::size_t ibucket, distance_type dist_from_ideal_bucket, 
                                truncated_hash_type hash, value_type&& value) 
    {
        while(true) {
            if(dist_from_ideal_bucket > m_buckets[ibucket].dist_from_ideal_bucket()) {
                if(m_buckets[ibucket].empty()) {
                    m_buckets[ibucket].set_value_of_empty_bucket(dist_from_ideal_bucket, hash, std::move(value));
                    return;
                }
                else {
                    m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket, hash, value);
                }
            }
            
            dist_from_ideal_bucket++;
            ibucket = next_bucket(ibucket);
        }
    }

// Assembly:
movq (%rdi), %rax
movq 0x20(%rdi), %rcx
imulq $0xc, %rsi, %r9
movzwl (%rcx,%r9), %edi
cmpw %di, %dx
jle 0x1ebe
addq %rcx, %r9
cmpw $-0x1, %di
je 0x1ecc
movl (%r8), %r10d
movl 0x4(%r9), %r11d
movl %r11d, (%r8)
movl %r10d, 0x4(%r9)
movl 0x4(%r8), %r10d
movl 0x8(%r9), %r11d
movl %r11d, 0x4(%r8)
movl %r10d, 0x8(%r9)
movw %dx, (%r9)
jmp 0x1ec0
movl %edx, %edi
incl %edi
incq %rsi
andq %rax, %rsi
movl %edi, %edx
jmp 0x1e83
movq (%r8), %rax
movq %rax, 0x4(%r9)
movw %dx, (%r9)
retq
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::swap(tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>&)
void swap(robin_hash& other) {
        using std::swap;
        
        swap(static_cast<Hash&>(*this), static_cast<Hash&>(other));
        swap(static_cast<KeyEqual&>(*this), static_cast<KeyEqual&>(other));
        swap(static_cast<GrowthPolicy&>(*this), static_cast<GrowthPolicy&>(other));
        swap(m_buckets_data, other.m_buckets_data);
        swap(m_buckets, other.m_buckets);
        swap(m_bucket_count, other.m_bucket_count);
        swap(m_nb_elements, other.m_nb_elements);
        swap(m_load_threshold, other.m_load_threshold);
        swap(m_max_load_factor, other.m_max_load_factor);
        swap(m_grow_on_next_insert, other.m_grow_on_next_insert);
        swap(m_min_load_factor, other.m_min_load_factor);
        swap(m_try_skrink_on_next_insert, other.m_try_skrink_on_next_insert);
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq (%rdi), %rax
movq (%rsi), %rcx
movq %rcx, (%rdi)
movq %rax, (%rsi)
addq $0x8, %rdi
addq $0x8, %rsi
callq 0x1f8c
movq 0x20(%r14), %rax
movq 0x20(%rbx), %rcx
movq %rcx, 0x20(%r14)
movq %rax, 0x20(%rbx)
movq 0x28(%r14), %rax
movq 0x28(%rbx), %rcx
movq %rcx, 0x28(%r14)
movq %rax, 0x28(%rbx)
movq 0x30(%r14), %rax
movq 0x30(%rbx), %rcx
movq %rcx, 0x30(%r14)
movq %rax, 0x30(%rbx)
movq 0x38(%r14), %rax
movq 0x38(%rbx), %rcx
movq %rcx, 0x38(%r14)
movq %rax, 0x38(%rbx)
movss 0x40(%r14), %xmm0
movss 0x40(%rbx), %xmm1
movss %xmm1, 0x40(%r14)
movss %xmm0, 0x40(%rbx)
movb 0x44(%r14), %al
movb 0x44(%rbx), %cl
movb %cl, 0x44(%r14)
movb %al, 0x44(%rbx)
movss 0x48(%r14), %xmm0
movss 0x48(%rbx), %xmm1
movss %xmm1, 0x48(%r14)
movss %xmm0, 0x48(%rbx)
movb 0x4c(%r14), %al
movb 0x4c(%rbx), %cl
movb %cl, 0x4c(%r14)
movb %al, 0x4c(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::insert_value_impl(unsigned long, short, unsigned int, std::pair<unsigned int, unsigned int>&)
void insert_value_impl(std::size_t ibucket, distance_type dist_from_ideal_bucket,
                           truncated_hash_type hash, value_type& value)
    {
        m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket, hash, value);
        ibucket = next_bucket(ibucket);
        dist_from_ideal_bucket++;
        
        while(!m_buckets[ibucket].empty()) {
            if(dist_from_ideal_bucket > m_buckets[ibucket].dist_from_ideal_bucket()) {
                if(dist_from_ideal_bucket >= bucket_entry::DIST_FROM_IDEAL_BUCKET_LIMIT) {
                    /**
                     * The number of probes is really high, rehash the map on the next insert.
                     * Difficult to do now as rehash may throw an exception.
                     */
                    m_grow_on_next_insert = true;
                }
            
                m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket, hash, value);
            }
            
            ibucket = next_bucket(ibucket);
            dist_from_ideal_bucket++;
        }
        
        m_buckets[ibucket].set_value_of_empty_bucket(dist_from_ideal_bucket, hash, std::move(value));
    }

// Assembly:
pushq %rbx
movq 0x20(%rdi), %rax
imulq $0xc, %rsi, %r9
movl (%r8), %ecx
movl 0x4(%rax,%r9), %r10d
movl %r10d, (%r8)
movl %ecx, 0x4(%rax,%r9)
movl 0x4(%r8), %ecx
movl 0x8(%rax,%r9), %r10d
movl %r10d, 0x4(%r8)
movl %ecx, 0x8(%rax,%r9)
movzwl (%rax,%r9), %ecx
movw %dx, (%rax,%r9)
movq (%rdi), %rdx
incq %rsi
andq %rdx, %rsi
incl %ecx
imulq $0xc, %rsi, %r10
leaq (%rax,%r10), %r9
movzwl (%rax,%r10), %r10d
cmpw $-0x1, %r10w
je 0x20a4
cmpw %r10w, %cx
jle 0x2050
cmpw $0x1000, %cx            # imm = 0x1000
jl 0x207d
movb $0x1, 0x44(%rdi)
movl (%r8), %r11d
movl 0x4(%r9), %ebx
movl %ebx, (%r8)
movl %r11d, 0x4(%r9)
movl 0x4(%r8), %r11d
movl 0x8(%r9), %ebx
movl %ebx, 0x4(%r8)
movl %r11d, 0x8(%r9)
movw %cx, (%r9)
movl %r10d, %ecx
jmp 0x2050
movq (%r8), %rax
movq %rax, 0x4(%r9)
movw %cx, (%r9)
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::erase(tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::robin_iterator<false>)
iterator erase(iterator pos) {
        erase_from_bucket(pos);
        
        /**
         * Erase bucket used a backward shift after clearing the bucket.
         * Check if there is a new value in the bucket, if not get the next non-empty.
         */
        if(pos.m_bucket->empty()) {
            ++pos;
        }
        
        m_try_skrink_on_next_insert = true;
        
        return pos;
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movq %rsi, (%rsp)
callq 0x20ea
cmpw $-0x1, (%r14)
jne 0x20da
movq %rsp, %r14
movq %r14, %rdi
callq 0x215e
movq (%r14), %r14
movb $0x1, 0x4c(%rbx)
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/tsl_robin_map/./robin_hash.h
// Function: tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::erase_from_bucket(tsl::detail_robin_hash::robin_hash<std::pair<unsigned int, unsigned int>, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::KeySelect, tsl::robin_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::ValueSelect, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int, unsigned int>>, false, tsl::rh::power_of_two_growth_policy<2ul>>::robin_iterator<false>)
void erase_from_bucket(iterator pos) {
        pos.m_bucket->clear();
        m_nb_elements--;
        
        /**
         * Backward shift, swap the empty bucket, previous_ibucket, with the values on its right, ibucket,
         * until we cross another empty bucket or if the other bucket has a distance_from_ideal_bucket == 0.
         * 
         * We try to move the values closer to their ideal bucket.
         */
        std::size_t previous_ibucket = static_cast<std::size_t>(pos.m_bucket - m_buckets);
        std::size_t ibucket = next_bucket(previous_ibucket);
        
        while(m_buckets[ibucket].dist_from_ideal_bucket() > 0) {
            tsl_rh_assert(m_buckets[previous_ibucket].empty());
            
            const distance_type new_distance = distance_type(m_buckets[ibucket].dist_from_ideal_bucket() - 1);
            m_buckets[previous_ibucket].set_value_of_empty_bucket(new_distance, m_buckets[ibucket].truncated_hash(), 
                                                                  std::move(m_buckets[ibucket].value()));
            m_buckets[ibucket].clear();

            previous_ibucket = ibucket;
            ibucket = next_bucket(ibucket);
        }
    }

// Assembly:
movq %rsi, %rax
cmpw $-0x1, (%rsi)
je 0x20f7
orw $-0x1, (%rax)
decq 0x30(%rdi)
movq 0x20(%rdi), %rcx
subq %rcx, %rax
pushq $0xc
popq %rsi
cqto
idivq %rsi
movq %rax, %rsi
incq %rsi
andq (%rdi), %rsi
movq %rsi, %rdx
imulq $0xc, %rsi, %rsi
movzwl (%rcx,%rsi), %r8d
testw %r8w, %r8w
jle 0x215c
leaq (%rcx,%rsi), %r9
decl %r8d
imulq $0xc, %rax, %rax
movq 0x4(%r9), %r9
movq %r9, 0x4(%rcx,%rax)
movw %r8w, (%rcx,%rax)
movq 0x20(%rdi), %rcx
cmpw $-0x1, (%rcx,%rsi)
je 0x2150
addq %rcx, %rsi
orw $-0x1, (%rsi)
leaq 0x1(%rdx), %rsi
andq (%rdi), %rsi
movq %rdx, %rax
jmp 0x2113
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/ashagraev[P]covariation/main.cpp
// Function: void TPrinter::AddToRow<unsigned long>(unsigned long const&)
void AddToRow(const TValue& value) {
        std::stringstream ss;
        ss.precision(10);
        ss << value;
        Rows.back().push_back(ss.str());
    }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x1a8, %rsp            # imm = 0x1A8
movq %rsi, %r14
movq %rdi, %rbx
leaq -0x1c0(%rbp), %r15
movq %r15, %rdi
callq 0x20b0
movq (%r15), %rax
movq -0x18(%rax), %rax
movq $0xa, -0x1b8(%rbp,%rax)
leaq -0x1b0(%rbp), %rdi
movq (%r14), %rsi
callq 0x20a0
movq 0x40(%rbx), %rbx
leaq -0x1a8(%rbp), %rsi
leaq -0x38(%rbp), %rdi
callq 0x21a0
addq $-0x18, %rbx
leaq -0x38(%rbp), %rsi
movq %rbx, %rdi
callq 0x3bfa
leaq -0x38(%rbp), %rdi
callq 0x2080
leaq -0x1c0(%rbp), %rdi
callq 0x20d0
addq $0x1a8, %rsp            # imm = 0x1A8
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq -0x38(%rbp), %rdi
callq 0x2080
jmp 0x2a43
jmp 0x2a40
movq %rax, %rbx
leaq -0x1c0(%rbp), %rdi
callq 0x20d0
movq %rbx, %rdi
callq 0x21d0
nop
// File: /workspace/github_cpp_makefile_star2_O2/ashagraev[P]covariation/main.cpp
// Function: TPrinter::Print() const::'lambda'(std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>> const&)::operator()(std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>> const&) const
void Print() const {
        auto printRow = [&](const std::vector<std::string>& row){
            const size_t columnWidth = 25;

            std::stringstream rowStream;
            for (const std::string& element : row) {
                PrintNextColumn(rowStream, element, columnWidth);
            }

            printf("%s\n", rowStream.str().c_str());
        };

        printf("%s\n", Title.c_str());
        printRow(Columns);
        for (const std::vector<std::string>& row : Rows) {
            printRow(row);
        }
    }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x1a8, %rsp            # imm = 0x1A8
movq %rsi, %r12
movq (%rdi), %rbx
leaq -0x1d0(%rbp), %r14
movq %r14, %rdi
callq 0x20b0
movq (%r12), %r15
movq 0x8(%r12), %r13
pushq $0x19
popq %r12
cmpq %r13, %r15
je 0x3588
movq %rbx, %rdi
movq %r14, %rsi
movq %r15, %rdx
movq %r12, %rcx
callq 0x35e4
addq $0x20, %r15
jmp 0x356c
leaq -0x1b8(%rbp), %rsi
leaq -0x48(%rbp), %rdi
callq 0x21a0
leaq -0x48(%rbp), %rbx
movq (%rbx), %rdi
callq 0x2190
movq %rbx, %rdi
callq 0x2080
leaq -0x1d0(%rbp), %rdi
callq 0x20d0
addq $0x1a8, %rsp            # imm = 0x1A8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x35cc
movq %rax, %rbx
leaq -0x1d0(%rbp), %rdi
callq 0x20d0
movq %rbx, %rdi
callq 0x21d0
nop
// File: /workspace/github_cpp_makefile_star2_O2/ashagraev[P]covariation/main.cpp
// Function: TWelfordCovariationCalculator::Add(double, double)
void Add(const double x, const double y) override {
        ++Count;
        MeanX += (x - MeanX) / Count;
        SumProducts += (x - MeanX) * (y - MeanY);
        MeanY += (y - MeanY) / Count;
    }

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq 0x8(%rdi), %rax
incq %rax
movq %rax, 0x8(%rdi)
movsd 0x10(%rdi), %xmm2
movapd %xmm0, %xmm3
subsd %xmm2, %xmm3
movq %rax, %xmm4
punpckldq 0x11a1(%rip), %xmm4 # xmm4 = xmm4[0],mem[0],xmm4[1],mem[1]
subpd 0x11a9(%rip), %xmm4     # 0x4050
movapd %xmm4, %xmm5
unpckhpd %xmm4, %xmm5            # xmm5 = xmm5[1],xmm4[1]
addsd %xmm4, %xmm5
divsd %xmm5, %xmm3
addsd %xmm2, %xmm3
movsd %xmm3, 0x10(%rdi)
subsd %xmm3, %xmm0
movsd 0x18(%rdi), %xmm2
subsd %xmm2, %xmm1
mulsd %xmm1, %xmm0
addsd 0x20(%rdi), %xmm0
movsd %xmm0, 0x20(%rdi)
divsd %xmm5, %xmm1
addsd %xmm2, %xmm1
movsd %xmm1, 0x18(%rdi)
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/ashagraev[P]covariation/main.cpp
// Function: void TPrinter::PrintNextColumn<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>(std::__cxx11::basic_stringstream<char, std::char_traits<char>, std::allocator<char>>&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, unsigned long) const
void PrintNextColumn(std::stringstream& out, const TValue& value, size_t columnWidth) const {
        const size_t startLength = out.str().size();
        out << value;
        const size_t currentLength = out.str().size();
        for (size_t i = currentLength; i < startLength + columnWidth; ++i) {
            out << " ";
        }
    }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, %rbx
movq %rdx, %r15
movq %rsi, %r14
leaq 0x18(%rsi), %r12
leaq -0x48(%rbp), %r13
movq %r13, %rdi
movq %r12, %rsi
callq 0x21a0
addq 0x8(%r13), %rbx
movq %r13, %rdi
callq 0x2080
addq $0x10, %r14
movq %r14, %rdi
movq %r15, %rsi
callq 0x2110
leaq -0x48(%rbp), %r15
movq %r15, %rdi
movq %r12, %rsi
callq 0x21a0
movq 0x8(%r15), %r12
movq %r15, %rdi
callq 0x2080
leaq 0xa4b(%rip), %r15       # 0x4099
cmpq %rbx, %r12
jae 0x3663
movq %r14, %rdi
movq %r15, %rsi
callq 0x2130
incq %r12
jmp 0x364e
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/Calculator.cpp
// Function: CalcVariance(std::vector<double, std::allocator<double>>&)
double CalcVariance(vector<double>& v) {
    double s;
    double m;
    int    i;
    s=0;
    for (i=0;i<v.size();++i) {
        s+=v[i];
    }
    m=s/(double) v.size();
    s=0;
    for (i=0;i<v.size();++i) {
        s+=(v[i]-m)*(v[i]-m);
    }
    return (s/(v.size()-1)) ;
}

// Assembly:
movq (%rdi), %rcx
movq 0x8(%rdi), %rax
subq %rcx, %rax
sarq $0x3, %rax
xorpd %xmm1, %xmm1
xorl %edx, %edx
cmpq %rdx, %rax
je 0x6087
addsd (%rcx,%rdx,8), %xmm1
incq %rdx
jmp 0x6078
cvtsi2sd %rax, %xmm0
divsd %xmm0, %xmm1
xorpd %xmm0, %xmm0
xorl %edx, %edx
cmpq %rdx, %rax
je 0x60b1
movsd (%rcx,%rdx,8), %xmm2
subsd %xmm1, %xmm2
mulsd %xmm2, %xmm2
addsd %xmm2, %xmm0
incq %rdx
jmp 0x6096
decq %rax
movq %rax, %xmm1
punpckldq 0x41ff(%rip), %xmm1 # xmm1 = xmm1[0],mem[0],xmm1[1],mem[1]
subpd 0x4207(%rip), %xmm1     # 0xa2d0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
addsd %xmm1, %xmm2
divsd %xmm2, %xmm0
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/Calculator.cpp
// Function: CalcMean(std::vector<double, std::allocator<double>>&)
double CalcMean(vector<double>& v) {
    double s;
    s=0;
    for (int i=0;i<v.size();++i) {
        s+=v[i];
    }
    return s/v.size();
}

// Assembly:
movq (%rdi), %rcx
movq 0x8(%rdi), %rax
subq %rcx, %rax
sarq $0x3, %rax
xorpd %xmm0, %xmm0
xorl %edx, %edx
cmpq %rdx, %rax
je 0x60fd
addsd (%rcx,%rdx,8), %xmm0
incq %rdx
jmp 0x60ee
cvtsi2sd %rax, %xmm1
divsd %xmm1, %xmm0
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/Calculator.cpp
// Function: CalcSum(std::vector<double, std::allocator<double>>&)
double CalcSum(vector<double>& v) {
    double s;
    s=0;
    for (int i=0;i<v.size();++i) {
        s+=v[i];
    }
    return s;
}

// Assembly:
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
xorpd %xmm0, %xmm0
xorl %edx, %edx
cmpq %rdx, %rcx
je 0x612a
addsd (%rax,%rdx,8), %xmm0
incq %rdx
jmp 0x611b
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/ExclusionListProcessor.cpp
// Function: ReadExclusionsFile(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>&)
void ReadExclusionsFile(string f, map<string, int>& m) {
    string line, id;
    ifstream inFile(f.c_str());
    if (inFile.is_open()) {
        while (inFile.good()) {
            getline (inFile, line);
            if (!line.empty()) {
                m[line] = 0;
            }
        }
        inFile.close();
    }
    else {
        cout << "Unable to open " << f << " for reading" << endl;
        exit(EXIT_FAILURE);
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x250, %rsp            # imm = 0x250
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x18(%rsp), %rax
movq %rax, -0x10(%rax)
andq $0x0, -0x8(%rax)
leaq 0x38(%rsp), %rcx
movq %rcx, -0x10(%rcx)
andq $0x0, -0x8(%rcx)
xorl %edx, %edx
movb %dl, (%rax)
movb %dl, (%rcx)
movq (%rdi), %rsi
leaq 0x48(%rsp), %rdi
pushq $0x8
popq %rdx
callq 0x3430
leaq 0xc0(%rsp), %rdi
callq 0x3080
testb %al, %al
je 0x6243
leaq 0x48(%rsp), %r14
leaq 0x8(%rsp), %r15
movq 0x48(%rsp), %rax
movq -0x18(%rax), %rax
cmpl $0x0, 0x68(%rsp,%rax)
jne 0x620e
movq %r14, %rdi
movq %r15, %rsi
callq 0x3060
cmpq $0x0, 0x10(%rsp)
je 0x61db
movq %rbx, %rdi
movq %r15, %rsi
callq 0x4b44
andl $0x0, (%rax)
jmp 0x61db
leaq 0x48(%rsp), %rdi
callq 0x3070
leaq 0x48(%rsp), %rdi
callq 0x30a0
leaq 0x28(%rsp), %rdi
callq 0x3120
leaq 0x8(%rsp), %rdi
callq 0x3120
addq $0x250, %rsp            # imm = 0x250
popq %rbx
popq %r14
popq %r15
retq
movq 0x8d8e(%rip), %rdi      # 0xefd8
leaq 0x409f(%rip), %rsi      # 0xa2f0
callq 0x3250
movq %rax, %rdi
movq %r14, %rsi
callq 0x3230
leaq 0x4098(%rip), %rsi      # 0xa300
movq %rax, %rdi
callq 0x3250
movq %rax, %rdi
callq 0x3140
pushq $0x1
popq %rdi
callq 0x32c0
movq %rax, %rbx
jmp 0x6294
jmp 0x6287
movq %rax, %rbx
leaq 0x48(%rsp), %rdi
callq 0x30a0
leaq 0x28(%rsp), %rdi
callq 0x3120
leaq 0x8(%rsp), %rdi
callq 0x3120
movq %rbx, %rdi
callq 0x3410
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/GA.cpp
// Function: DetermineBestSolution(std::vector<double, std::allocator<double>>&, double&, int&)
void DetermineBestSolution(std::vector<double>& v, double& s, int& x) {
    double bestScore = 999999999;
    int    bestScoreIndex;
    for (int i = 0; i < v.size(); ++i) {
        if (v[i] < bestScore) {
            bestScore = v[i];
            bestScoreIndex = i;
        }
    }
    s = bestScore;
    x = bestScoreIndex;
}

// Assembly:
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
movsd 0x3555(%rip), %xmm0     # 0xa358
xorl %edi, %edi
cmpq %rdi, %rcx
je 0x6e24
movsd (%rax,%rdi,8), %xmm1
ucomisd %xmm1, %xmm0
cmoval %edi, %r8d
minsd %xmm0, %xmm1
incq %rdi
movapd %xmm1, %xmm0
jmp 0x6e05
movsd %xmm0, (%rsi)
movl %r8d, (%rdx)
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/GA.cpp
// Function: GenerateRouletteWheel(std::vector<double, std::allocator<double>>&, std::vector<double, std::allocator<double>>&)
void GenerateRouletteWheel(vector<double>& r, vector<double>& s) {
    vector<double>s2;
    vector<double>::iterator it = max_element(s.begin(), s.end());
    double worstScore = *it;
    double reqSum = 0;
    double prevProb = 0;    
    for (int i = 0; i < s.size(); ++i) {
        s2.push_back(worstScore-s[i]+1);
        reqSum += (worstScore-s[i]+1);
    }
    for (int i = 0; i < s2.size(); ++i) {
        r.push_back(prevProb + (s2[i] / reqSum));
        prevProb += s2[i] / reqSum;
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x40, %rsp
movq %rsi, %r14
movq %rdi, %rbx
andq $0x0, 0x30(%rsp)
xorpd %xmm0, %xmm0
movapd %xmm0, 0x20(%rsp)
movq (%rsi), %rdi
movq 0x8(%rsi), %rsi
callq 0x7ca8
movsd (%rax), %xmm2
movq (%r14), %rax
xorpd %xmm1, %xmm1
xorl %r13d, %r13d
movsd 0x32a7(%rip), %xmm3     # 0xa370
leaq 0x20(%rsp), %r15
leaq 0x10(%rsp), %r12
movsd %xmm2, 0x8(%rsp)
movq 0x8(%r14), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %r13, %rcx
movsd %xmm1, 0x18(%rsp)
jbe 0x713c
movapd %xmm2, %xmm0
subsd (%rax,%r13,8), %xmm0
addsd %xmm3, %xmm0
movsd %xmm0, 0x10(%rsp)
movq %r15, %rdi
movq %r12, %rsi
callq 0x7f58
movq (%r14), %rax
movsd 0x8(%rsp), %xmm2
movapd %xmm2, %xmm0
subsd (%rax,%r13,8), %xmm0
movsd 0x3247(%rip), %xmm3     # 0xa370
addsd %xmm3, %xmm0
movsd 0x18(%rsp), %xmm1
addsd %xmm0, %xmm1
incq %r13
jmp 0x70d9
xorpd %xmm2, %xmm2
movq 0x20(%rsp), %rax
xorl %r15d, %r15d
leaq 0x10(%rsp), %r14
movq 0x28(%rsp), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %r15, %rcx
jbe 0x71a7
movsd (%rax,%r15,8), %xmm0
divsd %xmm1, %xmm0
addsd %xmm2, %xmm0
movsd %xmm0, 0x10(%rsp)
movq %rbx, %rdi
movq %r14, %rsi
movsd %xmm2, 0x8(%rsp)
callq 0x7f58
movq 0x20(%rsp), %rax
movsd (%rax,%r15,8), %xmm0
movsd 0x18(%rsp), %xmm1
divsd %xmm1, %xmm0
movsd 0x8(%rsp), %xmm2
addsd %xmm0, %xmm2
incq %r15
jmp 0x714d
leaq 0x20(%rsp), %rdi
callq 0x4eae
addq $0x40, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x71c3
jmp 0x71c3
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0x4eae
movq %rbx, %rdi
callq 0x3410
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/GA.cpp
// Function: SpinWheel(std::vector<double, std::allocator<double>>&)
int SpinWheel(vector<double>& r) {
    int i;
    double randomNumber = rand() / (double)RAND_MAX;
    for (i = 0; i < r.size(); ++i) {
        if (randomNumber < r[i]) {
            break;
        }
    }
    return i;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
callq 0x30b0
cvtsi2sd %eax, %xmm0
divsd 0x318b(%rip), %xmm0     # 0xa378
movq (%rbx), %rcx
movq 0x8(%rbx), %rax
subq %rcx, %rax
sarq $0x3, %rax
xorl %edx, %edx
cmpq %rdx, %rax
je 0x7215
movsd (%rcx,%rdx,8), %xmm1
ucomisd %xmm0, %xmm1
ja 0x7212
incq %rdx
jmp 0x71fd
movq %rdx, %rax
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/drarwood[P]gags/GA.cpp
// Function: DetermineWorstSolution(std::vector<double, std::allocator<double>>&, double&, int&)
void DetermineWorstSolution(vector<double>& v, double& s, int& x) {
    double worstScore = 0;
    int    worstScoreIndex;
    for (int i = 0; i < v.size(); ++i) {
        if (v[i] > worstScore) {
            worstScore = v[i];
            worstScoreIndex = i;
        }
    }
    s = worstScore;
    x = worstScoreIndex;
}

// Assembly:
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
xorpd %xmm0, %xmm0
xorl %edi, %edi
cmpq %rdi, %rcx
je 0x724a
movsd (%rax,%rdi,8), %xmm1
ucomisd %xmm0, %xmm1
cmoval %edi, %r8d
maxsd %xmm0, %xmm1
incq %rdi
movapd %xmm1, %xmm0
jmp 0x722b
movsd %xmm0, (%rsi)
movl %r8d, (%rdx)
retq