user: 请将这段汇编代码片段转换成等效的C代码：

```asm
<run_test>:
  endbr64
  push   %r14
  mov    $0x14,%edi
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x70,%rsp
  movdqa D0(%rip),%xmm0
  mov    %fs:0x28,%rax
  mov    %rax,0x68(%rsp)
  xor    %eax,%eax
  movl   $0x0,0x60(%rsp)
  movaps %xmm0,(%rsp)
  movdqa D53(%rip),%xmm0
  movaps %xmm0,0x10(%rsp)
  movdqa D50(%rip),%xmm0
  movaps %xmm0,0x20(%rsp)
  movdqa D25(%rip),%xmm0
  movaps %xmm0,0x30(%rsp)
  movdqa D12(%rip),%xmm0
  movaps %xmm0,0x40(%rsp)
  movdqa D28(%rip),%xmm0
  movaps %xmm0,0x50(%rsp)
  call   <malloc@plt>
  mov    $0x14,%edi
  mov    %rax,%rbp
  call   <malloc@plt>
  mov    $0x14,%edi
  mov    %rax,%r13
  call   <malloc@plt>
  test   %rbp,%rbp
  sete   %bl
  test   %r13,%r13
  mov    %rax,%r14
  sete   %al
  or     %al,%bl
  jne    L48
  test   %r14,%r14
  jne    L91
  xor    %edi,%edi
  call   <assert@plt>
L18:
  mov    %rbp,%rdi
  call   <free@plt>
  test   %r13,%r13
  jne    L9
L31:
  xor    %r12d,%r12d
  test   %r14,%r14
  jne    L128
  nopl   0x0(%rax)
L24:
  mov    0x68(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L65
  add    $0x70,%rsp
  mov    %r12d,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
  nopl   0x0(%rax)
L91:
  mov    $0x5,%edi
  mov    %rsp,%rdx
  mov    %r14,%r9
  mov    %r13,%r8
  mov    %rbp,%rcx
  xor    %esi,%esi
  call   <dijkstra_shortest@plt>
  mov    0x0(%r13),%edi
  test   %edi,%edi
  je     L1
  mov    0x4(%r13),%esi
  test   %esi,%esi
  je     L1
  mov    0x8(%r13),%ecx
  test   %ecx,%ecx
  je     L1
  mov    0xc(%r13),%edx
  test   %edx,%edx
  je     L1
  mov    0x10(%r13),%eax
  test   %eax,%eax
  setne  %bl
L1:
  movdqu 0x0(%rbp),%xmm1
  pcmpeqd %xmm2,%xmm2
  mov    0x10(%rbp),%edx
  movdqa %xmm1,%xmm0
  pcmpgtd %xmm2,%xmm0
  pand   %xmm0,%xmm1
  pandn  %xmm2,%xmm0
  por    %xmm1,%xmm0
  movdqa %xmm0,%xmm2
  psrldq $0x8,%xmm2
  movdqa %xmm2,%xmm1
  pcmpgtd %xmm0,%xmm1
  pand   %xmm1,%xmm2
  pandn  %xmm0,%xmm1
  por    %xmm2,%xmm1
  movdqa %xmm1,%xmm2
  psrldq $0x4,%xmm2
  movdqa %xmm2,%xmm0
  pcmpgtd %xmm1,%xmm0
  pand   %xmm0,%xmm2
  pandn  %xmm1,%xmm0
  por    %xmm2,%xmm0
  movd   %xmm0,%eax
  cmp    %edx,%eax
  cmovl  %edx,%eax
  xor    %r12d,%r12d
  cmp    $0x23,%eax
  sete   %r12b
  and    %ebx,%r12d
  mov    %r12d,%edi
  call   <assert@plt>
  mov    %rbp,%rdi
  call   <free@plt>
  mov    %r13,%rdi
  call   <free@plt>
L128:
  mov    %r14,%rdi
  call   <free@plt>
  jmp    L24
  xchg   %ax,%ax
L48:
  xor    %edi,%edi
  call   <assert@plt>
  test   %rbp,%rbp
  jne    L18
  test   %r13,%r13
  je     L31
L9:
  mov    %r13,%rdi
  call   <free@plt>
  jmp    L31
L65:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: parse_data
arguments: tag: D0
datatype: byte[16]
name: parse_data
arguments: tag: D53
datatype: byte[16]
name: parse_data
arguments: tag: D50
datatype: byte[16]
name: parse_data
arguments: tag: D25
datatype: byte[16]
name: parse_data
arguments: tag: D12
datatype: byte[16]
name: parse_data
arguments: tag: D28
datatype: byte[16]

tool: {"D0": [0x00,0x00,0x00,0x00,0x32,0x00,0x00,0x00,0x1e,0x00,0x00,0x00,0x64,0x00,0x00,0x00]}

tool: {"D53": [0x0a,0x00,0x00,0x00,0x32,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x05,0x00,0x00,0x00]}

tool: {"D50": [0x14,0x00,0x00,0x00,0xff,0xff,0xff,0x7f,0x1e,0x00,0x00,0x00,0x05,0x00,0x00,0x00]}

tool: {"D25": [0x00,0x00,0x00,0x00,0x32,0x00,0x00,0x00,0xff,0xff,0xff,0x7f,0x64,0x00,0x00,0x00]}

tool: {"D12": [0x14,0x00,0x00,0x00,0x32,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x0a,0x00,0x00,0x00]}

tool: {"D28": [0x0a,0x00,0x00,0x00,0xff,0xff,0xff,0x7f,0xff,0xff,0xff,0x7f,0x0a,0x00,0x00,0x00]}

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;
}
```