user: 请将这段汇编代码片段转换成等效的C代码:

```asm
<simplex2>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  push   %r15
  push   %r14
  push   %r12
  push   %rbx
  sub    $0x60,%rsp
  mov    %edi,-0x64(%rbp)
  mov    %esi,-0x68(%rbp)
  mov    %rdx,-0x70(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x28(%rbp)
  xor    %eax,%eax
  mov    -0x68(%rbp),%eax
  lea    0x1(%rax),%ebx
  mov    %ebx,%eax
  sub    $0x1,%rax
  mov    %rax,-0x40(%rbp)
  mov    %ebx,%eax
  mov    %rax,%r8
  mov    $0x0,%r9d
L16:
  mov    %rsp,%rax
  mov    %rax,%r12
  movl   $0x0,-0x54(%rbp)
  movl   $0x0,-0x54(%rbp)
  jmp    L109
L135:
  mov    -0x70(%rbp),%rax
  mov    -0x54(%rbp),%edx
  movss  (%rax,%rdx,4),%xmm1
  pxor   %xmm0,%xmm0
  comiss %xmm1,%xmm0
  ja     L65
  addl   $0x1,-0x54(%rbp)
L109:
  mov    -0x54(%rbp),%eax
  cmp    -0x68(%rbp),%eax
  jb     L135
  jmp    L99
L65:
  nop
L99:
  mov    -0x54(%rbp),%eax
  cmp    -0x68(%rbp),%eax
  je     L130
  movl   $0xffffffff,-0x50(%rbp)
  pxor   %xmm0,%xmm0
  movss  %xmm0,-0x4c(%rbp)
  movl   $0x1,-0x48(%rbp)
  jmp    L12
L108:
  mov    -0x48(%rbp),%eax
  mov    %ebx,%edx
  imul   %rdx,%rax
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rax,%rdx
  mov    -0x54(%rbp),%eax
  movss  (%rdx,%rax,4),%xmm0
  pxor   %xmm1,%xmm1
  comiss %xmm1,%xmm0
  jbe    L137
  mov    -0x48(%rbp),%eax
  mov    %ebx,%edx
  imul   %rdx,%rax
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rax,%rdx
  mov    -0x68(%rbp),%eax
  movss  (%rdx,%rax,4),%xmm0
  mov    -0x48(%rbp),%eax
  mov    %ebx,%edx
  imul   %rdx,%rax
  lea    0x0(,%rax,4),%rdx
  mov    -0x70(%rbp),%rax
  add    %rax,%rdx
  mov    -0x54(%rbp),%eax
  movss  (%rdx,%rax,4),%xmm1
  divss  %xmm1,%xmm0
  movss  %xmm0,-0x44(%rbp)
  cmpl   $0xffffffff,-0x50(%rbp)
  je     L119
  movss  -0x4c(%rbp),%xmm0
  comiss -0x44(%rbp),%xmm0
  jbe    L137
L119:
  movss  -0x44(%rbp),%xmm0
  movss  %xmm0,-0x4c(%rbp)
  mov    -0x48(%rbp),%eax
  mov    %eax,-0x50(%rbp)
L137:
  addl   $0x1,-0x48(%rbp)
L12:
  mov    -0x64(%rbp),%eax
  add    $0x1,%eax
  cmp    %eax,-0x48(%rbp)
  jb     L108
  cmpl   $0xffffffff,-0x50(%rbp)
  je     L46
  mov    -0x68(%rbp),%eax
  lea    0x1(%rax),%esi
  mov    -0x64(%rbp),%eax
  lea    0x1(%rax),%edi
  mov    -0x54(%rbp),%ecx
  mov    -0x50(%rbp),%edx
  mov    -0x70(%rbp),%rax
  mov    %ecx,%r8d
  mov    %edx,%ecx
  mov    %rax,%rdx
  call   <trafo@plt>
  mov    -0x68(%rbp),%eax
  mov    %eax,%edx
  sub    $0x1,%rdx
  mov    %rdx,-0x38(%rbp)
  mov    %eax,%edx
  mov    %rdx,%r14
  mov    $0x0,%r15d
  mov    %eax,%edx
  mov    %rdx,-0x80(%rbp)
  movq   $0x0,-0x78(%rbp)
  mov    %eax,%eax
  lea    0x0(,%rax,4),%rdx
  mov    $0x10,%eax
  sub    $0x1,%rax
  add    %rdx,%rax
  mov    $0x10,%edi
  mov    $0x0,%edx
  div    %rdi
  imul   $0x10,%rax,%rax
  mov    %rax,%rcx
  and    $0xfffffffffffff000,%rcx
  mov    %rsp,%rdx
  sub    %rcx,%rdx
L81:
  cmp    %rdx,%rsp
  je     L104
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  jmp    L81
L104:
  mov    %rax,%rdx
  and    $0xfff,%edx
  sub    %rdx,%rsp
  mov    %rax,%rdx
  and    $0xfff,%edx
  test   %rdx,%rdx
  je     L120
  and    $0xfff,%eax
  sub    $0x8,%rax
  add    %rsp,%rax
  orq    $0x0,(%rax)
L120:
  mov    %rsp,%rax
  add    $0x3,%rax
  shr    $0x2,%rax
  shl    $0x2,%rax
  mov    %rax,-0x30(%rbp)
  mov    -0x70(%rbp),%rcx
  mov    -0x30(%rbp),%rdx
  mov    -0x68(%rbp),%esi
  mov    -0x64(%rbp),%eax
  mov    %eax,%edi
  call   <solution@plt>
  mov    -0x70(%rbp),%rcx
  mov    -0x30(%rbp),%rdx
  mov    -0x68(%rbp),%esi
  mov    -0x64(%rbp),%eax
  mov    %eax,%edi
  call   <feasible_p@plt>
  mov    %eax,%edi
  call   <assert@plt>
  mov    %r12,%rsp
  jmp    L16
L46:
  nop
L130:
  mov    %r12,%rsp
  nop
  mov    -0x28(%rbp),%rax
  sub    %fs:0x28,%rax
  je     L131
  call   <__stack_chk_fail@plt>
L131:
  lea    -0x20(%rbp),%rsp
  pop    %rbx
  pop    %r12
  pop    %r14
  pop    %r15
  pop    %rbp
  ret
```

assistant: ```c
void simplex2(unsigned int D, unsigned int N, float A[D + 1][N + 1]) {
  while (true) {
    unsigned int i = 0;
    for (i = 0; i < N; i++)
      if (A[0][i] < 0.)
        break;
    if (i == N)
      break;
    int pivot_index = -1;
    float pivot_value = 0.;
    for (unsigned int j = 1; j < D + 1; j++) {
      if (0. < A[j][i]) {
        float nval = A[j][N] / A[j][i];
        if ((-1 == pivot_index) || (nval < pivot_value)) {
          pivot_value = nval;
          pivot_index = j;
        }
      }
    }
    if (-1 == pivot_index)
      break;
    trafo(D + 1, N + 1, A, pivot_index, i);
    float x[N];
    solution(D, N, x, A);
    assert(feasible_p(D, N, x, A));
  }
}
```