LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isCactus
char isCactus(struct Graph* g, struct ShallowGraphPool* sgp) {

	/* the empty graph and singleton vertices are cactus graphs */
	if (g->n <= 1) {
		return 1;
	}

	if (isConnected(g)) {
		struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
		struct ShallowGraph* comp;
		int compNumber = 0;
		for (comp = biconnectedComponents; comp!=NULL; comp=comp->next) {
			if (comp->m > 1) {
				++compNumber;
			}			
		}
		/* cleanup */
		dumpShallowGraphCycle(sgp, biconnectedComponents);
		return g->m - compNumber == g->n - 1 ? 1 : 0;
	} else {
		return 0;
	}
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movb $0x1, %bl
cmpl $0x2, (%rdi)
jl 0x16d0f
movq %rsi, %r15
movq %rdi, %r14
callq 0x53b3
xorl %ebx, %ebx
testb %al, %al
je 0x16d0f
movq %r14, %rdi
movq %r15, %rsi
callq 0xb23b
testq %rax, %rax
je 0x16cf4
xorl %ebx, %ebx
movq %rax, %rcx
xorl %edx, %edx
cmpl $0x2, 0x10(%rcx)
setge %dl
addl %edx, %ebx
movq 0x18(%rcx), %rcx
testq %rcx, %rcx
jne 0x16ce0
movq %r15, %rdi
movq %rax, %rsi
callq 0x14a56
movl (%r14), %eax
movl 0x4(%r14), %ecx
subl %ebx, %ecx
decl %eax
cmpl %eax, %ecx
sete %bl
movl %ebx, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isOuterplanarGraph
char isOuterplanarGraph(struct Graph* g, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
	struct ShallowGraph* comp;
	char isOp = 1;
	for (comp = biconnectedComponents; comp!=NULL; comp=comp->next) {
		if (comp->m > 1) {
			isOp = isOuterplanarBlockShallow(comp, sgp, gp);
			if (isOp == 0) {
				break;
			}
		}			
	}
	/* cleanup */
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	return isOp;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdx, %r15
movq %rsi, %rbx
callq 0xb23b
movq %rax, %r14
movb $0x1, %bpl
testq %rax, %rax
je 0x16d62
movq %r14, %r12
cmpl $0x2, 0x10(%r12)
jl 0x16d54
movq %r12, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x16d78
movl %eax, %ebp
testb %al, %al
je 0x16d60
movq 0x18(%r12), %r12
testq %r12, %r12
jne 0x16d38
jmp 0x16d62
xorl %ebp, %ebp
movq %rbx, %rdi
movq %r14, %rsi
callq 0x14a56
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isOuterplanarBlockShallow
char isOuterplanarBlockShallow(struct ShallowGraph* original, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct Graph* g = shallowGraphToGraph(original, gp);
	char isOP = isOuterplanarBlock(g, sgp);
	dumpGraph(gp, g);
	return isOP;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdx, %rsi
callq 0x8250
movq %rax, %r15
movq %rax, %rdi
movq %r14, %rsi
callq 0x16db5
movl %eax, %ebp
movq %rbx, %rdi
movq %r15, %rsi
callq 0x14700
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: dumpBBTree
void dumpBBTree(struct GraphPool* gp, struct ShallowGraphPool* sgp, struct BBTree* tree) {
	if (tree) {
		dumpGraph(gp, tree->tree);
		if (tree->blocks) {
			dumpGraph(gp, tree->blocks);
			dumpShallowGraphCycle(sgp, tree->blockComponents[0]);
			free(tree->blockComponents);
		}
		if (tree->originalIDs) {
			free(tree->originalIDs);
		}
		free(tree);
	}
}

// Assembly:
testq %rdx, %rdx
je 0x17327
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq (%rdx), %rsi
callq 0x14700
movq 0x8(%rbx), %rsi
testq %rsi, %rsi
je 0x1730c
movq %r15, %rdi
callq 0x14700
movq 0x10(%rbx), %rax
movq (%rax), %rsi
movq %r14, %rdi
callq 0x14a56
movq 0x10(%rbx), %rdi
callq 0x1030
movq 0x18(%rbx), %rdi
testq %rdi, %rdi
je 0x1731a
callq 0x1030
movq %rbx, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x1030
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: dumpFancyBBTree
void dumpFancyBBTree(struct GraphPool* gp, struct ShallowGraphPool* sgp, struct BBTree* tree) {
	if (tree) {
		dumpGraph(gp, tree->tree);
		if (tree->blocks) {
			free(tree->blocks->vertices);
			tree->blocks->vertices = NULL;
			dumpGraph(gp, tree->blocks);
			dumpShallowGraphCycle(sgp, tree->blockComponents[0]);
			free(tree->blockComponents);
		}
		free(tree->originalIDs);
		free(tree);
	}
}

// Assembly:
testq %rdx, %rdx
je 0x17397
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq (%rdx), %rsi
callq 0x14700
movq 0x8(%rbx), %rax
testq %rax, %rax
je 0x17381
movq 0x10(%rax), %rdi
callq 0x1030
movq 0x8(%rbx), %rsi
movq $0x0, 0x10(%rsi)
movq %r15, %rdi
callq 0x14700
movq 0x10(%rbx), %rax
movq (%rax), %rsi
movq %r14, %rdi
callq 0x14a56
movq 0x10(%rbx), %rdi
callq 0x1030
movq 0x18(%rbx), %rdi
callq 0x1030
movq %rbx, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x1030
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: getContainmentEdge
struct VertexList* getContainmentEdge(struct ListPool* lp) {
	struct VertexList* e = getVertexList(lp);
	e->label = malloc(2*sizeof(char));
	sprintf(e->label, "#");
	e->isStringMaster = 1;
	return e;
}

// Assembly:
pushq %rbx
callq 0x141f1
movq %rax, %rbx
movl $0x2, %edi
callq 0x1190
movq %rax, (%rbx)
movw $0x23, (%rax)
movl $0x1, 0x28(%rbx)
movq %rbx, %rax
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: mergeBBtree
int* mergeBBtree(struct Graph* g, struct Graph*h) {
	struct Vertex** tmp;
	int i, j, tmpN;
	int actualVertices = 0;
	for (i=0; i<g->n; ++i) {
		if (g->vertices[i]) {
			++actualVertices;
		}
	}

	/* up to this point, there may be elements of copy->vertices, that are NULL */
	tmp = g->vertices;
	tmpN = g->n;

	/* set the number of vertices correctly */
	int newSize = actualVertices + h->n;
	setVertexNumber(g, newSize);
	int* originalIDs = malloc(newSize * sizeof(int));

	/* shift the vertices that are there into the new array and
	 * assign new numbers */
	j = 0;
	for (i=0; i<tmpN; ++i) {
		if (tmp[i]) {
			g->vertices[j] = tmp[i];
			originalIDs[j] = g->vertices[j]->number;
			g->vertices[j]->number = j;
			++j;
		}
	}

	/* attach the block vertices to the new tree */
	for (i=0; i<h->n; ++i) {
		g->vertices[j] = h->vertices[i];
		originalIDs[j] = -1 - i;
		g->vertices[j]->number = j;
		++j;	
	}

	/* set the number of edges correctly */
	g->m += h->m;

	free(tmp);

	return originalIDs;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %r14
movq %rdi, %rbx
movslq (%rdi), %r13
movq 0x10(%rdi), %r15
testq %r13, %r13
jle 0x1789d
xorl %ecx, %ecx
xorl %eax, %eax
cmpq $0x1, (%r15,%rcx,8)
sbbl $-0x1, %eax
incq %rcx
cmpq %rcx, %r13
jne 0x1788b
jmp 0x1789f
xorl %eax, %eax
movslq (%r14), %rcx
movslq %eax, %r12
addq %rcx, %r12
movq %rbx, %rdi
movl %r12d, %esi
callq 0x7e6c
shlq $0x2, %r12
movq %r12, %rdi
callq 0x1190
movq %rax, %r12
xorl %eax, %eax
testl %r13d, %r13d
jle 0x178fc
xorl %ecx, %ecx
movq (%r15,%rcx,8), %rdx
testq %rdx, %rdx
je 0x178f2
movq 0x10(%rbx), %rsi
cltq
movq %rdx, (%rsi,%rax,8)
movq 0x10(%rbx), %rdx
movq (%rdx,%rax,8), %rdx
movl 0x18(%rdx), %esi
movl %esi, (%r12,%rax,4)
movl %eax, 0x18(%rdx)
incl %eax
incq %rcx
cmpq %rcx, %r13
jne 0x178cb
cltq
movslq (%r14), %rcx
testq %rcx, %rcx
jle 0x17938
movq 0x10(%rbx), %rsi
movl $0xffffffff, %edx       # imm = 0xFFFFFFFF
xorl %edi, %edi
movq 0x10(%r14), %r8
movq (%r8,%rdi,8), %r8
movq %r8, (%rsi,%rax,8)
movl %edx, (%r12,%rax,4)
movq 0x10(%rbx), %rsi
movq (%rsi,%rax,8), %r8
movl %eax, 0x18(%r8)
incq %rax
incq %rdi
decl %edx
cmpq %rdi, %rcx
jne 0x1790f
movl 0x4(%r14), %eax
addl %eax, 0x4(%rbx)
movq %r15, %rdi
callq 0x1030
movq %r12, %rax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/outerplanar.c
// Function: compressedBBTree
struct BBTree* compressedBBTree(struct Graph* tree, struct Graph* blocks, struct ShallowGraph* list, int** originalIDs, struct GraphPool* gp) {
	int* tmpIDs = mergeBBtree(tree, blocks);
	if (*originalIDs) {
		for (int i=0; i<tree->n - blocks->n; ++i) {
			tmpIDs[i] = (*originalIDs)[tmpIDs[i]];
		}
	}	  
	return createBBTree(tree, blocks, list, tmpIDs, gp);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %r8, %rbx
movq %rcx, %r13
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
callq 0x1786c
movq (%r13), %rcx
testq %rcx, %rcx
je 0x17999
movl (%r12), %edx
subl (%r15), %edx
jle 0x17999
movl %edx, %edx
xorl %esi, %esi
movslq (%rax,%rsi,4), %rdi
movl (%rcx,%rdi,4), %edi
movl %edi, (%rax,%rsi,4)
incq %rsi
cmpq %rsi, %rdx
jne 0x17987
movq %r12, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %rax, %rcx
movq %rbx, %r8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x17244
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: numberOfReachableVertices
int numberOfReachableVertices(struct Vertex* v, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* queue = getShallowGraph(sgp);
	int markerID = v->number;
	addToVertexQueue(v, queue, sgp);
	v->visited = markerID;

	int reachableCount = 1;

	for (struct Vertex* w=popFromVertexQueue(queue, sgp); w!=NULL; w=popFromVertexQueue(queue, sgp)) {
		for (struct VertexList* e=w->neighborhood; e!=NULL; e=e->next) {
			if (e->endPoint->visited != markerID) {
				e->endPoint->visited = markerID;
				addToVertexQueue(e->endPoint, queue, sgp);
				++reachableCount;
			}
		}
	}

	return reachableCount;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x1498d
movq %rax, %r14
movl 0x18(%r15), %r12d
movq %r15, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x1e6f0
movl %r12d, 0x1c(%r15)
movq %r14, %rdi
movq %rbx, %rsi
callq 0x1e719
movl $0x1, %ebp
testq %rax, %rax
je 0x17e53
movq 0x8(%rax), %r15
testq %r15, %r15
je 0x17e46
movq 0x18(%r15), %rdi
cmpl %r12d, 0x1c(%rdi)
je 0x17e40
movl %r12d, 0x1c(%rdi)
movq %r14, %rsi
movq %rbx, %rdx
callq 0x1e6f0
incl %ebp
movq 0x8(%r15), %r15
jmp 0x17e20
movq %r14, %rdi
movq %rbx, %rsi
callq 0x1e719
jmp 0x17e17
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: computeAllReachabilityCounts
void computeAllReachabilityCounts(struct Graph* g, struct ShallowGraphPool* sgp) {
	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->visited = -1;
	}

	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->lowPoint = numberOfReachableVertices(g->vertices[v], sgp);
	}
}

// Assembly:
movslq (%rdi), %rax
testq %rax, %rax
jle 0x17ebc
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movq 0x10(%rdi), %rcx
xorl %edx, %edx
movq (%rcx,%rdx,8), %rsi
movl $0xffffffff, 0x1c(%rsi) # imm = 0xFFFFFFFF
incq %rdx
cmpq %rdx, %rax
jne 0x17e77
testl %eax, %eax
jle 0x17eb7
movq 0x10(%r14), %rcx
xorl %r15d, %r15d
movq (%rcx,%r15,8), %rdi
movq %rbx, %rsi
callq 0x17dd8
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rdx
movl %eax, 0x20(%rdx)
incq %r15
movslq (%r14), %rax
cmpq %rax, %r15
jl 0x17e95
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: printFlowInstanceDotFormat
void printFlowInstanceDotFormat(struct Graph* g, FILE* out) {
	fputs("digraph anonymous {\n", out);
	// write vertices
	for (int v=0; v<g->n; ++v) {
		if (g->vertices[v]->visited == 0) {
			fprintf(out, "%i [label=\"%i: %i/%i\"];\n", v, v, g->vertices[v]->visited, g->vertices[v]->d);
		} else {
			fprintf(out, "%i [label=\"%i: %i/%i\", color=green, penwidth=3];\n", v, v, g->vertices[v]->visited, g->vertices[v]->d);
		}
	}
	// write edges
	for (int v=0; v<g->n; ++v) {
		for (struct VertexList* e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			if (e->endPoint->number > e->startPoint->number) {
				if (e->flag > 0) {
					// original edge
					fprintf(out, "%i -> %i [label=\"%i/%i\", penwidth=3, color=red];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
				} else {
					fprintf(out, "%i -> %i [label=\"%i/%i\", color=red];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
				}
			} else {
				// residual edge
				fprintf(out, "%i -> %i [label=\"%i/%i\"];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
			}
		}
	}
	fputs("}\n", out);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x8e1f(%rip), %rdi      # 0x20d60
callq 0x10c0
cmpl $0x0, (%r14)
jle 0x18025
leaq 0x8e1e(%rip), %r15      # 0x20d75
leaq 0x8e30(%rip), %r12      # 0x20d8e
xorl %r13d, %r13d
movq 0x10(%r14), %rax
movq (%rax,%r13,8), %rax
movl 0x1c(%rax), %r8d
movl 0x28(%rax), %r9d
movq %rbx, %rdi
testl %r8d, %r8d
je 0x17f84
movq %r12, %rsi
movl %r13d, %edx
movl %r13d, %ecx
jmp 0x17f90
movq %r15, %rsi
movl %r13d, %edx
movl %r13d, %ecx
xorl %r8d, %r8d
xorl %eax, %eax
callq 0x1160
incq %r13
movslq (%r14), %rax
cmpq %rax, %r13
jl 0x17f61
testl %eax, %eax
jle 0x18025
leaq 0x8e13(%rip), %r15      # 0x20dc0
leaq 0x8e64(%rip), %r13      # 0x20e18
xorl %ebp, %ebp
movq 0x10(%r14), %rcx
movq (%rcx,%rbp,8), %rcx
movq 0x8(%rcx), %r12
testq %r12, %r12
je 0x1801a
movq 0x10(%r12), %rax
movq 0x18(%r12), %rcx
movl 0x18(%rcx), %ecx
movl 0x18(%rax), %edx
movl 0x24(%r12), %r8d
cmpl %edx, %ecx
jle 0x17ff2
movl 0x20(%r12), %r9d
movq %rbx, %rdi
testl %r8d, %r8d
jle 0x17fff
movq %r15, %rsi
jmp 0x18006
movl 0x20(%r12), %r9d
movq %rbx, %rdi
movq %r13, %rsi
jmp 0x18006
leaq 0x8dec(%rip), %rsi      # 0x20df2
xorl %eax, %eax
callq 0x1160
movq 0x8(%r12), %r12
testq %r12, %r12
jne 0x17fc7
movl (%r14), %eax
incq %rbp
movslq %eax, %rcx
cmpq %rcx, %rbp
jl 0x17fb6
leaq 0x8396(%rip), %rdi      # 0x203c2
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x10c0
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: checkPathCover
int checkPathCover(struct Graph* g, int** pathset, size_t nPaths) {

	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->visited = 0;
	}

	for (size_t i=0; i<nPaths; ++i) {
		for (int j=1; j<pathset[i][0]; ++j) {
			g->vertices[pathset[i][j]]->visited = 1;
		}
	}

	int covered = 0;
	for (int v=0; v<g->n; ++v) {
		covered += g->vertices[v]->visited;
	}

	return g->n - covered;

}

// Assembly:
movslq (%rdi), %rax
testq %rax, %rax
jle 0x18065
movq 0x10(%rdi), %rcx
xorl %r8d, %r8d
movq (%rcx,%r8,8), %r9
movl $0x0, 0x1c(%r9)
incq %r8
cmpq %r8, %rax
jne 0x18051
testq %rdx, %rdx
je 0x180a3
xorl %ecx, %ecx
movq (%rsi,%rcx,8), %r8
cmpl $0x2, (%r8)
jl 0x1809b
movq 0x10(%rdi), %r9
movl $0x1, %r10d
movslq (%r8,%r10,4), %r11
movq (%r9,%r11,8), %r11
movl $0x1, 0x1c(%r11)
incq %r10
movslq (%r8), %r11
cmpq %r11, %r10
jl 0x18080
incq %rcx
cmpq %rdx, %rcx
jne 0x1806c
testl %eax, %eax
jle 0x180c0
movq 0x10(%rdi), %rdx
xorl %esi, %esi
xorl %ecx, %ecx
movq (%rdx,%rsi,8), %rdi
addl 0x1c(%rdi), %ecx
incq %rsi
cmpq %rsi, %rax
jne 0x180af
jmp 0x180c2
xorl %ecx, %ecx
subl %ecx, %eax
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: createVertexCoverFlowInstanceOfPoset
static struct Graph* createVertexCoverFlowInstanceOfPoset(struct Graph* g, struct GraphPool* gp) {
	struct Graph* flowInstance = createGraph(2 * g->n, gp);
	int maxCapacity = g->n;

	// source and sink of s-t flow instance
	struct Vertex* s = flowInstance->vertices[0];
	struct Vertex* t = flowInstance->vertices[1];

	// actual elements of poset start at vertex 1. they have infinite capacity.
	// HINT: if you ever want to change this for general graphs, consider that the
	// above s,t positions and size of flowInstance need to be changed.
	for (int v=1; v<g->n; ++v) {
		struct Vertex* vStart = flowInstance->vertices[2 * v];
		struct Vertex* vEnd = flowInstance->vertices[2 * v + 1];

		// add edge for each vertex in the original graph
		addResidualEdgesWithCapacity(vStart, vEnd, maxCapacity, gp->listPool);

		// add copy of original edges and residuals, they have infinite capacity
		for (struct VertexList* e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			addResidualEdgesWithCapacity(vEnd, flowInstance->vertices[2 * e->endPoint->number], maxCapacity, gp->listPool);
		}

		// add edge from s to vEnd with capacity 1
		addResidualEdgesWithCapacity(s, vEnd, 1, gp->listPool);

		// add edge from v to t
		addResidualEdgesWithCapacity(vStart, t, 1, gp->listPool);
	}

	return flowInstance;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %rbx
movq %rdi, %r12
movl (%rdi), %edi
addl %edi, %edi
callq 0x85e3
movq %rax, %r15
movl (%r12), %ebp
cmpl $0x2, %ebp
jl 0x18402
movq 0x10(%r15), %rax
movq (%rax), %rcx
movq %rcx, 0x10(%rsp)
movq 0x8(%rax), %rax
movq %rax, 0x8(%rsp)
movl $0x1, %r14d
movq %r12, 0x18(%rsp)
movq 0x10(%r15), %rax
movq %r14, %rcx
shlq $0x4, %rcx
movq (%rax,%rcx), %rdi
movq 0x8(%rax,%rcx), %r13
movq 0x18(%rbx), %rcx
movq %rdi, 0x20(%rsp)
movq %r13, %rsi
movl %ebp, %edx
callq 0x34d2
movq 0x10(%r12), %rax
movq (%rax,%r14,8), %rax
movq 0x8(%rax), %r12
testq %r12, %r12
je 0x183bf
movq 0x10(%r15), %rax
movq 0x18(%r12), %rcx
movslq 0x18(%rcx), %rcx
shlq $0x4, %rcx
movq (%rax,%rcx), %rsi
movq 0x18(%rbx), %rcx
movq %r13, %rdi
movl %ebp, %edx
callq 0x34d2
movq 0x8(%r12), %r12
jmp 0x18390
movq 0x18(%rbx), %rcx
movq 0x10(%rsp), %rdi
movq %r13, %rsi
movl $0x1, %edx
callq 0x34d2
movq 0x18(%rbx), %rcx
movq 0x20(%rsp), %rdi
movq 0x8(%rsp), %rsi
movl $0x1, %edx
callq 0x34d2
incq %r14
movq 0x18(%rsp), %r12
movslq (%r12), %rax
cmpq %rax, %r14
jl 0x1835c
movq %r15, %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsRaySearch
static int dfsRaySearch(struct Graph* g, struct EvaluationPlan p, struct Vertex* currentPattern, struct GraphPool* gp) {
	int nEvaluations = 0;
	if (!embeddingValueKnown(currentPattern)) {
		struct Graph* pattern = (struct Graph*)(currentPattern->label);
		char match = isSubtree(g, pattern, gp);
		++nEvaluations;
		if (match) {
			for (struct VertexList* e=currentPattern->neighborhood; e!=NULL; e=e->next) {
				nEvaluations += dfsRaySearch(g, p, e->endPoint, gp);
			}
			updateEvaluationPlan(p, currentPattern->number, 1);
		} else {
			updateEvaluationPlan(p, currentPattern->number, 0);
		}
	}
	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, %r14
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x152d3
xorl %ebp, %ebp
testl %eax, %eax
jne 0x18894
leaq 0x70(%rsp), %r12
movq (%rbx), %rsi
movq %r15, %rdi
movq %r14, %rdx
callq 0xabef
movl $0x1, %ebp
testb %al, %al
je 0x18868
movq 0x8(%rbx), %r13
movb $0x1, %al
testq %r13, %r13
je 0x1886a
movq 0x18(%r13), %rsi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r15, %rdi
movq %r14, %rdx
callq 0x187db
addl %eax, %ebp
movq 0x8(%r13), %r13
testq %r13, %r13
jne 0x1882b
movb $0x1, %al
jmp 0x1886a
xorl %eax, %eax
movl 0x18(%rbx), %edi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movzbl %al, %esi
callq 0x152e7
movl %ebp, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: getPathInDAG
static int* getPathInDAG(struct Vertex* v) {
	int pathLength = 2;
	int* path = NULL;

	// DFS without backtracking in DAG
	for (struct VertexList* e=v->neighborhood; e!=NULL && (e->endPoint->visited == 0); e=e->endPoint->neighborhood) {
		++pathLength;
	}

	path = malloc(pathLength * sizeof(int));
	path[0] = pathLength;
	path[1] = v->number;

	pathLength = 2;
	// DFS without backtracking in DAG
	for (struct VertexList* e=v->neighborhood; e!=NULL && (e->endPoint->visited == 0); e=e->endPoint->neighborhood) {
		path[pathLength] = e->endPoint->number;
		++pathLength;
	}

	return path;
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rdi, %rbx
movq 0x8(%rdi), %r14
movl $0x2, %ebp
testq %r14, %r14
je 0x188d2
movq %r14, %rax
movq 0x18(%rax), %rax
cmpl $0x0, 0x1c(%rax)
jne 0x188d2
incl %ebp
movq 0x8(%rax), %rax
testq %rax, %rax
jne 0x188bd
movl %ebp, %edi
shlq $0x2, %rdi
callq 0x1190
movl %ebp, (%rax)
movl 0x18(%rbx), %ecx
movl %ecx, 0x4(%rax)
testq %r14, %r14
je 0x1890d
movq %rax, %rcx
addq $0x8, %rcx
movq 0x18(%r14), %rdx
cmpl $0x0, 0x1c(%rdx)
jne 0x1890d
movl 0x18(%rdx), %esi
movl %esi, (%rcx)
movq 0x8(%rdx), %r14
addq $0x4, %rcx
testq %r14, %r14
jne 0x188f1
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: binarySearchEvaluation
static int binarySearchEvaluation(struct Graph* g, struct EvaluationPlan p, int* path, struct GraphPool* gp) {
	int nEvaluations = 0;
	int minIdx = 1;
	int maxIdx = path[0] - 1;

	while (minIdx <= maxIdx) {
		int currentIdx = (minIdx + maxIdx) / 2;
		char match;
		if (!embeddingValueKnown(p.poset->vertices[path[currentIdx]])) {
			struct Graph* pattern = (struct Graph*)(p.poset->vertices[path[currentIdx]]->label);
			match = isSubtree(g, pattern, gp);
			++nEvaluations;
			updateEvaluationPlan(p, path[currentIdx], match);
		} else {
			match = getMatch(p.poset->vertices[path[currentIdx]]);
		}

		if (match) {
			minIdx = currentIdx + 1;
		} else {
			maxIdx = currentIdx - 1;
		}
	}

	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rdx, 0x40(%rsp)
movq %rdi, 0x38(%rsp)
movl (%rsi), %ebp
movl $0x0, 0x34(%rsp)
cmpl $0x2, %ebp
jl 0x189ea
movq %rsi, %r14
leaq 0x80(%rsp), %rbx
decl %ebp
movl $0x1, %r15d
movl $0x0, 0x34(%rsp)
leal (%r15,%rbp), %r13d
shrl %r13d
movq (%rbx), %rax
movq 0x10(%rax), %rax
movslq (%r14,%r13,4), %rcx
movq (%rax,%rcx,8), %rdi
callq 0x152d3
movq (%rbx), %rcx
movq 0x10(%rcx), %rcx
movslq (%r14,%r13,4), %rdx
movq (%rcx,%rdx,8), %rdi
testl %eax, %eax
je 0x18990
callq 0x152dd
movl %eax, %r12d
jmp 0x189ce
movq (%rdi), %rsi
movq 0x38(%rsp), %rdi
movq 0x40(%rsp), %rdx
callq 0xabef
movl %eax, %r12d
incl 0x34(%rsp)
movl (%r14,%r13,4), %edi
movups (%rbx), %xmm0
movups 0x10(%rbx), %xmm1
movups 0x20(%rbx), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movsbl %al, %esi
callq 0x152e7
testb %r12b, %r12b
je 0x189db
incl %r13d
movl %r13d, %r15d
jmp 0x189e1
decl %r13d
movl %r13d, %ebp
cmpl %ebp, %r15d
jle 0x18958
movl 0x34(%rsp), %eax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: getLongestPathInDAG
static int* getLongestPathInDAG(struct Vertex* v, struct Graph* poset, struct ShallowGraphPool* sgp) {

	struct ShallowGraph* border = getShallowGraph(sgp);
	addToVertexQueue(v, border, sgp);
	v->lowPoint = -1;
	v->d = 1;

	// use ->lowPoint to store the a parent of w
	// for sake of simplicity we count the number of times a vertex is in the border and
	struct Vertex* highestVertex = v;
	for (struct Vertex* w=popFromVertexQueue(border, sgp); w!=NULL;  w=popFromVertexQueue(border, sgp)) {
		highestVertex = w;
		w->d -= 1;
		if (w->d == 0) {
			for (struct VertexList* e=w->neighborhood; e!=NULL; e=e->next) {
				if ((e->endPoint->visited == 0) && (e->endPoint->d == 0)) {
					e->endPoint->lowPoint = w->number;
					e->endPoint->d += 1;
					addToVertexQueue(e->endPoint, border, sgp);
				}
			}
		}
	}
	// here w stores the last visited pattern that, by construction, is on the highest level of the poset.
	// backtrack using the ->lowPoints from here.
	int pathLength = 2;
	int* path = NULL;
	for (struct Vertex* x=highestVertex; x->lowPoint!=-1; x=poset->vertices[x->lowPoint]) {
		++pathLength;
	}

	path = malloc(pathLength * sizeof(int));
	path[0] = pathLength;
	path[1] = v->number;

	pathLength -= 1;
	for (struct Vertex* x=highestVertex; x->lowPoint!=-1; x=poset->vertices[x->lowPoint]) {
		path[pathLength] = x->number;
		--pathLength;
	}

	return path;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
movq %rdx, %rdi
callq 0x1498d
movq %rax, %r12
movq %r14, %rdi
movq %rax, %rsi
movq %r15, %rdx
callq 0x1e6f0
movl $0xffffffff, 0x20(%r14) # imm = 0xFFFFFFFF
movl $0x1, 0x28(%r14)
movq %r12, %rdi
movq %r15, %rsi
callq 0x1e719
movq %r14, %r13
testq %rax, %rax
je 0x18a9a
movq %rax, %r13
decl 0x28(%rax)
je 0x18a62
movq %r12, %rdi
movq %r15, %rsi
callq 0x1e719
jmp 0x18a48
movq 0x8(%r13), %rbp
testq %rbp, %rbp
je 0x18a55
movq 0x18(%rbp), %rdi
cmpl $0x0, 0x1c(%rdi)
jne 0x18a94
cmpl $0x0, 0x28(%rdi)
jne 0x18a94
movl 0x18(%r13), %eax
movl %eax, 0x20(%rdi)
movl $0x1, 0x28(%rdi)
movq %r12, %rsi
movq %r15, %rdx
callq 0x1e6f0
movq 0x8(%rbp), %rbp
jmp 0x18a66
movl 0x20(%r13), %eax
cmpl $-0x1, %eax
je 0x18abe
movq 0x10(%rbx), %rcx
movl $0x2, %ebp
incl %ebp
cltq
movq (%rcx,%rax,8), %rax
movl 0x20(%rax), %eax
cmpl $-0x1, %eax
jne 0x18aac
jmp 0x18ac3
movl $0x2, %ebp
movl %ebp, %edi
shlq $0x2, %rdi
callq 0x1190
movl %ebp, (%rax)
movl 0x18(%r14), %ecx
movl %ecx, 0x4(%rax)
cmpl $-0x1, 0x20(%r13)
je 0x18b06
movq 0x10(%rbx), %rcx
movslq %ebp, %rdx
leaq (%rax,%rdx,4), %rdx
addq $-0x4, %rdx
movl 0x18(%r13), %esi
movl %esi, (%rdx)
movslq 0x20(%r13), %rsi
movq (%rcx,%rsi,8), %r13
addq $-0x4, %rdx
cmpl $-0x1, 0x20(%r13)
jne 0x18aed
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: getWeightsOfPath
static double* getWeightsOfPath(struct Graph* poset, int* path, int databaseSize) {
	double* weights = malloc(path[0] * sizeof(double));

	weights[0] = (double)path[0];
	for (int i=1; i<path[0]; ++i) {
		weights[i] = ((struct Graph*)poset->vertices[path[i]]->label)->activity / (double)databaseSize;
	}
	return weights;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movl %edx, %ebp
movq %rsi, %rbx
movq %rdi, %r14
movslq (%rsi), %r15
leaq (,%r15,8), %rdi
callq 0x1190
cvtsi2sd %r15d, %xmm0
movsd %xmm0, (%rax)
cmpq $0x2, %r15
jl 0x18b77
movq 0x10(%r14), %rcx
xorps %xmm0, %xmm0
cvtsi2sd %ebp, %xmm0
movl $0x1, %edx
movslq (%rbx,%rdx,4), %rsi
movq (%rcx,%rsi,8), %rsi
movq (%rsi), %rsi
xorps %xmm1, %xmm1
cvtsi2sdl 0xc(%rsi), %xmm1
divsd %xmm0, %xmm1
movsd %xmm1, (%rax,%rdx,8)
incq %rdx
cmpq %rdx, %r15
jne 0x18b53
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsRaySearchLE
static int dfsRaySearchLE(struct SpanningtreeTree* spTree, struct EvaluationPlan p, struct Vertex* currentPattern, struct GraphPool* gp) {
	int nEvaluations = 0;
	if (!embeddingValueKnown(currentPattern)) {
		struct Graph* pattern = (struct Graph*)(currentPattern->label);
		char match = subtreeCheckForSpanningtreeTree(spTree, pattern, gp);
		wipeCharacteristicsForLocalEasy(*spTree);
		++nEvaluations;
		if (match) {
			for (struct VertexList* e=currentPattern->neighborhood; e!=NULL; e=e->next) {
				nEvaluations += dfsRaySearchLE(spTree, p, e->endPoint, gp);
			}
			updateEvaluationPlan(p, currentPattern->number, 1);
		} else {
			updateEvaluationPlan(p, currentPattern->number, 0);
		}
	}
	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, %r14
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x152d3
xorl %ebp, %ebp
testl %eax, %eax
jne 0x18c67
leaq 0x70(%rsp), %r13
movq (%rbx), %rsi
movq %r15, %rdi
movq %r14, %rdx
callq 0xfa92
movl %eax, %r12d
movq 0x30(%r15), %rax
movq %rax, 0x30(%rsp)
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups 0x20(%r15), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0xf3f1
movl $0x1, %ebp
testb %r12b, %r12b
je 0x18c3d
movq 0x8(%rbx), %r12
movb $0x1, %al
testq %r12, %r12
je 0x18c3f
movq 0x18(%r12), %rsi
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r15, %rdi
movq %r14, %rdx
callq 0x18b82
addl %eax, %ebp
movq 0x8(%r12), %r12
testq %r12, %r12
jne 0x18c00
movb $0x1, %al
jmp 0x18c3f
xorl %eax, %eax
movl 0x18(%rbx), %edi
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movzbl %al, %esi
callq 0x152e7
movl %ebp, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: binarySearchEvaluationLE
static int binarySearchEvaluationLE(struct SpanningtreeTree* spTree, struct EvaluationPlan p, int* path, struct GraphPool* gp) {
	int nEvaluations = 0;
	int minIdx = 1;
	int maxIdx = path[0] - 1;

	while (minIdx <= maxIdx) {
		int currentIdx = (minIdx + maxIdx) / 2;
		char match;
		if (!embeddingValueKnown(p.poset->vertices[path[currentIdx]])) {
			struct Graph* pattern = (struct Graph*)(p.poset->vertices[path[currentIdx]]->label);
			match = subtreeCheckForSpanningtreeTree(spTree, pattern, gp);
			wipeCharacteristicsForLocalEasy(*spTree);
			++nEvaluations;
			updateEvaluationPlan(p, path[currentIdx], match);
		} else {
			match = getMatch(p.poset->vertices[path[currentIdx]]);
		}

		if (match) {
			minIdx = currentIdx + 1;
		} else {
			maxIdx = currentIdx - 1;
		}
	}

	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdx, 0x48(%rsp)
movq %rdi, 0x40(%rsp)
movl (%rsi), %ebx
movl $0x0, 0x3c(%rsp)
cmpl $0x2, %ebx
jl 0x18d9f
movq %rsi, %r14
leaq 0x90(%rsp), %r12
decl %ebx
movl $0x1, %ebp
movl $0x0, 0x3c(%rsp)
leal (%rbx,%rbp), %r13d
shrl %r13d
movq (%r12), %rax
movq 0x10(%rax), %rax
movslq (%r14,%r13,4), %rcx
movq (%rax,%rcx,8), %rdi
callq 0x152d3
movq (%r12), %rcx
movq 0x10(%rcx), %rcx
movslq (%r14,%r13,4), %rdx
movq (%rcx,%rdx,8), %rdi
testl %eax, %eax
je 0x18cfa
callq 0x152dd
movl %eax, %r15d
jmp 0x18d7c
movq (%rdi), %rsi
movq %rbx, 0x50(%rsp)
movq %r14, %rbx
movq 0x40(%rsp), %r14
movq %r14, %rdi
movq 0x48(%rsp), %rdx
callq 0xfa92
movl %eax, %r15d
movq 0x30(%r14), %rax
movq %rax, 0x30(%rsp)
movups (%r14), %xmm0
movups 0x10(%r14), %xmm1
movups 0x20(%r14), %xmm2
movq %rbx, %r14
movq 0x50(%rsp), %rbx
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0xf3f1
incl 0x3c(%rsp)
movl (%r14,%r13,4), %edi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movsbl %r15b, %esi
callq 0x152e7
testb %r15b, %r15b
je 0x18d89
incl %r13d
movl %r13d, %ebp
jmp 0x18d8f
decl %r13d
movl %r13d, %ebx
leaq 0x90(%rsp), %r12
cmpl %ebx, %ebp
jle 0x18cbd
movl 0x3c(%rsp), %eax
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: generateGaussianNoise
void generateGaussianNoise(double* z0, double* z1, double mu, double sigma) {
	static const double epsilon = DBL_EPSILON;
	static const double two_pi = 2.0*3.14159265358979323846;

	double u1, u2;
	do {
		u1 = rand() * (1.0 / RAND_MAX);
		u2 = rand() * (1.0 / RAND_MAX);
	} while ( u1 <= epsilon );

	*z0 = sqrt(-2.0 * log(u1)) * cos(two_pi * u2) * sigma + mu;
	*z1 = sqrt(-2.0 * log(u1)) * sin(two_pi * u2) * sigma + mu;
}

// Assembly:
pushq %r14
pushq %rbx
subq $0x28, %rsp
movsd %xmm1, 0x18(%rsp)
movsd %xmm0, 0x20(%rsp)
movq %rsi, %rbx
movq %rdi, %r14
callq 0x1250
xorps %xmm0, %xmm0
cvtsi2sd %eax, %xmm0
mulsd 0x8057(%rip), %xmm0     # 0x20e38
movsd %xmm0, (%rsp)
callq 0x1250
movsd (%rsp), %xmm0
movsd 0x8048(%rip), %xmm1     # 0x20e40
ucomisd %xmm0, %xmm1
jae 0x18dcd
xorps %xmm1, %xmm1
cvtsi2sd %eax, %xmm1
mulsd 0x802b(%rip), %xmm1     # 0x20e38
movsd %xmm1, 0x8(%rsp)
callq 0x10f0
mulsd 0x8028(%rip), %xmm0     # 0x20e48
xorpd %xmm1, %xmm1
ucomisd %xmm1, %xmm0
jb 0x18e30
sqrtsd %xmm0, %xmm0
jmp 0x18e35
callq 0x1230
movsd %xmm0, 0x10(%rsp)
movsd 0x8(%rsp), %xmm0
mulsd 0x8007(%rip), %xmm0     # 0x20e50
movsd %xmm0, 0x8(%rsp)
callq 0x1100
mulsd 0x10(%rsp), %xmm0
mulsd 0x18(%rsp), %xmm0
addsd 0x20(%rsp), %xmm0
movsd %xmm0, (%r14)
movsd (%rsp), %xmm0
callq 0x10f0
mulsd 0x7fcb(%rip), %xmm0     # 0x20e48
ucomisd 0x7fd3(%rip), %xmm0     # 0x20e58
jb 0x18e8d
sqrtsd %xmm0, %xmm0
jmp 0x18e92
callq 0x1230
movsd %xmm0, (%rsp)
movsd 0x8(%rsp), %xmm0
callq 0x11f0
mulsd (%rsp), %xmm0
mulsd 0x18(%rsp), %xmm0
addsd 0x20(%rsp), %xmm0
movsd %xmm0, (%rbx)
addq $0x28, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: generateIntegerGaussianNoise
void generateIntegerGaussianNoise(int* z0, int* z1, double sigma) {
	static const double epsilon = DBL_EPSILON;
	static const double two_pi = 2.0*3.14159265358979323846;

	double u1, u2;
	do {
		u1 = rand() * (1.0 / RAND_MAX);
		u2 = rand() * (1.0 / RAND_MAX);
	} while ( u1 <= epsilon );

	*z0 = *z0 + (sqrt(-2.0 * log(u1)) * cos(two_pi * u2) * sigma) * RAND_MAX;
	*z1 = *z1 + (sqrt(-2.0 * log(u1)) * sin(two_pi * u2) * sigma) * RAND_MAX;
}

// Assembly:
pushq %r14
pushq %rbx
subq $0x28, %rsp
movsd %xmm0, 0x20(%rsp)
movq %rsi, %rbx
movq %rdi, %r14
callq 0x1250
xorps %xmm0, %xmm0
cvtsi2sd %eax, %xmm0
mulsd 0x7f52(%rip), %xmm0     # 0x20e38
movsd %xmm0, (%rsp)
callq 0x1250
movsd (%rsp), %xmm0
movsd 0x7f43(%rip), %xmm1     # 0x20e40
ucomisd %xmm0, %xmm1
jae 0x18ed2
xorps %xmm1, %xmm1
cvtsi2sd %eax, %xmm1
mulsd 0x7f26(%rip), %xmm1     # 0x20e38
movsd %xmm1, 0x10(%rsp)
xorps %xmm1, %xmm1
cvtsi2sdl (%r14), %xmm1
movsd %xmm1, 0x8(%rsp)
callq 0x10f0
mulsd 0x7f15(%rip), %xmm0     # 0x20e48
xorpd %xmm1, %xmm1
ucomisd %xmm1, %xmm0
jb 0x18f43
sqrtsd %xmm0, %xmm0
jmp 0x18f48
callq 0x1230
movsd %xmm0, 0x18(%rsp)
movsd 0x10(%rsp), %xmm0
mulsd 0x7ef4(%rip), %xmm0     # 0x20e50
movsd %xmm0, 0x10(%rsp)
callq 0x1100
mulsd 0x18(%rsp), %xmm0
mulsd 0x20(%rsp), %xmm0
mulsd 0x7ee5(%rip), %xmm0     # 0x20e60
addsd 0x8(%rsp), %xmm0
cvttsd2si %xmm0, %eax
movl %eax, (%r14)
xorps %xmm0, %xmm0
cvtsi2sdl (%rbx), %xmm0
movsd %xmm0, 0x8(%rsp)
movsd (%rsp), %xmm0
callq 0x10f0
mulsd 0x7ea1(%rip), %xmm0     # 0x20e48
ucomisd 0x7ea9(%rip), %xmm0     # 0x20e58
jb 0x18fb7
sqrtsd %xmm0, %xmm0
jmp 0x18fbc
callq 0x1230
movsd %xmm0, (%rsp)
movsd 0x10(%rsp), %xmm0
callq 0x11f0
mulsd (%rsp), %xmm0
mulsd 0x20(%rsp), %xmm0
mulsd 0x7e81(%rip), %xmm0     # 0x20e60
addsd 0x8(%rsp), %xmm0
cvttsd2si %xmm0, %eax
movl %eax, (%rbx)
addq $0x28, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: randomVertexLabels
void randomVertexLabels(struct Graph* g, int nVertexLabels) {
	int i;
	for (i=0; i<g->n; ++i) {
		g->vertices[i]->label = intLabel(rand() % nVertexLabels);
		g->vertices[i]->isStringMaster = 1;
	}
}

// Assembly:
cmpl $0x0, (%rdi)
jle 0x1903a
pushq %r15
pushq %r14
pushq %rbx
movl %esi, %ebx
movq %rdi, %r14
xorl %r15d, %r15d
callq 0x1250
cltd
idivl %ebx
movl %edx, %edi
callq 0xdcf9
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rdx
movq %rax, (%rdx)
movq (%rcx,%r15,8), %rax
movl $0x1, 0x24(%rax)
incq %r15
movslq (%r14), %rax
cmpq %rax, %r15
jl 0x19005
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: makeMinDegree1
void makeMinDegree1(struct Graph* g, struct GraphPool* gp) {
	for (int v=1; v<g->n; ++v) {
		if (g->vertices[v]->neighborhood == NULL) {
			addEdgeBetweenVertices(v, v-1, intLabel(1), g, gp);
			g->vertices[v]->neighborhood->isStringMaster = 1;
		}
	}
	if (g->vertices[0]->neighborhood == NULL) {
		addEdgeBetweenVertices(0,1,intLabel(1), g, gp);
		g->vertices[0]->neighborhood->isStringMaster = 1;
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movl (%rdi), %ecx
movq 0x10(%rdi), %rax
cmpl $0x2, %ecx
jl 0x190ac
xorl %r15d, %r15d
movq 0x8(%rax,%r15,8), %rdx
cmpq $0x0, 0x8(%rdx)
jne 0x19099
leal 0x1(%r15), %ebp
movl $0x1, %edi
callq 0xdcf9
movl %ebp, %edi
movl %r15d, %esi
movq %rax, %rdx
movq %rbx, %rcx
movq %r14, %r8
callq 0x84a3
movq 0x10(%rbx), %rax
movq 0x8(%rax,%r15,8), %rcx
movq 0x8(%rcx), %rcx
movl $0x1, 0x28(%rcx)
movl (%rbx), %ecx
movslq %ecx, %rdx
leaq 0x1(%r15), %rsi
addq $0x2, %r15
cmpq %rdx, %r15
movq %rsi, %r15
jl 0x19056
movq (%rax), %rax
cmpq $0x0, 0x8(%rax)
jne 0x190e7
movl $0x1, %edi
callq 0xdcf9
xorl %edi, %edi
movl $0x1, %esi
movq %rax, %rdx
movq %rbx, %rcx
movq %r14, %r8
callq 0x84a3
movq 0x10(%rbx), %rax
movq (%rax), %rax
movq 0x8(%rax), %rax
movl $0x1, 0x28(%rax)
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: erdosRenyi
struct Graph* erdosRenyi(int n, double p, struct GraphPool* gp) {
	struct Graph* g = createGraph(n, gp);
	for (int i=0; i<n; ++i) {
		for (int j=i+1; j<n; ++j) {
			double value = rand() / (RAND_MAX + 1.0);
			if (value < p) {
				addEdgeBetweenVertices(i, j, NULL, g, gp);
			}
		}
	}
	return g;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movsd %xmm0, (%rsp)
movl %edi, %ebp
callq 0x85e3
movq %rax, %r14
testl %ebp, %ebp
jle 0x19164
xorl %r13d, %r13d
movl %r13d, %r15d
leal 0x1(%r15), %r13d
cmpl %ebp, %r13d
jge 0x1915f
movl %r13d, %r12d
callq 0x1250
xorps %xmm0, %xmm0
cvtsi2sd %eax, %xmm0
mulsd 0x7d2f(%rip), %xmm0     # 0x20e68
movsd (%rsp), %xmm1
ucomisd %xmm0, %xmm1
jbe 0x19157
movl %r15d, %edi
movl %r12d, %esi
xorl %edx, %edx
movq %r14, %rcx
movq %rbx, %r8
callq 0x84a3
incl %r12d
cmpl %r12d, %ebp
jne 0x19125
cmpl %ebp, %r13d
jne 0x19116
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_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: erdosRenyiWithLabels
struct Graph* erdosRenyiWithLabels(int n, double p, int nVertexLabels, int nEdgeLabels, struct GraphPool* gp) {
	struct Graph* g = createGraph(n, gp);
	randomVertexLabels(g, nVertexLabels);

	for (int i=0; i<n; ++i) {
		for (int j=i+1; j<n; ++j) {
			double value = rand() / (RAND_MAX + 1.0);
			if (value < p) {
				// add a labeled edge and set one of the two resulting vertex lists as string master.
				addEdgeBetweenVertices(i, j, intLabel(rand() % nEdgeLabels), g, gp);
				g->vertices[i]->neighborhood->isStringMaster = 1;
			}
		}
	}
	return g;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, %rbx
movl %edx, %ebp
movl %esi, %r12d
movsd %xmm0, 0x10(%rsp)
movl %edi, %r14d
movq %rcx, %rsi
callq 0x85e3
movq %rax, %r15
movq %rax, %rdi
movl %r12d, %esi
callq 0x18ff3
testl %r14d, %r14d
jle 0x19244
movl %r14d, %eax
xorl %r12d, %r12d
movq %rax, 0x8(%rsp)
leaq 0x1(%r12), %rcx
movq %rcx, (%rsp)
cmpq %rax, %rcx
jae 0x19232
movq (%rsp), %rax
movl %eax, %r13d
callq 0x1250
xorps %xmm0, %xmm0
cvtsi2sd %eax, %xmm0
mulsd 0x7c80(%rip), %xmm0     # 0x20e68
movsd 0x10(%rsp), %xmm1
ucomisd %xmm0, %xmm1
jbe 0x1922a
callq 0x1250
cltd
idivl %ebp
movl %edx, %edi
callq 0xdcf9
movl %r12d, %edi
movl %r13d, %esi
movq %rax, %rdx
movq %r15, %rcx
movq %rbx, %r8
callq 0x84a3
movq 0x10(%r15), %rax
movq (%rax,%r12,8), %rax
movq 0x8(%rax), %rax
movl $0x1, 0x28(%rax)
incl %r13d
cmpl %r13d, %r14d
jne 0x191d4
movq 0x8(%rsp), %rax
movq (%rsp), %r12
cmpq %rax, %r12
jne 0x191bf
movq %r15, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: euclideanDistance
inline double euclideanDistance(const int vx, const int vy, const int wx, const int wy) {
	double vxx = vx / (double)RAND_MAX;
	double vyy = vy / (double)RAND_MAX;
	double wxx = wx / (double)RAND_MAX;
	double wyy = wy / (double)RAND_MAX;
	double xdiff = vxx - wxx;
	double ydiff = vyy - wyy;
	double result = sqrt(xdiff * xdiff + ydiff * ydiff);
	return result;
}

// Assembly:
movd %edx, %xmm0
movd %edi, %xmm1
punpckldq %xmm0, %xmm1    # xmm1 = xmm1[0],xmm0[0],xmm1[1],xmm0[1]
cvtdq2pd %xmm1, %xmm0
movd %ecx, %xmm1
movd %esi, %xmm2
punpckldq %xmm1, %xmm2    # xmm2 = xmm2[0],xmm1[0],xmm2[1],xmm1[1]
cvtdq2pd %xmm2, %xmm1
movapd 0x75d5(%rip), %xmm2     # 0x20e70
divpd %xmm2, %xmm0
divpd %xmm2, %xmm1
movapd %xmm0, %xmm2
unpckhpd %xmm0, %xmm2            # xmm2 = xmm2[1],xmm0[1]
subsd %xmm2, %xmm0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
subsd %xmm2, %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
sqrtsd %xmm0, %xmm0
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: printOverlapGraphDotFormat
void printOverlapGraphDotFormat(struct Graph* g, FILE* out) {
	fprintf(out, "graph %i {\n", g->number);
	for (int v=0; v<g->n; ++v) {
		fprintf(out, "%i [label=%s, pos=\"%lf,%lf\", pin=true, shape=point];\n", v, g->vertices[v]->label, g->vertices[v]->d / (double)RAND_MAX, g->vertices[v]->lowPoint / (double)RAND_MAX);
	}
	for (int v=0; v<g->n; ++v) {
		for (struct VertexList* e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			if (e->startPoint->number < e->endPoint->number) {
				fprintf(out, "%i -- %i;\n", e->startPoint->number, e->endPoint->number);
			}
		}
	}
	fprintf(out, "}\n");
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl 0x8(%rdi), %edx
leaq 0x6a4e(%rip), %rsi      # 0x203a0
movq %rbx, %rdi
xorl %eax, %eax
callq 0x1160
cmpl $0x0, (%r14)
jle 0x19a0b
xorl %r15d, %r15d
leaq 0x7510(%rip), %r12      # 0x20e80
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rax
movq (%rax), %rcx
xorps %xmm0, %xmm0
cvtsi2sdl 0x28(%rax), %xmm0
movsd 0x74d5(%rip), %xmm2     # 0x20e60
divsd %xmm2, %xmm0
xorps %xmm1, %xmm1
cvtsi2sdl 0x20(%rax), %xmm1
divsd %xmm2, %xmm1
movq %rbx, %rdi
movq %r12, %rsi
movl %r15d, %edx
movb $0x2, %al
callq 0x1160
incq %r15
movslq (%r14), %rax
cmpq %rax, %r15
jl 0x19970
testl %eax, %eax
jle 0x19a0b
leaq 0x74f5(%rip), %r15      # 0x20eb6
xorl %r12d, %r12d
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rcx
movq 0x8(%rcx), %r13
testq %r13, %r13
je 0x19a00
movq 0x10(%r13), %rax
movq 0x18(%r13), %rcx
movl 0x18(%rax), %edx
movl 0x18(%rcx), %ecx
cmpl %ecx, %edx
jge 0x199f4
movq %rbx, %rdi
movq %r15, %rsi
xorl %eax, %eax
callq 0x1160
movq 0x8(%r13), %r13
testq %r13, %r13
jne 0x199d5
movl (%r14), %eax
incq %r12
movslq %eax, %rcx
cmpq %rcx, %r12
jl 0x199c4
leaq 0x69b0(%rip), %rdi      # 0x203c2
movl $0x2, %esi
movl $0x1, %edx
movq %rbx, %rcx
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x1220
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: randomOverlapGraph
struct Graph* randomOverlapGraph(int n, double d, struct GraphPool* gp) {
	struct Graph* g = createGraph(n, gp);

	// every vertex is a two-dimensional point
	for (int v=0; v<n; ++v) {
		g->vertices[v]->d = rand();
		g->vertices[v]->lowPoint = rand();
		g->vertices[v]->label = intLabel(1);
	}
	// add edge iff distance is smaller than d
	for (int v=0; v<n; ++v) {
		for (int w=v+1; w<n; ++w) {
			if (euclideanDistanceWrap(v, w, g) < d) {
				addEdgeBetweenVertices(v, w, intLabel(1), g, gp);
			}
		}
	}
	return g;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movsd %xmm0, 0x10(%rsp)
movl %edi, %ebp
callq 0x85e3
movq %rax, %r14
testl %ebp, %ebp
jle 0x19b73
movl %ebp, %r13d
xorl %r15d, %r15d
callq 0x1250
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rcx
movl %eax, 0x28(%rcx)
callq 0x1250
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rcx
movl %eax, 0x20(%rcx)
movl $0x1, %edi
callq 0xdcf9
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rcx
movq %rax, (%rcx)
incq %r15
cmpq %r15, %r13
jne 0x19a5c
testl %ebp, %ebp
jle 0x19b73
movl $0x1, %ebp
xorl %r15d, %r15d
movapd 0x73bf(%rip), %xmm3     # 0x20e70
leaq 0x1(%r15), %rax
movq %rax, 0x8(%rsp)
cmpq %r13, %rax
jae 0x19b62
movq %rbp, %r12
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rcx
movq (%rax,%r12,8), %rax
movss 0x28(%rax), %xmm0
movss 0x28(%rcx), %xmm1
unpcklps %xmm0, %xmm1            # xmm1 = xmm1[0],xmm0[0],xmm1[1],xmm0[1]
cvtdq2pd %xmm1, %xmm0
divpd %xmm3, %xmm0
movss 0x20(%rax), %xmm1
movss 0x20(%rcx), %xmm2
unpcklps %xmm1, %xmm2            # xmm2 = xmm2[0],xmm1[0],xmm2[1],xmm1[1]
cvtdq2pd %xmm2, %xmm1
divpd %xmm3, %xmm1
movapd %xmm0, %xmm2
unpckhpd %xmm0, %xmm2            # xmm2 = xmm2[1],xmm0[1]
subsd %xmm2, %xmm0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
subsd %xmm2, %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
sqrtsd %xmm0, %xmm0
movsd 0x10(%rsp), %xmm1
ucomisd %xmm0, %xmm1
jbe 0x19b56
movl $0x1, %edi
callq 0xdcf9
movl %r15d, %edi
movl %r12d, %esi
movq %rax, %rdx
movq %r14, %rcx
movq %rbx, %r8
callq 0x84a3
movapd 0x731a(%rip), %xmm3     # 0x20e70
incq %r12
cmpq %r12, %r13
jne 0x19ac6
incq %rbp
movq 0x8(%rsp), %r15
cmpq %r13, %r15
jne 0x19ab1
movq %r14, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/randomGraphGenerators.c
// Function: randomOverlapGraphWithLabels
struct Graph* randomOverlapGraphWithLabels(int n, double d, int nVertexLabels, struct GraphPool* gp) {
	struct Graph* g = createGraph(n, gp);

	// every vertex is a two-dimensional point
	for (int v=0; v<n; ++v) {
		g->vertices[v]->d = rand();
		g->vertices[v]->lowPoint = rand();
		g->vertices[v]->label = intLabel(rand() % nVertexLabels);
	}
	// add edge iff distance is smaller than d
	for (int v=0; v<n; ++v) {
		for (int w=v+1; w<n; ++w) {
			if (euclideanDistanceWrap(v, w, g) < d) {
				addEdgeBetweenVertices(v, w, intLabel(1), g, gp);
			}
		}
	}
	return g;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, %rbx
movl %esi, %ebp
movsd %xmm0, 0x10(%rsp)
movl %edi, %r15d
movq %rdx, %rsi
callq 0x85e3
movq %rax, %r14
testl %r15d, %r15d
jle 0x19cd8
movl %r15d, %r13d
xorl %r12d, %r12d
callq 0x1250
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rcx
movl %eax, 0x28(%rcx)
callq 0x1250
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rcx
movl %eax, 0x20(%rcx)
callq 0x1250
cltd
idivl %ebp
movl %edx, %edi
callq 0xdcf9
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rcx
movq %rax, (%rcx)
incq %r12
cmpq %r12, %r13
jne 0x19bbb
testl %r15d, %r15d
jle 0x19cd8
movl $0x1, %ebp
xorl %r15d, %r15d
movapd 0x725a(%rip), %xmm3     # 0x20e70
leaq 0x1(%r15), %rax
movq %rax, 0x8(%rsp)
cmpq %r13, %rax
jae 0x19cc7
movq %rbp, %r12
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rcx
movq (%rax,%r12,8), %rax
movss 0x28(%rax), %xmm0
movss 0x28(%rcx), %xmm1
unpcklps %xmm0, %xmm1            # xmm1 = xmm1[0],xmm0[0],xmm1[1],xmm0[1]
cvtdq2pd %xmm1, %xmm0
divpd %xmm3, %xmm0
movss 0x20(%rax), %xmm1
movss 0x20(%rcx), %xmm2
unpcklps %xmm1, %xmm2            # xmm2 = xmm2[0],xmm1[0],xmm2[1],xmm1[1]
cvtdq2pd %xmm2, %xmm1
divpd %xmm3, %xmm1
movapd %xmm0, %xmm2
unpckhpd %xmm0, %xmm2            # xmm2 = xmm2[1],xmm0[1]
subsd %xmm2, %xmm0
movapd %xmm1, %xmm2
unpckhpd %xmm1, %xmm2            # xmm2 = xmm2[1],xmm1[1]
subsd %xmm2, %xmm1
mulsd %xmm1, %xmm1
mulsd %xmm0, %xmm0
addsd %xmm1, %xmm0
sqrtsd %xmm0, %xmm0
movsd 0x10(%rsp), %xmm1
ucomisd %xmm0, %xmm1
jbe 0x19cbb
movl $0x1, %edi
callq 0xdcf9
movl %r15d, %edi
movl %r12d, %esi
movq %rax, %rdx
movq %r14, %rcx
movq %rbx, %r8
callq 0x84a3
movapd 0x71b5(%rip), %xmm3     # 0x20e70
incq %r12
cmpq %r12, %r13
jne 0x19c2b
incq %rbp
movq 0x8(%rsp), %r15
cmpq %r13, %r15
jne 0x19c16
movq %r14, %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq