user: 请将以下的汇编代码转换成C语言代码:

```asm
<divide_polynomial>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  mov    %rdi,%rbp
  push   %rbx
  mov    %r8,%rbx
  sub    $0x58,%rsp
  mov    %rsi,0x8(%rsp)
  mov    %rcx,0x48(%rsp)
  cmp    %r8,%r9
  jbe    L103
  test   %r8,%r8
  je     L122
  xor    %eax,%eax
  xchg   %ax,%ax
L98:
  movzbl 0x0(%rbp,%rax,1),%edx
  mov    %dl,(%rcx,%rax,1)
  add    $0x1,%rax
  cmp    %rax,%rbx
  jne    L98
L122:
  add    $0x58,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L103:
  mov    %r8,%rdi
  mov    %r9,0x10(%rsp)
  mov    %rdx,%r14
  call   <malloc@plt>
  mov    0x10(%rsp),%r9
  test   %rax,%rax
  mov    %rax,%r13
  je     L56
L17:
  mov    %rbx,%rdi
  mov    %r9,0x10(%rsp)
  call   <malloc@plt>
  mov    0x10(%rsp),%r9
  test   %rax,%rax
  mov    %rax,%r12
  je     L101
L32:
  lea    -0x1(%rbx),%r15
  mov    %r9,0x18(%rsp)
  lea    (%r15,%r9,1),%rdi
  imul   %rbx,%rdi
  call   <malloc@plt>
  mov    0x18(%rsp),%r9
  test   %rax,%rax
  mov    %rax,0x10(%rsp)
  je     L83
L25:
  lea    0x1(%rbx),%rax
  xor    %esi,%esi
  mov    %r14,%rdi
  mov    %r9,0x18(%rsp)
  sub    %r9,%rax
  mov    %rax,%rdx
  mov    %rax,0x20(%rsp)
  call   <memset@plt>
  mov    0x18(%rsp),%r9
  mov    0x10(%rsp),%rsi
  mov    %r15,%rcx
  mov    0x8(%rsp),%rdi
  lea    -0x1(%r9),%rax
  mov    %rax,%rdx
  mov    %rax,0x38(%rsp)
  call   <gen_conv_matrix@plt>
  movslq %ebx,%rax
  mov    0x18(%rsp),%r9
  mov    %eax,0x18(%rsp)
  sub    $0x1,%rax
  mov    %rax,0x30(%rsp)
  mov    $0x1,%eax
  sub    %r9,%rax
  mov    %r9d,0x2c(%rsp)
  mov    %rax,0x40(%rsp)
L15:
  mov    0x20(%rsp),%rcx
  mov    0x10(%rsp),%rsi
  mov    %rbx,%r8
  mov    %r14,%rdx
  mov    %r13,%rdi
  xor    %r15d,%r15d
  call   <inner_product_set@plt>
  test   %rbx,%rbx
  je     L156
L130:
  movzbl 0x0(%r13,%r15,1),%esi
  movzbl 0x0(%rbp,%r15,1),%edi
  call   <sum@plt>
  mov    %al,(%r12,%r15,1)
  add    $0x1,%r15
  cmp    %rbx,%r15
  jne    L130
L156:
  mov    0x30(%rsp),%rax
  lea    (%r12,%rax,1),%rdx
  mov    0x18(%rsp),%eax
  jmp    L124
  nopl   (%rax)
L48:
  sub    $0x1,%rdx
  cmpb   $0x0,0x1(%rdx)
  jne    L138
L124:
  mov    %eax,%ecx
  sub    $0x1,%eax
  jae    L48
  xor    %ecx,%ecx
L138:
  cmp    0x2c(%rsp),%ecx
  jl     L129
  mov    0x38(%rsp),%rcx
  movslq %eax,%r15
  mov    0x8(%rsp),%rax
  movzbl (%r12,%r15,1),%edi
  movzbl (%rax,%rcx,1),%esi
  call   <divide@plt>
  mov    0x40(%rsp),%rcx
  mov    %eax,%r8d
  lea    (%r14,%r15,1),%rax
  mov    %r8b,(%rax,%rcx,1)
  jmp    L15
  nopl   0x0(%rax)
L129:
  cmp    $0xffffffff,%eax
  je     L47
  add    $0x1,%eax
  mov    0x48(%rsp),%rdi
  mov    %r12,%rsi
  movslq %eax,%rdx
  call   <memcpy@plt>
L47:
  mov    %r13,%rdi
  call   <free@plt>
  mov    %r12,%rdi
  call   <free@plt>
  mov    0x10(%rsp),%rdi
  add    $0x58,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  jmp    10d0 <free@plt>
L56:
  xor    %eax,%eax
  call   <abort@plt>
  mov    0x10(%rsp),%r9
  jmp    L17
L101:
  xor    %eax,%eax
  call   <abort@plt>
  mov    0x10(%rsp),%r9
  jmp    L32
L83:
  call   <abort@plt>
  mov    0x18(%rsp),%r9
  jmp    L25
```

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;
  }
}
```