user: 请从给定的汇编指令推导出C源代码:

```asm
<sjf_algorithm>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  sub    $0xd0,%rsp
  mov    %rdi,-0xc8(%rbp)
  mov    %fs:0x28,%rax
  mov    %rax,-0x8(%rbp)
  xor    %eax,%eax
  movl   $0x1,-0xa8(%rbp)
  movl   $0x0,-0xb8(%rbp)
  movl   $0x0,-0xb4(%rbp)
  movl   $0x1,-0xb0(%rbp)
  movl   $0x0,-0xa4(%rbp)
  movl   $0x0,-0xac(%rbp)
  movq   $0x0,-0x90(%rbp)
  movq   $0x0,-0xa0(%rbp)
  movq   $0x0,-0x98(%rbp)
  movabs $0x6e697475706d6f43,%rax
  movabs $0x7420746961572067,%rdx
  mov    %rax,-0x80(%rbp)
  mov    %rdx,-0x78(%rbp)
  movabs $0xa73656d69,%rax
  mov    $0x0,%edx
  mov    %rax,-0x70(%rbp)
  mov    %rdx,-0x68(%rbp)
  movq   $0x0,-0x60(%rbp)
  movq   $0x0,-0x58(%rbp)
  movw   $0x0,-0x50(%rbp)
  movabs $0x6e697475706d6f43,%rax
  movabs $0x61206e7275542067,%rdx
  mov    %rax,-0x40(%rbp)
  mov    %rdx,-0x38(%rbp)
  movabs $0x697420646e756f72,%rax
  mov    $0xa73656d,%edx
  mov    %rax,-0x30(%rbp)
  mov    %rdx,-0x28(%rbp)
  movq   $0x0,-0x20(%rbp)
  movq   $0x0,-0x18(%rbp)
  movw   $0x0,-0x10(%rbp)
  mov    -0xc8(%rbp),%rax
  mov    (%rax),%rax
  mov    %rax,-0x88(%rbp)
  cmpq   $0x0,-0x88(%rbp)
  jne    L9
  lea    D12(%rip),%rax
  mov    %rax,%rdi
  call   <puts@plt>
  jmp    L49
L59:
  mov    -0xc8(%rbp),%rax
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <findshortest@plt>
  mov    %eax,-0xa4(%rbp)
  cmpl   $0xffffffff,-0xa4(%rbp)
  jne    L19
  movl   $0x0,-0xb0(%rbp)
  jmp    L25
L19:
  mov    -0xa4(%rbp),%eax
  add    %eax,-0xb4(%rbp)
  mov    -0xb8(%rbp),%edx
  lea    -0xa0(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <add_burst_time@plt>
  mov    -0xb4(%rbp),%edx
  lea    -0x98(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <add_burst_time@plt>
  mov    -0xb4(%rbp),%esi
  mov    -0xb8(%rbp),%ecx
  mov    -0xa4(%rbp),%edx
  mov    -0xac(%rbp),%eax
  mov    %esi,%r8d
  mov    %eax,%esi
  lea    D10(%rip),%rax
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    -0xa4(%rbp),%eax
  add    %eax,-0xb8(%rbp)
L25:
  addl   $0x1,-0xac(%rbp)
L9:
  cmpl   $0x1,-0xb0(%rbp)
  je     L59
L49:
  movl   $0x1,-0xac(%rbp)
  mov    -0xac(%rbp),%edx
  lea    -0xa0(%rbp),%rcx
  lea    -0x80(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <output_summary@plt>
  movl   $0x1,-0xac(%rbp)
  mov    -0xac(%rbp),%edx
  lea    -0x98(%rbp),%rcx
  lea    -0x40(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  mov    $0x0,%eax
  call   <output_summary@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  nop
  mov    -0x8(%rbp),%rax
  sub    %fs:0x28,%rax
  je     L22
  call   <__stack_chk_fail@plt>
L22:
  leave
  ret
```

tool_calls: name: extract_symbolic_data
arguments: tag: D12
type_guessed: string
name: extract_symbolic_data
arguments: tag: D10
type_guessed: string

tool: D12: Nothing in the list

tool: D10: P%d			%d				%d				%d


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