LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: getNumberOfSimpleCycles
int getNumberOfSimpleCycles(struct Graph* g, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct Graph* tmp;
	struct Graph* idx;
	int numCycles = 0;

	/* find biconnected Components */
	struct ShallowGraph* h = listBiconnectedComponents(g, sgp);
	struct Graph* forest = partitionIntoForestAndCycles(h, g, gp, sgp);
	/* TODO refactor */
	struct Graph* biconnectedComponents = forest->next;

	/* list all cycles */
	struct ShallowGraph* simpleCycles = NULL;


	for (idx=biconnectedComponents; idx; idx=idx->next) {
		simpleCycles = addComponent(simpleCycles, listCycles(idx, sgp));
	}

	/* if cycles were found, compute canonical strings */
	if (simpleCycles) {
		struct ShallowGraph* cycle = NULL;

		/* transform cycle of shallow graphs to a list */
		simpleCycles->prev->next = NULL;
		simpleCycles->prev = NULL;

		for (cycle=simpleCycles; cycle!=NULL; cycle=cycle->next) {
			++numCycles;
		}

		dumpShallowGraphCycle(sgp, simpleCycles);
	} 

	/* garbage collection */
	for (idx=biconnectedComponents; idx; idx=tmp) {
		tmp = idx->next;
		dumpGraph(gp, idx);
	}
	dumpGraph(gp, forest);

	/* each cycle is found twice */
	return numCycles / 2;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r13
movq %rdi, %r14
callq 0xb2bf
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
movq %r13, %rcx
callq 0xb5f8
movq %rax, (%rsp)
movq 0x18(%rax), %r14
xorl %r15d, %r15d
xorl %ebp, %ebp
testq %r14, %r14
je 0xbb1a
movq %r14, %r12
movq %r12, %rdi
movq %r13, %rsi
callq 0xbb85
movq %rbp, %rdi
movq %rax, %rsi
callq 0x87c2
movq %rax, %rbp
movq 0x18(%r12), %r12
testq %r12, %r12
jne 0xbaf7
testq %rbp, %rbp
je 0xbb4b
movq 0x20(%rbp), %rax
xorl %r15d, %r15d
movq %r15, 0x18(%rax)
movq %r15, 0x20(%rbp)
movq %rbp, %rax
incl %r15d
movq 0x18(%rax), %rax
testq %rax, %rax
jne 0xbb31
movq %r13, %rdi
movq %rbp, %rsi
callq 0x14b75
shrl %r15d
testq %r14, %r14
je 0xbb67
movq 0x18(%r14), %r12
movq %rbx, %rdi
movq %r14, %rsi
callq 0x14832
movq %r12, %r14
testq %r12, %r12
jne 0xbb50
movq %rbx, %rdi
movq (%rsp), %rsi
callq 0x14832
movl %r15d, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: listCycles
struct ShallowGraph* listCycles(struct Graph *g, struct ShallowGraphPool *sgp) {
	int i;
	struct ShallowGraph* result = NULL;


	/* TODO should be: for each cycle start vertex */
	for (i=0; i<g->n; ++i) {
		/* check if this one belongs to some union of cycles */
		/* TODO remove this as we just compute stuff for cycle start vertices */
		if ((g->vertices[i] != NULL) && (g->vertices[i]->neighborhood != NULL)) {


			struct ShallowGraph *currentPath = getShallowGraph(sgp);
			struct ShallowGraph *newCycle;


			g->vertices[i]->visited = 1;

			newCycle = __backtrack(g, g->vertices[i], g->vertices[i], g->vertices[i], i, currentPath, sgp);

			result = addComponent(result, newCycle);

			dumpShallowGraph(sgp, currentPath);
			g->vertices[i]->visited = 0;
		}
	}

	return result;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
cmpl $0x0, (%rdi)
jle 0xbc22
movq %rsi, %rbx
movq %rdi, %r14
xorl %r15d, %r15d
xorl %r12d, %r12d
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rax
testq %rax, %rax
je 0xbc15
cmpq $0x0, 0x8(%rax)
je 0xbc15
movq %rbx, %rdi
callq 0x14aae
movq %rax, %r13
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rcx
movl $0x1, 0x1c(%rcx)
movq %rbx, (%rsp)
movq %r14, %rdi
movq %rcx, %rsi
movq %rcx, %rdx
movl %r15d, %r8d
movq %r13, %r9
callq 0xbea7
movq %r12, %rdi
movq %rax, %rsi
callq 0x87c2
movq %rax, %r12
movq %rbx, %rdi
movq %r13, %rsi
callq 0x14b19
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rax
movl $0x0, 0x1c(%rax)
incq %r15
movslq (%r14), %rax
cmpq %rax, %r15
jl 0xbba7
jmp 0xbc25
xorl %r12d, %r12d
movq %r12, %rax
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: getNumberOfNonIsoCycles
int getNumberOfNonIsoCycles(struct Graph* g, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct Graph* tmp;
	struct Graph* idx;
	int numCycles;

	/* find biconnected Components */
	struct ShallowGraph* h = listBiconnectedComponents(g, sgp);
	struct Graph* forest = partitionIntoForestAndCycles(h, g, gp, sgp);
	/* TODO refactor */
	struct Graph* biconnectedComponents = forest->next;

	/* list all cycles */
	struct ShallowGraph* simpleCycles = NULL;
	struct ShallowGraph* cyclePatterns = NULL;
	struct Vertex* cyclePatternSearchTree = NULL;

	for (idx=biconnectedComponents; idx; idx=idx->next) {
		simpleCycles = addComponent(simpleCycles, listCycles(idx, sgp));
	}

	/* if cycles were found, compute canonical strings */
	if (simpleCycles) {
		/* transform cycle of shallow graphs to a list */
		simpleCycles->prev->next = NULL;
		simpleCycles->prev = NULL;

		cyclePatterns = getCyclePatterns(simpleCycles, sgp);
		cyclePatternSearchTree = buildSearchTree(cyclePatterns, gp, sgp);

		numCycles = cyclePatternSearchTree->number;
	} else {
		numCycles = 0;
	}

	/* garbage collection */

	/* dump cycles, if any
	 * TODO may be moved upwards directly after finding simple cycles */
	if (cyclePatternSearchTree) {
			dumpSearchTree(gp, cyclePatternSearchTree);
	}

	/* dump biconnected components list */
	for (idx=biconnectedComponents; idx; idx=tmp) {
		tmp = idx->next;
		dumpGraph(gp, idx);
	}

	dumpGraph(gp, forest);

	/* each cycle is found twice */
	return numCycles / 2;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r13
movq %rdi, %r14
callq 0xb2bf
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
movq %r13, %rcx
callq 0xb5f8
movq %rax, (%rsp)
movq 0x18(%rax), %r14
xorl %r12d, %r12d
xorl %ebp, %ebp
testq %r14, %r14
je 0xbc97
movq %r14, %r15
movq %r15, %rdi
movq %r13, %rsi
callq 0xbb85
movq %rbp, %rdi
movq %rax, %rsi
callq 0x87c2
movq %rax, %rbp
movq 0x18(%r15), %r15
testq %r15, %r15
jne 0xbc75
testq %rbp, %rbp
je 0xbcd5
movq 0x20(%rbp), %rax
xorl %ecx, %ecx
movq %rcx, 0x18(%rax)
movq %rcx, 0x20(%rbp)
movq %rbp, %rdi
movq %r13, %rsi
callq 0x5d59
movq %rax, %rdi
movq %rbx, %rsi
movq %r13, %rdx
callq 0x1b712
movl 0x18(%rax), %ecx
movl %ecx, %r12d
shrl $0x1f, %r12d
addl %ecx, %r12d
sarl %r12d
jmp 0xbcd7
xorl %eax, %eax
testq %rax, %rax
je 0xbce7
movq %rbx, %rdi
movq %rax, %rsi
callq 0x1b644
testq %r14, %r14
je 0xbd03
movq 0x18(%r14), %r15
movq %rbx, %rdi
movq %r14, %rsi
callq 0x14832
movq %r15, %r14
testq %r15, %r15
jne 0xbcec
movq %rbx, %rdi
movq (%rsp), %rsi
callq 0x14832
movl %r12d, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: _findPathIntern
char __findPathIntern(struct Vertex* v, struct Vertex* parent, struct Vertex* target, int allowance, struct ShallowGraph* path, struct ShallowGraphPool* sgp) {
	struct VertexList *idx;
	char found = 0;


	/* this is an exception for the case where the target is the neighbor of parent
	 * and __backtrack calls findPath(target, parent, target, ...) */
	if (v == target) {
		return 1;
	}

	if (v->visited == 0) {

		v->lowPoint = 1;

		for (idx=v->neighborhood; idx; idx=idx->next) {

			if (idx->endPoint != parent) {
				/* this "removes" vertices that are too small from adjacency lists */
				if  (idx->endPoint->number >= allowance) {

					/* breaking condition: s is reached second argument avoids "cycles" of lenght 4
					 * of the type target-parent-v-parent-target */
					if (idx->endPoint == target){

						pushEdge(path, shallowCopyEdge(idx, sgp->listPool));
						return 1;

					} else {
						/* otherwise check if the endpoint was already visited. if not try recursively */
						if ((idx->endPoint->lowPoint == 0) && (idx->endPoint->visited == 0)) {

							found = __findPathIntern(idx->endPoint, v, target, allowance, path, sgp);

							/* if we have found a path, return this path via path */
							if (found) {
								pushEdge(path, shallowCopyEdge(idx, sgp->listPool));
								break;
							} /* fi found */
						} /* fi not visited */
					} /* esle endPoint = s */
				} /* fi >= allowance */
			} /* fi not parent */
		} /* rof */
	} /* fi */
	return found;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movb $0x1, %bl
cmpq %rdx, %rdi
je 0xbdb1
movq %rdi, %r14
cmpl $0x0, 0x1c(%rdi)
jne 0xbdaf
movl $0x1, 0x20(%r14)
movq 0x8(%r14), %r15
testq %r15, %r15
je 0xbdaf
movl %ecx, %ebp
movq %rdx, %r12
movq %rsi, %r13
movq %r8, 0x10(%rsp)
movq %r9, 0x8(%rsp)
movq 0x18(%r15), %rdi
cmpq %r13, %rdi
je 0xbda6
cmpl %ebp, 0x18(%rdi)
jl 0xbda6
cmpq %r12, %rdi
je 0xbdc2
cmpl $0x0, 0x20(%rdi)
jne 0xbda6
cmpl $0x0, 0x1c(%rdi)
jne 0xbda6
movq %r14, %rsi
movq %r12, %rdx
movl %ebp, %ecx
movq 0x10(%rsp), %r8
movq 0x8(%rsp), %r9
callq 0xbd21
movq 0x8(%rsp), %r9
movq 0x10(%rsp), %r8
testb %al, %al
jne 0xbdc2
movq 0x8(%r15), %r15
testq %r15, %r15
jne 0xbd62
xorl %ebx, %ebx
movl %ebx, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq 0x10(%r9), %rsi
movq %r15, %rdi
movq %r8, %r14
callq 0x7bc0
movq %r14, %rdi
movq %rax, %rsi
callq 0x840c
jmp 0xbdb1
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: _cleanUpLowPoint
void __cleanUpLowPoint(struct Vertex*v) {
	struct VertexList* idx;
	v->lowPoint = 0;
	for (idx=v->neighborhood; idx; idx=idx->next) {
		if (idx->endPoint->lowPoint != 0) {
			__cleanUpLowPoint(idx->endPoint);
		}
	}
}

// Assembly:
pushq %rbx
movl $0x0, 0x20(%rdi)
movq 0x8(%rdi), %rbx
testq %rbx, %rbx
je 0xbe04
movq 0x18(%rbx), %rdi
cmpl $0x0, 0x20(%rdi)
je 0xbdfe
callq 0xbdde
movq 0x8(%rbx), %rbx
jmp 0xbdea
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: _DFS
char __DFS(struct Vertex* v, struct Vertex* parent, struct Vertex* target, int allowance) {
	struct VertexList* idx;
	char flag = 0;

	if(v->number == target->number)
		return 1;

	/* mark current vertex as visited */
	v->d = 1;

	for (idx=v->neighborhood; idx; idx=idx->next) {
		/* do not consider vertices smaller than allowance and not the edge back to the parent, also only from desired bicomp */
		if ((idx->endPoint->number >= allowance) && (idx->endPoint->number != parent->number)) {
			if (!flag) {
				if (idx->endPoint->number == target->number)
					flag = 1;
				else if (idx->endPoint->d == 0)
					flag = __DFS(idx->endPoint, v, target, allowance);
			}
		}
	}

	return flag;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movl %ecx, %ebx
movl 0x18(%rdi), %ecx
movb $0x1, %al
cmpl 0x18(%rdx), %ecx
je 0xbe9d
movq %rdi, %r12
movl $0x1, 0x28(%rdi)
movq 0x8(%rdi), %r13
testq %r13, %r13
je 0xbe9b
movq %rdx, %r14
movq %rsi, %r15
xorl %eax, %eax
movq 0x18(%r13), %rdi
movl 0x18(%rdi), %ecx
cmpl %ebx, %ecx
jl 0xbe90
cmpl 0x18(%r15), %ecx
sete %dl
testb %al, %al
setne %sil
orb %dl, %sil
jne 0xbe90
movb $0x1, %al
cmpl 0x18(%r14), %ecx
je 0xbe90
cmpl $0x0, 0x28(%rdi)
je 0xbe83
xorl %eax, %eax
jmp 0xbe90
movq %r12, %rsi
movq %r14, %rdx
movl %ebx, %ecx
callq 0xbe24
movq 0x8(%r13), %r13
testq %r13, %r13
jne 0xbe54
jmp 0xbe9d
xorl %eax, %eax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listCycles.c
// Function: listCyclesOfLength
struct ShallowGraph* listCyclesOfLength(struct Graph *g, int cycleLength, struct ShallowGraphPool *sgp) {
	struct ShallowGraph* result = listCycles(g, sgp);

	if (result) {

		struct ShallowGraph* last = result->prev;
		for (struct ShallowGraph* c=result; c!=last; ) {
			if (c->m != cycleLength) {
				struct ShallowGraph* dump = c;
				dump->prev->next = dump->next;
				dump->next->prev = dump->prev;
				c = dump->next;
				dumpShallowGraph(sgp, dump);
			} else {
				c = c->next;
			}
		}
		if (last->m != cycleLength) {
			struct ShallowGraph* c = last;
			if (c->prev == last) {
				last = NULL;
			} else {
				c->prev->next = c->next;
				c->next->prev = c->prev;
				last = c->next;
			}
			dumpShallowGraph(sgp, c);
		}
		result = last;
	}

	return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movl %esi, %ebp
movq %rdx, %rsi
callq 0xbb85
testq %rax, %rax
je 0xc28b
movq %rax, %rsi
movq 0x20(%rax), %r14
cmpq %r14, %rax
je 0xc26a
movq 0x18(%rsi), %r15
cmpl %ebp, 0x10(%rsi)
je 0xc262
movq 0x20(%rsi), %rax
movq %r15, 0x18(%rax)
movq 0x18(%rsi), %r15
movq %rax, 0x20(%r15)
movq %rbx, %rdi
callq 0x14b19
movq %r15, %rsi
cmpq %r14, %r15
jne 0xc241
cmpl %ebp, 0x10(%r14)
je 0xc2a1
movq 0x20(%r14), %rax
cmpq %r14, %rax
je 0xc290
movq 0x18(%r14), %rcx
movq %rcx, 0x18(%rax)
movq 0x18(%r14), %r15
movq %rax, 0x20(%r15)
jmp 0xc293
xorl %r14d, %r14d
jmp 0xc2a1
xorl %r15d, %r15d
movq %rbx, %rdi
movq %r14, %rsi
callq 0x14b19
movq %r15, %r14
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: _visit
void __visit(struct Vertex* v, int component, int* components) {
	struct VertexList* e;

	if (components[v->number] != -1) {
		return;
	}

	components[v->number] = component;

	for (e=v->neighborhood; e!=NULL; e=e->next) {
		__visit(e->endPoint, component, components);
	}
}

// Assembly:
movslq 0x18(%rdi), %rax
cmpl $-0x1, (%rdx,%rax,4)
je 0xc2bb
retq
pushq %rbp
pushq %r14
pushq %rbx
movq %rdx, %rbx
movl %esi, %ebp
movl %esi, (%rdx,%rax,4)
movq 0x8(%rdi), %r14
testq %r14, %r14
je 0xc2e4
movq 0x18(%r14), %rdi
movl %ebp, %esi
movq %rbx, %rdx
callq 0xc2b0
movq 0x8(%r14), %r14
jmp 0xc2cb
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: _selectB
struct ShallowGraph* __selectB(struct Graph* partialTree, struct ShallowGraph* rest, int* components, int n, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* B = getShallowGraph(sgp);
	struct VertexList* e;

	for (int v=0; v<n; ++v) {
		components[v] = -1;
	}

	/* mark connected components */
	for (int v=0; v<n; ++v) {
		__visit(partialTree->vertices[v], v, components);
	}

	for (e=rest->edges; e!=NULL; e=e->next) {
		int v = e->startPoint->number;
		int w = e->endPoint->number;
		if ((components[v] != -1) && (components[w] != -1) && (components[v] == components[w])) {
			e->flag = 1;
		}
	}

	B->next = getShallowGraph(sgp);
	for (e=rest->edges; e!=NULL; e=rest->edges) {
		if (e->flag == 1) {
			pushEdge(B, popEdge(rest));
		} else {
			pushEdge(B->next, popEdge(rest));
		}
	}
	return B;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %ecx, %ebp
movq %rdx, %r12
movq %rsi, %rbx
movq %rdi, %r13
movq %r8, (%rsp)
movq %r8, %rdi
callq 0x14aae
movq %rax, %r14
movl %ebp, %r15d
testl %ebp, %ebp
jle 0xc32a
leaq (,%r15,4), %rdx
movq %r12, %rdi
movl $0xff, %esi
callq 0x10d0
testl %ebp, %ebp
jle 0xc34a
xorl %ebp, %ebp
movq 0x10(%r13), %rax
movq (%rax,%rbp,8), %rdi
movl %ebp, %esi
movq %r12, %rdx
callq 0xc2b0
incq %rbp
cmpq %rbp, %r15
jne 0xc330
movq (%rbx), %rax
testq %rax, %rax
je 0xc37e
movq 0x10(%rax), %rcx
movslq 0x18(%rcx), %rcx
movl (%r12,%rcx,4), %ecx
cmpl $-0x1, %ecx
je 0xc378
movq 0x18(%rax), %rdx
movslq 0x18(%rdx), %rdx
cmpl (%r12,%rdx,4), %ecx
jne 0xc378
movl $0x1, 0x24(%rax)
movq 0x8(%rax), %rax
jmp 0xc34d
movq (%rsp), %rdi
callq 0x14aae
movq %rax, 0x18(%r14)
movq (%rbx), %rax
testq %rax, %rax
je 0xc3b5
cmpl $0x1, 0x24(%rax)
movq %r14, %r15
je 0xc3a0
movq 0x18(%r14), %r15
movq %rbx, %rdi
callq 0x8891
movq %r15, %rdi
movq %rax, %rsi
callq 0x840c
jmp 0xc38b
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: _getGraphAndNonGraphEdges
struct ShallowGraph* __getGraphAndNonGraphEdges(struct Graph* graph, struct ShallowGraph* list, struct ShallowGraphPool* sgp) {
	struct VertexList* e;
	struct ShallowGraph* graphEdges = getShallowGraph(sgp);
	struct ShallowGraph* nonGraphEdges = getShallowGraph(sgp);

	/* mark edges that are in graph */
	for (e=list->edges; e!=NULL; e=e->next) {
		e->flag = isNeighbor(graph, e->startPoint->number, e->endPoint->number);
	}

	/* consume list putting differently flagged edges in different lists */
	for (e=list->edges; e!=NULL; e=list->edges) {
		if (e->flag == 1) {
			pushEdge(graphEdges, popEdge(list));
		} else {
			pushEdge(nonGraphEdges, popEdge(list));
		}
	}
	dumpShallowGraph(sgp, list);

	graphEdges->next = nonGraphEdges;
	nonGraphEdges->prev = graphEdges;
	return graphEdges;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %rbx
movq %rdi, %r13
movq %rdx, %rdi
callq 0x14aae
movq %rax, %r15
movq %r14, %rdi
callq 0x14aae
movq %rax, %r12
movq (%rbx), %rbp
testq %rbp, %rbp
je 0xc439
movq 0x10(%rbp), %rax
movq 0x18(%rbp), %rcx
movl 0x18(%rax), %esi
movl 0x18(%rcx), %edx
movq %r13, %rdi
callq 0x834e
movsbl %al, %eax
movl %eax, 0x24(%rbp)
movq 0x8(%rbp), %rbp
jmp 0xc3f4
movl 0x24(%rax), %ebp
movq %rbx, %rdi
callq 0x8891
movq %r15, %rdi
cmpl $0x1, %ebp
je 0xc431
movq %r12, %rdi
movq %rax, %rsi
callq 0x840c
movq (%rbx), %rax
testq %rax, %rax
jne 0xc41b
movq %r14, %rdi
movq %rbx, %rsi
callq 0x14b19
movq %r12, 0x18(%r15)
movq %r15, 0x20(%r12)
movq %r15, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: _getNonTreeBridges
struct ShallowGraph* __getNonTreeBridges(struct Graph* graph, struct Graph* partialTree, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* tmp = getShallowGraph(sgp);
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(graph, sgp);
	struct ShallowGraph* idx;
	struct ShallowGraph* nonTreeBridges;

	/* find bridges in graph */
	for (idx=biconnectedComponents; idx; idx=idx->next) {
		if (idx->m == 1) {
			pushEdge(tmp, popEdge(idx));
		} 
	}
	dumpShallowGraphCycle(sgp, biconnectedComponents);

	tmp = __getGraphAndNonGraphEdges(partialTree, tmp, sgp);
	nonTreeBridges = tmp->next;
	tmp->next = NULL;
	dumpShallowGraph(sgp, tmp);

	return nonTreeBridges;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r12
movq %rdx, %rdi
callq 0x14aae
movq %rax, %r15
movq %r12, %rdi
movq %rbx, %rsi
callq 0xb2bf
movq %rax, %r12
testq %rax, %rax
je 0xc4bd
movq %r12, %r13
cmpl $0x1, 0x10(%r13)
jne 0xc4b4
movq %r13, %rdi
callq 0x8891
movq %r15, %rdi
movq %rax, %rsi
callq 0x840c
movq 0x18(%r13), %r13
testq %r13, %r13
jne 0xc49a
movq %rbx, %rdi
movq %r12, %rsi
callq 0x14b75
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0xc3c7
movq 0x18(%rax), %r14
movq $0x0, 0x18(%rax)
movq %rbx, %rdi
movq %rax, %rsi
callq 0x14b19
movq %r14, %rax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: listSpanningTrees
struct ShallowGraph* listSpanningTrees(struct Graph* original, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	
	struct Graph* graph = cloneGraph(original, gp);
	struct Graph* partialTree = emptyGraph(original, gp);
	struct ShallowGraph* result = NULL;
	int* components = malloc(sizeof(int) * original->n);
	struct ShallowGraph* idx;

	/* add all bridges to partialTree */
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(original, sgp);
	for (idx=biconnectedComponents; idx; idx=idx->next) {
		struct VertexList* e = idx->edges;
		if (idx->m == 1) {
			addEdgeBetweenVertices(e->startPoint->number, e->endPoint->number, e->label, partialTree, gp);
		}
	}
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	
	/* do the backtrack, baby */
	result = __rec(0, graph, partialTree, components, graph->n, sgp, gp);
	result->prev->next = NULL;
	result->prev = NULL;

	/* edges in result point to vertices in partialTree this has to be changed */
	rebaseShallowGraphs(result, original);

	/* garbage collection */
	free(components);
	dumpGraph(gp, graph);
	dumpGraph(gp, partialTree);

	return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, %rbx
movq %rsi, %r13
movq %rdi, %r12
movq %rdx, %rsi
callq 0x7f7e
movq %rax, 0x10(%rsp)
movq %r12, %rdi
movq %rbx, %rsi
callq 0x84f8
movq %rax, %r15
movslq (%r12), %rdi
shlq $0x2, %rdi
callq 0x1190
movq %rax, 0x8(%rsp)
movq %r12, %rdi
movq %r13, %rsi
callq 0xb2bf
movq %rax, %r14
testq %rax, %rax
je 0xc76f
movq %r14, %rbp
cmpl $0x1, 0x10(%rbp)
jne 0xc766
movq (%rbp), %rax
movq (%rax), %rdx
movq 0x10(%rax), %rcx
movl 0x18(%rcx), %edi
movq 0x18(%rax), %rax
movl 0x18(%rax), %esi
movq %r15, %rcx
movq %rbx, %r8
callq 0x8425
movq 0x18(%rbp), %rbp
testq %rbp, %rbp
jne 0xc740
movq %r13, %rdi
movq %r14, %rsi
callq 0x14b75
movq 0x10(%rsp), %rbp
movl (%rbp), %r8d
movq %rbx, (%rsp)
xorl %edi, %edi
movq %rbp, %rsi
movq %r15, %rdx
movq 0x8(%rsp), %r14
movq %r14, %rcx
movq %r13, %r9
callq 0xc4fa
movq %rax, %r13
movq 0x20(%rax), %rax
xorl %ecx, %ecx
movq %rcx, 0x18(%rax)
movq %rcx, 0x20(%r13)
movq %r13, %rdi
movq %r12, %rsi
callq 0x873a
movq %r14, %rdi
callq 0x1030
movq %rbx, %rdi
movq %rbp, %rsi
callq 0x14832
movq %rbx, %rdi
movq %r15, %rsi
callq 0x14832
movq %r13, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: countSpanningTrees
long int countSpanningTrees(struct Graph* original, long int maxBound, struct ShallowGraphPool* sgp, struct GraphPool* gp) {

	struct Graph* graph = cloneGraph(original, gp);
	struct Graph* partialTree = emptyGraph(original, gp);
	long int result;
	int* components = malloc(sizeof(int) * original->n);
	struct ShallowGraph* idx;

	/* add all bridges to partialTree */
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(original, sgp);
	for (idx=biconnectedComponents; idx; idx=idx->next) {
		struct VertexList* e = idx->edges;
		if (idx->m == 1) {
			addEdgeBetweenVertices(e->startPoint->number, e->endPoint->number, e->label, partialTree, gp);
		}
	}
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	
	/* do the backtrack, baby */
	result = __recCount(maxBound, graph, partialTree, components, graph->n, sgp, gp);

	/* garbage collection */
	free(components);
	dumpGraph(gp, graph);
	dumpGraph(gp, partialTree);

	return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x10(%rsp)
movq %rdi, %r13
movq %rcx, %rsi
callq 0x7f7e
movq %rax, %r14
movq %r13, %rdi
movq %rbx, %rsi
callq 0x84f8
movq %rax, %r15
movslq (%r13), %rdi
shlq $0x2, %rdi
callq 0x1190
movq %rax, 0x8(%rsp)
movq %r13, %rdi
movq %r12, %rsi
callq 0xb2bf
movq %rax, %rbp
testq %rax, %rax
je 0xce13
movq %rbp, %r13
cmpl $0x1, 0x10(%r13)
jne 0xce0a
movq (%r13), %rax
movq (%rax), %rdx
movq 0x10(%rax), %rcx
movl 0x18(%rcx), %edi
movq 0x18(%rax), %rax
movl 0x18(%rax), %esi
movq %r15, %rcx
movq %rbx, %r8
callq 0x8425
movq 0x18(%r13), %r13
testq %r13, %r13
jne 0xcde3
movq %r12, %rdi
movq %rbp, %rsi
callq 0x14b75
movl (%r14), %r8d
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %r14, %rsi
movq %r15, %rdx
movq 0x8(%rsp), %r13
movq %r13, %rcx
movq %r12, %r9
callq 0xcb33
movq %rax, %r12
movq %r13, %rdi
callq 0x1030
movq %rbx, %rdi
movq %r14, %rsi
callq 0x14832
movq %rbx, %rdi
movq %r15, %rsi
callq 0x14832
movq %r12, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/listSpanningTrees.c
// Function: countNonisomorphicSpanningTrees
int countNonisomorphicSpanningTrees(struct Graph* g, struct GraphPool* gp, struct ShallowGraphPool* sgp) {
	int i = 0;

	struct Vertex* searchTree = getVertex(gp->vertexPool);

	// list the spanning trees, canonicalize them and add them in a search tree (to avoid duplicates, i.e. isomorphic spanning trees
	struct ShallowGraph* sample = listSpanningTrees(g, sgp, gp);
	for (struct ShallowGraph* tree=sample; tree!=NULL; tree=tree->next) {
		if (tree->m != 0) {
			struct Graph* tmp = shallowGraphToGraph(tree, gp);
			struct ShallowGraph* cString = canonicalStringOfTree(tmp, sgp);
			addToSearchTree(searchTree, cString, gp, sgp);
			/* garbage collection */
			dumpGraph(gp, tmp);
		}
	}

	// this is the number of isomorphism classes
	i = searchTree->d;

	dumpShallowGraphCycle(sgp, sample);
	dumpSearchTree(gp, searchTree);

	return i;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %rbx
movq %rdi, %r12
movq 0x10(%rsi), %rdi
callq 0x145b2
movq %rax, %r15
movq %r12, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0xc6e6
movq %rax, %r12
testq %rax, %rax
je 0xcef1
movq %r12, %r13
cmpl $0x0, 0x10(%r13)
je 0xcee8
movq %r13, %rdi
movq %rbx, %rsi
callq 0x81e0
movq %rax, %rbp
movq %rax, %rdi
movq %r14, %rsi
callq 0x78fc
movq %r15, %rdi
movq %rax, %rsi
movq %rbx, %rdx
movq %r14, %rcx
callq 0x1af0f
movq %rbx, %rdi
movq %rbp, %rsi
callq 0x14832
movq 0x18(%r13), %r13
testq %r13, %r13
jne 0xceac
movl 0x28(%r15), %ebp
movq %r14, %rdi
movq %r12, %rsi
callq 0x14b75
movq %rbx, %rdi
movq %r15, %rsi
callq 0x1b644
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/loading.c
// Function: initCache
void initCache() {
	HEAD_SIZE = malloc(sizeof(size_t));
	*HEAD_SIZE = 2048;
	HEAD_PTR = malloc(sizeof(char*));
	*HEAD_PTR = malloc(*HEAD_SIZE * sizeof(char));

	VERTEX_SIZE = malloc(sizeof(size_t));
	*VERTEX_SIZE = 2048;
	VERTEX_PTR = malloc(sizeof(char*));
	*VERTEX_PTR = malloc(*VERTEX_SIZE * sizeof(char));

	EDGE_SIZE = malloc(sizeof(size_t));
	*EDGE_SIZE = 2048;
	EDGE_PTR = malloc(sizeof(char*));
	*EDGE_PTR = malloc(*EDGE_SIZE * sizeof(char));
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movl $0x8, %edi
callq 0x1190
movq %rax, 0x20027(%rip)     # 0x2d198
movl $0x800, %r14d           # imm = 0x800
movq %r14, (%rax)
movl $0x8, %edi
callq 0x1190
movq %rax, %rbx
movq %rax, 0x20002(%rip)     # 0x2d190
movl $0x800, %edi            # imm = 0x800
callq 0x1190
movq %rax, (%rbx)
movl $0x8, %edi
callq 0x1190
movq %rax, 0x1fffc(%rip)     # 0x2d1a8
movq %r14, (%rax)
movl $0x8, %edi
callq 0x1190
movq %rax, %rbx
movq %rax, 0x1ffdd(%rip)     # 0x2d1a0
movl $0x800, %edi            # imm = 0x800
callq 0x1190
movq %rax, (%rbx)
movl $0x8, %edi
callq 0x1190
movq %rax, 0x1ffd7(%rip)     # 0x2d1b8
movq %r14, (%rax)
movl $0x8, %edi
callq 0x1190
movq %rax, %rbx
movq %rax, 0x1ffb8(%rip)     # 0x2d1b0
movl $0x800, %edi            # imm = 0x800
callq 0x1190
movq %rax, (%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/loading.c
// Function: createFileIterator
void createFileIterator(char* filename, struct GraphPool* p) {

	if ((FI_DATABASE = fopen(filename, "r"))) {
		FI_GP = p;
		initCache();
	} else {
		printf("File %s not found\n", filename);
	}

}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x12edf(%rip), %rsi     # 0x200fd
callq 0x11d0
movq %rax, 0x1ff56(%rip)     # 0x2d180
testq %rax, %rax
je 0xd242
movq %r14, 0x1ff52(%rip)     # 0x2d188
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0xd15c
leaq 0x133ab(%rip), %rdi     # 0x205f4
movq %rbx, %rsi
xorl %eax, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x10b0
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/loading.c
// Function: destroyFileIterator
void destroyFileIterator() {
	fclose(FI_DATABASE);
	
	free(HEAD_SIZE);
	free(*HEAD_PTR);
	free(HEAD_PTR);
	HEAD_PTR = NULL;
	HEAD_SIZE = NULL;

	free(VERTEX_SIZE);
	free(*VERTEX_PTR);
	free(VERTEX_PTR);
	VERTEX_PTR = NULL;
	VERTEX_SIZE = NULL;

	free(EDGE_SIZE);
	free(*EDGE_PTR);
	free(EDGE_PTR);
	EDGE_PTR = NULL;
	EDGE_SIZE = NULL;
}

// Assembly:
pushq %rbx
movq 0x1ff01(%rip), %rdi     # 0x2d180
callq 0x1090
movq 0x1ff0d(%rip), %rdi     # 0x2d198
callq 0x1030
movq 0x1fef9(%rip), %rax     # 0x2d190
movq (%rax), %rdi
callq 0x1030
movq 0x1feea(%rip), %rdi     # 0x2d190
callq 0x1030
xorl %ebx, %ebx
movq %rbx, 0x1fedc(%rip)     # 0x2d190
movq %rbx, 0x1fedd(%rip)     # 0x2d198
movq 0x1fee6(%rip), %rdi     # 0x2d1a8
callq 0x1030
movq 0x1fed2(%rip), %rax     # 0x2d1a0
movq (%rax), %rdi
callq 0x1030
movq 0x1fec3(%rip), %rdi     # 0x2d1a0
callq 0x1030
movq %rbx, 0x1feb7(%rip)     # 0x2d1a0
movq %rbx, 0x1feb8(%rip)     # 0x2d1a8
movq 0x1fec1(%rip), %rdi     # 0x2d1b8
callq 0x1030
movq 0x1fead(%rip), %rax     # 0x2d1b0
movq (%rax), %rdi
callq 0x1030
movq 0x1fe9e(%rip), %rdi     # 0x2d1b0
callq 0x1030
movq %rbx, 0x1fe92(%rip)     # 0x2d1b0
movq %rbx, 0x1fe93(%rip)     # 0x2d1b8
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/loading.c
// Function: parseEdgeNew
static inline int parseEdgeNew(const char** currentPosition, int* v, int* w, char** label) {
	*v = fastAtoi(currentPosition);
	*w = fastAtoi(currentPosition);
	grabLabel(currentPosition, label);
	return (*v != -1) + (*w != -1) + (*label != NULL);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, %r13
movq %rdi, %r15
movq (%rdi), %r14
callq 0x1260
movq (%rax), %rdx
decq %r14
movsbq 0x1(%r14), %rcx
incq %r14
testb $0x20, 0x1(%rdx,%rcx,2)
jne 0xd938
addl $-0x30, %ecx
xorl %edx, %edx
movq %r14, %rsi
cmpl $0x9, %ecx
ja 0xd96e
xorl %edx, %edx
movq %r14, %rsi
leal (%rdx,%rdx,4), %edx
leal (%rcx,%rdx,2), %edx
movsbl 0x1(%rsi), %ecx
incq %rsi
addl $-0x30, %ecx
cmpl $0xa, %ecx
jb 0xd959
cmpq %rsi, %r14
je 0xd978
movq %rsi, (%r15)
jmp 0xd97d
movl $0xffffffff, %edx       # imm = 0xFFFFFFFF
movl %edx, (%r13)
movq (%r15), %rcx
movq (%rax), %rsi
decq %rcx
movsbq 0x1(%rcx), %rdx
incq %rcx
testb $0x20, 0x1(%rsi,%rdx,2)
jne 0xd98a
addl $-0x30, %edx
xorl %r14d, %r14d
movq %rcx, %rsi
cmpl $0x9, %edx
ja 0xd9c4
xorl %r14d, %r14d
movq %rcx, %rsi
leal (%r14,%r14,4), %edi
leal (%rdx,%rdi,2), %r14d
movsbl 0x1(%rsi), %edx
incq %rsi
addl $-0x30, %edx
cmpl $0xa, %edx
jb 0xd9ad
cmpq %rsi, %rcx
je 0xd9ce
movq %rsi, (%r15)
jmp 0xd9d4
movl $0xffffffff, %r14d      # imm = 0xFFFFFFFF
movl %r14d, (%r12)
movq $0x0, (%rbx)
movq (%r15), %rcx
movq (%rax), %rax
movsbq (%rcx), %rdx
testb $0x20, 0x1(%rax,%rdx,2)
movq %r15, 0x8(%rsp)
jne 0xd9fa
xorl %r12d, %r12d
jmp 0xda10
xorl %r12d, %r12d
movsbq 0x1(%rcx,%r12), %rdx
incq %r12
testb $0x20, 0x1(%rax,%rdx,2)
jne 0xd9fd
addq %r12, %rcx
movq %r13, 0x10(%rsp)
movsbq (%rcx), %rdx
testb $0x20, 0x1(%rax,%rdx,2)
jne 0xda35
xorl %r13d, %r13d
movsbq 0x1(%rcx,%r13), %rdx
incq %r13
testb $0x20, 0x1(%rax,%rdx,2)
je 0xda23
jmp 0xda38
xorl %r13d, %r13d
testq %r13, %r13
je 0xda73
leaq 0x1(%r13), %rdi
callq 0x1190
movq %rax, (%rbx)
testq %rax, %rax
je 0xda73
movq %rax, %rbp
movq 0x8(%rsp), %r15
addq (%r15), %r12
movq %rax, %rdi
movq %r12, %rsi
movq %r13, %rdx
callq 0x1170
movb $0x0, (%rbp,%r13)
addq %r13, %r12
movq %r12, (%r15)
xorl %ecx, %ecx
movq 0x10(%rsp), %rax
cmpl $-0x1, (%rax)
setne %cl
xorl %eax, %eax
cmpl $-0x1, %r14d
setne %al
addl %ecx, %eax
cmpq $0x1, (%rbx)
sbbl $-0x1, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/loading.c
// Function: intLabel
char* intLabel(const unsigned int label) {
	int bufferSize;
	char* representation;
	
	if (label>1) {
		bufferSize = (int)ceil(log10(label)) + 2;
	} else {
		bufferSize = 3;
	}

	representation = malloc(bufferSize * sizeof(char));
	if (representation) {
		sprintf(representation, "%i", label);
	}
	return representation;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movl %edi, %ebx
movl $0x3, %edi
cmpl $0x2, %ebx
jb 0xde0e
movl %ebx, %eax
cvtsi2sd %rax, %xmm0
callq 0x1150
callq 0x1240
cvttsd2si %xmm0, %eax
addl $0x2, %eax
movslq %eax, %rdi
callq 0x1190
movq %rax, %r14
testq %rax, %rax
je 0xde2e
leaq 0x13788(%rip), %rsi     # 0x215aa
movq %r14, %rdi
movl %ebx, %edx
xorl %eax, %eax
callq 0x1210
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasiness.c
// Function: getMaxLocalEasiness
int getMaxLocalEasiness(struct Graph* g, long int maxBound, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	long int max = -1;
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
	long int* easiness = computeLocalEasinessExactly(biconnectedComponents, g->n, maxBound, gp, sgp);
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	for (int v=0; v<g->n; ++v) {
		// problem occurred. counting did not work
		if (easiness[v] == 0) {
			return -1;
		}
		if (easiness[v] > max) {
			max = easiness[v];
		}
	}
	free(easiness);
	return (max > (long int)INT_MAX) ? -1 : (int)max;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rcx, %r14
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
movq %rcx, %rsi
callq 0xb2bf
movq %rax, %r13
movl (%r12), %esi
movq %rax, %rdi
movq %r15, %rdx
movq %rbx, %rcx
movq %r14, %r8
callq 0xe53c
movq %rax, %rbx
movq %r14, %rdi
movq %r13, %rsi
callq 0x14b75
movslq (%r12), %rax
movq $-0x1, %r14
testq %rax, %rax
jle 0xe78b
xorl %ecx, %ecx
movq (%rbx,%rcx,8), %rdx
testq %rdx, %rdx
je 0xe7a5
cmpq %r14, %rdx
cmovgq %rdx, %r14
incq %rcx
cmpq %rcx, %rax
jne 0xe773
movq %rbx, %rdi
callq 0x1030
cmpq $0x7fffffff, %r14       # imm = 0x7FFFFFFF
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmovlel %r14d, %eax
jmp 0xe7aa
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasiness.c
// Function: getMinLocalEasiness
int getMinLocalEasiness(struct Graph* g, long int maxBound, struct GraphPool* gp, struct ShallowGraphPool* sgp) {
	long int min = -1;
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
	long int* easiness = computeLocalEasinessExactly(biconnectedComponents, g->n, maxBound, gp, sgp);
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	for (int v=0; v<g->n; ++v) {
		// error occurred. skip it.
		if (easiness[v] == 0) {
			continue;
		}
		if ((easiness[v] < min) || (min == -1)) {
			min = easiness[v];
		}
	}
	free(easiness);
	return (min > (long int)INT_MAX) ? -1 : (int)min;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rcx, %r14
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
movq %rcx, %rsi
callq 0xb2bf
movq %rax, %r13
movl (%r12), %esi
movq %rax, %rdi
movq %r15, %rdx
movq %rbx, %rcx
movq %r14, %r8
callq 0xe53c
movq %rax, %rbx
movq %r14, %rdi
movq %r13, %rsi
callq 0x14b75
movslq (%r12), %rax
testq %rax, %rax
jle 0xe833
movq $-0x1, %rdx
xorl %ecx, %ecx
movq %rdx, %r14
movq (%rbx,%rcx,8), %rsi
cmpq %rdx, %rsi
cmovlq %rsi, %r14
cmpq $-0x1, %rdx
cmoveq %rsi, %r14
testq %rsi, %rsi
cmoveq %rdx, %r14
incq %rcx
movq %r14, %rdx
cmpq %rcx, %rax
jne 0xe80c
jmp 0xe83a
movq $-0x1, %r14
movq %rbx, %rdi
callq 0x1030
cmpq $0x7fffffff, %r14       # imm = 0x7FFFFFFF
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmovlel %r14d, %eax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: lowPointComparator
static int lowPointComparator(const void* a, const void* b) {
	struct Vertex* v = *(struct Vertex**)a;
	struct Vertex* w = *(struct Vertex**)b;

	int depthDiff = v->lowPoint - w->lowPoint;
	int parentDepthDiff = v->visited - w->visited;
	return (depthDiff != 0) ? depthDiff : parentDepthDiff;
}

// Assembly:
movq (%rdi), %rax
movq (%rsi), %rcx
movl 0x1c(%rax), %edx
movl 0x20(%rax), %eax
subl 0x1c(%rcx), %edx
subl 0x20(%rcx), %eax
cmovel %edx, %eax
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: spanningTreeConverter
struct Graph* spanningTreeConverter(struct ShallowGraph* localTrees, struct Graph* component, struct GraphPool* gp, struct ShallowGraphPool* sgp) {
	struct Graph* resultingTrees = NULL;
	for (struct ShallowGraph* tree=popShallowGraph(&localTrees); tree!=NULL; tree=popShallowGraph(&localTrees)) {

		struct Graph* result = emptyGraph(component, gp);
		result->m = tree->m;
		// copy root information
		for (int v=0; v<result->n; ++v) {
			result->vertices[v]->d = component->vertices[v]->d;
		}

		// transfer edges, add to vertices
		rebaseShallowGraphs(tree, result);
		for (struct VertexList* e=popEdge(tree); e!=NULL; e=popEdge(tree)) {
			addEdge(e->startPoint, e);
			addEdge(e->endPoint, inverseEdge(e, gp->listPool));
		}
		dumpShallowGraph(sgp, tree);
		result->next = resultingTrees;
		resultingTrees = result;
	}
	return resultingTrees;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, 0x8(%rsp)
movq %rdx, %r14
movq %rsi, (%rsp)
movq %rdi, %r12
movq %rdi, %r15
testq %rdi, %rdi
je 0xebef
movq 0x18(%r12), %r15
movq $0x0, 0x18(%r12)
testq %r12, %r12
je 0xecc7
xorl %ecx, %ecx
movq %rcx, 0x10(%rsp)
movq (%rsp), %rdi
movq %r14, %rsi
callq 0x84f8
movq %rax, %r13
movl 0x10(%r12), %eax
movl %eax, 0x4(%r13)
movslq (%r13), %rax
testq %rax, %rax
jle 0xec45
movq (%rsp), %rcx
movq 0x10(%rcx), %rcx
movq 0x10(%r13), %rdx
xorl %esi, %esi
movq (%rcx,%rsi,8), %rdi
movl 0x28(%rdi), %edi
movq (%rdx,%rsi,8), %r8
movl %edi, 0x28(%r8)
incq %rsi
cmpq %rsi, %rax
jne 0xec2e
movq %r12, %rdi
movq %r13, %rsi
callq 0x873a
movq %r12, %rdi
callq 0x8891
movq %rax, %rbp
testq %rax, %rax
je 0xec89
movq 0x10(%rbp), %rdi
movq %rbp, %rsi
callq 0x7cd0
movq 0x18(%rbp), %rbx
movq 0x18(%r14), %rsi
movq %rbp, %rdi
callq 0x7bdc
movq %rbx, %rdi
movq %rax, %rsi
callq 0x7cd0
jmp 0xec50
movq 0x8(%rsp), %rdi
movq %r12, %rsi
callq 0x14b19
movq 0x10(%rsp), %rax
movq %rax, 0x18(%r13)
movq %r15, %rax
testq %r15, %r15
je 0xecb3
movq 0x18(%r15), %rax
movq $0x0, 0x18(%r15)
movq %r13, %rcx
movq %r15, %r12
testq %r15, %r15
movq %rax, %r15
jne 0xebfa
jmp 0xecca
xorl %r13d, %r13d
movq %r13, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: compareVertexListsGeneric
int compareVertexListsGeneric(const struct VertexList* e1, const struct VertexList* e2, int (*compar)(const struct VertexList*, const struct VertexList*)) {

	/* if this value is larger than 0 the first label is lex. larger than the second etc. */
	int returnValue = compar(e1, e2);

	/* if the two paths are identical so far wrt. labels check the next vertex on each path */
	if (returnValue == 0) {

		if ((e1->next) && (e2->next)) {
			/* if both lists have a next, proceed recursively */
			return compareVertexListsGeneric(e1->next, e2->next, compar);
		} else {
			/* if the first list is shorter, its lex. smaller */
			if ((e1->next == NULL) && (e2->next)){
				return -1;
			}
			/* if the second is shorter, this one is lex.smaller */
			if ((e2->next == NULL) && (e1->next)){
				return 1;
			}
		}

		/* if none of the cases above was chosen, both paths end here and we have to return 0 as both strings
		represented by the lists are identical */
		return 0;

	} else {
		/* if the paths differ in the current vertices, we return the return value of the comparison function */
		return returnValue;
	}
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %r15
movq %rdi, %rbx
movq %rsi, %r14
movq %rbx, %rdi
callq *%r15
testl %eax, %eax
jne 0xedc9
movq 0x8(%rbx), %rbx
testq %rbx, %rbx
je 0xedaa
movq 0x8(%r14), %rsi
testq %rsi, %rsi
jne 0xed86
testq %rbx, %rbx
jne 0xedb6
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmpq $0x0, 0x8(%r14)
jne 0xedc9
testq %rbx, %rbx
setne %al
cmpq $0x0, 0x8(%r14)
sete %cl
andb %al, %cl
movzbl %cl, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: filterSortedSpanningTreeList
struct ShallowGraph* filterSortedSpanningTreeList(struct ShallowGraph* l, int (*compar)(struct ShallowGraph*, struct ShallowGraph*), struct ShallowGraphPool* sgp) {
	struct ShallowGraph* result = NULL;
	struct ShallowGraph* garbage = NULL;
	for (struct ShallowGraph* g=l; g!=NULL; /* increment is done below */) {
		if (g->next != NULL) {
			struct ShallowGraph* next = g->next;
			if (compar(g, g->next) == 0) {
				g->next = garbage;
				garbage = g;
			} else {
				g->next = result;
				result = g;
			}
			g = next;
		} else {
			// the last element should always be in the result.
			g->next = result;
			result = g;
			g = NULL;
		}
	}
	dumpShallowGraphCycle(sgp, garbage);
	return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, (%rsp)
testq %rdi, %rdi
je 0xee67
movq %rsi, %r15
movq %rdi, %r12
xorl %ebp, %ebp
xorl %r14d, %r14d
movq 0x18(%r12), %r13
testq %r13, %r13
je 0xee4f
movq %r12, %rdi
movq %r13, %rsi
callq *%r15
testl %eax, %eax
movq %rbp, %rax
cmoveq %r14, %rax
cmoveq %r12, %r14
movq %rbp, %rbx
cmovneq %r12, %rbx
movq %rax, %rbp
jmp 0xee55
xorl %r13d, %r13d
movq %r12, %rbx
movq %rbp, 0x18(%r12)
movq %rbx, %rbp
movq %r13, %r12
testq %r13, %r13
jne 0xee23
jmp 0xee6c
xorl %r14d, %r14d
xorl %ebx, %ebx
movq (%rsp), %rdi
movq %r14, %rsi
callq 0x14b75
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: filterDuplicateSpanningTrees
struct ShallowGraph* filterDuplicateSpanningTrees(struct ShallowGraph* sptrees, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* filteredResult = NULL;

	// sort edges in spanning trees, count number of spts
	size_t length = 0;
	for (struct ShallowGraph* l=sptrees; l!=NULL; l=l->next) {
		sortShallowGraphEdges(l, &absCompEdges);
		++length;
	}

	filteredResult = sortListOfShallowGraphs(sptrees, length, &absCompShallowGraphs);
	filteredResult = filterSortedSpanningTreeList(filteredResult, &compareShallowGraphsAbsloute, sgp);

	return filteredResult;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, (%rsp)
movq %rdi, %rbx
xorl %r15d, %r15d
testq %rdi, %rdi
je 0xef5d
leaq -0x13f(%rip), %r12      # 0xed70
movq %rbx, %r14
movslq 0x10(%r14), %rbp
cmpq $0x2, %rbp
jl 0xef4d
leaq (,%rbp,8), %rdi
callq 0x1190
movq %rax, %r13
movq (%r14), %rax
movq %rax, (%r13)
movl $0x1, %eax
movq -0x8(%r13,%rax,8), %rcx
movq 0x8(%rcx), %rcx
movq %rcx, (%r13,%rax,8)
incq %rax
cmpq %rax, %rbp
jne 0xeedc
movl $0x8, %edx
movq %r13, %rdi
movq %rbp, %rsi
movq %r12, %rcx
callq 0x1080
movl 0x10(%r14), %ecx
leal -0x1(%rcx), %eax
cmpl $0x2, %ecx
jl 0xef2f
movl %eax, %ecx
xorl %edx, %edx
movq (%r13,%rdx,8), %rsi
movq 0x8(%r13,%rdx,8), %rdi
leaq 0x1(%rdx), %r8
movq %rdi, 0x8(%rsi)
movq %r8, %rdx
cmpq %r8, %rcx
jne 0xef15
cltq
movq (%r13,%rax,8), %rax
movq $0x0, 0x8(%rax)
movq (%r13), %rax
movq %rax, (%r14)
movq %r13, %rdi
callq 0x1030
incq %r15
movq 0x18(%r14), %r14
testq %r14, %r14
jne 0xeeb2
cmpq $0x2, %r15
jb 0xefe0
leaq (,%r15,8), %rdi
callq 0x1190
movq %rax, %r12
movq %rbx, (%rax)
movl $0x1, %eax
movq -0x8(%r12,%rax,8), %rcx
movq 0x18(%rcx), %rcx
movq %rcx, (%r12,%rax,8)
incq %rax
cmpq %rax, %r15
jne 0xef7b
leaq -0x1ab(%rip), %rcx      # 0xedec
movl $0x8, %edx
movq %r12, %rdi
movq %r15, %rsi
callq 0x1080
cmpq $0x1, %r15
je 0xefc7
movl $0x1, %eax
movq -0x8(%r12,%rax,8), %rcx
movq (%r12,%rax,8), %rdx
movq %rdx, 0x18(%rcx)
incq %rax
cmpq %rax, %r15
jne 0xefb2
movq -0x8(%r12,%r15,8), %rax
movq $0x0, 0x18(%rax)
movq (%r12), %rbx
movq %r12, %rdi
callq 0x1030
testq %rbx, %rbx
je 0xf039
xorl %r14d, %r14d
leaq -0x2cc(%rip), %r12      # 0xed23
xorl %r15d, %r15d
movq 0x18(%rbx), %rbp
testq %rbp, %rbp
je 0xf023
movq (%rbx), %rdi
movq (%rbp), %rsi
movq %r12, %rdx
callq 0xed7b
testl %eax, %eax
movq %r14, %rax
cmoveq %r15, %rax
cmoveq %rbx, %r15
movq %r14, %r13
cmovneq %rbx, %r13
movq %rax, %r14
jmp 0xf028
xorl %ebp, %ebp
movq %rbx, %r13
movq %r14, 0x18(%rbx)
movq %r13, %r14
movq %rbp, %rbx
testq %rbp, %rbp
jne 0xeff2
jmp 0xf03f
xorl %r15d, %r15d
xorl %r13d, %r13d
movq (%rsp), %rdi
movq %r15, %rsi
callq 0x14b75
movq %r13, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: mergeShallowGraphs
static struct ShallowGraph* mergeShallowGraphs(struct ShallowGraph* list, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* head = popShallowGraph(&list);

	for (struct ShallowGraph* pop=popShallowGraph(&list); pop!=NULL; pop=popShallowGraph(&list)) {
		mergeTwoShallowGraphs(head, pop, sgp);
	}
	return head;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movq %rdi, %rsi
testq %rdi, %rdi
je 0xf259
movq 0x18(%rbx), %rsi
movq $0x0, 0x18(%rbx)
movq %rsi, %r15
testq %rsi, %rsi
je 0xf26d
movq 0x18(%rsi), %r15
movq $0x0, 0x18(%rsi)
testq %rsi, %rsi
je 0xf2c0
movq %r15, %r12
movq (%rsi), %rax
movq 0x8(%rbx), %rcx
movq %rax, 0x8(%rcx)
movq 0x8(%rsi), %rax
movq %rax, 0x8(%rbx)
movl 0x10(%rsi), %eax
addl %eax, 0x10(%rbx)
movq $0x0, 0x18(%rsi)
xorps %xmm0, %xmm0
movups %xmm0, (%rsi)
movq %r14, %rdi
callq 0x14b19
testq %r15, %r15
je 0xf2b5
movq 0x18(%r15), %r12
movq $0x0, 0x18(%r15)
movq %r15, %rsi
testq %r15, %r15
movq %r12, %r15
jne 0xf275
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/localEasySubtreeIsomorphism.c
// Function: wipeCharacteristicsForLocalEasy
void wipeCharacteristicsForLocalEasy(struct SpanningtreeTree sptTree) {
	if (sptTree.characteristics) {
		for (int v=0; v<sptTree.nRoots; ++v) {
			struct SupportSet* list = sptTree.characteristics[v];
			if (list) {
				struct SupportSetElement* tmp;
				for (struct SupportSetElement* e=list->first; e!=NULL; e=tmp) {
					tmp = e->next;
					dumpNewCube(e->data.S, e->data.g->n);
					free(e);
				}
				list->size = 0;
				list->first = list->last = NULL;
				list->next = NULL;
			}
		}
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq 0x60(%rsp), %r14
testq %r14, %r14
je 0xf4f3
leaq 0x40(%rsp), %rax
movslq 0x30(%rax), %r15
testq %r15, %r15
jle 0xf4f3
xorl %r12d, %r12d
movq (%r14,%r12,8), %r13
testq %r13, %r13
je 0xf4eb
movq (%r13), %rbx
testq %rbx, %rbx
je 0xf4de
movq 0x28(%rbx), %rbp
movq 0x8(%rbx), %rax
movq 0x18(%rbx), %rdi
movl (%rax), %esi
callq 0x1631f
movq %rbx, %rdi
callq 0x1030
movq %rbp, %rbx
testq %rbp, %rbp
jne 0xf4bb
xorps %xmm0, %xmm0
movups %xmm0, 0x10(%r13)
movups %xmm0, (%r13)
incq %r12
cmpq %r15, %r12
jne 0xf4a9
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq