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

```asm
<lz_compress>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  mov    %rsi,%rbp
  push   %rbx
  movslq %edx,%rbx
  mov    %rbx,%r14
  sub    $0x48,%rsp
  mov    %rdi,0x28(%rsp)
  mov    $0x1d4ec,%edi
  mov    %fs:0x28,%rax
  mov    %rax,0x38(%rsp)
  xor    %eax,%eax
  call   <malloc@plt>
  mov    $0x1d4ec,%edx
  mov    $0xff,%esi
  mov    %rax,%rdi
  mov    %rax,%r12
  call   <memset@plt>
  lea    0x0(,%rbx,4),%edi
  call   <malloc@plt>
  mov    %rax,%r13
  test   %ebx,%ebx
  jle    L172
  lea    0x0(,%rbx,4),%rdx
  mov    $0xff,%esi
  mov    %rax,%rdi
  call   <memset@plt>
  lea    -0x2(%rbx),%r8d
  test   %r8d,%r8d
  jle    L145
  lea    -0x3(%rbx),%edi
  xor    %esi,%esi
  nopl   (%rax)
L176:
  mov    0x0(%rbp,%rsi,4),%eax
  mov    0x4(%rbp,%rsi,4),%edx
  shl    $0x10,%eax
  shl    $0x8,%edx
  or     %edx,%eax
  or     0x8(%rbp,%rsi,4),%eax
  movslq %eax,%rdx
  mov    %eax,%ecx
  imul   $0xffffffff8bc24683,%rdx,%rdx
  sar    $0x1f,%ecx
  shr    $0x20,%rdx
  add    %eax,%edx
  sar    $0xe,%edx
  sub    %ecx,%edx
  imul   $0x753b,%edx,%edx
  sub    %edx,%eax
  cltq
  lea    (%r12,%rax,4),%rax
  mov    (%rax),%edx
  mov    %edx,0x0(%r13,%rsi,4)
  mov    %esi,(%rax)
  mov    %rsi,%rax
  add    $0x1,%rsi
  cmp    %rdi,%rax
  jne    L176
  mov    %r14d,%eax
  movd   %r14d,%xmm3
  lea    0x4(%r14),%r15d
  mov    %r14d,%edi
  sar    $0x18,%eax
  sar    $0x8,%edi
  movd   %eax,%xmm0
  mov    %r14d,%eax
  movd   %edi,%xmm1
  sar    $0x10,%eax
  punpckldq %xmm3,%xmm1
  movd   %eax,%xmm4
  punpckldq %xmm4,%xmm0
  punpcklqdq %xmm1,%xmm0
L113:
  lea    -0x1(%r14),%eax
  mov    $0xff,%esi
  movaps %xmm0,(%rsp)
  xor    %ebx,%ebx
  sub    %r8d,%eax
  movslq %r8d,%r8
  lea    0x0(%r13,%r8,4),%rdi
  lea    0x4(,%rax,4),%rdx
  call   <memset@plt>
  mov    %r12,%rdi
  call   <free@plt>
  mov    %r15d,%edi
  call   <malloc@plt>
  movdqa (%rsp),%xmm0
  mov    %r13,(%rsp)
  mov    %r14d,%r13d
  mov    %rax,0x20(%rsp)
  lea    0x10(%rax),%r15
  movups %xmm0,(%rax)
  lea    0x30(%rsp),%rax
  mov    %rax,0x10(%rsp)
  jmp    L170
  nop
L34:
  mov    (%r14),%eax
  add    $0x4,%r15
  mov    %r8d,%ebx
  mov    %eax,-0x4(%r15)
L8:
  cmp    %r13d,%ebx
  jge    L17
L170:
  movslq %ebx,%rax
  lea    0x0(%rbp,%rax,4),%r14
  cmpl   $0x7f,(%r14)
  jg     L154
  mov    (%rsp),%rcx
  mov    0x10(%rsp),%rdi
  mov    %ebx,%r8d
  mov    %r13d,%edx
  mov    %rbp,%rsi
  call   <find_longest_match@plt>
  lea    0x1(%rbx),%r8d
  mov    %eax,%r12d
  cmp    $0x2,%eax
  jle    L34
  mov    (%rsp),%rcx
  lea    0x34(%rsp),%rdi
  mov    %r13d,%edx
  mov    %rbp,%rsi
  mov    %r8d,0x1c(%rsp)
  call   <find_longest_match@plt>
  mov    0x1c(%rsp),%r8d
  cmp    %eax,%r12d
  jl     L34
  cmp    $0x12,%r12d
  jg     L104
  mov    0x30(%rsp),%ecx
  cmp    $0x3ff,%ecx
  jg     L104
  lea    -0x3(%r12),%eax
  add    %r12d,%ebx
  add    $0x8,%r15
  shl    $0xa,%eax
  or     %ecx,%eax
  or     $0x80,%ah
  movslq %eax,%rcx
  movd   %eax,%xmm5
  shr    $0x8,%rcx
  movd   %ecx,%xmm0
  punpckldq %xmm5,%xmm0
  movq   %xmm0,-0x8(%r15)
  cmp    %r13d,%ebx
  jl     L170
L17:
  mov    (%rsp),%r13
L78:
  mov    %r13,%rdi
  call   <free@plt>
  mov    0x28(%rsp),%rax
  mov    0x20(%rsp),%rdi
  mov    %rdi,(%rax)
  mov    %r15,%rax
  sub    %rdi,%rax
  sar    $0x2,%rax
  jmp    L148
  nopl   0x0(%rax)
L104:
  lea    -0x4(%r12),%eax
  cmp    $0x3f,%eax
  ja     L34
  mov    0x30(%rsp),%ecx
  cmp    $0xffff,%ecx
  jg     L34
  shl    $0x10,%eax
  add    %r12d,%ebx
  add    $0xc,%r15
  or     %ecx,%eax
  or     $0xc00000,%eax
  movslq %eax,%rcx
  mov    %eax,-0x4(%r15)
  mov    %rcx,%rdi
  shr    $0x8,%rcx
  shr    $0x10,%rdi
  movd   %ecx,%xmm2
  movq   %rdi,%xmm0
  punpckldq %xmm2,%xmm0
  movq   %xmm0,-0xc(%r15)
  jmp    L8
L154:
  mov    $0xffffffff,%eax
L148:
  mov    0x38(%rsp),%rdx
  sub    %fs:0x28,%rdx
  jne    L33
  add    $0x48,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L172:
  mov    %ebx,%eax
  movd   %r14d,%xmm6
  mov    %r12,%rdi
  sar    $0x18,%eax
  movd   %eax,%xmm0
  mov    %ebx,%eax
  sar    $0x8,%ebx
  sar    $0x10,%eax
  movd   %ebx,%xmm1
  movd   %eax,%xmm7
  punpckldq %xmm6,%xmm1
  punpckldq %xmm7,%xmm0
  punpcklqdq %xmm1,%xmm0
  movaps %xmm0,(%rsp)
  call   <free@plt>
  lea    0x4(%r14),%edi
  call   <malloc@plt>
  movdqa (%rsp),%xmm0
  mov    %rax,0x20(%rsp)
  lea    0x10(%rax),%r15
  movups %xmm0,(%rax)
  jmp    L78
L145:
  mov    %ebx,%eax
  lea    0x4(%rbx),%r15d
  movd   %r14d,%xmm6
  xor    %r8d,%r8d
  sar    $0x18,%eax
  movd   %eax,%xmm0
  mov    %ebx,%eax
  sar    $0x8,%ebx
  sar    $0x10,%eax
  movd   %ebx,%xmm1
  movd   %eax,%xmm7
  punpckldq %xmm6,%xmm1
  punpckldq %xmm7,%xmm0
  punpcklqdq %xmm1,%xmm0
  jmp    L113
L33:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
int lz_compress(uint8_t **pdst, const uint8_t *src, int src_len) {
  int *hash_table, *hash_next;
  uint32_t h, v;
  int i, dist, len, len1, dist1;
  uint8_t *dst, *q;
  hash_table = malloc(sizeof(hash_table[0]) * 30011);
  for (i = 0; i < 30011; i++)
    hash_table[i] = -1;
  hash_next = malloc(sizeof(hash_next[0]) * src_len);
  for (i = 0; i < src_len; i++)
    hash_next[i] = -1;
  for (i = 0; i < src_len - 3 + 1; i++) {
    h = ((src[i] << 16) | (src[i + 1] << 8) | src[i + 2]) % 30011;
    hash_next[i] = hash_table[h];
    hash_table[h] = i;
  }
  for (; i < src_len; i++) {
    hash_next[i] = -1;
  }
  free(hash_table);
  dst = malloc(src_len + 4);
  q = dst;
  *q++ = src_len >> 24;
  *q++ = src_len >> 16;
  *q++ = src_len >> 8;
  *q++ = src_len >> 0;
  i = 0;
  while (i < src_len) {
    if (src[i] >= 128)
      return -1;
    len = find_longest_match(&dist, src, src_len, hash_next, i);
    if (len >= 3) {
      len1 = find_longest_match(&dist1, src, src_len, hash_next, i + 1);
      if (len1 > len)
        goto no_match;
    }
    if (len < 3) {
    no_match:
      *q++ = src[i];
      i++;
    } else if (len <= (3 + 15) && dist < (1 << 10)) {
      v = 0x8000 | ((len - 3) << 10) | dist;
      *q++ = v >> 8;
      *q++ = v;
      i += len;
    } else if (len >= 4 && len <= (4 + 63) && dist < (1 << 16)) {
      v = 0xc00000 | ((len - 4) << 16) | dist;
      *q++ = v >> 16;
      *q++ = v >> 8;
      *q++ = v;
      i += len;
    } else {
      goto no_match;
    }
  }
  free(hash_next);
  *pdst = dst;
  return q - dst;
}
```