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

```asm
<mergeSort>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  sub    $0x50,%rsp
  mov    %rdi,-0x38(%rbp)
  mov    %esi,-0x3c(%rbp)
  mov    %edx,-0x40(%rbp)
  mov    %ecx,-0x44(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x8(%rbp)
  xor    %eax,%eax
  mov    %rsp,%rax
  mov    %rax,%rsi
  mov    -0x44(%rbp),%eax
  add    $0x1,%eax
  movslq %eax,%rdx
  sub    $0x1,%rdx
  mov    %rdx,-0x18(%rbp)
  movslq %eax,%rdx
  mov    %rdx,%r10
  mov    $0x0,%r11d
  movslq %eax,%rdx
  mov    %rdx,%r8
  mov    $0x0,%r9d
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    $0x10,%eax
  sub    $0x1,%rax
  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
L49:
  cmp    %rdx,%rsp
  je     L22
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  jmp    L49
L22:
  mov    %rax,%rdx
  and    $0xfff,%edx
  sub    %rdx,%rsp
  mov    %rax,%rdx
  and    $0xfff,%edx
  test   %rdx,%rdx
  je     L18
  and    $0xfff,%eax
  sub    $0x8,%rax
  add    %rsp,%rax
  orq    $0x0,(%rax)
L18:
  mov    %rsp,%rax
  add    $0x3,%rax
  shr    $0x2,%rax
  shl    $0x2,%rax
  mov    %rax,-0x10(%rbp)
  mov    -0x3c(%rbp),%eax
  mov    %eax,-0x1c(%rbp)
  mov    -0x3c(%rbp),%eax
  mov    %eax,-0x28(%rbp)
  mov    -0x40(%rbp),%eax
  add    $0x1,%eax
  mov    %eax,-0x24(%rbp)
  jmp    L15
L93:
  mov    -0x1c(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%edx
  mov    -0x24(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rcx
  mov    -0x38(%rbp),%rax
  add    %rcx,%rax
  mov    (%rax),%eax
  cmp    %eax,%edx
  jg     L13
  mov    -0x1c(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%ecx
  mov    -0x10(%rbp),%rax
  mov    -0x28(%rbp),%edx
  movslq %edx,%rdx
  mov    %ecx,(%rax,%rdx,4)
  addl   $0x1,-0x1c(%rbp)
  jmp    L95
L13:
  mov    -0x24(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%ecx
  mov    -0x10(%rbp),%rax
  mov    -0x28(%rbp),%edx
  movslq %edx,%rdx
  mov    %ecx,(%rax,%rdx,4)
  addl   $0x1,-0x24(%rbp)
L95:
  addl   $0x1,-0x28(%rbp)
L15:
  mov    -0x1c(%rbp),%eax
  cmp    -0x40(%rbp),%eax
  jg     L24
  mov    -0x24(%rbp),%eax
  cmp    -0x44(%rbp),%eax
  jle    L93
L24:
  mov    -0x1c(%rbp),%eax
  cmp    -0x40(%rbp),%eax
  jle    L79
  mov    -0x24(%rbp),%eax
  mov    %eax,-0x20(%rbp)
  jmp    L52
L12:
  mov    -0x20(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%ecx
  mov    -0x10(%rbp),%rax
  mov    -0x28(%rbp),%edx
  movslq %edx,%rdx
  mov    %ecx,(%rax,%rdx,4)
  addl   $0x1,-0x28(%rbp)
  addl   $0x1,-0x20(%rbp)
L52:
  mov    -0x20(%rbp),%eax
  cmp    -0x44(%rbp),%eax
  jle    L12
  jmp    L69
L79:
  mov    -0x1c(%rbp),%eax
  mov    %eax,-0x20(%rbp)
  jmp    L85
L55:
  mov    -0x20(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  add    %rdx,%rax
  mov    (%rax),%ecx
  mov    -0x10(%rbp),%rax
  mov    -0x28(%rbp),%edx
  movslq %edx,%rdx
  mov    %ecx,(%rax,%rdx,4)
  addl   $0x1,-0x28(%rbp)
  addl   $0x1,-0x20(%rbp)
L85:
  mov    -0x20(%rbp),%eax
  cmp    -0x40(%rbp),%eax
  jle    L55
L69:
  mov    -0x3c(%rbp),%eax
  mov    %eax,-0x20(%rbp)
  jmp    L112
L86:
  mov    -0x20(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x38(%rbp),%rax
  lea    (%rdx,%rax,1),%rcx
  mov    -0x10(%rbp),%rax
  mov    -0x20(%rbp),%edx
  movslq %edx,%rdx
  mov    (%rax,%rdx,4),%eax
  mov    %eax,(%rcx)
  addl   $0x1,-0x20(%rbp)
L112:
  mov    -0x20(%rbp),%eax
  cmp    -0x44(%rbp),%eax
  jle    L86
  mov    %rsi,%rsp
  nop
  mov    -0x8(%rbp),%rax
  sub    %fs:0x28,%rax
  je     L167
  call   <__stack_chk_fail@plt>
L167:
  leave
  ret
```

assistant: ```c
void mergeSort(int arr[], int low, int mid, int high) {
  int i, m, k, l, temp[high + 1];
  l = low;
  i = low;
  m = mid + 1;
  while ((l <= mid) && (m <= high)) {
    if (arr[l] <= arr[m]) {
      temp[i] = arr[l];
      l++;
    } else {
      temp[i] = arr[m];
      m++;
    }
    i++;
  }
  if (l > mid) {
    for (k = m; k <= high; k++) {
      temp[i] = arr[k];
      i++;
    }
  } else {
    for (k = l; k <= mid; k++) {
      temp[i] = arr[k];
      i++;
    }
  }
  for (k = low; k <= high; k++) {
    arr[k] = temp[k];
  }
}
```