user: Converte this assembly snippet into its equivalent C code:

```asm
<run_test>:
  endbr64
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x78,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x68(%rsp)
  xor    %eax,%eax
  movl   $0x0,(%rsp)
  movl   $0x32,0x4(%rsp)
  movl   $0x1e,0x8(%rsp)
  movl   $0x64,0xc(%rsp)
  movl   $0xa,0x10(%rsp)
  movl   $0x32,0x14(%rsp)
  movl   $0x0,0x18(%rsp)
  movl   $0x5,0x1c(%rsp)
  movl   $0x14,0x20(%rsp)
  movl   $0x7fffffff,0x24(%rsp)
  movl   $0x1e,0x28(%rsp)
  movl   $0x5,0x2c(%rsp)
  movl   $0x0,0x30(%rsp)
  movl   $0x32,0x34(%rsp)
  movl   $0x7fffffff,0x38(%rsp)
  movl   $0x64,0x3c(%rsp)
  movl   $0x14,0x40(%rsp)
  movl   $0x32,0x44(%rsp)
  movl   $0x0,0x48(%rsp)
  movl   $0xa,0x4c(%rsp)
  movl   $0xa,0x50(%rsp)
  movl   $0x7fffffff,0x54(%rsp)
  movl   $0x7fffffff,0x58(%rsp)
  movl   $0xa,0x5c(%rsp)
  movl   $0x0,0x60(%rsp)
  mov    $0x14,%edi
  call   <malloc@plt>
  mov    %rax,%rbp
  mov    $0x14,%edi
  call   <malloc@plt>
  mov    %rax,%rbx
  mov    $0x14,%edi
  call   <malloc@plt>
  mov    %rax,%r12
  test   %rbp,%rbp
  sete   %al
  test   %rbx,%rbx
  sete   %dl
  or     %dl,%al
  jne    L44
  test   %r12,%r12
  je     L44
  mov    %rsp,%rdx
  mov    %r12,%r9
  mov    %rbx,%r8
  mov    %rbp,%rcx
  mov    $0x0,%esi
  mov    $0x5,%edi
  call   <dijkstra_shortest@plt>
  mov    %rbx,%rax
  lea    0x14(%rbx),%rdx
L22:
  mov    (%rax),%esi
  test   %esi,%esi
  je     L86
  add    $0x4,%rax
  cmp    %rdx,%rax
  jne    L22
  mov    $0x1,%esi
L86:
  mov    %rbp,%rax
  lea    0x14(%rbp),%rdi
  mov    $0xffffffff,%edx
L129:
  mov    (%rax),%ecx
  cmp    %ecx,%edx
  cmovl  %ecx,%edx
  add    $0x4,%rax
  cmp    %rdi,%rax
  jne    L129
  cmp    $0x23,%edx
  sete   %al
  cmp    $0x1,%esi
  sete   %r13b
  movzbl %r13b,%r13d
  and    %eax,%r13d
  mov    %r13d,%edi
  call   <assert@plt>
  mov    %rbp,%rdi
  call   <free@plt>
  mov    %rbx,%rdi
  call   <free@plt>
  mov    %r12,%rdi
  call   <free@plt>
  jmp    L33
L44:
  mov    $0x0,%edi
  call   <assert@plt>
  test   %rbp,%rbp
  jne    L10
L120:
  test   %rbx,%rbx
  jne    L71
L126:
  mov    $0x0,%r13d
  test   %r12,%r12
  jne    L31
L33:
  mov    0x68(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L117
  mov    %r13d,%eax
  add    $0x78,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  ret
L10:
  mov    %rbp,%rdi
  call   <free@plt>
  jmp    L120
L71:
  mov    %rbx,%rdi
  call   <free@plt>
  jmp    L126
L31:
  mov    %r12,%rdi
  call   <free@plt>
  jmp    L33
L117:
  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;
}
```