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

```asm
<sjf_algorithm>:
  endbr64
  push   %r15
  xor    %edx,%edx
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0xa8,%rsp
  movdqa D32(%rip),%xmm1
  movdqa D25(%rip),%xmm0
  mov    %fs:0x28,%rax
  mov    %rax,0x98(%rsp)
  xor    %eax,%eax
  mov    %rdx,0x38(%rsp)
  xor    %edx,%edx
  movabs $0xa73656d69,%rax
  movaps %xmm1,0x60(%rsp)
  movdqa D26(%rip),%xmm1
  mov    %rax,0x30(%rsp)
  xor    %eax,%eax
  cmpq   $0x0,(%rdi)
  movaps %xmm0,0x20(%rsp)
  pxor   %xmm0,%xmm0
  movq   $0x0,0x10(%rsp)
  movq   $0x0,0x18(%rsp)
  mov    %ax,0x50(%rsp)
  mov    %dx,0x90(%rsp)
  movaps %xmm0,0x40(%rsp)
  movaps %xmm1,0x70(%rsp)
  movaps %xmm0,0x80(%rsp)
  je     L49
  mov    %rdi,%rbp
  xor    %r13d,%r13d
  lea    0x10(%rsp),%r15
  xor    %r12d,%r12d
  lea    0x18(%rsp),%r14
L0:
  xor    %eax,%eax
  mov    %rbp,%rdi
  call   <findshortest@plt>
  cmp    $0xffffffff,%eax
  jne    L23
L5:
  lea    0x20(%rsp),%rdi
  mov    $0x1,%edx
  mov    %r15,%rsi
  xor    %eax,%eax
  call   <output_summary@plt>
  lea    0x60(%rsp),%rdi
  xor    %eax,%eax
  mov    %r14,%rsi
  mov    $0x1,%edx
  call   <output_summary@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  mov    0x98(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L4
  add    $0xa8,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
L23:
  lea    (%rax,%r12,1),%ebx
  mov    %r12d,%esi
  mov    %eax,0xc(%rsp)
  mov    %r15,%rdi
  xor    %eax,%eax
  call   <add_burst_time@plt>
  mov    %ebx,%esi
  mov    %r14,%rdi
  xor    %eax,%eax
  call   <add_burst_time@plt>
  mov    0xc(%rsp),%edx
  mov    %r12d,%ecx
  mov    %r13d,%esi
  mov    %ebx,%r8d
  lea    D2(%rip),%rdi
  xor    %eax,%eax
  add    $0x1,%r13d
  call   <printf@plt>
  mov    %ebx,%r12d
  jmp    L0
  nopl   0x0(%rax,%rax,1)
L49:
  lea    D15(%rip),%rdi
  lea    0x10(%rsp),%r15
  call   <puts@plt>
  lea    0x18(%rsp),%r14
  jmp    L5
L4:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: retrieve_data
arguments: data_tag: D32
type_guessed: byte[16]
name: retrieve_data
arguments: data_tag: D25
type_guessed: byte[16]
name: retrieve_data
arguments: data_tag: D26
type_guessed: byte[16]
name: retrieve_data
arguments: data_tag: D2
type_guessed: string
name: retrieve_data
arguments: data_tag: D15
type_guessed: string

tool: {"D32": [0x43,0x6f,0x6d,0x70,0x75,0x74,0x69,0x6e,0x67,0x20,0x54,0x75,0x72,0x6e,0x20,0x61]}

tool: {"D25": [0x43,0x6f,0x6d,0x70,0x75,0x74,0x69,0x6e,0x67,0x20,0x57,0x61,0x69,0x74,0x20,0x74]}

tool: {"D26": [0x72,0x6f,0x75,0x6e,0x64,0x20,0x74,0x69,0x6d,0x65,0x73,0x0a,0x00,0x00,0x00,0x00]}

tool: D2: P%d			%d				%d				%d


tool: D15: Nothing in the list

assistant: ```c
void sjf_algorithm(struct times **list) {
  int processCounter = 1, startTime = 0, stopTime = 0, searching = 1, curShort = 0, counter = 0;
  struct times *visited = 0;
  struct times *temp;
  struct times *wait = 0;
  struct times *turnaround = 0;
  char waitMessage[50] = {"Computing Wait times\n"};
  char summaryMessage[50] = {"Computing Turn around times\n"};
  temp = *list;
  if (temp == 0) {
    printf("Nothing in the list\n");
  } else {
    while (searching == 1) {
      curShort = findshortest(list);
      if (curShort == -1) {
        searching = 0;
      } else {
        stopTime = stopTime + curShort;
        add_burst_time(&wait, startTime);
        add_burst_time(&turnaround, stopTime);
        printf("P%d\t\t\t%d\t\t\t\t\%d\t\t\t\t%d\n", counter, curShort, startTime, stopTime);
        startTime = startTime + curShort;
      }
      counter++;
    }
  }
  counter = 1;
  output_summary(waitMessage, &wait, counter);
  counter = 1;
  output_summary(summaryMessage, &turnaround, counter);
  printf("\n");
}
```