// File: /workspace/github_c_makefile_star2_O0/pwelke[P]GraphMiningTools/iterativeSubtreeIsomorphism.c
// Function: noniterativeRootedSubtreeCheck_intern
static struct Vertex* noniterativeRootedSubtreeCheck_intern(struct SubtreeIsoDataStore* current, struct Vertex* hRoot, struct GraphPool* gp) {

	struct Graph* g = current->g;
	struct Graph* h = current->h;

	struct CachedGraph* cachedB = initCachedGraph(gp, h->n);

	current->foundIso = 0;
	for (int vi=0; vi<g->n; ++vi) {
		struct Vertex* v = g->vertices[current->postorder[vi]];

		for (int ui=0; ui<h->n; ++ui) {
			struct Vertex* u = h->vertices[ui];

			// check if vertex labels match
			if (labelCmp(u->label, v->label) != 0) { continue; }

			// compute maximum matching
			struct Graph* B = makeBipartiteInstanceFromVerticesCached(*current, cachedB, u, u, v, gp);
			int sizeofMatching = bipartiteMatchingEvenMoreDirty(B);
			int nNeighbors = B->number;

			// is there a subgraph iso here?
			if (sizeofMatching == nNeighbors) {
				addCharacteristic(current, u, u, v);

				if (u == hRoot) {
					current->foundIso = 1;

					returnCachedGraph(cachedB);
					dumpCachedGraph(cachedB);
					return v; // early termination when subtree iso is found
				}
			}

			// compute partial subgraph isomorphisms
			if (sizeofMatching == nNeighbors - 1) {
				addNoncriticalVertexCharacteristics(current, B, u, v);
			}

			returnCachedGraph(cachedB);
		}
	}

	dumpCachedGraph(cachedB);
	return NULL;
}

// Assembly:
subq $0x98, %rsp
movq %rdi, 0x88(%rsp)
movq %rsi, 0x80(%rsp)
movq %rdx, 0x78(%rsp)
movq 0x88(%rsp), %rax
movq 0x8(%rax), %rax
movq %rax, 0x70(%rsp)
movq 0x88(%rsp), %rax
movq 0x10(%rax), %rax
movq %rax, 0x68(%rsp)
movq 0x78(%rsp), %rdi
movq 0x68(%rsp), %rax
movl (%rax), %esi
callq 0x2bb0
movq %rax, 0x60(%rsp)
movq 0x88(%rsp), %rax
movl $0x0, 0x20(%rax)
movl $0x0, 0x5c(%rsp)
movl 0x5c(%rsp), %eax
movq 0x70(%rsp), %rcx
cmpl (%rcx), %eax
jge 0xff81
movq 0x70(%rsp), %rax
movq 0x10(%rax), %rax
movq 0x88(%rsp), %rcx
movq (%rcx), %rcx
movslq 0x5c(%rsp), %rdx
movslq (%rcx,%rdx,4), %rcx
movq (%rax,%rcx,8), %rax
movq %rax, 0x50(%rsp)
movl $0x0, 0x4c(%rsp)
movl 0x4c(%rsp), %eax
movq 0x68(%rsp), %rcx
cmpl (%rcx), %eax
jge 0xff6f
movq 0x68(%rsp), %rax
movq 0x10(%rax), %rax
movslq 0x4c(%rsp), %rcx
movq (%rax,%rcx,8), %rax
movq %rax, 0x40(%rsp)
movq 0x40(%rsp), %rax
movq (%rax), %rdi
movq 0x50(%rsp), %rax
movq (%rax), %rsi
callq 0x2dcf0
cmpl $0x0, %eax
je 0xfe61
jmp 0xff5f
movq 0x88(%rsp), %r9
movq 0x60(%rsp), %rdi
movq 0x40(%rsp), %rsi
movq 0x40(%rsp), %rdx
movq 0x50(%rsp), %rcx
movq 0x78(%rsp), %r8
movq 0x20(%r9), %r10
movq %rsp, %rax
movq %r10, 0x20(%rax)
movups (%r9), %xmm0
movups 0x10(%r9), %xmm1
movups %xmm1, 0x10(%rax)
movups %xmm0, (%rax)
callq 0xe9a0
movq %rax, 0x38(%rsp)
movq 0x38(%rsp), %rdi
callq 0x21d0
movl %eax, 0x34(%rsp)
movq 0x38(%rsp), %rax
movl 0x8(%rax), %eax
movl %eax, 0x30(%rsp)
movl 0x34(%rsp), %eax
cmpl 0x30(%rsp), %eax
jne 0xff2a
movq 0x88(%rsp), %rdi
movq 0x40(%rsp), %rsi
movq 0x40(%rsp), %rdx
movq 0x50(%rsp), %rcx
callq 0x23040
movq 0x40(%rsp), %rax
cmpq 0x80(%rsp), %rax
jne 0xff28
movq 0x88(%rsp), %rax
movl $0x1, 0x20(%rax)
movq 0x60(%rsp), %rdi
callq 0x2d10
movq 0x60(%rsp), %rdi
callq 0x2db0
movq 0x50(%rsp), %rax
movq %rax, 0x90(%rsp)
jmp 0xff97
jmp 0xff2a
movl 0x34(%rsp), %eax
movl 0x30(%rsp), %ecx
subl $0x1, %ecx
cmpl %ecx, %eax
jne 0xff55
movq 0x88(%rsp), %rdi
movq 0x38(%rsp), %rsi
movq 0x40(%rsp), %rdx
movq 0x50(%rsp), %rcx
callq 0xf800
movq 0x60(%rsp), %rdi
callq 0x2d10
movl 0x4c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x4c(%rsp)
jmp 0xfe1a
jmp 0xff71
movl 0x5c(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x5c(%rsp)
jmp 0xfddb
movq 0x60(%rsp), %rdi
callq 0x2db0
movq $0x0, 0x90(%rsp)
movq 0x90(%rsp), %rax
addq $0x98, %rsp
retq
nopw (%rax,%rax)