user: 下面的汇编指令对应的C源代码是什么:

```asm
<divide_polynomial>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x48,%rsp
  mov    %rdi,%r13
  mov    %rsi,0x10(%rsp)
  mov    %rdx,(%rsp)
  mov    %rcx,%r15
  mov    %r8,%rbp
  mov    %r9,0x8(%rsp)
  cmp    %r8,%r9
  jbe    L125
  test   %r8,%r8
  je     L65
  mov    $0x0,%eax
L85:
  movzbl 0x0(%r13,%rax,1),%edx
  mov    %dl,(%r15,%rax,1)
  add    $0x1,%rax
  cmp    %rbp,%rax
  jne    L85
L65:
  add    $0x48,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L125:
  mov    %r8,%rdi
  call   <malloc@plt>
  mov    %rax,%r14
  test   %rax,%rax
  je     L55
L9:
  mov    %rbp,%rdi
  call   <malloc@plt>
  mov    %rax,%r12
  test   %rax,%rax
  je     L6
L11:
  lea    -0x1(%rbp),%rbx
  mov    0x8(%rsp),%rax
  lea    (%rbx,%rax,1),%rdi
  imul   %rbp,%rdi
  call   <malloc@plt>
  mov    %rax,0x18(%rsp)
  test   %rax,%rax
  je     L0
L177:
  lea    0x1(%rbp),%rax
  sub    0x8(%rsp),%rax
  mov    %rax,0x20(%rsp)
  mov    %rax,%rdx
  mov    $0x0,%esi
  mov    (%rsp),%rdi
  call   <memset@plt>
  mov    0x8(%rsp),%rax
  lea    -0x1(%rax),%rcx
  mov    %rcx,%rdx
  mov    %rcx,0x30(%rsp)
  mov    %rbx,%rcx
  mov    0x18(%rsp),%rsi
  mov    0x10(%rsp),%rdi
  call   <gen_conv_matrix@plt>
  movslq %ebp,%rax
  lea    -0x1(%rax),%rcx
  mov    %rcx,0x28(%rsp)
  mov    $0x1,%eax
  sub    0x8(%rsp),%rax
  mov    %r15,0x38(%rsp)
  mov    %rax,%r15
  jmp    L110
L55:
  mov    $0x0,%eax
  call   <abort@plt>
  jmp    L9
L6:
  mov    $0x0,%eax
  call   <abort@plt>
  jmp    L11
L0:
  call   <abort@plt>
  jmp    L177
L27:
  mov    $0x0,%edx
L162:
  cmp    0x8(%rsp),%edx
  jl     L45
  movslq %ebx,%rbx
  mov    0x10(%rsp),%rax
  mov    0x30(%rsp),%rcx
  movzbl (%rax,%rcx,1),%esi
  movzbl (%r12,%rbx,1),%edi
  call   <divide@plt>
  add    (%rsp),%rbx
  mov    %al,(%rbx,%r15,1)
L110:
  mov    %rbp,%r8
  mov    0x20(%rsp),%rcx
  mov    (%rsp),%rdx
  mov    0x18(%rsp),%rsi
  mov    %r14,%rdi
  call   <inner_product_set@plt>
  test   %rbp,%rbp
  je     L38
  mov    $0x0,%ebx
L144:
  movzbl (%r14,%rbx,1),%esi
  movzbl 0x0(%r13,%rbx,1),%edi
  call   <sum@plt>
  mov    %al,(%r12,%rbx,1)
  add    $0x1,%rbx
  cmp    %rbx,%rbp
  jne    L144
L38:
  mov    %ebp,%ebx
  mov    0x28(%rsp),%rax
  add    %r12,%rax
L52:
  mov    %ebx,%edx
  sub    $0x1,%ebx
  cmp    $0xffffffff,%ebx
  je     L27
  sub    $0x1,%rax
  cmpb   $0x0,0x1(%rax)
  je     L52
  jmp    L162
L45:
  mov    0x38(%rsp),%r15
  test   %ebx,%ebx
  js     L42
  lea    0x1(%rbx),%ecx
  mov    $0x0,%eax
L69:
  movzbl (%r12,%rax,1),%edx
  mov    %dl,(%r15,%rax,1)
  add    $0x1,%rax
  cmp    %rax,%rcx
  jne    L69
L42:
  mov    %r14,%rdi
  call   <free@plt>
  mov    %r12,%rdi
  call   <free@plt>
  mov    0x18(%rsp),%rdi
  call   <free@plt>
  jmp    L65
```

assistant: ```c
void divide_polynomial(unsigned char *dividend, unsigned char *divisor, unsigned char *quotient, unsigned char *remainder, size_t dividend_len, size_t divisor_len) {
  if (divisor_len > dividend_len) {
    for (int i = 0; i < dividend_len; i++) {
      remainder[i] = dividend[i];
    }
    return;
  }
  unsigned char *quotient_divisor_product = malloc(dividend_len);
  if (!quotient_divisor_product)
    abort();
  unsigned char *product_dividend_difference = malloc(dividend_len);
  if (!product_dividend_difference)
    abort();
  unsigned char *divisor_conv = malloc(dividend_len * (dividend_len + divisor_len - 1));
  if (!divisor_conv)
    abort();
  size_t quotient_len = dividend_len - (divisor_len - 1);
  memset(quotient, 0, quotient_len);
  gen_conv_matrix(divisor, divisor_conv, divisor_len - 1, dividend_len - 1);
  for (;;) {
    inner_product_set(quotient_divisor_product, divisor_conv, quotient, quotient_len, dividend_len);
    for (int i = 0; i < dividend_len; i++) {
      product_dividend_difference[i] = sum(dividend[i], quotient_divisor_product[i]);
    }
    int diff_greatest_nonzero = dividend_len;
    for (;;) {
      diff_greatest_nonzero--;
      if (diff_greatest_nonzero == -1)
        break;
      if (product_dividend_difference[diff_greatest_nonzero])
        break;
    }
    if (diff_greatest_nonzero < (int)divisor_len - 1) {
      for (int i = 0; i <= diff_greatest_nonzero; i++) {
        remainder[i] = product_dividend_difference[i];
      }
      free(quotient_divisor_product);
      free(product_dividend_difference);
      free(divisor_conv);
      return;
    }
    unsigned char factor = divide(product_dividend_difference[diff_greatest_nonzero], divisor[divisor_len - 1]);
    quotient[diff_greatest_nonzero - (divisor_len - 1)] = factor;
  }
}
```