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

```asm
<qsortx>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x208,%rsp
  mov    %edx,0x8(%rsp)
  mov    %fs:0x28,%rax
  mov    %rax,0x1f8(%rsp)
  xor    %eax,%eax
  cmp    $0x1,%esi
  jbe    L58
  mov    %rdi,%rbp
  mov    %rcx,%r12
  test   %edx,%edx
  je     L58
  sub    $0x1,%esi
  imul   %edx,%esi
  lea    (%rdi,%rsi,1),%r15
  movl   $0x0,0xc(%rsp)
  mov    %edx,%eax
  mov    %rax,(%rsp)
  mov    %rax,%r13
  neg    %r13
  jmp    L140
L61:
  mov    %r14,%rbp
  jmp    L140
L7:
  shr    %eax
  mov    0x8(%rsp),%edx
  imul   %edx,%eax
  lea    0x0(%rbp,%rax,1),%rdi
  mov    %rbp,%rsi
  call   <swap@plt>
  mov    (%rsp),%rax
  lea    (%r15,%rax,1),%rbx
  mov    %rbp,%r14
  jmp    L132
L100:
  add    %r13,%rbx
  cmp    %rbx,%rbp
  jae    L147
  mov    %rbp,%rsi
  mov    %rbx,%rdi
  call   *%r12
  test   %eax,%eax
  jns    L100
L147:
  cmp    %rbx,%r14
  ja     L4
  mov    0x8(%rsp),%edx
  mov    %rbx,%rsi
  mov    %r14,%rdi
  call   <swap@plt>
L132:
  add    (%rsp),%r14
  cmp    %r14,%r15
  jb     L100
  mov    %rbp,%rsi
  mov    %r14,%rdi
  call   *%r12
  test   %eax,%eax
  jg     L100
  jmp    L132
L4:
  mov    0x8(%rsp),%edx
  mov    %rbx,%rsi
  mov    %rbp,%rdi
  call   <swap@plt>
  lea    -0x1(%rbx),%rax
  sub    %rbp,%rax
  mov    %r15,%rdx
  sub    %r14,%rdx
  cmp    %rdx,%rax
  jl     L26
  mov    (%rsp),%rax
  add    %rbp,%rax
  cmp    %rax,%rbx
  jbe    L185
  mov    0xc(%rsp),%ecx
  movslq %ecx,%rax
  mov    %rbp,0x10(%rsp,%rax,8)
  add    %r13,%rbx
  mov    %rbx,0x100(%rsp,%rax,8)
  add    $0x1,%ecx
  mov    %ecx,0xc(%rsp)
L185:
  cmp    %r14,%r15
  ja     L61
L108:
  subl   $0x1,0xc(%rsp)
  mov    0xc(%rsp),%eax
  js     L58
  cltq
  mov    0x10(%rsp,%rax,8),%rbp
  mov    0x100(%rsp,%rax,8),%r15
L140:
  mov    %r15,%rax
  sub    %rbp,%rax
  cqto
  idivq  (%rsp)
  add    $0x1,%eax
  cmp    $0x8,%eax
  ja     L7
  mov    %r12,%rcx
  mov    0x8(%rsp),%edx
  mov    %r15,%rsi
  mov    %rbp,%rdi
  call   <shortsort@plt>
  jmp    L108
L26:
  cmp    %r14,%r15
  jbe    L30
  mov    0xc(%rsp),%ecx
  movslq %ecx,%rax
  mov    %r14,0x10(%rsp,%rax,8)
  mov    %r15,0x100(%rsp,%rax,8)
  add    $0x1,%ecx
  mov    %ecx,0xc(%rsp)
L30:
  mov    (%rsp),%rax
  add    %rbp,%rax
  lea    (%rbx,%r13,1),%r15
  cmp    %rax,%rbx
  jbe    L108
  jmp    L140
L58:
  mov    0x1f8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L141
  add    $0x208,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L141:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
void qsortx(void *base, unsigned num, unsigned width, int (*comp)(const void *, const void *)) {
  char *lo, *hi;
  char *mid;
  char *loguy, *higuy;
  unsigned size;
  char *lostk[30], *histk[30];
  int stkptr;
  if (num < 2 || width == 0)
    return;
  stkptr = 0;
  lo = base;
  hi = (char *)base + width * (num - 1);
recurse:
  size = (hi - lo) / width + 1;
  if (size <= 8) {
    shortsort(lo, hi, width, comp);
  } else {
    mid = lo + (size / 2) * width;
    swap(mid, lo, width);
    loguy = lo;
    higuy = hi + width;
    for (;;) {
      do {
        loguy += width;
      } while (loguy <= hi && comp(loguy, lo) <= 0);
      do {
        higuy -= width;
      } while (higuy > lo && comp(higuy, lo) >= 0);
      if (higuy < loguy)
        break;
      swap(loguy, higuy, width);
    }
    swap(lo, higuy, width);
    if (higuy - 1 - lo >= hi - loguy) {
      if (lo + width < higuy) {
        lostk[stkptr] = lo;
        histk[stkptr] = higuy - width;
        ++stkptr;
      }
      if (loguy < hi) {
        lo = loguy;
        goto recurse;
      }
    } else {
      if (loguy < hi) {
        lostk[stkptr] = loguy;
        histk[stkptr] = hi;
        ++stkptr;
      }
      if (lo + width < higuy) {
        hi = higuy - width;
        goto recurse;
      }
    }
  }
  --stkptr;
  if (stkptr >= 0) {
    lo = lostk[stkptr];
    hi = histk[stkptr];
    goto recurse;
  } else
    return;
}
```