// File: /workspace/github_cpp_makefile_star2_O2/SNUCSE-CTA[P]GI/src/backtrack.cpp
// Function: Backtrack::backtrack(int)
bool Backtrack::backtrack(int32_t aNumMatching)
{
	#ifdef DEBUG
	cout << __PRETTY_FUNCTION__ << endl;
	#endif

	int32_t depth = aNumMatching; //the number of mapped vertices
	int32_t curr = dag->root; //current mapping node of graph 1 (start from the root)
	int32_t i, j, p, prevCand, child, cand;
	bool backtrack = false;
	bool mappingFailed, needBacktrack;
	int32_t confSize = 0; //for the partial failing set
	int32_t* confArray = global_memory->getLLArray(n);

	int32_t* childSize = dag->childSize;
	int32_t* parentSize = dag->parentSize;
	int32_t* dagArr = dag->dagArr;
	int32_t* adjPos1 = g1->adjPos;
	

	//we implement the recursive backtracking function by iterative method
	while( true ) {
		//two cases:
		//	A. beginning of a new recursive function (backtrack == false)
		//	B. retruning from a recursive function (backtrack == true)
		if( backtrack == false ) {
			// Case A. beginning
			if( depth == n ) { //we found an isomorphism
				global_memory->returnLLArray(confArray, n);
				return true;
			}

            increaseNumRecur();

			curr = getMinExtVertex(); //get a node with the min-weight and delete it from the extendable vertex array.
			computeExtCand(curr);	//compute the extendable candidates by intersection and store it in extCand[curr].
			candPos[curr] = 0;	//index of the extendable candidate array
			matchingOrder[depth] = curr;	//store the matching order so as to get the previously matched node when backtracks.

			//failing set
			vector<int32_t>& curr_f = failingset[ depth - aNumMatching ];
			curr_f.clear();
		}
		else {
			// Case B. returning
			curr = matchingOrder[depth]; //when returning, no need to call getMinExtVertex()
			prevCand = mapping[curr];
			mapping[prevCand] = -1;
			mapping[curr] = -1;

			//update extendable vertices in DAG-ordering
			for(i = 0; i < childSize[curr]; ++i) {
				//delete children whose numMappedParent == parentSize from extendable vertex
				//, and decrease numMappedParent by 1 for each DAG child of u
				child = dagArr[ adjPos1[curr] + parentSize[curr] + i ];
				if( numMappedParent[child] == parentSize[child] ) {
					deleteExtVertex(child);
				}
				--(numMappedParent[child]);
			}

			//failing set
			vector<int32_t>& child_f = failingset[depth - aNumMatching + 1]; //failing set of a child node in the search tree
			int32_t fsetIndex = binarySearch(child_f, curr);
			if( fsetIndex == -1 ) { //if curr is not in child_f
				failingset[depth - aNumMatching] = child_f;

				backtrack = true;
				--depth;
				if( depth == aNumMatching - 1 ) {
					global_memory->returnLLArray(confArray, n);
					return false;
				}
				insertExtVertex(curr, weight[curr]);
				continue;
			}
			else {
				merge( failingset[depth - aNumMatching], child_f ); //union
			}
			
			//if all candidate failed
			if( candPos[curr] == (int32_t)extCand[curr].size() - 1 ) { 
				//failing set
				if( fsetIndex != -1 ) { //if curr is in child_f (it is merged to curr_f)
					vector<int32_t>& curr_f = failingset[depth - aNumMatching];

					//remove curr from curr_f
					curr_f.erase( curr_f.begin() + fsetIndex );

					//insert parent(curr) to curr_f
					global_temp_vector.clear(); //TODO: not using vector
					for(j = 0; j < parentSize[curr]; ++j) {
						p = dagArr[ adjPos1[curr] + j ];
						if( isBinary[p] == 0 )
							global_temp_vector.push_back(p);
					}
					merge(curr_f, global_temp_vector);
				}

				backtrack = true;
				--depth;
				if( depth == aNumMatching - 1 ) {
					global_memory->returnLLArray(confArray, n);
					return false;
				}
				insertExtVertex(curr, weight[curr]);
				continue;
			} //if(candPos[curr] == size() - 1)
			else {
				++(candPos[curr]); //try the next extendable candidate of curr
			}
		} //if-else(backtrack == false)

		if( global_mark > INFINITY ) {
			memset(markCell, 0, sizeof(int32_t) * n2);
			global_mark = 0;
		}
		++global_mark;
		confSize = 0;

		//common part of Cases A and B.
		while( true ) { //while mapping is not okay
			//map curr to the extendable candidate at candPos[curr]
			//if mapping is okay
			//	- then make a new recursive call (with backtrack == false)
			//if mapping is not okay
			//	- then try the next extendable candidate
			//if all extendable candidates are failed to be mapped
			//	- then decrease depth by 1 and backtrack (with backtrack == true)
			//	- if depth becomes -1, termindate

			cand = extCand[curr][ candPos[curr] ];
			mappingFailed = false;
			needBacktrack = false; //when all candidate failed

			if( mapping[cand] != -1 ) {
				//partial failing set
				if( markCell[ mapping[cand] ] != global_mark ) {
					markCell[ mapping[cand] ] = global_mark;
					confArray[confSize] = mapping[cand];
					++confSize;
				}
				if( markCell[curr] != global_mark ) {
					markCell[curr] = global_mark;
					confArray[confSize] = curr;
					++confSize;
				}

				if( candPos[curr] == (int32_t)extCand[curr].size() - 1 ) {
					needBacktrack = true;
				}
				else {
					++(candPos[curr]);
				}
			} // if mapping[cand] != -1
			else {
				mapping[curr] = cand;
				mapping[cand] = curr;

				//for each child of curr
				for(i = 0; i < childSize[curr]; ++i) {
					child = dagArr[ adjPos1[curr] + parentSize[curr] + i ];

					++(numMappedParent[child]);
					if( numMappedParent[child] == parentSize[child] ) {
						weight[child] = computeWeight(child);
						if( weight[child] == 0 ) {	//empty-set class
							mappingFailed = true;
							--(numMappedParent[child]);
							weight[child] = INFINITY;

							vector<int32_t>& curr_f = failingset[depth - aNumMatching];
							global_temp_vector.clear(); //TODO: not using vector
							for(j = 0; j < parentSize[child]; ++j) {
								p = dagArr[ adjPos1[child] + j ];
								if( isBinary[p] == 0 )
									global_temp_vector.push_back(p);
							}
							merge(curr_f, global_temp_vector);
							break; //break the for(i) loop
						} //if weight[child] == 0
						else { //weight[child] > 0
							insertExtVertex(child, weight[child]);
						} //if-else( weight[child] == 0 )
					} //if numMappedParent[child] == parentSize
					else {
						//we can compute weight[child] even if child is not extendable
						if( numMappedParent[child] > 1 && computeWeight(child) == 0 ) {
							mappingFailed = true;
							--(numMappedParent[child]);

							vector<int32_t>& curr_f = failingset[depth - aNumMatching];
							global_temp_vector.clear(); //TODO: not using vector
							for(j = 0; j < parentSize[child]; ++j) {
								p = dagArr[ adjPos1[child] + j ];
								if( isBinary[p] == 0 )
									global_temp_vector.push_back(p);
							}
							merge(curr_f, global_temp_vector);
							break; //break the for(i) loop
						} //if
					} //if-else numMappedParent == parentSize
				} //for (i)

				if( mappingFailed ) {
					//mapping failed because one of the children belongs the empty-set class
					mapping[curr] = -1;
					mapping[cand] = -1;
					for(i = i - 1; i > -1; --i) {
						child = dagArr[ adjPos1[curr] + parentSize[curr] + i ];
						if( numMappedParent[child] == parentSize[child] ) {
							deleteExtVertex(child);
						}
						--(numMappedParent[child]);
					}

					if( candPos[curr] == (int32_t)extCand[curr].size() - 1 ) {
						needBacktrack = true;
					}
					else {
						++(candPos[curr]);
					}
				} //if mappingFailed
				else { //mapping OKAY!
					if( confSize > 0 ) {
						sort(confArray, confArray + confSize);
						merge( failingset[depth - aNumMatching], confArray, confSize );
					}

					backtrack = false;
					++depth;
					break; //break the inner while loop
				} //if-else mappingFailed
			}//if-else mapping[cand] != -1
			
			if( needBacktrack ) {
				vector<int32_t>& curr_f = failingset[depth - aNumMatching];
				if( confSize > 0 ) {
					sort(confArray, confArray + confSize);
					merge(curr_f, confArray, confSize);
				}

				if( curr_f.size() != 0 ) {
					int32_t fsetIndex = binarySearch(curr_f, curr);
					if( fsetIndex != -1 ) {
						//remove curr
						curr_f.erase(curr_f.begin() + fsetIndex);

						//add parent(curr)
						global_temp_vector.clear(); //TODO: not using vector
						for(j = 0; j < parentSize[curr]; ++j) {
							p = dagArr[ adjPos1[curr] + j ];
							if( isBinary[p] == 0 )
								global_temp_vector.push_back(p);
						}
						merge(curr_f, global_temp_vector);
					}
				} //if curr_f.size() != 0

				backtrack = true;
				--depth;
				if( depth == aNumMatching - 1 ) {
					global_memory->returnLLArray(confArray, n);
					return false;
				}
				insertExtVertex(curr, weight[curr]);
				break; //break the inner while loop
			} //if needBacktrack
		} //while(true) of inner loop.
	} //while(true) of outer loop.

	global_memory->returnLLArray(confArray, n);
	return false;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movl %esi, %ebp
movq %rdi, %r14
movq 0xb0(%rdi), %rdi
movl 0x2c(%r14), %esi
callq 0x3f1a
movq %rax, 0x18(%rsp)
movq 0x10(%r14), %rax
movq 0x40(%r14), %rcx
movq 0x10(%rcx), %r15
movq 0x18(%rcx), %r12
movq 0x20(%rcx), %rcx
movq %rcx, 0x30(%rsp)
movq 0x40(%rax), %rax
movq %rax, 0x28(%rsp)
leaq 0x98(%r14), %rax
movq %rax, 0x20(%rsp)
movb $0x1, %al
movl %ebp, 0xc(%rsp)
movq %r15, 0x40(%rsp)
movslq %ebp, %rbx
testb $0x1, %al
movl %ebp, 0x14(%rsp)
je 0x5fe6
cmpl 0x2c(%r14), %ebp
je 0x661e
incl 0x8(%r14)
movq %r14, %rdi
callq 0x6a26
movl %eax, %r13d
movq %r14, %rdi
movl %eax, %esi
callq 0x6a7c
movq 0x80(%r14), %rax
movl %r13d, 0x10(%rsp)
movslq %r13d, %rcx
andl $0x0, (%rax,%rcx,4)
movq 0x88(%r14), %rdx
movl %ecx, (%rdx,%rbx,4)
movq 0x58(%r14), %rcx
movl %ebp, %edx
subl 0xc(%rsp), %edx
movslq %edx, %rdx
imulq $0x18, %rdx, %rsi
movq (%rcx,%rsi), %rdx
cmpq %rdx, 0x8(%rcx,%rsi)
je 0x6178
addq %rsi, %rcx
movq %rdx, 0x8(%rcx)
jmp 0x6178
movq 0x50(%r14), %rax
movq 0x88(%r14), %rcx
movl (%rcx,%rbx,4), %ecx
movl %ecx, 0x10(%rsp)
movslq %ecx, %rbp
movslq (%rax,%rbp,4), %rcx
orl $-0x1, (%rax,%rcx,4)
orl $-0x1, (%rax,%rbp,4)
xorl %r13d, %r13d
cmpl (%r15,%rbp,4), %r13d
jge 0x6052
movq 0x28(%rsp), %rax
movl (%rax,%rbp,4), %eax
addl (%r12,%rbp,4), %eax
addl %r13d, %eax
cltq
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %rbx
movq 0x78(%r14), %rax
movl (%rax,%rbx,4), %ecx
cmpl (%r12,%rbx,4), %ecx
jne 0x6048
movq %r14, %rdi
movl %ebx, %esi
callq 0x6e12
movq 0x78(%r14), %rax
movl (%rax,%rbx,4), %ecx
decl %ecx
movl %ecx, (%rax,%rbx,4)
incl %r13d
jmp 0x600a
movq 0x58(%r14), %rbx
movl 0x14(%rsp), %r13d
movl %r13d, %eax
subl 0xc(%rsp), %eax
cltq
imulq $0x18, %rax, %rax
leaq (%rbx,%rax), %r15
addq $0x18, %r15
movq %rax, 0x48(%rsp)
addq %rax, %rbx
movq %r15, %rsi
movl 0x10(%rsp), %edx
callq 0x6e24
cmpl $-0x1, %eax
je 0x614a
movl %eax, %r13d
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x6ea4
movq 0x60(%r14), %rcx
movq 0x80(%r14), %rax
imulq $0x18, %rbp, %rdx
movq 0x8(%rcx,%rdx), %rsi
subq (%rcx,%rdx), %rsi
movl (%rax,%rbp,4), %ecx
shrq $0x2, %rsi
decl %esi
cmpl %esi, %ecx
jne 0x616a
movq 0x58(%r14), %rax
movq 0x48(%rsp), %rcx
leaq (%rax,%rcx), %rbx
movslq %r13d, %rsi
shlq $0x2, %rsi
addq (%rax,%rcx), %rsi
movq %rbx, %rdi
callq 0x76e6
movq 0x98(%r14), %rax
cmpq %rax, 0xa0(%r14)
movq 0x40(%rsp), %r15
je 0x6103
movq %rax, 0xa0(%r14)
xorl %r13d, %r13d
cmpl (%r12,%rbp,4), %r13d
jge 0x64e4
movq 0x28(%rsp), %rax
movslq (%rax,%rbp,4), %rax
addq %r13, %rax
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %rax
movl %eax, 0x8(%rsp)
movq 0x90(%r14), %rcx
cmpb $0x0, (%rcx,%rax)
jne 0x6145
movq 0x20(%rsp), %rdi
leaq 0x8(%rsp), %rsi
callq 0x7720
incq %r13
jmp 0x6106
movq %rbx, %rdi
movq %r15, %rsi
callq 0x761c
cmpl 0xc(%rsp), %r13d
movq 0x40(%rsp), %r15
jne 0x6504
jmp 0x6635
incl %ecx
movl %ecx, (%rax,%rbp,4)
movq 0x40(%rsp), %r15
movl 0x14(%rsp), %ebp
movl 0xc8(%r14), %ebx
cmpl $0x77359401, %ebx       # imm = 0x77359401
jl 0x61a6
movq 0xc0(%r14), %rdi
movslq 0x34(%r14), %rdx
shlq $0x2, %rdx
xorl %ebx, %ebx
xorl %esi, %esi
callq 0x2100
movq 0x80(%r14), %rax
incl %ebx
movl %ebx, 0xc8(%r14)
movslq 0x10(%rsp), %rbx
movl %ebp, %ecx
subl 0xc(%rsp), %ecx
movslq %ecx, %rcx
movq %rcx, 0x50(%rsp)
movq 0x60(%r14), %rcx
imulq $0x18, %rbx, %rdx
movq %rdx, 0x48(%rsp)
movq $0x0, 0x38(%rsp)
movslq (%rax,%rbx,4), %rsi
movq 0x48(%rsp), %rdx
movq (%rcx,%rdx), %rdx
movl (%rdx,%rsi,4), %esi
movq 0x50(%r14), %rdi
movslq %esi, %r11
movslq (%rdi,%r11,4), %r9
cmpq $-0x1, %r9
je 0x6288
movq 0xc0(%r14), %rsi
movl (%rsi,%r9,4), %r8d
movl 0xc8(%r14), %r10d
cmpl %r10d, %r8d
je 0x623c
movl %r10d, (%rsi,%r9,4)
movl (%rdi,%r11,4), %edi
movq 0x38(%rsp), %r9
movslq %r9d, %r9
movq 0x18(%rsp), %r8
movl %edi, (%r8,%r9,4)
incl %r9d
movq %r9, 0x38(%rsp)
movl 0xc8(%r14), %r8d
cmpl %r8d, (%rsi,%rbx,4)
je 0x625d
movl %r8d, (%rsi,%rbx,4)
movq 0x38(%rsp), %rdi
movslq %edi, %rdi
movq 0x18(%rsp), %rsi
movl %ebx, (%rsi,%rdi,4)
incl %edi
movq %rdi, 0x38(%rsp)
movq 0x48(%rsp), %rsi
leaq (%rcx,%rsi), %r8
leaq (%rax,%rbx,4), %rdi
movl (%rdi), %esi
movq 0x8(%r8), %r8
subq %rdx, %r8
shrq $0x2, %r8
decl %r8d
cmpl %r8d, %esi
jne 0x6498
jmp 0x6528
movl %r11d, (%rdi,%rbx,4)
movl %ebx, (%rdi,%r11,4)
xorl %ebp, %ebp
movq %r11, 0x60(%rsp)
cmpl (%r15,%rbx,4), %ebp
jge 0x64a1
movq 0x28(%rsp), %rax
movl (%rax,%rbx,4), %eax
addl (%r12,%rbx,4), %eax
addl %ebp, %eax
cltq
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %r13
movq 0x78(%r14), %rcx
movl (%rcx,%r13,4), %eax
leal 0x1(%rax), %edx
movl %edx, (%rcx,%r13,4)
cmpl (%r12,%r13,4), %edx
jne 0x62f5
movq %r14, %rdi
movl %r13d, %esi
callq 0x6754
movq 0x70(%r14), %rcx
movl %eax, (%rcx,%r13,4)
testl %eax, %eax
je 0x630c
movq %r14, %rdi
movl %r13d, %esi
movl %eax, %edx
callq 0x6e8c
jmp 0x6308
testl %eax, %eax
jle 0x6308
movq %r14, %rdi
movl %r13d, %esi
callq 0x6754
testl %eax, %eax
je 0x6383
incl %ebp
jmp 0x6297
movq 0x78(%r14), %rax
decl (%rax,%r13,4)
movl $0x77359400, (%rcx,%r13,4) # imm = 0x77359400
movq 0x98(%r14), %rax
cmpq %rax, 0xa0(%r14)
je 0x6333
movq %rax, 0xa0(%r14)
movq 0x58(%r14), %rax
movq %rax, 0x58(%rsp)
xorl %r15d, %r15d
cmpl (%r12,%r13,4), %r15d
jge 0x63ee
movq 0x28(%rsp), %rax
movslq (%rax,%r13,4), %rax
addq %r15, %rax
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %rax
movl %eax, 0x8(%rsp)
movq 0x90(%r14), %rcx
cmpb $0x0, (%rcx,%rax)
jne 0x637e
movq 0x20(%rsp), %rdi
leaq 0x8(%rsp), %rsi
callq 0x7720
incq %r15
jmp 0x633f
movq 0x78(%r14), %rax
decl (%rax,%r13,4)
movq 0x98(%r14), %rax
cmpq %rax, 0xa0(%r14)
je 0x63a2
movq %rax, 0xa0(%r14)
movq 0x58(%r14), %rax
movq %rax, 0x58(%rsp)
xorl %r15d, %r15d
cmpl (%r12,%r13,4), %r15d
jge 0x63ee
movq 0x28(%rsp), %rax
movslq (%rax,%r13,4), %rax
addq %r15, %rax
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %rax
movl %eax, 0x8(%rsp)
movq 0x90(%r14), %rcx
cmpb $0x0, (%rcx,%rax)
jne 0x63e9
movq 0x20(%rsp), %rdi
leaq 0x8(%rsp), %rsi
callq 0x7720
incq %r15
jmp 0x63ae
imulq $0x18, 0x50(%rsp), %rsi
addq 0x58(%rsp), %rsi
movq %r14, %rdi
movq 0x20(%rsp), %rdx
callq 0x6ea4
movq 0x50(%r14), %rax
orl $-0x1, (%rax,%rbx,4)
movq 0x60(%rsp), %rcx
orl $-0x1, (%rax,%rcx,4)
movq 0x40(%rsp), %r15
testl %ebp, %ebp
jle 0x6466
movq 0x28(%rsp), %rax
movl (%rax,%rbx,4), %eax
addl (%r12,%rbx,4), %eax
addl %ebp, %eax
decl %eax
cltq
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %r13
movq 0x78(%r14), %rax
movl (%rax,%r13,4), %ecx
cmpl (%r12,%r13,4), %ecx
jne 0x645c
movq %r14, %rdi
movl %r13d, %esi
callq 0x6e12
movq 0x78(%r14), %rax
movl (%rax,%r13,4), %ecx
decl %ecx
movl %ecx, (%rax,%r13,4)
decl %ebp
jmp 0x641c
movq 0x60(%r14), %rcx
movq 0x80(%r14), %rax
movq 0x48(%rsp), %rsi
movq 0x8(%rcx,%rsi), %rdx
subq (%rcx,%rsi), %rdx
movl (%rax,%rbx,4), %esi
shrq $0x2, %rdx
decl %edx
cmpl %edx, %esi
je 0x6524
leaq (%rax,%rbx,4), %rdi
movl 0x14(%rsp), %ebp
incl %esi
movl %esi, (%rdi)
jmp 0x61d8
movq 0x38(%rsp), %r13
testl %r13d, %r13d
jle 0x64d7
movl %r13d, %eax
movq 0x18(%rsp), %rbx
leaq (%rbx,%rax,4), %rsi
movq %rbx, %rdi
callq 0x7839
imulq $0x18, 0x50(%rsp), %rsi
addq 0x58(%r14), %rsi
movq %r14, %rdi
movq %rbx, %rdx
movl %r13d, %ecx
callq 0x7034
movl 0x14(%rsp), %ebp
incl %ebp
movb $0x1, %al
jmp 0x5f6f
movq %r14, %rdi
movq %rbx, %rsi
movq 0x20(%rsp), %rdx
callq 0x6ea4
movl 0x14(%rsp), %r13d
cmpl 0xc(%rsp), %r13d
je 0x6635
movq 0x70(%r14), %rax
movl (%rax,%rbp,4), %edx
movq %r14, %rdi
movl 0x10(%rsp), %esi
callq 0x6e8c
decl %r13d
xorl %eax, %eax
movl %r13d, %ebp
jmp 0x5f6f
movl 0x14(%rsp), %ebp
imulq $0x18, 0x50(%rsp), %r13
addq 0x58(%r14), %r13
movq 0x38(%rsp), %r15
testl %r15d, %r15d
jle 0x6560
movl %r15d, %eax
movq 0x18(%rsp), %rdi
leaq (%rdi,%rax,4), %rsi
callq 0x7839
movq %r14, %rdi
movq %r13, %rsi
movq 0x18(%rsp), %rdx
movl %r15d, %ecx
callq 0x7034
movq (%r13), %r15
cmpq %r15, 0x8(%r13)
je 0x65f7
movq %r13, %rsi
movl 0x10(%rsp), %edx
callq 0x6e24
cmpl $-0x1, %eax
je 0x65f7
cltq
leaq (%r15,%rax,4), %rsi
movq %r13, %rdi
callq 0x76e6
movq 0x98(%r14), %rax
cmpq %rax, 0xa0(%r14)
je 0x65a4
movq %rax, 0xa0(%r14)
xorl %r15d, %r15d
cmpl (%r12,%rbx,4), %r15d
jge 0x65e7
movq 0x28(%rsp), %rax
movslq (%rax,%rbx,4), %rax
addq %r15, %rax
movq 0x30(%rsp), %rcx
movslq (%rcx,%rax,4), %rax
movl %eax, 0x8(%rsp)
movq 0x90(%r14), %rcx
cmpb $0x0, (%rcx,%rax)
jne 0x65e2
movq 0x20(%rsp), %rdi
leaq 0x8(%rsp), %rsi
callq 0x7720
incq %r15
jmp 0x65a7
movq %r14, %rdi
movq %r13, %rsi
movq 0x20(%rsp), %rdx
callq 0x6ea4
cmpl 0xc(%rsp), %ebp
je 0x6635
decl %ebp
movq 0x70(%r14), %rax
movl (%rax,%rbx,4), %edx
movq %r14, %rdi
movl 0x10(%rsp), %esi
callq 0x6e8c
xorl %eax, %eax
movq 0x40(%rsp), %r15
jmp 0x5f6f
movq 0xb0(%r14), %rdi
movq 0x18(%rsp), %rsi
movl %ebp, %edx
callq 0x3fee
movb $0x1, %al
jmp 0x664c
movq 0xb0(%r14), %rdi
movl 0x2c(%r14), %edx
movq 0x18(%rsp), %rsi
callq 0x3fee
xorl %eax, %eax
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop