user: 这段汇编代码用C语言表示是什么样的？

```asm
<radix_sort>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0xb8,%rsp
  mov    %edx,%ebx
  mov    %fs:0x28,%rax
  mov    %rax,0xa8(%rsp)
  xor    %eax,%eax
  movq   $0x0,0x50(%rsp)
  movq   $0x0,0x58(%rsp)
  movq   $0x0,0x60(%rsp)
  movq   $0x0,0x68(%rsp)
  movq   $0x0,0x70(%rsp)
  movq   $0x0,0x80(%rsp)
  movq   $0x0,0x88(%rsp)
  movq   $0x0,0x90(%rsp)
  movq   $0x0,0x98(%rsp)
  movq   $0x0,0xa0(%rsp)
  test   %esi,%esi
  jle    L53
  mov    %rdi,%rbp
  mov    %esi,%r13d
  mov    %rdi,%rcx
  lea    -0x1(%rsi),%eax
  lea    0x4(%rdi,%rax,4),%r8
  mov    $0x0,%edi
L106:
  mov    (%rcx),%eax
  cltd
  idiv   %ebx
  movslq %eax,%rdx
  imul   $0x66666667,%rdx,%rdx
  sar    $0x22,%rdx
  mov    %eax,%esi
  sar    $0x1f,%esi
  sub    %esi,%edx
  lea    (%rdx,%rdx,4),%esi
  add    %esi,%esi
  sub    %esi,%eax
  mov    %eax,%edx
  cltq
  addl   $0x1,0x50(%rsp,%rax,4)
  addl   $0x1,0x80(%rsp,%rax,4)
  test   %edx,%edx
  setg   %al
  movzbl %al,%eax
  add    %eax,%edi
  add    $0x4,%rcx
  cmp    %r8,%rcx
  jne    L106
  test   %edi,%edi
  je     L53
  mov    0x50(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,%r15
  mov    0x54(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,%r14
  mov    0x58(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,(%rsp)
  mov    0x5c(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x8(%rsp)
  mov    0x60(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x10(%rsp)
  mov    0x64(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x18(%rsp)
  mov    0x68(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x20(%rsp)
  mov    0x6c(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x28(%rsp)
  mov    0x70(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x30(%rsp)
  mov    0x74(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,0x38(%rsp)
  lea    -0x1(%r13),%ecx
  movslq %ecx,%rcx
  lea    D9(%rip),%rdi
  jmp    L60
L53:
  mov    %ebx,%esi
  lea    D18(%rip),%rdi
  call   <printf@plt>
  jmp    L132
  cltq
  mov    %esi,(%r15,%rax,4)
L89:
  sub    $0x1,%rcx
  test   %ecx,%ecx
  js     L95
L60:
  mov    0x0(%rbp,%rcx,4),%esi
  mov    %esi,%eax
  cltd
  idiv   %ebx
  movslq %eax,%rdx
  imul   $0x66666667,%rdx,%rdx
  sar    $0x22,%rdx
  mov    %eax,%r8d
  sar    $0x1f,%r8d
  sub    %r8d,%edx
  lea    (%rdx,%rdx,4),%r8d
  add    %r8d,%r8d
  sub    %r8d,%eax
  mov    %eax,%edx
  movslq %eax,%r8
  mov    0x50(%rsp,%r8,4),%eax
  sub    $0x1,%eax
  mov    %eax,0x50(%rsp,%r8,4)
  cmp    $0x9,%edx
  ja     L89
  mov    %edx,%edx
  movslq (%rdi,%rdx,4),%rdx
  add    %rdi,%rdx
  notrack jmp *%rdx
  cltq
  mov    %esi,(%r14,%rax,4)
  jmp    L89
  cltq
  mov    (%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x8(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x10(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x18(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x20(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x28(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x30(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
  cltq
  mov    0x38(%rsp),%rdx
  mov    %esi,(%rdx,%rax,4)
  jmp    L89
L95:
  movl   $0x0,0x4c(%rsp)
  lea    0x4c(%rsp),%r12
  mov    0x80(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    %r15,%rdi
  call   <copy@plt>
  mov    0x84(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    %r14,%rdi
  call   <copy@plt>
  mov    0x88(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    (%rsp),%rdi
  call   <copy@plt>
  mov    0x8c(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x8(%rsp),%rdi
  call   <copy@plt>
  mov    0x90(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x10(%rsp),%rdi
  call   <copy@plt>
  mov    0x94(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x18(%rsp),%rdi
  call   <copy@plt>
  mov    0x98(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x20(%rsp),%rdi
  call   <copy@plt>
  mov    0x9c(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x28(%rsp),%rdi
  call   <copy@plt>
  mov    0xa0(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x30(%rsp),%rdi
  call   <copy@plt>
  mov    0xa4(%rsp),%ecx
  mov    %r12,%rdx
  mov    %rbp,%rsi
  mov    0x38(%rsp),%rdi
  call   <copy@plt>
  mov    %r13d,%esi
  mov    %rbp,%rdi
  call   <print@plt>
  lea    (%rbx,%rbx,4),%edx
  add    %edx,%edx
  mov    %r13d,%esi
  mov    %rbp,%rdi
  call   <radix_sort>
L132:
  mov    0xa8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L117
  add    $0xb8,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L117:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: read_data
arguments: data_tag: D18
type: string

tool: D18: last radix is %d


assistant: ```c
void radix_sort(int v[], int length, int radix) {
  int size = 0;
  int count[10] = {0};
  int bak[10] = {0};
  int index;
  for (int i = 0; i < length; i++) {
    index = v[i] / radix % 10;
    count[index]++;
    bak[index]++;
    if (index > 0) {
      size++;
    }
  }
  if (!size) {
    printf("last radix is %d\n", radix);
    return;
  }
  int *a0 = malloc(sizeof(int) * count[0]);
  int *a1 = malloc(sizeof(int) * count[1]);
  int *a2 = malloc(sizeof(int) * count[2]);
  int *a3 = malloc(sizeof(int) * count[3]);
  int *a4 = malloc(sizeof(int) * count[4]);
  int *a5 = malloc(sizeof(int) * count[5]);
  int *a6 = malloc(sizeof(int) * count[6]);
  int *a7 = malloc(sizeof(int) * count[7]);
  int *a8 = malloc(sizeof(int) * count[8]);
  int *a9 = malloc(sizeof(int) * count[9]);
  for (int i = length - 1; i >= 0; --i) {
    index = v[i] / radix % 10;
    count[index]--;
    switch (index) {
    case 0:
      a0[count[index]] = v[i];
      break;
    case 1:
      a1[count[index]] = v[i];
      break;
    case 2:
      a2[count[index]] = v[i];
      break;
    case 3:
      a3[count[index]] = v[i];
      break;
    case 4:
      a4[count[index]] = v[i];
      break;
    case 5:
      a5[count[index]] = v[i];
      break;
    case 6:
      a6[count[index]] = v[i];
      break;
    case 7:
      a7[count[index]] = v[i];
      break;
    case 8:
      a8[count[index]] = v[i];
      break;
    case 9:
      a9[count[index]] = v[i];
      break;
    }
  }
  int pos = 0;
  copy(a0, v, &pos, bak[0]);
  copy(a1, v, &pos, bak[1]);
  copy(a2, v, &pos, bak[2]);
  copy(a3, v, &pos, bak[3]);
  copy(a4, v, &pos, bak[4]);
  copy(a5, v, &pos, bak[5]);
  copy(a6, v, &pos, bak[6]);
  copy(a7, v, &pos, bak[7]);
  copy(a8, v, &pos, bak[8]);
  copy(a9, v, &pos, bak[9]);
  print(v, length);
  radix_sort(v, length, radix * 10);
}
```