LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/dataset.c
// Function: nn_ratio
double nn_ratio(Datasetptr d, double *estimate)
{
 /* multiclass is handled by one vs one */
 Instance mean, variance;
 Instanceptr temp, traindata, *nearestneighbors;
 int count, cno1, cno2;
 double result = 0;
 double intraclass = 0, interclass = 0, dist;
 int intranum = 0, internum = 0;
 read_from_train_file(d, &traindata);
 mean = find_mean(traindata);
 variance = find_variance(traindata);
 normalize(traindata, mean, variance);
 type_change(d);
 temp = traindata;
 count = 2;
 while(temp)
  {
   nearestneighbors = find_nearest_neighbors(traindata, temp, count);
   dist = distance_between_instances(nearestneighbors[1], temp);
   cno1 = give_classno(nearestneighbors[1]);
   cno2 = give_classno(temp);
   if (cno1 == cno2)
    {
     intraclass += dist;
     intranum++;
    }
   else
    {
     interclass += dist;
     internum++;
    }
   temp = temp->next;
   safe_free(nearestneighbors);
  }
 result = intraclass / interclass;
 *estimate = (double) internum / (internum + intranum); 
 safe_free(mean.values);
 safe_free(variance.values);
 type_restore(d);
 deallocate(traindata);
 traindata = NULL;
 return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xf8, %rsp
movq %rsi, 0x88(%rsp)
movq %rdi, %rbx
leaq 0x80(%rsp), %r15
movq %r15, %rsi
callq 0x5577a
movq (%r15), %rsi
leaq 0xc8(%rsp), %r12
movq %r12, %rdi
callq 0x116b6
movq (%r15), %rsi
leaq 0x98(%rsp), %r13
movq %r13, %rdi
callq 0x1197e
movq (%r15), %rdi
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x50(%rsp)
movups %xmm1, 0x40(%rsp)
movups %xmm0, 0x30(%rsp)
movupd (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movupd %xmm0, (%rsp)
callq 0xfad8
movq %rbx, 0x90(%rsp)
movq %rbx, %rdi
callq 0x16c95
xorl %r14d, %r14d
xorpd %xmm0, %xmm0
movsd %xmm0, 0x68(%rsp)
movq (%r15), %r15
pushq $0x2
popq %rbp
movsd %xmm0, 0x70(%rsp)
xorl %ebx, %ebx
testq %r15, %r15
je 0x1865f
movq 0x80(%rsp), %rdi
movq %r15, %rsi
movl %ebp, %edx
callq 0x2d47a
movq %rax, %r12
movq 0x8(%rax), %rdi
movq %r15, %rsi
callq 0x2beed
movsd %xmm0, 0x78(%rsp)
movq 0x8(%r12), %rdi
callq 0x2b47e
movl %eax, %r13d
movq %r15, %rdi
callq 0x2b47e
cmpl %eax, %r13d
jne 0x1863d
movsd 0x68(%rsp), %xmm0
addsd 0x78(%rsp), %xmm0
movsd %xmm0, 0x68(%rsp)
incl %r14d
jmp 0x18651
movsd 0x70(%rsp), %xmm0
addsd 0x78(%rsp), %xmm0
movsd %xmm0, 0x70(%rsp)
incl %ebx
movq 0x10(%r15), %r15
movq %r12, %rdi
callq 0x34ff7
jmp 0x185e0
cvtsi2sd %ebx, %xmm0
addl %ebx, %r14d
cvtsi2sd %r14d, %xmm1
movsd 0x68(%rsp), %xmm2
divsd 0x70(%rsp), %xmm2
movsd %xmm2, 0x68(%rsp)
divsd %xmm1, %xmm0
movq 0x88(%rsp), %rax
movsd %xmm0, (%rax)
movq 0xc8(%rsp), %rdi
callq 0x34ff7
movq 0x98(%rsp), %rdi
callq 0x34ff7
movq 0x90(%rsp), %rdi
callq 0x16cc6
movq 0x80(%rsp), %rdi
callq 0x2c010
movsd 0x68(%rsp), %xmm0
addq $0xf8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/dataset.c
// Function: nn_nonlinearity
double nn_nonlinearity(Datasetptr d, Instanceptr testdata)
{
 /*!Last Changed 07.05.2006 Oya*/
 Instance mean, variance;
 Instanceptr temp, traindata, *nearestneighbors;
 int count, cno1, cno2;
 double result = 0;
 int intranum = 0, internum = 0;
 read_from_train_file(d, &traindata);
 mean = find_mean(traindata);
 variance = find_variance(traindata);
 normalize(traindata, mean, variance);
 normalize(testdata, mean, variance);
 type_change(d);
 temp = testdata;
 count = 1;
 while (temp)
  {
   nearestneighbors = find_nearest_neighbors(traindata, temp, count);
   cno1 = give_classno(nearestneighbors[0]);
   cno2 = give_classno(temp);
   if (cno1 == cno2)
     intranum++;
   else
     internum++;
   temp = temp->next;
   safe_free(nearestneighbors);
  }
 result = (double) internum / (internum + intranum);
 safe_free(mean.values);
 safe_free(variance.values);
 deallocate(traindata);
 type_restore(d);
 return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xd8, %rsp
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x60(%rsp), %r12
movq %r12, %rsi
callq 0x5577a
movq (%r12), %rsi
leaq 0xa8(%rsp), %r15
movq %r15, %rdi
callq 0x116b6
movq (%r12), %rsi
leaq 0x78(%rsp), %r13
movq %r13, %rdi
callq 0x1197e
movq (%r12), %rdi
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x50(%rsp)
movups %xmm1, 0x40(%rsp)
movups %xmm0, 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 0xfad8
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x50(%rsp)
movups %xmm1, 0x40(%rsp)
movups %xmm0, 0x30(%rsp)
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
callq 0xfad8
movq %rbx, 0x70(%rsp)
movq %rbx, %rdi
callq 0x16c95
xorl %r13d, %r13d
pushq $0x1
popq %rbp
xorl %ebx, %ebx
testq %r14, %r14
je 0x18b6f
movq 0x60(%rsp), %rdi
movq %r14, %rsi
movl %ebp, %edx
callq 0x2d47a
movq %rax, %r15
movq (%rax), %rdi
callq 0x2b47e
movl %eax, %r12d
movq %r14, %rdi
callq 0x2b47e
xorl %ecx, %ecx
xorl %edx, %edx
cmpl %eax, %r12d
setne %cl
sete %dl
addl %edx, %r13d
addl %ecx, %ebx
movq 0x10(%r14), %r14
movq %r15, %rdi
callq 0x34ff7
jmp 0x18b25
cvtsi2sd %ebx, %xmm1
addl %ebx, %r13d
cvtsi2sd %r13d, %xmm0
divsd %xmm0, %xmm1
movsd %xmm1, 0x68(%rsp)
movq 0xa8(%rsp), %rdi
callq 0x34ff7
movq 0x78(%rsp), %rdi
callq 0x34ff7
movq 0x60(%rsp), %rdi
callq 0x2c010
movq 0x70(%rsp), %rdi
callq 0x16cc6
movsd 0x68(%rsp), %xmm0
addq $0xd8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: graph_connected
BOOLEAN graph_connected(matrix distancematrix)
{
 int i, j;
 for (i = 0; i < distancematrix.row; i++)
   for (j = i + 1; j < distancematrix.col; j++)
     if (distancematrix.values[i][j] == +LONG_MAX)
       return BOOLEAN_FALSE;
 return BOOLEAN_TRUE;
}

// Assembly:
movq %rdi, %rcx
shrq $0x20, %rcx
xorl %r8d, %r8d
testl %edi, %edi
movl $0x0, %edx
cmovgl %edi, %edx
pushq $0x1
popq %rdi
pushq $0x1
popq %rax
movsd 0x7d112(%rip), %xmm0    # 0x96330
cmpq %rdx, %r8
je 0x19250
leaq 0x1(%r8), %r9
movq %rdi, %r10
cmpl %ecx, %r10d
jge 0x19246
movq (%rsi,%r8,8), %r11
movsd (%r11,%r10,8), %xmm1
incq %r10
ucomisd %xmm0, %xmm1
jne 0x1922a
jp 0x1922a
jmp 0x1924e
incq %rdi
movq %r9, %r8
jmp 0x1921e
xorl %eax, %eax
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: simple_dfs
void simple_dfs(matrix adjacencymatrix, BOOLEAN* discovered, int v)
{
 /*!Last Changed 04.04.2008*/
 int i;
 discovered[v] = BOOLEAN_TRUE;
 for (i = 0; i < adjacencymatrix.row; i++)
   if (discovered[i] == BOOLEAN_FALSE && adjacencymatrix.values[v][i] == BOOLEAN_TRUE)
     simple_dfs(adjacencymatrix, discovered, i);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movslq %ecx, %r13
movl $0x1, (%rdx,%r13,4)
xorl %r12d, %r12d
testl %r15d, %r15d
movl $0x0, %ebp
cmovgl %r15d, %ebp
cmpq %r12, %rbp
je 0x192b7
cmpl $0x0, (%rbx,%r12,4)
jne 0x192b2
movq (%r14,%r13,8), %rax
movsd (%rax,%r12,8), %xmm0
ucomisd 0x7c283(%rip), %xmm0    # 0x95520
jne 0x192b2
jp 0x192b2
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
movl %r12d, %ecx
callq 0x19251
incq %r12
jmp 0x1927f
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: is_graph_connected
int is_graph_connected(matrix adjacencymatrix)
{
 /*!Last Changed 04.04.2008*/
 int i; 
 BOOLEAN* discovered = safemalloc(adjacencymatrix.row * sizeof(BOOLEAN), "is_graph_connected", 1);
 BOOLEAN connected = BOOLEAN_TRUE;
 simple_dfs(adjacencymatrix, discovered, 0);
 for (i = 0; i < adjacencymatrix.row; i++)
   if (!discovered[i])
    {
     connected = BOOLEAN_FALSE;
     break;
    } 
 safe_free(discovered);
 return connected;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r15
movq %rdi, %r12
movslq %r12d, %r13
leaq (,%r13,4), %rdi
leaq 0x7e47a(%rip), %rsi     # 0x97763
pushq $0x1
popq %rbx
movl %ebx, %edx
callq 0x34f59
movq %rax, %r14
xorl %ebp, %ebp
movq %r12, %rdi
movq %r15, %rsi
movq %rax, %rdx
xorl %ecx, %ecx
callq 0x19251
testl %r13d, %r13d
cmovlel %ebp, %r13d
cmpq %rbp, %r13
je 0x19321
cmpl $0x0, (%r14,%rbp,4)
leaq 0x1(%rbp), %rbp
jne 0x1930f
xorl %ebx, %ebx
movq %r14, %rdi
callq 0x34ff7
movl %ebx, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: floyds_all_pairs_shortest_path_algorithm
void floyds_all_pairs_shortest_path_algorithm(matrix* distancematrix)
{
 int i, j, k, N = distancematrix->row;
 for (k = 0; k < N; k++)
   for (i = 0; i < N; i++)
     for (j = 0; j < N; j++)
       if (distancematrix->values[i][j] > distancematrix->values[i][k] + distancematrix->values[k][j])
         distancematrix->values[i][j] = distancematrix->values[i][k] + distancematrix->values[k][j];
}

// Assembly:
movl (%rdi), %eax
xorl %ecx, %ecx
testl %eax, %eax
movl $0x0, %edx
cmovgl %eax, %edx
cmpq %rdx, %rcx
je 0x19395
xorl %esi, %esi
cmpq %rax, %rsi
je 0x19390
xorl %r8d, %r8d
cmpq %r8, %rax
je 0x1938b
movq 0x8(%rdi), %r10
movq (%r10,%rsi,8), %r9
movsd (%r9,%r8,8), %xmm1
movsd (%r9,%rcx,8), %xmm0
movq (%r10,%rcx,8), %r10
addsd (%r10,%r8,8), %xmm0
ucomisd %xmm0, %xmm1
jbe 0x19386
movsd %xmm0, (%r9,%r8,8)
incq %r8
jmp 0x19357
incq %rsi
jmp 0x1934f
incq %rcx
jmp 0x19348
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: graph
Graphptr graph(int vertexcount)
{
 int i;
 Graphptr g;
 g = malloc(sizeof(Graph));
 g->nedges = 0;
 g->nvertices = vertexcount;
 for (i = 0; i < vertexcount; i++)
  {
   g->visitorder[i] = 0;
   g->height[i] = 0;
   g->degree[i] = 0;
  }
 return g;
}

// Assembly:
pushq %rbx
movl %edi, %ebx
movl $0xf46288, %edi         # imm = 0xF46288
callq 0x40e0
andl $0x0, 0xf46284(%rax)
movl %ebx, 0xf46280(%rax)
xorl %ecx, %ecx
testl %ebx, %ebx
cmovlel %ecx, %ebx
cmpq %rcx, %rbx
je 0x193d9
andl $0x0, 0xf433a0(%rax,%rcx,4)
andl $0x0, 0xf44340(%rax,%rcx,4)
andl $0x0, 0xf42400(%rax,%rcx,4)
incq %rcx
jmp 0x193b7
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: print_graph
void print_graph(Graphptr g)
{
 int i, j;
 for (i = 0; i < g->nvertices; i++)
   for (j = 0; j < g->degree[i]; j++)
     printf("%d -> %d (%.2f)\n", i, g->edges[i][j].v, g->edges[i][j].weight);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
leaq 0x8(%rdi), %r12
xorl %r14d, %r14d
leaq 0x7e37f(%rip), %r15     # 0x97776
movslq 0xf46280(%rbx), %rax
cmpq %rax, %r14
jge 0x19441
movq %r12, %r13
xorl %ebp, %ebp
movslq 0xf42400(%rbx,%r14,4), %rax
cmpq %rax, %rbp
jge 0x19435
movl -0x8(%r13), %edx
movsd (%r13), %xmm0
movq %r15, %rdi
movl %r14d, %esi
movb $0x1, %al
callq 0x4030
incq %rbp
addq $0x10, %r13
jmp 0x19408
incq %r14
addq $0x3e80, %r12           # imm = 0x3E80
jmp 0x193f7
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: graph_insert_edge
void graph_insert_edge(Graphptr g, int x, int y, double weight)
{
 if (g->degree[x] >= MAXDEGREE - 1)
  {
   printf(m1443, x, y);
   return;
  }
 g->edges[x][g->degree[x]].v = y;
 g->edges[x][g->degree[x]].weight = weight;
 g->degree[x]++;
 g->nedges++;
}

// Assembly:
movslq %esi, %rax
movslq 0xf42400(%rdi,%rax,4), %rcx
cmpq $0x3e7, %rcx            # imm = 0x3E7
jl 0x19472
leaq 0x7e31c(%rip), %rdi     # 0x97787
xorl %eax, %eax
jmp 0x4030
imulq $0x3e80, %rax, %rsi     # imm = 0x3E80
addq %rdi, %rsi
shlq $0x4, %rcx
movl %edx, (%rcx,%rsi)
movslq 0xf42400(%rdi,%rax,4), %rcx
leal 0x1(%rcx), %edx
shlq $0x4, %rcx
movsd %xmm0, 0x8(%rcx,%rsi)
movl %edx, 0xf42400(%rdi,%rax,4)
incl 0xf46284(%rdi)
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: compute_indegrees
void compute_indegrees(Graphptr g, int* in)
{
 int i, j;
 for (i = 0; i < g->nvertices; i++)
   in[i] = 0;
 for (i = 0; i < g->nvertices; i++)
   for (j = 0; j < g->degree[i]; j++)
     in[g->edges[i][j].v]++;
}

// Assembly:
xorl %eax, %eax
movslq 0xf46280(%rdi), %rdx
cmpq %rdx, %rax
jge 0x194bd
andl $0x0, (%rsi,%rax,4)
incq %rax
jmp 0x194a8
xorl %eax, %eax
movq %rdi, %rcx
movslq %edx, %rdx
cmpq %rdx, %rax
jge 0x194ff
movq %rcx, %rdx
xorl %r8d, %r8d
movslq 0xf42400(%rdi,%rax,4), %r9
cmpq %r9, %r8
jge 0x194ed
movslq (%rdx), %r9
incl (%rsi,%r9,4)
incq %r8
addq $0x10, %rdx
jmp 0x194d0
incq %rax
movl 0xf46280(%rdi), %edx
addq $0x3e80, %rcx           # imm = 0x3E80
jmp 0x194c2
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: minimum_spanning_tree_prim
Graphptr minimum_spanning_tree_prim(Graphptr g)
{
 int i, v, w;
 int intree[MAXV];
 double distance[MAXV], weight, dist;
 int parent[MAXV];
 Graphptr mst = graph(g->nvertices);
 for (i = 0; i < g->nvertices; i++)
  {
   intree[i] = BOOLEAN_FALSE;
   distance[i] = +LONG_MAX;
   parent[i] = -1;
  }
 distance[0] = 0;
 v = 0;
 while (!intree[v])
  {
   intree[v] = BOOLEAN_TRUE;
   for (i = 0; i < g->degree[v]; i++)
    {
     w = g->edges[v][i].v;
     weight = g->edges[v][i].weight;
     if (distance[w] > weight && !intree[w])
      {
       distance[w] = weight;
       parent[w] = v;
      }
    }
   v = 0;
   dist = +LONG_MAX;
   for (i = 1; i < g->nvertices; i++)
     if (!intree[i] && dist > distance[i])
      {
       dist = distance[i];
       v = i;
      }
  }
 for (i = 1; i < g->nvertices; i++)
   if (parent[i] != -1)
    {
     graph_insert_edge(mst, parent[i], i, 1);
     graph_insert_edge(mst, i, parent[i], 1);
    }
 return mst;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x3e88, %rsp           # imm = 0x3E88
movq %rdi, %rbx
movl 0xf46280(%rdi), %edi
callq 0x19396
movq %rax, %r14
movl 0xf46280(%rbx), %eax
movslq %eax, %rcx
xorl %edx, %edx
testl %ecx, %ecx
movl $0x0, %esi
cmovgl %ecx, %esi
movabsq $0x43e0000000000000, %rdi # imm = 0x43E0000000000000
cmpq %rdx, %rsi
je 0x1955b
andl $0x0, (%rsp,%rdx,4)
movq %rdi, 0x1f40(%rsp,%rdx,8)
orl $-0x1, 0xfa0(%rsp,%rdx,4)
incq %rdx
jmp 0x1953d
andq $0x0, 0x1f40(%rsp)
leaq 0x8(%rbx), %rdx
xorl %esi, %esi
movsd 0x7cdbe(%rip), %xmm0    # 0x96330
pushq $0x1
popq %rdi
xorl %r8d, %r8d
movslq %r8d, %r10
cmpl $0x0, (%rsp,%r10,4)
jne 0x19623
movl $0x1, (%rsp,%r10,4)
movl 0xf42400(%rbx,%r10,4), %r9d
testl %r9d, %r9d
cmovlel %esi, %r9d
shlq $0x4, %r9
imulq $0x3e80, %r10, %r10     # imm = 0x3E80
addq %rdx, %r10
xorl %r11d, %r11d
cmpq %r11, %r9
je 0x195ed
movslq -0x8(%r10,%r11), %r15
movsd (%r10,%r11), %xmm1
movsd 0x1f40(%rsp,%r15,8), %xmm2
ucomisd %xmm1, %xmm2
jbe 0x195e7
cmpl $0x0, (%rsp,%r15,4)
jne 0x195e7
movsd %xmm1, 0x1f40(%rsp,%r15,8)
movl %r8d, 0xfa0(%rsp,%r15,4)
addq $0x10, %r11
jmp 0x195ae
xorl %r8d, %r8d
movq %rdi, %r9
movapd %xmm0, %xmm1
cmpq %rcx, %r9
jge 0x19578
cmpl $0x0, (%rsp,%r9,4)
jne 0x1961e
movsd 0x1f40(%rsp,%r9,8), %xmm2
ucomisd %xmm2, %xmm1
jbe 0x1961e
movl %r9d, %r8d
movapd %xmm2, %xmm1
incq %r9
jmp 0x195f7
pushq $0x1
popq %r15
movslq %eax, %rcx
cmpq %rcx, %r15
jge 0x19671
movl 0xfa0(%rsp,%r15,4), %ebp
cmpl $-0x1, %ebp
je 0x1966c
movq %r14, %rdi
movl %ebp, %esi
movl %r15d, %edx
movsd 0x7bed4(%rip), %xmm0    # 0x95520
callq 0x19450
movq %r14, %rdi
movl %r15d, %esi
movl %ebp, %edx
movsd 0x7bebf(%rip), %xmm0    # 0x95520
callq 0x19450
movl 0xf46280(%rbx), %eax
incq %r15
jmp 0x19627
movq %r14, %rax
addq $0x3e88, %rsp           # imm = 0x3E88
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: shortest_path
double* shortest_path(Graphptr g, int start)
{
 int i, v, w;
 int intree[MAXV];
 double* distance, weight, dist;
 distance = safemalloc(g->nvertices * sizeof(double), "shortest_path", 3);
 for (i = 0; i < g->nvertices; i++)
  {
   intree[i] = BOOLEAN_FALSE;
   distance[i] = +LONG_MAX;
  }
 distance[start] = 0;
 v = start;
 g->parents[v] = -1;
 while (!intree[v])
  {
   intree[v] = BOOLEAN_TRUE;
   for (i = 0; i < g->degree[v]; i++)
    {
     w = g->edges[v][i].v;
     weight = g->edges[v][i].weight;
     if (distance[w] > distance[v] + weight)
      {
       distance[w] = distance[v] + weight;
       g->parents[w] = v;
      }
    }
   v = 0;
   dist = +LONG_MAX;
   for (i = 1; i < g->nvertices; i++)
     if (!intree[i] && dist > distance[i])
      {
       dist = distance[i];
       v = i;
      }
  }
 return distance;
}

// Assembly:
pushq %rbp
pushq %rbx
subq $0xfa8, %rsp            # imm = 0xFA8
movl %esi, %ebp
movq %rdi, %rbx
movslq 0xf46280(%rdi), %rdi
shlq $0x3, %rdi
leaq 0x7e11a(%rip), %rsi     # 0x977bc
pushq $0x3
popq %rdx
callq 0x34f59
movl 0xf46280(%rbx), %ecx
xorl %edx, %edx
testl %ecx, %ecx
cmovlel %edx, %ecx
movabsq $0x43e0000000000000, %rsi # imm = 0x43E0000000000000
cmpq %rdx, %rcx
je 0x196d3
andl $0x0, (%rsp,%rdx,4)
movq %rsi, (%rax,%rdx,8)
incq %rdx
jmp 0x196c1
movslq %ebp, %rcx
andq $0x0, (%rax,%rcx,8)
orl $-0x1, 0xf452e0(%rbx,%rcx,4)
leaq 0x8(%rbx), %rcx
movsd 0x7cc41(%rip), %xmm0    # 0x96330
pushq $0x1
popq %rdx
movslq %ebp, %rsi
cmpl $0x0, (%rsp,%rsi,4)
jne 0x19781
movl $0x1, (%rsp,%rsi,4)
imulq $0x3e80, %rsi, %rdi     # imm = 0x3E80
addq %rcx, %rdi
xorl %r8d, %r8d
movslq 0xf42400(%rbx,%rsi,4), %r9
cmpq %r9, %r8
jge 0x19750
movslq -0x8(%rdi), %r9
movsd (%rdi), %xmm1
movsd (%rax,%r9,8), %xmm2
addsd (%rax,%rsi,8), %xmm1
ucomisd %xmm1, %xmm2
jbe 0x19747
movsd %xmm1, (%rax,%r9,8)
movl %ebp, 0xf452e0(%rbx,%r9,4)
incq %r8
addq $0x10, %rdi
jmp 0x19713
movslq 0xf46280(%rbx), %rsi
xorl %ebp, %ebp
movq %rdx, %rdi
movapd %xmm0, %xmm1
cmpq %rsi, %rdi
jge 0x196f2
cmpl $0x0, (%rsp,%rdi,4)
jne 0x1977c
movsd (%rax,%rdi,8), %xmm2
ucomisd %xmm2, %xmm1
jbe 0x1977c
movl %edi, %ebp
movapd %xmm2, %xmm1
incq %rdi
jmp 0x19760
addq $0xfa8, %rsp            # imm = 0xFA8
popq %rbx
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: eccentricity
int eccentricity(Graphptr g, int node)
{
 int i, eccentricity = 0;
 double* path_lengths = shortest_path(g, node);
 for (i = 0; i < g->nvertices; i++)
   if (path_lengths[i] > eccentricity)
     eccentricity = path_lengths[i];
 safe_free(path_lengths);
 return eccentricity;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
callq 0x19682
movl 0xf46280(%rbx), %ecx
xorl %edx, %edx
testl %ecx, %ecx
cmovlel %edx, %ecx
xorl %ebx, %ebx
cmpq %rdx, %rcx
je 0x197c1
movsd (%rax,%rdx,8), %xmm0
cvtsi2sd %ebx, %xmm1
ucomisd %xmm1, %xmm0
cvttsd2si %xmm0, %esi
cmoval %esi, %ebx
incq %rdx
jmp 0x197a3
movq %rax, %rdi
callq 0x34ff7
movl %ebx, %eax
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: topological_sort
int* topological_sort(Graphptr g)
{
 int x, y, i, j;
 int *node;
 int* sorted = safemalloc(sizeof(int) * g->nvertices, "topological_sort", 1);
 int indegree[MAXV];
 Queueptr zeroin = queue();
 compute_indegrees(g, indegree);
 for (i = 0; i < g->nvertices; i++)
   if (indegree[i] == 0)
    {
     node = safemalloc(sizeof(int), "topological_sort", 11);
     node[0] = i;
     enqueue(zeroin, node);
    }
 j = 0;
 while (!queue_empty(zeroin))
  {
   node = dequeue(zeroin);
   x = node[0];
   safe_free(node);
   sorted[j] = x;
   j++;
   for (i = 0; i < g->degree[x]; i++)
    {
     y = g->edges[x][i].v;
     indegree[y]--;
     if (indegree[y] == 0)
      {
       node = safemalloc(sizeof(int), "topological_sort", 29);
       node[0] = y;
       enqueue(zeroin, node);
      }
    }
  }
 free_queue(zeroin);
 return sorted;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xfb8, %rsp            # imm = 0xFB8
movq %rdi, %rbx
movslq 0xf46280(%rdi), %rdi
shlq $0x2, %rdi
leaq 0x7dfd7(%rip), %r12     # 0x977ca
pushq $0x1
popq %rdx
movq %r12, %rsi
callq 0x34f59
movq %rax, (%rsp)
callq 0x19c15
movq %rax, %r15
leaq 0x10(%rsp), %rsi
movq %rbx, %rdi
callq 0x194a6
xorl %r14d, %r14d
pushq $0x4
popq %r13
pushq $0xb
popq %rbp
movslq 0xf46280(%rbx), %rax
cmpq %rax, %r14
jge 0x19855
cmpl $0x0, 0x10(%rsp,%r14,4)
jne 0x19850
movq %r13, %rdi
movq %r12, %rsi
movl %ebp, %edx
callq 0x34f59
movl %r14d, (%rax)
movq %r15, %rdi
movq %rax, %rsi
callq 0x198f6
incq %r14
jmp 0x19821
xorl %r12d, %r12d
cmpl $0x0, 0x1f50(%r15)
jle 0x198d8
movq %r15, %rdi
callq 0x19945
movslq (%rax), %r14
movq %rax, %rdi
callq 0x34ff7
movq (%rsp), %rax
movq %r12, 0x8(%rsp)
movl %r14d, (%rax,%r12,4)
imulq $0x3e80, %r14, %r12     # imm = 0x3E80
addq %rbx, %r12
xorl %r13d, %r13d
movslq 0xf42400(%rbx,%r14,4), %rax
cmpq %rax, %r13
jge 0x198ce
movslq (%r12), %rbp
decl 0x10(%rsp,%rbp,4)
jne 0x198c5
pushq $0x4
popq %rdi
leaq 0x7df1a(%rip), %rsi     # 0x977ca
pushq $0x1d
popq %rdx
callq 0x34f59
movl %ebp, (%rax)
movq %r15, %rdi
movq %rax, %rsi
callq 0x198f6
incq %r13
addq $0x10, %r12
jmp 0x1988f
movq 0x8(%rsp), %r12
incq %r12
jmp 0x19858
movq %r15, %rdi
callq 0x34ff7
movq (%rsp), %rax
addq $0xfb8, %rsp            # imm = 0xFB8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: enqueue
void enqueue(Queueptr q, void* x)
{
 /*!Last Changed 21.01.2009*/
 if (q->count >= QUEUESIZE)
   printf("Queue overflow\n");
 else
  {
   q->last = (q->last + 1) % QUEUESIZE;
   q->elements[q->last] = x;
   q->count = q->count + 1;
  }
}

// Assembly:
movl 0x1f50(%rdi), %ecx
cmpl $0x3e8, %ecx            # imm = 0x3E8
jl 0x19910
leaq 0x7df22(%rip), %rdi     # 0x9782d
jmp 0x4090
movl 0x1f4c(%rdi), %eax
incl %eax
movl $0x3e8, %r8d            # imm = 0x3E8
cltd
idivl %r8d
movl %edx, 0x1f4c(%rdi)
movslq %edx, %rax
movq %rsi, (%rdi,%rax,8)
incl %ecx
movl %ecx, 0x1f50(%rdi)
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: dequeue
void* dequeue(Queueptr q)
{
 /*!Last Changed 21.01.2009*/
 void* x = NULL;
 if (q->count <= 0)
   printf("Warning: Empty queue dequeue\n");
 else
  {
   x = q->elements[q->first];
   q->first = (q->first + 1) % QUEUESIZE;
   q->count = q->count - 1;
  }
 return x;
}

// Assembly:
movl 0x1f50(%rdi), %esi
testl %esi, %esi
jle 0x19976
movslq 0x1f48(%rdi), %rax
movq (%rdi,%rax,8), %rcx
incl %eax
movl $0x3e8, %r8d            # imm = 0x3E8
cltd
idivl %r8d
movl %edx, 0x1f48(%rdi)
decl %esi
movl %esi, 0x1f50(%rdi)
jmp 0x19989
pushq %rax
leaq 0x7debe(%rip), %rdi     # 0x9783c
callq 0x4090
xorl %ecx, %ecx
addq $0x8, %rsp
movq %rcx, %rax
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: graph_from_distancematrix
Graphptr graph_from_distancematrix(matrix distancematrix)
{
 int i, j;
 Graphptr g;
 g = graph(distancematrix.row);
 for (i = 0; i < distancematrix.row; i++)
   for (j = 0; j < distancematrix.row; j++)
     if (distancematrix.values[i][j] != -1)
      {
       (g->nedges)++;
       g->edges[i][g->degree[i]].v = j;
       g->edges[i][g->degree[i]].weight = distancematrix.values[i][j];
       (g->degree[i])++;
      }
 return g;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
callq 0x19396
xorl %ecx, %ecx
testl %r14d, %r14d
movl $0x0, %edx
cmovgl %r14d, %edx
movl %r14d, %esi
movsd 0x7c3f1(%rip), %xmm0    # 0x95db0
cmpq %rdx, %rcx
je 0x19a27
imulq $0x3e80, %rcx, %rdi     # imm = 0x3E80
addq %rax, %rdi
xorl %r8d, %r8d
cmpq %r8, %rsi
je 0x19a22
movq (%rbx,%rcx,8), %r9
movsd (%r9,%r8,8), %xmm1
ucomisd %xmm0, %xmm1
jne 0x199e8
jnp 0x19a1d
incl 0xf46284(%rax)
movslq 0xf42400(%rax,%rcx,4), %r9
shlq $0x4, %r9
movl %r8d, (%r9,%rdi)
movslq 0xf42400(%rax,%rcx,4), %r9
leal 0x1(%r9), %r10d
shlq $0x4, %r9
movsd %xmm1, 0x8(%r9,%rdi)
movl %r10d, 0xf42400(%rax,%rcx,4)
incq %r8
jmp 0x199d1
incq %rcx
jmp 0x199bf
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: list_item
Listitemptr list_item(void* item)
{
 /*!Last Changed 21.01.2009*/
 Listitemptr l;
 l = safemalloc(sizeof(Listitem), "list_item", 2);
 l->item = item;
 l->next = NULL;
 return l;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
leaq 0x7dd4a(%rip), %rsi     # 0x977e1
pushq $0x10
popq %rdi
pushq $0x2
popq %rdx
callq 0x34f59
movq %rbx, (%rax)
andq $0x0, 0x8(%rax)
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: link_list_insert
void link_list_insert(Linklistptr l, void* item)
{
 /*!Last Changed 21.01.2009*/
 Listitemptr listitem = list_item(item);
 if (l->head == NULL)
   l->head = listitem;
 else
   l->tail->next = listitem;
 l->tail = listitem;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movq %rsi, %rdi
callq 0x19a8c
cmpq $0x0, (%rbx)
movq %rbx, %rcx
je 0x19ae4
movq 0x8(%rbx), %rcx
addq $0x8, %rcx
movq %rax, (%rcx)
movq %rax, 0x8(%rbx)
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: link_list_remove
BOOLEAN link_list_remove(Linklistptr l, void* item, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 21.01.2009*/
 Listitemptr tmp = l->head, tmpbefore = NULL;
 while (tmp && compare(item, tmp->item) != 0)
  {
   tmpbefore = tmp;
   tmp = tmp->next;
  }
 if (tmp != NULL)
  {
   if (tmpbefore == NULL) /*first element is deleted*/
     l->head = l->head->next;
   else
     tmpbefore->next = tmp->next;
   if (l->tail == tmp) /*last element is deleted*/
     l->tail = tmpbefore;
   safe_free(tmp);
   return BOOLEAN_TRUE;
  }
 else
   return BOOLEAN_FALSE;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r12
movq %rsi, %r13
movq %rdi, %rbx
xorl %r15d, %r15d
movq %rdi, %rax
xorl %ebp, %ebp
movq (%rax), %r14
testq %r14, %r14
je 0x19b56
movq (%r14), %rsi
movq %r13, %rdi
callq *%r12
testl %eax, %eax
je 0x19b27
leaq 0x8(%r14), %rax
movq %r14, %rbp
jmp 0x19b09
testq %rbp, %rbp
je 0x19b36
movq 0x8(%r14), %rax
movq %rax, 0x8(%rbp)
jmp 0x19b40
movq (%rbx), %rax
movq 0x8(%rax), %rax
movq %rax, (%rbx)
cmpq %r14, 0x8(%rbx)
jne 0x19b4a
movq %rbp, 0x8(%rbx)
movq %r14, %rdi
callq 0x34ff7
pushq $0x1
popq %r15
movl %r15d, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: link_list_search
void* link_list_search(Linklistptr l, void* item, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 21.01.2009*/
 Listitemptr tmp = l->head;
 while (tmp && compare(item, tmp->item) != 0)
   tmp = tmp->next;
 if (tmp)
   return tmp->item;
 else
   return NULL;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %r12
movq %rdi, %r15
xorl %ebx, %ebx
movq (%r15), %r15
testq %r15, %r15
je 0x19b99
movq (%r15), %rsi
movq %r12, %rdi
callq *%r14
testl %eax, %eax
je 0x19b96
addq $0x8, %r15
jmp 0x19b7b
movq (%r15), %rbx
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: link_list_get_i
void* link_list_get_i(Linklistptr l, int i)
{
 int count = 0;
 Listitemptr tmp = l->head;
 while (tmp != NULL && count < i)
  {
   tmp = tmp->next;
   count++;
  }
 return tmp->item;
}

// Assembly:
xorl %eax, %eax
movq (%rdi), %rdi
testq %rdi, %rdi
je 0x19bd1
cmpl %esi, %eax
jge 0x19bd1
addq $0x8, %rdi
incl %eax
jmp 0x19bbd
movq (%rdi), %rax
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: free_link_list
void free_link_list(Linklistptr l, void (*free_node_contents) (void* a))
{
 /*!Last Changed 21.01.2009*/
 Listitemptr tmp = l->head, next = NULL;
 while (tmp != NULL)
  {
   next = tmp->next;
   free_node_contents(tmp->item);
   safe_free(tmp);
   tmp = next;
  }
 safe_free(l);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movq (%rdi), %r15
testq %r15, %r15
je 0x19c02
movq (%r15), %rdi
movq 0x8(%r15), %r12
callq *%r14
movq %r15, %rdi
callq 0x34ff7
movq %r12, %r15
jmp 0x19be6
movq %rbx, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x34ff7
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: queue
Queueptr queue()
{
 /*!Last Changed 21.01.2009*/
 Queueptr q;
 q = safemalloc(sizeof(Queue), "queue", 2);
 q->first = 0;
 q->last = QUEUESIZE - 1;
 q->count = 0;
 return q; 
}

// Assembly:
pushq %rax
leaq 0x7dc36(%rip), %rsi     # 0x97853
pushq $0x2
popq %rdx
movl $0x1f58, %edi           # imm = 0x1F58
callq 0x34f59
movabsq $0x3e700000000, %rcx    # imm = 0x3E700000000
movq %rcx, 0x1f48(%rax)
andl $0x0, 0x1f50(%rax)
popq %rcx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: dictionary_insert
void dictionary_insert(Dictionaryptr d, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 21.01.2009*/
 int i, j;
 if (d->count == DICTIONARYSIZE)
  {
   printf("Dictionary is full\n");
   return;
  }
 if (d->count == 0)
   d->elements[0] = x;
 else
   if (compare(x, d->elements[d->count - 1]) >= 0)
     d->elements[d->count] = x;
   else
    {
     i = 0;
     while (compare(x, d->elements[i]) < 0)
       i++;
     for (j = d->count - 1; j >= i; j--)
       d->elements[j + 1] = d->elements[j];
     d->elements[i] = x;
    }
 d->count++;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movslq 0x1f40(%rdi), %rax
testq %rax, %rax
je 0x19ca0
cmpl $0x3e8, %eax            # imm = 0x3E8
jne 0x19ca5
leaq 0x7dbcc(%rip), %rdi     # 0x97859
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x4090
movq %rbx, %r12
jmp 0x19cc1
movq %rdx, %r15
movq -0x8(%rbx,%rax,8), %rsi
movq %r14, %rdi
callq *%rdx
testl %eax, %eax
js 0x19cdc
movslq 0x1f40(%rbx), %rax
leaq (%rbx,%rax,8), %r12
movq %r14, (%r12)
incl %eax
movl %eax, 0x1f40(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq -0x8(%rbx), %r12
movabsq $-0x100000000, %r13     # imm = 0xFFFFFFFF00000000
movabsq $0x100000000, %rbp      # imm = 0x100000000
addq %rbp, %r13
movq 0x8(%r12), %rsi
addq $0x8, %r12
movq %r14, %rdi
callq *%r15
testl %eax, %eax
js 0x19cf4
movl 0x1f40(%rbx), %eax
movslq %eax, %rcx
sarq $0x20, %r13
cmpq %r13, %rcx
jle 0x19cc1
movq -0x8(%rbx,%rcx,8), %rdx
movq %rdx, (%rbx,%rcx,8)
decq %rcx
jmp 0x19d17
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: dictionary_delete
void dictionary_delete(Dictionaryptr d, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 21.01.2009*/
 int i, j;
 for (i = 0; i < d->count; i++)
   if (compare(x, d->elements[i]) == 0)
    {
     for (j = i; j < d->count - 1; j++)
       d->elements[j] = d->elements[j + 1];
     break;
    }
 d->count--;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
xorl %r12d, %r12d
movslq 0x1f40(%rbx), %rax
cmpq %rax, %r12
jge 0x19d5d
movq (%rbx,%r12,8), %rsi
movq %r15, %rdi
callq *%r14
testl %eax, %eax
je 0x19d71
incq %r12
jmp 0x19d3e
decl %eax
movl %eax, 0x1f40(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movl 0x1f40(%rbx), %eax
decl %eax
cmpl %eax, %r12d
movl %eax, %ecx
cmovgl %r12d, %ecx
cmpq %r12, %rcx
je 0x19d5f
movq 0x8(%rbx,%r12,8), %rdx
movq %rdx, (%rbx,%r12,8)
incq %r12
jmp 0x19d82
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: hash_table
Hashtableptr hash_table()
{
 /*!Last Changed 21.01.2009*/
 int i;
 Hashtableptr h;
 h = safemalloc(sizeof(Hashtable), "hash_table", 2);
 for (i = 0; i < HASHTABLESIZE; i++)
   h->elements[i] = link_list();
 return h;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
leaq 0x7da02(%rip), %rsi     # 0x97800
pushq $0x2
popq %rdx
movl $0x1f88, %edi           # imm = 0x1F88
callq 0x34f59
movq %rax, %rbx
xorl %r14d, %r14d
cmpq $0x3f1, %r14            # imm = 0x3F1
je 0x19e28
callq 0x19aac
movq %rax, (%rbx,%r14,8)
incq %r14
jmp 0x19e11
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: free_hash_table
void free_hash_table(Hashtableptr h, void (*free_node_contents) (void* a))
{
 /*!Last Changed 21.01.2009*/
 int i;
 for (i = 0; i < HASHTABLESIZE; i++)
   free_link_list(h->elements[i], free_node_contents);
 safe_free(h);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %r14
movq %rdi, %rbx
xorl %r15d, %r15d
cmpq $0x3f1, %r15            # imm = 0x3F1
je 0x19ee0
movq (%rbx,%r15,8), %rdi
movq %r14, %rsi
callq 0x19bd5
incq %r15
jmp 0x19ec6
movq %rbx, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x34ff7
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: tree_node
Treenodeptr tree_node(void* item)
{
 /*!Last Changed 22.01.2009*/
 Treenodeptr t;
 t = safemalloc(sizeof(Treenode), "tree_node", 2);
 t->item = item;
 t->left = NULL;
 t->right = NULL;
 return t;
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
leaq 0x7d913(%rip), %rsi     # 0x9780b
pushq $0x18
popq %rdi
pushq $0x2
popq %rdx
callq 0x34f59
movq %rbx, (%rax)
xorps %xmm0, %xmm0
movups %xmm0, 0x8(%rax)
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: binary_tree_node_search
void* binary_tree_node_search(Treenodeptr t, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 if (t == NULL)
   return NULL;
 else
   if (compare(x, t->item) < 0)
     return binary_tree_node_search(t->left, x, compare);
   else
     if (compare(x, t->item) > 0)
       return binary_tree_node_search(t->right, x, compare);
     else
       return t->item;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %r12
movq %rdi, %r15
xorl %ebx, %ebx
pushq $0x8
popq %r13
pushq $0x10
popq %rbp
testq %r15, %r15
je 0x19f7b
movq (%r15), %rsi
movq %r12, %rdi
callq *%r14
movq %r13, %rcx
testl %eax, %eax
js 0x19f72
movq (%r15), %rsi
movq %r12, %rdi
callq *%r14
movq %rbp, %rcx
testl %eax, %eax
jle 0x19f78
movq (%r15,%rcx), %r15
jmp 0x19f4d
movq (%r15), %rbx
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: find_max
Treenodeptr find_max(Treenodeptr t)
{
 /*!Last Changed 22.01.2009*/
 if (t != NULL)
   while (t->right != NULL)
     t = t->right;
 return t;
}

// Assembly:
testq %rdi, %rdi
je 0x19fb1
movq %rdi, %rax
movq 0x10(%rdi), %rdi
testq %rdi, %rdi
jne 0x19fa4
retq
xorl %eax, %eax
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: binary_tree_node_insert
void binary_tree_node_insert(Treenodeptr* t, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 if (*t == NULL)
   *t = tree_node(x);
 else
   if (compare(x, (*t)->item) < 0)
     binary_tree_node_insert(&((*t)->left), x, compare);
   else
     if (compare(x, (*t)->item) > 0)
       binary_tree_node_insert(&((*t)->right), x, compare);
     else
       ;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
movq (%r14), %rax
testq %rax, %rax
je 0x19ffe
movq (%rax), %rsi
movq %rbx, %rdi
callq *%r15
movq (%r14), %rcx
testl %eax, %eax
js 0x19ff5
movq (%rcx), %rsi
movq %rbx, %rdi
callq *%r15
testl %eax, %eax
jle 0x1a009
movq (%r14), %r14
addq $0x10, %r14
jmp 0x19fc7
addq $0x8, %rcx
movq %rcx, %r14
jmp 0x19fc7
movq %rbx, %rdi
callq 0x19eed
movq %rax, (%r14)
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: binary_tree_node_remove
void binary_tree_node_remove(Treenodeptr* t, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 Treenodeptr oldnode;
 if (*t == NULL)
   return;
 if (compare(x, (*t)->item) < 0)
   binary_tree_node_remove(&((*t)->left), x, compare);
 else
   if (compare(x, (*t)->item) > 0)
     binary_tree_node_remove(&((*t)->right), x, compare);
   else
     if ((*t)->left != NULL && (*t)->right != NULL)
      {
       (*t)->item = find_min((*t)->right)->item;
       binary_tree_node_remove(&((*t)->right), x, compare);
      }
     else
      {
       oldnode = *t;
       *t = ((*t)->left != NULL) ? (*t)->left : (*t)->right;
       safe_free(oldnode);
      }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq (%r15), %rax
testq %rax, %rax
je 0x1a086
movq (%rax), %rsi
movq %r14, %rdi
callq *%rbx
movq (%r15), %rcx
testl %eax, %eax
js 0x1a054
movq (%rcx), %rsi
movq %r14, %rdi
callq *%rbx
movq (%r15), %r12
testl %eax, %eax
jle 0x1a05d
addq $0x10, %r12
movq %r12, %r15
jmp 0x1a025
addq $0x8, %rcx
movq %rcx, %r15
jmp 0x1a025
movq 0x8(%r12), %rax
movq 0x10(%r12), %rdi
testq %rax, %rax
je 0x1a092
testq %rdi, %rdi
je 0x1a095
callq 0x19f8d
movq (%rax), %rax
movq %rax, (%r12)
movq (%r15), %r15
addq $0x10, %r15
jmp 0x1a025
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rdi, %rax
movq %rax, (%r15)
movq %r12, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x34ff7
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: free_binary_tree_node
void free_binary_tree_node(Treenodeptr t)
{
 /*!Last Changed 22.01.2009*/
 if (t != NULL)
  {
   free_binary_tree_node(t->left);
   free_binary_tree_node(t->right);
   safe_free(t);
  }
}

// Assembly:
testq %rdi, %rdi
je 0x1a0e4
pushq %rbx
movq %rdi, %rbx
movq 0x8(%rdi), %rdi
callq 0x1a0c0
movq 0x10(%rbx), %rdi
callq 0x1a0c0
movq %rbx, %rdi
popq %rbx
jmp 0x34ff7
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: heap_insert
void heap_insert(Heapptr h, void* x, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 int hole;
 if (heap_full(h))
  {
   printf("Heap is full\n");
   return;
  }
 hole = ++(h->count);
 for (; hole > 1 && compare(x, h->elements[hole / 2]) < 0; hole /= 2)
   h->elements[hole] = h->elements[hole / 2];
 h->elements[hole] = x;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movl 0x1f40(%rdi), %ebp
cmpl $0x3e7, %ebp            # imm = 0x3E7
jne 0x1a14f
leaq 0x7d72a(%rip), %rdi     # 0x9786c
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x4090
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
incl %ebp
movl %ebp, 0x1f40(%rdi)
cmpl $0x2, %ebp
jl 0x1a188
movl %ebp, %r12d
shrl %r12d
movq (%r14,%r12,8), %rsi
movq %rbx, %rdi
callq *%r15
testl %eax, %eax
jns 0x1a188
movq (%r14,%r12,8), %rax
movl %ebp, %ecx
movq %rax, (%r14,%rcx,8)
movl %r12d, %ebp
jmp 0x1a160
movslq %ebp, %rax
movq %rbx, (%r14,%rax,8)
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: delete_min
void* delete_min(Heapptr h, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 void* item;
 if (heap_empty(h))
  {
   printf("Heap is empty\n");
   return NULL;
  }
 item = h->elements[1];
 h->elements[1] = h->elements[(h->count)--];
 percolate_down(h, 1, compare);
 return item;
}

// Assembly:
pushq %rbx
movslq 0x1f40(%rdi), %rax
testq %rax, %rax
je 0x1a1c7
movq %rsi, %rdx
movq 0x8(%rdi), %rbx
leal -0x1(%rax), %ecx
movl %ecx, 0x1f40(%rdi)
movq (%rdi,%rax,8), %rax
movq %rax, 0x8(%rdi)
pushq $0x1
popq %rsi
callq 0x1a1da
jmp 0x1a1d5
leaq 0x7d6ab(%rip), %rdi     # 0x97879
callq 0x4090
xorl %ebx, %ebx
movq %rbx, %rax
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/datastructure.c
// Function: percolate_down
void percolate_down(Heapptr h, int hole, int (*compare)(const void *a, const void *b))
{
 /*!Last Changed 22.01.2009*/
 int child;
 void* tmp = h->elements[hole];
 for (; hole * 2 <= h->count; hole = child)
  {
   child = hole * 2;
   if (child != h->count && compare(h->elements[child + 1], h->elements[child]) < 0)
     child++;
   if (compare(h->elements[child], tmp) < 0)
     h->elements[hole] = h->elements[child];
   else
     break;
  }
 h->elements[hole] = tmp;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %r14
movslq %esi, %rax
movq (%rdi,%rax,8), %r15
movl %ebp, %eax
movslq %ebp, %r12
leal (%rax,%rax), %ebp
cmpl 0x1f40(%r14), %ebp
jg 0x1a242
je 0x1a228
movl %ebp, %r13d
orl $0x1, %r13d
movslq %r13d, %rax
movq (%r14,%rax,8), %rdi
movslq %ebp, %rax
movq (%r14,%rax,8), %rsi
callq *%rbx
testl %eax, %eax
js 0x1a225
movl %ebp, %r13d
movl %r13d, %ebp
movslq %ebp, %r13
movq (%r14,%r13,8), %rdi
movq %r15, %rsi
callq *%rbx
testl %eax, %eax
jns 0x1a242
movq (%r14,%r13,8), %rax
movq %rax, (%r14,%r12,8)
jmp 0x1a1f4
movq %r15, (%r14,%r12,8)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nopl (%rax)
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/decisionforest.c
// Function: create_randomforestchildren
int create_randomforestchildren(Decisionnodeptr node, Randomforest_parameterptr p)
{
 int count, i, t, fno;
 int* array;
 double bestgain = +INT_MAX;
 node->conditiontype = UNIVARIATE_CONDITION;
 if (!(setup_node_properties(node)))
  {
   make_leaf_node(node);
   return 1;
  }
 i = 0;
 t = 0;
 array = random_array(current_dataset->featurecount);
 while (i < p->featuresize)
  {
   fno = array[t];
   if (current_dataset->features[fno].type != CLASSDEF)
    {
     if (find_best_split_for_feature_i(node->instances, fno, &(node->split), &bestgain))
       node->featureno = fno;
     i++;
    }
   t++;
  }
 safe_free(array);
 if (bestgain == ISELL)
   node->featureno = -1;
 if (!(make_children(node)))
   return 1;
 switch (current_dataset->features[node->featureno].type)
  {
   case INTEGER:
   case REAL   :create_randomforestchildren(node->left, p);
                create_randomforestchildren(node->right, p);
                break;
   case STRING :count = current_dataset->features[node->featureno].valuecount;
                for (i = 0; i < count; i++)
                  create_randomforestchildren(&(node->string[i]), p);
                break;
  }
 return 1;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movabsq $0x41dfffffffc00000, %rax # imm = 0x41DFFFFFFFC00000
movq %rax, 0x8(%rsp)
andl $0x0, 0x98(%rdi)
callq 0x1ab8f
testl %eax, %eax
je 0x1a658
leaq 0xb32ed(%rip), %rax     # 0xcd870
movq (%rax), %rax
movl 0x1bc(%rax), %edi
callq 0x35cf7
movq %rax, %r15
leaq 0x28(%r14), %r12
xorl %r13d, %r13d
movq %rax, 0x10(%rsp)
cmpl 0x4(%rbx), %r13d
jge 0x1a5e8
movslq (%r15), %rbp
leaq 0xb32c0(%rip), %rax     # 0xcd870
movq (%rax), %rax
imulq $0x340, %rbp, %rcx      # imm = 0x340
cmpl $0x3, 0x30f08(%rax,%rcx)
je 0x1a5e2
movq 0x20(%r14), %rdi
movl %ebp, %esi
movq %r12, %rdx
leaq 0x8(%rsp), %rcx
callq 0x913a7
testl %eax, %eax
je 0x1a5df
movl %ebp, 0x30(%r14)
incl %r13d
addq $0x4, %r15
jmp 0x1a5a0
movq 0x10(%rsp), %rdi
callq 0x34ff7
movsd 0x8(%rsp), %xmm0
ucomisd 0x7b6f8(%rip), %xmm0    # 0x95cf8
jne 0x1a609
jp 0x1a609
orl $-0x1, 0x30(%r14)
movq %r14, %rdi
callq 0x91657
testl %eax, %eax
je 0x1a660
leaq 0xb3254(%rip), %rax     # 0xcd870
movq (%rax), %rax
movslq 0x30(%r14), %rcx
imulq $0x340, %rcx, %rcx      # imm = 0x340
movl 0x30f08(%rax,%rcx), %edx
cmpl $0x2, %edx
je 0x1a63f
cmpl $0x1, %edx
je 0x1a672
testl %edx, %edx
jne 0x1a660
movq (%r14), %rdi
movq %rbx, %rsi
callq 0x1a545
movq 0x8(%r14), %rdi
movq %rbx, %rsi
callq 0x1a545
jmp 0x1a660
movq %r14, %rdi
callq 0x1a6ac
pushq $0x1
popq %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
addq %rcx, %rax
addq $0x30f08, %rax          # imm = 0x30F08
movl 0x18(%rax), %eax
xorl %r15d, %r15d
testl %eax, %eax
cmovlel %r15d, %eax
imulq $0x160, %rax, %r12      # imm = 0x160
cmpq %r15, %r12
je 0x1a660
movq 0x10(%r14), %rdi
addq %r15, %rdi
movq %rbx, %rsi
callq 0x1a545
addq $0x160, %r15            # imm = 0x160
jmp 0x1a68e
nop
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/decisiontree.c
// Function: decisiontree_falsepositive_count
int decisiontree_falsepositive_count(Decisionnodeptr node)
{
 /*!Last Changed 20.04.2008*/
 /*!Last Changed 30.09.2007*/
 int result = 0, i, fno;
 if (node->featureno == LEAF_NODE)
   return node->falsepositives;
 else
  {
   fno = node->featureno;
   if (fno >= 0 && (node->conditiontype != HYBRID_CONDITION) && current_dataset->features[fno].type == STRING)
     for (i = 0; i < current_dataset->features[fno].valuecount; i++)
       result += decisiontree_falsepositive_count(&(node->string[i]));
   else
    {
     result += decisiontree_falsepositive_count(node->left);
     result += decisiontree_falsepositive_count(node->right);
    }
   return result;
  }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %rbx
leaq 0xb31a2(%rip), %rax     # 0xcd870
movl $0x30f08, %r15d         # imm = 0x30F08
addq (%rax), %r15
xorl %r14d, %r14d
movl $0xffffffff, %r12d      # imm = 0xFFFFFFFF
movl 0x30(%rbx), %eax
cmpq %r12, %rax
je 0x1a714
testl %eax, %eax
js 0x1a703
cmpl $0x2, 0x98(%rbx)
je 0x1a703
imulq $0x340, %rax, %rax      # imm = 0x340
cmpl $0x1, (%r15,%rax)
je 0x1a728
movq (%rbx), %rdi
callq 0x1a6bc
movq 0x8(%rbx), %rbx
addl %eax, %r14d
jmp 0x1a6e0
movl 0x88(%rbx), %ebp
addl %r14d, %ebp
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movl 0x18(%r15,%rax), %eax
xorl %r15d, %r15d
testl %eax, %eax
cmovlel %r15d, %eax
imulq $0x160, %rax, %r12      # imm = 0x160
xorl %ebp, %ebp
cmpq %r15, %r12
je 0x1a71a
movq 0x10(%rbx), %rdi
addq %r15, %rdi
callq 0x1a6bc
addl %eax, %ebp
addq $0x160, %r15            # imm = 0x160
jmp 0x1a73f
// File: /workspace/github_c_makefile_star2_O2/olcaytaner[P]Isell/decisiontree.c
// Function: decisiontree_complexity_count
int decisiontree_complexity_count(Decisionnodeptr node)
{
 /*!Last Changed 24.11.2004*/
 if (node->featureno == LEAF_NODE)
   if (node->leaftype == LINEARLEAF)
     return current_dataset->multifeaturecount - 1;
   else
     return 0;
 else
   if (node->featureno >= 0)
     return 2 + decisiontree_complexity_count(node->left) + decisiontree_complexity_count(node->right);
   else
     if (node->featureno == LINEAR)
       return node->lineard + 1 + decisiontree_complexity_count(node->left) + decisiontree_complexity_count(node->right);
     else
       if (node->featureno == QUADRATIC)
         return node->quadraticd + 1 + decisiontree_complexity_count(node->left) + decisiontree_complexity_count(node->right);
       else
         return current_dataset->multifeaturecount + decisiontree_complexity_count(node->left) + decisiontree_complexity_count(node->right);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %r14
xorl %r12d, %r12d
xorl %ebx, %ebx
movl 0x30(%r14), %eax
cmpl $-0x1, %eax
je 0x1a7ad
testl %eax, %eax
js 0x1a78b
movq (%r14), %rdi
callq 0x1a75b
movq 0x8(%r14), %r14
addl %eax, %ebx
addl $0x2, %ebx
jmp 0x1a76b
cmpl $-0x2, %eax
jne 0x1a7d8
movq (%r14), %rdi
addl 0x90(%r14), %ebx
callq 0x1a75b
movq 0x8(%r14), %r14
addl %ebx, %eax
addl %eax, %r12d
incl %r12d
jmp 0x1a769
xorl %eax, %eax
cmpl $0x1, 0x60(%r14)
jne 0x1a7c8
leaq 0xb30b3(%rip), %rax     # 0xcd870
movq (%rax), %rax
movl 0x1c0(%rax), %eax
decl %eax
addl %r12d, %ebx
addl %eax, %ebx
movl %ebx, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
cmpl $-0x3, %eax
jne 0x1a806
movq (%r14), %rdi
addl 0x94(%r14), %ebx
callq 0x1a75b
movl %eax, %r15d
movq 0x8(%r14), %rdi
callq 0x1a75b
addl %ebx, %r15d
addl %eax, %r15d
leal (%r12,%r15), %ebx
incl %ebx
jmp 0x1a7cd
leaq 0xb3063(%rip), %rax     # 0xcd870
movq (%rax), %rax
movq (%r14), %rdi
addl 0x1c0(%rax), %ebx
callq 0x1a75b
movl %eax, %ebp
movq 0x8(%r14), %rdi
callq 0x1a75b
addl %ebp, %eax
addl %r12d, %eax
addl %ebx, %eax
movl %eax, %ebx
jmp 0x1a7cd