LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O3/Infinidat[P]slimfastq/xfile.cpp
// Function: XFileLoad::get_str(unsigned char*)
UCHAR* XFileLoad::get_str(UCHAR* p) {
    size_t len = get();
    for (UINT32 j = 0; j < len; j++)
        p[j] = ranger_str.get(&rcoder);
    return p + len;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
callq 0xa58c
movq %rax, %r15
testq %rax, %rax
je 0xa65c
leaq 0x2a9a(%r14), %r12
addq $0x10, %r14
movl $0x1, %ebp
xorl %r13d, %r13d
movq %r12, %rdi
movq %r14, %rsi
callq 0x406a
movb %al, (%rbx,%r13)
movl %ebp, %r13d
incl %ebp
cmpq %r13, %r15
ja 0xa643
addq %r15, %rbx
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/aalto-speech[P]ftk/src/substrings.cc
// Function: write_substrings(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, std::vector<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, float>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, float>>>&)
void write_substrings(const string &outfname,
                      vector<pair<string, float> > &sorted_substrs)
{
    ofstream outfile(outfname);
    if (!outfile) {
        cerr << "Something went wrong opening the output file." << endl;
        exit(1);
    }

    for (auto it = sorted_substrs.cbegin(); it != sorted_substrs.cend(); ++it)
        outfile << it->second << "\t" << it->first << endl;

    outfile.close();
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x208, %rsp            # imm = 0x208
movq %rsi, %rbx
movq %rdi, %rsi
leaq -0x228(%rbp), %r14
movq %r14, %rdi
movl $0x10, %edx
callq 0x46b0
movq (%r14), %rax
movq -0x18(%rax), %rax
testb $0x5, -0x208(%rbp,%rax)
jne 0x566d
movq (%rbx), %r13
cmpq 0x8(%rbx), %r13
je 0x5619
leaq 0x22f45(%rip), %r15     # 0x284f6
xorps %xmm0, %xmm0
cvtss2sd 0x20(%r13), %xmm0
movq %r14, %rdi
callq 0x4590
movq %rax, %r12
movl $0x1, %edx
movq %rax, %rdi
movq %r15, %rsi
callq 0x4400
movq (%r13), %rsi
movq 0x8(%r13), %rdx
movq %r12, %rdi
callq 0x4400
movq %rax, %r12
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r12, %rdi
movl $0xa, %esi
callq 0x4370
movsbl %al, %esi
movq %r12, %rdi
callq 0x4030
movq %rax, %rdi
callq 0x4260
addq $0x28, %r13
cmpq 0x8(%rbx), %r13
jne 0x55b1
leaq -0x228(%rbp), %rdi
callq 0x44c0
movq 0x30984(%rip), %rax     # 0x35fb0
movq (%rax), %rcx
movq 0x18(%rax), %rax
leaq -0x220(%rbp), %rdi
movq %rcx, -0x8(%rdi)
movq -0x18(%rcx), %rcx
movq %rax, -0x228(%rbp,%rcx)
callq 0x4310
leaq -0x130(%rbp), %rdi
callq 0x4110
addq $0x208, %rsp            # imm = 0x208
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq 0x30974(%rip), %rdi     # 0x35fe8
leaq 0x229d2(%rip), %rsi     # 0x2804d
movl $0x2d, %edx
callq 0x4400
movq 0x3095c(%rip), %rdi     # 0x35fe8
callq 0x4180
movl $0x1, %edi
callq 0x4420
jmp 0x569d
movq %rax, %rbx
leaq -0x228(%rbp), %rdi
callq 0x4510
movq %rbx, %rdi
callq 0x4640
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/interval_tree.cpp
// Function: IntervalTree::getSortedEndPointsX(std::vector<Line*, std::allocator<Line*>>)
vector<int> IntervalTree::getSortedEndPointsX(vector<Line*> lines) {
	vector<int> endpoints;
	int i;
	for (i=0; i<lines.size(); i++) {
		endpoints.push_back(lines[i]->x1);
		endpoints.push_back(lines[i]->x2);
	}
	sort (endpoints.begin(), endpoints.end(), myfunction);
	return endpoints;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
movq (%rdx), %rax
cmpq %rax, 0x8(%rdx)
je 0x1478
movq %rdx, %r14
xorl %r15d, %r15d
movq (%rax,%r15,8), %rdx
movq 0x8(%rbx), %rsi
movq 0x10(%rbx), %rcx
cmpq %rcx, %rsi
je 0x13e5
movl (%rdx), %edx
movl %edx, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rbx)
jmp 0x13f8
movq %rbx, %rdi
callq 0x2084
movq (%r14), %rax
movq 0x8(%rbx), %rsi
movq 0x10(%rbx), %rcx
movq (%rax,%r15,8), %rdx
addq $0x4, %rdx
cmpq %rcx, %rsi
je 0x1413
movl (%rdx), %ecx
movl %ecx, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rbx)
jmp 0x141e
movq %rbx, %rdi
callq 0x2084
movq (%r14), %rax
incq %r15
movq 0x8(%r14), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %r15, %rcx
ja 0x13c6
movq (%rbx), %r14
movq 0x8(%rbx), %r15
cmpq %r15, %r14
je 0x1478
movq %r15, %rax
subq %r14, %rax
sarq $0x2, %rax
bsrq %rax, %rdx
xorl $0x3f, %edx
addl %edx, %edx
xorq $0x7e, %rdx
leaq -0xcf(%rip), %rcx       # 0x138c
movq %r14, %rdi
movq %r15, %rsi
callq 0x22f6
leaq -0xe1(%rip), %rdx       # 0x138c
movq %r14, %rdi
movq %r15, %rsi
callq 0x241f
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
jmp 0x1488
movq %rax, %r14
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x1498
callq 0x10d0
movq %r14, %rdi
callq 0x1170
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/interval_tree.cpp
// Function: IntervalTree::getSortedEndPointsY(std::vector<Line*, std::allocator<Line*>>)
vector<int> IntervalTree::getSortedEndPointsY(vector<Line*> lines) {
	vector<int> endpoints;
	int i;
	for (i=0; i<lines.size(); i++) {
		endpoints.push_back(lines[i]->y1);
		endpoints.push_back(lines[i]->y2);
	}
	sort (endpoints.begin(), endpoints.end(), myfunction);
	return endpoints;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, (%rdi)
movq $0x0, 0x10(%rdi)
movq (%rdx), %rax
cmpq %rax, 0x8(%rdx)
je 0x1584
movq %rdx, %r14
xorl %r15d, %r15d
movq (%rax,%r15,8), %rdx
addq $0x8, %rdx
movq 0x8(%rbx), %rsi
movq 0x10(%rbx), %rcx
cmpq %rcx, %rsi
je 0x14f1
movl (%rdx), %edx
movl %edx, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rbx)
jmp 0x1504
movq %rbx, %rdi
callq 0x2084
movq (%r14), %rax
movq 0x8(%rbx), %rsi
movq 0x10(%rbx), %rcx
movq (%rax,%r15,8), %rdx
addq $0xc, %rdx
cmpq %rcx, %rsi
je 0x151f
movl (%rdx), %ecx
movl %ecx, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rbx)
jmp 0x152a
movq %rbx, %rdi
callq 0x2084
movq (%r14), %rax
incq %r15
movq 0x8(%r14), %rcx
subq %rax, %rcx
sarq $0x3, %rcx
cmpq %r15, %rcx
ja 0x14ce
movq (%rbx), %r14
movq 0x8(%rbx), %r15
cmpq %r15, %r14
je 0x1584
movq %r15, %rax
subq %r14, %rax
sarq $0x2, %rax
bsrq %rax, %rdx
xorl $0x3f, %edx
addl %edx, %edx
xorq $0x7e, %rdx
leaq -0x1db(%rip), %rcx      # 0x138c
movq %r14, %rdi
movq %r15, %rsi
callq 0x22f6
leaq -0x1ed(%rip), %rdx      # 0x138c
movq %r14, %rdi
movq %r15, %rsi
callq 0x241f
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
jmp 0x1594
movq %rax, %r14
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x15a4
callq 0x10d0
movq %r14, %rdi
callq 0x1170
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/interval_tree.cpp
// Function: IntervalTree::preorder(IntervalNode*)
void IntervalTree::preorder(IntervalNode *r)
{
	int i;
        if (r != NULL)
        {
	       	cout<< " [[[ ";
		for (i=0; i<r->I_mid.size(); i++)
			cout << " {" << r->I_mid[i]->y1 << "  " << r->I_mid[i]->y2 << "} " ;
		cout << " ]]] ";
		if (r->rangetree != NULL)
			r->rangetree->preorder();
                preorder(r->left);
                preorder(r->right);
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, -0x30(%rbp)
testq %rsi, %rsi
je 0x16d6
movq %rsi, %rbx
movq 0x69f9(%rip), %r15      # 0x7fd8
leaq 0x3a24(%rip), %r12      # 0x500a
leaq 0x3a68(%rip), %r14      # 0x5055
movl $0x5, %edx
movq %r15, %rdi
leaq 0x3a08(%rip), %rsi      # 0x5004
callq 0x1110
movq 0x10(%rbx), %rax
cmpq 0x8(%rbx), %rax
je 0x169a
xorl %r13d, %r13d
movl $0x2, %edx
movq %r15, %rdi
movq %r12, %rsi
callq 0x1110
movq 0x8(%rbx), %rax
movq (%rax,%r13,8), %rax
movl 0x8(%rax), %esi
movq %r15, %rdi
callq 0x1160
movq %r14, %r15
movq %r12, %r14
movq %rax, %r12
movl $0x2, %edx
movq %rax, %rdi
leaq 0x39c0(%rip), %rsi      # 0x500d
callq 0x1110
movq 0x8(%rbx), %rax
movq (%rax,%r13,8), %rax
movl 0xc(%rax), %esi
movq %r12, %rdi
movq %r14, %r12
movq %r15, %r14
movq 0x696b(%rip), %r15      # 0x7fd8
callq 0x1160
movl $0x2, %edx
movq %rax, %rdi
movq %r14, %rsi
callq 0x1110
incq %r13
movq 0x10(%rbx), %rax
subq 0x8(%rbx), %rax
sarq $0x3, %rax
cmpq %r13, %rax
ja 0x1612
movl $0x5, %edx
movq %r15, %rdi
leaq 0x3967(%rip), %rsi      # 0x5010
callq 0x1110
movq 0x30(%rbx), %rdi
testq %rdi, %rdi
je 0x16bc
callq 0x2c28
movq 0x20(%rbx), %rsi
movq -0x30(%rbp), %rdi
callq 0x15ba
movq 0x28(%rbx), %rbx
testq %rbx, %rbx
jne 0x15ed
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/interval_tree.cpp
// Function: IntervalTree::queryX(int, int, int, int, int, IntervalNode*)
void IntervalTree::queryX(int maxX, int minX, int x, int y1, int y2, IntervalNode* node) {
	if (x < node->x_mid) {
		node->rangetree->twodquery(minX, x, y1, y2);
		if (node->left != NULL)
			queryX(maxX, minX, x, y1, y2, node->left);
	}
	else if (x > node->x_mid) {
		node->rangetree->twodquery(x, maxX, y1, y2);
		if (node->right != NULL)
			queryX(maxX, minX, x, y1, y2, node->right);
	}
	else {
		node->rangetree->twodquery(x, x, y1, y2);
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %r9d, %ebx
movl %r8d, %r14d
movl %ecx, %r15d
movl %edx, %r12d
movl %esi, -0x2c(%rbp)
movq 0x10(%rbp), %r13
cmpl %r15d, (%r13)
jle 0x1e24
movq 0x30(%r13), %rdi
movl %r12d, %esi
movl %r15d, %edx
movl %r14d, %ecx
movl %ebx, %r8d
callq 0x380a
movq 0x20(%r13), %r13
jmp 0x1e3f
movq 0x30(%r13), %rdi
movl %r15d, %esi
jge 0x1e53
movl -0x2c(%rbp), %edx
movl %r14d, %ecx
movl %ebx, %r8d
callq 0x380a
movq 0x28(%r13), %r13
testq %r13, %r13
jne 0x1e03
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %r15d, %edx
movl %r14d, %ecx
movl %ebx, %r8d
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x380a
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/interval_tree.cpp
// Function: IntervalTree::queryY(int, int, int, int, int, IntervalNode*)
void IntervalTree::queryY(int maxY, int minY, int y, int x1, int x2, IntervalNode* node) {
	if (y < node->x_mid) {
		node->rangetree->twodquery(x1, x2, minY, y);
		if (node->left != NULL)
			queryY(maxY, minY, y, x1, x2, node->left);
	}
	else if (y > node->x_mid) {
		node->rangetree->twodquery(x1, x2, y, maxY);
		if (node->right != NULL)
			queryY(maxY, minY, y, x1, x2, node->right);
	}
	else {
		node->rangetree->twodquery(x1, x2, y, y);
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %r9d, %r14d
movl %r8d, %r15d
movl %ecx, %ebx
movl %edx, %r12d
movl %esi, -0x2c(%rbp)
movq 0x10(%rbp), %r13
cmpl %ebx, (%r13)
jle 0x1ed1
movq 0x30(%r13), %rdi
movl %r15d, %esi
movl %r14d, %edx
movl %r12d, %ecx
movl %ebx, %r8d
callq 0x380a
movq 0x20(%r13), %r13
jmp 0x1eec
movq 0x30(%r13), %rdi
jge 0x1f00
movl %r15d, %esi
movl %r14d, %edx
movl %ebx, %ecx
movl -0x2c(%rbp), %r8d
callq 0x380a
movq 0x28(%r13), %r13
testq %r13, %r13
jne 0x1eb0
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %r15d, %esi
movl %r14d, %edx
movl %ebx, %ecx
movl %ebx, %r8d
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x380a
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::countNodes(BinaryRangeNode*)
int BinaryRangeTree::countNodes(BinaryRangeNode *r)
 {
     if (r == NULL)
         return 0;
     else
     {
         int l = 1;
         l += countNodes(r->left);
         l += countNodes(r->right);
         return l;
     }
 }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
testq %rsi, %rsi
je 0x2aca
movq %rsi, %r14
movq %rdi, %r15
xorl %ebx, %ebx
movq 0x20(%r14), %rsi
movq %r15, %rdi
callq 0x2a98
movq 0x28(%r14), %r14
addl %eax, %ebx
incl %ebx
testq %r14, %r14
jne 0x2aaf
jmp 0x2acc
xorl %ebx, %ebx
movl %ebx, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::search(BinaryRangeNode*, int)
bool BinaryRangeTree::search(BinaryRangeNode *r, int val)
 {
     bool found = false;
     while ((r != NULL) && !found)
     {
         int rval = r->data;
         if (val < rval)
             r = r->left;
         else if (val > rval)
             r = r->right;
         else
         {
             found = true;
             break;
         }
         found = search(r, val);
     }
     return found;
 }

// Assembly:
testq %rsi, %rsi
je 0x2b2f
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movl %edx, %ebx
movq %rsi, %r14
movq %rdi, %r15
movl $0x20, %eax
cmpl %ebx, 0x4(%r14)
jg 0x2b13
movl $0x28, %eax
jge 0x2b32
movq (%r14,%rax), %r14
movq %r15, %rdi
movq %r14, %rsi
movl %ebx, %edx
callq 0x2aea
testq %r14, %r14
je 0x2b34
testb %al, %al
je 0x2b01
jmp 0x2b34
xorl %eax, %eax
retq
movb $0x1, %al
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::inorder(BinaryRangeNode*)
void BinaryRangeTree::inorder(BinaryRangeNode *r)
 {
	int i;
     if (r != NULL)
     {
         inorder(r->left);
         cout<< " { " << r->data<<" : ";
		for (i=0; i<r->data2.size(); i++)
			cout << r->data2[i] << "  ";
	cout << "} ";
         inorder(r->right);
     }
 }

// Assembly:
testq %rsi, %rsi
je 0x2c27
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq 0x5466(%rip), %r15      # 0x7fd8
leaq 0x2494(%rip), %r13      # 0x500d
movq 0x20(%rbx), %rsi
movq %r14, %rdi
callq 0x2b4e
movl $0x3, %edx
movq %r15, %rdi
leaq 0x249c(%rip), %rsi      # 0x5030
callq 0x1110
movl 0x4(%rbx), %esi
movq %r15, %rdi
callq 0x1160
movl $0x3, %edx
movq %rax, %rdi
leaq 0x2481(%rip), %rsi      # 0x5034
callq 0x1110
movq 0x8(%rbx), %rax
cmpq %rax, 0x10(%rbx)
je 0x2bf8
xorl %r12d, %r12d
movl (%rax,%r12,4), %esi
movq %r15, %rdi
callq 0x1160
movl $0x2, %edx
movq %rax, %rdi
movq %r13, %rsi
callq 0x1110
incq %r12
movq 0x8(%rbx), %rax
movq 0x10(%rbx), %rcx
subq %rax, %rcx
sarq $0x2, %rcx
cmpq %r12, %rcx
ja 0x2bc5
movl $0x2, %edx
movq %r15, %rdi
leaq 0x244e(%rip), %rsi      # 0x5055
callq 0x1110
movq 0x28(%rbx), %rbx
testq %rbx, %rbx
jne 0x2b79
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::preorder(BinaryRangeNode*)
void BinaryRangeTree::preorder(BinaryRangeNode *r)
 {
	int i;
     if (r != NULL)
     {
	for (i=0; i<r->lines.size(); i++) {
			if (r->lines[i]->reported != 1)	{
				cout << " OP1 { (" << r->lines[i]->x1 << " " << r->lines[i]->y1 << ") -- (" << r->lines[i]->x2 << " " << r->lines[i]->y2 << ") } " << endl;
			}
	}
         preorder(r->left);
         preorder(r->right);
     }
 }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, -0x30(%rbp)
testq %rsi, %rsi
je 0x2de4
movq %rsi, %rbx
movq 0x532f(%rip), %r15      # 0x7fd8
leaq 0x235e(%rip), %r13      # 0x500e
movq 0x38(%rbx), %rax
movq 0x40(%rbx), %rcx
cmpq %rax, %rcx
je 0x2dca
xorl %r12d, %r12d
movq (%rax,%r12,8), %rdx
cmpb $0x0, 0x10(%rdx)
jne 0x2db4
movl $0x8, %edx
movq %r15, %rdi
leaq 0x2362(%rip), %rsi      # 0x5043
callq 0x1110
movq 0x38(%rbx), %rax
movq (%rax,%r12,8), %rax
movl (%rax), %esi
movq %r15, %rdi
callq 0x1160
movq %rax, %r14
movl $0x1, %edx
movq %rax, %rdi
movq %r13, %rsi
callq 0x1110
movq 0x38(%rbx), %rax
movq (%rax,%r12,8), %rax
movl 0x8(%rax), %esi
movq %r14, %rdi
callq 0x1160
movq %rax, %r14
movl $0x6, %edx
movq %rax, %rdi
leaq 0x231c(%rip), %rsi      # 0x504c
callq 0x1110
movq 0x38(%rbx), %rax
movq (%rax,%r12,8), %rax
movl 0x4(%rax), %esi
movq %r14, %rdi
callq 0x1160
movq %rax, %r14
movl $0x1, %edx
movq %rax, %rdi
movq %r13, %rsi
callq 0x1110
movq 0x38(%rbx), %rax
movq (%rax,%r12,8), %rax
movl 0xc(%rax), %esi
movq %r14, %rdi
callq 0x1160
movq %rax, %r14
movl $0x4, %edx
movq %rax, %rdi
leaq 0x22d3(%rip), %rsi      # 0x5053
callq 0x1110
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x10e0
movsbl %al, %esi
movq %r14, %rdi
callq 0x1030
movq %rax, %rdi
callq 0x10a0
movq 0x38(%rbx), %rax
movq 0x40(%rbx), %rcx
incq %r12
movq %rcx, %rdx
subq %rax, %rdx
sarq $0x3, %rdx
cmpq %r12, %rdx
ja 0x2cc4
movq 0x20(%rbx), %rsi
movq -0x30(%rbp), %rdi
callq 0x2c84
movq 0x28(%rbx), %rbx
testq %rbx, %rbx
jne 0x2cb0
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::postorder(BinaryRangeNode*)
void BinaryRangeTree::postorder(BinaryRangeNode *r)
 {
	int i;
     if (r != NULL)
     {
         postorder(r->left);
         postorder(r->right);
         cout<< " { " << r->data<<" : ";
		for (i=0; i<r->data2.size(); i++)
			cout << r->data2[i] << "  ";
	cout << "} ";
     }
 }

// Assembly:
testq %rsi, %rsi
je 0x2ed9
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movq 0x20(%rsi), %rsi
callq 0x2e02
movq 0x28(%rbx), %rsi
movq %r14, %rdi
callq 0x2e02
movq 0x51a0(%rip), %r14      # 0x7fd8
leaq 0x21f1(%rip), %rsi      # 0x5030
movl $0x3, %edx
movq %r14, %rdi
callq 0x1110
movl 0x4(%rbx), %esi
movq %r14, %rdi
callq 0x1160
leaq 0x21d6(%rip), %rsi      # 0x5034
movl $0x3, %edx
movq %rax, %rdi
callq 0x1110
movq 0x8(%rbx), %rax
cmpq %rax, 0x10(%rbx)
je 0x2eb9
xorl %r12d, %r12d
movq 0x5159(%rip), %r14      # 0x7fd8
leaq 0x2187(%rip), %r15      # 0x500d
movl (%rax,%r12,4), %esi
movq %r14, %rdi
callq 0x1160
movl $0x2, %edx
movq %rax, %rdi
movq %r15, %rsi
callq 0x1110
incq %r12
movq 0x8(%rbx), %rax
movq 0x10(%rbx), %rcx
subq %rax, %rcx
sarq $0x2, %rcx
cmpq %r12, %rcx
ja 0x2e86
movq 0x5118(%rip), %rdi      # 0x7fd8
leaq 0x218e(%rip), %rsi      # 0x5055
movl $0x2, %edx
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x1110
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::buildytrees(BinaryRangeNode*)
void BinaryRangeTree::buildytrees(BinaryRangeNode *r) {
	if (r != NULL) {
		BinaryRangeTree* temp_tree = new BinaryRangeTree();
		buildytrees(r, temp_tree);
		r->ytree = temp_tree;
		buildytrees(r->left);	
		buildytrees(r->right);	
	}
}

// Assembly:
testq %rsi, %rsi
je 0x2f42
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movl $0x8, %edi
callq 0x10f0
movq %rax, %r15
movq $0x0, (%rax)
movq %r14, %rdi
movq %rbx, %rsi
movq %rax, %rdx
callq 0x2f44
movq %r15, 0x30(%rbx)
movq 0x20(%rbx), %rsi
movq %r14, %rdi
callq 0x2ee8
movq 0x28(%rbx), %rbx
testq %rbx, %rbx
jne 0x2efd
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::buildytrees(BinaryRangeNode*, BinaryRangeTree*)
void BinaryRangeTree::buildytrees(BinaryRangeNode *r, BinaryRangeTree* temp_tree) {
	int i;
	if (r != NULL)
             {
		for (i=0; i<r->data2.size(); i++)
			 temp_tree->insert(r->data2[i], r->data, r->lines[i]);
                 buildytrees(r->left, temp_tree);
                 buildytrees(r->right, temp_tree);
             }
	
}

// Assembly:
testq %rsi, %rsi
je 0x2fc2
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq 0x8(%r14), %rcx
cmpq %rcx, 0x10(%r14)
je 0x2fa2
movq (%rbx), %rax
xorl %r12d, %r12d
movl (%rcx,%r12,4), %esi
movl 0x4(%r14), %edx
movq 0x38(%r14), %rcx
movq (%rcx,%r12,8), %r8
movq %rbx, %rdi
movq %rax, %rcx
callq 0x27da
movq %rax, (%rbx)
incq %r12
movq 0x8(%r14), %rcx
movq 0x10(%r14), %rdx
subq %rcx, %rdx
sarq $0x2, %rdx
cmpq %r12, %rdx
ja 0x2f6d
movq 0x20(%r14), %rsi
movq %r15, %rdi
movq %rbx, %rdx
callq 0x2f44
movq 0x28(%r14), %r14
testq %r14, %r14
jne 0x2f5d
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::findSplitNode(BinaryRangeNode*, int, int)
BinaryRangeNode* BinaryRangeTree::findSplitNode(BinaryRangeNode* tree, int x1, int x2) {
	BinaryRangeNode *r = root;
	while (!isLeaf(r) & (r->data > x2 || r->data < x1)) {
		if  (r->data >= x1)
			r = r->left;
		else
			r = r->right;
	}
	return r;
}

// Assembly:
movq (%rdi), %rax
testq %rax, %rax
je 0x3070
pushq %rbp
movq %rsp, %rbp
movq 0x20(%rax), %r9
movl 0x4(%rax), %esi
cmpl %ecx, %esi
setle %dil
cmpl %edx, %esi
setge %r8b
orq 0x28(%rax), %r9
je 0x306e
andb %r8b, %dil
jne 0x306e
xorl %edi, %edi
cmpl %edx, %esi
setl %dil
movq 0x20(%rax,%rdi,8), %rax
testq %rax, %rax
jne 0x303c
xorl %eax, %eax
popq %rbp
retq
xorl %eax, %eax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::findSplitNodeYtree(BinaryRangeNode*, int, int)
bool BinaryRangeTree::isLeaf(BinaryRangeNode* r) {
	if (r == NULL)
		return 1;
	if (r->left == NULL & r->right == NULL)
		return 1;
	return 0;
}

// Assembly:
testq %rsi, %rsi
je 0x30f1
pushq %rbp
movq %rsp, %rbp
pushq %r14
pushq %rbx
movq %rsi, %rax
movq 0x20(%rax), %rsi
testq %rsi, %rsi
sete %dil
movq 0x28(%rax), %r8
testq %r8, %r8
sete %r9b
movl 0x4(%rax), %r10d
cmpl %ecx, %r10d
setle %r11b
cmpl %edx, %r10d
setge %bl
movq %rsi, %r14
orq %r8, %r14
je 0x30ec
andb %bl, %r11b
jne 0x30ec
cmpl %edx, %r10d
jge 0x30e1
movq %r8, %rax
testb $0x1, %r9b
je 0x309d
jmp 0x30ea
movq %rsi, %rax
testb $0x1, %dil
je 0x309d
xorl %eax, %eax
popq %rbx
popq %r14
popq %rbp
retq
xorl %eax, %eax
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::onedquery(int, int)
void BinaryRangeTree::onedquery(int x1, int x2) {
	BinaryRangeNode* splitnode = findSplitNode(root, x1, x2);
	BinaryRangeNode* v;
	int i;
	if ((splitnode->data >= x1) & (splitnode->data <= x2)) {
		reportPoint(splitnode);
	}
	if (!isLeaf(splitnode)) {
		// go to left
		v = splitnode->left;
		while (!isLeaf(v)) { // is not a leaf
			if (x1 <= v->data) {
				reportPoint(v); //report the point itself
				reportSubtree(v->right);
				v = v->left;
			}
			else
				v = v->right;
		}
		if (v != NULL) {
			if ((v->data >= x1) & (v->data <= x2))
				reportPoint(v);	// Report the point itself
		}

		// go to right
		v = splitnode->right;
		while (!isLeaf(v)) { // is not a leaf
			if (x2 >= v->data) {
				reportPoint(v);
				reportSubtree(v->left);
				v = v->right;
			}
			else
				v = v->left;
		}
		if (v != NULL) {
			if ((v->data >= x1) & (v->data <= x2))
				reportPoint(v);
		}
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %edx, %ebx
movl %esi, %r14d
movq %rdi, -0x30(%rbp)
movq (%rdi), %r12
testq %r12, %r12
je 0x3400
movq 0x20(%r12), %rsi
movl 0x4(%r12), %eax
cmpl %ebx, %eax
setle %cl
cmpl %r14d, %eax
setge %dl
orq 0x28(%r12), %rsi
je 0x3403
andb %dl, %cl
jne 0x3403
xorl %ecx, %ecx
cmpl %r14d, %eax
setl %cl
movq 0x20(%r12,%rcx,8), %r12
jmp 0x33cc
xorl %r12d, %r12d
movl 0x4(%r12), %eax
cmpl %r14d, %eax
setl %cl
cmpl %ebx, %eax
setg %al
orb %cl, %al
jne 0x341f
movq %r12, %rsi
callq 0x3106
movq 0x20(%r12), %r15
movq 0x28(%r12), %r13
movq %r15, %rax
orq %r13, %rax
je 0x34fb
testq %r15, %r15
je 0x3494
movq 0x28(%r15), %rax
movq 0x20(%r15), %rcx
orq %rax, %rcx
movl 0x4(%r15), %ecx
je 0x3478
cmpl %r14d, %ecx
jl 0x346e
movq %r15, %rsi
callq 0x3106
movq 0x28(%r15), %rsi
testq %rsi, %rsi
je 0x346a
movq -0x30(%rbp), %rdi
callq 0x2c84
movq 0x20(%r15), %rax
movq %rax, %r15
testq %rax, %rax
jne 0x343a
jmp 0x348f
cmpl %r14d, %ecx
setl %al
cmpl %ebx, %ecx
setg %cl
orb %al, %cl
jne 0x348f
movq %r15, %rsi
callq 0x3106
movq 0x28(%r12), %r13
testq %r13, %r13
je 0x34fb
movq 0x20(%r13), %rax
movq 0x28(%r13), %rcx
orq %rax, %rcx
movl 0x4(%r13), %ecx
je 0x34d6
cmpl %ebx, %ecx
jg 0x34cc
movq %r13, %rsi
callq 0x3106
movq 0x20(%r13), %rsi
testq %rsi, %rsi
je 0x34c8
movq -0x30(%rbp), %rdi
callq 0x2c84
movq 0x28(%r13), %rax
movq %rax, %r13
testq %rax, %rax
jne 0x3499
jmp 0x34fb
cmpl %r14d, %ecx
setl %al
cmpl %ebx, %ecx
setg %cl
orb %al, %cl
jne 0x34fb
movq %r13, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x3106
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::onedqueryYtree(BinaryRangeTree*, int, int)
void BinaryRangeTree::onedqueryYtree(BinaryRangeTree *r, int x1, int x2) {
	BinaryRangeNode* splitnode = findSplitNodeYtree(r->root, x1, x2);
	if (splitnode == NULL)
		return;
	BinaryRangeNode* v;
	if ((splitnode->data >= x1) & (splitnode->data <= x2))
			reportPointYtree(splitnode);			
	if (!isLeaf(splitnode)) {
		// go to left
		v = splitnode->left;
		while (!isLeaf(v)) { // is not a leaf
			if (x1 <= v->data) {
				reportPointYtree(v);
				reportSubtree(v->right);
				v = v->left;
			}
			else
				v = v->right;
		}
		if (v != NULL) {
			if ((v->data >= x1) & (v->data <= x2))
				reportPointYtree(v);
		}

		// go to right
		v = splitnode->right;
		while (!isLeaf(v)) { // is not a leaf
			if (x2 >= v->data) {
				reportPointYtree(v);	
				reportSubtree(v->left);
				v = v->right;
			}
			else
				v = v->left;
		}
		if (v != NULL) {
			if ((v->data >= x1) & (v->data <= x2))
				reportPointYtree(v);
		}
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq (%rsi), %r12
testq %r12, %r12
je 0x3675
movl %ecx, %ebx
movl %edx, %r14d
movq %rdi, %r15
movq 0x20(%r12), %r13
testq %r13, %r13
sete %dl
movq 0x28(%r12), %rax
testq %rax, %rax
sete %sil
movl 0x4(%r12), %ecx
cmpl %ebx, %ecx
setle %dil
cmpl %r14d, %ecx
setge %r8b
movq %r13, %r9
orq %rax, %r9
je 0x3582
andb %r8b, %dil
jne 0x3582
cmpl %r14d, %ecx
jge 0x3575
movq %rax, %r12
testb $0x1, %sil
je 0x352c
jmp 0x3675
movq %r13, %r12
testb $0x1, %dl
je 0x352c
jmp 0x3675
cmpl %r14d, %ecx
setl %dl
cmpl %ebx, %ecx
setg %cl
orb %dl, %cl
jne 0x35a3
movq %r12, %rsi
callq 0x3258
movq 0x20(%r12), %r13
movq 0x28(%r12), %rax
orq %r13, %rax
je 0x3675
testq %r13, %r13
je 0x3605
movq 0x28(%r13), %rax
movq 0x20(%r13), %rcx
orq %rax, %rcx
movl 0x4(%r13), %ecx
je 0x35ee
cmpl %r14d, %ecx
jl 0x35e4
movq %r13, %rsi
callq 0x3258
movq 0x28(%r13), %rsi
testq %rsi, %rsi
je 0x35e0
movq %r15, %rdi
callq 0x2c84
movq 0x20(%r13), %rax
movq %rax, %r13
testq %rax, %rax
jne 0x35b1
jmp 0x3605
cmpl %r14d, %ecx
setl %al
cmpl %ebx, %ecx
setg %cl
orb %al, %cl
jne 0x3605
movq %r13, %rsi
callq 0x3258
movq 0x28(%r12), %r12
testq %r12, %r12
je 0x3675
movq 0x20(%r12), %rax
movq 0x28(%r12), %rcx
orq %rax, %rcx
movl 0x4(%r12), %ecx
je 0x3650
cmpl %ebx, %ecx
jg 0x3646
movq %r12, %rsi
callq 0x3258
movq 0x20(%r12), %rsi
testq %rsi, %rsi
je 0x3641
movq %r15, %rdi
callq 0x2c84
movq 0x28(%r12), %rax
movq %rax, %r12
testq %rax, %rax
jne 0x360f
jmp 0x3675
cmpl %r14d, %ecx
setl %al
cmpl %ebx, %ecx
setg %cl
orb %al, %cl
jne 0x3675
movq %r12, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x3258
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::isPointInRange(BinaryRangeNode*, int, int, int, int)
void BinaryRangeTree::isPointInRange(BinaryRangeNode* r, int x1, int x2, int y1, int y2) {
	int i;
	if ((r->data >= x1) & (r->data <= x2)) { // in x range
		for (i=0; i< r->data2.size(); i++) {
			if  ((r->data2[i] >= y1) & (r->data2[i] <= y2) ) {
				if (r->lines[i]->reported != 1) {
					r->lines[i]->reported = 1;
					cout << " OP5 { (" << r->lines[i]->x1 << " " << r->lines[i]->y1 << ") -- (" << r->lines[i]->x2 << " " << r->lines[i]->y2 << ") } " << endl;
				}
			}
		}
	}
}

// Assembly:
movl 0x4(%rsi), %eax
cmpl %edx, %eax
setl %dl
cmpl %ecx, %eax
setg %al
orb %dl, %al
jne 0x3809
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r15
movq 0x8(%rsi), %rax
movq 0x10(%rsi), %rcx
cmpq %rax, %rcx
je 0x37fb
movl %r9d, %ebx
movl %r8d, %r14d
xorl %r13d, %r13d
movl (%rax,%r13,4), %edx
cmpl %r14d, %edx
setl %sil
cmpl %ebx, %edx
setg %dl
orb %sil, %dl
jne 0x37e5
movq 0x38(%r15), %rdx
movq (%rdx,%r13,8), %rdx
cmpb $0x0, 0x10(%rdx)
jne 0x37e5
movb $0x1, 0x10(%rdx)
movl $0x8, %edx
movq 0x48d9(%rip), %r12      # 0x7fd8
movq %r12, %rdi
leaq 0x1961(%rip), %rsi      # 0x506a
callq 0x1110
movq 0x38(%r15), %rax
movq (%rax,%r13,8), %rax
movl (%rax), %esi
movq %r12, %rdi
callq 0x1160
movq %rax, %r12
movl $0x1, %edx
movq %rax, %rdi
leaq 0x18dc(%rip), %rsi      # 0x500e
callq 0x1110
movq 0x38(%r15), %rax
movq (%rax,%r13,8), %rax
movl 0x8(%rax), %esi
movq %r12, %rdi
callq 0x1160
movq %rax, %r12
movl $0x6, %edx
movq %rax, %rdi
leaq 0x18f0(%rip), %rsi      # 0x504c
callq 0x1110
movq 0x38(%r15), %rax
movq (%rax,%r13,8), %rax
movl 0x4(%rax), %esi
movq %r12, %rdi
callq 0x1160
movq %rax, %r12
movl $0x1, %edx
movq %rax, %rdi
leaq 0x1888(%rip), %rsi      # 0x500e
callq 0x1110
movq 0x38(%r15), %rax
movq (%rax,%r13,8), %rax
movl 0xc(%rax), %esi
movq %r12, %rdi
callq 0x1160
movq %rax, %r12
movl $0x4, %edx
movq %rax, %rdi
leaq 0x18a3(%rip), %rsi      # 0x5053
callq 0x1110
movq (%r12), %rax
movq -0x18(%rax), %rdi
addq %r12, %rdi
movl $0xa, %esi
callq 0x10e0
movsbl %al, %esi
movq %r12, %rdi
callq 0x1030
movq %rax, %rdi
callq 0x10a0
movq 0x8(%r15), %rax
movq 0x10(%r15), %rcx
incq %r13
movq %rcx, %rdx
subq %rax, %rdx
sarq $0x2, %rdx
cmpq %r13, %rdx
ja 0x36c4
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::twodquery(int, int, int, int)
void BinaryRangeTree::twodquery(int x1, int x2, int y1, int y2) {
	BinaryRangeNode* splitnode = findSplitNode(root, x1, x2);
	BinaryRangeNode* v;
	int i;
	isPointInRange(splitnode, x1, x2, y1, y2);
	if (!isLeaf(splitnode)) {
		// go to left
		v = splitnode->left;
		while (!isLeaf(v)) { // is not a leaf
			if (x1 <= v->data) {
				isPointInRange(v, x1, x2, y1, y2); //report the point itself
				if (v->right != NULL )
					onedqueryYtree(v->right->ytree, y1, y2);
				v = v->left;
			}
			else
				v = v->right;
		}
		if (v != NULL) {
			isPointInRange(v, x1, x2, y1, y2); 
		}

		v = splitnode->right;
		while (!isLeaf(v)) { // is not a leaf
			if (x2 >= v->data) {
				isPointInRange(v, x1, x2, y1, y2); 
				if (v->left != NULL) {
					onedqueryYtree(v->left->ytree, y1, y2);
				}
				v = v->right;
			}
			else
				v = v->left;
		}
		if (v != NULL) {
			isPointInRange(v, x1, x2, y1, y2); 
		}
	}
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %r8d, %r9d
movl %ecx, %r8d
movl %edx, %r15d
movl %esi, %r12d
movq %rdi, -0x38(%rbp)
movq (%rdi), %r13
testq %r13, %r13
je 0x3860
movq 0x20(%r13), %rsi
movl 0x4(%r13), %eax
cmpl %r15d, %eax
setle %cl
cmpl %r12d, %eax
setge %dl
orq 0x28(%r13), %rsi
je 0x387b
andb %dl, %cl
jne 0x387b
xorl %ecx, %ecx
cmpl %r12d, %eax
setl %cl
movq 0x20(%r13,%rcx,8), %r13
jmp 0x382e
xorl %esi, %esi
movl %r12d, %edx
movl %r15d, %ecx
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x3684
movq %r13, %rsi
movl %r12d, %edx
movl %r15d, %ecx
movl %r8d, -0x2c(%rbp)
movl %r9d, -0x30(%rbp)
callq 0x3684
movq 0x20(%r13), %r14
movq 0x28(%r13), %rbx
movq %r14, %rax
orq %rbx, %rax
je 0x3973
testq %r14, %r14
je 0x3917
movl -0x30(%rbp), %ebx
movq 0x28(%r14), %rax
movq 0x20(%r14), %rcx
orq %rax, %rcx
je 0x38fe
cmpl %r12d, 0x4(%r14)
jl 0x38f4
movq %r14, %rsi
movl %r12d, %edx
movl %r15d, %ecx
movl -0x2c(%rbp), %r8d
movl %ebx, %r9d
callq 0x3684
movq 0x28(%r14), %rax
testq %rax, %rax
je 0x38f0
movq 0x30(%rax), %rsi
movq -0x38(%rbp), %rdi
movl -0x2c(%rbp), %edx
movl %ebx, %ecx
callq 0x350a
movq 0x20(%r14), %rax
movq %rax, %r14
testq %rax, %rax
jne 0x38ad
jmp 0x3913
movq %r14, %rsi
movl %r12d, %edx
movl %r15d, %ecx
movl -0x2c(%rbp), %r8d
movl %ebx, %r9d
callq 0x3684
movq 0x28(%r13), %rbx
testq %rbx, %rbx
je 0x3973
movl -0x2c(%rbp), %r13d
movl -0x30(%rbp), %r14d
movq 0x20(%rbx), %rax
movq 0x28(%rbx), %rcx
orq %rax, %rcx
je 0x3982
cmpl %r15d, 0x4(%rbx)
jg 0x396b
movq %rbx, %rsi
movl %r12d, %edx
movl %r15d, %ecx
movl %r13d, %r8d
movl %r14d, %r9d
callq 0x3684
movq 0x20(%rbx), %rax
testq %rax, %rax
je 0x3967
movq 0x30(%rax), %rsi
movq -0x38(%rbp), %rdi
movl %r13d, %edx
movl %r14d, %ecx
callq 0x350a
movq 0x28(%rbx), %rax
movq %rax, %rbx
testq %rax, %rax
jne 0x3924
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rbx, %rsi
movl %r12d, %edx
movl %r15d, %ecx
movl -0x2c(%rbp), %r8d
movl -0x30(%rbp), %r9d
jmp 0x3868
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::buildRangeTree(std::vector<Line, std::allocator<Line>>, BinaryRangeTree*)
BinaryRangeTree* BinaryRangeTree::buildRangeTree(vector<Line> lines, BinaryRangeTree* sbbst) {
	int i;
	for (i=0; i < lines.size() ; i++) {
		sbbst->insert(lines[i].x1, lines[i].y1, &lines[i]);
		sbbst->insert(lines[i].x2, lines[i].y2, &lines[i]);
	}
	sbbst->buildytrees();
	cout << "\n query " << endl;
	sbbst->twodquery(0, 4, 0, 4);
	return sbbst;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq (%rsi), %rcx
movq (%rdx), %rax
cmpq %rcx, 0x8(%rsi)
je 0x3a20
movq %rsi, %r14
xorl %r15d, %r15d
movabsq $-0x3333333333333333, %r12 # imm = 0xCCCCCCCCCCCCCCCD
xorl %r13d, %r13d
leaq (%rcx,%r15), %r8
movl (%rcx,%r15), %esi
movl 0x8(%rcx,%r15), %edx
movq %rbx, %rdi
movq %rax, %rcx
callq 0x27da
movq %rax, (%rbx)
movq (%r14), %rcx
leaq (%rcx,%r15), %r8
movl 0x4(%rcx,%r15), %esi
movl 0xc(%rcx,%r15), %edx
movq %rbx, %rdi
movq %rax, %rcx
callq 0x27da
movq %rax, (%rbx)
incq %r13
movq (%r14), %rcx
movq 0x8(%r14), %rdx
subq %rcx, %rdx
sarq $0x2, %rdx
imulq %r12, %rdx
addq $0x14, %r15
cmpq %r13, %rdx
ja 0x39c8
movq %rbx, %rdi
movq %rax, %rsi
callq 0x2ee8
movq 0x45a6(%rip), %r14      # 0x7fd8
leaq 0x163a(%rip), %rsi      # 0x5073
movl $0x8, %edx
movq %r14, %rdi
callq 0x1110
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x10e0
movsbl %al, %esi
movq %r14, %rdi
callq 0x1030
movq %rax, %rdi
callq 0x10a0
movq %rbx, %rdi
xorl %esi, %esi
movl $0x4, %edx
xorl %ecx, %ecx
movl $0x4, %r8d
callq 0x380a
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/binaryRangeTree.cpp
// Function: BinaryRangeTree::buildRangeTreeEndPoints(BinaryRangeTree*, std::vector<Line*, std::allocator<Line*>>)
BinaryRangeTree* BinaryRangeTree::buildRangeTreeEndPoints(BinaryRangeTree *sbbst, vector<Line*> lines) {
	int i;
	for (i=0; i < lines.size() ; i++) {
		sbbst->insert(lines[i]->x1, lines[i]->y1, lines[i]);
		sbbst->insert(lines[i]->x2, lines[i]->y2, lines[i]);
	}
	sbbst->buildytrees();
	return sbbst;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq (%rdx), %rcx
movq (%rsi), %rax
cmpq %rcx, 0x8(%rdx)
je 0x3b01
movq %rdx, %r14
xorl %r15d, %r15d
movq (%rcx,%r15,8), %r8
movl (%r8), %esi
movl 0x8(%r8), %edx
movq %rbx, %rdi
movq %rax, %rcx
callq 0x27da
movq %rax, (%rbx)
movq (%r14), %rcx
movq (%rcx,%r15,8), %r8
movl 0x4(%r8), %esi
movl 0xc(%r8), %edx
movq %rbx, %rdi
movq %rax, %rcx
callq 0x27da
movq %rax, (%rbx)
incq %r15
movq (%r14), %rcx
movq 0x8(%r14), %rdx
subq %rcx, %rdx
sarq $0x3, %rdx
cmpq %r15, %rdx
ja 0x3ab5
movq %rbx, %rdi
movq %rax, %rsi
callq 0x2ee8
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/meghanamreddy[P]Range-trees-and-Interval-Trees/./binaryRangeTree.h
// Function: BinaryRangeNode::BinaryRangeNode(int, int, Line*)
BinaryRangeNode(int n, int m, Line *l)
         {
             left = NULL;
             right = NULL;
             data = n;
			 ytree = NULL;
			 data2.push_back(m);
             height = 0;
			 lines.push_back(l);
         }

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rcx, %r15
movq %rdi, %r12
leaq -0x2c(%rbp), %rax
movl %edx, (%rax)
movq %rcx, -0x28(%rbp)
leaq 0x8(%rdi), %rbx
leaq 0x38(%rdi), %r14
xorps %xmm0, %xmm0
movups %xmm0, 0x38(%rdi)
movq $0x0, 0x48(%rdi)
movups %xmm0, 0x8(%rdi)
movups %xmm0, 0x18(%rdi)
movups %xmm0, 0x28(%rdi)
movl %esi, 0x4(%rdi)
movq %rbx, %rdi
xorl %esi, %esi
movq %rax, %rdx
callq 0x2084
movq 0x40(%r12), %rsi
movl $0x0, (%r12)
cmpq 0x48(%r12), %rsi
je 0x3c0f
movq %r15, (%rsi)
addq $0x8, 0x40(%r12)
jmp 0x3c1b
leaq -0x28(%rbp), %rdx
movq %r14, %rdi
callq 0x21bc
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r15
movq (%r14), %rdi
testq %rdi, %rdi
je 0x3c38
callq 0x10d0
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x3c45
callq 0x10d0
movq %r15, %rdi
callq 0x1170
nopl (%rax)
// File: /workspace/github_cpp_makefile_star2_O3/Se6[P]CmdLineArgs/test.cpp
// Function: main
int main(int argc, char**argv) {

    int nbFails = 0;

    // test 1
    const char* argv1[] = {"test", "-hv", "--nb", "12", "--name",  "hello me", "--ratio", "0.25", "--num", "3,4", "remain", "-v" };
    int argc1 = nelem(argv1);
    fixTest(1, argc1, argv1, nbFails);
        
    // test 2
    const char* argv2[] = {"test", "remain", "-vhv", "--nb", "0xC", "--name=hello me", "--ratio=0.250", "--num", "3,", "4"};
    int argc2 = nelem(argv2);
    fixTest(2, argc2, argv2, nbFails);
    
    // Test getParams in more depth
    getParamsTest(3, nbFails);
        
    if( nbFails ) {
        cout << nbFails << " test failed!\n";
        return 1;
    } else {
        cout << "All tests passed.\n";
        return 0;
    }
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
leaq 0x4(%rsp), %r14
movl $0x0, (%r14)
leaq 0x8899(%rip), %rdx      # 0xdcb0
movl $0x1, %ebx
movl $0x1, %edi
movl $0xc, %esi
movq %r14, %rcx
callq 0x549a
leaq 0x88db(%rip), %rdx      # 0xdd10
movl $0x2, %edi
movl $0xa, %esi
movq %r14, %rcx
callq 0x549a
movl $0x3, %edi
movq %r14, %rsi
callq 0x6200
movl (%r14), %esi
movq 0x8b6a(%rip), %rdi      # 0xdfc8
testl %esi, %esi
je 0x547d
callq 0x3360
leaq 0x4cf5(%rip), %rsi      # 0xa163
movl $0xe, %edx
movq %rax, %rdi
callq 0x3230
jmp 0x5490
leaq 0x4cee(%rip), %rsi      # 0xa172
movl $0x12, %edx
callq 0x3230
xorl %ebx, %ebx
movl %ebx, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_cpp_makefile_star2_O3/ahnafraihan[P]BestFirstSearch/main.cpp
// Function: bound(int, int*, int*, int, node)
float bound(int n, int p[], int w[], int W, node u) {
    int j, k;
    int tw; //integer to hold total weight
    float bound; // upper bound return value
    
    if(u.weight >= W) //over maximum weight
        return 0;
    else {
        bound = (float)u.profit;
        j = u.level;
        tw = u.weight;
        while(j <= n && tw + w[j] <= W) { //add items
            tw = tw + w[j];
            bound = bound + p[j];
            ++j;
        }
        k = j;
        if(k < n) // take fraction of item
            bound = bound + (W - tw) * p[k]/w[k];
        return bound;
    }
}

// Assembly:
movl %ecx, %eax
movl 0x8(%r8), %r9d
xorps %xmm0, %xmm0
cmpl %ecx, %r9d
jge 0x3058
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdx, %rcx
xorps %xmm0, %xmm0
cvtsi2ssl 0x4(%r8), %xmm0
movl (%r8), %edx
cmpl %edi, %edx
jg 0x3033
movslq %edx, %r11
leal 0x1(%rdi), %r8d
leaq (%rcx,%r11,4), %r10
leaq (%rsi,%r11,4), %r11
movl %edi, %r14d
notl %r14d
addq %rdx, %r14
xorl %ebx, %ebx
movl (%r10,%rbx,4), %r15d
addl %r9d, %r15d
cmpl %eax, %r15d
jg 0x302f
xorps %xmm1, %xmm1
cvtsi2ssl (%r11,%rbx,4), %xmm1
addss %xmm1, %xmm0
incq %rbx
movl %r14d, %r12d
movl %r15d, %r9d
addl %ebx, %r12d
jne 0x3000
movl %r8d, %edx
movl %r15d, %r9d
jmp 0x3033
addl %edx, %ebx
movl %ebx, %edx
cmpl %edi, %edx
jge 0x3050
subl %r9d, %eax
movslq %edx, %rdi
imull (%rsi,%rdi,4), %eax
cltd
idivl (%rcx,%rdi,4)
xorps %xmm1, %xmm1
cvtsi2ss %eax, %xmm1
addss %xmm1, %xmm0
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/chuckwolber[P]Cube/test/test_cube.cpp
// Function: main
int main() {
   test_constructors();
   test_operators();
   test_getCubeSize();
   test_turns();

   return 0;
}

// Assembly:
pushq %rax
callq 0x39c1
callq 0x3f81
callq 0x50a5
callq 0x51de
xorl %eax, %eax
popq %rcx
retq
// File: /workspace/github_cpp_makefile_star2_O3/chuckwolber[P]Cube/test/test_cube.cpp
// Function: verify_cube(Cube, std::vector<CubieColor, std::allocator<CubieColor>>)
void verify_cube(Cube cube, std::vector<CubieColor> expected) {
   std::vector<CubieColor> result = cube.getCube();
   assert(result.size() == expected.size());
   for (unsigned int i = 0; i < result.size(); i++)
      assert(result.at(i) == expected.at(i));
}

// Assembly:
pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %rsi
movq %rsp, %r14
movq %r14, %rdi
callq 0x2c9e
movq (%r14), %rdi
movq 0x8(%r14), %rdx
movq %rdx, %rax
subq %rdi, %rax
movq (%rbx), %rcx
movq 0x8(%rbx), %rsi
subq %rcx, %rsi
cmpq %rsi, %rax
jne 0x6512
cmpq %rdi, %rdx
je 0x64d9
movl $0x1, %edx
xorl %esi, %esi
movb (%rdi,%rsi), %r8b
cmpb (%rcx,%rsi), %r8b
jne 0x64f3
movl %edx, %esi
incl %edx
cmpq %rsi, %rax
ja 0x64c4
jmp 0x64de
testq %rdi, %rdi
je 0x64eb
movq 0x10(%rsp), %rsi
subq %rdi, %rsi
callq 0x1120
addq $0x18, %rsp
popq %rbx
popq %r14
retq
leaq 0x2fde(%rip), %rdi      # 0x94d8
leaq 0x2e25(%rip), %rsi      # 0x9326
leaq 0x2fa0(%rip), %rcx      # 0x94a8
movl $0x1c5, %edx            # imm = 0x1C5
callq 0x1090
leaq 0x2f6e(%rip), %rdi      # 0x9487
leaq 0x2e06(%rip), %rsi      # 0x9326
leaq 0x2f81(%rip), %rcx      # 0x94a8
movl $0x1c3, %edx            # imm = 0x1C3
callq 0x1090
// File: /workspace/github_cpp_makefile_star2_O3/chuckwolber[P]Cube/test/test_cube.cpp
// Function: getScrambled()
Cube getScrambled() {
   Cube c(CubieColor::RED, 3);
   c.turn({Layer::R, false});
   c.turn({Layer::B, true});
   c.turn({Layer::U, false});
   c.turn({Layer::L, true});
   c.turn({Layer::F, false});
   c.turn({Layer::U, true});
   c.turn({Layer::F, false});
   c.turn({Layer::D, true});
   return c;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl $0x72, %esi
movl $0x3, %edx
callq 0x2a04
movl $0x6, %esi
movq %rbx, %rdi
callq 0x2e56
movabsq $0x100000007, %rsi      # imm = 0x100000007
movq %rbx, %rdi
callq 0x2e56
movl $0x1, %esi
movq %rbx, %rdi
callq 0x2e56
movabsq $0x100000004, %rsi      # imm = 0x100000004
movq %rbx, %rdi
callq 0x2e56
movl $0x5, %esi
movq %rbx, %rdi
callq 0x2e56
movabsq $0x100000001, %rsi      # imm = 0x100000001
movq %rbx, %rdi
callq 0x2e56
movl $0x5, %esi
movq %rbx, %rdi
callq 0x2e56
movabsq $0x100000009, %rsi      # imm = 0x100000009
movq %rbx, %rdi
callq 0x2e56
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movq %rax, %r14
movq %rbx, %rdi
callq 0x2c94
movq %r14, %rdi
callq 0x1190
// File: /workspace/github_cpp_makefile_star2_O3/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: initializeGraph(Graph*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, double, double)
void initializeGraph(Graph* myGraph, const string nodeFilePath, const string edgeFilePath, double delta, double sectionLength)
{
	printf("Initializing the road network...\n");
	myGraph->vertexsVector = new Vertex[VERTEX_SIZE];
	myGraph->edgesVector   = new Edge[EDGE_SIZE];
	readVertexs(myGraph, nodeFilePath);
	readEdges(myGraph, edgeFilePath);
	myGraph->delta = delta;
	myGraph->SECTION_LENGTH = sectionLength;
	printf("The road network is initialized!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x50, %rsp
movsd %xmm1, -0x30(%rbp)
movsd %xmm0, -0x28(%rbp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
leaq 0x7404(%rip), %rdi      # 0xc27d
callq 0x21b0
movl $0x1005908, %edi        # imm = 0x1005908
callq 0x2030
movq $0x249f0, (%rax)        # imm = 0x249F0
movl $0x48, %ecx
xorps %xmm0, %xmm0
movups %xmm0, 0x20(%rax,%rcx)
movups %xmm0, 0x10(%rax,%rcx)
movups %xmm0, (%rax,%rcx)
addq $0x70, %rcx
cmpq $0x1005948, %rcx        # imm = 0x1005948
jne 0x4e97
addq $0x8, %rax
movq %rax, 0x10(%rbx)
movl $0x493e00, %edi         # imm = 0x493E00
callq 0x2030
movq %rax, 0x8(%rbx)
leaq -0x60(%rbp), %r12
movq %r12, -0x10(%r12)
movq (%r15), %rsi
movq 0x8(%r15), %rdx
addq %rsi, %rdx
leaq -0x70(%rbp), %r15
movq %r15, %rdi
callq 0x4c5a
movq %rbx, %rdi
movq %r15, %rsi
callq 0x6f90
movq -0x70(%rbp), %rdi
cmpq %r12, %rdi
je 0x4f00
callq 0x2120
leaq -0x40(%rbp), %r15
movq %r15, -0x10(%r15)
movq (%r14), %rsi
movq 0x8(%r14), %rdx
addq %rsi, %rdx
leaq -0x50(%rbp), %r14
movq %r14, %rdi
callq 0x4c5a
movq %rbx, %rdi
movq %r14, %rsi
callq 0x70bf
movq -0x50(%rbp), %rdi
cmpq %r15, %rdi
je 0x4f37
callq 0x2120
movsd -0x28(%rbp), %xmm0
movsd %xmm0, 0x18(%rbx)
movsd -0x30(%rbp), %xmm0
movsd %xmm0, 0x20(%rbx)
leaq 0x734c(%rip), %rdi      # 0xc29e
callq 0x21b0
addq $0x50, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq -0x50(%rbp), %rdi
cmpq %r15, %rdi
jne 0x4f7e
jmp 0x4f83
movq %rax, %rbx
movq -0x70(%rbp), %rdi
cmpq %r12, %rdi
je 0x4f83
callq 0x2120
movq %rbx, %rdi
callq 0x2210
// File: /workspace/github_cpp_makefile_star2_O3/Proudc[P]CTSS/src/ContinuousQuery/Base.cpp
// Function: setCurrPath(Graph*, std::vector<Edge, std::allocator<Edge>>*, CompletePath*, unsigned int)
void setCurrPath(Graph* myGraph, std::vector<Edge>* currentPath, CompletePath* completePath, const unsigned int pos)
{
	printf("Initializing the current path...\n");
	for (unsigned int i = 0; i < pos; i++)
	{
		Edge temEdge = completePath->edges[i];
		myGraph->vertexsVector[temEdge.firstVertexID].accessFlag = true;
		myGraph->vertexsVector[temEdge.firstVertexID].currFlag   = true;
		myGraph->vertexsVector[temEdge.secVertexID].accessFlag   = true;
		myGraph->vertexsVector[temEdge.secVertexID].currFlag     = true;
		currentPath->push_back(temEdge);
	}
	printf("The current path initialization is complete!!!\n");
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movl %ecx, %r12d
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r13
leaq 0x6d94(%rip), %rdi      # 0xc41f
callq 0x21b0
testl %r12d, %r12d
je 0x5722
movq %rbx, %rdx
movl %r12d, %ebx
shlq $0x5, %rbx
xorl %r12d, %r12d
movw $0x101, %r8w            # imm = 0x101
movq 0x10(%rdx), %rax
movups (%rax,%r12), %xmm0
movups 0x10(%rax,%r12), %xmm1
movaps %xmm1, -0x40(%rbp)
movaps %xmm0, -0x50(%rbp)
movq 0x10(%r13), %rax
movslq -0x4c(%rbp), %rcx
imulq $0x70, %rcx, %rcx
movw %r8w, 0x12(%rax,%rcx)
movslq -0x48(%rbp), %rcx
imulq $0x70, %rcx, %rcx
movw %r8w, 0x12(%rax,%rcx)
movq 0x8(%r14), %rsi
cmpq 0x10(%r14), %rsi
je 0x5702
movaps -0x50(%rbp), %xmm0
movaps -0x40(%rbp), %xmm1
movups %xmm1, 0x10(%rsi)
movups %xmm0, (%rsi)
addq $0x20, 0x8(%r14)
jmp 0x5719
movq %r14, %rdi
movq %rdx, %r15
leaq -0x50(%rbp), %rdx
callq 0x4d16
movw $0x101, %r8w            # imm = 0x101
movq %r15, %rdx
addq $0x20, %r12
cmpq %r12, %rbx
jne 0x56ab
leaq 0x6d17(%rip), %rdi      # 0xc440
callq 0x21b0
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq