// File: 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
movq %rsp, %rbp
subq $0x170, %rsp            # imm = 0x170
movq 0x18(%rbp), %rax
movl 0x10(%rbp), %eax
movq %rdi, -0x10(%rbp)
movq %rsi, -0x18(%rbp)
movl %edx, -0x1c(%rbp)
movl %ecx, -0x20(%rbp)
movq %r8, -0x28(%rbp)
movl %r9d, -0x2c(%rbp)
movq $0x0, -0x40(%rbp)
movq $0x0, -0xa0(%rbp)
cmpq $0x0, 0x18(%rbp)
je 0x284fdc
movq 0x18(%rbp), %rax
movl $0x0, (%rax)
cmpl $0x0, -0x20(%rbp)
jg 0x284fef
movq $0x0, -0x8(%rbp)
jmp 0x286044
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jge 0x2850a0
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0xb0(%rbp)
movq -0xb0(%rbp), %rax
movl 0xc(%rax), %eax
shrl $0x1f, %eax
cmpl $0x0, %eax
je 0x28505e
movq -0xb0(%rbp), %rax
movl $0x0, 0x1c(%rax)
movq -0xb0(%rbp), %rax
movl 0x14(%rax), %ecx
andl $0x80000000, %ecx       # imm = 0x80000000
orl $0x1, %ecx
movl %ecx, 0x14(%rax)
movq -0xb0(%rbp), %rax
movl $0xffffffff, 0x18(%rax) # imm = 0xFFFFFFFF
jmp 0x285090
movq -0xb0(%rbp), %rax
movl $0xffffffff, 0x1c(%rax) # imm = 0xFFFFFFFF
movq -0xb0(%rbp), %rax
movl 0x14(%rax), %ecx
andl $0x80000000, %ecx       # imm = 0x80000000
orl $0x0, %ecx
movl %ecx, 0x14(%rax)
movq -0xb0(%rbp), %rax
movl $0xffffffff, 0x18(%rax) # imm = 0xFFFFFFFF
jmp 0x285092
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x284ff6
cmpl $0xf, 0x10(%rbp)
jle 0x2850ad
movl $0xf, 0x10(%rbp)
movq -0x10(%rbp), %rdi
movl $0x4000, %esi           # imm = 0x4000
callq 0x30e130
movq %rax, -0x68(%rbp)
movq -0x68(%rbp), %rdi
movslq -0x20(%rbp), %rsi
movl $0x1, %edx
callq 0x30e1a0
movq %rax, -0x98(%rbp)
movq -0x68(%rbp), %rdi
movslq -0x20(%rbp), %rsi
shlq $0x3, %rsi
callq 0x30e4f0
movq %rax, -0xa8(%rbp)
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jge 0x285137
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
movl (%rax), %eax
movl %eax, %edx
shlq $0x20, %rdx
movslq -0x74(%rbp), %rax
orq %rax, %rdx
movq -0xa8(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq %rdx, (%rax,%rcx,8)
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x2850f7
movq -0xa8(%rbp), %rdi
movq -0xa8(%rbp), %rsi
movslq -0x20(%rbp), %rax
shlq $0x3, %rax
addq %rax, %rsi
callq 0x27a9b0
movq -0x68(%rbp), %rdi
callq 0x286060
movq %rax, -0x60(%rbp)
movq -0x60(%rbp), %rdi
movl -0x20(%rbp), %esi
shll %esi
callq 0x2860a0
movl $0x1, -0x74(%rbp)
movl $0x0, -0x78(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jg 0x285241
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
je 0x2851bd
movq -0xa8(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
shrq $0x20, %rax
movq -0xa8(%rbp), %rcx
movslq -0x78(%rbp), %rdx
movq (%rcx,%rdx,8), %rcx
shrq $0x20, %rcx
cmpq %rcx, %rax
je 0x285231
movq -0x60(%rbp), %rdi
movq -0xa8(%rbp), %rax
movslq -0x78(%rbp), %rcx
movq (%rax,%rcx,8), %rax
shrq $0x20, %rax
movl %eax, %esi
leaq -0x70(%rbp), %rdx
callq 0x286590
movl %eax, -0x6c(%rbp)
movslq -0x78(%rbp), %rdx
shlq $0x20, %rdx
movl -0x74(%rbp), %eax
subl -0x78(%rbp), %eax
cltq
orq %rax, %rdx
movq -0x60(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
movq %rdx, (%rax,%rcx,8)
cmpl $0x0, -0x70(%rbp)
je 0x28520c
jmp 0x28522b
leaq 0x10b713(%rip), %rdi    # 0x390926
leaq 0x10b615(%rip), %rsi    # 0x39082f
movl $0x453, %edx            # imm = 0x453
leaq 0x10b707(%rip), %rcx    # 0x39092d
callq 0x2130
movl -0x74(%rbp), %eax
movl %eax, -0x78(%rbp)
jmp 0x285233
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x28517e
movq -0x68(%rbp), %rdi
callq 0x2868e0
movq %rax, -0x58(%rbp)
movq -0x58(%rbp), %rdi
movl $0x10, %esi
callq 0x286920
movl $0x10, -0x8c(%rbp)
movl $0x0, -0x88(%rbp)
movq -0x68(%rbp), %rdi
movl -0x8c(%rbp), %eax
movl %eax, %esi
shlq $0x3, %rsi
callq 0x30e4f0
movq %rax, -0x48(%rbp)
movl $0x0, -0x84(%rbp)
movq -0x68(%rbp), %rdi
movl -0x1c(%rbp), %esi
movl -0x84(%rbp), %ecx
movl %ecx, %eax
addl $0x1, %eax
movl %eax, -0x84(%rbp)
xorl %edx, %edx
callq 0x286ee0
movq %rax, -0x38(%rbp)
movl -0x1c(%rbp), %edi
callq 0x286f50
movl %eax, %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0x10(%rax)
movq -0x38(%rbp), %rsi
leaq -0x40(%rbp), %rdi
xorl %eax, %eax
movl %eax, %edx
callq 0x280df0
movq -0x58(%rbp), %rdi
movl -0x1c(%rbp), %esi
leaq -0x70(%rbp), %rdx
callq 0x286fb0
movl %eax, -0x6c(%rbp)
movq -0x58(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
imulq $0x88, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0x50(%rbp)
movq -0x50(%rbp), %rax
movl $0x1, (%rax)
movq -0x38(%rbp), %rcx
movq -0x50(%rbp), %rax
movq %rcx, 0x10(%rax)
movq -0x50(%rbp), %rax
movl $0x0, 0x4(%rax)
movq -0x50(%rbp), %rax
movl $0xffffffff, 0xc(%rax)  # imm = 0xFFFFFFFF
movq -0x50(%rbp), %rax
movl $0xffffffff, 0x8(%rax)  # imm = 0xFFFFFFFF
movl $0x0, -0x7c(%rbp)
cmpq $0x0, -0x40(%rbp)
je 0x285358
movq -0x40(%rbp), %rax
movl 0x2c(%rax), %eax
movl %eax, -0x12c(%rbp)
jmp 0x285362
xorl %eax, %eax
movl %eax, -0x12c(%rbp)
jmp 0x285362
movl -0x12c(%rbp), %eax
cmpl $0x0, %eax
jbe 0x285bf2
leaq -0x40(%rbp), %rdi
xorl %eax, %eax
movl %eax, %edx
movq %rdx, %rsi
callq 0x2814c0
movq %rax, -0xc8(%rbp)
movl -0x88(%rbp), %eax
cmpl -0x8c(%rbp), %eax
jne 0x2853f1
jmp 0x285398
cmpl $0x4, -0x8c(%rbp)
jb 0x2853b9
movl -0x8c(%rbp), %eax
movl -0x8c(%rbp), %ecx
shrl %ecx
addl %ecx, %eax
movl %eax, -0x130(%rbp)
jmp 0x2853c6
movl $0x10, %eax
movl %eax, -0x130(%rbp)
jmp 0x2853c6
movl -0x130(%rbp), %eax
movl %eax, -0x8c(%rbp)
movq -0x68(%rbp), %rdi
movq -0x48(%rbp), %rsi
movl -0x8c(%rbp), %eax
movl %eax, %edx
shlq $0x3, %rdx
callq 0x30e740
movq %rax, -0x48(%rbp)
jmp 0x2853f1
movq -0xc8(%rbp), %rax
movq (%rax), %rcx
shrq $0x20, %rcx
shlq $0x20, %rcx
movl -0x88(%rbp), %eax
orq %rax, %rcx
movq -0xc8(%rbp), %rax
movq %rcx, (%rax)
movq -0xc8(%rbp), %rdx
movq -0x48(%rbp), %rax
movl -0x88(%rbp), %ecx
movl %ecx, %esi
addl $0x1, %esi
movl %esi, -0x88(%rbp)
movl %ecx, %ecx
movq %rdx, (%rax,%rcx,8)
movq -0x60(%rbp), %rdi
movq -0xc8(%rbp), %rax
movl 0x8(%rax), %esi
callq 0x287300
movl %eax, -0x6c(%rbp)
movl -0x6c(%rbp), %eax
movq -0x60(%rbp), %rcx
cmpl (%rcx), %eax
je 0x285892
movq -0xc8(%rbp), %rax
movq (%rax), %rax
shrq $0x20, %rax
movl %eax, -0xd0(%rbp)
movq -0x60(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
movq (%rax,%rcx,8), %rax
shrq $0x20, %rax
movl %eax, -0xd4(%rbp)
movq -0x60(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
movq (%rax,%rcx,8), %rax
movl %eax, -0xd8(%rbp)
movl $0x0, -0xcc(%rbp)
movl -0xcc(%rbp), %eax
cmpl -0xd8(%rbp), %eax
jge 0x285883
movq -0x28(%rbp), %rax
movq -0xa8(%rbp), %rcx
movl -0xd4(%rbp), %edx
addl -0xcc(%rbp), %edx
movslq %edx, %rdx
movq (%rcx,%rdx,8), %rcx
movslq %ecx, %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0xe0(%rbp)
movl $0x0, -0xe4(%rbp)
movq -0xe0(%rbp), %rax
movl 0xc(%rax), %eax
shrl $0x1f, %eax
cmpl $0x0, %eax
je 0x285515
movl $0x1, -0xe4(%rbp)
jmp 0x285822
movl $0x0, -0xe8(%rbp)
movl $0x0, -0xec(%rbp)
movq -0xe0(%rbp), %rax
movl 0x14(%rax), %eax
andl $0x7fffffff, %eax       # imm = 0x7FFFFFFF
cmpl $0x0, %eax
jne 0x28554c
movl $0x1, -0xec(%rbp)
jmp 0x2856c7
movq -0xe0(%rbp), %rax
cmpl $0x0, 0x4(%rax)
jl 0x2856c5
movl -0xd0(%rbp), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x4(%rcx), %eax
jne 0x2855b3
movq -0xe0(%rbp), %rax
movl 0xc(%rax), %eax
shrl $0x1e, %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0x2855b3
movq -0xc8(%rbp), %rax
movl 0x10(%rax), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x8(%rcx), %eax
jne 0x2855b3
movl $0x1, -0xec(%rbp)
movl $0x1, -0xe4(%rbp)
jmp 0x2856c3
movq -0xe0(%rbp), %rax
movl 0x1c(%rax), %eax
movl %eax, -0xf0(%rbp)
movl -0xd0(%rbp), %eax
movl %eax, -0xf4(%rbp)
movl -0xf0(%rbp), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x4(%rcx), %eax
jle 0x2855f9
movl -0xf0(%rbp), %eax
movq -0xe0(%rbp), %rcx
subl 0x4(%rcx), %eax
movl %eax, -0x134(%rbp)
jmp 0x28560f
movq -0xe0(%rbp), %rax
movl 0x4(%rax), %eax
subl -0xf0(%rbp), %eax
movl %eax, -0x134(%rbp)
movl -0x134(%rbp), %eax
movl %eax, -0xf0(%rbp)
movl -0xf4(%rbp), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x4(%rcx), %eax
jle 0x285645
movl -0xf4(%rbp), %eax
movq -0xe0(%rbp), %rcx
subl 0x4(%rcx), %eax
movl %eax, -0x138(%rbp)
jmp 0x28565b
movq -0xe0(%rbp), %rax
movl 0x4(%rax), %eax
subl -0xf4(%rbp), %eax
movl %eax, -0x138(%rbp)
movl -0x138(%rbp), %eax
movl %eax, -0xf4(%rbp)
movl -0xf4(%rbp), %eax
movl %eax, -0x140(%rbp)
movl -0xe8(%rbp), %eax
movl $0x2, %ecx
cltd
idivl %ecx
movl %eax, %ecx
movl -0x140(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x13c(%rbp)
movl -0xf0(%rbp), %ecx
movq -0xe0(%rbp), %rax
movl 0x20(%rax), %eax
movl $0x2, %esi
cltd
idivl %esi
movl %eax, %edx
movl -0x13c(%rbp), %eax
subl %edx, %ecx
cmpl %ecx, %eax
jge 0x2856c1
movl $0x1, -0xec(%rbp)
jmp 0x2856c3
jmp 0x2856c5
jmp 0x2856c7
cmpl $0x0, -0xec(%rbp)
je 0x2857db
movl -0x88(%rbp), %ecx
subl $0x1, %ecx
movq -0xe0(%rbp), %rax
movl %ecx, 0x18(%rax)
movl -0xd0(%rbp), %ecx
movq -0xe0(%rbp), %rax
movl %ecx, 0x1c(%rax)
movq -0xc8(%rbp), %rax
movl 0x10(%rax), %ecx
movq -0xe0(%rbp), %rax
movl %ecx, 0x24(%rax)
movl -0xe8(%rbp), %ecx
movq -0xe0(%rbp), %rax
movl %ecx, 0x20(%rax)
movq -0xc8(%rbp), %rax
movl 0x14(%rax), %edx
movq -0xe0(%rbp), %rax
movl 0x14(%rax), %ecx
andl $0x1, %edx
shll $0x1f, %edx
andl $0x7fffffff, %ecx       # imm = 0x7FFFFFFF
orl %edx, %ecx
movl %ecx, 0x14(%rax)
movq -0xe0(%rbp), %rax
cmpl $0x0, 0x4(%rax)
jl 0x2857d9
movl -0xd0(%rbp), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x4(%rcx), %eax
jne 0x28579a
movq -0xe0(%rbp), %rax
movl 0xc(%rax), %eax
shrl $0x1e, %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0x28579a
movq -0xc8(%rbp), %rax
movl 0x10(%rax), %eax
movq -0xe0(%rbp), %rcx
cmpl 0x8(%rcx), %eax
jne 0x28579a
movl $0x1, -0xe4(%rbp)
jmp 0x2857d7
movl -0xd0(%rbp), %eax
movq -0xe0(%rbp), %rcx
movl 0x4(%rcx), %ecx
addl $0x2710, %ecx           # imm = 0x2710
cmpl %ecx, %eax
jle 0x2857d5
movl -0xd0(%rbp), %eax
movq -0xe0(%rbp), %rcx
movl 0x4(%rcx), %ecx
sarl $0x4, %ecx
cmpl %ecx, %eax
jle 0x2857d5
movl $0x1, -0xe4(%rbp)
jmp 0x2857d7
jmp 0x2857d9
jmp 0x2857db
movq -0xe0(%rbp), %rax
movl 0x14(%rax), %edx
andl $0x7fffffff, %edx       # imm = 0x7FFFFFFF
addl $0x1, %edx
movl 0x14(%rax), %ecx
andl $0x7fffffff, %edx       # imm = 0x7FFFFFFF
andl $0x80000000, %ecx       # imm = 0x80000000
orl %edx, %ecx
movl %ecx, 0x14(%rax)
movq -0xe0(%rbp), %rax
movl 0x14(%rax), %eax
andl $0x7fffffff, %eax       # imm = 0x7FFFFFFF
cmpl 0x10(%rbp), %eax
jl 0x285820
movl $0x1, -0xe4(%rbp)
jmp 0x285822
movq -0x98(%rbp), %rax
movl -0xd4(%rbp), %ecx
addl -0xcc(%rbp), %ecx
movslq %ecx, %rcx
movsbl (%rax,%rcx), %eax
cmpl $0x0, %eax
jne 0x28586d
cmpl $0x0, -0xe4(%rbp)
je 0x28586d
movq -0x98(%rbp), %rax
movl -0xd4(%rbp), %ecx
addl -0xcc(%rbp), %ecx
movslq %ecx, %rcx
movb $0x1, (%rax,%rcx)
movl -0x7c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x7c(%rbp)
jmp 0x28586f
movl -0xcc(%rbp), %eax
addl $0x1, %eax
movl %eax, -0xcc(%rbp)
jmp 0x2854a9
movl -0x7c(%rbp), %eax
cmpl -0x20(%rbp), %eax
jne 0x285890
jmp 0x285bf2
jmp 0x285892
movq -0x18(%rbp), %rax
movq 0x28(%rax), %rax
movq -0xc8(%rbp), %rcx
movl 0x8(%rcx), %ecx
movq (%rax,%rcx,8), %rax
movl %eax, -0xb8(%rbp)
movq -0x18(%rbp), %rax
movq 0x8(%rax), %rax
movq -0x18(%rbp), %rcx
movq 0x28(%rcx), %rcx
movq -0xc8(%rbp), %rdx
movl 0x8(%rdx), %edx
movq (%rcx,%rdx,8), %rcx
shrq $0x20, %rcx
imulq $0x18, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0xc0(%rbp)
movl $0x0, -0xb4(%rbp)
movl -0xb4(%rbp), %eax
cmpl -0xb8(%rbp), %eax
jge 0x285bed
movq -0xc0(%rbp), %rax
movslq -0xb4(%rbp), %rcx
imulq $0x18, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0x100(%rbp)
movq -0xc8(%rbp), %rax
movq (%rax), %rax
shrq $0x20, %rax
movq -0x100(%rbp), %rcx
movq (%rcx), %rcx
movl %ecx, %ecx
addq %rcx, %rax
movl %eax, -0x104(%rbp)
movl -0x104(%rbp), %eax
cmpl -0x2c(%rbp), %eax
jle 0x285949
jmp 0x285bd9
movq -0x58(%rbp), %rdi
movq -0x100(%rbp), %rax
movl 0x8(%rax), %esi
leaq -0x70(%rbp), %rdx
callq 0x286fb0
movl %eax, -0x6c(%rbp)
movq -0x58(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
imulq $0x88, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0x50(%rbp)
cmpl $0x0, -0x70(%rbp)
je 0x2859ad
movq -0x50(%rbp), %rax
movl $0x0, (%rax)
movq -0x50(%rbp), %rax
movl $0xffffffff, 0xc(%rax)  # imm = 0xFFFFFFFF
movq -0x50(%rbp), %rax
movl $0xffffffff, 0x8(%rax)  # imm = 0xFFFFFFFF
movq -0x50(%rbp), %rax
movl $0x0, 0x4(%rax)
movq -0x50(%rbp), %rax
movl (%rax), %eax
cmpl 0x10(%rbp), %eax
jge 0x285a80
movq -0x68(%rbp), %rdi
movq -0x100(%rbp), %rax
movl 0x8(%rax), %esi
movl -0x104(%rbp), %edx
movl -0x84(%rbp), %ecx
movl %ecx, %eax
addl $0x1, %eax
movl %eax, -0x84(%rbp)
callq 0x286ee0
movq %rax, -0x38(%rbp)
movl -0x88(%rbp), %ecx
subl $0x1, %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0xc(%rax)
movq -0xc8(%rbp), %rax
movl 0x10(%rax), %eax
movl %eax, -0x144(%rbp)
movq -0x100(%rbp), %rax
movl 0x8(%rax), %edi
callq 0x286f50
movl -0x144(%rbp), %ecx
addl %eax, %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0x10(%rax)
movq -0xc8(%rbp), %rax
movl 0x14(%rax), %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0x14(%rax)
movq -0x38(%rbp), %rsi
leaq -0x40(%rbp), %rdi
xorl %eax, %eax
movl %eax, %edx
callq 0x280df0
movq -0x38(%rbp), %rdx
movq -0x50(%rbp), %rax
movq -0x50(%rbp), %rsi
movl (%rsi), %ecx
movl %ecx, %edi
addl $0x1, %edi
movl %edi, (%rsi)
movslq %ecx, %rcx
movq %rdx, 0x10(%rax,%rcx,8)
movq -0x50(%rbp), %rax
movslq (%rax), %rdi
movq -0x50(%rbp), %rsi
addq $0x10, %rsi
callq 0x281f20
jmp 0x285bd7
movq -0x50(%rbp), %rax
movq 0x10(%rax), %rax
movq (%rax), %rax
shrq $0x20, %rax
cmpl -0x104(%rbp), %eax
jle 0x285bd5
movq -0x50(%rbp), %rax
movq 0x10(%rax), %rsi
leaq -0x40(%rbp), %rdi
xorl %eax, %eax
movl %eax, %edx
callq 0x2814c0
movq %rax, -0x38(%rbp)
cmpq $0x0, -0x38(%rbp)
je 0x285b61
movslq -0x104(%rbp), %rcx
shlq $0x20, %rcx
movl -0x84(%rbp), %eax
movl %eax, %edx
addl $0x1, %edx
movl %edx, -0x84(%rbp)
movl %eax, %eax
orq %rax, %rcx
movq -0x38(%rbp), %rax
movq %rcx, (%rax)
movl -0x88(%rbp), %ecx
subl $0x1, %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0xc(%rax)
movq -0xc8(%rbp), %rax
movl 0x10(%rax), %eax
movl %eax, -0x148(%rbp)
movq -0x100(%rbp), %rax
movl 0x8(%rax), %edi
callq 0x286f50
movl -0x148(%rbp), %ecx
addl %eax, %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0x10(%rax)
movq -0xc8(%rbp), %rax
movl 0x14(%rax), %ecx
movq -0x38(%rbp), %rax
movl %ecx, 0x14(%rax)
movq -0x38(%rbp), %rsi
leaq -0x40(%rbp), %rdi
xorl %eax, %eax
movl %eax, %edx
callq 0x280df0
movq -0x50(%rbp), %rax
movslq (%rax), %rsi
movq -0x50(%rbp), %rdx
addq $0x10, %rdx
xorl %eax, %eax
movl %eax, %edi
callq 0x281e50
jmp 0x285bd3
movq 0x13e478(%rip), %rax    # 0x3c3fe0
movq (%rax), %rdi
movq -0x50(%rbp), %rax
movl (%rax), %edx
movq -0x50(%rbp), %rax
movq 0x10(%rax), %rax
movq (%rax), %rax
shrq $0x20, %rax
movl %eax, %ecx
movq -0x50(%rbp), %rax
movq 0x10(%rax), %rax
movq (%rax), %rax
movl %eax, %r8d
movl -0x104(%rbp), %r9d
movl -0x1c(%rbp), %r11d
movl -0x2c(%rbp), %r10d
movl -0x20(%rbp), %eax
leaq 0x10adf6(%rip), %rsi    # 0x39099f
movl %r11d, (%rsp)
movl %r10d, 0x8(%rsp)
movl %eax, 0x10(%rsp)
movb $0x0, %al
callq 0x22a0
movq -0x68(%rbp), %rdi
callq 0x30e250
movq $0x0, -0x8(%rbp)
jmp 0x286044
jmp 0x285bd5
jmp 0x285bd7
jmp 0x285bd9
movl -0xb4(%rbp), %eax
addl $0x1, %eax
movl %eax, -0xb4(%rbp)
jmp 0x2858e8
jmp 0x285342
movq -0x68(%rbp), %rdi
movq -0xa8(%rbp), %rsi
callq 0x30e2d0
movq -0x68(%rbp), %rdi
movq -0x98(%rbp), %rsi
callq 0x30e2d0
movq -0x58(%rbp), %rdi
callq 0x287440
movl $0x0, -0x74(%rbp)
movl $0x0, -0x80(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jge 0x285c63
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
movl 0x14(%rax), %eax
andl $0x7fffffff, %eax       # imm = 0x7FFFFFFF
cmpl $0x0, %eax
jle 0x285c56
movl -0x80(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x80(%rbp)
jmp 0x285c58
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285c29
cmpl $0x0, -0x80(%rbp)
jle 0x286030
cmpq $0x0, 0x18(%rbp)
je 0x286030
movq -0x68(%rbp), %rdi
movl -0x88(%rbp), %eax
movl %eax, %esi
movl $0x4, %edx
callq 0x30e1a0
movq %rax, -0x110(%rbp)
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jge 0x285d1c
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0x118(%rbp)
movq -0x118(%rbp), %rax
movl 0x14(%rax), %eax
andl $0x7fffffff, %eax       # imm = 0x7FFFFFFF
cmpl $0x0, %eax
jle 0x285d0f
movq -0x118(%rbp), %rax
cmpl $0x0, 0x4(%rax)
jl 0x285d0f
movq -0x118(%rbp), %rax
cmpl $0x0, 0x18(%rax)
jl 0x285d0f
movq -0x110(%rbp), %rax
movq -0x48(%rbp), %rcx
movq -0x118(%rbp), %rdx
movslq 0x18(%rdx), %rdx
movq (%rcx,%rdx,8), %rcx
movq (%rcx), %rcx
movslq %ecx, %rcx
movl $0x1, (%rax,%rcx,4)
jmp 0x285d11
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285c9c
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x88(%rbp), %eax
jae 0x285dec
movq -0x60(%rbp), %rdi
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
movl 0x8(%rax), %esi
callq 0x287300
movl %eax, -0x6c(%rbp)
movl -0x6c(%rbp), %eax
movq -0x60(%rbp), %rcx
cmpl (%rcx), %eax
je 0x285ddc
movq -0x60(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
movq (%rax,%rcx,8), %rax
shrq $0x20, %rax
movl %eax, -0x11c(%rbp)
movq -0x60(%rbp), %rax
movq 0x20(%rax), %rax
movl -0x6c(%rbp), %ecx
movq (%rax,%rcx,8), %rax
movl %eax, -0x120(%rbp)
movl -0x11c(%rbp), %eax
movl %eax, -0x78(%rbp)
movl -0x78(%rbp), %eax
movl -0x11c(%rbp), %ecx
addl -0x120(%rbp), %ecx
cmpl %ecx, %eax
jge 0x285dda
movq -0x28(%rbp), %rax
movslq -0x78(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
cmpl $0x0, 0x4(%rax)
jge 0x285dcd
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
movl $0x1, (%rax,%rcx,4)
jmp 0x285dcf
movl -0x78(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x78(%rbp)
jmp 0x285d93
jmp 0x285ddc
jmp 0x285dde
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285d23
movl -0x88(%rbp), %eax
subl $0x1, %eax
movl %eax, -0x74(%rbp)
cmpl $0x0, -0x74(%rbp)
jl 0x285e4c
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
cmpl $0x0, (%rax,%rcx,4)
je 0x285e3f
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
cmpl $0x0, 0xc(%rax)
jl 0x285e3f
movq -0x110(%rbp), %rax
movq -0x48(%rbp), %rcx
movslq -0x74(%rbp), %rdx
movq (%rcx,%rdx,8), %rcx
movslq 0xc(%rcx), %rcx
movl $0x1, (%rax,%rcx,4)
jmp 0x285e41
movl -0x74(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285df8
movl $0x0, -0x108(%rbp)
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x88(%rbp), %eax
jae 0x285eb9
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
cmpl $0x0, (%rax,%rcx,4)
je 0x285e9a
movl -0x108(%rbp), %edx
movl %edx, %eax
addl $0x1, %eax
movl %eax, -0x108(%rbp)
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
movl %edx, (%rax,%rcx,4)
jmp 0x285eac
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
movl $0xffffffff, (%rax,%rcx,4) # imm = 0xFFFFFFFF
jmp 0x285eae
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285e5d
movl -0x108(%rbp), %ecx
movq 0x18(%rbp), %rax
movl %ecx, (%rax)
movq -0x10(%rbp), %rdi
movslq -0x108(%rbp), %rax
imulq $0xc, %rax, %rsi
callq 0x30e4f0
movq %rax, -0xa0(%rbp)
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x88(%rbp), %eax
jae 0x285fce
movq -0x110(%rbp), %rax
movslq -0x74(%rbp), %rcx
cmpl $0x0, (%rax,%rcx,4)
jge 0x285f0c
jmp 0x285fc0
movq -0xa0(%rbp), %rax
movq -0x110(%rbp), %rcx
movslq -0x74(%rbp), %rdx
movslq (%rcx,%rdx,4), %rcx
imulq $0xc, %rcx, %rcx
addq %rcx, %rax
movq %rax, -0x128(%rbp)
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
movl 0x8(%rax), %ecx
movq -0x128(%rbp), %rax
movl %ecx, (%rax)
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
movq (%rax), %rax
shrq $0x20, %rax
movl %eax, %ecx
movq -0x128(%rbp), %rax
movl %ecx, 0x4(%rax)
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
cmpl $0x0, 0xc(%rax)
jge 0x285f90
movq -0x48(%rbp), %rax
movslq -0x74(%rbp), %rcx
movq (%rax,%rcx,8), %rax
movl 0xc(%rax), %eax
movl %eax, -0x14c(%rbp)
jmp 0x285fb0
movq -0x110(%rbp), %rax
movq -0x48(%rbp), %rcx
movslq -0x74(%rbp), %rdx
movq (%rcx,%rdx,8), %rcx
movslq 0xc(%rcx), %rcx
movl (%rax,%rcx,4), %eax
movl %eax, -0x14c(%rbp)
movl -0x14c(%rbp), %ecx
movq -0x128(%rbp), %rax
movl %ecx, 0x8(%rax)
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285ee7
movl $0x0, -0x74(%rbp)
movl -0x74(%rbp), %eax
cmpl -0x20(%rbp), %eax
jge 0x28602e
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rcx
imulq $0x30, %rcx, %rcx
addq %rcx, %rax
cmpl $0x0, 0x18(%rax)
jl 0x286021
movq -0x110(%rbp), %rax
movq -0x28(%rbp), %rcx
movslq -0x74(%rbp), %rdx
imulq $0x30, %rdx, %rdx
addq %rdx, %rcx
movslq 0x18(%rcx), %rcx
movl (%rax,%rcx,4), %ecx
movq -0x28(%rbp), %rax
movslq -0x74(%rbp), %rdx
imulq $0x30, %rdx, %rdx
addq %rdx, %rax
movl %ecx, 0x18(%rax)
jmp 0x286023
movl -0x74(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x74(%rbp)
jmp 0x285fd5
jmp 0x286030
movq -0x68(%rbp), %rdi
callq 0x30e250
movq -0xa0(%rbp), %rax
movq %rax, -0x8(%rbp)
movq -0x8(%rbp), %rax
addq $0x170, %rsp            # imm = 0x170
popq %rbp
retq
nopw %cs:(%rax,%rax)