user: 这段汇编代码用C语言表示是什么样的?

```asm
<find_missing>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbx
  sub    $0x78,%rsp
  mov    %rdi,-0x88(%rbp)
  mov    %rsi,-0x90(%rbp)
  mov    %rdx,-0x98(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x38(%rbp)
  xor    %eax,%eax
  mov    %rsp,%rax
  mov    %rax,%rbx
  mov    D4(%rip),%rax
  mov    (%rax),%rax
  cmp    %rax,-0x98(%rbp)
  jne    L2
  mov    $0x0,%eax
  jmp    L56
L2:
  mov    -0x90(%rbp),%rax
  shr    %rax
  add    $0x1,%rax
  mov    %rax,%rdx
  sub    $0x1,%rdx
  mov    %rdx,-0x58(%rbp)
  mov    %rax,%r14
  mov    $0x0,%r15d
  mov    %rax,%r12
  mov    $0x0,%r13d
  mov    $0x10,%edx
  sub    $0x1,%rdx
  add    %rdx,%rax
  mov    $0x10,%esi
  mov    $0x0,%edx
  div    %rsi
  imul   $0x10,%rax,%rax
  mov    %rax,%rcx
  and    $0xfffffffffffff000,%rcx
  mov    %rsp,%rdx
  sub    %rcx,%rdx
L103:
  cmp    %rdx,%rsp
  je     L0
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  jmp    L103
L0:
  mov    %rax,%rdx
  and    $0xfff,%edx
  sub    %rdx,%rsp
  mov    %rax,%rdx
  and    $0xfff,%edx
  test   %rdx,%rdx
  je     L26
  and    $0xfff,%eax
  sub    $0x8,%rax
  add    %rsp,%rax
  orq    $0x0,(%rax)
L26:
  mov    %rsp,%rax
  add    $0x0,%rax
  mov    %rax,-0x50(%rbp)
  movq   $0x0,-0x70(%rbp)
  mov    -0x90(%rbp),%rax
  shr    %rax
  add    $0x1,%rax
  mov    %rax,%rdx
  sub    $0x1,%rdx
  mov    %rdx,-0x48(%rbp)
  mov    %rax,%r10
  mov    $0x0,%r11d
  mov    %rax,%r8
  mov    $0x0,%r9d
  mov    $0x10,%edx
  sub    $0x1,%rdx
  add    %rdx,%rax
  mov    $0x10,%edi
  mov    $0x0,%edx
  div    %rdi
  imul   $0x10,%rax,%rax
  mov    %rax,%rcx
  and    $0xfffffffffffff000,%rcx
  mov    %rsp,%rdx
  sub    %rcx,%rdx
L88:
  cmp    %rdx,%rsp
  je     L93
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  jmp    L88
L93:
  mov    %rax,%rdx
  and    $0xfff,%edx
  sub    %rdx,%rsp
  mov    %rax,%rdx
  and    $0xfff,%edx
  test   %rdx,%rdx
  je     L8
  and    $0xfff,%eax
  sub    $0x8,%rax
  add    %rsp,%rax
  orq    $0x0,(%rax)
L8:
  mov    %rsp,%rax
  add    $0x0,%rax
  mov    %rax,-0x40(%rbp)
  movq   $0x0,-0x68(%rbp)
  movq   $0x0,-0x60(%rbp)
  jmp    L89
L68:
  mov    -0x88(%rbp),%rdx
  mov    -0x60(%rbp),%rax
  add    %rdx,%rax
  movzbl (%rax),%eax
  movzbl %al,%eax
  mov    -0x98(%rbp),%rdx
  mov    %edx,%ecx
  sar    %cl,%eax
  and    $0x1,%eax
  test   %eax,%eax
  je     L64
  mov    -0x88(%rbp),%rdx
  mov    -0x60(%rbp),%rax
  lea    (%rdx,%rax,1),%rcx
  mov    -0x68(%rbp),%rax
  lea    0x1(%rax),%rdx
  mov    %rdx,-0x68(%rbp)
  movzbl (%rcx),%ecx
  mov    -0x40(%rbp),%rdx
  mov    %cl,(%rdx,%rax,1)
  jmp    L104
L64:
  mov    -0x88(%rbp),%rdx
  mov    -0x60(%rbp),%rax
  lea    (%rdx,%rax,1),%rcx
  mov    -0x70(%rbp),%rax
  lea    0x1(%rax),%rdx
  mov    %rdx,-0x70(%rbp)
  movzbl (%rcx),%ecx
  mov    -0x50(%rbp),%rdx
  mov    %cl,(%rdx,%rax,1)
L104:
  addq   $0x1,-0x60(%rbp)
L89:
  mov    -0x60(%rbp),%rax
  cmp    -0x90(%rbp),%rax
  jb     L68
  mov    -0x70(%rbp),%rax
  cmp    -0x68(%rbp),%rax
  ja     L49
  mov    -0x98(%rbp),%rax
  lea    0x1(%rax),%rdx
  mov    -0x70(%rbp),%rcx
  mov    -0x50(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <find_missing>
  mov    %eax,-0x74(%rbp)
  mov    -0x74(%rbp),%eax
  add    %eax,%eax
  jmp    L56
L49:
  mov    -0x98(%rbp),%rax
  lea    0x1(%rax),%rdx
  mov    -0x68(%rbp),%rcx
  mov    -0x40(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <find_missing>
  mov    %eax,-0x78(%rbp)
  mov    -0x78(%rbp),%eax
  add    %eax,%eax
  or     $0x1,%eax
L56:
  mov    %rbx,%rsp
  mov    -0x38(%rbp),%rdx
  sub    %fs:0x28,%rdx
  je     L57
  call   <__stack_chk_fail@plt>
L57:
  lea    -0x28(%rbp),%rsp
  pop    %rbx
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  pop    %rbp
  ret
```

assistant: ```c
unsigned find_missing(unsigned char bit_array[], size_t array_sz, size_t col) {
  if (col == CHAR_BIT) {
    return 0;
  }
  unsigned char zeros[array_sz / 2 + 1];
  size_t zeros_i = 0;
  unsigned char ones[array_sz / 2 + 1];
  size_t ones_i = 0;
  size_t i;
  for (i = 0; i < array_sz; i++) {
    if (bit_array[i] & (1 << col)) {
      ones[ones_i++] = bit_array[i];
    } else {
      zeros[zeros_i++] = bit_array[i];
    }
  }
  if (zeros_i <= ones_i) {
    unsigned v = find_missing(zeros, zeros_i, col + 1);
    return v << 1;
  } else {
    unsigned v = find_missing(ones, ones_i, col + 1);
    return (v << 1) | 1;
  }
}
```