// File: /workspace/github_cpp_makefile_star2_O2/chhylp123[P]hifiasm/inter.cpp
// Function: mg_shortest_k(void*, asg_t const*, unsigned int, int, mg_path_dst_t*, int, int, int*)
mg_pathv_t *mg_shortest_k(void *km0, const asg_t *g, uint32_t src, int32_t n_dst, mg_path_dst_t *dst, int32_t max_dist, int32_t max_k, /** //pathint32_t ql, const char *qs, int is_rev, **/int32_t *n_pathv)
{
	sp_node_t *p, *root = 0, **out;
	sp_topk_t *q;
	khash_t(sp) *h;
	khash_t(sp2) *h2;
	void *km;
	khint_t k;
	int absent;
	int32_t i, j, n_done, n_found;
	uint32_t id, n_out, m_out;
	int8_t *dst_done;
	mg_pathv_t *ret = 0;
	uint64_t *dst_group;
	/** //path
	int32_t n_seeds = 0;
	uint64_t *seeds = 0;
	void *h_seeds = 0; 
	mg128_v mini = {0,0,0}; 
	**/

	if (n_pathv) *n_pathv = 0;///for us, n_pathv = NULL
	if (n_dst <= 0) return 0;///n_dst: how many candidate nodes
	for (i = 0; i < n_dst; ++i) { // initialize
		mg_path_dst_t *t = &dst[i];
		///if src and dest are at the same ref id, there are already one path
		if (t->inner)///if two chains are at the same ref id
			t->dist = 0, t->n_path = 1, t->path_end = -1;
		else
			t->dist = -1, t->n_path = 0, t->path_end = -1;
	}
	if (max_k > MG_MAX_SHORT_K) max_k = MG_MAX_SHORT_K;
	km = km_init2(km0, 0x4000);

	/** //path
	///for the first time, we just check th reachability without sequence (qs);
	///but for the second round, we need to check sequence
	///qs is the sequence between two minimizers
	if (ql > 0 && qs) { // build the seed hash table for the query
		mg_sketch(km, qs, ql, MG_SHORT_KW, MG_SHORT_KK, 0, &mini);
		// mini->a[].x = hash_key<<8 | kmerSpan
		// mini->a[].y = rid<<32 | lastPos<<1 | strand
		if (is_rev)///is_rev = 1;
			for (i = 0; i < mini.n; ++i)///reverse qs[0, ql) to qs(ql, 0]
				mini.a[i].y = (ql - (((int32_t)mini.a[i].y>>1) + 1 - MG_SHORT_KK) - 1) << 1 | ((mini.a[i].y&1)^1);
		///h_seeds is the ordinary hash index
		h_seeds = mg_idx_a2h(km, mini.n, mini.a, 0, &seeds, &n_seeds);
		///h_seeds+seeds+n_seeds ----> hash index of qs[0, ql)
	}
	**/
	///dst is how many candidates
	KCALLOC(km, dst_done, n_dst);
	KMALLOC(km, dst_group, n_dst);
	// multiple dst[] may have the same dst[].v. We need to group them first.
	// in other words, one ref id may have multiple dst alignment chains
	for (i = 0; i < n_dst; ++i) 
		dst_group[i] = (uint64_t)dst[i].v<<32 | i;
	radix_sort_gfa64(dst_group, dst_group + n_dst);

	h2 = kh_init2(sp2, km); // (h2+dst_group) keeps all destinations from the same ref id
	kh_resize(sp2, h2, n_dst * 2);
	///please note that one contig in ref may have multiple alignment chains
	///so h2 is a index that helps us to query it
	///key(h2) = ref id; value(h2) = start_idx | occ
	for (i = 1, j = 0; i <= n_dst; ++i) {
		if (i == n_dst || dst_group[i]>>32 != dst_group[j]>>32) {
			k = kh_put(sp2, h2, dst_group[j]>>32, &absent);
			kh_val(h2, k) = (uint64_t)j << 32 | (i - j);
			assert(absent);
			j = i;
		}
	}

	

	h = kh_init2(sp, km); // h keeps visited vertices; path to each visited vertice
	kh_resize(sp, h, 16);

	m_out = 16, n_out = 0;///16 is just the initial size
	KMALLOC(km, out, m_out);
	
	/**
	typedef struct {
		int32_t k, mlen;//k: number of walks from src to this node
		int32_t qs, qe;
		sp_node_t *p[MG_MAX_SHORT_K]; // this forms a max-heap; all path
	} sp_topk_t;
	**/
	id = 0;
	p = gen_sp_node(km, src, 0, id++);///just malloc a node for src; the distance is 0
	p->hash = __ac_Wang_hash(src);///hash is path hash, instead of node hash
	kavl_insert(sp, &root, p, 0);///should be avl tree
	///each src corresponds to one node in the hash table <h>, but corresponds to <MG_MAX_SHORT_K> node in the AVL tree <root> 
	k = kh_put(sp, h, src, &absent);///here is a hash table
	q = &kh_val(h, k);
	///for normal graph traversal, one node just has one parental node; here each node has at most 16 parental nodes
	q->k = 1, q->p[0] = p, q->mlen = 0, q->qs = q->qe = -1;

	n_done = 0;
	///the key of avl tree: #define sp_node_cmp(a, b) (((a)->di > (b)->di) - ((a)->di < (b)->di))
	///the higher bits of (*)->di is distance to src node
	///so the key of avl tree is distance
	///in avl tree <root>, one node might be saved multipe times
	while (kavl_size(head, root) > 0) {///thr first root is src
		int32_t i, nv;
		asg_arc_t *av;
		sp_node_t *r;
		///note that one (sp_node_t->v) might be visited multiple times if there are circles
		///so there might be multipe nodes with the same (sp_node_t->v)
		///delete the first node
		r = kavl_erase_first(sp, &root); // take out the closest vertex in the heap (as a binary tree)
		//fprintf(stderr, "XX\t%d\t%d\t%d\t%c%s[%d]\t%d\n", n_out, kavl_size(head, root), n_finished, "><"[(r->v&1)^1], g->seg[r->v>>1].name, r->v, (int32_t)(r->di>>32));
		if (n_out == m_out) KEXPAND(km, out, m_out);
		///higher 32 bits might be the distance to root node
		// lower 32 bits now for position in the out[] array
		r->di = r->di>>32<<32 | n_out; ///n_out is just the id in out
		///so one node id in graph might be saved multiple times in avl tree and out[]
		out[n_out++] = r;///out[0] = src

		///r->v is the dst vertex id
		///sometimes k==kh_end(h2). Some nodes are found by graph travesal but not in linear chain alignment
		k = kh_get(sp2, h2, r->v);
		// we have reached one dst vertex
		// note that one dst vertex may have multipe alignment chains
		// we can visit some nodes in graph which are not reachable during chaining
		// h2 is used to determine if one node is reachable or not
		if (k != kh_end(h2)) { 
			///node r->v might be visited multiple times
			int32_t j, dist = r->di>>32, off = kh_val(h2, k) >> 32, cnt = (int32_t)kh_val(h2, k);
			//src can reach ref id r->v; there might be not only one alignment chain in r->v
			//so we need to scan all of them
			for (j = 0; j < cnt; ++j) {
				mg_path_dst_t *t = &dst[(int32_t)dst_group[off + j]];///t is a linear alignment at r->v
				int32_t done = 0;
				///the src and dest are at the same ref id, say we directly find the shortest path
				if (t->inner) {//usually the first node, which is same to src
					done = 1;
				} else {
					int32_t mlen = 0, copy = 0;
					///in the first round, we just check reachability without sequence
					///so h_seeds = NULL; we can assume mlen = 0
					/** //path
					mlen = h_seeds? path_mlen(out, n_out - 1, h, t->qlen) : 0;
					**/
					//if (mg_dbg_flag & MG_DBG_GC1) fprintf(stderr, "  src=%c%s[%d],qlen=%d\tdst=%c%s[%d]\ttarget_distx=%d,target_hash=%x\tdistx=%d,mlen=%d,hash=%x\n", "><"[src&1], g->seg[src>>1].name, src, ql, "><"[t->v&1], g->seg[t->v>>1].name, t->v, t->target_dist - g->seg[src>>1].len, t->target_hash, dist - g->seg[src>>1].len, mlen, r->hash);
					// note: t indicates a linear alignmnet, instead of a node in graph
					///target_dist should be the distance on query
					if (t->n_path == 0) { // means this alignment has never been visited before; keep the shortest path anyway
						copy = 1;
					 // we have a target distance; choose the closest; 
					 // there is already several paths reaching the linear alignment <t>
					} else if (t->target_dist >= 0) { 
						// we found the target path; hash is the path hash including multiple nodes, instead of node hash 
						if (dist == t->target_dist && t->check_hash && r->hash == t->target_hash) { 
							copy = 1, done = 1;
						} else {
							int32_t d0 = t->dist, d1 = dist;
							d0 = d0 > t->target_dist? d0 - t->target_dist : t->target_dist - d0;
							d1 = d1 > t->target_dist? d1 - t->target_dist : t->target_dist - d1;
							///if the new distance (d1) is smaller than the old distance (d0), update the results
							///the length of new path should be closer to t->target_dist
							if (d1 - mlen/2 < d0 - t->mlen/2) copy = 1;
						}
					}
					if (copy) {
						t->path_end = n_out - 1, t->dist = dist, t->hash = r->hash, t->mlen = mlen, t->is_0 = r->is_0;
						if (t->target_dist >= 0) {
							///src is from li from li to lj, so the dis is generally increased; dijkstra algorithm
							///target_dist should be the distance on query
							if (dist == t->target_dist && t->check_hash && r->hash == t->target_hash) done = 1;
							else if ((dist > t->target_dist + MG_SHORT_K_EXT) && (dist > (t->target_dist>>4))) done = 1;
						}
					}
					++t->n_path;///we found a path to the alignment t
					if (t->n_path >= max_k) done = 1;
				}
				if (dst_done[off + j] == 0 && done)
					dst_done[off + j] = 1, ++n_done;
			}
			///if all alignments have been settle down
			///pre-end; accelerate the loop
			if (n_done == n_dst) break;
		}

		///below is used to push new nodes to avl tree for iteration
		nv = asg_arc_n(g, r->v);
		av = asg_arc_a(g, r->v);
		for (i = 0; i < nv; ++i) { // visit all neighbors
			asg_arc_t *ai = &av[i];
			///v_lv is the (dest_length - overlap_length); it is a normal path length in string graph
			///ai->v_lv is the path length from r->v to ai->w
			///(r->di>>32)
			int32_t d = (r->di>>32) + (uint32_t)ai->ul;
			if (d > max_dist) continue; // don't probe vertices too far away
			// h keeps visited vertices; path to each visited vertice
			///ai->w is the dest ref id; we insert a new ref id, instead of an alignment chain
			k = kh_put(sp, h, ai->v, &absent);///one node might be visited multiple times
			q = &kh_val(h, k);
			if (absent) { // a new vertex visited
				///q->k: number of walks from src to ai->w
				q->k = 0, q->qs = q->qe = -1; q->mlen = 0;
				///h_seeds = NULL; so q->mlen = 0
				/** //path
				q->mlen = h_seeds && d + gfa_arc_lw(g, *ai) <= max_dist? node_mlen(km, g, ai->w, &mini, h_seeds, n_seeds, seeds, &q->qs, &q->qe) : 0;
				**/
				//if (ql && qs) fprintf(stderr, "ql=%d,src=%d\tv=%c%s[%d],n_seeds=%d,mlen=%d\n", ql, src, "><"[ai->w&1], g->seg[ai->w>>1].name, ai->w, n_seeds, q->mlen);
			}
			///if there are less than <max_k> walks from src to ai->w, directly add
			///if there are more, keep the smallest <max_k> walks
			if (q->k < max_k) { // enough room: add to the heap
				p = gen_sp_node(km, ai->v, d, id++);
				p->pre = n_out - 1;///the parent node of this one 
				p->hash = r->hash + __ac_Wang_hash(ai->v);
				p->is_0 = r->is_0;
				/** //path
				if (ai->rank > 0) p->is_0 = 0;
				**/
				kavl_insert(sp, &root, p, 0);
				q->p[q->k++] = p;
				ks_heapup_sp(q->k, q->p);///adjust heap by distance
			} else if ((int32_t)(q->p[0]->di>>32) > d) { // shorter than the longest path so far: replace the longest
				p = kavl_erase(sp, &root, q->p[0], 0);
				if (p) {
					p->di = (uint64_t)d<<32 | (id++);
					p->pre = n_out - 1;
					p->hash = r->hash + __ac_Wang_hash(ai->v);
					p->is_0 = r->is_0;
					/** //path
					if (ai->rank > 0) p->is_0 = 0;
					**/
					kavl_insert(sp, &root, p, 0);
					ks_heapdown_sp(0, q->k, q->p);
				} else {
					fprintf(stderr, "Warning: logical bug in gfa_shortest_k(): q->k=%d,q->p[0]->{d,i}={%d,%d},d=%d,src=%u,max_dist=%d,n_dst=%d\n", q->k, (int32_t)(q->p[0]->di>>32), (int32_t)q->p[0]->di, d, src, max_dist, n_dst);
					km_destroy(km);
					return 0;
				}
			} // else: the path is longer than all the existing paths ended at ai->w
		}
	}

	kfree(km, dst_group);
	kfree(km, dst_done);
	kh_destroy(sp, h);
	/** //path
	mg_idx_hfree(h_seeds);
	kfree(km, seeds);
	kfree(km, mini.a);
	**/
	// NB: AVL nodes are not deallocated. When km==0, they are memory leaks.

	for (i = 0, n_found = 0; i < n_dst; ++i)
		if (dst[i].n_path > 0) ++n_found;///n_path might be larger than 16
	///we can assume n_pathv = NULL for now 
	if (n_found > 0 && n_pathv) { // then generate the backtrack array
		int32_t n, *trans;
		///n_out: how many times that nodes in graph have been visited 
		///note one node might be visited multiples times
		KCALLOC(km, trans, n_out); // used to squeeze unused elements in out[]
		///n_dst: number of alignment chains
		for (i = 0; i < n_dst; ++i) { // mark dst vertices with a target distance
			mg_path_dst_t *t = &dst[i];
			if (t->n_path > 0 && t->target_dist >= 0 && t->path_end >= 0)
				trans[(int32_t)out[t->path_end]->di] = 1;///(int32_t)out[]->di: traverse track corresponds to the alignment chain dst[]
		}
		for (i = 0; (uint32_t)i < n_out; ++i) { // mark dst vertices without a target distance
			k = kh_get(sp2, h2, out[i]->v);
			if (k != kh_end(h2)) { // TODO: check if this is correct!
				int32_t off = kh_val(h2, k)>>32, cnt = (int32_t)kh_val(h2, k);
				for (j = off; j < off + cnt; ++j)
					if (dst[j].target_dist < 0)
						trans[i] = 1;
			}
		}
		for (i = n_out - 1; i >= 0; --i) // mark all predecessors
			if (trans[i] && out[i]->pre >= 0)
				trans[out[i]->pre] = 1;
		for (i = n = 0; (uint32_t)i < n_out; ++i) // generate coordinate translations
			if (trans[i]) trans[i] = n++;
			else trans[i] = -1;

		*n_pathv = n;
		KMALLOC(km0, ret, n);
		for (i = 0; (uint32_t)i < n_out; ++i) { // generate the backtrack array
			mg_pathv_t *p;
			if (trans[i] < 0) continue;
			p = &ret[trans[i]];
			p->v = out[i]->v, p->d = out[i]->di >> 32;
			p->pre = out[i]->pre < 0? out[i]->pre : trans[out[i]->pre];
		}
		for (i = 0; i < n_dst; ++i) // translate "path_end"
			if (dst[i].path_end >= 0)
				dst[i].path_end = trans[dst[i].path_end];
	}

	km_destroy(km);
	return ret;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %r8, %r12
movl %ecx, %r13d
movq %rdx, 0x88(%rsp)
movq %rsi, 0xb0(%rsp)
movq 0xf8(%rsp), %rax
andq $0x0, 0x40(%rsp)
testq %rax, %rax
je 0x15bd0d
andl $0x0, (%rax)
testl %r13d, %r13d
jle 0x15c3ab
movq %r9, 0x68(%rsp)
movl %r13d, %ecx
movl 0xf0(%rsp), %ebx
movq %rcx, 0x30(%rsp)
imulq $0x30, %rcx, %rax
xorl %ecx, %ecx
movl $0x80000000, %edx       # imm = 0x80000000
cmpq %rcx, %rax
je 0x15bd71
cmpl $0x0, 0xc(%r12,%rcx)
js 0x15bd51
orl $-0x1, 0x1c(%r12,%rcx)
movl 0x14(%r12,%rcx), %esi
andl %edx, %esi
jmp 0x15bd60
andl $0x0, 0x1c(%r12,%rcx)
movl 0x14(%r12,%rcx), %esi
andl %edx, %esi
incl %esi
movl %esi, 0x14(%r12,%rcx)
orl $-0x1, 0x18(%r12,%rcx)
addq $0x30, %rcx
jmp 0x15bd35
movl $0x4000, %esi           # imm = 0x4000
movq %rdi, 0xa8(%rsp)
callq 0x1a3818
movq %rax, %r15
pushq $0x1
popq %r14
movq %rax, %rdi
movq 0x30(%rsp), %rbp
movq %rbp, %rsi
movq %r14, %rdx
callq 0x1a3848
movq %rax, 0x90(%rsp)
leaq (,%rbp,8), %rsi
movq %r15, 0x20(%rsp)
movq %r15, %rdi
callq 0x1a39c4
movq %rax, %rdi
xorl %eax, %eax
movq %r12, %rcx
cmpq %rax, 0x30(%rsp)
je 0x15bddf
movl (%rcx), %edx
shlq $0x20, %rdx
addq %rax, %rdx
movq %rdx, (%rdi,%rax,8)
incq %rax
addq $0x30, %rcx
jmp 0x15bdc2
cmpl $0xf, %ebx
pushq $0xf
popq %rax
cmovll %ebx, %eax
movl %eax, 0x64(%rsp)
movq 0x30(%rsp), %rax
leaq (%rdi,%rax,8), %rsi
movq %rdi, 0x48(%rsp)
movq 0x48(%rsp), %rdi
callq 0x156b0d
movq 0x20(%rsp), %rdi
callq 0x15c666
movq %rax, 0x50(%rsp)
leal (,%r13,2), %esi
movq %rax, %rdi
callq 0x15c67b
movq 0x48(%rsp), %rcx
movq %r13, 0xa0(%rsp)
leal 0x1(%r13), %ebx
xorl %ebp, %ebp
leaq 0xc(%rsp), %r15
movq %r12, 0x38(%rsp)
movq 0x50(%rsp), %r13
cmpq %r14, %rbx
je 0x15beba
cmpq %r14, 0x30(%rsp)
jne 0x15be5a
movslq %ebp, %r12
movq (%rcx,%r12,8), %rsi
jmp 0x15be75
movslq %ebp, %r12
movq (%rcx,%r12,8), %rsi
movq (%rcx,%r14,8), %rax
xorq %rsi, %rax
shrq $0x20, %rax
jne 0x15be75
movq 0x38(%rsp), %r12
jmp 0x15beb5
shrq $0x20, %rsi
movq %r13, %rdi
movq %r15, %rdx
callq 0x15c8ff
shlq $0x20, %r12
movl %r14d, %ecx
subl %ebp, %ecx
movslq %ecx, %rcx
orq %r12, %rcx
movq 0x20(%r13), %rdx
movl %eax, %eax
movq %rcx, (%rdx,%rax,8)
cmpl $0x0, 0xc(%rsp)
je 0x15c647
movl %r14d, %ebp
movq 0x38(%rsp), %r12
movq 0x48(%rsp), %rcx
incq %r14
jmp 0x15be45
movq 0x20(%rsp), %rbx
movq %rbx, %rdi
callq 0x15ca61
movq %rax, %r15
pushq $0x10
popq %rbp
movq %rax, %rdi
movl %ebp, %esi
callq 0x15ca76
movl $0x80, %esi
movq %rbx, %rdi
callq 0x1a39c4
movq %rax, 0x28(%rsp)
movq $0x0, 0x10(%rsp)
movq %rbx, %rdi
movq 0x88(%rsp), %r14
movl %r14d, %esi
xorl %edx, %edx
xorl %ecx, %ecx
callq 0x15cda2
movq %rax, %rbx
movl %r14d, %edi
callq 0x15cdd5
movl %eax, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rbx, %rsi
xorl %edx, %edx
callq 0x159bf9
leaq 0xc(%rsp), %rdx
movq %r15, %rdi
movl %r14d, %esi
callq 0x15ce00
movq %r15, 0x98(%rsp)
movq 0x20(%r15), %rcx
movl %eax, %eax
imulq $0x88, %rax, %rax
movq %rbx, 0x10(%rcx,%rax)
movaps 0x911b9(%rip), %xmm0    # 0x1ed110
movups %xmm0, (%rcx,%rax)
pushq $0x1
popq %rax
movl %ebp, 0x58(%rsp)
movq %rax, 0x70(%rsp)
movl $0x0, 0x60(%rsp)
movq 0x40(%rsp), %rax
testq %rax, %rax
je 0x15c3bc
cmpl $0x0, 0x2c(%rax)
je 0x15c3bc
leaq 0x40(%rsp), %rdi
xorl %esi, %esi
xorl %edx, %edx
callq 0x159e78
movq %rax, 0x18(%rsp)
movl 0x58(%rsp), %eax
cmpl %eax, 0x10(%rsp)
jne 0x15bfd0
movl %eax, %ebx
shrl %ebx
addl %eax, %ebx
cmpl $0x4, %eax
pushq $0x10
popq %rax
cmovbl %eax, %ebx
leaq (,%rbx,8), %rdx
movq 0x20(%rsp), %rdi
movq 0x28(%rsp), %rsi
callq 0x1a3acc
movl %ebx, 0x58(%rsp)
jmp 0x15bfd5
movq 0x28(%rsp), %rax
movq 0x50(%rsp), %rdi
movq 0x18(%rsp), %rsi
movq (%rsi), %r14
movq 0x10(%rsp), %rdx
movl %edx, %ecx
movl %edx, (%rsi)
incl %edx
movl %edx, 0x5c(%rsp)
movq %rax, 0x28(%rsp)
movq %rsi, (%rax,%rcx,8)
movl 0x8(%rsi), %ebx
movl %ebx, %esi
callq 0x15cf62
movq 0x50(%rsp), %rcx
cmpl (%rcx), %eax
je 0x15c1c1
shrq $0x20, %r14
movq 0x20(%rcx), %rcx
movl %eax, %eax
movq (%rcx,%rax,8), %rax
movq %rax, %rcx
sarq $0x20, %rcx
testl %eax, %eax
movl $0x0, %esi
cmovgl %eax, %esi
movq 0x48(%rsp), %rax
leaq (%rax,%rcx,8), %rdi
addq 0x90(%rsp), %rcx
xorl %r8d, %r8d
cmpq %r8, %rsi
je 0x15c1ab
movslq (%rdi,%r8,8), %rax
imulq $0x30, %rax, %r9
movl 0xc(%r12,%r9), %r11d
testl %r11d, %r11d
js 0x15c0e5
addq %r12, %r9
movl 0x4(%r9), %ebp
movl 0x14(%r9), %r10d
movl %r10d, %ebx
andl $0x7fffffff, %ebx       # imm = 0x7FFFFFFF
je 0x15c0ec
testl %ebp, %ebp
js 0x15c166
cmpl $0x40000000, %r11d      # imm = 0x40000000
jb 0x15c0a3
cmpl %r14d, %ebp
jne 0x15c0a3
movq 0x18(%rsp), %rax
movl 0x10(%rax), %eax
movl %r14d, %r15d
pushq $0x1
popq %rdx
cmpl 0x8(%r9), %eax
je 0x15c0f1
movl 0x1c(%r9), %edx
movl 0x20(%r9), %eax
subl %ebp, %edx
movl %edx, %r15d
negl %r15d
cmovsl %edx, %r15d
movl %ebp, %edx
subl %r14d, %edx
movl %edx, %r12d
negl %r12d
cmovsl %edx, %r12d
cltd
pushq $-0x2
popq %r13
idivl %r13d
addl %r15d, %eax
xorl %edx, %edx
movl %ebp, %r15d
cmpl %eax, %r12d
movq 0x38(%rsp), %r12
jl 0x15c0f1
jmp 0x15c168
movb $0x1, %al
jmp 0x15c18f
xorl %edx, %edx
movl %ebp, %r15d
movq 0x10(%rsp), %rax
movl %eax, 0x18(%r9)
movl %r14d, 0x1c(%r9)
movq 0x18(%rsp), %r10
movl 0x10(%r10), %eax
movl %eax, 0x24(%r9)
andl $0x0, 0x20(%r9)
movl 0x14(%r10), %r10d
shll $0x1f, %r10d
orl %ebx, %r10d
movl %r10d, 0x14(%r9)
testl %r15d, %r15d
js 0x15c168
cmpl $0x40000000, %r11d      # imm = 0x40000000
jb 0x15c145
cmpl %r14d, %r15d
jne 0x15c145
movq 0x18(%rsp), %rax
movl 0x10(%rax), %eax
cmpl 0x8(%r9), %eax
jne 0x15c145
pushq $0x1
popq %rdx
jmp 0x15c168
leal 0x2710(%r15), %eax
shrl $0x4, %r15d
cmpl %r14d, %r15d
movl %edx, %r11d
pushq $0x1
popq %rbx
cmovll %ebx, %r11d
cmpl %r14d, %eax
cmovll %r11d, %edx
jmp 0x15c168
xorl %edx, %edx
leal 0x1(%r10), %eax
andl $0x7fffffff, %eax       # imm = 0x7FFFFFFF
andl $0x80000000, %r10d      # imm = 0x80000000
orl %eax, %r10d
movl %r10d, 0x14(%r9)
cmpl 0x64(%rsp), %eax
setge %r9b
testl %edx, %edx
setne %al
orb %r9b, %al
testb %al, %al
je 0x15c1a3
cmpb $0x0, (%rcx,%r8)
jne 0x15c1a3
movb $0x1, (%rcx,%r8)
incl 0x60(%rsp)
incq %r8
jmp 0x15c044
movl 0x60(%rsp), %eax
cmpl 0x30(%rsp), %eax
je 0x15c3b3
movq 0x18(%rsp), %rax
movl 0x8(%rax), %ebx
movq 0xb0(%rsp), %rcx
movq 0x8(%rcx), %rax
movq 0x28(%rcx), %rcx
movl %ebx, %edx
movq (%rcx,%rdx,8), %rcx
movq %rcx, %rdx
shrq $0x20, %rdx
testl %ecx, %ecx
movl $0x0, %esi
cmovgl %ecx, %esi
imulq $0x18, %rsi, %rsi
imulq $0x18, %rdx, %rcx
leaq (%rax,%rcx), %r12
addq $0x8, %r12
xorl %ebp, %ebp
movq 0x68(%rsp), %rbx
movq %rsi, 0x80(%rsp)
cmpq %rbp, %rsi
je 0x15c398
movq 0x18(%rsp), %rax
movl 0x4(%rax), %r14d
addq -0x8(%r12,%rbp), %r14
cmpl %ebx, %r14d
jg 0x15c38f
movl (%r12,%rbp), %esi
movq 0x98(%rsp), %r15
movq %r15, %rdi
leaq 0xc(%rsp), %rdx
callq 0x15ce00
movl %eax, %eax
imulq $0x88, %rax, %r13
addq 0x20(%r15), %r13
cmpl $0x0, 0xc(%rsp)
je 0x15c264
movaps 0x95735(%rip), %xmm0    # 0x1f1990
movups %xmm0, (%r13)
xorl %eax, %eax
jmp 0x15c268
movl (%r13), %eax
cmpl 0x64(%rsp), %eax
jge 0x15c2f5
movl (%r12,%rbp), %esi
movq 0x70(%rsp), %rcx
leal 0x1(%rcx), %eax
movl %eax, 0x78(%rsp)
movq 0x20(%rsp), %rdi
movl %r14d, %edx
callq 0x15cda2
movq %rax, %rbx
movq 0x10(%rsp), %rax
movl %eax, 0xc(%rbx)
movq 0x18(%rsp), %r15
movl 0x10(%r15), %r14d
movl (%r12,%rbp), %edi
callq 0x15cdd5
addl %r14d, %eax
movl %eax, 0x10(%rbx)
movl 0x14(%r15), %eax
movl %eax, 0x14(%rbx)
leaq 0x40(%rsp), %rdi
movq %rbx, %rsi
xorl %edx, %edx
callq 0x159bf9
leaq 0x10(%r13), %rsi
movslq (%r13), %rax
leaq 0x1(%rax), %rdi
movl %edi, (%r13)
movq %rbx, 0x10(%r13,%rax,8)
movq 0x68(%rsp), %rbx
callq 0x15a2cc
movl 0x78(%rsp), %eax
movq %rax, 0x70(%rsp)
jmp 0x15c387
movq 0x10(%r13), %rsi
cmpl %r14d, 0x4(%rsi)
jle 0x15c387
leaq 0x40(%rsp), %rdi
xorl %edx, %edx
callq 0x159e78
testq %rax, %rax
je 0x15c5de
movq %rax, %rbx
leaq 0x10(%r13), %rax
movq %rax, 0x78(%rsp)
shlq $0x20, %r14
movq 0x70(%rsp), %rcx
movl %ecx, %eax
incl %ecx
movq %rcx, 0x70(%rsp)
orq %r14, %rax
movq %rax, (%rbx)
movq 0x10(%rsp), %rax
movl %eax, 0xc(%rbx)
movq 0x18(%rsp), %r15
movl 0x10(%r15), %r14d
movl (%r12,%rbp), %edi
callq 0x15cdd5
addl %r14d, %eax
movl %eax, 0x10(%rbx)
movl 0x14(%r15), %eax
movl %eax, 0x14(%rbx)
leaq 0x40(%rsp), %rdi
movq %rbx, %rsi
xorl %edx, %edx
callq 0x159bf9
movslq (%r13), %rsi
xorl %edi, %edi
movq 0x78(%rsp), %rdx
callq 0x15a27c
movq 0x68(%rsp), %rbx
movq 0x80(%rsp), %rsi
addq $0x18, %rbp
jmp 0x15c207
movl 0x5c(%rsp), %eax
movq %rax, 0x10(%rsp)
movq 0x38(%rsp), %r12
jmp 0x15bf6f
xorl %r12d, %r12d
jmp 0x15c632
movl 0x5c(%rsp), %eax
movq %rax, 0x10(%rsp)
movq 0x20(%rsp), %rbx
movq %rbx, %rdi
movq 0x48(%rsp), %rsi
callq 0x1a38cf
movq %rbx, %rdi
movq 0x90(%rsp), %rsi
callq 0x1a38cf
movq 0x98(%rsp), %rdi
callq 0x15cfd3
imulq $0x30, 0x30(%rsp), %rbx
xorl %ecx, %ecx
movl $0x7fffffff, %edx       # imm = 0x7FFFFFFF
xorl %eax, %eax
cmpq %rcx, %rbx
je 0x15c412
movl 0x14(%r12,%rcx), %esi
andl %edx, %esi
cmpl $0x1, %esi
sbbl $-0x1, %eax
addq $0x30, %rcx
jmp 0x15c3fa
xorl %r12d, %r12d
cmpq $0x0, 0xf8(%rsp)
je 0x15c628
testl %eax, %eax
je 0x15c628
movl 0x10(%rsp), %r15d
pushq $0x4
popq %rdx
movq 0x20(%rsp), %rdi
movq %r15, %rsi
callq 0x1a3848
movq %rax, %r14
xorl %eax, %eax
movq 0x38(%rsp), %rdx
movq 0x28(%rsp), %rsi
cmpq %rax, %rbx
je 0x15c485
testl $0x7fffffff, 0x14(%rdx,%rax) # imm = 0x7FFFFFFF
je 0x15c47f
cmpl $0x0, 0x4(%rdx,%rax)
js 0x15c47f
movslq 0x18(%rdx,%rax), %rcx
testq %rcx, %rcx
js 0x15c47f
movq (%rsi,%rcx,8), %rcx
movslq (%rcx), %rcx
movl $0x1, (%r14,%rcx,4)
addq $0x30, %rax
jmp 0x15c450
leaq 0x4(%rdx), %r12
xorl %r13d, %r13d
movq 0x50(%rsp), %rbp
cmpq %r15, %r13
je 0x15c4f9
movq (%rsi,%r13,8), %rax
movl 0x8(%rax), %esi
movq %rbp, %rdi
callq 0x15cf62
cmpl (%rbp), %eax
jne 0x15c4b4
incq %r13
movq 0x28(%rsp), %rsi
jmp 0x15c491
movq 0x20(%rbp), %rcx
movl %eax, %eax
movq (%rcx,%rax,8), %rax
movq %rax, %rcx
sarq $0x20, %rcx
movabsq $0x100000001, %rdx      # imm = 0x100000001
imulq %rdx, %rax
sarq $0x20, %rax
imulq $0x30, %rcx, %rdx
addq %r12, %rdx
cmpq %rax, %rcx
jge 0x15c4aa
cmpl $0x0, (%rdx)
jns 0x15c4f0
movl $0x1, (%r14,%r13,4)
incq %rcx
addq $0x30, %rdx
jmp 0x15c4de
leaq -0x1(%r15), %rax
testl %eax, %eax
js 0x15c52a
movl %eax, %ecx
andl $0x7fffffff, %ecx       # imm = 0x7FFFFFFF
cmpl $0x0, (%r14,%rcx,4)
je 0x15c525
movq (%rsi,%rcx,8), %rcx
movslq 0xc(%rcx), %rcx
testq %rcx, %rcx
js 0x15c525
movl $0x1, (%r14,%rcx,4)
decq %rax
jmp 0x15c4fd
xorl %eax, %eax
xorl %ecx, %ecx
cmpq %rax, %r15
je 0x15c556
movl (%r14,%rax,4), %edx
cmpl $0x1, %edx
movl $0x0, %esi
sbbl %esi, %esi
cmpl $0x1, %edx
movl %ecx, %edx
sbbl $-0x1, %edx
orl %ecx, %esi
movl %esi, (%r14,%rax,4)
incq %rax
movl %edx, %ecx
jmp 0x15c52e
movq 0xf8(%rsp), %rax
movl %ecx, (%rax)
movl %ecx, %eax
imulq $0xc, %rax, %rsi
movq 0xa8(%rsp), %rdi
callq 0x1a39c4
movq 0x28(%rsp), %rdi
movq %rax, %r12
xorl %eax, %eax
cmpq %rax, %r15
je 0x15c5ba
movslq (%r14,%rax,4), %rcx
testq %rcx, %rcx
js 0x15c5b5
imulq $0xc, %rcx, %rcx
movq (%rdi,%rax,8), %rdx
movl 0x8(%rdx), %esi
movl %esi, (%r12,%rcx)
movl 0x4(%rdx), %esi
movl %esi, 0x4(%r12,%rcx)
movslq 0xc(%rdx), %rdx
testq %rdx, %rdx
js 0x15c5af
movl (%r14,%rdx,4), %edx
addq %r12, %rcx
movl %edx, 0x8(%rcx)
incq %rax
jmp 0x15c57d
xorl %eax, %eax
movq 0x38(%rsp), %rdx
cmpq %rax, %rbx
je 0x15c628
movslq 0x18(%rdx,%rax), %rcx
testq %rcx, %rcx
js 0x15c5d8
movl (%r14,%rcx,4), %ecx
movl %ecx, 0x18(%rdx,%rax)
addq $0x30, %rax
jmp 0x15c5c1
movq 0xf69fb(%rip), %rax     # 0x252fe0
movq (%rax), %rdi
movl (%r13), %edx
movq 0x10(%r13), %rax
movq (%rax), %r8
movq %r8, %rcx
shrq $0x20, %rcx
subq $0x8, %rsp
leaq 0x9568e(%rip), %rsi     # 0x1f1c93
xorl %r12d, %r12d
movl %r14d, %r9d
xorl %eax, %eax
pushq 0xa8(%rsp)
pushq 0x78(%rsp)
pushq 0xa0(%rsp)
callq 0x22b0
addq $0x20, %rsp
movq 0x20(%rsp), %rdi
callq 0x1a3894
movq %r12, %rax
addq $0xb8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x955cc(%rip), %rdi     # 0x1f1c1a
leaq 0x954ce(%rip), %rsi     # 0x1f1b23
leaq 0x955c5(%rip), %rcx     # 0x1f1c21
movl $0x453, %edx            # imm = 0x453
callq 0x2110