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

```asm
<run_test>:
  endbr64
  movabs $0x640000001e,%rsi
  push   %r14
  movabs $0x50000001e,%rdi
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  movabs $0x320000000a,%rbx
  sub    $0x70,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x68(%rsp)
  movabs $0x3200000000,%rax
  mov    %rsi,0x8(%rsp)
  movabs $0x500000000,%rsi
  mov    %rbx,0x10(%rsp)
  movabs $0x7fffffff00000014,%rbx
  mov    %rdi,0x28(%rsp)
  mov    $0x14,%edi
  mov    %rsi,0x18(%rsp)
  mov    %rbx,0x20(%rsp)
  movl   $0x0,0x60(%rsp)
  mov    %rax,(%rsp)
  mov    %rax,0x30(%rsp)
  movabs $0x647fffffff,%rax
  mov    %rax,0x38(%rsp)
  movabs $0x3200000014,%rax
  mov    %rax,0x40(%rsp)
  movabs $0xa00000000,%rax
  mov    %rax,0x48(%rsp)
  movabs $0x7fffffff0000000a,%rax
  mov    %rax,0x50(%rsp)
  movabs $0xa7fffffff,%rax
  mov    %rax,0x58(%rsp)
  call   <malloc@plt>
  mov    $0x14,%edi
  mov    %rax,%r12
  call   <malloc@plt>
  mov    $0x14,%edi
  mov    %rax,%rbp
  call   <malloc@plt>
  test   %r12,%r12
  sete   %bl
  test   %rbp,%rbp
  mov    %rax,%r13
  sete   %al
  or     %al,%bl
  jne    L21
  test   %r13,%r13
  jne    L54
  xor    %edi,%edi
  call   <assert@plt>
L83:
  mov    %r12,%rdi
  call   <free@plt>
  test   %rbp,%rbp
  jne    L22
L99:
  xor    %r14d,%r14d
  test   %r13,%r13
  jne    L109
L56:
  mov    0x68(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L88
  add    $0x70,%rsp
  mov    %r14d,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
  nopw   0x0(%rax,%rax,1)
L54:
  mov    %rsp,%rdx
  mov    %r13,%r9
  mov    %rbp,%r8
  mov    %r12,%rcx
  xor    %esi,%esi
  mov    $0x5,%edi
  call   <dijkstra_shortest@plt>
  mov    %rbp,%rax
  lea    0x14(%rbp),%rdx
L100:
  mov    (%rax),%ecx
  test   %ecx,%ecx
  je     L1
  add    $0x4,%rax
  cmp    %rax,%rdx
  jne    L100
  mov    $0x1,%ebx
L1:
  mov    %r12,%rax
  lea    0x14(%r12),%rsi
  mov    $0xffffffff,%edx
L59:
  mov    (%rax),%ecx
  cmp    %ecx,%edx
  cmovl  %ecx,%edx
  add    $0x4,%rax
  cmp    %rax,%rsi
  jne    L59
  xor    %r14d,%r14d
  cmp    $0x23,%edx
  sete   %r14b
  and    %ebx,%r14d
  mov    %r14d,%edi
  call   <assert@plt>
  mov    %r12,%rdi
  call   <free@plt>
  mov    %rbp,%rdi
  call   <free@plt>
L109:
  mov    %r13,%rdi
  call   <free@plt>
  jmp    L56
  nopw   0x0(%rax,%rax,1)
L21:
  xor    %edi,%edi
  call   <assert@plt>
  test   %r12,%r12
  jne    L83
  test   %rbp,%rbp
  je     L99
L22:
  mov    %rbp,%rdi
  call   <free@plt>
  jmp    L99
L88:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
int run_test(void) {
  int i;
  int max = -1;
  int all = 1;
  int n = 5;
  int adjMtx[25] = {
      0, 50, 30, 100, 10, 50, 0, 5, 20, 0x7fffffff, 30, 5, 0, 50, 0x7fffffff, 100, 20, 50, 0, 10, 10, 0x7fffffff, 0x7fffffff, 10, 0,
  };
  int *dist = (int *)malloc(n * sizeof(int));
  int *setv = (int *)malloc(n * sizeof(int));
  int *path = (int *)malloc(n * sizeof(int));
  if (dist == NULL || setv == NULL || path == NULL) {
    assert(0 && "not enough memory");
    if (dist)
      free(dist);
    if (setv)
      free(setv);
    if (path)
      free(path);
    return 0;
  }
  dijkstra_shortest(n, 0, adjMtx, dist, setv, path);
  for (i = 0; i < n; ++i) {
    if (setv[i] == 0) {
      all = 0;
      break;
    }
  }
  for (i = 0; i < n; ++i) {
    if (max < dist[i])
      max = dist[i];
  }
  assert(max == 35 && all == 1 && "algorithm wrong, can't pass the test!");
  free(dist);
  free(setv);
  free(path);
  return (max == 35 && all == 1) ? 1 : 0;
}
```