// File: /workspace/github_cpp_makefile_star2_O2/BenLangmead[P]bowtie/./ref_aligner.h
// Function: OneMMRefAligner::anchor64Find(unsigned int, unsigned long, unsigned char*, SDnaStringExpandable<25, 2> const&, SStringExpandable<char, 25, 2, 0> const&, unsigned int, unsigned int, EList<Range, 128>&, EList<unsigned int, 128>&, std::set<std::pair<unsigned long, unsigned long>, std::less<std::pair<unsigned long, unsigned long>>, std::allocator<std::pair<unsigned long, unsigned long>>>*, unsigned int, bool) const
virtual void anchor64Find(uint32_t numToFind,
						  size_t tidx,
						  uint8_t* ref,
						  const BTDnaString& qry,
						  const BTString& quals,
						  TIndexOffU begin,
						  TIndexOffU end,
						  TRangeVec& ranges,
						  EList<TIndexOffU>& results,
						  TSetPairs* pairs = NULL,
						  TIndexOffU aoff = OFF_MASK,
						  bool seedOnLeft = false) const
			{
				assert_gt(numToFind, 0);
				ASSERT_ONLY(const uint32_t rangesInitSz = (uint32_t)ranges.size());
				ASSERT_ONLY(uint32_t duplicates = 0);
				ASSERT_ONLY(uint32_t r2i = 0);
				const uint32_t qlen = (uint32_t)qry.length();
				assert_geq(end - begin, qlen); // caller should have checked this
				assert_gt(end, begin);
				assert_gt(qlen, 0);
#ifndef NDEBUG
				// Get results from the naive matcher for sanity-checking
				TRangeVec r2; EList<TIndexOffU> re2;
				naiveFind(numToFind, tidx, ref, qry, quals, begin, end, r2,
					  re2, pairs, aoff, seedOnLeft);
#endif
				const uint32_t anchorBitPairs = min<int>(qlen, 32);
				const int lhsShift = ((anchorBitPairs - 1) << 1);
				const uint32_t anchorCushion  = 32 - anchorBitPairs;
				// anchorOverhang = # read bases not included in the anchor
				const size_t anchorOverhang = (qlen <= 32 ? 0 : (qlen - 32));
				const TIndexOffU lim = end - qlen - begin;
				const TIndexOffU halfway = begin + (lim >> 1);
				uint64_t anchor = 0llu;
				uint64_t buffw = 0llu;  // rotating ref sequence buffer
				// OR the 'diff' buffer with this so that we can always count
				// 'N's as mismatches
				uint64_t diffMask = 0llu;
				// Set up a mask that we'll apply to the two bufs every round
				// to discard bits that were rotated out of the anchor area
				uint64_t clearMask = 0xffffffffffffffffllu;
				bool useMask = false;
				if(anchorBitPairs < 32) {
					clearMask >>= ((32-anchorBitPairs) << 1);
					useMask = true;
				}
				int nsInAnchor = 0;
				int nPos = -1;
				size_t skipLeftToRights = 0;
				size_t skipRightToLefts = 0;
				// Construct the 'anchor' 64-bit buffer so that it holds all of
				// the first 'anchorBitPairs' bit pairs of the query.
				for(size_t i = 0; i < anchorBitPairs; i++) {
					int c = (int)qry[i]; // next query character
					int r = (int)ref[halfway - begin + i]; // next reference character
					if(r & 4) {
						r = 0;
						// The right-to-left direction absorbs the candidate
						// alignment based at 'halfway'; so skipLeftToRights is
						// i, not i+1
						skipLeftToRights = max(skipLeftToRights, i);
						skipRightToLefts = max(skipRightToLefts, anchorBitPairs - i);
					}
					assert_leq(c, 4);
					assert_lt(r, 4);
					// Special case: query has an 'N'
					if(c == 4) {
						if(++nsInAnchor > 1) {
							// More than one 'N' in the anchor region; can't
							// possibly have a 1-mismatch hit anywhere
							assert_eq(r2.size(), ranges.size() - rangesInitSz);
							return;   // can't match if query has Ns
						}
						nPos = (int)i;
						// Make it look like an 'A' in the anchor
						c = 0;
						diffMask = (diffMask << 2llu) | 1llu;
					} else {
						diffMask <<= 2llu;
					}
					anchor  = ((anchor  << 2llu) | c);
					buffw = ((buffw << 2llu) | r);
				}
				// Check whether read is disqualified by Ns outside of the anchor
				// region
				for(size_t i = anchorBitPairs; i < qlen; i++) {
					if((int)qry[i] == 4) {
						if(++nsInAnchor > 1) {
							assert_eq(r2.size(), ranges.size() - rangesInitSz);
							return; // can't match if query has Ns
						}
					}
				}
				uint64_t bufbw = buffw;
				// We're moving the right-hand edge of the anchor along until
				// it's 'anchorOverhang' chars from the end of the target region.
				// Note that we're not making a 3'/5' distinction here; if we
				// were, we might need to make the 'anchorOverhang' adjustment on
				// the left end of the range rather than the right.
				bool hi = false;
				TIndexOffU riHi  = halfway;
				TIndexOffU rirHi = halfway - begin;
				TIndexOffU rirHiAnchor = rirHi + anchorBitPairs - 1;
				TIndexOffU riLo  = halfway + 1;
				TIndexOffU rirLo = halfway - begin + 1;
				for(TIndexOffU i = 1; i <= lim + 1; i++) {
					int r;       // new reference char
					uint64_t diff;
					assert_lt(skipLeftToRights, qlen);
					assert_leq(skipRightToLefts, qlen);
					if(hi) {
						hi = false;
						// Moving left-to-right
						riHi++;
						rirHi++;
						rirHiAnchor++;
						r = (int)ref[rirHiAnchor];
						if(r & 4) {
							r = 0;
							skipLeftToRights = anchorBitPairs;
						}
						assert_lt(r, 4);
						// Bring in new base pair at the least significant
						// position
						buffw = ((buffw << 2llu) | r);
						if(useMask) buffw &= clearMask;
						if(skipLeftToRights > 0) {
							skipLeftToRights--;
							continue;
						}
						diff = (buffw ^ anchor) | diffMask;
					} else {
						hi = true;
						// Moving right-to-left
						riLo--;
						rirLo--;
						r = (int)ref[rirLo];
						if(r & 4) {
							r = 0;
							skipRightToLefts = qlen;
						}
						assert_lt(r, 4);
						if(i >= 2) {
							bufbw >>= 2llu;
							// Bring in new base pair at the most significant
							// position
							bufbw |= ((uint64_t)r << lhsShift);
						}
						if(skipRightToLefts > 0) {
							skipRightToLefts--;
							continue;
						}
						diff = (bufbw ^ anchor) | diffMask;
					}
					if((diff & 0xffffffff00000000llu) &&
					   (diff & 0x00000000ffffffffllu)) continue;
					TIndexOffU ri  = hi ? riLo  : riHi;
					TIndexOffU rir = hi ? rirLo : rirHi;
					// Could use pop count
					uint8_t *diff8 = reinterpret_cast<uint8_t*>(&diff);
					// As a first cut, see if there are too many mismatches in
					// the first and last parts of the anchor
					uint32_t diffs = u8toMms[(int)diff8[0]] + u8toMms[(int)diff8[7]];
					if(diffs > 1) continue;
					diffs += u8toMms[(int)diff8[1]] +
						u8toMms[(int)diff8[2]] +
						u8toMms[(int)diff8[3]] +
						u8toMms[(int)diff8[4]] +
						u8toMms[(int)diff8[5]] +
						u8toMms[(int)diff8[6]];
					uint32_t mmpos = 0xffffffff;
					int refc = -1;
					if(diffs > 1) {
						// Too many differences
						continue;
					} else if(diffs == 1 && nPos != -1) {
						// There was one difference, but there was also one N,
						// so we already know where the difference is
						mmpos = nPos;
						refc = "ACGT"[(int)ref[rir + nPos]];
					} else if(diffs == 1) {
						// Figure out which position mismatched
						mmpos = 31;
						if((diff & 0xffffffffllu) == 0) { diff >>= 32llu; mmpos -= 16; }
						assert_neq(0, diff);
						if((diff & 0xffffllu) == 0)     { diff >>= 16llu; mmpos -=  8; }
						assert_neq(0, diff);
						if((diff & 0xffllu) == 0)       { diff >>= 8llu;  mmpos -=  4; }
						assert_neq(0, diff);
						if((diff & 0xfllu) == 0)        { diff >>= 4llu;  mmpos -=  2; }
						assert_neq(0, diff);
						if((diff & 0x3llu) == 0)        { mmpos--; }
						assert_neq(0, diff);
						assert_geq(mmpos, 0);
						assert_lt(mmpos, 32);
						mmpos -= anchorCushion;
						refc = "ACGT"[(int)ref[rir + mmpos]];
					}
					// Now extend the anchor into a longer alignment
					bool foundHit = true;
					if(anchorOverhang > 0) {
						assert_leq(ri + anchorBitPairs + anchorOverhang, end);
						bool skipCandidate = false;
						for(size_t j = 0; j < anchorOverhang; j++) {
							int rc = (int)ref[rir + 32 + j];
							if(rc == 4) {
								// Oops, encountered an N in the reference in
								// the overhang portion of the candidate
								// alignment
								// (Note that we inverted hi earlier)
								if(hi) {
									// Right-to-left
									skipRightToLefts = anchorOverhang - j - 1;
								} else {
									// Left-to-right
									skipLeftToRights = anchorBitPairs + j;
								}
								skipCandidate = true; // Skip this candidate
								break;
							}
							if((int)qry[32 + j] != rc) {
								if(++diffs > 1) {
									foundHit = false;
									break;
								} else {
									mmpos = (uint32_t)(32 + j);
									refc = "ACGT"[(int)ref[rir + 32 + j]];
								}
							}
						}
						if(skipCandidate) continue;
					}
					if(!foundHit) continue;
					if(pairs != NULL) {
						TU64Pair p;
						if(ri < aoff) {
							// By convention, the upstream mate's
							// coordinates go in the 'first' field
							p.first  = ((uint64_t)tidx << 32) | (uint64_t)ri;
							p.second = ((uint64_t)tidx << 32) | (uint64_t)aoff;
						} else {
							p.second = ((uint64_t)tidx << 32) | (uint64_t)ri;
							p.first  = ((uint64_t)tidx << 32) | (uint64_t)aoff;
						}
						if(pairs->find(p) != pairs->end()) {
							// We already found this hit!  Continue.
							ASSERT_ONLY(duplicates++);
							ASSERT_ONLY(r2i++);
							continue;
						} else {
							// Record this hit
							pairs->insert(p);
						}
					}
					assert_leq(diffs, 1);
					assert_lt(r2i, r2.size());
					assert_eq(re2[r2i], ri);
					ranges.resize(ranges.size()+1);
					Range& range = ranges.back();
					assert_eq(diffs, r2[r2i].numMms);
					range.stratum = diffs;
					range.numMms = diffs;
					assert_eq(0, range.mms.size());
					assert_eq(0, range.refcs.size());
					if(diffs == 1) {
						assert_neq(mmpos, 0xffffffff);
						assert_eq(mmpos, r2[r2i].mms[0]);
						assert_neq(-1, refc);
						assert_eq(refc, r2[r2i].refcs[0]);
						range.mms.push_back(mmpos);
						range.refcs.push_back(refc);
					}
					ASSERT_ONLY(r2i++);
					results.push_back(ri);
					if(--numToFind == 0) return;
				}
				assert_leq(duplicates, r2.size());
				assert_geq(r2.size() - duplicates, ranges.size() - rangesInitSz);
				return; // no hit
			}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x118, %rsp            # imm = 0x118
movq %rcx, %rdi
movl %esi, 0xa4(%rsp)
movl 0x158(%rsp), %ecx
movq 0x20(%r8), %r12
pushq $0x20
popq %rsi
cmpl %esi, %r12d
movl %esi, %r14d
cmovll %r12d, %r14d
subl %r14d, %esi
leal -0x20(%r12), %eax
xorl %r13d, %r13d
cmpl $0x21, %r12d
cmovbq %r13, %rax
movq %rax, 0x50(%rsp)
movl 0x150(%rsp), %r9d
subl %r12d, %ecx
subl %r9d, %ecx
movl %ecx, 0x2c(%rsp)
movl %ecx, %r10d
shrl %r10d
movq %rsi, 0xe8(%rsp)
leal (%rsi,%rsi), %ecx
pushq $-0x1
popq %rax
movq %rax, 0x88(%rsp)
shrq %cl, %rax
addl %r10d, %r9d
movq %r9, 0x70(%rsp)
movq %r8, 0x108(%rsp)
movq 0x8(%r8), %rsi
leal -0x2(,%r14,2), %ecx
movq %rdi, 0x60(%rsp)
movq %r10, 0x68(%rsp)
leaq (%r10,%rdi), %r8
pushq $-0x1
popq %rdi
movq %rdi, 0x90(%rsp)
movq %r14, 0x58(%rsp)
xorl %ebp, %ebp
xorl %r9d, %r9d
xorl %edi, %edi
movq $0x0, 0x78(%rsp)
xorl %r15d, %r15d
xorl %ebx, %ebx
movq %r14, %r10
subq $0x1, %r10
jb 0x39026
movzbl (%r8,%r9), %r11d
testb $0x4, %r11b
je 0x38fd0
cmpq %r9, %rbp
cmovbeq %r9, %rbp
cmpq %r14, %r13
cmovbeq %r14, %r13
xorl %r11d, %r11d
movsbq (%rsi,%r9), %r14
cmpb $0x4, %r14b
jne 0x39007
testl %edi, %edi
jg 0x39625
incl %edi
movq 0x78(%rsp), %r14
leaq 0x1(,%r14,4), %r14
movq %r14, 0x78(%rsp)
movl %r9d, %r14d
movq %r14, 0x90(%rsp)
xorl %r14d, %r14d
jmp 0x3900d
shlq $0x2, 0x78(%rsp)
shlq $0x2, %rbx
orq %r14, %rbx
shlq $0x2, %r15
movl %r11d, %r11d
orq %r11, %r15
incq %r9
movq %r10, %r14
jmp 0x38fae
movl %r12d, %r9d
movq 0x58(%rsp), %r8
cmpq %r9, %r8
jae 0x39049
cmpb $0x4, (%rsi,%r8)
jne 0x39044
testl %edi, %edi
jg 0x39625
incl %edi
incq %r8
jmp 0x3902e
movq 0x70(%rsp), %rsi
leal 0x1(%rsi), %r8d
movq 0x68(%rsp), %rdi
leal 0x1(%rdi), %r11d
incl 0x2c(%rsp)
movq 0x58(%rsp), %rsi
cmpl $0x20, %esi
leal -0x1(%rsi,%rdi), %esi
movl %ecx, %r10d
movq 0x88(%rsp), %rcx
cmovbq %rax, %rcx
movq %rcx, 0x88(%rsp)
shlq $0x20, %rdx
movl 0x178(%rsp), %eax
movq %rdx, 0xe0(%rsp)
orq %rdx, %rax
movq %rax, 0xb0(%rsp)
movq 0x170(%rsp), %rax
addq $0x8, %rax
movq %rax, 0xd8(%rsp)
movq 0x50(%rsp), %rax
decq %rax
movq %rax, 0xd0(%rsp)
pushq $0x1
popq %r12
xorl %r14d, %r14d
xorl %ecx, %ecx
movq %r15, 0x98(%rsp)
movq %r9, 0x40(%rsp)
movq %r10, 0x18(%rsp)
cmpl 0x2c(%rsp), %r12d
ja 0x39625
testb $0x1, %cl
je 0x3914e
movq 0x70(%rsp), %rax
incl %eax
movq %rax, 0x70(%rsp)
movq 0x68(%rsp), %rax
incl %eax
movq %rax, 0x68(%rsp)
incl %esi
movq 0x60(%rsp), %rax
movzbl (%rax,%rsi), %edx
xorl %eax, %eax
testb $0x4, %dl
cmovneq 0x58(%rsp), %rbp
cmovnel %eax, %edx
movq 0x98(%rsp), %rax
shlq $0x2, %rax
orq %rax, %rdx
andq 0x88(%rsp), %rdx
testq %rbp, %rbp
je 0x39193
decq %rbp
xorl %ecx, %ecx
movq %rdx, 0x98(%rsp)
jmp 0x39233
decl %r8d
decl %r11d
movq 0x60(%rsp), %rax
movzbl (%rax,%r11), %edx
testb $0x4, %dl
cmovneq %r9, %r13
cmovnel %r14d, %edx
movq %r15, %rax
shrq $0x2, %rax
movl %r10d, %ecx
shlq %cl, %rdx
orq %rax, %rdx
cmpl $0x2, %r12d
cmovbq %r15, %rdx
testq %r13, %r13
je 0x391a7
decq %r13
movb $0x1, %cl
movq %rdx, %r15
jmp 0x39233
movq $0x0, (%rsp)
xorl %ebp, %ebp
movq %rdx, 0x98(%rsp)
jmp 0x391b3
movb $0x1, %al
movq %rax, (%rsp)
xorl %r13d, %r13d
movq %rdx, %r15
xorq %rbx, %rdx
orq 0x78(%rsp), %rdx
movq %rdx, %rdi
shrq $0x20, %rdi
setne %al
testl %edx, %edx
setne %cl
testb %cl, %al
jne 0x3922f
movq %rsi, 0x20(%rsp)
movq %rdx, %r10
shrq $0x38, %r10
cmpb $0x0, (%rsp)
movq 0x70(%rsp), %rax
cmovnel %r8d, %eax
movl %eax, 0xa8(%rsp)
movl %eax, 0xac(%rsp)
movq 0x68(%rsp), %rcx
cmovnel %r11d, %ecx
movq %rcx, 0x80(%rsp)
movzbl %dl, %ecx
leaq 0x2bb10(%rip), %rsi     # 0x64d20
movzbl (%rsi,%rcx), %eax
movzbl (%rsi,%r10), %r14d
addl %eax, %r14d
cmpl $0x2, %r14d
jb 0x3923b
movq 0x20(%rsp), %rsi
movq 0x18(%rsp), %r10
xorl %r14d, %r14d
movq (%rsp), %rcx
incl %r12d
jmp 0x390df
movl %r12d, 0x28(%rsp)
movq %rcx, 0xc8(%rsp)
movq %r11, 0x48(%rsp)
movl %r8d, 0xc(%rsp)
movq %rdx, %r9
shrq $0x8, %r9
movq %rdx, %rax
shrq $0x10, %rax
movq %rdx, %r8
shrq $0x18, %r8
movq %rdx, %r12
shrq $0x28, %r12
movq %rdx, %r11
shrq $0x30, %r11
movq %r9, 0xb8(%rsp)
movl $0xff, %ecx
andq %rcx, %r9
movzbl (%rsi,%r9), %r9d
movl %r9d, 0x10(%rsp)
movq %rax, 0x110(%rsp)
movq %rax, %r9
andq %rcx, %r9
movzbl (%rsi,%r9), %r9d
movq %r8, 0xc0(%rsp)
movq %r8, %rax
andq %rcx, %rax
movzbl (%rsi,%rax), %eax
addl %r9d, %eax
movq %rdi, %r8
andq %rcx, %r8
movq %r8, 0xf0(%rsp)
movzbl (%rsi,%r8), %r9d
movq %r12, 0x100(%rsp)
andq %rcx, %r12
movzbl (%rsi,%r12), %r8d
addl %r9d, %r8d
movq %r11, 0xf8(%rsp)
andq %rcx, %r11
movzbl (%rsi,%r11), %r11d
addl %r8d, %r11d
addl 0x10(%rsp), %r14d
addl %eax, %r14d
addl %r11d, %r14d
orl $-0x1, 0x14(%rsp)
cmpl $0x1, %r14d
jbe 0x39330
movq 0x40(%rsp), %r9
movl 0xc(%rsp), %r8d
movq 0x48(%rsp), %r11
movq 0x20(%rsp), %rsi
movq 0x18(%rsp), %r10
xorl %r14d, %r14d
movq (%rsp), %rcx
movl 0x28(%rsp), %r12d
jmp 0x39233
movl 0xc(%rsp), %r8d
movq 0x48(%rsp), %r11
movl 0x28(%rsp), %r12d
jne 0x39366
cmpl $-0x1, 0x90(%rsp)
je 0x39366
movq 0x90(%rsp), %rax
movl %eax, 0x14(%rsp)
movq 0x80(%rsp), %rcx
addl %ecx, %eax
jmp 0x39427
movb $-0x1, %al
cmpl $0x1, %r14d
jne 0x3943c
pushq $0x1f
popq %rax
movl %eax, %r9d
testl %edx, %edx
movq 0x110(%rsp), %rcx
jne 0x393bd
movq 0xf0(%rsp), %rax
movq %rax, 0xc8(%rsp)
pushq $0xf
popq %rax
movl %eax, %r9d
movq %r10, 0xc0(%rsp)
movq 0xf8(%rsp), %rcx
movq 0x100(%rsp), %rax
movq %rax, 0xb8(%rsp)
movq %rdi, %rdx
movq 0xb8(%rsp), %rdi
movl %edi, %eax
shll $0x8, %eax
movzwl %ax, %eax
leal -0x8(%r9), %esi
orq 0xc8(%rsp), %rax
cmovnel %r9d, %esi
movq 0xc0(%rsp), %rax
cmovneq %rdi, %rax
cmovneq %rdx, %rcx
leal -0x4(%rsi), %edx
testb %cl, %cl
cmovnel %esi, %edx
cmoveq %rax, %rcx
movl %ecx, %esi
shrl $0x4, %esi
leal -0x2(%rdx), %eax
testb $0xf, %cl
cmovnel %edx, %eax
cmovneq %rcx, %rsi
andl $0x3, %esi
cmpq $0x1, %rsi
sbbl $0x0, %eax
subl 0xe8(%rsp), %eax
movl %eax, 0x14(%rsp)
addl 0x80(%rsp), %eax
movl %eax, %eax
movq 0x60(%rsp), %rdx
movzbl (%rdx,%rax), %eax
leaq 0xe087(%rip), %rcx      # 0x474c0
movb (%rax,%rcx), %al
movb %al, 0x10(%rsp)
cmpq $0x0, 0x50(%rsp)
je 0x394b8
movq 0x80(%rsp), %r10
addl $0x20, %r10d
addq 0x60(%rsp), %r10
movq 0x108(%rsp), %rax
movq 0x8(%rax), %rdx
xorl %eax, %eax
movq 0x40(%rsp), %r9
leaq 0xe04d(%rip), %rcx      # 0x474c0
cmpq %rax, 0x50(%rsp)
je 0x394ad
movzbl (%r10,%rax), %esi
cmpl $0x4, %esi
je 0x394ff
movsbl 0x20(%rdx,%rax), %edi
cmpl %esi, %edi
je 0x394a8
incl %r14d
cmpl $0x1, %r14d
ja 0x394ad
leal 0x20(%rax), %edi
movl %edi, 0x14(%rsp)
movl %esi, %esi
movb (%rsi,%rcx), %sil
movb %sil, 0x10(%rsp)
incq %rax
jmp 0x39473
cmpq 0x50(%rsp), %rax
movq (%rsp), %rcx
jb 0x39520
movq 0x170(%rsp), %rdi
testq %rdi, %rdi
je 0x3957e
xorps %xmm0, %xmm0
movaps %xmm0, 0x30(%rsp)
movl 0xa8(%rsp), %ecx
movl %ecx, %eax
orq 0xe0(%rsp), %rax
cmpl 0x178(%rsp), %ecx
jae 0x39532
movq %rax, 0x30(%rsp)
movq 0xb0(%rsp), %rax
movq %rax, 0x38(%rsp)
jmp 0x39544
movq 0xd0(%rsp), %rcx
subq %rax, %rcx
addq 0x58(%rsp), %rax
movq (%rsp), %rdx
testb %dl, %dl
cmovneq %rcx, %r13
movq %rdx, %rcx
cmoveq %rax, %rbp
movq 0x20(%rsp), %rsi
movq 0x18(%rsp), %r10
xorl %r14d, %r14d
jmp 0x39233
movq %rax, 0x38(%rsp)
movq 0xb0(%rsp), %rax
movq %rax, 0x30(%rsp)
leaq 0x30(%rsp), %rsi
callq 0x2ea84
cmpq 0xd8(%rsp), %rax
je 0x3956c
movq 0x40(%rsp), %r9
movl 0xc(%rsp), %r8d
movq 0x48(%rsp), %r11
jmp 0x39222
movq 0x170(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x2eb18
movq 0x160(%rsp), %rdi
movq 0x18(%rdi), %rsi
incq %rsi
callq 0x2ea42
movq 0x160(%rsp), %rcx
imulq $0x60, 0x18(%rcx), %rax
movq 0x8(%rcx), %rcx
movl %r14d, -0x54(%rcx,%rax)
movl %r14d, -0x50(%rcx,%rax)
cmpl $0x1, %r14d
jne 0x395e0
addq %rax, %rcx
movq %rcx, %r14
leaq -0x48(%rcx), %rdi
leaq 0x14(%rsp), %rsi
callq 0x1bf46
addq $-0x28, %r14
movb 0x10(%rsp), %al
movb %al, 0x30(%rsp)
movq %r14, %rdi
leaq 0x30(%rsp), %rsi
callq 0x233ce
movq 0x168(%rsp), %rdi
leaq 0xac(%rsp), %rsi
callq 0x1bf46
decl 0xa4(%rsp)
movq 0x40(%rsp), %r9
movl 0xc(%rsp), %r8d
movq 0x48(%rsp), %r11
movq 0x20(%rsp), %rsi
movq 0x18(%rsp), %r10
movl $0x0, %r14d
movq (%rsp), %rcx
jne 0x39233
addq $0x118, %rsp            # imm = 0x118
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop