// File: /workspace/github_c_makefile_star2_O1/pwelke[P]GraphMiningTools/cpk.c
// Function: CyclicPatternKernel
int CyclicPatternKernel(struct Graph *g, struct ShallowGraphPool *sgp, struct GraphPool *gp,
		char outputOptions, struct Vertex* globalPatternSet, struct compInfo** results, int* resSize) {
	struct Graph* tmp;
	struct Graph* idx;
	int numCycles;
	int pos = 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 tree patterns */
	struct ShallowGraph* treePatterns = getTreePatterns(forest, sgp);

	/* create search tree structure */
	struct Vertex* treePatternSearchTree = buildSearchTree(treePatterns, gp, sgp);
	int numTrees = treePatternSearchTree->number;

	/* 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;
	}



	if (numTrees + numCycles > *resSize) {
		if (*results) {
			free(*results);
		}

		*results = getResultVector(numTrees + numCycles);
		*resSize = numTrees + numCycles;
	}


	

	/* add elements to global search trees to obtain mapping from strings to integers */
	mergeSearchTrees(globalPatternSet, treePatternSearchTree, 1, *results, &pos, globalPatternSet, 0, gp);
	if (cyclePatternSearchTree) {
		mergeSearchTrees(globalPatternSet, cyclePatternSearchTree, 2, *results, &pos, globalPatternSet, 0, gp);
	}

	/* sort the output elements by increasing id */
	qsort(*results, pos, sizeof(struct compInfo), &compInfoComparison);

	/* output options */
	switch (outputOptions) {
	int i;

	case 'a':
		/* "all" output the feature vector for the current graph in the format specified
		 * by SVMlight g->activity is assumed to be either 0, 1 or -1 to be compliant with
		 * the specs of SVMlight.
		 */

		/* print the id and label of the graph */
		printf("%i", g->activity);

		/* print key:value pairs */
		for (i=0; i<pos; ++i) {
			printf(" %i:%i", (*results)[i].id, (*results)[i].count);
		}
		printf("\n");
		break;
	case 'c':
		/* returns the number of cycles found in the graph */
		if (cyclePatternSearchTree)
			printf("%i %i\n", g->number, cyclePatternSearchTree->number / 2);
		else
			printf("%i 0\n", g->number);
		break;
	case 't':
		/* returns the number of trees found in the graph */
		printf("%i %i\n", g->number, treePatternSearchTree->number);
		break;
	case 'v':
		/* returns the number of vertices in the graph */
		printf("%i %i\n", g->number, g->n);
		break;
	case 'e':
		/* returns the number of edges in the graph */
		printf("%i %i\n", g->number, g->m);
		break;
	}


	/* 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);
	}

	dumpSearchTree(gp, treePatternSearchTree);
	dumpGraph(gp, forest);

	return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %r9, 0x10(%rsp)
movq %r8, 0x28(%rsp)
movl %ecx, 0x1c(%rsp)
movq %rdx, %rbx
movq %rsi, %r13
movq %rdi, %r14
movl $0x0, 0x4(%rsp)
callq 0xb2bf
movq %rax, %rdi
movq %r14, 0x8(%rsp)
movq %r14, %rsi
movq %rbx, %rdx
movq %r13, %rcx
callq 0xb5f8
movq 0x18(%rax), %rbp
movq %rax, 0x30(%rsp)
movq %rax, %rdi
movq %r13, %rsi
callq 0x77b1
movq %rax, %rdi
movq %rbx, %rsi
movq %r13, %rdx
callq 0x1b712
movq %rax, 0x20(%rsp)
movl 0x18(%rax), %eax
movl %eax, 0x18(%rsp)
xorl %r14d, %r14d
xorl %r12d, %r12d
testq %rbp, %rbp
je 0x548e
movq %rbp, %r15
movq %r15, %rdi
movq %r13, %rsi
callq 0xbb85
movq %r12, %rdi
movq %rax, %rsi
callq 0x87c2
movq %rax, %r12
movq 0x18(%r15), %r15
testq %r15, %r15
jne 0x546c
movq 0x70(%rsp), %r15
testq %r12, %r12
je 0x54ca
movq 0x20(%r12), %rax
xorl %ecx, %ecx
movq %rcx, 0x18(%rax)
movq %rcx, 0x20(%r12)
movq %r12, %rdi
movq %r13, %rsi
callq 0x5d59
movq %rax, %rdi
movq %rbx, %rsi
movq %r13, %rdx
callq 0x1b712
movq %rax, %r13
movl 0x18(%rax), %r14d
jmp 0x54cd
xorl %r13d, %r13d
movq 0x10(%rsp), %r12
addl 0x18(%rsp), %r14d
cmpl (%r15), %r14d
jle 0x54f9
movq (%r12), %rdi
testq %rdi, %rdi
je 0x54ea
callq 0x1030
movl %r14d, %edi
callq 0x1ae92
movq %rax, (%r12)
movl %r14d, (%r15)
movq (%r12), %rcx
leaq 0x4(%rsp), %r8
movq 0x28(%rsp), %r14
movq %r14, %rdi
movq 0x20(%rsp), %r15
movq %r15, %rsi
movl $0x1, %edx
movq %r14, %r9
pushq %rbx
pushq $0x0
callq 0x1afe3
addq $0x10, %rsp
testq %r13, %r13
je 0x554e
movq (%r12), %rcx
leaq 0x4(%rsp), %r8
movq %r14, %rdi
movq %r13, %rsi
movl $0x2, %edx
movq %r14, %r9
pushq %rbx
pushq $0x0
callq 0x1afe3
addq $0x10, %rsp
movq (%r12), %rdi
movslq 0x4(%rsp), %rsi
leaq 0x15944(%rip), %rcx     # 0x1aea2
movl $0xc, %edx
callq 0x1080
movsbl 0x1c(%rsp), %eax
cmpl $0x64, %eax
jle 0x558e
cmpl $0x65, %eax
je 0x55bc
cmpl $0x74, %eax
je 0x55c9
cmpl $0x76, %eax
jne 0x5669
movq 0x8(%rsp), %rax
movl (%rax), %edx
jmp 0x55c4
cmpl $0x61, %eax
je 0x55e8
cmpl $0x63, %eax
jne 0x5669
movq 0x8(%rsp), %rax
movl 0x8(%rax), %esi
testq %r13, %r13
je 0x565b
movl 0x18(%r13), %eax
movl %eax, %edx
shrl $0x1f, %edx
addl %eax, %edx
sarl %edx
jmp 0x55d5
movq 0x8(%rsp), %rax
movl 0x4(%rax), %edx
movl 0x8(%rax), %esi
jmp 0x55d5
movq 0x8(%rsp), %rax
movl 0x8(%rax), %esi
movl 0x18(%r15), %edx
leaq 0x1ba0f(%rip), %rdi     # 0x20feb
xorl %eax, %eax
callq 0x10b0
jmp 0x5669
movq %r13, 0x10(%rsp)
movq 0x8(%rsp), %rax
movl 0xc(%rax), %esi
leaq 0x1bfae(%rip), %rdi     # 0x215aa
xorl %eax, %eax
callq 0x10b0
cmpl $0x0, 0x4(%rsp)
jle 0x5645
movq %r12, %r13
movl $0x4, %r15d
leaq 0x1aabe(%rip), %r14     # 0x200d8
xorl %r12d, %r12d
movq (%r13), %rax
movl -0x4(%rax,%r15), %esi
movl (%rax,%r15), %edx
movq %r14, %rdi
xorl %eax, %eax
callq 0x10b0
incq %r12
movslq 0x4(%rsp), %rax
addq $0xc, %r15
cmpq %rax, %r12
jl 0x561d
movl $0xa, %edi
callq 0x1040
movq 0x20(%rsp), %r15
movq 0x10(%rsp), %r13
jmp 0x5669
leaq 0x1aa7d(%rip), %rdi     # 0x200df
xorl %eax, %eax
callq 0x10b0
testq %r13, %r13
je 0x5679
movq %rbx, %rdi
movq %r13, %rsi
callq 0x1b644
testq %rbp, %rbp
je 0x5695
movq 0x18(%rbp), %r14
movq %rbx, %rdi
movq %rbp, %rsi
callq 0x14832
movq %r14, %rbp
testq %r14, %r14
jne 0x567e
movq %rbx, %rdi
movq %r15, %rsi
callq 0x1b644
movq %rbx, %rdi
movq 0x30(%rsp), %rsi
callq 0x14832
xorl %eax, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq