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

```asm
<bucketSort>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x249000(%rsp),%r11
L59:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L59
  sub    $0xf28,%rsp
  mov    $0x1,%r13d
  mov    %fs:0x28,%rax
  mov    %rax,0x249f18(%rsp)
  xor    %eax,%eax
  mov    %rdi,%r12
  lea    0xc3510(%rsp),%rax
  lea    0x10(%rsp),%rbx
  mov    %rax,0x8(%rsp)
  lea    0x61a90(%rsp),%rbp
  lea    0x61a80(%rdi),%r14
  lea    0x2ab990(%rsp),%r15
L10:
  mov    $0x61a80,%edx
  xor    %esi,%esi
  mov    %rbx,%rdi
  call   <memset@plt>
  mov    $0xff,%esi
  mov    $0x1e8480,%edx
  mov    %rbp,%rdi
  call   <memset@plt>
  mov    %r12,%rsi
  nopw   0x0(%rax,%rax,1)
L54:
  mov    (%rsi),%edi
  add    $0x4,%rsi
  mov    %edi,%eax
  cltd
  idiv   %r13d
  movslq %eax,%rdx
  mov    %eax,%r8d
  imul   $0x66666667,%rdx,%rdx
  sar    $0x1f,%r8d
  sar    $0x21,%rdx
  sub    %r8d,%edx
  lea    (%rdx,%rdx,4),%r8d
  sub    %r8d,%eax
  movslq %eax,%rdx
  movslq 0x10(%rsp,%rdx,4),%r9
  imul   $0x186a0,%rdx,%r8
  mov    %r9,%rax
  add    %r9,%r8
  add    $0x1,%eax
  mov    %edi,0x61a90(%rsp,%r8,4)
  mov    %eax,0x10(%rsp,%rdx,4)
  cmp    %rsi,%r14
  jne    L54
  mov    0x8(%rsp),%r8
  xor    %esi,%esi
L2:
  lea    -0x61a80(%r8),%rax
  nopw   0x0(%rax,%rax,1)
L31:
  mov    (%rax),%edx
  cmp    $0xffffffff,%edx
  je     L64
  movslq %esi,%rdi
  add    $0x1,%esi
  mov    %edx,(%r12,%rdi,4)
L64:
  add    $0x4,%rax
  cmp    %rax,%r8
  jne    L31
  add    $0x61a80,%r8
  cmp    %r8,%r15
  jne    L2
  cmpl   $0x1869f,0x10(%rsp)
  lea    0x0(%r13,%r13,4),%r13d
  jle    L10
  mov    0x249f18(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L45
  add    $0x249f28,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L45:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
void bucketSort(int *vetor) {
  int matrix_bucketsort[5][100000], vetor_auxiliar[100000];
  int i, j, k = 0, contador = 1, n;
  do {
    k = 0;
#pragma omp parallel num_threads(N_THREADS) shared(vetor_auxiliar) private(i)
    {
#pragma omp for schedule(dynamic, 1)
      for (i = 0; i < 100000; i++) {
        vetor_auxiliar[i] = 0;
      }
    }
#pragma omp parallel num_threads(N_THREADS) shared(matrix_bucketsort) private(i, j)
    {
#pragma omp for schedule(dynamic, 1)
      for (i = 0; i < 5; i++) {
        for (j = 0; j < 100000; j++) {
          matrix_bucketsort[i][j] = -1;
        }
      }
    }
#pragma omp parallel num_threads(N_THREADS) shared(matrix_bucketsort, vetor_auxiliar) private(i, n)
    {
#pragma omp for ordered schedule(dynamic, 1)
      for (i = 0; i < 100000; i++) {
        n = (vetor[i] / contador) % 5;
        matrix_bucketsort[n][vetor_auxiliar[n]] = vetor[i];
        vetor_auxiliar[n]++;
      }
    }
#pragma omp parallel num_threads(N_THREADS) shared(matrix_bucketsort, vetor) private(i, j)
    {
#pragma omp for ordered schedule(dynamic, 1)
      for (i = 0; i < 5; i++) {
        for (j = 0; j < 100000; j++) {
          if (matrix_bucketsort[i][j] != -1) {
#pragma omp critical
            {
              vetor[k] = matrix_bucketsort[i][j];
              k++;
            }
          }
        }
      }
    }
    contador = contador * 5;
  } while (vetor_auxiliar[0] < 100000);
}
```