LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/ghulette[P]neural-net-openmp/neuralnet.cpp
// Function: NeuralNet::train(double*, double*, double)
void NeuralNet::train(double *input, double *desired_output, double eta) {
  run(input);
  double *iv = input;
  double *hv = hidden_values;
  double *ov = output_values;
  double *dv = desired_output;
  
  // Calculate weight deltas for the output layer
  #pragma omp parallel for
  for(int i=0; i < num_outputs; i++) {
    output_weight_deltas[i] = (dv[i] - ov[i]) * ov[i] * (1.0 - ov[i]);
  }
    
  // Calculate weight deltas for the hidden layer
  #pragma omp parallel for
  for(int i=0; i < num_hidden; i++) {
    double sum = 0.0;
    for(int j=0; j < num_outputs; j++) {
      sum += output_weight_deltas[j] * output_weights[j][i];
    }
    hidden_weight_deltas[i] = sum * hv[i] * (1.0 - hv[i]);
  }
        
  // Update output layer weights
  #pragma omp parallel for
  for(int i=0; i < num_outputs; i++) {
    for(int j=0; j < num_hidden; j++) {
      output_weights[i][j] += eta * output_weight_deltas[i] * hv[j];
    }
  }
            
  // Update hidden layer weights
  #pragma omp parallel for
  for(int i=0; i < num_hidden; i++) {
    for(int j=0; j < num_inputs; j++) {
      hidden_weights[i][j] += eta * hidden_weight_deltas[i] * iv[j];
    }
  }
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movsd %xmm0, 0x8(%rsp)
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
callq 0x3e96
movq 0x28(%r14), %rcx
movl 0x8(%r14), %edx
testl %edx, %edx
jle 0x3ff9
movq 0x48(%r14), %rax
movq 0x40(%r14), %rsi
xorl %edi, %edi
movsd 0x12a3(%rip), %xmm0     # 0x5270
movsd (%r15,%rdi,8), %xmm1
movsd (%rax,%rdi,8), %xmm2
subsd %xmm2, %xmm1
mulsd %xmm2, %xmm1
movapd %xmm0, %xmm3
subsd %xmm2, %xmm3
mulsd %xmm1, %xmm3
movsd %xmm3, (%rsi,%rdi,8)
incq %rdi
cmpq %rdi, %rdx
jne 0x3fcd
movl 0x4(%r14), %eax
testl %eax, %eax
jle 0x4063
movq 0x40(%r14), %rsi
movq 0x20(%r14), %rdi
movq 0x30(%r14), %r8
xorl %r9d, %r9d
movsd 0x1258(%rip), %xmm0     # 0x5270
xorpd %xmm1, %xmm1
testl %edx, %edx
jle 0x403f
xorl %r10d, %r10d
movsd (%rsi,%r10,8), %xmm2
movq (%r8,%r10,8), %r11
mulsd (%r11,%r9,8), %xmm2
addsd %xmm2, %xmm1
incq %r10
cmpq %r10, %rdx
jne 0x4023
movsd (%rcx,%r9,8), %xmm2
mulsd %xmm2, %xmm1
movapd %xmm0, %xmm3
subsd %xmm2, %xmm3
mulsd %xmm1, %xmm3
movsd %xmm3, (%rdi,%r9,8)
incq %r9
cmpq %rax, %r9
jne 0x4018
testl %edx, %edx
movsd 0x8(%rsp), %xmm1
jle 0x40af
movq 0x30(%r14), %rsi
movq 0x40(%r14), %rdi
xorl %r8d, %r8d
testl %eax, %eax
jle 0x40a7
movq (%rsi,%r8,8), %r9
xorl %r10d, %r10d
movsd (%rdi,%r8,8), %xmm0
mulsd %xmm1, %xmm0
mulsd (%rcx,%r10,8), %xmm0
addsd (%r9,%r10,8), %xmm0
movsd %xmm0, (%r9,%r10,8)
incq %r10
cmpq %r10, %rax
jne 0x4083
incq %r8
cmpq %rdx, %r8
jne 0x4078
testl %eax, %eax
jle 0x40f6
movl (%r14), %ecx
movq 0x20(%r14), %rdx
movq 0x10(%r14), %rsi
xorl %edi, %edi
testl %ecx, %ecx
jle 0x40ee
movq (%rsi,%rdi,8), %r8
xorl %r9d, %r9d
movsd (%rdx,%rdi,8), %xmm0
mulsd %xmm1, %xmm0
mulsd (%rbx,%r9,8), %xmm0
addsd (%r8,%r9,8), %xmm0
movsd %xmm0, (%r8,%r9,8)
incq %r9
cmpq %r9, %rcx
jne 0x40cb
incq %rdi
cmpq %rax, %rdi
jne 0x40c0
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/ghulette[P]neural-net-openmp/neuralnet.cpp
// Function: NeuralNet::mse(double*)
double NeuralNet::mse(double *desired_values) {
  double sum = 0.0;
  for(int i=0; i < num_outputs; i++) {
    double diff = desired_values[i] - output_values[i];
    sum += diff * diff;
  }
  return sum;
}

// Assembly:
movslq 0x8(%rdi), %rax
testq %rax, %rax
jle 0x412e
movq 0x48(%rdi), %rcx
xorpd %xmm0, %xmm0
xorl %edx, %edx
movsd (%rsi,%rdx,8), %xmm1
subsd (%rcx,%rdx,8), %xmm1
mulsd %xmm1, %xmm1
addsd %xmm1, %xmm0
incq %rdx
cmpq %rdx, %rax
jne 0x4113
retq
xorps %xmm0, %xmm0
retq
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/main.cpp
// Function: main
int main()
{
	cout << "Prolog++" << endl;
	cout << "~~~~~~~~~~~~~~~~~~~~~" << endl;
	cout << "Preloaded facts: " << endl << endl;
	consult_test("equal(X,X).");
	consult_test("basic(a,b,c).");
	consult_test("person(alice).");
	consult_test("person(bob).");
	cout << endl;

	while(not cin.eof())
	{
		string input;
		cout << "| ?- ";
		cin >> input;
		query_test(input);
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq 0x474f(%rip), %rbx      # 0x6fd0
leaq 0x278e(%rip), %rsi      # 0x5016
movl $0x8, %edx
movq %rbx, %rdi
callq 0x2150
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
leaq 0x275c(%rip), %rsi      # 0x501f
movl $0x15, %edx
movq %rbx, %rdi
callq 0x2150
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
leaq 0x2737(%rip), %rsi      # 0x5035
movl $0x11, %edx
movq %rbx, %rdi
callq 0x2150
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
movq %rax, %r14
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %r14, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
leaq 0x26e4(%rip), %rdi      # 0x5047
callq 0x248c
leaq 0x26e4(%rip), %rdi      # 0x5053
callq 0x248c
leaq 0x26e6(%rip), %rdi      # 0x5061
callq 0x248c
leaq 0x26e9(%rip), %rdi      # 0x5070
callq 0x248c
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
movq 0x4626(%rip), %rbx      # 0x6fe0
movq (%rbx), %rax
movq -0x18(%rax), %rax
testb $0x2, 0x20(%rbx,%rax)
jne 0x2a6a
leaq -0x38(%rbp), %r14
leaq -0x58(%rbp), %r15
leaq -0x48(%rbp), %r12
leaq -0x68(%rbp), %r13
movq %r14, -0x48(%rbp)
movq $0x0, -0x40(%rbp)
movb $0x0, -0x38(%rbp)
movl $0x5, %edx
movq 0x45d8(%rip), %rdi      # 0x6fd0
leaq 0x267e(%rip), %rsi      # 0x507d
callq 0x2150
movq %rbx, %rdi
movq %r12, %rsi
callq 0x2180
movq %r15, -0x68(%rbp)
movq -0x48(%rbp), %rsi
movq -0x40(%rbp), %rdx
addq %rsi, %rdx
movq %r13, %rdi
callq 0x2b54
movq %r13, %rdi
callq 0x25b4
movq -0x68(%rbp), %rdi
cmpq %r15, %rdi
je 0x2a43
movq -0x58(%rbp), %rsi
incq %rsi
callq 0x2130
movq -0x48(%rbp), %rdi
cmpq %r14, %rdi
je 0x2a58
movq -0x38(%rbp), %rsi
incq %rsi
callq 0x2130
movq (%rbx), %rax
movq -0x18(%rax), %rax
testb $0x2, 0x20(%rbx,%rax)
je 0x29dc
xorl %eax, %eax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x68(%rbp), %rdi
cmpq %r15, %rdi
je 0x2a98
movq -0x58(%rbp), %rsi
incq %rsi
callq 0x2130
jmp 0x2a98
movq %rax, %rbx
movq -0x48(%rbp), %rdi
cmpq %r14, %rdi
je 0x2aad
movq -0x38(%rbp), %rsi
incq %rsi
callq 0x2130
movq %rbx, %rdi
callq 0x21d0
nop
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/atom.cpp
// Function: Atom::Atom(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
Atom::Atom(string n)
{
	name = n;
	if('A' <= n[0] and n[0] <= 'Z')
	{
		free_variable = true;
	}
	else
	{
		free_variable = false;
	}
	if(n.size() == 1 and n[0] == '_')
	{
		cout << "UNDERSCORE DETECTED" << endl;
		is_under_score = true;
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %r15
movq %rdi, %rbx
leaq 0x10(%rdi), %r14
movq %r14, (%rdi)
xorl %eax, %eax
movq %rax, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
leaq 0x28(%rdi), %r12
xorps %xmm0, %xmm0
movups %xmm0, 0x28(%rdi)
movq %rax, 0x38(%rdi)
callq 0x2090
movq (%r15), %rax
movb (%rax), %cl
addb $-0x41, %cl
cmpb $0x1a, %cl
setb 0x20(%rbx)
cmpq $0x1, 0x8(%r15)
jne 0x2e9f
cmpb $0x5f, (%rax)
jne 0x2e9f
movq 0x4174(%rip), %r15      # 0x6fd0
leaq 0x2264(%rip), %rsi      # 0x50c7
movl $0x13, %edx
movq %r15, %rdi
callq 0x2150
movq (%r15), %rax
addq -0x18(%rax), %r15
movq %r15, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq 0x4142(%rip), %rdi      # 0x6fd0
callq 0x2030
movq %rax, %rdi
callq 0x20a0
movb $0x1, 0x21(%rbx)
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r15
movq (%r12), %rdi
testq %rdi, %rdi
je 0x2ec0
movq 0x38(%rbx), %rsi
subq %rdi, %rsi
callq 0x2130
movq %rbx, %rdi
movq %r14, %rsi
callq 0x2224
movq %r15, %rdi
callq 0x21d0
nop
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/atom.cpp
// Function: Atom::unifyWith(Atom*)
bool Atom::unifyWith(Atom * a)
{
  if(a->free_variable)
  {
    if(not free_variable)
    {
      a->possibilties.push_back(this);
    }
    else
    {
      cout << "not sure what to do here" << endl;
    }
    return true;
  }
  else if(*a == *this)
  {
    return true;
  }
  else
  {
    return false;
  }
}

// Assembly:
movq %rdi, %rax
cmpb $0x1, 0x20(%rsi)
jne 0x2f2d
pushq %rbp
movq %rsp, %rbp
pushq %rbx
pushq %rax
cmpb $0x0, 0x20(%rax)
je 0x2f38
movq 0x40e0(%rip), %rbx      # 0x6fd0
leaq 0x21e4(%rip), %rsi      # 0x50db
movl $0x18, %edx
movq %rbx, %rdi
callq 0x2150
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x2110
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x20a0
jmp 0x2f4e
movq %rsi, %rdi
movq %rax, %rsi
jmp 0x2f58
addq $0x28, %rsi
leaq -0x10(%rbp), %rcx
movq %rax, (%rcx)
movq %rsi, %rdi
movq %rcx, %rsi
callq 0x2fc4
movb $0x1, %al
addq $0x8, %rsp
popq %rbx
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/atom.cpp
// Function: Atom::operator==(Atom&)
bool Atom::operator == (Atom &b)
{
  if(b.free_variable or free_variable)
  {
    return true;
  }
  if(this->name == b.name)
  {
    return true;
  }
  else
  {
    return false;
  }
}

// Assembly:
movb $0x1, %al
cmpb $0x0, 0x20(%rsi)
jne 0x2f8a
cmpb $0x0, 0x20(%rdi)
jne 0x2f8a
movq 0x8(%rdi), %rdx
cmpq 0x8(%rsi), %rdx
jne 0x2f8b
testq %rdx, %rdx
je 0x2f8a
pushq %rbp
movq %rsp, %rbp
movq (%rsi), %rsi
movq (%rdi), %rdi
callq 0x2140
testl %eax, %eax
sete %al
popq %rbp
retq
xorl %eax, %eax
retq
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/parser.cpp
// Function: cropString(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int)
string cropString(string &input_string, int n)
{
	string crop;
	int i = 0;
	for(i = 0; i < input_string.size(); ++i)
	{
		if(i == n)
		{
			break;
		}
		else
		{
			crop.push_back(input_string[i]);
		}
	}
	input_string.erase(0,i+1);
	return crop;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %edx, %eax
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x10(%rdi), %r15
movq %r15, (%rdi)
movq $0x0, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
movl $0x1, %edx
testl %eax, %eax
je 0x31a7
cmpq $0x0, 0x8(%r14)
je 0x31a7
movl %eax, %r12d
movl $0x1, %r13d
movq (%r14), %rax
movsbl -0x1(%rax,%r13), %esi
movq %rbx, %rdi
callq 0x20e0
leaq 0x1(%r13), %rax
cmpq %r13, %r12
je 0x31a5
cmpq %r13, 0x8(%r14)
movq %rax, %r13
ja 0x3182
movl %eax, %edx
movq %r14, %rdi
xorl %esi, %esi
callq 0x2040
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x31c5
movq %rax, %r14
movq (%rbx), %rdi
cmpq %r15, %rdi
je 0x31db
movq (%r15), %rsi
incq %rsi
callq 0x2130
movq %r14, %rdi
callq 0x21d0
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/parser.cpp
// Function: cropString(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>&, char)
string cropString(string &input_string, char delimiter)
{
	string crop;
	int i = 0;
	for(i = 0;i < input_string.size(); ++i)
	{
		if(input_string[i] == delimiter)
		{
			break;
		}
		else
		{
			crop.push_back(input_string[i]);
		}
	}
	input_string.erase(0,i+1);
	return crop;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x10(%rdi), %r13
movq %r13, (%rdi)
movq $0x0, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
cmpq $0x0, 0x8(%rsi)
je 0x323c
movl %edx, %r12d
xorl %r15d, %r15d
movq (%r14), %rax
movb (%rax,%r15), %al
cmpb %r12b, %al
je 0x3237
movsbl %al, %esi
movq %rbx, %rdi
callq 0x20e0
incq %r15
cmpq %r15, 0x8(%r14)
ja 0x3217
incl %r15d
jmp 0x3242
movl $0x1, %r15d
movq %r14, %rdi
xorl %esi, %esi
movq %r15, %rdx
callq 0x2040
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x3263
movq %rax, %r14
movq (%rbx), %rdi
cmpq %r13, %rdi
je 0x327a
movq (%r13), %rsi
incq %rsi
callq 0x2130
movq %r14, %rdi
callq 0x21d0
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/parser.cpp
// Function: countChar(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, char)
int countChar(string s, char c)
{
	int count = 0;
	for(int i = 0; i < s.size(); ++i)
	{
		if(s[i]==c)
		{
			++count;
		}
	}
	return count;
}

// Assembly:
movq 0x8(%rdi), %rcx
testq %rcx, %rcx
je 0x32ae
pushq %rbp
movq %rsp, %rbp
movq (%rdi), %rdx
xorl %edi, %edi
xorl %eax, %eax
xorl %r8d, %r8d
cmpb %sil, (%rdx,%rdi)
sete %r8b
addl %r8d, %eax
incq %rdi
cmpq %rdi, %rcx
jne 0x3296
popq %rbp
retq
xorl %eax, %eax
retq
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/parser.cpp
// Function: strip_ws(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
string strip_ws(string s)
{
	string new_s;
	for(int i = 0; i < s.size(); ++i)
	{
		if(s[i]!=' ')
		{
			new_s.push_back(s[i]);
		}
	}
	return new_s;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %rbx
leaq 0x10(%rdi), %r15
movq %r15, (%rdi)
movq $0x0, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
cmpq $0x0, 0x8(%rsi)
je 0x3336
movq %rsi, %r14
xorl %r12d, %r12d
movq (%r14), %rax
movb (%rax,%r12), %al
cmpb $0x20, %al
je 0x332d
movsbl %al, %esi
movq %rbx, %rdi
callq 0x20e0
incq %r12
cmpq %r12, 0x8(%r14)
ja 0x3317
movq %rbx, %rax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
movq (%rbx), %rdi
cmpq %r15, %rdi
je 0x3358
movq (%r15), %rsi
incq %rsi
callq 0x2130
movq %r14, %rdi
callq 0x21d0
// File: /workspace/github_cpp_makefile_star2_O1/lotka[P]prologplusplus/predicate.cpp
// Function: Predicate::unifyWith(PredicateRef*)
bool Predicate::unifyWith(PredicateRef * ref)
{
	if(ref->name == name and ref->airty == airty)
	{
		for(int i = 0; i < airty; ++i)
		{
			if(not args[i]->unifyWith(ref->args[i]))
			{
				return false;
			}
		}
	}
	else
	{
		return false;
	}

	return true;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq 0x8(%rsi), %rdx
cmpq 0x8(%rdi), %rdx
jne 0x433d
movq %rsi, %rbx
movq %rdi, %r14
testq %rdx, %rdx
je 0x42e1
movq (%r14), %rsi
movq (%rbx), %rdi
callq 0x2140
testl %eax, %eax
jne 0x433d
movl 0x38(%rbx), %eax
cmpl 0x20(%r14), %eax
jne 0x433d
cmpl $0x0, 0x20(%r14)
setle %r15b
jle 0x4340
movq 0x28(%r14), %rax
movq (%rax), %rdi
movq 0x20(%rbx), %rax
movq (%rax), %rsi
callq 0x2ed4
testb %al, %al
je 0x4340
movl $0x1, %r12d
movslq 0x20(%r14), %rax
cmpq %rax, %r12
setge %r15b
jge 0x4340
movq 0x28(%r14), %rax
movq (%rax,%r12,8), %rdi
movq 0x20(%rbx), %rax
movq (%rax,%r12,8), %rsi
callq 0x2ed4
incq %r12
testb %al, %al
jne 0x4312
jmp 0x4340
xorl %r15d, %r15d
movl %r15d, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/ArashPartow[P]exprtk-extras/exprtk_compilation_timeout.cpp
// Function: compilation_timeout_check::continue_compilation(exprtk::compilation_check::compilation_context&)
bool continue_compilation(compilation_context& context) override
   {
      if (++iterations_ >= max_iters_per_check)
      {
         if (std::chrono::steady_clock::now() >= timeout_tp_)
         {
            context.error_message = "Compilation has timed-out";
            return false;
         }

         iterations_ = 0;
      }

      return true;
   }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq 0x8(%rdi), %rax
incq %rax
movq %rax, 0x8(%rdi)
movb $0x1, %bl
cmpq $0x2710, %rax           # imm = 0x2710
jb 0x11e786
movq %rsi, %r14
movq %rdi, %r15
callq 0x116490
cmpq 0x10(%r15), %rax
jge 0x11e769
movq $0x0, 0x8(%r15)
jmp 0x11e786
movq 0x8(%r14), %rdx
leaq 0x1aa3a3(%rip), %rcx    # 0x2c8b17
xorl %ebx, %ebx
movl $0x19, %r8d
movq %r14, %rdi
xorl %esi, %esi
callq 0x116240
movl %ebx, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/test_sum.cpp
// Function: range_test(std::mersenne_twister_engine<unsigned long, 32ul, 624ul, 397ul, 31ul, 2567483615ul, 11ul, 4294967295ul, 7ul, 2636928640ul, 15ul, 4022730752ul, 18ul, 1812433253ul>&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>&, std::vector<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int>>> const&, std::vector<int, std::allocator<int>> const&, unsigned int)
static void range_test(std::mt19937& rnd, test_map& m,
		       const test_vector& vec,
		       const std::vector<int>& series,
		       unsigned int limit)
{
    int a = rnd() % (limit + 1);
    int b = rnd() % (limit + 1);

    if (a > b)
	std::swap(a, b);

    test_map::const_iterator ia = m.find(vec[a].first);
    test_map::const_iterator ib = m.find(vec[b].first);

    const int sa = a ? series[a - 1] : 0;
    const int sb = b ? series[b - 1] : 0;

    const int vsum = sb - sa;
    const int msum = m.sum(ia, ib).sum;

    assert(vsum == msum);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %r8d, %r12d
movq %rcx, 0x10(%rsp)
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r13
callq 0x2b5e
incl %r12d
xorl %edx, %edx
divq %r12
movq %rdx, %rbp
movq %r13, %rdi
callq 0x2b5e
xorl %edx, %edx
divq %r12
cmpl %edx, %ebp
movl %edx, %r12d
cmovgl %ebp, %r12d
cmovll %ebp, %edx
movslq %edx, %rbp
leaq (,%rbp,4), %rsi
addq %rbp, %rsi
shlq $0x3, %rsi
addq (%r15), %rsi
leaq 0x8(%rbx), %r13
movq %rbx, %rdi
movq %r13, %rdx
callq 0x2cc6
movq %rax, 0x8(%rsp)
movslq %r12d, %r14
leaq (%r14,%r14,4), %rsi
shlq $0x3, %rsi
addq (%r15), %rsi
movq %rbx, %rdi
movq %r13, %rdx
callq 0x2cc6
movq 0x10(%rsp), %rdx
movl $0x0, %ecx
testl %ebp, %ebp
je 0x29bf
movq (%rdx), %rcx
movl -0x4(%rcx,%rbp,4), %ecx
testl %r12d, %r12d
movl $0x0, %r15d
je 0x29d2
movq (%rdx), %rdx
movl -0x4(%rdx,%r14,4), %r15d
subl %ecx, %r15d
incq %rbx
movq %rbx, %rdi
movq 0x8(%rsp), %rsi
movq %rax, %rdx
callq 0x2d26
cmpl %eax, %r15d
jne 0x29fc
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x2729(%rip), %rdi      # 0x512c
leaq 0x2673(%rip), %rsi      # 0x507d
leaq 0x2728(%rip), %rcx      # 0x5139
movl $0x2c, %edx
callq 0x20b0
nop
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::sum_between(aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary> const&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*)
static summary_type sum_between(const aggregator_type& ag,
				    node *first, node *last)
    {
	if (is_header(first))
	    return ag.nothing();

	// This special case works, because last is the parent of the
	// root. The sum will include the root's right subtree iff the
	// path to first is left of the root
	if (is_header(last))
	    return ag.combine(ag.summarize(first->value),
			      sum_from(ag, first, last));

	if (first == last)
	    return ag.nothing();

	node *c = concestor(first, last);

	summary_type sum = ag.summarize(first->value);

	sum = ag.combine(sum, sum_from(ag, first, c));

	if ((c != last) && (c != first))
	    sum = ag.combine(sum, c->value);

	sum = ag.combine(sum, sum_to(ag, last, c));

	return sum;
    }

// Assembly:
xorl %eax, %eax
cmpq $0x0, 0x40(%rsi)
je 0x2dbf
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
cmpq $0x0, 0x40(%rdx)
je 0x2d9d
cmpq %rbx, %r15
je 0x2db1
movq %r15, %rdi
movq %rbx, %rsi
callq 0x2e1e
movq %rax, %r12
movl 0x20(%r15), %r13d
movq %r14, %rdi
movq %r15, %rsi
movq %rax, %rdx
callq 0x2dc0
movl %eax, %ebp
addl %r13d, %ebp
cmpq %rbx, %r12
sete %al
cmpq %r15, %r12
sete %cl
orb %al, %cl
jne 0x2d8d
addl 0x20(%r12), %ebp
movq %r14, %rdi
movq %rbx, %rsi
movq %r12, %rdx
callq 0x2e7c
jmp 0x2daf
movl 0x20(%r15), %ebp
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0x2dc0
addl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::sum_from(aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary> const&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*)
static summary_type sum_from(const aggregator_type& ag,
				 node *start, node *root)
    {
	summary_type sum = ag.nothing();
	node *n = start;

	while (n != root) {
	    if (n != start)
		sum = ag.combine(sum, n->value);

	    sum = ag.combine(sum, sum_tree(ag, n->right));

	    // Ascend to an ancestor which is lexicographically after n.
	    while (is_right_child(n) && n->parent != root)
		n = n->parent;

	    n = n->parent;
	}

	return sum;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
cmpq %rdx, %rsi
je 0x2e11
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
xorl %ebp, %ebp
movq %rsi, %r12
cmpq %r14, %r12
je 0x2de5
addl 0x20(%r12), %ebp
movq 0x38(%r12), %rsi
movq %r15, %rdi
callq 0x2eda
movq %r12, %rcx
movq 0x40(%rcx), %r12
cmpq %rbx, %r12
je 0x2e08
cmpq %rcx, 0x38(%r12)
movq %r12, %rcx
je 0x2df5
addl %eax, %ebp
cmpq %rbx, %r12
jne 0x2ddb
jmp 0x2e13
xorl %ebp, %ebp
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::concestor(summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*)
static node *concestor(node *a, node *b)
    {
	int da = depth_of(a);
	int db = depth_of(b);

	// Make sure b is the deeper of the two
	if (da > db) {
	    std::swap(da, db);
	    std::swap(a, b);
	}

	// Climb up b until we find an ancestor of the same depth as a
	while (da < db) {
	    b = b->parent;
	    db--;
	}

	// Climb both simultaneously until we meet
	while (a != b) {
	    a = a->parent;
	    b = b->parent;
	}

	return a;
    }

// Assembly:
movl $0xffffffff, %ecx       # imm = 0xFFFFFFFF
movq %rdi, %rax
movq 0x40(%rax), %rax
incl %ecx
testq %rax, %rax
jne 0x2e26
movl $0xffffffff, %r8d       # imm = 0xFFFFFFFF
movq %rsi, %rax
movq 0x40(%rax), %rax
incl %r8d
testq %rax, %rax
jne 0x2e3a
cmpl %r8d, %ecx
jbe 0x2e53
movq %rsi, %rax
movl %r8d, %edx
jmp 0x2e5e
movq %rdi, %rax
movq %rsi, %rdi
movl %ecx, %edx
movl %r8d, %ecx
cmpl %ecx, %edx
jae 0x2e76
movq 0x40(%rdi), %rdi
decl %ecx
cmpl %ecx, %edx
jl 0x2e62
jmp 0x2e76
movq 0x40(%rax), %rax
movq 0x40(%rdi), %rdi
cmpq %rdi, %rax
jne 0x2e6e
retq
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::sum_to(aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary> const&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*)
static summary_type sum_to(const aggregator_type& ag,
			       node *end, node *root)
    {
	summary_type sum = ag.nothing();
	node *n = end;

	while (n != root) {
	    if (n != end)
		sum = ag.combine(n->value, sum);

	    sum = ag.combine(sum_tree(ag, n->left), sum);

	    // Ascend to an ancestor which is lexicographically before
	    // n.
	    while (is_left_child(n) && n->parent != root)
		n = n->parent;

	    n = n->parent;
	}

	return sum;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
cmpq %rdx, %rsi
je 0x2ecd
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
xorl %ebp, %ebp
movq %rsi, %r12
cmpq %r14, %r12
je 0x2ea1
addl 0x20(%r12), %ebp
movq 0x30(%r12), %rsi
movq %r15, %rdi
callq 0x2eda
movq %r12, %rcx
movq 0x40(%rcx), %r12
cmpq %rbx, %r12
je 0x2ec4
cmpq %rcx, 0x30(%r12)
movq %r12, %rcx
je 0x2eb1
addl %eax, %ebp
cmpq %rbx, %r12
jne 0x2e97
jmp 0x2ecf
xorl %ebp, %ebp
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::sum_tree(aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary> const&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node*)
static summary_type sum_tree(const aggregator_type& ag, node *n)
    {
	if (!n)
	    return ag.nothing();

	if (!(n->flags & node::SUM_VALID)) {
	    n->sum =
		ag.combine(
		    ag.combine(sum_tree(ag, n->left), ag.summarize(n->value)),
		    sum_tree(ag, n->right));
	    n->flags |= node::SUM_VALID;
	}

	return n->sum;
    }

// Assembly:
testq %rsi, %rsi
je 0x2f1a
pushq %rbp
pushq %r14
pushq %rbx
movq %rsi, %rbx
testb $0x2, 0x2c(%rsi)
jne 0x2f12
movq %rdi, %r14
movq 0x30(%rbx), %rsi
callq 0x2eda
movl %eax, %ebp
addl 0x20(%rbx), %ebp
movq 0x38(%rbx), %rsi
movq %r14, %rdi
callq 0x2eda
addl %ebp, %eax
movl %eax, 0x28(%rbx)
orb $0x2, 0x2c(%rbx)
movl 0x28(%rbx), %eax
popq %rbx
popq %r14
popq %rbp
retq
xorl %eax, %eax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/test.cpp
// Function: test_int(unsigned int, unsigned int)
uint32_t test_int(uint32_t n, uint32_t x0)
{
	uint32_t i, x, z = 0;
	cuckoohash_map<uint32_t, uint32_t, Hash32> h;
	for (i = 0, x = x0; i < n; ++i) {
		x = hash32(x);
		h.upsert(get_key(n, x), [&z](uint32_t &v) { z += ++v; }); // FIXME: not sure if this is correct...
		++z;
	}
	fprintf(stderr, "# unique keys: %ld; checksum: %u\n", h.size(), z);
	return h.size();
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x98, %rsp
movl %esi, %ebp
movl %edi, %ebx
leaq 0x50(%rsp), %rdi
leaq 0x18(%rsp), %rdx
leaq 0x38(%rsp), %rcx
leaq 0x8(%rsp), %r8
movl $0x40000, %esi          # imm = 0x40000
callq 0x2968
xorl %r14d, %r14d
testl %ebx, %ebx
je 0x28f8
movl %ebx, %r13d
shrl $0x2, %r13d
xorl %r14d, %r14d
leaq 0x18(%rsp), %r15
leaq 0x50(%rsp), %r12
movl %ebp, %eax
shll $0xf, %eax
notl %eax
addl %ebp, %eax
movl %eax, %ecx
shrl $0xa, %ecx
xorl %eax, %ecx
leal (%rcx,%rcx,8), %eax
movl %eax, %ecx
shrl $0x6, %ecx
xorl %eax, %ecx
movl %ecx, %eax
shll $0xb, %eax
notl %eax
addl %ecx, %eax
movl %eax, %ebp
shrl $0x10, %ebp
xorl %eax, %ebp
movl %ebp, %eax
xorl %edx, %edx
divl %r13d
movl %edx, %eax
shll $0xf, %eax
notl %eax
addl %edx, %eax
movl %eax, %ecx
shrl $0xa, %ecx
xorl %eax, %ecx
leal (%rcx,%rcx,8), %eax
movl %eax, %ecx
shrl $0x6, %ecx
xorl %eax, %ecx
movl %ecx, %eax
shll $0xb, %eax
notl %eax
addl %ecx, %eax
movl %eax, %ecx
shrl $0x10, %ecx
xorl %eax, %ecx
movl %ecx, 0x4(%rsp)
movl %eax, %edx
shrl $0x8, %edx
xorl %eax, %edx
movq %rcx, 0x8(%rsp)
movb %dl, 0x10(%rsp)
movq %r15, %rdi
movq %r12, %rsi
leaq 0x8(%rsp), %rdx
callq 0x2d2c
movq 0x8(%rsp), %rdx
movl 0x10(%rsp), %ecx
leaq 0x38(%rsp), %rdi
movq %r12, %rsi
movq %r15, %r8
leaq 0x4(%rsp), %r9
callq 0x2dac
cmpl $0x0, 0x48(%rsp)
movq 0x38(%rsp), %rsi
je 0x28b3
leaq (%rsi,%rsi,4), %rax
shlq $0x3, %rax
addq 0x68(%rsp), %rax
movq 0x40(%rsp), %rcx
movl 0x4(%rax,%rcx,8), %edx
leal 0x1(%rdx), %esi
movl %esi, 0x4(%rax,%rcx,8)
addl %edx, %r14d
incl %r14d
jmp 0x28ca
movq 0x40(%rsp), %rdx
movzbl 0x10(%rsp), %ecx
movq %r12, %rdi
leaq 0x4(%rsp), %r8
callq 0x2ece
movq 0x30(%rsp), %rax
testq %rax, %rax
je 0x28d7
movb $0x0, (%rax)
movq $0x0, 0x30(%rsp)
movq 0x28(%rsp), %rax
testq %rax, %rax
je 0x28ed
movb $0x0, (%rax)
incl %r14d
decl %ebx
jne 0x27e5
leaq 0x50(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movl %r14d, %esi
movq %rbx, %rdx
callq 0x2528
movl (%rbx), %eax
addq $0x98, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
jmp 0x294c
movq %rax, %rbx
movq 0x30(%rsp), %rax
testq %rax, %rax
je 0x2936
movb $0x0, (%rax)
movq $0x0, 0x30(%rsp)
movq 0x28(%rsp), %rax
testq %rax, %rax
je 0x294c
movb $0x0, (%rax)
leaq 0x70(%rsp), %rdi
callq 0x2a88
leaq 0x58(%rsp), %rdi
callq 0x2aca
movq %rbx, %rdi
callq 0x2210
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::size() const
size_type size() const {
    if (all_locks_.size() == 0) {
      return 0;
    }
    counter_type s = 0;
    for (spinlock &lock : get_current_locks()) {
      s += lock.elem_counter();
    }
    assert(s >= 0);
    return static_cast<size_type>(s);
  }

// Assembly:
pushq %rax
cmpq $0x0, 0x30(%rdi)
je 0x2a83
movq 0x28(%rdi), %rax
movq 0x10(%rax), %rcx
movq 0x18(%rax), %rdx
xorl %eax, %eax
cmpq %rdx, %rcx
je 0x2a5f
addq 0x8(%rcx), %rax
addq $0x40, %rcx
jmp 0x2a50
testq %rax, %rax
jns 0x2a85
leaq 0x3fd7(%rip), %rdi      # 0x6a42
leaq 0x280c(%rip), %rsi      # 0x527e
leaq 0x3fd0(%rip), %rcx      # 0x6a49
movl $0x157, %edx            # imm = 0x157
callq 0x20f0
xorl %eax, %eax
popq %rcx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./libcuckoo_bucket_container.hh
// Function: libcuckoo_bucket_container<unsigned int, unsigned int, std::allocator<std::pair<unsigned int const, unsigned int>>, unsigned char, 4ul>::destroy_buckets()
void destroy_buckets() noexcept {
    if (buckets_ == nullptr) {
      return;
    }
    // The bucket default constructor is nothrow, so we don't have to
    // worry about dealing with exceptions when constructing all the
    // elements.
    static_assert(std::is_nothrow_destructible<bucket>::value,
                  "libcuckoo_bucket_container requires bucket to be nothrow "
                  "destructible");
    clear();
    for (size_type i = 0; i < size(); ++i) {
      traits_::destroy(allocator_, &buckets_[i]);
    }
    bucket_allocator_.deallocate(buckets_, size());
    buckets_ = nullptr;
  }

// Assembly:
cmpq $0x0, 0x10(%rdi)
je 0x2b04
pushq %rbx
movq %rdi, %rbx
callq 0x2b06
xorl %eax, %eax
movq 0x8(%rbx), %rcx
movq %rax, %rdx
shrq %cl, %rdx
incq %rax
testq %rdx, %rdx
je 0x2adc
movq 0x10(%rbx), %rdi
movq 0x8(%rbx), %rax
callq 0x2140
movq $0x0, 0x10(%rbx)
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./libcuckoo_bucket_container.hh
// Function: libcuckoo_bucket_container<unsigned int, unsigned int, std::allocator<std::pair<unsigned int const, unsigned int>>, unsigned char, 4ul>::clear()
void clear() noexcept {
    static_assert(
        std::is_nothrow_destructible<key_type>::value &&
            std::is_nothrow_destructible<mapped_type>::value,
        "libcuckoo_bucket_container requires key and value to be nothrow "
        "destructible");
    for (size_type i = 0; i < size(); ++i) {
      bucket &b = buckets_[i];
      for (size_type j = 0; j < SLOT_PER_BUCKET; ++j) {
        if (b.occupied(j)) {
          eraseKV(i, j);
        }
      }
    }
  }

// Assembly:
pushq %rax
movq 0x8(%rdi), %rax
movl $0x24, %eax
xorl %edx, %edx
movq 0x10(%rdi), %rcx
addq %rax, %rcx
xorl %esi, %esi
cmpb $0x1, (%rcx,%rsi)
jne 0x2b2b
cmpb $0x0, (%rcx,%rsi)
je 0x2b4c
movb $0x0, (%rcx,%rsi)
incq %rsi
cmpq $0x4, %rsi
jne 0x2b1b
incq %rdx
movq 0x8(%rdi), %rcx
movq %rdx, %rsi
shrq %cl, %rsi
addq $0x28, %rax
testq %rsi, %rsi
je 0x2b12
popq %rax
retq
leaq 0x371a(%rip), %rdi      # 0x626d
leaq 0x257d(%rip), %rsi      # 0x50d7
leaq 0x2596(%rip), %rcx      # 0x50f7
movl $0xd6, %edx
callq 0x20f0
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::reserve_calc(unsigned long)
static size_type reserve_calc(const size_type n) {
    const size_type buckets = (n + slot_per_bucket() - 1) / slot_per_bucket();
    size_type blog2;
    for (blog2 = 0; (size_type(1) << blog2) < buckets; ++blog2)
      ;
    assert(n <= buckets * slot_per_bucket() && buckets <= hashsize(blog2));
    return blog2;
  }

// Assembly:
leaq 0x3(%rdi), %rax
movq %rax, %rdx
shrq $0x2, %rdx
movq $-0x1, %rcx
incq %rcx
movl $0x1, %esi
shlq %cl, %rsi
cmpq %rdx, %rsi
jb 0x2b7e
andq $-0x4, %rax
cmpq %rdi, %rax
jb 0x2b9b
movq %rcx, %rax
retq
pushq %rax
leaq 0x269c(%rip), %rdi      # 0x523f
leaq 0x26d4(%rip), %rsi      # 0x527e
leaq 0x26e1(%rip), %rcx      # 0x5292
movl $0x71f, %edx            # imm = 0x71F
callq 0x20f0
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./libcuckoo_bucket_container.hh
// Function: libcuckoo_bucket_container<unsigned int, unsigned int, std::allocator<std::pair<unsigned int const, unsigned int>>, unsigned char, 4ul>::libcuckoo_bucket_container(unsigned long, std::allocator<std::pair<unsigned int const, unsigned int>> const&)
libcuckoo_bucket_container(size_type hp, const allocator_type &allocator)
      : allocator_(allocator), bucket_allocator_(allocator), hashpower_(hp),
        buckets_(bucket_allocator_.allocate(size())) {
    // The bucket default constructor is nothrow, so we don't have to
    // worry about dealing with exceptions when constructing all the
    // elements.
    static_assert(std::is_nothrow_constructible<bucket>::value,
                  "libcuckoo_bucket_container requires bucket to be nothrow "
                  "constructible");
    for (size_type i = 0; i < size(); ++i) {
      traits_::construct(allocator_, &buckets_[i]);
    }
  }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
incq %rdi
movq %rsi, 0x8(%rbx)
movq 0x8(%rbx), %rcx
movl $0x1, %r14d
movl $0x1, %esi
shlq %cl, %rsi
xorl %edx, %edx
callq 0x2c1a
movq %rax, 0x10(%rbx)
movq 0x8(%rbx), %rax
movl $0x24, %eax
movq 0x10(%rbx), %rcx
movl $0x0, (%rcx,%rax)
movq 0x8(%rbx), %rcx
movq %r14, %rdx
shrq %cl, %rdx
incq %r14
addq $0x28, %rax
testq %rdx, %rdx
je 0x2bf0
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::TwoBuckets cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::snapshot_and_lock_two<std::integral_constant<bool, false>>(cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::hash_value const&) const
TwoBuckets snapshot_and_lock_two(const hash_value &hv) const {
    while (true) {
      // Keep the current hashpower and locks we're using to compute the buckets
      const size_type hp = hashpower();
      const size_type i1 = index_hash(hp, hv.hash);
      const size_type i2 = alt_index(hp, hv.partial, i1);
      try {
        return lock_two(hp, i1, i2, TABLE_MODE());
      } catch (hashpower_changed &) {
        // The hashpower changed while taking the locks. Try again.
        continue;
      }
    }
  }

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
movabsq $0x46a4a7935bd1e995, %r12 # imm = 0x46A4A7935BD1E995
movq 0x10(%r15), %rcx
movq $-0x1, %rdx
shlq %cl, %rdx
movq (%rbx), %rax
notq %rdx
movzbl 0x8(%rbx), %r8d
imulq %r12, %r8
addq %r12, %r8
xorq %rax, %r8
andq %rdx, %rax
andq %rdx, %r8
movq %r14, %rdi
movq %r15, %rsi
movq %rcx, %rdx
movq %rax, %rcx
callq 0x2f2c
jmp 0x2d97
movq %rax, %rdi
cmpl $0x1, %edx
jne 0x2da6
callq 0x2090
callq 0x21e0
jmp 0x2d47
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
callq 0x2210
nop
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::table_position cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::cuckoo_insert_loop<std::integral_constant<bool, false>, unsigned int>(cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::hash_value, cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::TwoBuckets&, unsigned int&)
table_position cuckoo_insert_loop(hash_value hv, TwoBuckets &b, K &key) {
    table_position pos;
    while (true) {
      const size_type hp = hashpower();
      pos = cuckoo_insert<TABLE_MODE>(hv, b, key);
      switch (pos.status) {
      case ok:
      case failure_key_duplicated:
        return pos;
      case failure_table_full:
        // Expand the table and try again, re-grabbing the locks
        cuckoo_fast_double<TABLE_MODE, automatic_resize>(hp);
        b = snapshot_and_lock_two<TABLE_MODE>(hv);
        break;
      case failure_under_expansion:
        // The table was under expansion while we were cuckooing. Re-grab the
        // locks and try again.
        b = snapshot_and_lock_two<TABLE_MODE>(hv);
        break;
      default:
        assert(false);
      }
    }
  }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %r9, %rbx
movq %r8, %r14
movq %rsi, %r12
movq %rdi, %r15
leaq 0x28(%rsp), %rax
movq %rdx, (%rax)
movb %cl, 0x8(%rax)
leaq 0x2248(%rip), %r13      # 0x5020
movq 0x10(%r12), %rbp
movq 0x28(%rsp), %rdx
movl 0x30(%rsp), %ecx
movq %r15, %rdi
movq %r12, %rsi
movq %r14, %r8
movq %rbx, %r9
callq 0x2fe6
movl 0x10(%r15), %eax
cmpq $0x5, %rax
ja 0x2eaf
movslq (%r13,%rax,4), %rax
addq %r13, %rax
jmpq *%rax
movq %r12, %rdi
movq %rbp, %rsi
callq 0x3304
leaq 0x8(%rsp), %rdi
movq %r12, %rsi
leaq 0x28(%rsp), %rdx
callq 0x2d2c
movups 0x8(%rsp), %xmm0
movups %xmm0, (%r14)
movq 0x18(%rsp), %rcx
movq $0x0, 0x18(%rsp)
movq 0x10(%r14), %rax
movq %rcx, 0x10(%r14)
testq %rax, %rax
je 0x2e53
movb $0x0, (%rax)
movq 0x20(%rsp), %rcx
movq $0x0, 0x20(%rsp)
movq 0x18(%r14), %rax
movq %rcx, 0x18(%r14)
testq %rax, %rax
je 0x2e71
movb $0x0, (%rax)
movq 0x20(%rsp), %rax
testq %rax, %rax
je 0x2e7e
movb $0x0, (%rax)
movq $0x0, 0x20(%rsp)
movq 0x18(%rsp), %rax
testq %rax, %rax
je 0x2dd8
movb $0x0, (%rax)
jmp 0x2dd8
movq %r15, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x252c(%rip), %rdi      # 0x53e2
leaq 0x23c1(%rip), %rsi      # 0x527e
leaq 0x2524(%rip), %rcx      # 0x53e8
movl $0x447, %edx            # imm = 0x447
callq 0x20f0
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./libcuckoo_bucket_container.hh
// Function: void cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::add_to_bucket<unsigned int>(unsigned long, unsigned long, unsigned char, unsigned int&&)
void setKV(size_type ind, size_type slot, partial_t p, K &&k,
             Args &&... args) {
    bucket &b = buckets_[ind];
    assert(!b.occupied(slot));
    b.partial(slot) = p;
    traits_::construct(allocator_, std::addressof(b.storage_kvpair(slot)),
                       std::piecewise_construct,
                       std::forward_as_tuple(std::forward<K>(k)),
                       std::forward_as_tuple(std::forward<Args>(args)...));
    // This must occur last, to enforce a strong exception guarantee
    b.occupied(slot) = true;
  }

// Assembly:
leaq (%rsi,%rsi,4), %rax
shlq $0x3, %rax
addq 0x18(%rdi), %rax
cmpb $0x1, 0x24(%rdx,%rax)
je 0x2f0c
movb %cl, 0x20(%rax,%rdx)
movl (%r8), %ecx
movl %ecx, (%rax,%rdx,8)
movl $0x0, 0x4(%rax,%rdx,8)
movb $0x1, 0x24(%rax,%rdx)
movq 0x28(%rdi), %rax
movzwl %si, %ecx
movq 0x10(%rax), %rax
shll $0x6, %ecx
incq 0x8(%rax,%rcx)
retq
pushq %rax
leaq 0x3358(%rip), %rdi      # 0x626c
leaq 0x21bc(%rip), %rsi      # 0x50d7
leaq 0x39a0(%rip), %rcx      # 0x68c2
movl $0xc9, %edx
callq 0x20f0
// File: /workspace/github_cpp_makefile_star2_O1/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::lock_two(unsigned long, unsigned long, unsigned long, std::integral_constant<bool, false>) const
TwoBuckets lock_two(size_type hp, size_type i1, size_type i2,
                      normal_mode) const {
    size_type l1 = lock_ind(i1);
    size_type l2 = lock_ind(i2);
    if (l2 < l1) {
      std::swap(l1, l2);
    }
    locks_t &locks = get_current_locks();
    locks[l1].lock();
    check_hashpower(hp, locks[l1]);
    if (l2 != l1) {
      locks[l2].lock();
    }
    return TwoBuckets(locks, i1, i2, normal_mode());
  }

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movl $0xffff, %eax           # imm = 0xFFFF
movq %rcx, %r9
andq %rax, %r9
andq %r8, %rax
cmpq %r9, %rax
movq %r9, %r11
cmovbq %rax, %r11
movq 0x28(%rsi), %r10
movl %r11d, %ebx
shll $0x6, %ebx
addq 0x10(%r10), %rbx
movb $0x1, %bpl
xchgb %bpl, (%rbx)
testb %bpl, %bpl
jne 0x2f56
cmpq %r9, %rax
movq %r9, %rbx
cmovaq %rax, %rbx
movq 0x10(%r10), %r14
movq 0x10(%rsi), %rsi
cmpq %rdx, %rsi
jne 0x2fc1
cmpl %r9d, %eax
je 0x2f8c
shll $0x6, %ebx
addq 0x10(%r10), %rbx
movb $0x1, %dl
xchgb %dl, (%rbx)
testb %dl, %dl
jne 0x2f84
movq %rcx, (%rdi)
movq %r8, 0x8(%rdi)
movq 0x10(%r10), %rcx
movl %r9d, %edx
shll $0x6, %edx
addq %rcx, %rdx
movq %rdx, 0x10(%rdi)
movl %eax, %edx
shll $0x6, %edx
addq %rcx, %rdx
xorl %ecx, %ecx
cmpq %rax, %r9
cmovneq %rdx, %rcx
movq %rcx, 0x18(%rdi)
movq %rdi, %rax
popq %rbx
popq %r14
popq %rbp
retq
shll $0x6, %r11d
movb $0x0, (%r14,%r11)
movl $0x1, %edi
callq 0x20b0
leaq 0x5cfd(%rip), %rsi      # 0x8cd8
movq %rax, %rdi
xorl %edx, %edx
callq 0x2200
nop