user: Please show me the C implementation that matches the assembly code listed below:

```asm
<radixsort>:
  endbr64
  push   %r15
  push   %r14
  mov    %rdi,%r14
  push   %r13
  xor    %r13d,%r13d
  push   %r12
  push   %rbp
  push   %rbx
  mov    %edx,%ebx
  sub    %esi,%ebx
  sub    $0xb8,%rsp
  mov    %rdi,(%rsp)
  mov    $0x50,%edi
  mov    %fs:0x28,%rax
  mov    %rax,0xa8(%rsp)
  xor    %eax,%eax
  lea    0x1(%rbx),%eax
  mov    %eax,0x14(%rsp)
  call   <malloc@plt>
  lea    0x4(%r14,%rbx,4),%rcx
  mov    %rcx,0x40(%rsp)
  lea    0x50(%rsp),%rcx
  mov    %rcx,0x20(%rsp)
  lea    0x78(%rsp),%rcx
  mov    %rax,0x8(%rsp)
  add    $0x50,%rax
  mov    %rcx,0x30(%rsp)
  lea    0x80(%rsp),%rcx
  mov    %rcx,0x18(%rsp)
  mov    %rax,0x28(%rsp)
L68:
  mov    0x20(%rsp),%rax
  pxor   %xmm0,%xmm0
  mov    %r13d,%r15d
  mov    (%rsp),%rbp
  mov    0x40(%rsp),%r12
  add    $0x1,%r13d
  movq   $0x0,0x20(%rax)
  movaps %xmm0,(%rax)
  movaps %xmm0,0x10(%rax)
  mov    0x14(%rsp),%eax
  test   %eax,%eax
  jle    L39
L26:
  mov    0x0(%rbp),%ebx
  mov    %r13d,%esi
  mov    $0xa,%edi
  add    $0x4,%rbp
  call   <power@plt>
  mov    %r15d,%esi
  mov    $0xa,%edi
  mov    %eax,%r8d
  mov    %ebx,%eax
  cltd
  idiv   %r8d
  mov    %edx,%ebx
  call   <power@plt>
  mov    %eax,%r8d
  mov    %ebx,%eax
  cltd
  idiv   %r8d
  cltq
  addl   $0x1,0x50(%rsp,%rax,4)
  cmp    %r12,%rbp
  jne    L26
L39:
  mov    0x20(%rsp),%rbx
  mov    0x8(%rsp),%r14
  mov    %rbx,0x38(%rsp)
  mov    %r14,%r12
  mov    %r14,%rbp
  mov    0x30(%rsp),%r14
  nopl   0x0(%rax,%rax,1)
L29:
  mov    (%rbx),%eax
  add    $0x4,%rbx
  add    $0x8,%rbp
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,-0x8(%rbp)
  cmp    %r14,%rbx
  jne    L29
  mov    0x18(%rsp),%rax
  mov    0x14(%rsp),%edx
  pxor   %xmm0,%xmm0
  mov    0x38(%rsp),%rbp
  mov    (%rsp),%rcx
  movq   $0x0,0x20(%rax)
  movaps %xmm0,(%rax)
  movaps %xmm0,0x10(%rax)
  test   %edx,%edx
  jle    L70
  mov    %rbp,0x38(%rsp)
  mov    0x40(%rsp),%r14
  mov    0x8(%rsp),%rbp
  mov    %r12,0x48(%rsp)
  mov    %rcx,%r12
  nop
L86:
  mov    (%r12),%ebx
  mov    %r13d,%esi
  mov    $0xa,%edi
  add    $0x4,%r12
  call   <power@plt>
  mov    %r15d,%esi
  mov    $0xa,%edi
  mov    %eax,%r8d
  mov    %ebx,%eax
  cltd
  idiv   %r8d
  mov    %edx,%ebx
  call   <power@plt>
  mov    %eax,%r8d
  mov    %ebx,%eax
  cltd
  idiv   %r8d
  cltq
  movslq 0x80(%rsp,%rax,4),%rdx
  mov    0x0(%rbp,%rax,8),%rsi
  lea    0x1(%rdx),%edi
  mov    %edi,0x80(%rsp,%rax,4)
  mov    -0x4(%r12),%eax
  mov    %eax,(%rsi,%rdx,4)
  cmp    %r14,%r12
  jne    L86
  mov    0x38(%rsp),%rbp
  mov    0x48(%rsp),%r12
L70:
  mov    0x18(%rsp),%rax
  pxor   %xmm0,%xmm0
  mov    (%rsp),%rbx
  xor    %r10d,%r10d
  mov    0x8(%rsp),%r9
  mov    0x30(%rsp),%r11
  movq   $0x0,0x20(%rax)
  movaps %xmm0,(%rax)
  movaps %xmm0,0x10(%rax)
  nop
L20:
  mov    0x0(%rbp),%r8d
  test   %r8d,%r8d
  jle    L46
  movslq %r10d,%rax
  mov    (%r9),%rdi
  movslq %r8d,%rsi
  lea    (%rbx,%rax,4),%rcx
  xor    %eax,%eax
  nopl   0x0(%rax,%rax,1)
L101:
  mov    (%rdi,%rax,4),%edx
  mov    %edx,(%rcx,%rax,4)
  add    $0x1,%rax
  cmp    %rsi,%rax
  jne    L101
  add    %r8d,%r10d
L46:
  add    $0x4,%rbp
  add    $0x8,%r9
  cmp    %r11,%rbp
  jne    L20
  mov    0x28(%rsp),%rbx
  nopl   0x0(%rax)
L45:
  mov    (%r12),%rdi
  add    $0x8,%r12
  call   <free@plt>
  cmp    %r12,%rbx
  jne    L45
  mov    %rbx,0x28(%rsp)
  cmp    $0x10,%r13d
  jne    L68
  mov    0xa8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L79
  add    $0xb8,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L79:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
void radixsort(int *l, int left, int right) {
  int i, j, k, d;
  int n = right - left + 1;
  int sizes[10] = {0};
  int counts[10];
  int **bucket;
  bucket = (int **)malloc(10 * sizeof(int *));
  for (k = 0; k < 16; k++) {
    for (d = 0; d < 10; d++) {
      sizes[d] = 0;
    }
    for (i = 0; i < n; i++) {
      d = (l[i] % power(10, k + 1)) / power(10, k);
      sizes[d]++;
    }
    for (d = 0; d < 10; d++) {
      bucket[d] = (int *)malloc(sizes[d] * sizeof(int));
    }
    for (j = 0; j < 10; j++)
      counts[j] = 0;
    for (i = 0; i < n; i++) {
      d = (l[i] % power(10, k + 1)) / power(10, k);
      bucket[d][counts[d]++] = l[i];
    }
    for (j = 0; j < 10; j++)
      counts[j] = 0;
    i = 0;
    for (d = 0; d < 10; d++) {
      for (j = 0; j < sizes[d]; j++) {
        l[i++] = bucket[d][j];
      }
    }
    for (d = 0; d < 10; d++) {
      free(bucket[d]);
    }
  }
}
```