// File: /workspace/github_c_makefile_star2_O0/pwelke[P]GraphMiningTools/iterativeSubtreeIsomorphism.c
// Function: makeBipartiteInstanceFromVerticesCached
static struct Graph* makeBipartiteInstanceFromVerticesCached(struct SubtreeIsoDataStore data, struct CachedGraph* cachedB, struct Vertex* removalVertex, struct Vertex* u, struct Vertex* v, struct GraphPool* gp) {

	int sizeofX = degree(u);
	int sizeofY = degree(v);

	// if one of the neighbors of u is removed from this instance to see if there is a matching covering all neighbors but it,
	// the bipartite graph must be smaller
	if (removalVertex->number != u->number) {
		--sizeofX;
	}

	struct Graph* B = getCachedGraph(sizeofX + sizeofY, cachedB);

	/* store size of first partitioning set */
	B->number = sizeofX;

	/* add vertex numbers of original vertices to ->lowPoint of each vertex in B
	and add edge labels to vertex labels to compare edges easily */
	int i = 0;
	for (struct VertexList* e=u->neighborhood; e!=NULL; e=e->next) {
		if (e->endPoint->number != removalVertex->number) {
			B->vertices[i]->lowPoint = e->endPoint->number;
			B->vertices[i]->label = e->label;
			++i;
		}
	}
	for (struct VertexList* e=v->neighborhood; e!=NULL; e=e->next) {
		B->vertices[i]->lowPoint = e->endPoint->number;
		B->vertices[i]->label = e->label;
		++i;
	}

	/* add edge (x,y) if u in S(y,x) */
	for (i=0; i<sizeofX; ++i) {
		int x = B->vertices[i]->lowPoint;
		for (int j=sizeofX; j<B->n; ++j) {
			int y = B->vertices[j]->lowPoint;

			/* y has to be a child of v */
			if (data.g->vertices[y]->visited < v->visited) {
				/* edge labels have to match, (v, child)->label in g == (u, child)->label in h
				these values were stored in B->vertices[i,j]->label */
				if (labelCmp(B->vertices[i]->label, B->vertices[j]->label) == 0) {
					if (containsCharacteristic(data, u, data.h->vertices[x], data.g->vertices[y])) {
						addResidualEdges(B->vertices[i], B->vertices[j], gp->listPool);
						++B->m;
					}
				}
			}
		}
	}
	return B;
}

// Assembly:
subq $0x98, %rsp
leaq 0xa0(%rsp), %rax
movq %rax, 0x30(%rsp)
movq %rdi, 0x90(%rsp)
movq %rsi, 0x88(%rsp)
movq %rdx, 0x80(%rsp)
movq %rcx, 0x78(%rsp)
movq %r8, 0x70(%rsp)
movq 0x80(%rsp), %rdi
callq 0xa440
movl %eax, 0x6c(%rsp)
movq 0x78(%rsp), %rdi
callq 0xa440
movl %eax, 0x68(%rsp)
movq 0x88(%rsp), %rax
movl 0x18(%rax), %eax
movq 0x80(%rsp), %rcx
cmpl 0x18(%rcx), %eax
je 0xea18
movl 0x6c(%rsp), %eax
addl $-0x1, %eax
movl %eax, 0x6c(%rsp)
movl 0x6c(%rsp), %edi
addl 0x68(%rsp), %edi
movq 0x90(%rsp), %rsi
callq 0x2c20
movq %rax, 0x60(%rsp)
movl 0x6c(%rsp), %ecx
movq 0x60(%rsp), %rax
movl %ecx, 0x8(%rax)
movl $0x0, 0x5c(%rsp)
movq 0x80(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, 0x50(%rsp)
cmpq $0x0, 0x50(%rsp)
je 0xead3
movq 0x50(%rsp), %rax
movq 0x18(%rax), %rax
movl 0x18(%rax), %eax
movq 0x88(%rsp), %rcx
cmpl 0x18(%rcx), %eax
je 0xeac1
movq 0x50(%rsp), %rax
movq 0x18(%rax), %rax
movl 0x18(%rax), %ecx
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rdx
movq (%rax,%rdx,8), %rax
movl %ecx, 0x20(%rax)
movq 0x50(%rsp), %rax
movq (%rax), %rcx
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rdx
movq (%rax,%rdx,8), %rax
movq %rcx, (%rax)
movl 0x5c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x5c(%rsp)
jmp 0xeac3
movq 0x50(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, 0x50(%rsp)
jmp 0xea57
movq 0x78(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, 0x48(%rsp)
cmpq $0x0, 0x48(%rsp)
je 0xeb42
movq 0x48(%rsp), %rax
movq 0x18(%rax), %rax
movl 0x18(%rax), %ecx
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rdx
movq (%rax,%rdx,8), %rax
movl %ecx, 0x20(%rax)
movq 0x48(%rsp), %rax
movq (%rax), %rcx
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rdx
movq (%rax,%rdx,8), %rax
movq %rcx, (%rax)
movl 0x5c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x5c(%rsp)
movq 0x48(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, 0x48(%rsp)
jmp 0xeae1
movl $0x0, 0x5c(%rsp)
movl 0x5c(%rsp), %eax
cmpl 0x6c(%rsp), %eax
jge 0xecbc
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rcx
movq (%rax,%rcx,8), %rax
movl 0x20(%rax), %eax
movl %eax, 0x44(%rsp)
movl 0x6c(%rsp), %eax
movl %eax, 0x40(%rsp)
movl 0x40(%rsp), %eax
movq 0x60(%rsp), %rcx
cmpl (%rcx), %eax
jge 0xecaa
movq 0x30(%rsp), %rax
movq 0x60(%rsp), %rcx
movq 0x10(%rcx), %rcx
movslq 0x40(%rsp), %rdx
movq (%rcx,%rdx,8), %rcx
movl 0x20(%rcx), %ecx
movl %ecx, 0x3c(%rsp)
movq 0x8(%rax), %rax
movq 0x10(%rax), %rax
movslq 0x3c(%rsp), %rcx
movq (%rax,%rcx,8), %rax
movl 0x1c(%rax), %eax
movq 0x78(%rsp), %rcx
cmpl 0x1c(%rcx), %eax
jge 0xec98
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rcx
movq (%rax,%rcx,8), %rax
movq (%rax), %rdi
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x40(%rsp), %rcx
movq (%rax,%rcx,8), %rax
movq (%rax), %rsi
callq 0x2dcf0
cmpl $0x0, %eax
jne 0xec96
movq 0x30(%rsp), %rcx
movq 0x80(%rsp), %rdi
movq 0x10(%rcx), %rax
movq 0x10(%rax), %rax
movslq 0x44(%rsp), %rdx
movq (%rax,%rdx,8), %rsi
movq 0x8(%rcx), %rax
movq 0x10(%rax), %rax
movslq 0x3c(%rsp), %rdx
movq (%rax,%rdx,8), %rdx
movq 0x20(%rcx), %r8
movq %rsp, %rax
movq %r8, 0x20(%rax)
movups (%rcx), %xmm0
movups 0x10(%rcx), %xmm1
movups %xmm1, 0x10(%rax)
movups %xmm0, (%rax)
callq 0x22fd0
cmpl $0x0, %eax
je 0xec94
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x5c(%rsp), %rcx
movq (%rax,%rcx,8), %rdi
movq 0x60(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x40(%rsp), %rcx
movq (%rax,%rcx,8), %rsi
movq 0x70(%rsp), %rax
movq 0x18(%rax), %rdx
callq 0x1cc0
movq 0x60(%rsp), %rax
movl 0x4(%rax), %ecx
addl $0x1, %ecx
movl %ecx, 0x4(%rax)
jmp 0xec96
jmp 0xec98
jmp 0xec9a
movl 0x40(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x40(%rsp)
jmp 0xeb79
jmp 0xecac
movl 0x5c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x5c(%rsp)
jmp 0xeb4a
movq 0x60(%rsp), %rax
addq $0x98, %rsp
retq
nopl (%rax)