LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: 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
movq %rsp, %rbp
subq $0x40, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl %ecx, -0x14(%rbp)
movl %r8d, -0x18(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x40(%rbp)
cmpl $0x1, -0x10(%rbp)
jne 0x1f8e
movq -0x40(%rbp), %rax
movl -0xc(%rbp), %edx
movq 0x8(%rax), %rax
movslq -0x18(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x2042
movq -0x40(%rbp), %rdi
movslq -0x10(%rbp), %rcx
leaq 0x5073(%rip), %rax      # 0x7010
movl (%rax,%rcx,4), %eax
movl %eax, -0x1c(%rbp)
movl -0x10(%rbp), %eax
subl -0x1c(%rbp), %eax
movl %eax, -0x20(%rbp)
movl -0xc(%rbp), %esi
movl -0x20(%rbp), %edx
movl -0x14(%rbp), %ecx
movl -0x18(%rbp), %r8d
callq 0x1f50
movl -0x20(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
subl $0x1, %eax
movl %eax, -0x24(%rbp)
movl -0x14(%rbp), %eax
subl -0x20(%rbp), %eax
movl %eax, -0x28(%rbp)
movl -0x1c(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
subl $0x1, %eax
movl %eax, -0x2c(%rbp)
movl -0xc(%rbp), %eax
addl -0x24(%rbp), %eax
movl %eax, -0x30(%rbp)
movl $0x0, -0x34(%rbp)
movl -0x34(%rbp), %eax
movl -0x20(%rbp), %ecx
movl $0x1, %edx
shll %cl, %edx
movl %edx, %ecx
cmpl %ecx, %eax
jge 0x2042
movq -0x40(%rbp), %rdi
movl -0x18(%rbp), %eax
movl -0x20(%rbp), %ecx
shll %cl, %eax
orl -0x34(%rbp), %eax
movl %eax, -0x38(%rbp)
movl -0x30(%rbp), %esi
movl -0x1c(%rbp), %edx
movl -0x28(%rbp), %ecx
movl -0x38(%rbp), %r8d
callq 0x1f50
movl -0x2c(%rbp), %eax
addl -0x30(%rbp), %eax
movl %eax, -0x30(%rbp)
movl -0x34(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x34(%rbp)
jmp 0x1ff7
addq $0x40, %rsp
popq %rbp
retq
nopl (%rax,%rax)
// File: 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
movq %rsp, %rbp
subq $0x20, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x20(%rbp)
cmpl $0x1, -0x10(%rbp)
jne 0x2072
jmp 0x20ee
movq -0x20(%rbp), %rdi
movq 0x8(%rdi), %rax
movslq -0xc(%rbp), %rcx
movl (%rax,%rcx,4), %eax
movl %eax, -0x14(%rbp)
movq 0x8(%rdi), %rax
movl -0xc(%rbp), %ecx
shll %ecx
movslq %ecx, %rcx
imull $0x3, (%rax,%rcx,4), %edx
movq (%rdi), %rax
imull $0x3, -0x14(%rbp), %ecx
addl $0x1, %ecx
movslq %ecx, %rcx
movl %edx, (%rax,%rcx,4)
movq 0x8(%rdi), %rax
movl -0xc(%rbp), %ecx
shll %ecx
addl $0x1, %ecx
movslq %ecx, %rcx
imull $0x3, (%rax,%rcx,4), %edx
movq (%rdi), %rax
imull $0x3, -0x14(%rbp), %ecx
addl $0x2, %ecx
movslq %ecx, %rcx
movl %edx, (%rax,%rcx,4)
movl -0xc(%rbp), %esi
shll %esi
movl -0x10(%rbp), %edx
subl $0x1, %edx
callq 0x2050
movq -0x20(%rbp), %rdi
movl -0xc(%rbp), %esi
shll %esi
addl $0x1, %esi
movl -0x10(%rbp), %edx
subl $0x1, %edx
callq 0x2050
addq $0x20, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: 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 %rbp
movq %rsp, %rbp
subq $0x20, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl %ecx, -0x14(%rbp)
movl %r8d, -0x18(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x20(%rbp)
cmpl $0x1, -0x10(%rbp)
jne 0x215d
movq -0x20(%rbp), %rax
movl -0x18(%rbp), %edx
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x2212
movl -0x14(%rbp), %eax
movl -0x10(%rbp), %ecx
subl $0x2, %ecx
movl $0x1, %edx
shll %cl, %edx
movl %edx, %ecx
andl %ecx, %eax
cmpl $0x0, %eax
je 0x219d
movq -0x20(%rbp), %rdi
movq (%rdi), %rax
movl -0xc(%rbp), %ecx
addl $0x2, %ecx
movslq %ecx, %rcx
movl (%rax,%rcx,4), %esi
movl -0x10(%rbp), %edx
subl $0x1, %edx
movl -0x14(%rbp), %ecx
movl -0x18(%rbp), %r8d
callq 0x2120
jmp 0x21c2
movq -0x20(%rbp), %rdi
movq (%rdi), %rax
movl -0xc(%rbp), %ecx
addl $0x1, %ecx
movslq %ecx, %rcx
movl (%rax,%rcx,4), %esi
movl -0x10(%rbp), %edx
subl $0x1, %edx
movl -0x14(%rbp), %ecx
movl -0x18(%rbp), %r8d
callq 0x2120
movq -0x20(%rbp), %rax
movq (%rax), %rdi
movq (%rax), %rcx
movl -0xc(%rbp), %edx
addl $0x1, %edx
movslq %edx, %rdx
movslq (%rcx,%rdx,4), %rcx
shlq $0x2, %rcx
addq %rcx, %rdi
movq (%rax), %rsi
movq (%rax), %rax
movl -0xc(%rbp), %ecx
addl $0x2, %ecx
movslq %ecx, %rcx
movslq (%rax,%rcx,4), %rax
shlq $0x2, %rax
addq %rax, %rsi
callq 0x31c0
movq %rax, %rcx
movq -0x20(%rbp), %rax
movl (%rcx), %edx
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
addq $0x20, %rsp
popq %rbp
retq
nopl (%rax,%rax)
// File: 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:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x20(%rbp)
movl $0x0, -0x10(%rbp)
movl $0x0, -0x14(%rbp)
movl $0x0, -0x18(%rbp)
movq -0x20(%rbp), %rcx
movl -0x18(%rbp), %eax
movl 0x1c(%rcx), %ecx
subl $0x1, %ecx
cmpl %ecx, %eax
jge 0x22ff
movq -0x20(%rbp), %rdx
movl -0xc(%rbp), %eax
movq (%rdx), %rcx
movq (%rdx), %rdx
movl -0x10(%rbp), %esi
addl $0x1, %esi
movslq %esi, %rsi
movslq (%rdx,%rsi,4), %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x22c8
movq -0x20(%rbp), %rax
movq (%rax), %rax
movl -0x10(%rbp), %ecx
addl $0x1, %ecx
movslq %ecx, %rcx
movl (%rax,%rcx,4), %eax
movl %eax, -0x10(%rbp)
movl -0x14(%rbp), %eax
shll %eax
movl %eax, -0x14(%rbp)
jmp 0x22ef
movq -0x20(%rbp), %rax
movq (%rax), %rax
movl -0x10(%rbp), %ecx
addl $0x2, %ecx
movslq %ecx, %rcx
movl (%rax,%rcx,4), %eax
movl %eax, -0x10(%rbp)
movl -0x14(%rbp), %eax
shll %eax
movl %eax, -0x14(%rbp)
movl -0x14(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x14(%rbp)
jmp 0x22f1
movl -0x18(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x18(%rbp)
jmp 0x2278
movl -0x14(%rbp), %eax
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: 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 %rbp
movq %rsp, %rbp
subq $0x20, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x18(%rbp)
movl -0xc(%rbp), %ecx
movl %ecx, 0x8(%rax)
movl -0xc(%rbp), %edi
callq 0x3140
movl %eax, %ecx
movq -0x18(%rbp), %rax
movl %ecx, 0xc(%rax)
movl 0xc(%rax), %ecx
shll %ecx
movl %ecx, 0x10(%rax)
movl 0xc(%rax), %edi
callq 0x31a0
movq -0x18(%rbp), %rax
movsd 0x4cae(%rip), %xmm1     # 0x7008
addsd %xmm1, %xmm0
cvttsd2si %xmm0, %ecx
movl %ecx, 0x14(%rax)
movslq 0x10(%rax), %rdi
shlq $0x2, %rdi
callq 0x1140
movq %rax, %rcx
movq -0x18(%rbp), %rax
movq %rcx, (%rax)
addq $0x20, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: 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:
pushq %rbp
movq %rsp, %rbp
subq $0x20, %rsp
movq %rdi, -0x8(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x18(%rbp)
movl $0x1, -0xc(%rbp)
movl $0x1, -0x10(%rbp)
movq -0x18(%rbp), %rcx
movl -0x10(%rbp), %eax
cmpl 0x10(%rcx), %eax
jge 0x2b95
movq -0x18(%rbp), %rax
movq (%rax), %rax
movslq -0x10(%rbp), %rcx
movl (%rax,%rcx,4), %esi
leaq 0x4591(%rip), %rdi      # 0x7114
movb $0x0, %al
callq 0x1030
movl -0x10(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x10(%rbp)
jmp 0x2b62
leaq 0x4590(%rip), %rdi      # 0x712c
movb $0x0, %al
callq 0x1030
addq $0x20, %rsp
popq %rbp
retq
nopl (%rax)
// File: 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 %rbp
movq %rsp, %rbp
subq $0x20, %rsp
movb %dl, %al
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
andb $0x1, %al
movb %al, -0xd(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x18(%rbp)
movl -0xc(%rbp), %ecx
movl %ecx, 0x8(%rax)
movb -0xd(%rbp), %cl
andb $0x1, %cl
movb %cl, 0x18(%rax)
movl -0xc(%rbp), %edi
callq 0x3140
movl %eax, %ecx
movq -0x18(%rbp), %rax
movl %ecx, 0xc(%rax)
movl 0xc(%rax), %ecx
shll %ecx
movl %ecx, 0x10(%rax)
movl 0xc(%rax), %edi
callq 0x31a0
movq -0x18(%rbp), %rax
movsd 0x43fe(%rip), %xmm1     # 0x7008
addsd %xmm1, %xmm0
cvttsd2si %xmm0, %ecx
movl %ecx, 0x14(%rax)
movslq 0x10(%rax), %rdi
shlq $0x2, %rdi
callq 0x1140
movq %rax, %rcx
movq -0x18(%rbp), %rax
movq %rcx, (%rax)
addq $0x20, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: 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
movq %rsp, %rbp
subq $0x30, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl %ecx, -0x14(%rbp)
movl %r8d, -0x18(%rbp)
movl %r9d, -0x1c(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x30(%rbp)
movl -0x10(%rbp), %eax
cmpl -0x14(%rbp), %eax
jne 0x2d13
movq -0x30(%rbp), %rax
movl -0x1c(%rbp), %edx
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x2da5
movl -0x10(%rbp), %eax
addl -0x14(%rbp), %eax
movl $0x2, %ecx
cltd
idivl %ecx
movl %eax, -0x20(%rbp)
movl -0xc(%rbp), %eax
shll %eax
movl %eax, -0x24(%rbp)
movl -0xc(%rbp), %eax
shll %eax
addl $0x1, %eax
movl %eax, -0x28(%rbp)
movl -0x18(%rbp), %eax
cmpl -0x20(%rbp), %eax
jg 0x2d5b
movq -0x30(%rbp), %rdi
movl -0x24(%rbp), %esi
movl -0x10(%rbp), %edx
movl -0x20(%rbp), %ecx
movl -0x18(%rbp), %r8d
movl -0x1c(%rbp), %r9d
callq 0x2cd0
jmp 0x2d78
movq -0x30(%rbp), %rdi
movl -0x28(%rbp), %esi
movl -0x20(%rbp), %edx
addl $0x1, %edx
movl -0x14(%rbp), %ecx
movl -0x18(%rbp), %r8d
movl -0x1c(%rbp), %r9d
callq 0x2cd0
movq -0x30(%rbp), %rdi
movq (%rdi), %rax
movslq -0x24(%rbp), %rcx
movl (%rax,%rcx,4), %esi
movq (%rdi), %rax
movslq -0x28(%rbp), %rcx
movl (%rax,%rcx,4), %edx
callq 0x40b0
movl %eax, %edx
movq -0x30(%rbp), %rax
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
addq $0x30, %rsp
popq %rbp
retq
nopl (%rax,%rax)
// File: 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:
pushq %rbp
movq %rsp, %rbp
subq $0x40, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl %ecx, -0x14(%rbp)
movl %r8d, -0x18(%rbp)
movl %r9d, -0x1c(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x38(%rbp)
movl -0x10(%rbp), %eax
cmpl -0x14(%rbp), %eax
je 0x2e20
movl -0x10(%rbp), %eax
addl -0x14(%rbp), %eax
sarl %eax
movl %eax, -0x20(%rbp)
movl -0xc(%rbp), %eax
shll %eax
movl %eax, -0x24(%rbp)
movl -0x24(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x28(%rbp)
movl -0x18(%rbp), %eax
cmpl -0x20(%rbp), %eax
jg 0x2e0f
movl -0x24(%rbp), %eax
movl %eax, -0xc(%rbp)
movl -0x20(%rbp), %eax
movl %eax, -0x14(%rbp)
jmp 0x2e1e
movl -0x28(%rbp), %eax
movl %eax, -0xc(%rbp)
movl -0x20(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x10(%rbp)
jmp 0x2dd5
movq -0x38(%rbp), %rax
movl -0x1c(%rbp), %edx
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
cmpl $0x1, -0xc(%rbp)
je 0x2e85
movq -0x38(%rbp), %rdi
movl -0xc(%rbp), %eax
movl $0x2, %ecx
cltd
idivl %ecx
movl %eax, -0xc(%rbp)
movl -0xc(%rbp), %eax
shll %eax
movl %eax, -0x2c(%rbp)
movl -0x2c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x30(%rbp)
movq (%rdi), %rax
movslq -0x2c(%rbp), %rcx
movl (%rax,%rcx,4), %esi
movq (%rdi), %rax
movslq -0x30(%rbp), %rcx
movl (%rax,%rcx,4), %edx
callq 0x40b0
movl %eax, %edx
movq -0x38(%rbp), %rax
movq (%rax), %rax
movslq -0xc(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x2e31
addq $0x40, %rsp
popq %rbp
retq
nopl (%rax,%rax)
// File: 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:
pushq %rbp
movq %rsp, %rbp
subq $0x40, %rsp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movl %edx, -0x18(%rbp)
movl %ecx, -0x1c(%rbp)
movl %r8d, -0x20(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0x38(%rbp)
movl -0x18(%rbp), %eax
cmpl -0x1c(%rbp), %eax
jne 0x2ec1
movl -0x18(%rbp), %eax
movl %eax, -0x4(%rbp)
jmp 0x2f2f
movq -0x38(%rbp), %rcx
movl -0x18(%rbp), %eax
addl -0x1c(%rbp), %eax
movl $0x2, %esi
cltd
idivl %esi
movl %eax, -0x24(%rbp)
movl -0x14(%rbp), %eax
shll %eax
movl %eax, -0x28(%rbp)
movl -0x14(%rbp), %eax
shll %eax
addl $0x1, %eax
movl %eax, -0x2c(%rbp)
movl -0x20(%rbp), %eax
movq (%rcx), %rcx
movslq -0x28(%rbp), %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x2f13
movq -0x38(%rbp), %rdi
movl -0x28(%rbp), %esi
movl -0x18(%rbp), %edx
movl -0x24(%rbp), %ecx
movl -0x20(%rbp), %r8d
callq 0x2e90
movl %eax, -0x4(%rbp)
jmp 0x2f2f
movq -0x38(%rbp), %rdi
movl -0x2c(%rbp), %esi
movl -0x24(%rbp), %edx
addl $0x1, %edx
movl -0x1c(%rbp), %ecx
movl -0x20(%rbp), %r8d
callq 0x2e90
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
addq $0x40, %rsp
popq %rbp
retq
nopl (%rax,%rax)
// File: 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:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movl %ecx, -0x14(%rbp)
movl %r8d, -0x18(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x30(%rbp)
movl -0x10(%rbp), %eax
cmpl -0x14(%rbp), %eax
je 0x2fb3
movq -0x30(%rbp), %rcx
movl -0x10(%rbp), %eax
addl -0x14(%rbp), %eax
sarl %eax
movl %eax, -0x1c(%rbp)
movl -0xc(%rbp), %eax
shll %eax
movl %eax, -0x20(%rbp)
movl -0x20(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x24(%rbp)
movl -0x18(%rbp), %eax
movq (%rcx), %rcx
movslq -0x20(%rbp), %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x2fa2
movl -0x20(%rbp), %eax
movl %eax, -0xc(%rbp)
movl -0x1c(%rbp), %eax
movl %eax, -0x14(%rbp)
jmp 0x2fb1
movl -0x24(%rbp), %eax
movl %eax, -0xc(%rbp)
movl -0x1c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x10(%rbp)
jmp 0x2f5d
movl -0x10(%rbp), %eax
popq %rbp
retq
nopl (%rax,%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::update(int, int)
void simple_static_search_tree:: update(int index, int value){
    if (this->recursive)
    {
        this->update_recursive(1, 0, this->length - 1, index, value);
    }
    else
    {
        this->update_iterative(1, 0, this->length - 1, index, value);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x20, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl %edx, -0x10(%rbp)
movq -0x8(%rbp), %rax
movq %rax, -0x18(%rbp)
testb $0x1, 0x18(%rax)
je 0x3000
movq -0x18(%rbp), %rdi
movl 0xc(%rdi), %ecx
subl $0x1, %ecx
movl -0xc(%rbp), %r8d
movl -0x10(%rbp), %r9d
movl $0x1, %esi
xorl %edx, %edx
callq 0x2cd0
jmp 0x301e
movq -0x18(%rbp), %rdi
movl 0xc(%rdi), %ecx
subl $0x1, %ecx
movl -0xc(%rbp), %r8d
movl -0x10(%rbp), %r9d
movl $0x1, %esi
xorl %edx, %edx
callq 0x2db0
addq $0x20, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: simple_static_search_tree::get(int)
int simple_static_search_tree::get(int value) {
    if(this->recursive) {
        int result = this->get_recursive(1, 0, this->length - 1, value);
        return result;
    }
    else {
        int result = this->get_iterative(1, 0, this->length - 1, value);
        return result;
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x30, %rsp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0x28(%rbp)
testb $0x1, 0x18(%rax)
je 0x3072
movq -0x28(%rbp), %rdi
movl 0xc(%rdi), %ecx
subl $0x1, %ecx
movl -0x14(%rbp), %r8d
movl $0x1, %esi
xorl %edx, %edx
callq 0x2e90
movl %eax, -0x18(%rbp)
movl -0x18(%rbp), %eax
movl %eax, -0x4(%rbp)
jmp 0x3095
movq -0x28(%rbp), %rdi
movl 0xc(%rdi), %ecx
subl $0x1, %ecx
movl -0x14(%rbp), %r8d
movl $0x1, %esi
xorl %edx, %edx
callq 0x2f40
movl %eax, -0x1c(%rbp)
movl -0x1c(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
addq $0x30, %rsp
popq %rbp
retq
nop
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: map_rep_static_search_tree::get(int)
int map_rep_static_search_tree::get(int value) {
    auto it = this->m.lower_bound(value);
    if(it == m.end()) {
        return NOT_FOUND_INDEX;
    }
    return it->second;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x30, %rsp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movq -0x10(%rbp), %rdi
movq %rdi, -0x30(%rbp)
leaq -0x14(%rbp), %rsi
callq 0x41c0
movq -0x30(%rbp), %rdi
movq %rax, -0x20(%rbp)
callq 0x4220
movq %rax, -0x28(%rbp)
leaq -0x20(%rbp), %rdi
leaq -0x28(%rbp), %rsi
callq 0x41f0
testb $0x1, %al
jne 0x3114
jmp 0x311d
movl $0xffffffff, -0x4(%rbp) # imm = 0xFFFFFFFF
jmp 0x312c
leaq -0x20(%rbp), %rdi
callq 0x4250
movl 0x4(%rax), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
addq $0x30, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
nop
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: next_power_of_2(unsigned int)
inline int next_power_of_2(unsigned int n) {
    n--;
    n |= n >> 1;
    n |= n >> 2;
    n |= n >> 4;
    n |= n >> 8;
    n |= n >> 16;
    n++;
    return n; 
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movl %edi, -0x4(%rbp)
movl -0x4(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
shrl %eax
orl -0x4(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
shrl $0x2, %eax
orl -0x4(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
shrl $0x4, %eax
orl -0x4(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
shrl $0x8, %eax
orl -0x4(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
shrl $0x10, %eax
orl -0x4(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
popq %rbp
retq
nopl (%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: co_static_search_tree::get_3_base_case(int, int, int, int)
inline int co_static_search_tree::get_3_base_case(int block_index, int range_left, int og_height, int value) {
    /*
                            0
                    1               4
                2       3       5       6
    */

    int leafs_og_height = og_height - 2;
    int leafs_range_length = (1 << (leafs_og_height - 1));
    if(value <= this->tree[block_index + 1]){
        if (value <= this->tree[block_index + 2])
            return range_left;
        else    
            return range_left + leafs_range_length;
    } else {
        if(value <= this->tree[block_index + 5])
            return range_left + leafs_range_length << 1;
        else
            return range_left + (leafs_range_length << 1) + leafs_range_length; 
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movl %edx, -0x18(%rbp)
movl %ecx, -0x1c(%rbp)
movl %r8d, -0x20(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0x30(%rbp)
movl -0x1c(%rbp), %eax
subl $0x2, %eax
movl %eax, -0x24(%rbp)
movl -0x24(%rbp), %ecx
subl $0x1, %ecx
movl $0x1, %eax
shll %cl, %eax
movq -0x30(%rbp), %rcx
movl %eax, -0x28(%rbp)
movl -0x20(%rbp), %eax
movq (%rcx), %rcx
movl -0x14(%rbp), %edx
addl $0x1, %edx
movslq %edx, %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x3d39
movq -0x30(%rbp), %rcx
movl -0x20(%rbp), %eax
movq (%rcx), %rcx
movl -0x14(%rbp), %edx
addl $0x2, %edx
movslq %edx, %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x3d2e
movl -0x18(%rbp), %eax
movl %eax, -0x4(%rbp)
jmp 0x3d6e
movl -0x18(%rbp), %eax
addl -0x28(%rbp), %eax
movl %eax, -0x4(%rbp)
jmp 0x3d6e
movq -0x30(%rbp), %rcx
movl -0x20(%rbp), %eax
movq (%rcx), %rcx
movl -0x14(%rbp), %edx
addl $0x5, %edx
movslq %edx, %rdx
cmpl (%rcx,%rdx,4), %eax
jg 0x3d5e
movl -0x18(%rbp), %eax
addl -0x28(%rbp), %eax
shll %eax
movl %eax, -0x4(%rbp)
jmp 0x3d6e
movl -0x18(%rbp), %eax
movl -0x28(%rbp), %ecx
shll %ecx
addl %ecx, %eax
addl -0x28(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
popq %rbp
retq
nopw %cs:(%rax,%rax)
nopl (%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: co_static_search_tree::left_child(int, int, int)
inline int co_static_search_tree::left_child(int block_index, int depth, int path) {
    if (depth & 1){
        return block_index + 1;
    }
    int biggest_leaving_block_h = (depth & ~(depth - 1));
    int bottom_tree_index = (path << 1) & ((1 << biggest_leaving_block_h) - 1);
    int next_big_block_index = this->block_index_memo[depth + 1 - biggest_leaving_block_h];
    int left_child_block_index = next_big_block_index + ((bottom_tree_index + 1) << biggest_leaving_block_h) - (bottom_tree_index + 1);
    return left_child_block_index;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movl %edx, -0x18(%rbp)
movl %ecx, -0x1c(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0x38(%rbp)
movl -0x18(%rbp), %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0x3f6f
movl -0x14(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x4(%rbp)
jmp 0x3fd7
movq -0x38(%rbp), %rax
movl -0x18(%rbp), %ecx
movl -0x18(%rbp), %edx
subl $0x1, %edx
xorl $-0x1, %edx
andl %edx, %ecx
movl %ecx, -0x20(%rbp)
movl -0x1c(%rbp), %ecx
shll %ecx
movl %ecx, -0x3c(%rbp)
movl -0x20(%rbp), %ecx
movl $0x1, %edx
shll %cl, %edx
movl -0x3c(%rbp), %ecx
subl $0x1, %edx
andl %edx, %ecx
movl %ecx, -0x24(%rbp)
movl -0x18(%rbp), %ecx
addl $0x1, %ecx
subl -0x20(%rbp), %ecx
movslq %ecx, %rcx
movl 0x20(%rax,%rcx,4), %eax
movl %eax, -0x28(%rbp)
movl -0x28(%rbp), %eax
movl -0x24(%rbp), %edx
addl $0x1, %edx
movl -0x20(%rbp), %ecx
shll %cl, %edx
movl %edx, %ecx
addl %ecx, %eax
movl -0x24(%rbp), %ecx
addl $0x1, %ecx
subl %ecx, %eax
movl %eax, -0x2c(%rbp)
movl -0x2c(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
popq %rbp
retq
nopl (%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/static_search_trees.cpp
// Function: co_static_search_tree::right_child(int, int, int)
inline int co_static_search_tree::right_child(int block_index, int depth, int path) {
    if (depth & 1){
        return block_index + 2;
    }
    int biggest_leaving_block_h = (depth & ~(depth - 1));
    int bottom_tree_index = ((path << 1) | 1) & ((1 << biggest_leaving_block_h) - 1);
    int next_big_block_index = this->block_index_memo[depth + 1 - biggest_leaving_block_h];
    int right_child_block_index = next_big_block_index + ((bottom_tree_index + 1) << biggest_leaving_block_h) - (bottom_tree_index + 1);
    return right_child_block_index;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movl %edx, -0x18(%rbp)
movl %ecx, -0x1c(%rbp)
movq -0x10(%rbp), %rax
movq %rax, -0x38(%rbp)
movl -0x18(%rbp), %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0x400f
movl -0x14(%rbp), %eax
addl $0x2, %eax
movl %eax, -0x4(%rbp)
jmp 0x407a
movq -0x38(%rbp), %rax
movl -0x18(%rbp), %ecx
movl -0x18(%rbp), %edx
subl $0x1, %edx
xorl $-0x1, %edx
andl %edx, %ecx
movl %ecx, -0x20(%rbp)
movl -0x1c(%rbp), %ecx
shll %ecx
orl $0x1, %ecx
movl %ecx, -0x3c(%rbp)
movl -0x20(%rbp), %ecx
movl $0x1, %edx
shll %cl, %edx
movl -0x3c(%rbp), %ecx
subl $0x1, %edx
andl %edx, %ecx
movl %ecx, -0x24(%rbp)
movl -0x18(%rbp), %ecx
addl $0x1, %ecx
subl -0x20(%rbp), %ecx
movslq %ecx, %rcx
movl 0x20(%rax,%rcx,4), %eax
movl %eax, -0x28(%rbp)
movl -0x28(%rbp), %eax
movl -0x24(%rbp), %edx
addl $0x1, %edx
movl -0x20(%rbp), %ecx
shll %cl, %edx
movl %edx, %ecx
addl %ecx, %eax
movl -0x24(%rbp), %ecx
addl $0x1, %ecx
subl %ecx, %eax
movl %eax, -0x2c(%rbp)
movl -0x2c(%rbp), %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
popq %rbp
retq
nop
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/test_ca_sst.cpp
// Function: print_array(int*, int)
void print_array(int *a, int n) {
    printf("Array of length: %d\n", n);
    for (int i = 0; i < n; ++i){
        printf("%d ", a[i]);
    }
    printf("\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x10, %rsp
movq %rdi, -0x8(%rbp)
movl %esi, -0xc(%rbp)
movl -0xc(%rbp), %esi
leaq 0x1d40(%rip), %rdi      # 0x7119
movb $0x0, %al
callq 0x1030
movl $0x0, -0x10(%rbp)
movl -0x10(%rbp), %eax
cmpl -0xc(%rbp), %eax
jge 0x5413
movq -0x8(%rbp), %rax
movslq -0x10(%rbp), %rcx
movl (%rax,%rcx,4), %esi
leaq 0x1d13(%rip), %rdi      # 0x7114
movb $0x0, %al
callq 0x1030
movl -0x10(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x10(%rbp)
jmp 0x53e7
leaq 0x1d12(%rip), %rdi      # 0x712c
movb $0x0, %al
callq 0x1030
addq $0x10, %rsp
popq %rbp
retq
nopw (%rax,%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/test_ca_sst.cpp
// Function: test_get_update_2()
void test_get_update_2() {
    // Test edge case with a tree of size 1.
    CA_static_search_tree tree(1);
    tree.update(0, 2);
    if (tree.get(2) != 0) {
        cout << "test_get_update_2 failed: expected 2 at index 0." << endl;
        return;
    }
    tree.update(0, 5);
    if (tree.get(5) != 0) {
        cout << "test_get_update_2 failed: expected 5 at index 0." << endl;
        return;
    }
    tree.update(0, 501);
    if (tree.get(501) != 0) {
        cout << "test_get_update_2 failed: expected 501 at index 0." << endl;
        return;
    }
    cout << "test_get_update_2: OK" << endl;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x70, %rsp
leaq -0x18(%rbp), %rdi
movq %rdi, -0x30(%rbp)
movl $0x1, %esi
callq 0x2310
movq -0x30(%rbp), %rdi
xorl %esi, %esi
movl $0x2, %edx
callq 0x2aa0
jmp 0x567c
leaq -0x18(%rbp), %rdi
movl $0x2, %esi
callq 0x2af0
movl %eax, -0x34(%rbp)
jmp 0x568f
movl -0x34(%rbp), %eax
cmpl $0x0, %eax
je 0x56e8
movq 0x493a(%rip), %rdi      # 0x9fd8
leaq 0x1b51(%rip), %rsi      # 0x71f6
callq 0x10d0
movq %rax, -0x40(%rbp)
jmp 0x56b0
movq -0x40(%rbp), %rdi
movq 0x490d(%rip), %rsi      # 0x9fc8
callq 0x1110
jmp 0x56c2
movl $0x1, -0x28(%rbp)
jmp 0x57df
movq %rax, %rcx
movl %edx, %eax
movq %rcx, -0x20(%rbp)
movl %eax, -0x24(%rbp)
leaq -0x18(%rbp), %rdi
callq 0x2390
jmp 0x57ee
leaq -0x18(%rbp), %rdi
xorl %esi, %esi
movl $0x5, %edx
callq 0x2aa0
jmp 0x56fa
leaq -0x18(%rbp), %rdi
movl $0x5, %esi
callq 0x2af0
movl %eax, -0x44(%rbp)
jmp 0x570d
movl -0x44(%rbp), %eax
cmpl $0x0, %eax
je 0x574c
movq 0x48bc(%rip), %rdi      # 0x9fd8
leaq 0x1b04(%rip), %rsi      # 0x7227
callq 0x10d0
movq %rax, -0x50(%rbp)
jmp 0x572e
movq -0x50(%rbp), %rdi
movq 0x488f(%rip), %rsi      # 0x9fc8
callq 0x1110
jmp 0x5740
movl $0x1, -0x28(%rbp)
jmp 0x57df
leaq -0x18(%rbp), %rdi
xorl %esi, %esi
movl $0x1f5, %edx            # imm = 0x1F5
callq 0x2aa0
jmp 0x575e
leaq -0x18(%rbp), %rdi
movl $0x1f5, %esi            # imm = 0x1F5
callq 0x2af0
movl %eax, -0x54(%rbp)
jmp 0x5771
movl -0x54(%rbp), %eax
cmpl $0x0, %eax
je 0x57ad
movq 0x4858(%rip), %rdi      # 0x9fd8
leaq 0x1ad1(%rip), %rsi      # 0x7258
callq 0x10d0
movq %rax, -0x60(%rbp)
jmp 0x5792
movq -0x60(%rbp), %rdi
movq 0x482b(%rip), %rsi      # 0x9fc8
callq 0x1110
jmp 0x57a4
movl $0x1, -0x28(%rbp)
jmp 0x57df
movq 0x4824(%rip), %rdi      # 0x9fd8
leaq 0x1ad0(%rip), %rsi      # 0x728b
callq 0x10d0
movq %rax, -0x68(%rbp)
jmp 0x57c6
movq -0x68(%rbp), %rdi
movq 0x47f7(%rip), %rsi      # 0x9fc8
callq 0x1110
jmp 0x57d8
movl $0x0, -0x28(%rbp)
leaq -0x18(%rbp), %rdi
callq 0x2390
addq $0x70, %rsp
popq %rbp
retq
movq -0x20(%rbp), %rdi
callq 0x1190
nopw (%rax,%rax)
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/test_ca_sst.cpp
// Function: test_get_update_3()
void test_get_update_3() {
    // -- This is a bit of stress test
    // Test update all elements in order from element 0 to last element.
    // make value = key. Do multiple passes with random tree sizes.
    for (int i = 0; i < 100; i++) {
        // limit size to the range [0...10000]
        // no point in doing more.
        int t_size = 1 + rand() % 10000;
        CA_static_search_tree tree(t_size);
        for (int j = 0; j < t_size; j++) {
            tree.update(j, j);
        }
        for (int j = 0; j < t_size; j++) {
            if (tree.get(j) != j) {
                cout << "test_get_update_3 failed: expected value " << j << " at index " << j << ", tree size: " << t_size << endl;
                return;
            }
        }
    }
    cout << "test_get_update_3: OK" << endl;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x70, %rsp
movl $0x0, -0x4(%rbp)
cmpl $0x64, -0x4(%rbp)
jge 0x597f
callq 0x1050
movl $0x2710, %ecx           # imm = 0x2710
cltd
idivl %ecx
addl $0x1, %edx
movl %edx, -0x8(%rbp)
movl -0x8(%rbp), %esi
leaq -0x20(%rbp), %rdi
callq 0x2310
movl $0x0, -0x24(%rbp)
movl -0x24(%rbp), %eax
cmpl -0x8(%rbp), %eax
jge 0x587e
movl -0x24(%rbp), %edx
leaq -0x20(%rbp), %rdi
movl %edx, %esi
callq 0x2aa0
jmp 0x5857
jmp 0x5859
movl -0x24(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x24(%rbp)
jmp 0x583f
movq %rax, %rcx
movl %edx, %eax
movq %rcx, -0x30(%rbp)
movl %eax, -0x34(%rbp)
leaq -0x20(%rbp), %rdi
callq 0x2390
jmp 0x59a7
movl $0x0, -0x38(%rbp)
movl -0x38(%rbp), %eax
cmpl -0x8(%rbp), %eax
jge 0x5954
movl -0x38(%rbp), %esi
leaq -0x20(%rbp), %rdi
callq 0x2af0
movl %eax, -0x40(%rbp)
jmp 0x58a2
movl -0x40(%rbp), %eax
cmpl -0x38(%rbp), %eax
je 0x5944
movq 0x4723(%rip), %rdi      # 0x9fd8
leaq 0x19e5(%rip), %rsi      # 0x72a1
callq 0x10d0
movq %rax, -0x48(%rbp)
jmp 0x58c7
movq -0x48(%rbp), %rdi
movl -0x38(%rbp), %esi
callq 0x1180
movq %rax, -0x50(%rbp)
jmp 0x58d9
movq -0x50(%rbp), %rdi
leaq 0x19e7(%rip), %rsi      # 0x72cb
callq 0x10d0
movq %rax, -0x58(%rbp)
jmp 0x58ef
movq -0x58(%rbp), %rdi
movl -0x38(%rbp), %esi
callq 0x1180
movq %rax, -0x60(%rbp)
jmp 0x5901
movq -0x60(%rbp), %rdi
leaq 0x19ca(%rip), %rsi      # 0x72d6
callq 0x10d0
movq %rax, -0x68(%rbp)
jmp 0x5917
movq -0x68(%rbp), %rdi
movl -0x8(%rbp), %esi
callq 0x1180
movq %rax, -0x70(%rbp)
jmp 0x5929
movq -0x70(%rbp), %rdi
movq 0x4694(%rip), %rsi      # 0x9fc8
callq 0x1110
jmp 0x593b
movl $0x1, -0x3c(%rbp)
jmp 0x595b
jmp 0x5946
movl -0x38(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x38(%rbp)
jmp 0x5885
movl $0x0, -0x3c(%rbp)
leaq -0x20(%rbp), %rdi
callq 0x2390
movl -0x3c(%rbp), %eax
testl %eax, %eax
je 0x596f
jmp 0x596d
jmp 0x59a1
jmp 0x5971
movl -0x4(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x4(%rbp)
jmp 0x580f
movq 0x4652(%rip), %rdi      # 0x9fd8
leaq 0x1957(%rip), %rsi      # 0x72e4
callq 0x10d0
movq %rax, %rdi
movq 0x462c(%rip), %rsi      # 0x9fc8
callq 0x1110
addq $0x70, %rsp
popq %rbp
retq
movq -0x30(%rbp), %rdi
callq 0x1190
// File: 6851-2021[P]Cache-Oblivious-Data-Structures/static_search_trees/test_ca_sst.cpp
// Function: main
int main() {
    srand(10);
    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
    test_get_update_1();
    test_get_update_2();
    test_get_update_3();
    test_get_update_4();
    test_get_update_5();
    chrono::steady_clock::time_point end = chrono::steady_clock::now();
    cout << "Time difference = " << chrono::duration_cast<chrono::microseconds>(end - begin).count() << "[µs]" << std::endl;

    return 0;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x30, %rsp
movl $0x0, -0x4(%rbp)
movl $0xa, %edi
callq 0x10c0
callq 0x1130
movq %rax, -0x10(%rbp)
callq 0x5430
callq 0x5650
callq 0x5800
callq 0x59b0
callq 0x5ba0
callq 0x1130
movq %rax, -0x18(%rbp)
movq 0x411d(%rip), %rdi      # 0x9fd8
leaq 0x14b8(%rip), %rsi      # 0x737a
callq 0x10d0
movq %rax, -0x30(%rbp)
leaq -0x18(%rbp), %rdi
leaq -0x10(%rbp), %rsi
callq 0x5f60
movq %rax, -0x28(%rbp)
leaq -0x28(%rbp), %rdi
callq 0x5f30
movq %rax, -0x20(%rbp)
leaq -0x20(%rbp), %rdi
callq 0x5fb0
movq -0x30(%rbp), %rdi
movq %rax, %rsi
callq 0x11b0
movq %rax, %rdi
leaq 0x1485(%rip), %rsi      # 0x738d
callq 0x10d0
movq %rax, %rdi
movq 0x40b1(%rip), %rsi      # 0x9fc8
callq 0x1110
xorl %eax, %eax
addq $0x30, %rsp
popq %rbp
retq
nopw %cs:(%rax,%rax)
nop
// File: Dts0[P]addCopyright/main.cpp
// Function: showHelp()
void showHelp(){
	cout<<"用法：addCopyright [选项]... [文件]... \n"
		<<"\t-c\t版权文件路径，如果无法打开，直接退出\n"
		<<"\t-h\t打印帮助并退出\n"
		<<"\t-v\t打印版本信息并退出\n";
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq 0x4cbd(%rip), %rdi      # 0x7fd8
leaq 0x1e44(%rip), %rsi      # 0x5166
callq 0x21e0
movq %rax, %rdi
leaq 0x1e65(%rip), %rsi      # 0x5196
callq 0x21e0
movq %rax, %rdi
leaq 0x1e92(%rip), %rsi      # 0x51d2
callq 0x21e0
movq %rax, %rdi
leaq 0x1e9e(%rip), %rsi      # 0x51ed
callq 0x21e0
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: Dts0[P]addCopyright/main.cpp
// Function: showVersion()
void showVersion(){
	cout<<"addCopyright:1.0.0\n"
		<<"Copyright (C) DTS\n"
		<<"License MIT\n"
		<<"Written by DTS\n"
		<<"my website: <http://www.dreamoftime0.com/>"
		<<endl;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq 0x4c0d(%rip), %rdi      # 0x7fd8
leaq 0x1e4d(%rip), %rsi      # 0x521f
callq 0x21e0
movq %rax, %rdi
leaq 0x1e52(%rip), %rsi      # 0x5233
callq 0x21e0
movq %rax, %rdi
leaq 0x1e56(%rip), %rsi      # 0x5246
callq 0x21e0
movq %rax, %rdi
leaq 0x1e54(%rip), %rsi      # 0x5253
callq 0x21e0
movq %rax, %rdi
leaq 0x1e55(%rip), %rsi      # 0x5263
callq 0x21e0
movq %rax, %rdi
movq 0x4bab(%rip), %rsi      # 0x7fc8
callq 0x2210
popq %rbp
retq
nopw %cs:(%rax,%rax)
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: Population::Population()
Population() {
        numInputs = NUM_INPUTS;
        pop_size = 0;
        bestFitSoFar = DBL_MAX;
        gen = 0;
        my_isl_id = -1;
        max_tree_id = -1;
        beta = 1.0;
    }

// Assembly:
subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movq 0x10(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x7cd0
movq 0x8(%rsp), %rax
movl $0x3, 0x18(%rax)
movl $0x0, 0x1c(%rax)
movsd 0xd2b5(%rip), %xmm0     # 0x15038
movsd %xmm0, 0x40(%rax)
movl $0x0, 0x20(%rax)
movl $0xffffffff, 0x24(%rax) # imm = 0xFFFFFFFF
movl $0xffffffff, 0x28(%rax) # imm = 0xFFFFFFFF
movsd 0xd283(%rip), %xmm0     # 0x15028
movsd %xmm0, 0x48(%rax)
addq $0x18, %rsp
retq
nop
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: gaussrand()
inline double gaussrand() {
  static int iset=0;
  static double gset;
  double fac,rsq,v1,v2;

  if (iset==0) {
    do {
      v1=2.0*((rand())/(RAND_MAX+1.0))-1.0;
      v2=2.0*((rand())/(RAND_MAX+1.0))-1.0;
      rsq=v1*v1+v2*v2;
    } while (rsq>=1.0 || rsq==0.0);
    fac=sqrt(-2.0*log(rsq)/rsq);
    gset=v1*fac;
    iset=1;
    return v2*fac;
  }
  else {
    iset=0;
    return gset;
  }
}

// Assembly:
subq $0x38, %rsp
cmpl $0x0, 0x12329(%rip)     # 0x1a284
jne 0x807b
jmp 0x7f63
callq 0x3090
cvtsi2sd %eax, %xmm0
movsd 0xd134(%rip), %xmm1     # 0x150a8
divsd %xmm1, %xmm0
addsd %xmm0, %xmm0
movsd 0xd0ec(%rip), %xmm1     # 0x15070
addsd %xmm1, %xmm0
movsd %xmm0, 0x18(%rsp)
callq 0x3090
cvtsi2sd %eax, %xmm0
movsd 0xd109(%rip), %xmm1     # 0x150a8
divsd %xmm1, %xmm0
addsd %xmm0, %xmm0
movsd 0xd0c1(%rip), %xmm1     # 0x15070
addsd %xmm1, %xmm0
movsd %xmm0, 0x10(%rsp)
movsd 0x18(%rsp), %xmm0
movsd 0x18(%rsp), %xmm2
movsd 0x10(%rsp), %xmm1
mulsd 0x10(%rsp), %xmm1
mulsd %xmm2, %xmm0
addsd %xmm1, %xmm0
movsd %xmm0, 0x20(%rsp)
movsd 0x20(%rsp), %xmm0
movb $0x1, %al
movsd 0xd039(%rip), %xmm1     # 0x15028
ucomisd %xmm1, %xmm0
movb %al, 0xf(%rsp)
jae 0x8012
movsd 0x20(%rsp), %xmm0
xorps %xmm1, %xmm1
ucomisd %xmm1, %xmm0
sete %al
setnp %cl
andb %cl, %al
movb %al, 0xf(%rsp)
movb 0xf(%rsp), %al
testb $0x1, %al
jne 0x7f63
movsd 0x20(%rsp), %xmm0
callq 0x3200
movaps %xmm0, %xmm1
movsd 0xd07c(%rip), %xmm0     # 0x150b0
mulsd %xmm1, %xmm0
divsd 0x20(%rsp), %xmm0
callq 0x31e0
movsd %xmm0, 0x28(%rsp)
movsd 0x18(%rsp), %xmm0
mulsd 0x28(%rsp), %xmm0
movsd %xmm0, 0x1222b(%rip)    # 0x1a288
movl $0x1, 0x1221d(%rip)     # 0x1a284
movsd 0x10(%rsp), %xmm0
mulsd 0x28(%rsp), %xmm0
movsd %xmm0, 0x30(%rsp)
jmp 0x8093
movl $0x0, 0x121ff(%rip)     # 0x1a284
movsd 0x121fb(%rip), %xmm0    # 0x1a288
movsd %xmm0, 0x30(%rsp)
movsd 0x30(%rsp), %xmm0
addq $0x38, %rsp
retq
nop
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: Genome::~Genome()
~Genome() {
        list<Tree*>::iterator curTree;
        list<TreeID*>::iterator curTreeID;

        delete [] myData;
        delete [] initialVal;

        for (curTree = trees.begin(); curTree != trees.end(); ++curTree)
            delete (*curTree);
        for (curTreeID = tree_id_lookup.begin(); curTreeID != tree_id_lookup.end(); ++curTreeID)
            delete (*curTreeID);

        trees.clear();
        tree_id_lookup.clear();
    }

// Assembly:
subq $0x68, %rsp
movq %rdi, 0x60(%rsp)
movq 0x60(%rsp), %rax
movq %rax, 0x20(%rsp)
leaq 0x58(%rsp), %rdi
callq 0x7ce0
leaq 0x50(%rsp), %rdi
callq 0x89d0
movq 0x20(%rsp), %rax
movq 0x78(%rax), %rax
movq %rax, 0x28(%rsp)
cmpq $0x0, %rax
je 0x8195
movq 0x28(%rsp), %rdi
callq 0x3340
movq 0x20(%rsp), %rax
movq 0x80(%rax), %rax
movq %rax, 0x18(%rsp)
cmpq $0x0, %rax
je 0x81b6
movq 0x18(%rsp), %rdi
callq 0x3340
movq 0x20(%rsp), %rdi
callq 0x8810
movq %rax, 0x48(%rsp)
movq 0x48(%rsp), %rax
movq %rax, 0x58(%rsp)
movq 0x20(%rsp), %rdi
callq 0x8860
movq %rax, 0x40(%rsp)
leaq 0x58(%rsp), %rdi
leaq 0x40(%rsp), %rsi
callq 0x8840
testb $0x1, %al
jne 0x81f3
jmp 0x8232
leaq 0x58(%rsp), %rdi
callq 0x8890
movq (%rax), %rax
movq %rax, 0x10(%rsp)
cmpq $0x0, %rax
je 0x8224
movq 0x10(%rsp), %rdi
callq 0x89f0
movq 0x10(%rsp), %rdi
movl $0x38, %esi
callq 0x32b0
jmp 0x8226
leaq 0x58(%rsp), %rdi
callq 0x88b0
jmp 0x81cf
movq 0x20(%rsp), %rdi
addq $0x18, %rdi
callq 0x8ab0
movq %rax, 0x38(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0x50(%rsp)
movq 0x20(%rsp), %rdi
addq $0x18, %rdi
callq 0x8b00
movq %rax, 0x30(%rsp)
leaq 0x50(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x8ae0
testb $0x1, %al
jne 0x8277
jmp 0x82ac
leaq 0x50(%rsp), %rdi
callq 0x8b30
movq (%rax), %rax
movq %rax, 0x8(%rsp)
cmpq $0x0, %rax
je 0x829e
movq 0x8(%rsp), %rdi
movl $0x8, %esi
callq 0x32b0
jmp 0x82a0
leaq 0x50(%rsp), %rdi
callq 0x8b60
jmp 0x824f
movq 0x20(%rsp), %rdi
callq 0x8b80
movq 0x20(%rsp), %rdi
addq $0x18, %rdi
callq 0x8bb0
movq 0x20(%rsp), %rdi
addq $0x18, %rdi
callq 0x8be0
movq 0x20(%rsp), %rdi
callq 0x8bf0
addq $0x68, %rsp
retq
nopw %cs:(%rax,%rax)
nopl (%rax,%rax)
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: Population::~Population()
~Population() {
        list<Genome*>::iterator curGenome;
        for (curGenome = genomes.begin(); curGenome != genomes.end(); ++curGenome)
            delete (*curGenome);

        genomes.clear();
    }

// Assembly:
subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0x10(%rsp)
leaq 0x28(%rsp), %rdi
callq 0x7cb0
movq 0x10(%rsp), %rdi
callq 0x7e70
movq %rax, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x28(%rsp)
movq 0x10(%rsp), %rdi
callq 0x7ec0
movq %rax, 0x18(%rsp)
leaq 0x28(%rsp), %rdi
leaq 0x18(%rsp), %rsi
callq 0x7ea0
testb $0x1, %al
jne 0x877a
jmp 0x87b9
leaq 0x28(%rsp), %rdi
callq 0x7ef0
movq (%rax), %rax
movq %rax, 0x8(%rsp)
cmpq $0x0, %rax
je 0x87ab
movq 0x8(%rsp), %rdi
callq 0x8150
movq 0x8(%rsp), %rdi
movl $0x90, %esi
callq 0x32b0
jmp 0x87ad
leaq 0x28(%rsp), %rdi
callq 0x7f10
jmp 0x8756
movq 0x10(%rsp), %rdi
callq 0x80a0
movq 0x10(%rsp), %rdi
callq 0x88d0
addq $0x38, %rsp
retq
nopw %cs:(%rax,%rax)
nopl (%rax)
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: Tree::~Tree()
~Tree() {
        delete tree_id;
        if (!isTerminal) {
            if (leftTree != NULL)
                delete leftTree;
            if (rightTree != NULL)
                delete rightTree;
        }
    }

// Assembly:
subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
movq 0x10(%rax), %rax
movq %rax, 0x18(%rsp)
cmpq $0x0, %rax
je 0x8a21
movq 0x18(%rsp), %rdi
movl $0x8, %esi
callq 0x32b0
movq 0x10(%rsp), %rax
cmpl $0x0, 0x18(%rax)
jne 0x8a9f
movq 0x10(%rsp), %rax
cmpq $0x0, (%rax)
je 0x8a65
movq 0x10(%rsp), %rax
movq (%rax), %rax
movq %rax, 0x8(%rsp)
cmpq $0x0, %rax
je 0x8a63
movq 0x8(%rsp), %rdi
callq 0x89f0
movq 0x8(%rsp), %rdi
movl $0x38, %esi
callq 0x32b0
jmp 0x8a65
movq 0x10(%rsp), %rax
cmpq $0x0, 0x8(%rax)
je 0x8a9d
movq 0x10(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, (%rsp)
cmpq $0x0, %rax
je 0x8a9b
movq (%rsp), %rdi
callq 0x89f0
movq (%rsp), %rdi
movl $0x38, %esi
callq 0x32b0
jmp 0x8a9d
jmp 0x8a9f
addq $0x28, %rsp
retq
nopw %cs:(%rax,%rax)
nop
// File: pgrouchy[P]NoiseWorld/./mathNet.h
// Function: Tree::Tree(Tree*)
Tree (Tree *copyMe) {
        leftTree = NULL;
        rightTree = NULL;
        if (copyMe->leftTree != NULL)
            leftTree = new Tree(copyMe->leftTree);
        if (copyMe->rightTree != NULL)
            rightTree = new Tree(copyMe->rightTree);

        isTerminal = copyMe->isTerminal;
        isConstant = copyMe->isConstant;
        myVal = copyMe->myVal;
        myDepth = copyMe->myDepth;
        numConstants = copyMe->numConstants;
        numTerminals = copyMe->numTerminals;
        numNodes = copyMe->numNodes;
        tree_id = new TreeID(copyMe->tree_id);
    }

// Assembly:
subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x20(%rsp)
movq $0x0, (%rax)
movq $0x0, 0x8(%rax)
movq 0x38(%rsp), %rax
cmpq $0x0, (%rax)
je 0x9137
movl $0x38, %edi
callq 0x32a0
movq %rax, %rdi
movq %rdi, %rax
movq %rax, 0x18(%rsp)
movq 0x38(%rsp), %rax
movq (%rax), %rsi
callq 0x90b0
jmp 0x9106
movq 0x20(%rsp), %rax
movq 0x18(%rsp), %rcx
movq %rcx, (%rax)
jmp 0x9137
movq 0x18(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x30(%rsp)
movl %eax, 0x2c(%rsp)
movl $0x38, %esi
callq 0x32b0
jmp 0x9245
movq 0x38(%rsp), %rax
cmpq $0x0, 0x8(%rax)
je 0x919a
movl $0x38, %edi
callq 0x32a0
movq %rax, %rdi
movq %rdi, %rax
movq %rax, 0x10(%rsp)
movq 0x38(%rsp), %rax
movq 0x8(%rax), %rsi
callq 0x90b0
jmp 0x9168
movq 0x20(%rsp), %rax
movq 0x10(%rsp), %rcx
movq %rcx, 0x8(%rax)
jmp 0x919a
movq 0x10(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x30(%rsp)
movl %eax, 0x2c(%rsp)
movl $0x38, %esi
callq 0x32b0
jmp 0x9245
movq 0x20(%rsp), %rax
movq 0x38(%rsp), %rcx
movl 0x18(%rcx), %ecx
movl %ecx, 0x18(%rax)
movq 0x38(%rsp), %rcx
movl 0x1c(%rcx), %ecx
movl %ecx, 0x1c(%rax)
movq 0x38(%rsp), %rcx
movsd 0x20(%rcx), %xmm0
movsd %xmm0, 0x20(%rax)
movq 0x38(%rsp), %rcx
movl 0x28(%rcx), %ecx
movl %ecx, 0x28(%rax)
movq 0x38(%rsp), %rcx
movl 0x2c(%rcx), %ecx
movl %ecx, 0x2c(%rax)
movq 0x38(%rsp), %rcx
movl 0x30(%rcx), %ecx
movl %ecx, 0x30(%rax)
movq 0x38(%rsp), %rcx
movl 0x34(%rcx), %ecx
movl %ecx, 0x34(%rax)
movl $0x8, %edi
callq 0x32a0
movq %rax, %rdi
movq %rdi, %rax
movq %rax, 0x8(%rsp)
movq 0x38(%rsp), %rax
movq 0x10(%rax), %rsi
callq 0x92d0
jmp 0x9215
movq 0x20(%rsp), %rax
movq 0x8(%rsp), %rcx
movq %rcx, 0x10(%rax)
addq $0x48, %rsp
retq
movq 0x8(%rsp), %rdi
movq %rax, %rcx
movl %edx, %eax
movq %rcx, 0x30(%rsp)
movl %eax, 0x2c(%rsp)
movl $0x8, %esi
callq 0x32b0
movq 0x30(%rsp), %rdi
callq 0x3430
nop