user: 请显示与下面列出的汇编代码相匹配的C语言实现:

```asm
<innerPredict>:
  endbr64
  push   %r15
  push   %r14
  mov    %rsi,%r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x88,%rsp
  mov    %rdi,0x40(%rsp)
  mov    0xc8(%rsp),%r13
  mov    %edx,0x34(%rsp)
  mov    %rcx,0x18(%rsp)
  mov    %r8,0x20(%rsp)
  mov    %r9,0x8(%rsp)
  test   %edx,%edx
  jle    L104
  mov    0x34(%rsp),%ebx
  mov    0x40(%rsp),%rsi
  lea    -0x1(%rbx),%edx
  mov    %rsi,%rax
  lea    0x4(%rsi,%rdx,4),%rdx
L96:
  movss  %xmm0,(%rax)
  add    $0x4,%rax
  cmp    %rdx,%rax
  jne    L96
L104:
  mov    0xe8(%rsp),%ecx
  test   %ecx,%ecx
  jle    L83
  imul   $0x32,0xe0(%rsp),%eax
  movl   $0x0,0x64(%rsp)
  movq   $0x0,0x68(%rsp)
  movl   $0x0,0x60(%rsp)
  mov    %eax,0x78(%rsp)
  cltq
  shl    $0x2,%rax
  mov    %rax,0x70(%rsp)
  movslq 0xe0(%rsp),%rax
  shl    $0x2,%rax
  mov    %rax,0x58(%rsp)
L111:
  movq   $0x0,0x50(%rsp)
  mov    0x60(%rsp),%eax
  mov    %eax,0x7c(%rsp)
  add    $0x32,%eax
  mov    %eax,0x60(%rsp)
  mov    0x34(%rsp),%eax
  test   %eax,%eax
  jle    L146
L188:
  mov    0x50(%rsp),%eax
  mov    0x64(%rsp),%ebp
  add    $0x3c,%eax
  mov    %eax,0x48(%rsp)
  mov    0x68(%rsp),%rax
  mov    %rax,0x28(%rsp)
  mov    0x7c(%rsp),%eax
  mov    %eax,0x4c(%rsp)
  nopw   0x0(%rax,%rax,1)
L77:
  mov    0xe8(%rsp),%esi
  mov    0x60(%rsp),%edi
  call   <min@plt>
  cmp    0x4c(%rsp),%eax
  jle    L126
  mov    0x28(%rsp),%rax
  add    %r13,%rax
  mov    %rax,0x38(%rsp)
  mov    0x50(%rsp),%rax
  mov    %rax,0x10(%rsp)
  nopl   0x0(%rax)
L88:
  mov    0x34(%rsp),%esi
  mov    0x48(%rsp),%edi
  call   <min@plt>
  mov    0x10(%rsp),%rcx
  cmp    %ecx,%eax
  jle    L27
  mov    0x28(%rsp),%r15
  mov    0x38(%rsp),%r12
  lea    0x0(,%rcx,4),%rbx
  movslq 0x0(%r13,%r15,1),%rax
  cmp    $0xffffffff,%eax
  jne    L67
  jmp    L45
  nopl   0x0(%rax,%rax,1)
L141:
  mov    0xc0(%rsp),%rax
  mov    0xd8(%rsp),%rsi
  movss  (%rax,%r15,1),%xmm1
  movslq (%r12),%rax
  mov    (%rsi,%rax,4),%edx
  test   %edx,%edx
  jne    L209
  comiss %xmm0,%xmm1
  ja     L78
L28:
  mov    0x20(%rsp),%rax
  mov    (%rax,%r15,1),%edx
  nopl   0x0(%rax,%rax,1)
L190:
  add    %ebp,%edx
  movslq %edx,%rdx
  lea    0x0(,%rdx,4),%r15
  lea    0x0(%r13,%r15,1),%r12
  movslq (%r12),%rax
  cmp    $0xffffffff,%eax
  je     L45
L67:
  mov    (%r14,%rax,8),%rax
  movss  (%rax,%rbx,1),%xmm0
  movss  %xmm0,0x30(%rsp)
  call   <isnan@plt>
  movss  0x30(%rsp),%xmm0
  test   %rax,%rax
  je     L141
  mov    0x8(%rsp),%rax
  mov    (%rax,%r15,1),%edx
  jmp    L190
  nopl   (%rax)
L209:
  cvttss2si %xmm0,%ecx
  mov    0xd0(%rsp),%rdi
  cvttss2si %xmm1,%eax
  imul   0xf0(%rsp),%eax
  add    %ecx,%eax
  cltq
  mov    (%rdi,%rax,4),%eax
  cmp    $0xffffffff,%eax
  je     L78
  cmp    $0x1,%eax
  je     L28
  mov    0x8(%rsp),%rax
  mov    (%rax,%r15,1),%edx
  jmp    L190
  nopl   0x0(%rax)
L78:
  mov    0x18(%rsp),%rax
  mov    (%rax,%r15,1),%edx
  jmp    L190
  cs nopw 0x0(%rax,%rax,1)
L45:
  mov    0x10(%rsp),%rax
  mov    0x40(%rsp),%rdi
  mov    0xc0(%rsp),%rcx
  movss  (%rdi,%rax,4),%xmm0
  addss  (%rcx,%r15,1),%xmm0
  movss  %xmm0,(%rdi,%rax,4)
  add    $0x1,%rax
  mov    %rax,0x10(%rsp)
  jmp    L88
L27:
  mov    0x58(%rsp),%rsi
  addl   $0x1,0x4c(%rsp)
  add    %rsi,0x28(%rsp)
  add    0xe0(%rsp),%ebp
  jmp    L77
L126:
  addq   $0x3c,0x50(%rsp)
  mov    0x50(%rsp),%rax
  cmp    %eax,0x34(%rsp)
  jg     L188
L146:
  mov    0x70(%rsp),%rsi
  mov    0x60(%rsp),%eax
  add    %rsi,0x68(%rsp)
  mov    0x78(%rsp),%esi
  add    %esi,0x64(%rsp)
  cmp    %eax,0xe8(%rsp)
  jg     L111
L83:
  add    $0x88,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
```

assistant: ```c
void innerPredict(float radPredF[], float **dataMatrix, int nCtxs, int left[], int right[], int missing[], float splitCode[], int splitVar[], int cSplits[], int varTypes[], float initialValue, int treeSize, int numTrees, int maxCSplitSize) {
  int tStep = 50;
  int obsStep = 60;
  for (int i = 0; i < nCtxs; i++) {
    radPredF[i] = initialValue;
  }
  for (int t0 = 0; t0 < numTrees; t0 += tStep) {
    for (int obs0 = 0; obs0 < nCtxs; obs0 += obsStep) {
      for (int t = t0; t < min(t0 + tStep, numTrees); t++) {
        int offset = t * treeSize;
        for (int iObs = obs0; iObs < min(obs0 + obsStep, nCtxs); iObs++) {
          int iCurrentNode = 0;
          while (splitVar[offset + iCurrentNode] != -1) {
            float dX = dataMatrix[splitVar[offset + iCurrentNode]][iObs];
            if (isnan(dX)) {
              iCurrentNode = missing[offset + iCurrentNode];
            } else if (varTypes[splitVar[offset + iCurrentNode]] == 0) {
              if (dX < splitCode[offset + iCurrentNode]) {
                iCurrentNode = left[offset + iCurrentNode];
              } else {
                iCurrentNode = right[offset + iCurrentNode];
              }
            } else {
              int iCatSplitIndicator = cSplits[((int)splitCode[offset + iCurrentNode] * maxCSplitSize) + (int)dX];
              if (iCatSplitIndicator == -1) {
                iCurrentNode = left[offset + iCurrentNode];
              } else if (iCatSplitIndicator == 1) {
                iCurrentNode = right[offset + iCurrentNode];
              } else {
                iCurrentNode = missing[offset + iCurrentNode];
              }
            }
          }
          radPredF[iObs] += (float)splitCode[offset + iCurrentNode];
        }
      }
    }
  }
}
```