LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/SMT-COMP[P]scrambler/scrambler.cpp
// Function: make_annotation_name()
std::string make_annotation_name()
{
    static uint64_t n = 1;
    std::ostringstream tmp;
    tmp << "smtcomp" << n;
    ++n;
    return tmp.str();
}

// Assembly:
pushq %r14
pushq %rbx
subq $0x168, %rsp            # imm = 0x168
movq %rdi, %rbx
leaq 0x8(%rsp), %r14
movq %r14, %rdi
callq 0x3080
leaq 0x7fd3(%rip), %rsi      # 0xc9f2
movl $0x7, %edx
movq %r14, %rdi
callq 0x3290
movq 0xe835(%rip), %rsi      # 0x13268
leaq 0x8(%rsp), %rdi
callq 0x31a0
incq 0xe824(%rip)            # 0x13268
leaq 0x10(%rsp), %rsi
movq %rbx, %rdi
callq 0x31d0
movq 0xe540(%rip), %rsi      # 0x12f98
leaq 0x8(%rsp), %rdi
callq 0x33a0
leaq 0x60(%rsp), %rdi
callq 0x30d0
movq %rbx, %rax
addq $0x168, %rsp            # imm = 0x168
popq %rbx
popq %r14
retq
movq %rax, %rbx
movq 0xe514(%rip), %rsi      # 0x12f98
leaq 0x8(%rsp), %rdi
callq 0x33a0
leaq 0x60(%rsp), %rdi
callq 0x30d0
movq %rbx, %rdi
callq 0x3400
// File: /workspace/github_cpp_makefile_star2_O1/SMT-COMP[P]scrambler/scrambler.cpp
// Function: filter_named(std::unordered_set<std::string, std::hash<std::string>, std::equal_to<std::string>, std::allocator<std::string>> const&)
void filter_named(const StringSet &to_keep)
{
    size_t i, k;
    for (i = k = 0; i < commands.size(); ++i) {
        scrambler::node *cur = commands[i];
        bool keep = true;
        if (cur->symbol == "assert") {
            std::string name = get_named_annot(cur);
            if (!name.empty() && to_keep.find(name) == to_keep.end()) {
                keep = false;
            }
        }
        if (keep) {
            commands[k++] = cur;
        }
    }
    commands.resize(k);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movq 0xdb38(%rip), %rax      # 0x132f8
cmpq %rax, 0xdb39(%rip)      # 0x13300
je 0x586f
xorl %ebx, %ebx
leaq 0x8988(%rip), %r15      # 0xe15e
leaq 0x8(%rsp), %r12
xorl %r14d, %r14d
movq (%rax,%rbx,8), %r13
movq %r13, %rdi
movq %r15, %rsi
callq 0x30a0
testl %eax, %eax
je 0x581e
movq 0xdb00(%rip), %rax      # 0x132f8
movq %r13, (%rax,%r14,8)
incq %r14
incq %rbx
movq 0xdaf7(%rip), %rcx      # 0x13300
movq 0xdae8(%rip), %rax      # 0x132f8
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %rcx, %rbx
jb 0x57de
jmp 0x5872
movq %r12, %rdi
movq %r13, %rsi
callq 0x5506
movq 0x8(%rsp), %rdi
cmpq $0x0, -0x18(%rdi)
je 0x585f
movq 0x10(%rsp), %rdi
movq %r12, %rsi
callq 0x8096
movq %rax, %rbp
movq 0x8(%rsp), %rdi
addq $-0x18, %rdi
leaq 0x5(%rsp), %rsi
callq 0x3170
testq %rbp, %rbp
jne 0x57f1
jmp 0x57ff
addq $-0x18, %rdi
leaq 0x7(%rsp), %rsi
callq 0x3170
jmp 0x57f1
xorl %r14d, %r14d
leaq 0xda7f(%rip), %rdi      # 0x132f8
movq %r14, %rsi
callq 0x6698
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x8(%rsp), %rdi
addq $-0x18, %rdi
leaq 0x6(%rsp), %rsi
callq 0x3170
movq %rbx, %rdi
callq 0x3400
// File: /workspace/github_cpp_makefile_star2_O1/SMT-COMP[P]scrambler/scrambler.cpp
// Function: c_strdup(char const*)
char *c_strdup(const char *s)
{
    char *ret = (char *)malloc(strlen(s) + 1);
    if (ret == NULL) {
        exit(1);
    }

    strcpy(ret, s);
    return ret;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
callq 0x3100
leaq 0x1(%rax), %rdi
callq 0x3300
testq %rax, %rax
je 0x58d1
movq %rax, %rdi
movq %rbx, %rsi
popq %rbx
jmp 0x3220
movl $0x1, %edi
callq 0x32c0
// File: /workspace/github_cpp_makefile_star2_O1/SMT-COMP[P]scrambler/parser.cpp
// Function: yy_symbol_print(_IO_FILE*, yysymbol_kind_t, YYSTYPE const*, YYLTYPE const*)
static void
yy_symbol_print (FILE *yyo,
                 yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp)
{
  YYFPRINTF (yyo, "%s %s (",
             yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));

  YYLOCATION_PRINT (yyo, yylocationp);
  YYFPRINTF (yyo, ": ");
  yy_symbol_value_print (yyo, yykind, yyvaluep, yylocationp);
  YYFPRINTF (yyo, ")");
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %r14
cmpl $0x2e, %esi
leaq 0x474b(%rip), %rax      # 0xdf73
leaq 0x474a(%rip), %rdx      # 0xdf79
cmovlq %rax, %rdx
movq %rdi, %rbx
movslq %esi, %rax
leaq 0x9210(%rip), %rcx      # 0x12a50
movq (%rcx,%rax,8), %rcx
leaq 0x4720(%rip), %rsi      # 0xdf6b
xorl %r15d, %r15d
xorl %eax, %eax
callq 0x3330
movl (%r14), %edx
movl 0xc(%r14), %ebp
subl $0x1, %ebp
cmovbl %r15d, %ebp
testl %edx, %edx
js 0x9891
leaq 0x46fa(%rip), %rsi      # 0xdf68
movq %rbx, %rdi
xorl %eax, %eax
callq 0x3330
movl 0x4(%r14), %edx
testl %edx, %edx
js 0x9891
leaq 0x4b4c(%rip), %rsi      # 0xe3d3
movq %rbx, %rdi
xorl %eax, %eax
callq 0x3330
movl 0x8(%r14), %edx
testl %edx, %edx
js 0x98d9
cmpl %edx, (%r14)
jge 0x98bc
leaq 0x4b32(%rip), %rsi      # 0xe3d7
movq %rbx, %rdi
xorl %eax, %eax
callq 0x3330
testl %ebp, %ebp
js 0x98d9
leaq 0x4b19(%rip), %rsi      # 0xe3d3
jmp 0x98cd
testl %ebp, %ebp
js 0x98d9
cmpl %ebp, 0x4(%r14)
jge 0x98d9
leaq 0x4b0a(%rip), %rsi      # 0xe3d7
movq %rbx, %rdi
movl %ebp, %edx
xorl %eax, %eax
callq 0x3330
leaq 0x467a(%rip), %rdi      # 0xdf5a
movl $0x2, %esi
movl $0x1, %edx
movq %rbx, %rcx
callq 0x3450
movl $0x29, %edi
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
jmp 0x32d0
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Intern.cpp
// Function: Intern::Intern()
Intern::Intern(void)
{
	this->constructors[0] = ShrubberyCreationForm::constructor;
	this->formNames[0] = "shrubbery";
	this->constructors[1] = RobotomyRequestForm::constructor;
	this->formNames[1] = "robotomy";
	this->constructors[2] = PresidentialPardonForm::constructor;
	this->formNames[2] = "presidential";
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl $0x10, %eax
leaq (%rbx,%rax), %rcx
movq %rcx, -0x10(%rbx,%rax)
movq $0x0, -0x8(%rbx,%rax)
movb $0x0, (%rbx,%rax)
addq $0x20, %rax
cmpq $0x70, %rax
jne 0x3002
leaq 0x60(%rbx), %r14
leaq 0xff3(%rip), %rax       # 0x4020
movq %rax, 0x60(%rbx)
movq 0x8(%rbx), %rdx
leaq 0x23b2(%rip), %rcx      # 0x53ee
movl $0x9, %r8d
movq %rbx, %rdi
xorl %esi, %esi
callq 0x2180
leaq 0xa8f(%rip), %rax       # 0x3ae2
movq %rax, 0x68(%rbx)
leaq 0x20(%rbx), %rdi
movq 0x28(%rbx), %rdx
leaq 0x2121(%rip), %rcx      # 0x5187
movl $0x8, %r8d
xorl %esi, %esi
callq 0x2180
leaq 0x57a(%rip), %rax       # 0x35f4
movq %rax, 0x70(%rbx)
leaq 0x40(%rbx), %rdi
movq 0x48(%rbx), %rdx
leaq 0x2103(%rip), %rcx      # 0x5190
movl $0xc, %r8d
xorl %esi, %esi
callq 0x2180
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r15
movq %r14, %rdi
movq %rbx, %rsi
callq 0x2210
movq %r15, %rdi
callq 0x21c0
nop
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Bureaucrat.cpp
// Function: Bureaucrat::setGrade(int)
void Bureaucrat::setGrade(int grade)
{
	if (grade < 1)
		throw GradeTooHighException();
	if (grade > 150)
		throw GradeTooLowException();
	this->grade = grade;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
testl %esi, %esi
jle 0x258f
cmpl $0x97, %esi
jge 0x25ac
movl %esi, 0x20(%rdi)
popq %rbp
retq
movl $0x8, %edi
callq 0x2080
leaq 0x5598(%rip), %rcx      # 0x7b38
movq %rcx, (%rax)
leaq 0x55ce(%rip), %rsi      # 0x7b78
jmp 0x25c7
movl $0x8, %edi
callq 0x2080
leaq 0x55a3(%rip), %rcx      # 0x7b60
movq %rcx, (%rax)
leaq 0x55c9(%rip), %rsi      # 0x7b90
movq 0x5a12(%rip), %rdx      # 0x7fe0
movq %rax, %rdi
callq 0x21a0
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Bureaucrat.cpp
// Function: Bureaucrat::signForm(Form&)
void Bureaucrat::signForm(Form &form)
{
	try
	{
		form.beSigned(*this);
	}
	catch(std::exception &e)
	{
		std::cout << this->name << " can't sign " << form.getName() << " because " << e.what() << "." << std::endl;
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x28, %rsp
movq %rsi, %r14
movq %rdi, %r15
movq %rsi, %rdi
movq %r15, %rsi
callq 0x2d56
addq $0x28, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
cmpl $0x1, %edx
jne 0x2799
movq %rbx, %rdi
callq 0x2060
movq %rax, %rbx
movq (%r15), %rsi
movq 0x8(%r15), %rdx
movq 0x5904(%rip), %rdi      # 0x7fd0
callq 0x2130
movq %rax, %r15
leaq 0x2929(%rip), %rsi      # 0x5004
movl $0xc, %edx
movq %rax, %rdi
callq 0x2130
leaq -0x38(%rbp), %rdi
movq %r14, %rsi
callq 0x2c22
movq -0x38(%rbp), %rsi
movq -0x30(%rbp), %rdx
movq %r15, %rdi
callq 0x2130
movq %rax, %r14
leaq 0x2903(%rip), %rsi      # 0x5011
movl $0x9, %edx
movq %rax, %rdi
callq 0x2130
movq (%rbx), %rax
movq %rbx, %rdi
callq *0x10(%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x20f0
movq %rax, %rbx
leaq 0x2b06(%rip), %rsi      # 0x523f
movl $0x1, %edx
movq %rax, %rdi
callq 0x2130
movq %rbx, %rdi
callq 0x2070
leaq -0x28(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2767
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
callq 0x2190
jmp 0x269c
jmp 0x2773
movq %rax, %rbx
jmp 0x2794
movq %rax, %rbx
leaq -0x28(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2794
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
callq 0x2190
movq %rbx, %rdi
callq 0x21c0
movq %rax, %rdi
callq 0x29d1
nop
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Bureaucrat.cpp
// Function: Bureaucrat::executeForm(Form&)
void Bureaucrat::executeForm(Form &form)
{
	try
	{
		form.execute(*this);
	}
	catch(std::exception &e)
	{
		std::cout << this->name << " can't execute " << form.getName() << " because " << e.what() << "." << std::endl;
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x28, %rsp
movq %rsi, %r14
movq %rdi, %r15
movq (%rsi), %rax
movq %rsi, %rdi
movq %r15, %rsi
callq *0x10(%rax)
addq $0x28, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
cmpl $0x1, %edx
jne 0x28c6
movq %rbx, %rdi
callq 0x2060
movq %rax, %rbx
movq (%r15), %rsi
movq 0x8(%r15), %rdx
movq 0x57d7(%rip), %rdi      # 0x7fd0
callq 0x2130
movq %rax, %r15
leaq 0x2813(%rip), %rsi      # 0x501b
movl $0xf, %edx
movq %rax, %rdi
callq 0x2130
leaq -0x38(%rbp), %rdi
movq %r14, %rsi
callq 0x2c22
movq -0x38(%rbp), %rsi
movq -0x30(%rbp), %rdx
movq %r15, %rdi
callq 0x2130
movq %rax, %r14
leaq 0x27d6(%rip), %rsi      # 0x5011
movl $0x9, %edx
movq %rax, %rdi
callq 0x2130
movq (%rbx), %rax
movq %rbx, %rdi
callq *0x10(%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x20f0
movq %rax, %rbx
leaq 0x29d9(%rip), %rsi      # 0x523f
movl $0x1, %edx
movq %rax, %rdi
callq 0x2130
movq %rbx, %rdi
callq 0x2070
leaq -0x28(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2894
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
callq 0x2190
jmp 0x27c9
jmp 0x28a0
movq %rax, %rbx
jmp 0x28c1
movq %rax, %rbx
leaq -0x28(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x28c1
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
callq 0x2190
movq %rbx, %rdi
callq 0x21c0
movq %rax, %rdi
callq 0x29d1
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Form.cpp
// Function: Form::Form(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, int)
Form::Form(std::string name, int requiredSignatureGrade, int requiredExecutionGrade) : name(name), requiredSignatureGrade(requiredSignatureGrade), requiredExecutionGrade(requiredExecutionGrade)
{
	if (requiredExecutionGrade < 1 || requiredSignatureGrade < 1)
		throw GradeTooHighException();
	if (requiredExecutionGrade > 150 || requiredSignatureGrade > 150)
		throw GradeTooLowException();
	this->hasBeenSigned = false;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %ecx, %r12d
movl %edx, %r13d
movq %rdi, %r14
leaq 0x511f(%rip), %rax      # 0x7c30
movq %rax, (%rdi)
addq $0x8, %rdi
leaq 0x18(%r14), %rax
movq %rax, -0x30(%rbp)
movq %rax, 0x8(%r14)
movq (%rsi), %rax
movq 0x8(%rsi), %rdx
addq %rax, %rdx
movq %rdi, -0x38(%rbp)
movq %rax, %rsi
callq 0x2a24
movl %r13d, 0x2c(%r14)
movl %r12d, 0x30(%r14)
leaq 0x512f(%rip), %r15      # 0x7c78
leaq 0x5090(%rip), %rbx      # 0x7be0
testl %r13d, %r13d
jle 0x2b8e
testl %r12d, %r12d
jle 0x2b8e
leaq 0x50ff(%rip), %r15      # 0x7c60
leaq 0x5050(%rip), %rbx      # 0x7bb8
cmpl $0x96, %r13d
jg 0x2b8e
cmpl $0x97, %r12d
jge 0x2b8e
movb $0x0, 0x28(%r14)
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl $0x8, %edi
callq 0x2080
movq %rbx, (%rax)
movq 0x543e(%rip), %rdx      # 0x7fe0
movq %rax, %rdi
movq %r15, %rsi
callq 0x21a0
movq %rax, %r14
movq -0x38(%rbp), %rax
movq (%rax), %rdi
cmpq -0x30(%rbp), %rdi
je 0x2bcc
movq -0x30(%rbp), %rax
movq (%rax), %rsi
incq %rsi
callq 0x2110
movq %r14, %rdi
callq 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Form.cpp
// Function: Form::beSigned(Bureaucrat&)
void			Form::beSigned(Bureaucrat &bureaucrat)
{
	if (bureaucrat.getGrade() > this->getSigningGrade())
		throw GradeTooLowException();
	std::cout << bureaucrat.getName() << " signs " << this->getName() << "." << std::endl;
	this->hasBeenSigned = true;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x48, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movq %rsi, %rdi
callq 0x2606
cmpl 0x2c(%rbx), %eax
jg 0x2e5a
leaq -0x58(%rbp), %r15
movq %r15, %rdi
movq %r14, %rsi
callq 0x2632
movq (%r15), %rsi
movq 0x8(%r15), %rdx
movq 0x5239(%rip), %rdi      # 0x7fd0
callq 0x2130
movq %rax, %r14
leaq 0x2360(%rip), %rsi      # 0x5106
movl $0x7, %edx
movq %rax, %rdi
callq 0x2130
leaq -0x28(%rbp), %r15
movq %r15, -0x10(%r15)
movq 0x8(%rbx), %rsi
movq 0x10(%rbx), %rdx
addq %rsi, %rdx
leaq -0x38(%rbp), %rdi
callq 0x2a24
movq -0x38(%rbp), %rsi
movq -0x30(%rbp), %rdx
movq %r14, %rdi
callq 0x2130
movq %rax, %r14
leaq 0x2456(%rip), %rsi      # 0x523f
movl $0x1, %edx
movq %rax, %rdi
callq 0x2130
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x20e0
movsbl %al, %esi
movq %r14, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x2090
movq -0x38(%rbp), %rdi
cmpq %r15, %rdi
je 0x2e32
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
leaq -0x48(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2e4b
movq -0x48(%rbp), %rsi
incq %rsi
callq 0x2110
movb $0x1, 0x28(%rbx)
addq $0x48, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movl $0x8, %edi
callq 0x2080
leaq 0x4d4d(%rip), %rcx      # 0x7bb8
movq %rcx, (%rax)
leaq 0x4deb(%rip), %rsi      # 0x7c60
movq 0x5164(%rip), %rdx      # 0x7fe0
movq %rax, %rdi
callq 0x21a0
jmp 0x2e86
movq %rax, %rbx
jmp 0x2ea3
movq %rax, %rbx
movq -0x38(%rbp), %rdi
cmpq %r15, %rdi
je 0x2ea3
movq -0x28(%rbp), %rsi
incq %rsi
callq 0x2110
leaq -0x48(%rbp), %rax
movq -0x10(%rax), %rdi
cmpq %rax, %rdi
je 0x2ebc
movq -0x48(%rbp), %rsi
incq %rsi
callq 0x2110
movq %rbx, %rdi
callq 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Form.cpp
// Function: Form::execute(Bureaucrat const&) const
void Form::execute(const Bureaucrat &executor) const
{
	if (!this->hasBeenSigned)
		throw NotSignedException();
	if (executor.getGrade() > this->requiredExecutionGrade)
		throw GradeTooLowException();
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %rbx
pushq %rax
cmpb $0x0, 0x28(%rdi)
je 0x2f43
movq %rdi, %rbx
movq %rsi, %rdi
callq 0x2606
cmpl 0x30(%rbx), %eax
jg 0x2f60
addq $0x8, %rsp
popq %rbx
popq %rbp
retq
movl $0x8, %edi
callq 0x2080
leaq 0x4cb4(%rip), %rcx      # 0x7c08
movq %rcx, (%rax)
leaq 0x4cea(%rip), %rsi      # 0x7c48
jmp 0x2f7b
movl $0x8, %edi
callq 0x2080
leaq 0x4c47(%rip), %rcx      # 0x7bb8
movq %rcx, (%rax)
leaq 0x4ce5(%rip), %rsi      # 0x7c60
movq 0x505e(%rip), %rdx      # 0x7fe0
movq %rax, %rdi
callq 0x21a0
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/Intern.cpp
// Function: Intern::makeForm(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
Form *Intern::makeForm(std::string formName, std::string target)
{
	for (unsigned int i = 0; i < 3; i++)
	{
		if (this->formNames[i] == formName)
		{
			return ((this->constructors[i])(target));
		}
	}
	std::cout << "No form with name " << formName << "." << std::endl;
	return (nullptr);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, -0x38(%rbp)
movq %rdi, %r15
movq %rsi, -0x30(%rbp)
movq 0x8(%rsi), %r14
movq $-0x18, %r12
xorl %ebx, %ebx
xorl %r13d, %r13d
movq 0x68(%r15,%r12,4), %rdx
cmpq %r14, %rdx
jne 0x317c
testq %rdx, %rdx
je 0x3190
movq -0x30(%rbp), %rax
movq (%rax), %rsi
movq 0x60(%r15,%r12,4), %rdi
callq 0x2120
testl %eax, %eax
je 0x3190
cmpq $0x2, %rbx
leaq 0x1(%rbx), %rbx
setae %r13b
addq $0x8, %r12
jne 0x3158
jmp 0x31d7
movq 0x60(%r15,%rbx,8), %rbx
leaq -0x48(%rbp), %r15
movq %r15, -0x10(%r15)
movq -0x38(%rbp), %rax
movq (%rax), %rsi
movq 0x8(%rax), %rdx
addq %rsi, %rdx
leaq -0x58(%rbp), %r14
movq %r14, %rdi
callq 0x2a24
movq %r14, %rdi
callq *%rbx
movq -0x58(%rbp), %rdi
cmpq %r15, %rdi
je 0x31d7
movq -0x48(%rbp), %rsi
incq %rsi
movq %rax, %rbx
callq 0x2110
movq %rbx, %rax
testb $0x1, %r13b
je 0x324b
movq 0x4dec(%rip), %r14      # 0x7fd0
leaq 0x1fb2(%rip), %rsi      # 0x519d
movl $0x12, %edx
movq %r14, %rdi
callq 0x2130
movq -0x30(%rbp), %rax
movq (%rax), %rsi
movq 0x8(%rax), %rdx
movq %r14, %rdi
callq 0x2130
movq %rax, %rbx
leaq 0x202a(%rip), %rsi      # 0x523f
movl $0x1, %edx
movq %rax, %rdi
callq 0x2130
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x20e0
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x2090
xorl %eax, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x58(%rbp), %rdi
cmpq %r15, %rdi
je 0x3272
movq -0x48(%rbp), %rsi
incq %rsi
callq 0x2110
movq %rbx, %rdi
callq 0x21c0
nop
// File: /workspace/github_cpp_makefile_star2_O1/t0mm4rx[P]piscine_cpp/day05/ex03/ShrubberyCreationForm.cpp
// Function: ShrubberyCreationForm::execute(Bureaucrat const&) const
void	ShrubberyCreationForm::execute(const Bureaucrat &bureaucrat) const
{
	std::string		filename = this->target + "_shrubbery";
	std::ofstream	file(filename);

	if (file.fail())
		throw FileErrorException();
	Form::execute(bureaucrat);
	std::cout << "Creating " << filename << "." << std::endl;
	file << this->tree;
	file.close();
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x220, %rsp            # imm = 0x220
movq %rsi, %rbx
movq %rdi, %r14
leaq -0x30(%rbp), %r12
movq %r12, -0x10(%r12)
movq 0x38(%rdi), %rsi
movq 0x40(%rdi), %rdx
addq %rsi, %rdx
leaq -0x40(%rbp), %r15
movq %r15, %rdi
callq 0x2a24
leaq 0x1556(%rip), %rsi      # 0x53ed
movq %r15, %rdi
callq 0x21e0
leaq -0x240(%rbp), %rdi
leaq -0x40(%rbp), %rsi
movl $0x10, %edx
callq 0x21f0
movq -0x240(%rbp), %rax
movq -0x18(%rax), %rax
testb $0x5, -0x220(%rbp,%rax)
jne 0x3fc3
movq %r14, %rdi
movq %rbx, %rsi
callq 0x2f20
movq 0x40f1(%rip), %rdi      # 0x7fd0
leaq 0x1512(%rip), %rsi      # 0x53f8
movl $0x9, %edx
callq 0x2130
movq -0x40(%rbp), %rsi
movq -0x38(%rbp), %rdx
movq 0x40d1(%rip), %rdi      # 0x7fd0
callq 0x2130
movq %rax, %rbx
leaq 0x1331(%rip), %rsi      # 0x523f
movl $0x1, %edx
movq %rax, %rdi
callq 0x2130
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x20e0
movsbl %al, %esi
movq %rbx, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x2090
movq 0x41e7(%rip), %rsi      # 0x8130
movq 0x41e8(%rip), %rdx      # 0x8138
leaq -0x240(%rbp), %rdi
callq 0x2130
leaq -0x240(%rbp), %rdi
callq 0x2150
movq 0x4059(%rip), %rax      # 0x7fc8
movq (%rax), %rcx
movq 0x18(%rax), %rax
leaq -0x238(%rbp), %rdi
movq %rcx, -0x8(%rdi)
movq -0x18(%rcx), %rcx
movq %rax, -0x240(%rbp,%rcx)
callq 0x20c0
leaq -0x148(%rbp), %rdi
callq 0x2050
movq -0x40(%rbp), %rdi
cmpq %r12, %rdi
je 0x3fb3
movq -0x30(%rbp), %rsi
incq %rsi
callq 0x2110
addq $0x220, %rsp            # imm = 0x220
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movl $0x8, %edi
callq 0x2080
leaq 0x3d84(%rip), %rcx      # 0x7d58
movq %rcx, (%rax)
leaq 0x3d92(%rip), %rsi      # 0x7d70
movq 0x3ffb(%rip), %rdx      # 0x7fe0
movq %rax, %rdi
callq 0x21a0
jmp 0x3fef
movq %rax, %rbx
jmp 0x4003
movq %rax, %rbx
leaq -0x240(%rbp), %rdi
callq 0x2160
movq -0x40(%rbp), %rdi
cmpq %r12, %rdi
je 0x4018
movq -0x30(%rbp), %rsi
incq %rsi
callq 0x2110
movq %rbx, %rdi
callq 0x21c0
// File: /workspace/github_cpp_makefile_star2_O1/vividvilla[P]hackerrank/src/largest-sum-m.cpp
// Function: largestSum(int, std::vector<int, std::allocator<int>>, int)
int largestSum(int k, vector<int> d, int M) {
    int best = 0;
    int N = d.size();
    vector<vector<bool> > s = vector<vector<bool> >(M, vector<bool>(k + 1, false));
    s[0][0] = true;

    for (int j = 0; j < N; j++) {
        for (int l = M - 1; l >= d[j]; l--) {
            for (int i = 1; i <= k; i++) {
                s[l][i] = s[l][i] || s[l - d[j]][i - 1];
                if (i == k && s[l][i] && l > best)
                    best = l;
            }
        }
    }

    return best;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x88, %rsp
movl %edx, %ebx
movq %rsi, %rbp
movq 0x8(%rsi), %r14
subq (%rsi), %r14
movq %rdi, 0x10(%rsp)
leal 0x1(%rdi), %r12d
movslq %r12d, %rsi
leaq 0xb(%rsp), %rdx
movb $0x0, (%rdx)
leaq 0x48(%rsp), %r15
leaq 0xa(%rsp), %rcx
movq %r15, %rdi
callq 0x175c
movl %ebx, 0xc(%rsp)
movslq %ebx, %rsi
leaq 0x70(%rsp), %rdi
leaq 0x9(%rsp), %rcx
movq %rsi, 0x20(%rsp)
movq %r15, %rdx
callq 0x17c4
shrq $0x2, %r14
movq 0x48(%rsp), %rdi
testq %rdi, %rdi
je 0x1391
movq 0x68(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
xorl %eax, %eax
movq %rax, 0x48(%rsp)
movl %eax, 0x50(%rsp)
movq %rax, 0x58(%rsp)
movl %eax, 0x60(%rsp)
movq %rax, 0x68(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x40(%rsp)
movq (%rax), %rcx
orq $0x1, (%rcx)
testl %r14d, %r14d
jle 0x14bc
movabsq $-0x8000000000000000, %rdx # imm = 0x8000000000000000
movq (%rbp), %rax
movq %rax, 0x28(%rsp)
movl 0x10(%rsp), %edi
andl $0x7fffffff, %r14d      # imm = 0x7FFFFFFF
xorl %ecx, %ecx
xorl %ebp, %ebp
movq %r14, 0x30(%rsp)
movq 0x28(%rsp), %rax
movq %rcx, 0x38(%rsp)
movslq (%rax,%rcx,4), %rax
movq %rax, 0x18(%rsp)
cmpl 0xc(%rsp), %eax
jge 0x14a4
movq 0x20(%rsp), %r10
decq %r10
cmpl $0x0, 0x10(%rsp)
jle 0x1499
leaq (%r10,%r10,4), %rcx
movq 0x40(%rsp), %rax
movq (%rax,%rcx,8), %r11
movq %r10, %rcx
subq 0x18(%rsp), %rcx
leaq (%rcx,%rcx,4), %rcx
leaq (%rax,%rcx,8), %r15
movl $0x1, %ecx
movl $0x1, %ebx
shlq %cl, %rbx
movq %rcx, %r13
shrq $0x6, %r13
movq (%r11,%r13,8), %rsi
btq %rcx, %rsi
jb 0x146b
leaq -0x1(%rcx), %r14
movq %r14, %r8
shrq $0x3, %r8
andq $-0x8, %r8
addq (%r15), %r8
leaq 0x3f(%rdx), %rax
andq %r14, %rax
xorl %r9d, %r9d
cmpq %rdx, %rax
setbe %r9b
movq -0x8(%r8,%r9,8), %rax
btq %r14, %rax
jae 0x148e
orq %rbx, %rsi
movq %rsi, (%r11,%r13,8)
cmpq %rcx, %rdi
jne 0x1484
testq %rbx, (%r11,%r13,8)
je 0x1484
cmpl %ebp, %r10d
cmovgl %r10d, %ebp
incq %rcx
cmpq %rcx, %r12
jne 0x1424
jmp 0x1499
movq %rbx, %rax
notq %rax
andq %rax, %rsi
jmp 0x146e
cmpq 0x18(%rsp), %r10
jg 0x13f4
movq 0x38(%rsp), %rcx
incq %rcx
movq 0x30(%rsp), %r14
cmpq %r14, %rcx
jne 0x13d2
jmp 0x14be
xorl %ebp, %ebp
leaq 0x70(%rsp), %rdi
callq 0x185c
movl %ebp, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x48(%rsp), %rsi
testq %rsi, %rsi
je 0x14f3
leaq 0x48(%rsp), %rdi
callq 0x1170
movq %rbx, %rdi
callq 0x1150
// File: /workspace/github_cpp_makefile_star2_O1/vividvilla[P]hackerrank/src/largest-sum-m.cpp
// Function: partitions(int)
int partitions(int Z) {
    vector<int> p = vector<int>(Z + 1, 0);
    p[0] = 1;

    for (int i = 1; i <= Z; i++) {
        for (int j = i; j <= Z; j++) {
            p[j] = (p[j] + p[j - i]) % MOD;
        }
    }

    return p[Z];
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x20, %rsp
movl %edi, %ebx
leal 0x1(%rbx), %r15d
movslq %r15d, %rsi
leaq 0x4(%rsp), %rdx
movl $0x0, (%rdx)
leaq 0x8(%rsp), %r14
leaq 0x3(%rsp), %rcx
movq %r14, %rdi
callq 0x188c
movq (%r14), %rdi
movl $0x1, (%rdi)
testl %ebx, %ebx
jle 0x158c
movl $0x1, %eax
movl $0x4, %ecx
movq %r15, %rdx
movq %rdi, %rsi
movl (%rsi), %r8d
addl (%rsi,%rcx), %r8d
movslq %r8d, %r8
imulq $0x44b82f99, %r8, %r9   # imm = 0x44B82F99
movq %r9, %r10
shrq $0x3f, %r10
sarq $0x3c, %r9
addl %r10d, %r9d
imull $0x3b9aca07, %r9d, %r9d # imm = 0x3B9ACA07
subl %r9d, %r8d
movl %r8d, (%rsi,%rcx)
addq $0x4, %rsi
decq %rdx
cmpq %rdx, %rax
jne 0x1547
incq %rax
addq $0x4, %rcx
cmpq %r15, %rax
jne 0x1541
movslq %ebx, %rax
movl (%rdi,%rax,4), %ebx
movq 0x18(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
movl %ebx, %eax
addq $0x20, %rsp
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/vividvilla[P]hackerrank/src/largest-sum-m.cpp
// Function: main
int main() {
    int n, k, M, x;
    cin >> n >> k >> M;

    vector<int> d;
    for (int i = 0; i < n; i++) {
        cin >> x;
        d.push_back(x);
    }

    int Z = largestSum(k, d, M);
    cout << Z << endl;
    cout << partitions(Z) << endl;

    return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x48, %rsp
movq 0x2a24(%rip), %rdi      # 0x3fe0
leaq 0xc(%rsp), %rbx
movq %rbx, %rsi
callq 0x1090
leaq 0x8(%rsp), %rsi
movq %rax, %rdi
callq 0x1090
leaq 0x4(%rsp), %rsi
movq %rax, %rdi
callq 0x1090
xorps %xmm0, %xmm0
movaps %xmm0, 0x10(%rsp)
movq $0x0, 0x20(%rsp)
cmpl $0x0, (%rbx)
jle 0x1644
xorl %ebp, %ebp
movq 0x29de(%rip), %rbx      # 0x3fe0
movq %rsp, %r14
leaq 0x10(%rsp), %r15
movq %rbx, %rdi
movq %r14, %rsi
callq 0x1090
movq 0x18(%rsp), %rsi
cmpq 0x20(%rsp), %rsi
je 0x1631
movl (%rsp), %eax
movl %eax, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x18(%rsp)
jmp 0x163c
movq %r15, %rdi
movq %r14, %rdx
callq 0x1d5e
incl %ebp
cmpl 0xc(%rsp), %ebp
jl 0x160a
movl 0x8(%rsp), %ebx
leaq 0x30(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x1a00
movl 0x4(%rsp), %edx
leaq 0x30(%rsp), %rsi
movl %ebx, %edi
callq 0x12fc
movl %eax, %ebx
movq 0x30(%rsp), %rdi
testq %rdi, %rdi
je 0x1680
movq 0x40(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
movq 0x2949(%rip), %rdi      # 0x3fd0
movl %ebx, %esi
callq 0x1140
movq %rax, %r14
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x10d0
movsbl %al, %esi
movq %r14, %rdi
callq 0x1030
movq %rax, %rdi
callq 0x10a0
movl %ebx, %edi
callq 0x14fb
movq 0x290a(%rip), %rdi      # 0x3fd0
movl %eax, %esi
callq 0x1140
movq %rax, %rbx
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %esi
callq 0x10d0
movsbl %al, %esi
movq %rbx, %rdi
callq 0x1030
movq %rax, %rdi
callq 0x10a0
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x170e
movq 0x20(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
xorl %eax, %eax
addq $0x48, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq 0x30(%rsp), %rdi
testq %rdi, %rdi
je 0x173c
movq 0x40(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
jmp 0x173c
jmp 0x1739
movq %rax, %rbx
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x1753
movq 0x20(%rsp), %rsi
subq %rdi, %rsi
callq 0x10f0
movq %rbx, %rdi
callq 0x1150
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: co_static_search_tree::co_static_search_tree(int)
co_static_search_tree::co_static_search_tree(int n) {
    this->n = n;
    this->length = next_power_of_2(n);
    this->size = this->length * 2;
    this->height = log2(this->length) + 1;
    this->tree = (int *)malloc(sizeof(int) * this->size);
    for (int i = 0; i < this->size; ++i) {
        this->tree[i] = MINUS_INFINITY;
    }
    this->array = (int *)malloc(sizeof(int) * this->n);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
movl %esi, 0x10(%rdi)
decl %esi
movl %esi, %eax
shrl %eax
orl %esi, %eax
movl %eax, %ecx
shrl $0x2, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x4, %eax
orl %ecx, %eax
movl %eax, %ecx
shrl $0x8, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x10, %eax
orl %ecx, %eax
leal 0x1(%rax), %ecx
movl %ecx, 0x14(%rdi)
leal 0x2(,%rax,2), %eax
movl %eax, 0x18(%rdi)
cvtsi2sd %ecx, %xmm0
callq 0x11d0
addsd 0x2c8c(%rip), %xmm0     # 0x4008
cvttsd2si %xmm0, %eax
movl %eax, 0x1c(%rbx)
movslq 0x18(%rbx), %r15
leaq (,%r15,4), %r14
movq %r14, %rdi
callq 0x1160
movq %rax, (%rbx)
testq %r15, %r15
jle 0x13af
movq %rax, %rdi
movl $0xff, %esi
movq %r14, %rdx
callq 0x1090
movslq 0x10(%rbx), %rdi
shlq $0x2, %rdi
callq 0x1160
movq %rax, 0x8(%rbx)
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: co_static_search_tree::get_tree_height_pwr_2(int, int, int, int, int)
int co_static_search_tree::get_tree_height_pwr_2(int block_index, int height, int range_left, int og_height, int value) {
    int inner_block_index = 0;
    int depth = 1;
    int path = 0;
    int length = (1 << (og_height - 2));
    while (depth != height)
    {
        this->block_index_memo[depth] = inner_block_index;
        int left_child_inner_block_index = this->left_child(inner_block_index, depth, path);
        if (value <= this->tree[block_index + left_child_inner_block_index])
        {
            path <<= 1;
            inner_block_index = left_child_inner_block_index;
        }
        else {
            inner_block_index = this->right_child(inner_block_index, depth, path);
            path = (path << 1) | 1;
            range_left += length;
        }
        length >>= 1;
        depth += 1;
    }
    return range_left;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movl %r9d, -0xc(%rsp)
movl %ecx, %eax
movq %rsi, -0x8(%rsp)
cmpl $0x1, %edx
je 0x1d53
addb $-0x2, %r8b
movl $0x1, %r10d
movl %r8d, %ecx
shll %cl, %r10d
movq (%rdi), %rsi
movl %edx, %edx
leaq 0x24(%rdi), %r11
xorl %ebx, %ebx
movl $0x1, %r14d
movl $0x2, %r9d
movl $0xffffffff, %r15d      # imm = 0xFFFFFFFF
xorl %r13d, %r13d
movl %r13d, (%r11)
testb $0x1, %r14b
jne 0x1cc8
movl %r14d, %ecx
andl %r15d, %ecx
movl $0xffffffff, %r8d       # imm = 0xFFFFFFFF
shll %cl, %r8d
leal (%rbx,%rbx), %r12d
notl %r8d
andl %r12d, %r8d
movl %r9d, %ebp
subl %ecx, %ebp
incl %r8d
movl %r8d, %r12d
shll %cl, %r12d
movslq %ebp, %rcx
subl %r8d, %r12d
addl 0x20(%rdi,%rcx,4), %r12d
jmp 0x1ccc
leal 0x1(%r13), %r12d
movq -0x8(%rsp), %rcx
addl %r12d, %ecx
movslq %ecx, %rcx
movl -0xc(%rsp), %r8d
cmpl %r8d, (%rsi,%rcx,4)
jge 0x1d22
testb $0x1, %r14b
jne 0x1d26
movl %r14d, %ecx
andl %r15d, %ecx
movl $0xffffffff, %r12d      # imm = 0xFFFFFFFF
shll %cl, %r12d
leal 0x1(,%rbx,2), %r8d
notl %r12d
andl %r8d, %r12d
movl %r9d, %r8d
subl %ecx, %r8d
movslq %r8d, %r8
leal 0x1(%r12), %ebp
shll %cl, %ebp
notl %r12d
addl %ebp, %r12d
addl 0x20(%rdi,%r8,4), %r12d
jmp 0x1d2d
addl %ebx, %ebx
jmp 0x1d37
addl $0x2, %r13d
movl %r13d, %r12d
leal 0x1(,%rbx,2), %ebx
addl %r10d, %eax
sarl %r10d
incq %r14
incl %r9d
decl %r15d
addq $0x4, %r11
movl %r12d, %r13d
cmpq %r14, %rdx
jne 0x1c8b
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: built_co_static_search_tree::built_co_static_search_tree(int)
built_co_static_search_tree::built_co_static_search_tree(int n) {
    this->n = n;
    this->length = next_power_of_2(n);
    this->size = this->length * 2;
    this->height = log2(this->length) + 1;
    this->tree = (int *)malloc(sizeof(int) * this->size * 3);
    this->temp_tree = (int *)malloc(sizeof(int) * this->size);
    this->van_emde_boas_build(0, this->height, this->height, 1);
    this->build(1, this->height);
    free(this->temp_tree);
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rdi, %rbx
movl %esi, 0x10(%rdi)
decl %esi
movl %esi, %eax
shrl %eax
orl %esi, %eax
movl %eax, %ecx
shrl $0x2, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x4, %eax
orl %ecx, %eax
movl %eax, %ecx
shrl $0x8, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x10, %eax
orl %ecx, %eax
leal 0x1(%rax), %ecx
movl %ecx, 0x14(%rdi)
leal 0x2(,%rax,2), %eax
movl %eax, 0x18(%rdi)
cvtsi2sd %ecx, %xmm0
callq 0x11d0
addsd 0x225b(%rip), %xmm0     # 0x4008
cvttsd2si %xmm0, %ebp
movl %ebp, 0x1c(%rbx)
movslq 0x18(%rbx), %r14
shlq $0x2, %r14
leaq (%r14,%r14,2), %rdi
callq 0x1160
movq %rax, (%rbx)
movq %r14, %rdi
callq 0x1160
movq %rax, 0x8(%rbx)
movq %rbx, %rdi
xorl %esi, %esi
movl %ebp, %edx
movl %ebp, %ecx
movl $0x1, %r8d
callq 0x1e06
movl 0x1c(%rbx), %edx
movq %rbx, %rdi
movl $0x1, %esi
callq 0x1ec6
movq 0x8(%rbx), %rdi
popq %rbx
popq %r14
popq %rbp
jmp 0x1140
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: built_co_static_search_tree::van_emde_boas_build(int, int, int, int)
void built_co_static_search_tree::van_emde_boas_build(int tree_l, int h, int og_height, int bfs_order) {
    if (h == 1)
    {
        this->temp_tree[bfs_order] = tree_l;
        return;
    }

    int bottom_tree_h = bottom_tree_height_memo[h];
    int top_tree_h = h - bottom_tree_h;

    this->van_emde_boas_build(tree_l, top_tree_h, og_height, bfs_order);
    
    int top_tree_size = (1 << top_tree_h) - 1;

    int bottom_tree_og_height = og_height - top_tree_h;
    int bottom_tree_size = (1 << bottom_tree_h) - 1;
    int bottom_tree_tree_l = tree_l + top_tree_size;

    for (int bottom_tree_index = 0; bottom_tree_index < (1 << top_tree_h); ++bottom_tree_index) {
        int bottom_tree_bfs_order = (bfs_order << top_tree_h) | bottom_tree_index;
        this->van_emde_boas_build(bottom_tree_tree_l, bottom_tree_h, bottom_tree_og_height, bottom_tree_bfs_order);
        bottom_tree_tree_l += bottom_tree_size;
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %r8d, (%rsp)
movl %ecx, 0x4(%rsp)
movl %esi, %r12d
movq %rdi, %r14
cmpl $0x1, %edx
jne 0x1e35
movq 0x8(%r14), %rax
movslq (%rsp), %rcx
movl %r12d, (%rax,%rcx,4)
jmp 0x1eb6
movl %edx, %ebx
movslq %edx, %rax
leaq 0x21ff(%rip), %rcx      # 0x4040
movl (%rcx,%rax,4), %r15d
subl %r15d, %ebx
movq %r14, %rdi
movl %r12d, %esi
movl %ebx, %edx
movl 0x4(%rsp), %ecx
movl (%rsp), %r8d
callq 0x1e06
movl $0xffffffff, %r13d      # imm = 0xFFFFFFFF
movl %r15d, %ecx
shll %cl, %r13d
cmpl $0x1f, %ebx
je 0x1eb6
subl %ebx, 0x4(%rsp)
notl %r13d
movl $0x1, %eax
movl $0x1, %ebp
movl %ebx, %ecx
shll %cl, %ebp
addl %ebp, %r12d
decl %r12d
shll %cl, (%rsp)
cmpl $0x2, %ebp
cmovll %eax, %ebp
xorl %ebx, %ebx
movl %ebx, %r8d
orl (%rsp), %r8d
movq %r14, %rdi
movl %r12d, %esi
movl %r15d, %edx
movl 0x4(%rsp), %ecx
callq 0x1e06
addl %r13d, %r12d
incl %ebx
cmpl %ebx, %ebp
jne 0x1e94
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: built_co_static_search_tree::build(int, int)
void built_co_static_search_tree::build(int index, int h) {
    if(h == 1) {
        return;
    }
    int van_emde_boas_index = this->temp_tree[index];
    this->tree[van_emde_boas_index * 3 + 1] = this->temp_tree[index << 1] * 3;
    this->tree[van_emde_boas_index * 3 + 2] = this->temp_tree[(index << 1) + 1] * 3;
    this->build(index << 1, h-1);
    this->build((index << 1) + 1, h-1);
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movl %esi, %ebp
movq %rdi, %rbx
decl %edx
movl %edx, %r14d
subl $0x1, %r14d
jb 0x1f1e
movq (%rbx), %rax
movq 0x8(%rbx), %rcx
movslq %ebp, %rdi
movslq (%rcx,%rdi,4), %r8
leal (%rdi,%rdi), %esi
movslq %esi, %rsi
movl (%rcx,%rsi,4), %r9d
leal (%r9,%r9,2), %r9d
leaq (%r8,%r8,2), %r8
movl %r9d, 0x4(%rax,%r8,4)
leal 0x1(%rdi,%rdi), %ebp
movslq %ebp, %rdi
movl (%rcx,%rdi,4), %ecx
leal (%rcx,%rcx,2), %ecx
movl %ecx, 0x8(%rax,%r8,4)
movq %rbx, %rdi
callq 0x1ec6
movl %r14d, %edx
jmp 0x1ed4
popq %rbx
popq %r14
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: built_co_static_search_tree::update(int, int, int, int)
void built_co_static_search_tree::update(int current_node, int h, int index, int value) {
    if(h == 1) {
        this->tree[current_node] = value;
        return;
    }
    if(index & (1 << (h - 2))) {
        this->update(this->tree[current_node + 2], h - 1, index, value);
    } else {
        this->update(this->tree[current_node + 1], h - 1, index, value);
    }
    this->tree[current_node] = max(this->tree[this->tree[current_node + 1]], this->tree[this->tree[current_node + 2]]);
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
cmpl $0x1, %edx
jne 0x1f44
movq (%rbx), %rax
movslq %esi, %rcx
movl %r8d, (%rax,%rcx,4)
jmp 0x1f8b
leal -0x2(%rdx), %eax
movzbl %al, %eax
xorl %edi, %edi
btl %eax, %ecx
setb %dil
movslq %esi, %r14
leaq (,%r14,4), %rax
addq (%rbx), %rax
decl %edx
movl 0x4(%rax,%rdi,4), %esi
movq %rbx, %rdi
callq 0x1f2c
movq (%rbx), %rax
movslq 0x4(%rax,%r14,4), %rcx
movslq 0x8(%rax,%r14,4), %rdx
movl (%rax,%rcx,4), %ecx
movl (%rax,%rdx,4), %edx
cmpl %edx, %ecx
cmovgl %ecx, %edx
movl %edx, (%rax,%r14,4)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: built_co_static_search_tree::get(int)
int built_co_static_search_tree::get(int value) {
    int current_node = 0;
    int index = 0;
    for (int i = 0; i < this->height - 1; ++i)
    {
        if (value <= this->tree[this->tree[current_node + 1]])
        {
            current_node = this->tree[current_node + 1];
            index <<= 1;
        }
        else
        {
            current_node = this->tree[current_node + 2];
            index <<= 1;
            index += 1;
        }
    }
    return index;
}

// Assembly:
movl 0x1c(%rdi), %ecx
xorl %eax, %eax
cmpl $0x2, %ecx
jl 0x1fd8
movq (%rdi), %rdx
decl %ecx
xorl %eax, %eax
xorl %edi, %edi
movslq %edi, %r8
movslq 0x4(%rdx,%r8,4), %rdi
cmpl %esi, (%rdx,%rdi,4)
jge 0x1fd2
movl 0x8(%rdx,%r8,4), %edi
leal 0x1(,%rax,2), %eax
jmp 0x1fd4
addl %eax, %eax
decl %ecx
jne 0x1fb7
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: CA_static_search_tree::CA_static_search_tree(int)
CA_static_search_tree::CA_static_search_tree(int n) {
    this->n = n;
    this->length = next_power_of_2(n);
    this->size = this->length * 2;
    this->height = log2(this->length) + 1;
    this->tree = (int *)malloc(sizeof(int) * this->size);
    // this->parents.resize(this->height);
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movl %esi, 0x8(%rdi)
decl %esi
movl %esi, %eax
shrl %eax
orl %esi, %eax
movl %eax, %ecx
shrl $0x2, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x4, %eax
orl %ecx, %eax
movl %eax, %ecx
shrl $0x8, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x10, %eax
orl %ecx, %eax
leal 0x1(%rax), %ecx
movl %ecx, 0xc(%rdi)
leal 0x2(,%rax,2), %eax
movl %eax, 0x10(%rdi)
cvtsi2sd %ecx, %xmm0
callq 0x11d0
addsd 0x1fe2(%rip), %xmm0     # 0x4008
cvttsd2si %xmm0, %eax
movl %eax, 0x14(%rbx)
movslq 0x10(%rbx), %rdi
shlq $0x2, %rdi
callq 0x1160
movq %rax, (%rbx)
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: CA_static_search_tree::get(int, int, int, int, int, int, int)
int CA_static_search_tree::get(int tree_l, int num_inner_nodes, int temp_root, int h, int arr_l, int arr_r, int value) {
    if (arr_l == arr_r)
    {
        // printf("get at index %d, real index %d, value %d\n", arr_l, tree_l + temp_root, this->tree[tree_l+temp_root]);
        return arr_l;
    }
    int mid = (arr_l + arr_r) >> 1;
    if (h > 0 && (h+1) & 3 == 0) {
        h++;
        num_inner_nodes += (1 << (h-4));
        // update tree_l
        int mid = (arr_l + arr_r) >> 1;
        int left_or_right = 1;
        int new_tree_l = (tree_l << 4) + ((temp_root-8) << 1) + 1;
        tree_l = new_tree_l;
        temp_root = 1;
        int last_subtree_size = min((1 << (this->height-((h>>2)<<2))) - 1, 15);
        int real_subtree_root = ((num_inner_nodes<<4)-num_inner_nodes) + (tree_l-num_inner_nodes)*last_subtree_size;
        if (value <= this->tree[real_subtree_root + temp_root]) {
            arr_r = mid;
        } else {
            arr_l = mid + 1;
            tree_l++;
        }
        if (h == this->height - 1) {
            return arr_l;
        }
    }
    mid = (arr_l + arr_r) >> 1;
    int left_child = temp_root << 1;
    int right_child = (temp_root << 1) + 1;
    h++;
    int last_subtree_size = min((1 << (this->height-((h>>2)<<2))) - 1, 15);
    int real_subtree_root = ((num_inner_nodes<<4)-num_inner_nodes) + (tree_l-num_inner_nodes)*last_subtree_size;
    if(value <= this->tree[real_subtree_root + left_child]) {
        return this->get(tree_l, num_inner_nodes, left_child, h, arr_l, mid, value);
    } else {
        return this->get(tree_l, num_inner_nodes, right_child, h, mid + 1, arr_r, value);
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
movl %r9d, %eax
movl %ecx, %r9d
movl 0x30(%rsp), %r10d
movl 0x28(%rsp), %ebx
movl $0xfffffff0, %r11d      # imm = 0xFFFFFFF0
leal (%rdx,%rdx,4), %ecx
leal (%rcx,%rcx,2), %r14d
subl %edx, %esi
movl %ebx, %edx
cmpl %edx, %eax
je 0x21fc
movl %edx, %ebx
leal (%rbx,%rax), %edx
sarl %edx
leal (%r9,%r9), %ebp
incl %r8d
movl 0x14(%rdi), %ecx
movl %r8d, %r15d
andl $0xfc, %r15d
subl %r15d, %ecx
movl $0xffffffff, %r15d      # imm = 0xFFFFFFFF
shll %cl, %r15d
cmpl $-0xf, %r15d
cmovbl %r11d, %r15d
notl %r15d
imull %esi, %r15d
movq (%rdi), %rcx
leal (%r14,%r9,2), %r9d
addl %r15d, %r9d
movslq %r9d, %r15
movl %ebp, %r9d
cmpl %r10d, (%rcx,%r15,4)
jge 0x21a0
orl $0x1, %ebp
incl %edx
movl %ebp, %r9d
movl %edx, %eax
jmp 0x219e
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: CA_static_search_tree::print_tree()
void CA_static_search_tree::print_tree() {
    int start = 1;
    // printf("")
    for (int i = 1; i < this->size; i++) {
        printf("%d ", this->tree[i]);
    }
    printf("\n");
}

// Assembly:
cmpl $0x2, 0x10(%rdi)
jl 0x2299
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
movl $0x1, %r15d
leaq 0x1eed(%rip), %r14      # 0x4164
movq (%rbx), %rax
movl (%rax,%r15,4), %esi
movq %r14, %rdi
xorl %eax, %eax
callq 0x1040
incq %r15
movslq 0x10(%rbx), %rax
cmpq %rax, %r15
jl 0x2277
popq %rbx
popq %r14
popq %r15
movl $0xa, %edi
jmp 0x1170
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::simple_static_search_tree(int, bool)
simple_static_search_tree::simple_static_search_tree(int n, bool recursive) {
    this->n = n;
    this->recursive = recursive;
    this->length = next_power_of_2(n);
    this->size = this->length * 2;
    this->height = log2(this->length) + 1;
    this->tree = (int *)malloc(sizeof(int) * this->size);
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movl %esi, 0x8(%rdi)
movb %dl, 0x18(%rdi)
decl %esi
movl %esi, %eax
shrl %eax
orl %esi, %eax
movl %eax, %ecx
shrl $0x2, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x4, %eax
orl %ecx, %eax
movl %eax, %ecx
shrl $0x8, %ecx
orl %eax, %ecx
movl %ecx, %eax
shrl $0x10, %eax
orl %ecx, %eax
leal 0x1(%rax), %ecx
movl %ecx, 0xc(%rdi)
leal 0x2(,%rax,2), %eax
movl %eax, 0x10(%rdi)
cvtsi2sd %ecx, %xmm0
callq 0x11d0
addsd 0x1d15(%rip), %xmm0     # 0x4008
cvttsd2si %xmm0, %eax
movl %eax, 0x14(%rbx)
movslq 0x10(%rbx), %rdi
shlq $0x2, %rdi
callq 0x1160
movq %rax, (%rbx)
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::update_recursive(int, int, int, int, int)
void simple_static_search_tree::update_recursive(int tree_l, int arr_l, int arr_r, int index, int value) {
    if (arr_l == arr_r)
    {
        this->tree[tree_l] = value;
        return;
    }

    int mid = (arr_l + arr_r) / 2;
    int left_child = tree_l * 2;
    int right_child = tree_l * 2 + 1;
    if (index <= mid)
    {
        this->update_recursive(left_child, arr_l, mid, index, value);
    }
    else
    {
        this->update_recursive(right_child, mid + 1, arr_r, index, value);
    }

    this->tree[tree_l] = this->merge(this->tree[left_child], this->tree[right_child]);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movl %esi, %ebx
movq %rdi, %r14
cmpl %ecx, %edx
jne 0x2371
movq (%r14), %rax
jmp 0x23bc
leal (%rcx,%rdx), %esi
movl %esi, %eax
shrl $0x1f, %eax
addl %esi, %eax
sarl %eax
leal (%rbx,%rbx), %ebp
leal 0x1(,%rbx,2), %r15d
cmpl %r8d, %eax
jge 0x2399
incl %eax
movq %r14, %rdi
movl %r15d, %esi
movl %eax, %edx
jmp 0x23a0
movq %r14, %rdi
movl %ebp, %esi
movl %eax, %ecx
callq 0x235c
movq (%r14), %rax
movslq %ebp, %rcx
movl (%rax,%rcx,4), %ecx
movslq %r15d, %rdx
movl (%rax,%rdx,4), %r9d
cmpl %r9d, %ecx
cmovgl %ecx, %r9d
movslq %ebx, %rcx
movl %r9d, (%rax,%rcx,4)
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::update_iterative(int, int, int, int, int)
void simple_static_search_tree::update_iterative(int tree_l, int arr_l, int arr_r, int index, int value) {
    while(arr_l != arr_r) {
        int mid = (arr_l + arr_r) >> 1;
        int left_child = tree_l << 1;
        int right_child = left_child + 1;
        if(index <= mid){
            tree_l = left_child;
            arr_r = mid;
        }
        else {
            tree_l = right_child;
            arr_l = mid + 1;
        }
    }
    this->tree[tree_l] = value;
    while(tree_l != 1) {
        tree_l /= 2;
        int left_child = tree_l << 1;
        int right_child = left_child + 1;
        this->tree[tree_l] = this->merge(this->tree[left_child], this->tree[right_child]);
    }
}

// Assembly:
cmpl %ecx, %edx
je 0x23fa
leal (%rdx,%rcx), %eax
sarl %eax
leal 0x1(%rax), %r10d
xorl %r11d, %r11d
cmpl %r8d, %eax
setl %r11b
cmovll %ecx, %eax
cmovgel %edx, %r10d
leal (%r11,%rsi,2), %esi
movl %r10d, %edx
movl %eax, %ecx
cmpl %eax, %r10d
jne 0x23d2
movq (%rdi), %rax
movslq %esi, %rcx
movl %r9d, (%rax,%rcx,4)
cmpl $0x1, %ecx
je 0x243a
movl %esi, %ecx
shrl $0x1f, %ecx
addl %esi, %ecx
movl %ecx, %edx
sarl %edx
andl $-0x2, %ecx
movslq %ecx, %rdi
incl %ecx
movl (%rax,%rdi,4), %edi
movslq %ecx, %rcx
movl (%rax,%rcx,4), %ecx
cmpl %ecx, %edi
cmovgl %edi, %ecx
movslq %edx, %rdi
movl %ecx, (%rax,%rdi,4)
andl $-0x2, %esi
cmpl $0x2, %esi
movl %edx, %esi
jne 0x2409
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::get_recursive(int, int, int, int)
int simple_static_search_tree::get_recursive(int tree_l, int arr_l, int arr_r, int value) {
    if (arr_l == arr_r)
    {
        return arr_l;
    }

    int mid = (arr_l + arr_r) / 2;
    int left_child = tree_l * 2;
    int right_child = tree_l * 2 + 1;

    if(value <= this->tree[left_child]) {
        return this->get_recursive(left_child, arr_l, mid, value);
    } else {
        return this->get_recursive(right_child, mid + 1, arr_r, value);
    }
}

// Assembly:
movl %edx, %eax
movl %ecx, %edx
cmpl %edx, %eax
je 0x246a
movl %edx, %ecx
leal (%rcx,%rax), %r9d
movl %r9d, %edx
shrl $0x1f, %edx
addl %r9d, %edx
sarl %edx
addl %esi, %esi
movq (%rdi), %r9
movslq %esi, %r10
cmpl %r8d, (%r9,%r10,4)
jge 0x2440
orl $0x1, %esi
incl %edx
jmp 0x243c
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::get_iterative(int, int, int, int)
int simple_static_search_tree::get_iterative(int tree_l, int arr_l, int arr_r, int value) {
    while(arr_l != arr_r) {
        int mid = (arr_l + arr_r) >> 1;
        int left_child = tree_l << 1;
        int right_child = left_child + 1;
        if(value <= this->tree[left_child]){
            tree_l = left_child;
            arr_r = mid;
        }
        else {
            tree_l = right_child;
            arr_l = mid + 1;
        }
    }
    return arr_l;
}

// Assembly:
cmpl %ecx, %edx
jne 0x2473
movl %edx, %eax
retq
movq (%rdi), %rdi
leal (%rdx,%rcx), %r9d
sarl %r9d
leal (%rsi,%rsi), %eax
movslq %eax, %r10
leal 0x1(%r9), %eax
xorl %r11d, %r11d
cmpl %r8d, (%rdi,%r10,4)
setl %r11b
cmovll %ecx, %r9d
cmovgel %edx, %eax
leal (%r11,%rsi,2), %esi
movl %eax, %edx
movl %r9d, %ecx
cmpl %r9d, %eax
jne 0x2476
retq