LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3SegmentationCluster::RemoveChild(gaps::R3SegmentationCluster*)
void R3SegmentationCluster::
RemoveChild(R3SegmentationCluster *child)
{
  // Update area
  area -= child->area;

  // Update color
  int n = points.NEntries() - child->points.NEntries();
  color *= points.NEntries();
  color -= child->points.NEntries() * child->color;
  color = (n > 0) ? color / n : RNblack_rgb;

  // Update timestamp
  timestamp *= points.NEntries();
  timestamp -= child->points.NEntries() * child->timestamp;
  timestamp = (n > 0) ? timestamp / n : 0;

  // Remove child
  this->children.Remove(child);
  child->parent = NULL;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movsd 0xe8(%rdi), %xmm0
subsd 0xe8(%rsi), %xmm0
movsd %xmm0, 0xe8(%rdi)
movl 0x14(%rdi), %ebp
cvtsi2sd %ebp, %xmm0
movl $0xf0, %r12d
leaq (%rdi,%r12), %r15
movl 0x14(%rsi), %eax
movl %eax, 0x8(%rsp)
movq %r15, %rdi
callq 0xb1e8c
cvtsi2sdl 0x14(%rbx), %xmm0
addq %rbx, %r12
leaq 0x10(%rsp), %r13
movq %r13, %rdi
movq %r12, %rsi
callq 0x26c7b
movq %r15, %rdi
movq %r13, %rsi
callq 0xb1e30
subl 0x8(%rsp), %ebp
jle 0x29170
cvtsi2sd %ebp, %xmm0
leaq 0x10(%rsp), %rdi
movq %r15, %rsi
movsd %xmm0, 0x8(%rsp)
callq 0x26c4f
jmp 0x2918b
leaq 0x5357f9(%rip), %rsi    # 0x55e970
leaq 0x10(%rsp), %rdi
callq 0xb1d34
cvtsi2sd %ebp, %xmm0
movsd %xmm0, 0x8(%rsp)
leaq 0x10(%rsp), %rsi
movq %r15, %rdi
callq 0xb1de2
cvtsi2sdl 0x14(%r14), %xmm0
mulsd 0x108(%r14), %xmm0
movsd %xmm0, 0x108(%r14)
testl %ebp, %ebp
jg 0x291ba
xorpd %xmm0, %xmm0
jmp 0x291d1
cvtsi2sdl 0x14(%rbx), %xmm1
mulsd 0x108(%rbx), %xmm1
subsd %xmm1, %xmm0
divsd 0x8(%rsp), %xmm0
movsd %xmm0, 0x108(%r14)
addq $0x20, %r14
movq %r14, %rdi
movq %rbx, %rsi
callq 0x2c5ea
andq $0x0, 0x18(%rbx)
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/../../pkgs/RNBasics/RNRgb.h
// Function: gaps::R3SegmentationCluster::UpdateColor()
inline void RNRgb::
Reset (RNScalar red, RNScalar green, RNScalar blue)
{
    // Set all components
    c[0] = red;
    c[1] = green;
    c[2] = blue;
}

// Assembly:
andq $0x0, 0x100(%rdi)
xorps %xmm0, %xmm0
movups %xmm0, 0xf0(%rdi)
movl 0x14(%rdi), %eax
testl %eax, %eax
je 0x29574
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
leaq 0xf0(%rdi), %r14
xorl %r15d, %r15d
movslq %eax, %rcx
cmpq %rcx, %r15
jge 0x29563
movq 0x8(%rbx), %rax
movq (%rax,%r15,8), %rsi
addq $0x78, %rsi
movq %r14, %rdi
callq 0xb1e02
incq %r15
movl 0x14(%rbx), %eax
jmp 0x2953f
cvtsi2sd %eax, %xmm0
movq %r14, %rdi
callq 0xb1eae
popq %rbx
popq %r14
popq %r15
pushq $0x1
popq %rax
retq
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3SegmentationCluster::UpdateTimestamp()
int R3SegmentationCluster::
UpdateTimestamp(void)
{
  // Update timestamp
  timestamp = 0;
  if (points.NEntries() == 0) return 1;
  for (int i = 0; i < points.NEntries(); i++)
    timestamp += points[i]->timestamp;
  timestamp /= points.NEntries();
  return 1;
}

// Assembly:
andq $0x0, 0x108(%rdi)
movl 0x14(%rdi), %eax
testl %eax, %eax
je 0x295c7
movq 0x8(%rdi), %rcx
xorl %edx, %edx
testl %eax, %eax
movl $0x0, %esi
cmovgl %eax, %esi
xorpd %xmm0, %xmm0
cmpq %rdx, %rsi
je 0x295b7
movq (%rcx,%rdx,8), %r8
addsd 0x68(%r8), %xmm0
movsd %xmm0, 0x108(%rdi)
incq %rdx
jmp 0x2959b
cvtsi2sd %eax, %xmm1
divsd %xmm1, %xmm0
movsd %xmm0, 0x108(%rdi)
pushq $0x1
popq %rax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3SegmentationCluster::UpdateArea()
int R3SegmentationCluster::
UpdateArea(void)
{
  // Update area
  area = 0;
  for (int i = 0; i < points.NEntries(); i++)
    area += points[i]->area;
  return 1;
}

// Assembly:
andq $0x0, 0xe8(%rdi)
movl 0x14(%rdi), %eax
movq 0x8(%rdi), %rcx
xorl %edx, %edx
testl %eax, %eax
cmovlel %edx, %eax
xorpd %xmm0, %xmm0
cmpq %rdx, %rax
je 0x29601
movq (%rcx,%rdx,8), %rsi
addsd 0x70(%rsi), %xmm0
movsd %xmm0, 0xe8(%rdi)
incq %rdx
jmp 0x295e6
pushq $0x1
popq %rax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3SegmentationPair::R3SegmentationPair(gaps::R3SegmentationCluster*, gaps::R3SegmentationCluster*, double)
R3SegmentationPair::
R3SegmentationPair(R3SegmentationCluster *cluster1, R3SegmentationCluster *cluster2, RNScalar affinity)
  : affinity(affinity),
    heapentry(NULL)
{
  // Insert pair into clusters
  if (cluster1 && cluster2) {
    // Remember clusters
    clusters[0] = cluster1;
    clusters[1] = cluster2;

    // Remember position of pair in clusters
    cluster_index[0] = cluster1->pairs.NEntries();
    cluster_index[1] = cluster2->pairs.NEntries();

    // Update clusters
    cluster1->pairs.Insert(this);
    cluster2->pairs.Insert(this);
  }
  else {
    // Initialize clusters
    clusters[0] = NULL;
    clusters[1] = NULL;

    // Initialize cluster index
    cluster_index[0] = -1;
    cluster_index[1] = -1;
  }
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movsd %xmm0, 0x18(%rdi)
andq $0x0, 0x20(%rdi)
testq %rsi, %rsi
sete %al
testq %rdx, %rdx
sete %cl
orb %al, %cl
jne 0x29daa
movq %rdx, %r14
movq %rsi, (%rbx)
movq %rdx, 0x8(%rbx)
movl 0x3c(%rsi), %eax
addq $0x30, %rsi
movl %eax, 0x10(%rbx)
movl 0x3c(%rdx), %eax
addq $0x30, %r14
movl %eax, 0x14(%rbx)
movq %rsi, %rdi
movq %rbx, %rsi
callq 0x1a04c
movq %r14, %rdi
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x1a04c
xorps %xmm0, %xmm0
movups %xmm0, (%rbx)
orq $-0x1, 0x10(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3SegmentationPair::~R3SegmentationPair()
R3SegmentationPair::
~R3SegmentationPair(void)
{
  // Remove this pair from first cluster
  if (clusters[0]) {
    assert(cluster_index[0] >= 0);
    RNArrayEntry *entry = clusters[0]->pairs.KthEntry(cluster_index[0]);
    R3SegmentationPair *tail = clusters[0]->pairs.Tail();
    if (tail->clusters[0] == clusters[0]) tail->cluster_index[0] = cluster_index[0];
    else if (tail->clusters[1] == clusters[0]) tail->cluster_index[1] = cluster_index[0];
    clusters[0]->pairs.EntryContents(entry) = tail;
    clusters[0]->pairs.RemoveTail();
  }

  // Remove this pair from second cluster
  if (clusters[1]) {
    assert(cluster_index[1] >= 0);
    RNArrayEntry *entry = clusters[1]->pairs.KthEntry(cluster_index[1]);
    R3SegmentationPair *tail = clusters[1]->pairs.Tail();
    if (tail->clusters[0] == clusters[1]) tail->cluster_index[0] = cluster_index[1];
    else if (tail->clusters[1] == clusters[1]) tail->cluster_index[1] = cluster_index[1];
    clusters[1]->pairs.EntryContents(entry) = tail;
    clusters[1]->pairs.RemoveTail();
  }
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movq (%rdi), %rsi
testq %rsi, %rsi
je 0x29e00
movl 0x10(%rbx), %edx
movq 0x30(%rsi), %rax
movslq %edx, %rcx
movslq 0x3c(%rsi), %rdi
movq -0x8(%rax,%rdi,8), %rdi
cmpq %rsi, (%rdi)
je 0x29ded
cmpq %rsi, 0x8(%rdi)
jne 0x29df0
movl %edx, 0x14(%rdi)
jmp 0x29df0
movl %edx, 0x10(%rdi)
movq %rdi, (%rax,%rcx,8)
movq (%rbx), %rdi
addq $0x30, %rdi
callq 0x1df5e
movq 0x8(%rbx), %rsi
testq %rsi, %rsi
je 0x29e40
movl 0x14(%rbx), %edx
movq 0x30(%rsi), %rax
movslq %edx, %rcx
movslq 0x3c(%rsi), %rdi
movq -0x8(%rax,%rdi,8), %rdi
cmpq %rsi, (%rdi)
je 0x29e2c
cmpq %rsi, 0x8(%rdi)
jne 0x29e2f
movl %edx, 0x14(%rdi)
jmp 0x29e2f
movl %edx, 0x10(%rdi)
movq %rdi, (%rax,%rcx,8)
movq 0x8(%rbx), %rdi
addq $0x30, %rdi
callq 0x1df5e
popq %rbx
retq
movq %rax, %rdi
callq 0x1dee1
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::~R3Segmentation()
R3Segmentation::
~R3Segmentation(void)
{
  // Delete clusters
  for (int i = 0; i < clusters.NEntries(); i++) delete clusters[i];
  
  // Delete kdtree
  if (kdtree) delete kdtree;

  // Delete points
  if (point_buffer) delete [] point_buffer;
  else { for (int i = 0; i < points.NEntries(); i++) delete points[i]; }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
leaq 0x18(%rdi), %r14
xorl %r12d, %r12d
movslq 0x24(%rbx), %rax
cmpq %rax, %r12
jge 0x2a038
movq (%r14), %rax
movq (%rax,%r12,8), %r15
testq %r15, %r15
je 0x2a026
movq %r15, %rdi
callq 0x28a24
movl $0x140, %esi            # imm = 0x140
movq %r15, %rdi
callq 0x15630
incq %r12
jmp 0x2a009
movq 0x10(%rbx), %r15
testq %r15, %r15
je 0x2a054
movq %r15, %rdi
callq 0x2c350
pushq $0x60
popq %rsi
movq %r15, %rdi
callq 0x15630
movq 0x28(%rbx), %r12
testq %r12, %r12
je 0x2a0ba
leaq -0x8(%r12), %r15
movq -0x8(%r12), %r13
testq %r13, %r13
je 0x2a089
addq $-0x30, %r12
imulq $0xe0, %r13, %rbp
leaq (%r12,%rbp), %rdi
callq 0xb1f48
addq $-0xe0, %rbp
jne 0x2a077
imulq $0xe0, %r13, %rsi
orq $0x8, %rsi
movq %r15, %rdi
callq 0x15c50
movq %r14, %rdi
callq 0xb1f48
movq %rbx, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0xb1f48
xorl %r12d, %r12d
movslq 0xc(%rbx), %rax
cmpq %rax, %r12
jge 0x2a09c
movq (%rbx), %rax
movq (%rax,%r12,8), %r15
testq %r15, %r15
je 0x2a0de
leaq 0xb0(%r15), %rdi
callq 0xb1f48
movl $0xe0, %esi
movq %r15, %rdi
callq 0x15630
incq %r12
jmp 0x2a0bd
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::Affinity() const
RNScalar R3Segmentation::
Affinity(void) const
{
  RNScalar sum = 0;
  for (int i = 0; i < clusters.NEntries(); i++) {
    sum += clusters[i]->total_affinity;
  }
  return sum;
}

// Assembly:
movl 0x24(%rdi), %eax
movq 0x18(%rdi), %rcx
xorl %edx, %edx
testl %eax, %eax
cmovlel %edx, %eax
xorpd %xmm0, %xmm0
cmpq %rdx, %rax
je 0x2a118
movq (%rcx,%rdx,8), %rsi
addsd 0x128(%rsi), %xmm0
incq %rdx
jmp 0x2a102
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::NUnclusteredPoints() const
int R3Segmentation::
NUnclusteredPoints(void) const
{
  // Count unclustered points
  int count = 0;
  for (int i = 0; i < points.NEntries(); i++) {
    R3SegmentationPoint *point = points.Kth(i);
    if (!point->cluster) count++;
  }

  // Return number of unclustered points
  return count;
}

// Assembly:
movl 0xc(%rdi), %ecx
movq (%rdi), %rdx
xorl %esi, %esi
testl %ecx, %ecx
cmovlel %esi, %ecx
xorl %eax, %eax
cmpq %rsi, %rcx
je 0x2a142
movq (%rdx,%rsi,8), %rdi
cmpq $0x1, 0xc0(%rdi)
adcl $0x0, %eax
incq %rsi
jmp 0x2a129
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::CreateSingletonClusters(int)
int R3Segmentation::
CreateSingletonClusters(int primitive_type)
{
  // Create cluster for every point
  for (int i = 0; i < points.NEntries(); i++) {
    R3SegmentationPoint *point = points.Kth(i);

    // Create primitive
    R3SegmentationPrimitive primitive(primitive_type);
    primitive.Update(point);
    
    // Create cluster
    R3SegmentationCluster *cluster = new R3SegmentationCluster(point, primitive);

    // Insert point
    cluster->InsertPoint(point, 1.0);

    // Insert cluster
    cluster->segmentation = this;
    cluster->segmentation_index = clusters.NEntries();    
    clusters.Insert(cluster);
  }

  // Return success
  return 1;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movl %esi, 0xc(%rsp)
movq %rdi, %r14
leaq 0x18(%rdi), %r15
xorl %ebp, %ebp
leaq 0x10(%rsp), %r12
movslq 0xc(%r14), %rax
cmpq %rax, %rbp
jge 0x2aab6
movq (%r14), %rax
movq (%rax,%rbp,8), %r13
movq %r12, %rdi
movl 0xc(%rsp), %esi
callq 0x272bc
movq %r12, %rdi
movq %r13, %rsi
xorl %edx, %edx
callq 0x2741c
movl $0x140, %edi            # imm = 0x140
callq 0x15620
movq %rax, %rbx
movq %rax, %rdi
movq %r13, %rsi
movq %r12, %rdx
callq 0x27f0a
movq %rbx, %rdi
movq %r13, %rsi
movsd 0xc358d(%rip), %xmm0    # 0xee010
callq 0x288ce
movq %r14, 0x130(%rbx)
movl 0x24(%r14), %eax
movl %eax, 0x138(%rbx)
movq %r15, %rdi
movq %rbx, %rsi
callq 0x1a04c
leaq 0x18(%rsp), %rdi
callq 0x7cbba
incq %rbp
jmp 0x2aa31
pushq $0x1
popq %rax
addq $0xb8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
movl $0x140, %esi            # imm = 0x140
movq %rbx, %rdi
callq 0x15630
jmp 0x2aae2
jmp 0x2aadf
movq %rax, %r14
leaq 0x18(%rsp), %rdi
callq 0x7cbba
movq %r14, %rdi
callq 0x15af0
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::ReassignClusters()
int R3Segmentation::
ReassignClusters(void)
{
  // Iteratively update everything
  for (int iter = 0; iter < max_reassignment_iterations; iter++) {
    // Copy list of clusters
    RNArray<R3SegmentationCluster *> tmp = clusters;
    tmp.Sort(CompareClusters);

    // Will rebuild list of clusters
    clusters.Empty();

    // Update each cluster
    RNBoolean converged = TRUE;
    for (int i = 0; i < tmp.NEntries(); i++) {
      R3SegmentationCluster *cluster = tmp.Kth(i);
      int prev_npoints = cluster->points.NEntries();

      // Update cluster (including reassigning points)
      RNBoolean error = FALSE;
      if (!error && !cluster->UpdatePrimitive()) error = TRUE;
      if (!error && !cluster->UpdatePoints(kdtree)) error = TRUE; 
      if (!error && !cluster->UpdateColor()) error = TRUE; 
      if (!error && !cluster->UpdateTimestamp()) error = TRUE; 

      // Insert cluster
      cluster->segmentation = this;
      cluster->segmentation_index = clusters.NEntries();    
      if (!error) clusters.Insert(cluster);
      else delete cluster;

      // Check for convergence
      if (error || (prev_npoints != cluster->points.NEntries())) {
        converged = FALSE;
      }
    }

    // Check if converged
    if (converged) break;
  }

  // Return success
  return 1;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %rbx
leaq 0x18(%rdi), %r14
xorl %eax, %eax
movq %rsp, %r12
cmpl 0xbc(%rbx), %eax
jge 0x2ad9a
movq %rax, 0x10(%rsp)
movq %r12, %rdi
movq %r14, %rsi
callq 0xb1ee2
movq %r12, %rdi
leaq 0xf3(%rip), %rsi        # 0x2adc1
callq 0xb21de
movq %r14, %rdi
xorl %esi, %esi
callq 0xb20f8
xorl %r12d, %r12d
pushq $0x1
popq %r15
movslq 0xc(%rsp), %rax
cmpq %rax, %r12
jge 0x2ad7f
movq (%rsp), %rax
movq (%rax,%r12,8), %r13
movl 0x14(%r13), %ebp
movq %r13, %rdi
callq 0x294f4
testl %eax, %eax
je 0x2ad4e
movq 0x10(%rbx), %rsi
movq %r13, %rdi
callq 0x291fe
testl %eax, %eax
je 0x2ad4e
movq %r13, %rdi
callq 0x29514
movq %r13, %rdi
callq 0x29578
movq %rbx, 0x130(%r13)
movl 0x24(%rbx), %eax
movl %eax, 0x138(%r13)
movq %r14, %rdi
movq %r13, %rsi
callq 0x1a04c
cmpl 0x14(%r13), %ebp
jne 0x2ad74
jmp 0x2ad77
movq %rbx, 0x130(%r13)
movl 0x24(%rbx), %eax
movl %eax, 0x138(%r13)
movq %r13, %rdi
callq 0x28a24
movl $0x140, %esi            # imm = 0x140
movq %r13, %rdi
callq 0x15630
xorl %r15d, %r15d
incq %r12
jmp 0x2ace4
movq %rsp, %r12
movq %r12, %rdi
callq 0xb1f48
movq 0x10(%rsp), %rax
incl %eax
testl %r15d, %r15d
je 0x2aca8
pushq $0x1
popq %rax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x2adae
movq %rax, %rbx
movq %rsp, %rdi
callq 0xb1f48
movq %rbx, %rdi
callq 0x15af0
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/R3Segmentation.cpp
// Function: gaps::R3Segmentation::RefineBoundaries()
int R3Segmentation::
RefineBoundaries(void)
{
  // Check if should refine boundaries
  if (!refine_boundaries) return 1;

  // Iteratively refine boundaries
  for (int iter = 0; iter < 1000; iter++) {
    RNBoolean done = TRUE;
    for (int i0 = 0; i0 < points.NEntries(); i0++) {
      R3SegmentationPoint *point0 = points.Kth(i0);
      if (point0->neighbors.NEntries() < 3) continue;
      R3SegmentationCluster *cluster0 = point0->cluster;
      if (!cluster0) continue;
      int i1 = RNRandomScalar() * point0->neighbors.NEntries();
      R3SegmentationPoint *point1 = point0->neighbors.Kth(i1);
      R3SegmentationCluster *cluster1 = point1->cluster;
      if (!cluster1) continue;
      if (cluster0 == cluster1) continue;
      int count = 0;
      for (int i2 = 0; i2 < point0->neighbors.NEntries(); i2++) {
        R3SegmentationPoint *point2 = point0->neighbors.Kth(i2);
        R3SegmentationCluster *cluster2 = point2->cluster;
        if (!cluster2) continue;
        if (cluster2 == cluster1) count++;
      }
      if (count > point0->neighbors.NEntries()/2) {
        cluster0->RemovePoint(point0);
        cluster1->InsertPoint(point0, point0->cluster_affinity);
        done = FALSE;
      }
    }
    if (done) break;
  }

  // Return success
  return 1;
}

// Assembly:
cmpl $0x0, 0xd8(%rdi)
je 0x2b7df
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
xorl %r13d, %r13d
cmpl $0x3e8, %r13d           # imm = 0x3E8
je 0x2b7d1
xorl %ebp, %ebp
pushq $0x1
popq %rax
movl %eax, 0x4(%rsp)
movslq 0xc(%rbx), %rax
cmpq %rax, %rbp
jge 0x2b7c3
movq (%rbx), %rax
movq (%rax,%rbp,8), %r14
cmpl $0x3, 0xbc(%r14)
jl 0x2b7bb
movq 0xc0(%r14), %r15
testq %r15, %r15
je 0x2b7bb
callq 0xb39e6
movl 0xbc(%r14), %eax
cvtsi2sd %eax, %xmm1
mulsd %xmm0, %xmm1
cvttsd2si %xmm1, %edx
movq 0xb0(%r14), %rcx
movslq %edx, %rdx
movq (%rcx,%rdx,8), %rdx
movq 0xc0(%rdx), %r12
testq %r12, %r12
je 0x2b7bb
cmpq %r12, %r15
je 0x2b7bb
xorl %edx, %edx
testl %eax, %eax
movl $0x0, %edi
cmovgl %eax, %edi
xorl %esi, %esi
cmpq %rdx, %rdi
je 0x2b78a
movq (%rcx,%rdx,8), %r8
xorl %r9d, %r9d
cmpq %r12, 0xc0(%r8)
sete %r9b
addl %r9d, %esi
incq %rdx
jmp 0x2b76b
cltd
pushq $0x2
popq %rcx
idivl %ecx
cmpl %eax, %esi
jle 0x2b7bb
movq %r15, %rdi
movq %r14, %rsi
callq 0x28406
movsd 0xc8(%r14), %xmm0
movq %r12, %rdi
movq %r14, %rsi
callq 0x288ce
movl $0x0, 0x4(%rsp)
incq %rbp
jmp 0x2b6f4
incl %r13d
cmpl $0x0, 0x4(%rsp)
je 0x2b6de
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
pushq $0x1
popq %rax
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/R3Utils/../../pkgs/R3Shapes/R3Kdtree.cpp
// Function: gaps::R3Kdtree<gaps::R3SegmentationPoint*>::FindAll(gaps::R3Point const&, double, double, gaps::RNArray<gaps::R3SegmentationPoint*>&) const
int R3Kdtree<PtrType>::
FindAll(const R3Point& query_position, RNScalar min_distance, RNScalar max_distance, RNArray<PtrType>& points) const
{
  // Check root
  if (!root) return 0;

  // Use squared distances for efficiency
  if (max_distance < 0) return 0;
  if (min_distance < 0) min_distance = 0;
  RNLength min_distance_squared = min_distance * min_distance;
  RNLength max_distance_squared = max_distance * max_distance;

  // Search nodes recursively
  FindAll(root, bbox, 
    NULL, query_position, 
    min_distance_squared, max_distance_squared, 
    NULL, NULL, 
    points);

  // Return number of points
  return points.NEntries();
}

// Assembly:
pushq %rbx
subq $0x10, %rsp
movq %rdx, %rbx
movapd %xmm0, %xmm2
movq %rsi, %r8
movq 0x50(%rdi), %rsi
testq %rsi, %rsi
sete %cl
xorpd %xmm0, %xmm0
ucomisd %xmm1, %xmm0
seta %dl
xorl %eax, %eax
orb %cl, %dl
jne 0x2c302
maxsd %xmm2, %xmm0
mulsd %xmm0, %xmm0
mulsd %xmm1, %xmm1
movq %rbx, 0x8(%rsp)
andq $0x0, (%rsp)
movq %rdi, %rdx
xorl %ecx, %ecx
xorl %r9d, %r9d
callq 0x2c60c
movl 0xc(%rbx), %eax
addq $0x10, %rsp
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/RipcordSoftware[P]lazyflatset/test/lazyflatset/main.cpp
// Function: test(std::function<void (__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>, __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>)>, __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>, __gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int>>>, bool)
void test(TestFunction func, SourceIterator begin, SourceIterator end, bool eol = false) {
    auto start = std::chrono::steady_clock::now();
    func(begin, end);
    auto duration = std::chrono::steady_clock::now() - start;
    auto durationMS = std::chrono::duration_cast<std::chrono::milliseconds>(duration);
    
    std::cout << durationMS.count();
    
    if (eol) {
        std::cout << std::endl;
    } else {
        std::cout << ", ";
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movl %ecx, %ebx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
callq 0x2170
movq %rax, %r13
movq %r12, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x34a4
callq 0x2170
subq %r13, %rax
movl $0xf4240, %ecx          # imm = 0xF4240
cqto
idivq %rcx
movq 0x6937(%rip), %rdi      # 0x8fd8
movq %rax, %rsi
callq 0x2120
movq 0x6928(%rip), %rdi      # 0x8fd8
testl %ebx, %ebx
je 0x26c2
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x20a0
leaq 0x3a24(%rip), %rsi      # 0x60ed
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x2130
// File: /workspace/github_cpp_makefile_star2_O2/RipcordSoftware[P]lazyflatset/test/lazyflatset/./../../lazyflatset.hpp
// Function: rs::LazyFlatSet<unsigned int, std::less<unsigned int>, std::equal_to<unsigned int>, rs::LazyFlatSetQuickSort<unsigned int, std::less<unsigned int>>, std::allocator<unsigned int>, false>::insert(unsigned int const&, rs::LazyFlatSet<unsigned int, std::less<unsigned int>, std::equal_to<unsigned int>, rs::LazyFlatSetQuickSort<unsigned int, std::less<unsigned int>>, std::allocator<unsigned int>, false>::insert_hint)
void insert(const value_type& k, insert_hint hint = insert_hint::no_hint) {
        if (hint == insert_hint::no_hint) {
            auto iter = lower_bound_equals(coll_, k);
            if (iter != coll_.end()) {
                *iter = k;
            } else {
                iter = lower_bound_equals(nursery_, k);
                if (iter != nursery_.end()) {
                    *iter = k;
                } else {
                    iter = search_unsorted(unsorted_, k);
                    if (iter != unsorted_.end()) {
                        *iter = k;
                    } else {
                        if (unsorted_.size() == maxUnsortedEntries_) {
                            flushUnsorted();
                        }

                        unsorted_.push_back(k);
                    }
                }
            }
        } else {
            if (unsorted_.size() == maxUnsortedEntries_) {
                flushUnsorted();
            }

            unsorted_.push_back(k);
        }
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
testl %edx, %edx
je 0x342a
movq 0x48(%r14), %rax
subq 0x40(%r14), %rax
leaq 0x40(%r14), %r15
sarq $0x2, %rax
movl 0x8(%r14), %ecx
cmpq %rcx, %rax
jne 0x341a
movq %r14, %rdi
callq 0x41d4
movq %r15, %rdi
movq %rbx, %rsi
popq %rbx
popq %r14
popq %r15
jmp 0x32e0
leaq 0x10(%r14), %rsi
movq %r14, %rdi
movq %rbx, %rdx
callq 0x419e
cmpq 0x18(%r14), %rax
jne 0x346c
leaq 0x28(%r14), %rsi
movq %r14, %rdi
movq %rbx, %rdx
callq 0x419e
cmpq 0x30(%r14), %rax
jne 0x346c
leaq 0x40(%r14), %r15
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0x41c8
cmpq 0x48(%r14), %rax
je 0x3476
movl (%rbx), %ecx
movl %ecx, (%rax)
popq %rbx
popq %r14
popq %r15
retq
movq 0x40(%r14), %rcx
subq %rcx, %rax
jmp 0x3405
nop
// File: /workspace/github_cpp_makefile_star2_O2/RipcordSoftware[P]lazyflatset/test/lazyflatset/./../../lazyflatset.hpp
// Function: rs::LazyFlatSet<unsigned int, std::less<unsigned int>, std::equal_to<unsigned int>, rs::LazyFlatSetQuickSort<unsigned int, std::less<unsigned int>>, std::allocator<unsigned int>, false>::merge(std::vector<unsigned int, std::allocator<unsigned int>>&, std::vector<unsigned int, std::allocator<unsigned int>>&) const
void merge(base_collection& source, base_collection& target) const {
        if (source.size() > 0) {
            Less less;
            if (target.size() == 0 || less(target.back(), source.front())) {
                target.insert(target.end(), source.cbegin(), source.cend());
            } else if (less(source.back(), target.front())) {
                target.insert(target.begin(), source.cbegin(), source.cend());
            } else {
                target.insert(target.end(), source.cbegin(), source.cend());
                std::inplace_merge(target.begin(), target.end() - source.size(), target.end(), less);
            }
        }
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq (%rsi), %rdx
movq 0x8(%rsi), %rcx
cmpq %rdx, %rcx
je 0x437a
movq %rsi, %r14
movq (%rbx), %rax
movq 0x8(%rbx), %rsi
cmpq %rax, %rsi
je 0x436b
movl -0x4(%rsi), %edi
cmpl (%rdx), %edi
jae 0x4382
movq %rbx, %rdi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x478e
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movl -0x4(%rcx), %edi
cmpl (%rax), %edi
jae 0x4391
movq %rbx, %rdi
movq %rax, %rsi
jmp 0x436e
movq %rbx, %rdi
callq 0x478e
movq (%rbx), %rdi
movq 0x8(%rbx), %rdx
movq (%r14), %rsi
subq 0x8(%r14), %rsi
addq %rdx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x4954
// File: /workspace/github_cpp_makefile_star2_O2/HQarroum[P]thread-pool/examples/bulk_insertion/main.cpp
// Function: main
int main() {
 thread::pool::pool_t pool(std::thread::hardware_concurrency() + 1);
 
 // Filling our array with `iterations` amount of functions,
 // bound to the number `42`.
 std::fill_n(callables, iterations, std::bind(static_void_function, 42));
 // Scheduling the execution in bulk.
 auto result = pool.schedule_bulk(callables, iterations);
 // Log whether the insertion was successful.
 std::cout << "The insertion has " << (result ? "succeeded" : "failed") << std::endl;
 assert(result == true);
 return (0);
}

// Assembly:
pushq %rbx
subq $0x2b0, %rsp            # imm = 0x2B0
callq 0x21b0
leal 0x1(%rax), %esi
leaq 0x18(%rsp), %rdi
callq 0x254e
leaq -0x43(%rip), %rax       # 0x23dc
leaq 0x8(%rsp), %rdx
movq %rax, (%rdx)
movl $0x2a, 0x8(%rdx)
leaq 0x6d3b(%rip), %rdi      # 0x9170
leaq 0x79b4(%rip), %rsi      # 0x9df0
callq 0x3825
leaq 0x6d28(%rip), %rsi      # 0x9170
leaq 0x18(%rsp), %rdi
pushq $0x64
popq %rdx
callq 0x2610
movl %eax, %ebx
movq 0x6b72(%rip), %rdi      # 0x8fd0
leaq 0x2baf(%rip), %rsi      # 0x5014
callq 0x2160
leaq 0x2bb6(%rip), %rcx      # 0x5027
leaq 0x2bb9(%rip), %rsi      # 0x5031
testb %bl, %bl
cmovneq %rcx, %rsi
movq %rax, %rdi
callq 0x2160
movq %rax, %rdi
callq 0x20b0
testb %bl, %bl
je 0x24a7
leaq 0x18(%rsp), %rdi
callq 0x2624
xorl %eax, %eax
addq $0x2b0, %rsp            # imm = 0x2B0
popq %rbx
retq
leaq 0x2b8a(%rip), %rdi      # 0x5038
leaq 0x2b92(%rip), %rsi      # 0x5047
leaq 0x2b94(%rip), %rcx      # 0x5050
pushq $0x22
popq %rdx
callq 0x2100
jmp 0x24c6
movq %rax, %rbx
leaq 0x18(%rsp), %rdi
callq 0x2624
movq %rbx, %rdi
callq 0x2230
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::JustePrix()
JustePrix::JustePrix():prixMystere(0), prixMin(1), prixMax(100), nbCoups(0)
{
    joueur = new Joueur();
    historique = new Historique();
    meilleurScore = new MeilleurScore();
    srand(time(NULL));
}

// Assembly:
pushq %r14
pushq %rbx
subq $0x28, %rsp
movq %rdi, %rbx
movaps 0x2a77(%rip), %xmm0     # 0x5010
movups %xmm0, (%rdi)
pushq $0x20
popq %rdi
callq 0x21e0
movq %rax, %r14
leaq 0x2d30(%rip), %rsi      # 0x52de
leaq 0x8(%rsp), %rdi
leaq 0x7(%rsp), %rdx
callq 0x2c02
leaq 0x8(%rsp), %rsi
movq %r14, %rdi
callq 0x379c
movq %r14, 0x18(%rbx)
leaq 0x8(%rsp), %rdi
callq 0x20b0
pushq $0x30
popq %rdi
callq 0x21e0
movq %rax, %r14
movq %rax, %rdi
callq 0x37bc
movq %r14, 0x20(%rbx)
pushq $0x38
popq %rdi
callq 0x21e0
movq %rax, %r14
movq %rax, %rdi
callq 0x3db4
movq %r14, 0x28(%rbx)
xorl %edi, %edi
callq 0x21b0
movl %eax, %edi
callq 0x21c0
addq $0x28, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rbx
pushq $0x38
jmp 0x263e
movq %rax, %rbx
pushq $0x30
jmp 0x263e
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x20b0
jmp 0x263c
movq %rax, %rbx
pushq $0x20
popq %rsi
movq %r14, %rdi
callq 0x21f0
movq %rbx, %rdi
callq 0x2300
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::compterNbCoups(int)
void JustePrix::compterNbCoups(int prix)
{
    if(historique->enregistrerAncienCoups(prix))
    {
        if(prix > getPrixMax())
        {
            ihm->AfficherPrixSupBorne(prix, this->getPrixMax());
        }
        else if(prix < getPrixMin())
        {
            ihm->AfficherPrixInfBorne(prix, this->getPrixMin());
        }
        else
        {
            ++nbCoups;
        }       
    }
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movl %esi, %ebx
movq %rdi, %r14
movq 0x20(%rdi), %rdi
callq 0x383c
testb %al, %al
je 0x2730
movl 0x8(%r14), %edx
cmpl %ebx, %edx
jge 0x2712
movq 0x10(%r14), %rdi
movl %ebx, %esi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x311e
movl 0x4(%r14), %edx
cmpl %ebx, %edx
jle 0x272c
movq 0x10(%r14), %rdi
movl %ebx, %esi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x3182
incl 0xc(%r14)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::verifierPrix(int, int)
bool JustePrix::verifierPrix(int prix, int prixMystere)
{
    #ifdef CHEAT
        cout << endl;
        cout << "\033[1;34mCHEAT [prix = " <<  getPrixMystere( ) << "]\033[0m" << endl;
    #endif
    
    this->compterNbCoups(prix);

    if(prix < prixMystere)
    {
        ihm->afficherPrixMystereSuperieur();
        return true;
    }
    else if(prix > prixMystere)
    {
        ihm->afficherPrixMystereInferieur();
        return true;
    }
    else
    {
        ihm->afficherVictoire(nbCoups, joueur->getNom());
        return false;
    }
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
subq $0x20, %rsp
movl %edx, %ebx
movl %esi, %ebp
movq %rdi, %r14
callq 0x26e2
cmpl %ebx, %ebp
jge 0x275b
movq 0x10(%r14), %rdi
callq 0x3034
jmp 0x2769
movq 0x10(%r14), %rbx
jle 0x276d
movq %rbx, %rdi
callq 0x3016
movb $0x1, %al
jmp 0x2797
movl 0xc(%r14), %ebp
movq 0x18(%r14), %rsi
movq %rsp, %r14
movq %r14, %rdi
callq 0x37a8
movq %rbx, %rdi
movl %ebp, %esi
movq %r14, %rdx
callq 0x3052
movq %rsp, %rdi
callq 0x20b0
xorl %eax, %eax
addq $0x20, %rsp
popq %rbx
popq %r14
popq %rbp
retq
movq %rax, %rbx
movq %rsp, %rdi
callq 0x20b0
movq %rbx, %rdi
callq 0x2300
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::ChoisirDifficulte()
void JustePrix::ChoisirDifficulte()
{
    char choix;
    do{
        choix = ihm->demanderDifficulte(joueur->getNom());
        if(choix == 'd' || choix == 'D')
        {
            this->setPrixMax(1000);
            meilleurScore->choisirFichierDifficulte(this->getPrixMax());
            this->creerPrixMystere();
        }
        else if(choix == 'm' || choix == 'M')
        {
            this->setPrixMax(500);
            meilleurScore->choisirFichierDifficulte(this->getPrixMax());
            this->creerPrixMystere();
        }
        else if(choix == 'f' || choix == 'F')
        {
            this->setPrixMax(100);
            meilleurScore->choisirFichierDifficulte(this->getPrixMax());
            this->creerPrixMystere();
        }
        else
        {
            cerr << "Désolé, cette difficulté n'existe pas" <<endl;
        }
    }
    while(choix != 'd' && choix != 'D' && choix != 'm' && choix != 'M' && choix != 'f' && choix != 'F');
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rdi, %rbx
leaq 0x8(%rsp), %r14
movabsq $0x20500000205, %rbp    # imm = 0x20500000205
movq 0x67c7(%rip), %r15      # 0x8ff0
leaq 0x27f0(%rip), %r12      # 0x5020
movq 0x10(%rbx), %r13
movq 0x18(%rbx), %rsi
movq %r14, %rdi
callq 0x37a8
movq %r13, %rdi
movq %r14, %rsi
callq 0x31e6
movl %eax, %r13d
movq %r14, %rdi
callq 0x20b0
movl %r13d, %eax
andb $-0x21, %al
cmpb $0x4d, %al
je 0x288e
movzbl %al, %eax
cmpl $0x46, %eax
je 0x287e
cmpl $0x44, %eax
jne 0x28ad
movl $0x3e8, 0x8(%rbx)       # imm = 0x3E8
movq 0x28(%rbx), %rdi
movl $0x3e8, %esi            # imm = 0x3E8
jmp 0x289e
movl $0x64, 0x8(%rbx)
movq 0x28(%rbx), %rdi
pushq $0x64
popq %rsi
jmp 0x289e
movl $0x1f4, 0x8(%rbx)       # imm = 0x1F4
movq 0x28(%rbx), %rdi
movl $0x1f4, %esi            # imm = 0x1F4
callq 0x3dfa
movq %rbx, %rdi
callq 0x26ce
jmp 0x28c0
movq %r15, %rdi
movq %r12, %rsi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movzbl %r13b, %eax
addl $-0x44, %eax
cmpl $0x29, %eax
ja 0x2830
btq %rax, %rbp
jae 0x2830
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x20b0
movq %rbx, %rdi
callq 0x2300
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::ChoisirMenu()
void JustePrix::ChoisirMenu()
{
    char choixMenu = 0;
    do{
        choixMenu = ihm->afficherMenu();
        if(choixMenu == 'R' || choixMenu == 'r')
        {
            meilleurScore->remettreAZeroScore();
            this->jouerNouvellePartie();
        }
        else if(choixMenu == 'M' || choixMenu == 'm')
        {
            ihm->afficherMeilleursScores(meilleurScore->getFichierDifficulte());
            ihm->afficherPositionScore(meilleurScore->calculerPositionClassement(this->getNbCoups()));
        }
        else if(choixMenu == 'H' || choixMenu == 'h')
        {
            ihm->afficherHistorique(historique->getHistorique());
        }
        else if(choixMenu == 'Q' || choixMenu == 'q')
        {
            ihm->arreterJeu(joueur->getNom());
        }
        else
        {
            cerr << "Désoler ce choix n'est Disponible" <<endl;
        }
    }
    while(choixMenu != 'R' && choixMenu != 'r' && choixMenu != 'Q' && choixMenu != 'q');
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdi, %rbx
movq %rsp, %r14
leaq 0x38(%rsp), %r15
leaq 0x18(%rsp), %r12
movq 0x10(%rbx), %rdi
callq 0x32b2
movl %eax, %r13d
andb $-0x21, %al
cmpb $0x48, %al
je 0x29c2
movzbl %al, %eax
cmpl $0x4d, %eax
je 0x295e
cmpl $0x51, %eax
je 0x299d
cmpl $0x52, %eax
jne 0x29e7
movq 0x28(%rbx), %rdi
callq 0x42da
movq %rbx, %rdi
callq 0x2a62
jmp 0x2a02
movq 0x10(%rbx), %rbp
movq 0x28(%rbx), %rsi
movq %r15, %rdi
callq 0x3de8
movq %rbp, %rdi
movq %r15, %rsi
callq 0x3468
movq %r15, %rdi
callq 0x20b0
movq 0x10(%rbx), %rbp
movq 0x28(%rbx), %rdi
movl 0xc(%rbx), %esi
callq 0x3e32
movq %rbp, %rdi
movl %eax, %esi
callq 0x36a8
jmp 0x2a02
movq 0x10(%rbx), %rbp
movq 0x18(%rbx), %rsi
movq %r12, %rdi
callq 0x37a8
movq %rbp, %rdi
movq %r12, %rsi
callq 0x3368
movq %r12, %rdi
callq 0x20b0
jmp 0x2a02
movq 0x10(%rbx), %rbp
movq 0x20(%rbx), %rsi
movq %r14, %rdi
callq 0x382e
movq %rbp, %rdi
movq %r14, %rsi
callq 0x33b6
movq %r14, %rdi
callq 0x2c3e
jmp 0x2a02
movq 0x6602(%rip), %rdi      # 0x8ff0
leaq 0x2654(%rip), %rsi      # 0x5049
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movzbl %r13b, %eax
addl $-0x51, %eax
cmpl $0x21, %eax
ja 0x291c
movabsq $0x300000003, %rcx      # imm = 0x300000003
btq %rax, %rcx
jae 0x291c
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
movq %rsp, %rdi
callq 0x2c3e
jmp 0x2a59
movq %rax, %rbx
leaq 0x38(%rsp), %rdi
jmp 0x2a54
movq %rax, %rbx
leaq 0x18(%rsp), %rdi
callq 0x20b0
movq %rbx, %rdi
callq 0x2300
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::jouerNouvellePartie()
void JustePrix::jouerNouvellePartie()
{
    this->setNbCoups(0);
    historique->initialiserAncienCoups();
    ihm->afficherIntroduction(this->getPrixMin());
    this->ChoisirDifficulte();
    ihm->afficherBornes(this->getPrixMin(), this->getPrixMax());
    meilleurScore->recupererScore();
    this->jouer(); 
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
andl $0x0, 0xc(%rdi)
movq 0x20(%rdi), %rdi
callq 0x388a
movq 0x10(%rbx), %rdi
movl 0x4(%rbx), %esi
callq 0x2d68
movq %rbx, %rdi
callq 0x2802
movq 0x10(%rbx), %rdi
movl 0x4(%rbx), %esi
movl 0x8(%rbx), %edx
callq 0x30b8
movq 0x28(%rbx), %rdi
callq 0x3f5c
movq %rbx, %rdi
popq %rbx
jmp 0x2b14
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::demarrer()
void JustePrix::demarrer()
{
    this->setNbCoups(0);
    ihm->afficherIntroduction(this->getPrixMin());
    this->recupererNom();
    this->ChoisirDifficulte();
    ihm->afficherBornes(this->getPrixMin(), this->getPrixMax());
    meilleurScore->recupererScore();
    this->jouer();
}

// Assembly:
pushq %rbx
movq %rdi, %rbx
andl $0x0, 0xc(%rdi)
movq 0x10(%rdi), %rdi
movl 0x4(%rbx), %esi
callq 0x2d68
movq %rbx, %rdi
callq 0x27b4
movq %rbx, %rdi
callq 0x2802
movq 0x10(%rbx), %rdi
movl 0x4(%rbx), %esi
movl 0x8(%rbx), %edx
callq 0x30b8
movq 0x28(%rbx), %rdi
callq 0x3f5c
movq %rbx, %rdi
popq %rbx
jmp 0x2b14
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/justePrix.cpp
// Function: JustePrix::jouer()
void JustePrix::jouer()
{
    int prix = 0;
    time_t debutChrono = time(NULL);
    do
    {
        prix = ihm->demanderPrix(joueur->getNom());
    }
    while(this->verifierPrix(prix, prixMystere));
    int chronometre = (int)time(NULL) - debutChrono;
    this->calculerTemps(chronometre);
    historique->ajouter(this->getNbCoups(), joueur->getNom());
    meilleurScore->sauvegarderScore(this->getNbCoups(), joueur->getNom());
    this->ChoisirMenu();
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x60, %rsp
movq %rdi, %rbx
xorl %edi, %edi
callq 0x21b0
movq %rax, %r15
leaq 0x40(%rsp), %r14
movq 0x10(%rbx), %r12
movq 0x18(%rbx), %rsi
movq %r14, %rdi
callq 0x37a8
movq %r12, %rdi
movq %r14, %rsi
callq 0x2f5c
movl %eax, %ebp
movq %r14, %rdi
callq 0x20b0
movl (%rbx), %edx
movq %rbx, %rdi
movl %ebp, %esi
callq 0x2738
testb %al, %al
jne 0x2b32
xorl %edi, %edi
callq 0x21b0
subl %r15d, %eax
movq %rbx, %rdi
movl %eax, %esi
callq 0x2aa8
movq 0x20(%rbx), %r15
movl 0xc(%rbx), %ebp
movq 0x18(%rbx), %rsi
leaq 0x20(%rsp), %r14
movq %r14, %rdi
callq 0x37a8
movq %r15, %rdi
movl %ebp, %esi
movq %r14, %rdx
callq 0x37e2
leaq 0x20(%rsp), %rdi
callq 0x20b0
movq 0x28(%rbx), %r15
movl 0xc(%rbx), %ebp
movq 0x18(%rbx), %rsi
movq %rsp, %r14
movq %r14, %rdi
callq 0x37a8
movq %r15, %rdi
movl %ebp, %esi
movq %r14, %rdx
callq 0x40d8
movq %rsp, %rdi
callq 0x20b0
movq %rbx, %rdi
callq 0x28fe
addq $0x60, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
jmp 0x2bee
jmp 0x2bee
movq %rax, %rbx
movq %r14, %rdi
callq 0x20b0
movq %rbx, %rdi
callq 0x2300
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/ihm.cpp
// Function: Ihm::demanderNom[abi:cxx11]()
string Ihm::demanderNom()
{
    string nom;
    cout << "Entrez votre nom : \033[1;31m"<< endl;
    cin >> nom;
    cout << "\033[0m";
    return nom;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
leaq 0x10(%rdi), %rax
movq %rax, (%rdi)
andq $0x0, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
movq 0x60c0(%rip), %rdi      # 0x8fc8
leaq 0x2579(%rip), %rsi      # 0x5488
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movq 0x60b5(%rip), %rdi      # 0x8fd8
movq %rbx, %rsi
callq 0x2220
movq 0x6096(%rip), %rdi      # 0x8fc8
leaq 0x2827(%rip), %rsi      # 0x5760
callq 0x21d0
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movq %rax, %r14
movq %rbx, %rdi
callq 0x20b0
movq %r14, %rdi
callq 0x2300
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/ihm.cpp
// Function: Ihm::demanderPrix(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
int Ihm::demanderPrix(string nom)
{
    int prix = 0;
    cout <<endl;
    cout << nom << ", Entrez un prix : "<< endl;
    cin >> prix;
    while(cin.fail())
    {
        cout << "Entrez un prix : "<< endl;
        cin.clear();
        cin.ignore(256,'\n');
        cin >> prix;
    }
    return prix;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rsi, %r15
leaq 0xc(%rsp), %rbx
andl $0x0, (%rbx)
movq 0x604e(%rip), %r14      # 0x8fc8
movq %r14, %rdi
callq 0x20c0
movq %r14, %rdi
movq %r15, %rsi
callq 0x21a0
leaq 0x250f(%rip), %rsi      # 0x54a3
movq %rax, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movq 0x602d(%rip), %r15      # 0x8fd8
leaq 0x24f3(%rip), %r12      # 0x54a5
pushq $0xa
popq %rbp
movq %r15, %rdi
movq %rbx, %rsi
callq 0x20f0
movq (%r15), %rax
movq -0x18(%rax), %rax
testb $0x5, 0x20(%r15,%rax)
je 0x3004
movq %r14, %rdi
movq %r12, %rsi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movq (%r15), %rax
movq -0x18(%rax), %rdi
addq %r15, %rdi
xorl %esi, %esi
callq 0x22e0
movl $0x100, %esi            # imm = 0x100
movq %r15, %rdi
movl %ebp, %edx
callq 0x2100
jmp 0x2fb5
movl 0xc(%rsp), %eax
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/ihm.cpp
// Function: Ihm::demanderDifficulte(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>)
char Ihm::demanderDifficulte(string nom)
{
    char Difficulte = ' ';
    cout << endl;
    cout << nom <<", Choisissez votre difficulté :"<< endl;
    cout << "\033[1;31m[F]\033[0macile (1 à 100)"<< endl;
    cout << "\033[1;31m[M]\033[0moyen (1 à 500)"<< endl;
    cout << "\033[1;31m[D]\033[0mifficile (1 à 1000)"<< endl;
    cout << endl;
    cout << "Entrez une difficulté : \033[1;31m";
    cin >> Difficulte;
    cout << "\033[0m";
    return Difficulte;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq %rsi, %r15
leaq 0xf(%rsp), %rbx
movb $0x20, (%rbx)
movq 0x5dc7(%rip), %r14      # 0x8fc8
movq %r14, %rdi
callq 0x20c0
movq %r14, %rdi
movq %r15, %rsi
callq 0x21a0
leaq 0x23c1(%rip), %rsi      # 0x55dc
movq %rax, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23cb(%rip), %rsi      # 0x55fd
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23d3(%rip), %rsi      # 0x561c
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23da(%rip), %rsi      # 0x563a
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
movq %r14, %rdi
callq 0x20c0
leaq 0x23de(%rip), %rsi      # 0x565d
movq %r14, %rdi
callq 0x21d0
movq 0x5d4a(%rip), %rdi      # 0x8fd8
movq %rbx, %rsi
callq 0x2240
leaq 0x24c3(%rip), %rsi      # 0x5760
movq %r14, %rdi
callq 0x21d0
movb (%rbx), %al
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/ihm.cpp
// Function: Ihm::afficherMenu()
char Ihm::afficherMenu()
{
    char ChoixMenu = ' ';
    sleep(1);
    cout << endl;
    cout << "\033[1;31m[R]\033[0mejouer"<< endl;
    cout << "\033[1;31m[M]\033[0meilleurs Scores"<< endl;
    cout << "\033[1;31m[H]\033[0mistorique Partie"<< endl;
    cout << "\033[1;31m[Q]\033[0muitter"<< endl;
    cout << "Entrer votre choix : \033[1;31m";
    cin >> ChoixMenu;
    cout << "\033[0m";
    return ChoixMenu;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
leaq 0x7(%rsp), %rbx
movb $0x20, (%rbx)
pushq $0x1
popq %rdi
callq 0x2150
movq 0x5cfb(%rip), %r14      # 0x8fc8
movq %r14, %rdi
callq 0x20c0
leaq 0x23a2(%rip), %rsi      # 0x567e
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23a0(%rip), %rsi      # 0x5693
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23a7(%rip), %rsi      # 0x56b1
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23af(%rip), %rsi      # 0x56d0
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x23ad(%rip), %rsi      # 0x56e5
movq %r14, %rdi
callq 0x21d0
movq 0x5c91(%rip), %rdi      # 0x8fd8
movq %rbx, %rsi
callq 0x2240
leaq 0x240a(%rip), %rsi      # 0x5760
movq %r14, %rdi
callq 0x21d0
movb (%rbx), %al
addq $0x8, %rsp
popq %rbx
popq %r14
retq
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/ihm.cpp
// Function: Ihm::afficherHistorique(std::vector<std::pair<int, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::allocator<std::pair<int, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>>>)
void Ihm::afficherHistorique(vector<pair<int,string> > scoreHistorique)
{
    system("clear");
    cout << "Historique de vos partie :" << endl;
    cout << "\033[1;36mJoueur : \033[0m"<< scoreHistorique[0].second << endl;
    for(unsigned int i=0;i < scoreHistorique.size(); i++)
    {
        cout << "\033[1;36m   score : \033[0m"<<scoreHistorique[i].first << endl;
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %rbx
leaq 0x1ccd(%rip), %rdi      # 0x5096
callq 0x2180
movq 0x5bf3(%rip), %r14      # 0x8fc8
leaq 0x2342(%rip), %rsi      # 0x571e
movq %r14, %rdi
callq 0x21d0
movq %rax, %rdi
callq 0x20c0
leaq 0x2346(%rip), %rsi      # 0x5739
movq %r14, %rdi
callq 0x21d0
movq (%rbx), %rsi
addq $0x8, %rsi
movq %rax, %rdi
callq 0x21a0
movq %rax, %rdi
callq 0x20c0
xorl %eax, %eax
pushq $0x28
popq %r12
leaq 0x232f(%rip), %r15      # 0x574e
movl %eax, %r13d
movq 0x8(%rbx), %rax
subq (%rbx), %rax
cqto
idivq %r12
cmpq %r13, %rax
jbe 0x345e
movq %r14, %rdi
movq %r15, %rsi
callq 0x21d0
movq (%rbx), %rcx
imulq $0x28, %r13, %rdx
movl (%rcx,%rdx), %esi
movq %rax, %rdi
callq 0x22f0
movq %rax, %rdi
callq 0x20c0
leal 0x1(%r13), %eax
jmp 0x341f
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O2/FabienBounoir[P]JustePrix-CLI/historique.cpp
// Function: Historique::enregistrerAncienCoups(int)
bool Historique::enregistrerAncienCoups(int prix)
{
    if(find(this->ancienCoups.begin(), this->ancienCoups.end(), prix ) != this->ancienCoups.end())
    {
        return false;
    }
    else
    {
        this->ancienCoups.push_back(prix);
        return true;
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq %rdi, %rbx
leaq 0xc(%rsp), %rdx
movl %esi, (%rdx)
movq 0x18(%rdi), %rdi
movq 0x20(%rbx), %rsi
callq 0x3beb
movq %rax, %r14
movq 0x20(%rbx), %r15
cmpq %r15, %rax
jne 0x3879
addq $0x18, %rbx
leaq 0xc(%rsp), %rsi
movq %rbx, %rdi
callq 0x38f4
cmpq %r15, %r14
sete %al
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
nop