LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_c_makefile_star2_O3/dwbuiten[P]obuparse/obuparse.c
// Function: obp_parse_tile_list
int obp_parse_tile_list(uint8_t *buf, size_t buf_size, OBPTileList *tile_list, OBPError *err)
{
    size_t pos = 0;

    if (buf_size < 4) {
        snprintf(err->error, err->size, "Tile list OBU must be at least 4 bytes.");
        return -1;
    }

    tile_list->output_frame_width_in_tiles_minus_1  = buf[0];
    tile_list->output_frame_height_in_tiles_minus_1 = buf[1];
    tile_list->tile_count_minus_1                   = (((uint16_t) buf[2]) << 8) | buf[3];
    pos += 4;

    for (uint16_t i = 0; i < tile_list->tile_count_minus_1; i++) {
        if (pos + 5 > buf_size) {
            snprintf(err->error, err->size, "Tile list OBU malformed: Not enough bytes for next tile_list_entry().");
            return -1;
        }

        tile_list->tile_list_entry[i].anchor_frame_idx       = buf[pos];
        tile_list->tile_list_entry[i].anchor_tile_row        = buf[pos + 1];
        tile_list->tile_list_entry[i].anchor_tile_col        = buf[pos + 2];
        tile_list->tile_list_entry[i].tile_data_size_minus_1 = (((uint16_t) buf[pos + 3]) << 8) | buf[pos + 4];
        pos += 5;

        size_t N = 8 * (((size_t) tile_list->tile_list_entry[i].tile_data_size_minus_1) + 1);

        if (pos + N > buf_size) {
            snprintf(err->error, err->size, "Tile list OBU malformed: Not enough bytes for next tile_list_entry()'s data.");
            return -1;
        }

        tile_list->tile_list_entry[i].coded_tile_data      = buf + pos;
        tile_list->tile_list_entry[i].coded_tile_data_size = N;
        pos += N;
    }

    return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
cmpq $0x3, %rsi
ja 0x2621
movq (%rcx), %rdi
movq 0x8(%rcx), %rsi
leaq 0x5bc5(%rip), %rdx      # 0x81d5
xorl %eax, %eax
callq 0x1030
movl $0xffffffff, %ebx       # imm = 0xFFFFFFFF
jmp 0x2705
movq %rdx, %rax
movb (%rdi), %dl
movb %dl, (%rax)
movb 0x1(%rdi), %dl
movb %dl, 0x1(%rax)
movzwl 0x2(%rdi), %edx
rolw $0x8, %dx
movw %dx, 0x2(%rax)
xorl %ebx, %ebx
testw %dx, %dx
je 0x2705
cmpq $0x9, %rsi
jae 0x265c
leaq 0x5bab(%rip), %rdx      # 0x81fd
movl $0xffffffff, %ebx       # imm = 0xFFFFFFFF
jmp 0x26f7
movzwl %dx, %r8d
addq $0x8, %rax
movb $0x1, %r9b
movl $0x4, %r14d
movl $0x9, %r15d
movl $0x1, %r11d
leaq 0x5bc3(%rip), %rdx      # 0x8243
leaq 0x5b76(%rip), %r10      # 0x81fd
movb (%rdi,%r14), %bpl
movb %bpl, (%rax)
movb 0x1(%rdi,%r14), %bpl
movb %bpl, 0x1(%rax)
movb 0x2(%rdi,%r14), %bpl
movb %bpl, 0x2(%rax)
movzwl 0x3(%rdi,%r14), %ebp
rolw $0x8, %bp
movw %bp, 0x4(%rax)
movzwl %bp, %r12d
leaq (%r15,%r12,8), %r14
addq $0x8, %r14
cmpq %rsi, %r14
ja 0x26ee
leaq 0x8(,%r12,8), %r9
addq %rdi, %r15
movq %r15, 0x8(%rax)
movq %r9, 0x10(%rax)
cmpq %r11, %r8
je 0x2705
seta %r9b
leaq 0x5(%r14), %r15
incq %r11
addq $0x18, %rax
cmpq %rsi, %r15
jbe 0x2687
movq %r10, %rdx
movzbl %r9b, %ebx
andl $0x1, %ebx
negl %ebx
movq (%rcx), %rdi
movq 0x8(%rcx), %rsi
xorl %eax, %eax
callq 0x1030
movl %ebx, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/dwbuiten[P]obuparse/obuparse.c
// Function: obp_ns
static inline int _obp_ns(_OBPBitReader *br, uint32_t n, uint32_t *out, OBPError *err)
{
    uint32_t w = _obp_floor_log2(n) + 1;
    uint32_t m = (((uint32_t)1) << w) - n;
    uint32_t v;
    uint32_t extra_bit;

    assert(w - 1 <= 32);
    _obp_br(v, br, ((uint8_t)(w - 1)));
    if (v < m) {
        *out = v;
        return 0;
    }
    _obp_br(extra_bit, br, 1);
    *out = (v << 1) - m + extra_bit;
    return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rcx, %r14
movq %rdx, %rbx
movq %rdi, %r15
movl %esi, %edx
shrl %edx
movl $0x20, %ecx
movl $0x20, %eax
je 0x772a
bsrl %edx, %eax
xorl $0x1f, %eax
subl %eax, %ecx
xorl %eax, %eax
cmpl $0x1, %esi
sbbl %eax, %eax
orl %ecx, %eax
leal 0x1(%rax), %ecx
movl $0x1, %ebp
shll %cl, %ebp
cmpl $0x21, %eax
jae 0x77db
movzbl 0x20(%r15), %ecx
movl %eax, %edx
subl %ecx, %edx
addl $0x7, %edx
sarl $0x3, %edx
movslq %edx, %rcx
movq 0x8(%r15), %rdx
subq 0x10(%r15), %rdx
cmpq %rcx, %rdx
jae 0x7783
movq (%r14), %rdi
movq 0x8(%r14), %rsi
leaq 0xa44(%rip), %rdx       # 0x81b9
xorl %eax, %eax
callq 0x1030
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
jmp 0x77d2
subl %esi, %ebp
movzbl %al, %esi
movq %r15, %rdi
callq 0x244e
movq %rax, %r12
cmpl %r12d, %ebp
ja 0x77cd
movzbl 0x20(%r15), %eax
movl $0x8, %ecx
subl %eax, %ecx
sarl $0x3, %ecx
movslq %ecx, %rax
movq 0x8(%r15), %rcx
subq 0x10(%r15), %rcx
cmpq %rax, %rcx
jb 0x7767
movq %r15, %rdi
movl $0x1, %esi
callq 0x244e
addl %r12d, %r12d
subl %ebp, %r12d
addl %eax, %r12d
movl %r12d, (%rbx)
xorl %eax, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
leaq 0xd8c(%rip), %rdi       # 0x856e
leaq 0x92e(%rip), %rsi       # 0x8117
leaq 0xd8a(%rip), %rcx       # 0x857a
movl $0xc2, %edx
callq 0x1040
// File: /workspace/github_c_makefile_star2_O3/dwbuiten[P]obuparse/obuparse.c
// Function: obp_read_delta_q
static inline int _obp_read_delta_q(_OBPBitReader *br, int32_t *out, OBPError *err)
{
    int delta_coded;
    _obp_br(delta_coded, br, 1);
    if (delta_coded) {
        int32_t val;
        int ret = _obp_su(br, 7, &val, err);
        if (ret < 0)
            return ret;
        *out = val;
    } else {
        *out = 0;
    }
    return 0;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %r14
movzbl 0x20(%rdi), %eax
movl $0x8, %ecx
subl %eax, %ecx
sarl $0x3, %ecx
movslq %ecx, %rax
movq 0x8(%rdi), %rcx
subq 0x10(%rdi), %rcx
cmpq %rax, %rcx
jb 0x7850
movq %rsi, %rbx
movq %rdi, %r15
movl $0x1, %esi
callq 0x244e
testl %eax, %eax
je 0x786c
movzbl 0x20(%r15), %eax
movl $0xe, %ecx
subl %eax, %ecx
shrl $0x3, %ecx
movq 0x8(%r15), %rax
subq 0x10(%r15), %rax
cmpq %rcx, %rax
jae 0x7874
movq (%r14), %rdi
movq 0x8(%r14), %rsi
leaq 0x95b(%rip), %rdx       # 0x81b9
xorl %eax, %eax
callq 0x1030
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
jmp 0x7892
movl $0x0, (%rbx)
jmp 0x7890
movq %r15, %rdi
movl $0x7, %esi
callq 0x244e
movl %eax, %ecx
shll $0x19, %ecx
sarl $0x1f, %ecx
andl $-0x80, %ecx
addl %eax, %ecx
movl %ecx, (%rbx)
xorl %eax, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/dwbuiten[P]obuparse/obuparse.c
// Function: obp_su
static inline int _obp_su(_OBPBitReader *br, uint32_t n, int32_t *out, OBPError *err)
{
    int32_t value;
    uint32_t signMask;

    _obp_br(value, br, n);
    signMask = ((uint32_t)1) << (n - 1);
    if (value & signMask) {
        value = value - 2 * signMask;
    }
    *out = value;
    return 0;
}

// Assembly:
pushq %rbp
pushq %rbx
pushq %rax
movq %rdx, %rbx
movzbl 0x20(%rdi), %eax
movl %esi, %edx
subl %eax, %edx
addl $0x7, %edx
shrl $0x3, %edx
movq 0x8(%rdi), %rax
subq 0x10(%rdi), %rax
cmpq %rdx, %rax
jae 0x78d5
movq (%rcx), %rdi
movq 0x8(%rcx), %rsi
leaq 0x8f2(%rip), %rdx       # 0x81b9
xorl %eax, %eax
callq 0x1030
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
jmp 0x78fe
movzbl %sil, %ebp
movl %ebp, %esi
callq 0x244e
decb %bpl
movzbl %bpl, %ecx
movl $0xfffffffe, %esi       # imm = 0xFFFFFFFE
shll %cl, %esi
movq %rax, %rdx
xorl %eax, %eax
btq %rcx, %rdx
cmovael %eax, %esi
addl %edx, %esi
movl %esi, (%rbx)
addq $0x8, %rsp
popq %rbx
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsDownwardEmbeddingForTrees
struct IntSet* dfsDownwardEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (int i=1; i<p.poset->n; ++i) {
		nEvaluations += dfsRaySearch(g, p, p.poset->vertices[i], gp);
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x30, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movaps 0x60(%rsp), %xmm0
movaps 0x70(%rsp), %xmm1
movaps 0x80(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq 0x60(%rsp), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x200e
leaq 0x60(%rsp), %r15
xorl %ebp, %ebp
pushq $0x1
popq %r12
movq 0x10(%rax), %rax
movq (%rax,%r12,8), %rsi
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups 0x20(%r15), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x187db
addl %eax, %ebp
incq %r12
movq (%r15), %rax
movslq (%rax), %rcx
cmpq %rcx, %r12
jl 0x1fcf
movq 0x2afe3(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1e017(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
addq $0x30, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x1543e
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: latticePathEmbeddingForTrees
struct IntSet* latticePathEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getPathInDAG(p.poset->vertices[i]);
			nEvaluations += binarySearchEvaluation(g, p, path, gp);
			free(path);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movaps 0x70(%rsp), %xmm0
movaps 0x80(%rsp), %xmm1
movaps 0x90(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq 0x70(%rsp), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x20f7
leaq 0x70(%rsp), %r12
xorl %ebp, %ebp
pushq $0x1
popq %r13
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x152d3
testl %eax, %eax
jne 0x20e8
movq (%r12), %rax
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x188a5
movq %rax, %r15
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x18912
addl %eax, %ebp
movq %r15, %rdi
callq 0x1030
incq %r13
movq (%r12), %rax
movslq (%rax), %rcx
cmpq %rcx, %r13
jl 0x208c
movq 0x2aefa(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1df2e(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x1543e
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: latticeLongestPathEmbeddingForTrees
struct IntSet* latticeLongestPathEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getLongestPathInDAG(p.poset->vertices[i], p.poset, sgp);
			nEvaluations += binarySearchEvaluation(g, p, path, gp);
			free(path);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, 0x30(%rsp)
movq %rsi, %r14
movq %rdi, %r15
movaps 0x70(%rsp), %xmm0
movaps 0x80(%rsp), %xmm1
movaps 0x90(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq 0x70(%rsp), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x21e9
leaq 0x70(%rsp), %r13
xorl %ebp, %ebp
pushq $0x1
popq %rbx
movq 0x10(%rax), %rax
movq (%rax,%rbx,8), %rdi
callq 0x152d3
testl %eax, %eax
jne 0x21da
movq (%r13), %rsi
movq 0x10(%rsi), %rax
movq (%rax,%rbx,8), %rdi
movq 0x30(%rsp), %rdx
callq 0x189fd
movq %rax, %r12
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 %rax, %rsi
movq %r14, %rdx
callq 0x18912
addl %eax, %ebp
movq %r12, %rdi
callq 0x1030
incq %rbx
movq (%r13), %rax
movslq (%rax), %rcx
cmpq %rcx, %rbx
jl 0x217b
movq 0x2ae08(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1de3c(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x1543e
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: staticPathCoverEmbeddingForTrees
struct IntSet* staticPathCoverEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (size_t i=0; i<p.sketchSize; ++i) {
		nEvaluations += binarySearchEvaluation(g, p, p.shrunkPermutations[i], gp);
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x30, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movaps 0x60(%rsp), %xmm0
movaps 0x70(%rsp), %xmm1
movaps 0x80(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
xorl %ebp, %ebp
cmpq $0x0, 0x88(%rsp)
je 0x229e
leaq 0x60(%rsp), %r15
xorl %r12d, %r12d
xorl %ebp, %ebp
movq 0x18(%r15), %rax
movq (%rax,%r12,8), %rsi
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups 0x20(%r15), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x18912
addl %eax, %ebp
incq %r12
cmpq 0x28(%r15), %r12
jb 0x2264
movq 0x2ad53(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1dd87(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
addq $0x30, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x1543e
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsDownwardEmbeddingForLocalEasy
struct IntSet* dfsDownwardEmbeddingForLocalEasy(struct Graph* g, struct EvaluationPlan p, int sampleSize, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	struct SpanningtreeTree spTree = getSampledSpanningtreeTree(getBlockTreeT(g, sgp), sampleSize, 1, gp, sgp);

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (int i=1; i<p.poset->n; ++i) {
		nEvaluations += dfsRaySearchLE(&spTree, p, p.poset->vertices[i], gp);
	}

	dumpSpanningtreeTree(spTree, gp);

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0xa0, %rsp
movq %rcx, %r14
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %rsi
leaq 0xd0(%rsp), %r12
leaq 0x78(%rsp), %r15
movq %r15, %rdi
movq %rcx, %rdx
callq 0xe7b8
movq 0x20(%r15), %rax
movq %rax, 0x20(%rsp)
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
leaq 0x40(%rsp), %rdi
pushq $0x1
popq %rdx
movl %ebp, %esi
movq %rbx, %rcx
movq %r14, %r8
callq 0xefc8
movaps (%r12), %xmm0
movaps 0x10(%r12), %xmm1
movaps 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq (%r12), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x263a
xorl %ebp, %ebp
pushq $0x1
popq %r15
leaq 0x40(%rsp), %r14
movq 0x10(%rax), %rax
movq (%rax,%r15,8), %rsi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x18b82
addl %eax, %ebp
incq %r15
movq (%r12), %rax
movslq (%rax), %rcx
cmpq %rcx, %r15
jl 0x25f7
movq 0x70(%rsp), %rax
movq %rax, 0x30(%rsp)
movups 0x40(%rsp), %xmm0
movups 0x50(%rsp), %xmm1
movups 0x60(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %rbx, %rdi
callq 0xf470
movq 0x2a988(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1d9bc(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1543e
addq $0xa0, %rsp
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: latticePathEmbeddingForLocalEasy
struct IntSet* latticePathEmbeddingForLocalEasy(struct Graph* g, struct EvaluationPlan p, int sampleSize, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	struct SpanningtreeTree spTree = getSampledSpanningtreeTree(getBlockTreeT(g, sgp), sampleSize, 1, gp, sgp);

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getPathInDAG(p.poset->vertices[i]);
			nEvaluations += binarySearchEvaluationLE(&spTree, p, path, gp);
			free(path);
		}
	}

	dumpSpanningtreeTree(spTree, gp);

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x98, %rsp
movq %rcx, %r14
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %rsi
leaq 0xd0(%rsp), %r12
leaq 0x70(%rsp), %r15
movq %r15, %rdi
movq %rcx, %rdx
callq 0xe7b8
movq 0x20(%r15), %rax
movq %rax, 0x20(%rsp)
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
leaq 0x38(%rsp), %rdi
pushq $0x1
popq %rdx
movl %ebp, %esi
movq %rbx, %rcx
movq %r14, %r8
callq 0xefc8
movaps (%r12), %xmm0
movaps 0x10(%r12), %xmm1
movaps 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq (%r12), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x27c0
xorl %ebp, %ebp
pushq $0x1
popq %r13
leaq 0x38(%rsp), %r14
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x152d3
testl %eax, %eax
jne 0x27b1
movq (%r12), %rax
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x188a5
movq %rax, %r15
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x18c78
addl %eax, %ebp
movq %r15, %rdi
callq 0x1030
incq %r13
movq (%r12), %rax
movslq (%rax), %rcx
cmpq %rcx, %r13
jl 0x2755
movq 0x68(%rsp), %rax
movq %rax, 0x30(%rsp)
movups 0x38(%rsp), %xmm0
movups 0x48(%rsp), %xmm1
movups 0x58(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %rbx, %rdi
callq 0xf470
movq 0x2a802(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1d836(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1543e
addq $0x98, %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: latticeLongestPathEmbeddingForLocalEasy
struct IntSet* latticeLongestPathEmbeddingForLocalEasy(struct Graph* g, struct EvaluationPlan p, int sampleSize, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	struct SpanningtreeTree spTree = getSampledSpanningtreeTree(getBlockTreeT(g, sgp), sampleSize, 1, gp, sgp);

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getLongestPathInDAG(p.poset->vertices[i], p.poset, sgp);
			nEvaluations += binarySearchEvaluationLE(&spTree, p, path, gp);
			free(path);
		}
	}

	dumpSpanningtreeTree(spTree, gp);

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x98, %rsp
movq %rcx, %r14
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %rsi
leaq 0xd0(%rsp), %r13
leaq 0x70(%rsp), %r15
movq %r15, %rdi
movq %rcx, %rdx
callq 0xe7b8
movq 0x20(%r15), %rax
movq %rax, 0x20(%rsp)
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
leaq 0x38(%rsp), %rdi
pushq $0x1
popq %rdx
movl %ebp, %esi
movq %rbx, %rcx
movq %r14, %r8
callq 0xefc8
movaps (%r13), %xmm0
movaps 0x10(%r13), %xmm1
movaps 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
movq (%r13), %rax
xorl %ebp, %ebp
cmpl $0x2, (%rax)
jl 0x2944
xorl %ebp, %ebp
pushq $0x1
popq %r15
movq 0x10(%rax), %rax
movq (%rax,%r15,8), %rdi
callq 0x152d3
testl %eax, %eax
jne 0x2935
movq (%r13), %rsi
movq 0x10(%rsi), %rax
movq (%rax,%r15,8), %rdi
movq %r14, %rdx
callq 0x189fd
movq %rax, %r12
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
leaq 0x38(%rsp), %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x18c78
addl %eax, %ebp
movq %r12, %rdi
callq 0x1030
incq %r15
movq (%r13), %rax
movslq (%rax), %rcx
cmpq %rcx, %r15
jl 0x28d6
movq 0x68(%rsp), %rax
movq %rax, 0x30(%rsp)
movups 0x38(%rsp), %xmm0
movups 0x48(%rsp), %xmm1
movups 0x58(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %rbx, %rdi
callq 0xf470
movq 0x2a67e(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1d6b2(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1543e
addq $0x98, %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: staticPathCoverEmbeddingForLocalEasy
struct IntSet* staticPathCoverEmbeddingForLocalEasy(struct Graph* g, struct EvaluationPlan p, int sampleSize, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	struct SpanningtreeTree spTree = getSampledSpanningtreeTree(getBlockTreeT(g, sgp), sampleSize, 1, gp, sgp);

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (size_t i=0; i<p.sketchSize; ++i) {
		nEvaluations += binarySearchEvaluationLE(&spTree, p, p.shrunkPermutations[i], gp);
	}

	dumpSpanningtreeTree(spTree, gp);

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0xa0, %rsp
movq %rcx, %r14
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %rsi
leaq 0xd0(%rsp), %r12
leaq 0x78(%rsp), %r15
movq %r15, %rdi
movq %rcx, %rdx
callq 0xe7b8
movq 0x20(%r15), %rax
movq %rax, 0x20(%rsp)
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
leaq 0x40(%rsp), %rdi
pushq $0x1
popq %rdx
movl %ebp, %esi
movq %rbx, %rcx
movq %r14, %r8
callq 0xefc8
movaps (%r12), %xmm0
movaps 0x10(%r12), %xmm1
movaps 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x15298
xorl %ebp, %ebp
cmpq $0x0, 0x28(%r12)
je 0x2a9a
xorl %r15d, %r15d
leaq 0x40(%rsp), %r14
xorl %ebp, %ebp
movq 0x18(%r12), %rax
movq (%rax,%r15,8), %rsi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x18c78
addl %eax, %ebp
incq %r15
cmpq 0x28(%r12), %r15
jb 0x2a5b
movq 0x70(%rsp), %rax
movq %rax, 0x30(%rsp)
movups 0x40(%rsp), %xmm0
movups 0x50(%rsp), %xmm1
movups 0x60(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %rbx, %rdi
callq 0xf470
movq 0x2a528(%rip), %rax     # 0x2cff8
movq (%rax), %rdi
leaq 0x1d55c(%rip), %rsi     # 0x20036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1543e
addq $0xa0, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: pr_sanityOfFlow
int pr_sanityOfFlow(struct Graph* g, struct Vertex* s, struct Vertex* t, FILE* out) {
	int sOuttIn = s->visited + t->visited;

	int excessViolated = 0;
	for (int vi=0; vi<g->n; ++vi) {
		struct Vertex* v = g->vertices[vi];
		if ((v != s) && (v != t)) {
			if (v->visited != 0) {
				++excessViolated;
			}
		}
	}

	if (out) {
		fprintf(out, "excess s: %i, excess t:%i, violations in between: %i\n", s->visited, t->visited, excessViolated);
	}

	return !sOuttIn && !excessViolated;
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movslq (%rdi), %rax
testq %rax, %rax
jle 0x2fd5
movq 0x10(%rdi), %rdi
xorl %r8d, %r8d
xorl %ebx, %ebx
movq (%rdi,%r8,8), %r9
cmpq %rsi, %r9
sete %r10b
cmpq %rdx, %r9
sete %r11b
orb %r10b, %r11b
jne 0x2fcb
cmpl $0x1, 0x1c(%r9)
sbbl $-0x1, %ebx
incq %r8
cmpq %r8, %rax
jne 0x2fac
jmp 0x2fd7
xorl %ebx, %ebx
movl 0x1c(%rsi), %ebp
movl 0x1c(%rdx), %r14d
testq %rcx, %rcx
je 0x2ffc
leaq 0x1d01a(%rip), %rsi     # 0x20004
movq %rcx, %rdi
movl %ebp, %edx
movl %r14d, %ecx
movl %ebx, %r8d
xorl %eax, %eax
callq 0x1160
negl %r14d
xorl %r14d, %ebp
xorl %eax, %eax
orl %ebx, %ebp
sete %al
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: pr_sanityOfFinalActiveArray
int pr_sanityOfFinalActiveArray(struct ShallowGraph** activeVertices, int nLists, FILE* out) {
	int forgottenVertices = 0;
	for (int i=0; i<nLists; ++i) {
		if (peekFromVertexQueue(activeVertices[i])) {
			forgottenVertices += activeVertices[i]->m;
			if (out) {
				fprintf(out, "Level %i: Vertex %i\n", i, peekFromVertexQueue(activeVertices[i])->number);
			}
		}
	}
	if (out) {
		fprintf(out, "total of forgotten vertices: %i\n", forgottenVertices);
	}
	return forgottenVertices;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
testl %esi, %esi
jle 0x306e
movq %rdi, %r14
movl %esi, %r13d
leaq 0x1d00d(%rip), %r15     # 0x2003a
xorl %r12d, %r12d
xorl %ebp, %ebp
movq (%r14,%r12,8), %rdi
callq 0x1e749
testq %rax, %rax
je 0x3064
movq (%r14,%r12,8), %rdi
addl 0x10(%rdi), %ebp
testq %rbx, %rbx
je 0x3064
callq 0x1e749
movl 0x18(%rax), %ecx
movq %rbx, %rdi
movq %r15, %rsi
movl %r12d, %edx
xorl %eax, %eax
callq 0x1160
incq %r12
cmpq %r12, %r13
jne 0x3032
jmp 0x3070
xorl %ebp, %ebp
testq %rbx, %rbx
je 0x3088
leaq 0x1cfd3(%rip), %rsi     # 0x2004f
movq %rbx, %rdi
movl %ebp, %edx
xorl %eax, %eax
callq 0x1160
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_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: augment
char augment(struct Vertex* s, struct Vertex* t) {
	struct VertexList* e;

	if (s == t) {
		return 1;
	}
	s->visited = 1;
	for (e=s->neighborhood; e!=NULL; e=e->next) {
		if ((e->flag == 0) && (e->endPoint->visited == 0)) {
			char found = augment(e->endPoint, t);
			if (found) {
				setFlag(e, 1);
				s->visited = 0;
				return 1;
			}
		}
	}
	s->visited = 0;
	return 0;
}

// Assembly:
cmpq %rsi, %rdi
je 0x33b5
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
movl $0x1, 0x1c(%rdi)
movq 0x8(%rdi), %r15
testq %r15, %r15
je 0x33a6
movq %rsi, %r14
cmpl $0x0, 0x24(%r15)
jne 0x339d
movq 0x18(%r15), %rdi
cmpl $0x0, 0x1c(%rdi)
jne 0x339d
movq %r14, %rsi
callq 0x3360
testb %al, %al
jne 0x33b8
movq 0x8(%r15), %r15
testq %r15, %r15
jne 0x3380
xorl %eax, %eax
movl $0x0, 0x1c(%rbx)
popq %rbx
popq %r14
popq %r15
retq
movb $0x1, %al
retq
movl $0x1, 0x24(%r15)
movq (%r15), %rax
movl $0x0, 0x24(%rax)
movb $0x1, %al
jmp 0x33a8
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: augmentWithCapacity
char augmentWithCapacity(struct Vertex* s, struct Vertex* t) {
	if (s == t) {
		return 1;
	}

	s->visited = 1;
	for (struct VertexList* e=s->neighborhood; e!=NULL; e=e->next) {
		if ((e->flag < e->used) && (e->endPoint->visited == 0)) {
			char found = augmentWithCapacity(e->endPoint, t);
			if (found) {
				addFlow(e, 1);
				s->visited = 0;
				return 1;
			}
		}
	}
	s->visited = 0;
	return 0;
}

// Assembly:
cmpq %rsi, %rdi
je 0x3426
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
movl $0x1, 0x1c(%rdi)
movq 0x8(%rdi), %r15
testq %r15, %r15
je 0x3417
movq %rsi, %r14
movl 0x24(%r15), %eax
cmpl 0x20(%r15), %eax
jge 0x340e
movq 0x18(%r15), %rdi
cmpl $0x0, 0x1c(%rdi)
jne 0x340e
movq %r14, %rsi
callq 0x33ce
testb %al, %al
jne 0x3429
movq 0x8(%r15), %r15
testq %r15, %r15
jne 0x33ee
xorl %eax, %eax
movl $0x0, 0x1c(%rbx)
popq %rbx
popq %r14
popq %r15
retq
movb $0x1, %al
retq
incl 0x24(%r15)
movq (%r15), %rax
decl 0x24(%rax)
movb $0x1, %al
jmp 0x3419
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: getMatchedVertex
struct Vertex* getMatchedVertex(struct Vertex* a) {
	struct VertexList* e;
	for (e=a->neighborhood; e!=NULL; e=e->next) {
		if (e->flag == 1) {
			return e->endPoint;
		}
	}
	return NULL;
}

// Assembly:
xorl %eax, %eax
movq 0x8(%rdi), %rdi
testq %rdi, %rdi
je 0x344c
cmpl $0x1, 0x24(%rdi)
jne 0x3439
movq 0x18(%rdi), %rax
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: addResidualEdges
void addResidualEdges(struct Vertex* v, struct Vertex* w, struct ListPool* lp) {
	struct VertexList* f1;
	struct VertexList* f2;

	f1 = getVertexList(lp);
	f1->startPoint = v;
	f1->endPoint = w;
	f2 = inverseEdge(f1, lp);

	f1->flag = 0;
	f2->flag = 1;
	f1->label = (char*)f2;
	f2->label = (char*)f1;

	addEdge(v, f1);
	addEdge(w, f2);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq %rdx, %rdi
callq 0x141f1
movq %rax, %r12
movq %r15, 0x10(%rax)
movq %r14, 0x18(%rax)
movq %rax, %rdi
movq %rbx, %rsi
callq 0x7c08
movq %rax, %rbx
movl $0x0, 0x24(%r12)
movl $0x1, 0x24(%rax)
movq %rax, (%r12)
movq %r12, (%rax)
movq %r15, %rdi
movq %r12, %rsi
callq 0x7cfe
movq %r14, %rdi
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x7cfe
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: addResidualEdgesWithCapacity
void addResidualEdgesWithCapacity(struct Vertex* v, struct Vertex* w, int capacity, struct ListPool* lp) {
	struct VertexList* f1;
	struct VertexList* f2;

	f1 = getVertexList(lp);
	f1->startPoint = v;
	f1->endPoint = w;
	f2 = inverseEdge(f1, lp);

	f1->used = capacity;
	f2->used = capacity;
	f1->flag = 0;
	f2->flag = capacity;
	f1->label = (char*)f2;
	f2->label = (char*)f1;

	addEdge(v, f1);
	addEdge(w, f2);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rcx, %rbx
movl %edx, %ebp
movq %rsi, %r14
movq %rdi, %r15
movq %rcx, %rdi
callq 0x141f1
movq %rax, %r12
movq %r15, 0x10(%rax)
movq %r14, 0x18(%rax)
movq %rax, %rdi
movq %rbx, %rsi
callq 0x7c08
movq %rax, %rbx
movl %ebp, 0x20(%r12)
movl %ebp, 0x20(%rax)
movl $0x0, 0x24(%r12)
movl %ebp, 0x24(%rax)
movq %rax, (%r12)
movq %r12, (%rax)
movq %r15, %rdi
movq %r12, %rsi
callq 0x7cfe
movq %r14, %rdi
movq %rbx, %rsi
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x7cfe
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: _cloneStrangeBipartite
struct Graph* __cloneStrangeBipartite(struct Graph* g, struct GraphPool* gp) {
	int v; 
	struct VertexList* e;
	struct Graph* h = createGraph(g->n, gp);
	h->number = g->number;
	h->m = g->m;

	for (v=0; v<g->number; ++v) {
		for (e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {		
			addResidualEdges(h->vertices[v], h->vertices[e->endPoint->number], gp->listPool);
		}
	}
	return h;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl (%rdi), %edi
callq 0x85e3
movq %rax, %r15
movl 0x8(%r14), %eax
movl %eax, 0x8(%r15)
movl 0x4(%r14), %ecx
movl %ecx, 0x4(%r15)
testl %eax, %eax
jle 0x35b5
xorl %r12d, %r12d
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rcx
movq 0x8(%rcx), %r13
testq %r13, %r13
je 0x35aa
movq 0x10(%r15), %rax
movq (%rax,%r12,8), %rdi
movq 0x18(%r13), %rcx
movslq 0x18(%rcx), %rcx
movq (%rax,%rcx,8), %rsi
movq 0x18(%rbx), %rdx
callq 0x3468
movq 0x8(%r13), %r13
testq %r13, %r13
jne 0x3580
movl 0x8(%r14), %eax
incq %r12
movslq %eax, %rcx
cmpq %rcx, %r12
jl 0x356f
movq %r15, %rax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: initBipartite
void initBipartite(struct Graph* B) {
	int i;
	struct VertexList* e;
	for (i=0; i<B->number; ++i) {
		for (e=B->vertices[i]->neighborhood; e!=NULL; e=e->next) {
			setFlag(e, 0);
		}
	}
}

// Assembly:
movslq 0x8(%rdi), %rax
testq %rax, %rax
jle 0x35f9
movq 0x10(%rdi), %rcx
xorl %edx, %edx
movq (%rcx,%rdx,8), %rsi
movq 0x8(%rsi), %rsi
testq %rsi, %rsi
je 0x35f1
movl $0x0, 0x24(%rsi)
movq (%rsi), %rdi
movl $0x1, 0x24(%rdi)
jmp 0x35d5
incq %rdx
cmpq %rax, %rdx
jne 0x35d1
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: removeSandT
void removeSandT(struct Graph* B, struct Vertex* s, struct Vertex* t, struct GraphPool* gp) {	
	int w;

	for (w=0; w<B->number; ++w) {
		removeEdge(B->vertices[w], s, gp->listPool);
	}

	for (w=B->number; w<B->n; ++w) {
		removeEdge(B->vertices[w], t, gp->listPool);
	}

	dumpVertexListRecursively(gp->listPool, s->neighborhood);
	dumpVertexListRecursively(gp->listPool, t->neighborhood);

	dumpVertex(gp->vertexPool, s);
	dumpVertex(gp->vertexPool, t);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rcx, %r14
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
movl 0x8(%rdi), %eax
testl %eax, %eax
jle 0x363b
xorl %r13d, %r13d
movq 0x10(%r12), %rax
movq (%rax,%r13,8), %rdi
movq 0x18(%r14), %rdx
movq %r15, %rsi
callq 0x7d0b
incq %r13
movslq 0x8(%r12), %rax
cmpq %rax, %r13
jl 0x3619
cmpl (%r12), %eax
jge 0x3665
movslq %eax, %r13
movq 0x10(%r12), %rax
movq (%rax,%r13,8), %rdi
movq 0x18(%r14), %rdx
movq %rbx, %rsi
callq 0x7d0b
incq %r13
movslq (%r12), %rax
cmpq %rax, %r13
jl 0x3644
movq 0x18(%r14), %rdi
movq 0x8(%r15), %rsi
callq 0x1427a
movq 0x18(%r14), %rdi
movq 0x8(%rbx), %rsi
callq 0x1427a
movq 0x10(%r14), %rdi
movq %r15, %rsi
callq 0x144f0
movq 0x10(%r14), %rdi
movq %rbx, %rsi
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x144f0
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: bipartiteMatchingFastAndDirty
int bipartiteMatchingFastAndDirty(struct Graph* g, struct GraphPool* gp) {
	int v;
	int matchingSize = 0;

	struct Vertex* s = getVertex(gp->vertexPool);
	struct Vertex* t = getVertex(gp->vertexPool);
	s->number = -1;
	t->number = -2;

	/* Add s, t and edges from s to A and from B to t.
	Also, set residual capacities for these edges correctly */
	for (v=0; v<g->number; ++v) {
		addResidualEdges(s, g->vertices[v], gp->listPool);
	}

	for (v=g->number; v<g->n; ++v) {
		addResidualEdges(g->vertices[v], t, gp->listPool);
	}

	while (augment(s, t)) {
		++matchingSize;
	}

	removeSandT(g, s, t, gp);

	return matchingSize;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq 0x10(%rsi), %rdi
callq 0x1447e
movq %rax, %r15
movq 0x10(%rbx), %rdi
callq 0x1447e
movq %rax, %r12
movl $0xffffffff, 0x18(%r15) # imm = 0xFFFFFFFF
movl $0xfffffffe, 0x18(%rax) # imm = 0xFFFFFFFE
movl 0x8(%r14), %eax
testl %eax, %eax
jle 0x3703
xorl %r13d, %r13d
movq 0x10(%r14), %rax
movq (%rax,%r13,8), %rsi
movq 0x18(%rbx), %rdx
movq %r15, %rdi
callq 0x3468
incq %r13
movslq 0x8(%r14), %rax
cmpq %rax, %r13
jl 0x36e3
cmpl (%r14), %eax
jge 0x372a
movslq %eax, %r13
movq 0x10(%r14), %rax
movq (%rax,%r13,8), %rdi
movq 0x18(%rbx), %rdx
movq %r12, %rsi
callq 0x3468
incq %r13
movslq (%r14), %rax
cmpq %rax, %r13
jl 0x370b
movl $0xffffffff, %ebp       # imm = 0xFFFFFFFF
movq %r15, %rdi
movq %r12, %rsi
callq 0x3360
incl %ebp
testb %al, %al
jne 0x372f
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %rbx, %rcx
callq 0x35fa
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_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: bipartiteMatchingEvenMoreDirty
int bipartiteMatchingEvenMoreDirty(struct Graph* g) {
	int matchingSize = 0;
	int activity = g->activity;
	while (augment_B(g)) {
		++matchingSize;
	}
	g->activity = activity;
	return matchingSize;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %rbx
movl 0x8(%rdi), %edi
movl 0xc(%rbx), %r14d
xorl %ebp, %ebp
cmpl %edi, %r14d
jge 0x37cf
xorl %ebp, %ebp
movl %r14d, %r15d
movslq %r15d, %r12
leal 0x1(%r12), %r15d
movq 0x10(%rbx), %rax
movq (%rax,%r12,8), %rsi
cmpl $0x0, 0x28(%rsi)
jne 0x37a2
callq 0x3833
testb %al, %al
jne 0x37b2
movl 0x8(%rbx), %edi
incq %r12
movslq %edi, %rax
incl %r15d
cmpq %rax, %r12
jl 0x3788
jmp 0x37cf
movl %r15d, 0xc(%rbx)
movq 0x10(%rbx), %rax
movq (%rax,%r12,8), %rax
movl $0x1, 0x28(%rax)
incl %ebp
movl 0x8(%rbx), %edi
cmpl %edi, %r15d
jl 0x3780
movl %r14d, 0xc(%rbx)
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: bipartiteMatchingTerminateEarly
char bipartiteMatchingTerminateEarly(struct Graph* B) {

	for (int v=0; v<B->number; ++v) {
		if (B->vertices[v]->d == 0) {
			char found = augment_B_rec(B, B->vertices[v]);
			if (found) {
				B->vertices[v]->d = 1;
			} else {
				return 0;
			}
		}
	}
	return 1;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %r14
movl 0x8(%rdi), %edi
movb $0x1, %bl
testl %edi, %edi
jle 0x382b
movq 0x10(%r14), %rax
xorl %r15d, %r15d
movq (%rax,%r15,8), %rsi
cmpl $0x0, 0x28(%rsi)
jne 0x381c
callq 0x3833
testb %al, %al
je 0x3829
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rcx
movl $0x1, 0x28(%rcx)
movl 0x8(%r14), %edi
incq %r15
movslq %edi, %rcx
cmpq %rcx, %r15
jl 0x37f6
jmp 0x382b
xorl %ebx, %ebx
movl %ebx, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: augment_B_rec
static char augment_B_rec(struct Graph* B, struct Vertex* v) {
	struct VertexList* e;

	if ((v->number >= B->number) && (v->d == 0)) {
		v->d = 1;
		return 1;
	}
	v->visited = 1;
	for (e=v->neighborhood; e!=NULL; e=e->next) {
		if ((e->flag == 0) && (e->endPoint->visited == 0)) {
			char found = augment_B_rec(B, e->endPoint);
			if (found) {
				setFlag(e, 1);
				v->visited = 0;
				return 1;
			}
		}
	}
	v->visited = 0;
	return 0;
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rsi, %rbx
movl %edi, %ebp
cmpl %edi, 0x18(%rsi)
jl 0x3847
cmpl $0x0, 0x28(%rbx)
je 0x3884
movl $0x1, 0x1c(%rbx)
movq 0x8(%rbx), %r14
testq %r14, %r14
je 0x3879
cmpl $0x0, 0x24(%r14)
jne 0x3873
movq 0x18(%r14), %rsi
cmpl $0x0, 0x1c(%rsi)
jne 0x3873
movl %ebp, %edi
callq 0x3833
testb %al, %al
jne 0x388d
movq 0x8(%r14), %r14
jmp 0x3852
movl $0x0, 0x1c(%rbx)
xorl %eax, %eax
jmp 0x38a2
movl $0x1, 0x28(%rbx)
jmp 0x38a0
movl $0x1, 0x24(%r14)
movq (%r14), %rax
xorl %ecx, %ecx
movl %ecx, 0x24(%rax)
movl %ecx, 0x1c(%rbx)
movb $0x1, %al
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: getMatching
struct ShallowGraph* getMatching(struct Graph* g, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* matching = getShallowGraph(sgp);
	struct VertexList* e;
	int v;
	
	for (v=0; v<g->number; ++v) {
		for (e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			if (e->flag == 1) {
				struct VertexList* f = shallowCopyEdge(e, sgp->listPool);
				f->label = NULL;
				appendEdge(matching, f);
			}
		}
	}
	return matching;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movq %rsi, %rdi
callq 0x1498d
movq %rax, %r15
movl 0x8(%r14), %eax
testl %eax, %eax
jle 0x391c
xorl %r13d, %r13d
movq 0x10(%r14), %rcx
movq (%rcx,%r13,8), %rcx
movq 0x8(%rcx), %r12
testq %r12, %r12
je 0x3911
cmpl $0x1, 0x24(%r12)
jne 0x3903
movq 0x10(%rbx), %rsi
movq %r12, %rdi
callq 0x7bec
movq $0x0, (%rax)
movq %r15, %rdi
movq %rax, %rsi
callq 0x8916
movq 0x8(%r12), %r12
testq %r12, %r12
jne 0x38dd
movl 0x8(%r14), %eax
incq %r13
movslq %eax, %rcx
cmpq %rcx, %r13
jl 0x38cc
movq %r15, %rax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bipartiteMatching.c
// Function: bipartiteMatching
struct ShallowGraph* bipartiteMatching(struct Graph* h, struct GraphPool* gp, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* matching;
	struct Graph* g = __cloneStrangeBipartite(h, gp);

	bipartiteMatchingFastAndDirty(g, gp);
	matching = getMatching(g, sgp);
	rebaseShallowGraphs(matching, h); 

	/* garbage collection */
	dumpGraph(gp, g);

	return matching;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
callq 0x353f
movq %rax, %r12
movq %rax, %rdi
movq %r14, %rsi
callq 0x36a0
movq %r12, %rdi
movq %rbx, %rsi
callq 0x38a7
movq %rax, %rbx
movq %rax, %rdi
movq %r15, %rsi
callq 0x87b6
movq %r14, %rdi
movq %r12, %rsi
callq 0x14700
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bitSet.c
// Function: copyBitset
uint8_t* copyBitset(uint8_t* bitset, size_t n) {
	uint8_t* copy = createBitset(n);
	size_t nBytes = (n % 8 == 0) ? (n / 8) : (n / 8 + 1);
	memcpy(copy, bitset, nBytes);
	return copy;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movl %ebx, %eax
andl $0x7, %eax
shrq $0x3, %rbx
cmpq $0x1, %rax
sbbq $-0x1, %rbx
movl $0x1, %esi
movq %rbx, %rdi
callq 0x1120
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x1170
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bloomFilter.c
// Function: initPruning
void initPruning(const int nGraphs) {
	nPruning = nGraphs;
	if ((pruning = malloc(nGraphs * sizeof(int)))) {
		int i;
		for (i=0; i<nGraphs; ++i) {
			pruning[i] = 0;
		}
	}
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movl %edi, %ebx
movl %edi, 0x2965c(%rip)     # 0x2d170
movslq %edi, %r14
leaq (,%r14,4), %rdi
callq 0x1190
movq %rax, 0x2964d(%rip)     # 0x2d178
testq %rax, %rax
sete %cl
testl %r14d, %r14d
setle %dl
orb %cl, %dl
jne 0x3b52
movl %ebx, %edx
shlq $0x2, %rdx
movq %rax, %rdi
xorl %esi, %esi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x10d0
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/bloomFilter.c
// Function: initialAddToPruningSet
void initialAddToPruningSet(const int elementID, const int index) {
	if (index >= nPruning) {
		int i;
		pruning = realloc(pruning, 2 * nPruning * sizeof(int));
		for (i=nPruning; i<2*nPruning; ++i) {
			pruning[i] = 0;
		}
		nPruning *= 2;
	}
	addToPruningSet(elementID, index);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movl %esi, %ebx
movl %edi, %ebp
movslq 0x295c4(%rip), %r12     # 0x2d170
movq 0x295c5(%rip), %r14     # 0x2d178
cmpl %esi, %r12d
jg 0x3bfa
leal (%r12,%r12), %r15d
leaq (,%r12,8), %rsi
movq %r14, %rdi
callq 0x11c0
movq %rax, %r14
movq %rax, 0x295a2(%rip)     # 0x2d178
cmpl %r15d, %r12d
jge 0x3bf3
leaq (%r14,%r12,4), %rdi
leal -0x1(%r12), %eax
leaq 0x4(,%rax,4), %rdx
xorl %esi, %esi
callq 0x10d0
movl %r15d, 0x29576(%rip)    # 0x2d170
movl $0x1, %eax
movl %ebp, %ecx
shll %cl, %eax
movslq %ebx, %rcx
orl %eax, (%r14,%rcx,4)
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/cachedGraph.c
// Function: initCachedGraph
struct CachedGraph* initCachedGraph(struct GraphPool* gp, int size) {
	struct CachedGraph* cache;
	if ((cache = malloc(sizeof(struct CachedGraph)))) {
		cache->gp = gp;
		cache->inUse = 0;
		cache->g = createGraph(size, gp);
		// __setVertexNumber(cache->g, size, gp);
		cache->maxCap = size;
		cache->next = NULL;
	}
	return cache;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movl %esi, %ebx
movq %rdi, %r15
movl $0x28, %edi
callq 0x1190
movq %rax, %r14
testq %rax, %rax
je 0x3c8e
movq %r15, 0x20(%r14)
movb $0x0, (%r14)
movl %ebx, %edi
movq %r15, %rsi
callq 0x85e3
movq %rax, 0x8(%r14)
movl %ebx, 0x10(%r14)
movq $0x0, 0x18(%r14)
movq %r14, %rax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/cachedGraph.c
// Function: getCachedGraph
struct Graph* getCachedGraph(int size, struct CachedGraph* cache) {
	 if (!cache->inUse) {
	 	cache->inUse = 1;
		if (cache->maxCap < size) {
			// do the 'increase size by factor of two' thing to avoid many reallocs
			int newCap = max(size, 2 * cache->maxCap);
			
			// dump old graph
			cache->g->n = cache->maxCap;
			dumpGraph(cache->gp, cache->g);
			
			// create larger new graph
			cache->g = createGraph(newCap, cache->gp);
			cache->maxCap = newCap;
		} 
		cache->g->n = size;	
		return cache->g;
	} else {
		fprintf(stderr, "Graph is in use\n");
		return NULL;
	}
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
cmpb $0x0, (%rsi)
jne 0x3ced
movq %rsi, %r14
movl %edi, %ebx
movb $0x1, (%rsi)
movl 0x10(%rsi), %esi
cmpl %edi, %esi
jge 0x3ce2
addl %esi, %esi
movl %ebx, %edi
callq 0x98f8
movl %eax, %ebp
movl 0x10(%r14), %eax
movq 0x8(%r14), %rsi
movl %eax, (%rsi)
movq 0x20(%r14), %rdi
callq 0x14700
movq 0x20(%r14), %rsi
movl %ebp, %edi
callq 0x85e3
movq %rax, 0x8(%r14)
movl %ebp, 0x10(%r14)
jmp 0x3ce6
movq 0x8(%r14), %rax
movl %ebx, (%rax)
popq %rbx
popq %r14
popq %rbp
retq
callq 0x1280
xorl %eax, %eax
jmp 0x3ce8
// File: /workspace/github_c_makefile_star2_O3/pwelke[P]GraphMiningTools/cachedGraph.c
// Function: returnCachedGraph
void returnCachedGraph(struct CachedGraph* cache) {
	struct Vertex** vertices = cache->g->vertices;
	struct ListPool* lp = cache->gp->listPool;
	int n = cache->g->n;
	for (int wi=0; wi<n; ++wi) {
		struct Vertex* w = vertices[wi];
		dumpVertexListRecursively(lp, w->neighborhood);
		wipeVertexButKeepNumber(w);
	}
	cache->inUse = 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq 0x8(%rdi), %rax
movslq (%rax), %r12
testq %r12, %r12
jle 0x3d3f
movq 0x20(%rbx), %rcx
movq 0x10(%rax), %r13
movq 0x18(%rcx), %r14
xorl %ebp, %ebp
movq (%r13,%rbp,8), %r15
movq 0x8(%r15), %rsi
movq %r14, %rdi
callq 0x1427a
movq %r15, %rdi
callq 0x144dd
incq %rbp
cmpq %rbp, %r12
jne 0x3d1e
movb $0x0, (%rbx)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq