user: Translate the below assembly code into C programming language:

```asm
<minPathSum>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbx
  mov    %esi,%ebx
  sub    $0x48,%rsp
  mov    %edx,-0x44(%rbp)
  mov    %rdi,-0x60(%rbp)
  mov    %rsp,%rcx
  mov    %fs:0x28,%rax
  mov    %rax,-0x38(%rbp)
  xor    %eax,%eax
  lea    0x1(%rsi),%eax
  movslq %eax,%r15
  mov    %eax,-0x48(%rbp)
  lea    0x0(,%r15,8),%rax
  mov    %rax,-0x58(%rbp)
  add    $0xf,%rax
  mov    %rax,%rdx
  and    $0xfffffffffffff000,%rax
  sub    %rax,%rcx
  and    $0xfffffffffffffff0,%rdx
  cmp    %rcx,%rsp
  je     L68
L5:
  sub    $0x1000,%rsp
  orq    $0x0,0xff8(%rsp)
  cmp    %rcx,%rsp
  jne    L5
L68:
  and    $0xfff,%edx
  sub    %rdx,%rsp
  test   %rdx,%rdx
  jne    L111
L94:
  lea    0x7(%rsp),%r9
  xor    %r15d,%r15d
  mov    %r9,%rax
  and    $0xfffffffffffffff8,%r9
  shr    $0x3,%rax
  mov    %r9,%r12
  mov    %rax,-0x68(%rbp)
  movslq -0x44(%rbp),%rax
  mov    %rax,-0x50(%rbp)
  lea    0x0(,%rax,4),%r13
  lea    0x4(,%rax,4),%r14d
  test   %ebx,%ebx
  js     L67
  nopl   0x0(%rax,%rax,1)
L133:
  mov    %r14d,%edi
  call   <malloc@plt>
  mov    %rax,(%r12,%r15,8)
  add    $0x1,%r15
  cmp    %r15d,%ebx
  jge    L133
  mov    -0x48(%rbp),%edx
  mov    %r12,%rax
  lea    (%r12,%rdx,8),%rcx
  nop
L105:
  mov    (%rax),%rdx
  add    $0x8,%rax
  movl   $0x7fffffff,(%rdx,%r13,1)
  cmp    %rcx,%rax
  jne    L105
L67:
  movslq %ebx,%rax
  mov    (%r12,%rax,8),%rcx
  mov    -0x44(%rbp),%eax
  test   %eax,%eax
  js     L8
  mov    -0x44(%rbp),%edx
  mov    %rcx,%rax
  lea    0x4(%rcx,%rdx,4),%rdx
  nopl   (%rax)
L77:
  movl   $0x7fffffff,(%rax)
  add    $0x4,%rax
  cmp    %rax,%rdx
  jne    L77
L8:
  lea    -0x1(%rbx),%eax
  mov    -0x50(%rbp),%rdi
  movslq %eax,%rbx
  mov    (%r12,%rbx,8),%rdx
  movl   $0x0,(%rdx,%rdi,4)
  movl   $0x0,-0x4(%rcx,%r13,1)
  test   %eax,%eax
  js     L18
  mov    -0x60(%rbp),%rax
  mov    -0x44(%rbp),%r9d
  mov    -0x58(%rbp),%rdi
  sub    $0x1,%r9d
  lea    -0x10(%rax,%rdi,1),%r13
  mov    -0x50(%rbp),%rax
  mov    %r9d,%edx
  movslq %r9d,%r14
  shl    $0x2,%r14
  sub    %rdx,%rax
  lea    -0x8(,%rax,4),%r15
  nop
L134:
  test   %r9d,%r9d
  js     L136
  lea    0x1(%rbx),%eax
  mov    (%r12,%rbx,8),%rdi
  mov    0x0(%r13),%r10
  cltq
  mov    (%r12,%rax,8),%r11
  mov    %r14,%rax
  nopl   0x0(%rax)
L22:
  mov    (%r11,%rax,1),%ecx
  mov    (%r10,%rax,1),%edx
  mov    0x4(%rdi,%rax,1),%esi
  lea    (%rsi,%rdx,1),%r8d
  add    %ecx,%edx
  cmp    %ecx,%esi
  cmovl  %r8d,%edx
  mov    %edx,(%rdi,%rax,1)
  sub    $0x4,%rax
  cmp    %rax,%r15
  jne    L22
L136:
  sub    $0x1,%rbx
  sub    $0x8,%r13
  test   %ebx,%ebx
  jns    L134
L18:
  mov    -0x68(%rbp),%rax
  mov    0x0(,%rax,8),%rax
  mov    (%rax),%eax
  mov    -0x38(%rbp),%rdx
  sub    %fs:0x28,%rdx
  jne    L54
  lea    -0x28(%rbp),%rsp
  pop    %rbx
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  pop    %rbp
  ret
L111:
  orq    $0x0,-0x8(%rsp,%rdx,1)
  jmp    L94
L54:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
int minPathSum(int **grid, int m, int n) {
  int *p[m + 1];
  for (int i = 0; i < m + 1; i++)
    p[i] = (int *)malloc((n + 1) * sizeof(int));
  for (int i = 0; i < m + 1; i++)
    p[i][n] = 2147483647;
  for (int i = i; i < n + 1; i++)
    p[m][i] = 2147483647;
  p[m][n - 1] = p[m - 1][n] = 0;
  for (int i = m - 1; i >= 0; i--)
    for (int j = n - 1; j >= 0; j--) {
      p[i][j] = p[i][j + 1] < p[i + 1][j] ? p[i][j + 1] + grid[i][j] : p[i + 1][j] + grid[i][j];
    }
  return p[0][0];
}
```