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

```asm
<main>:
  endbr64
  push   %r14
  lea    D76(%rip),%rdi
  push   %r13
  lea    D1(%rip),%r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x10,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x8(%rsp)
  xor    %eax,%eax
  call   <puts@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  lea    D25(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %rsp,%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  mov    (%rsp),%edi
  test   %edi,%edi
  jle    L75
  mov    $0x4,%esi
  call   <calloc@plt>
  lea    D79(%rip),%rdi
  mov    %rax,%r14
  call   <puts@plt>
  mov    (%rsp),%eax
  test   %eax,%eax
  jle    L59
  mov    %r14,%rsi
  mov    %r13,%rdi
  lea    0x4(%r14),%rbx
  xor    %ebp,%ebp
  call   <scanf@plt>
  jmp    L98
  xchg   %ax,%ax
L96:
  mov    %rbx,%rsi
  mov    %rbx,%r12
  mov    %r13,%rdi
  add    $0x4,%rbx
  call   <scanf@plt>
  mov    -0x8(%rbx),%eax
  cmp    (%r12),%eax
  jg     L52
L98:
  add    $0x1,%ebp
  cmp    %ebp,(%rsp)
  jg     L96
L59:
  mov    $0xa,%edi
  call   <putchar@plt>
  lea    D58(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  mov    0x4(%rsp),%edx
  mov    (%rsp),%esi
  mov    %r14,%rdi
  call   <interpolationSearch@plt>
  mov    %eax,%edx
  cmp    $0xffffffff,%eax
  je     L11
  mov    0x4(%rsp),%esi
  lea    D86(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
L90:
  mov    $0xa,%edi
  call   <putchar@plt>
  xor    %eax,%eax
L13:
  mov    0x8(%rsp),%rdx
  sub    %fs:0x28,%rdx
  jne    L95
  add    $0x10,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L75:
  lea    D47(%rip),%rdi
  call   <puts@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  mov    $0x1,%eax
  jmp    L13
L52:
  lea    D74(%rip),%rdi
  call   <puts@plt>
  mov    $0xa,%edi
  call   <putchar@plt>
  mov    $0x1,%eax
  jmp    L13
L11:
  mov    0x4(%rsp),%esi
  lea    D77(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L90
L95:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: read_data
arguments: data_label: D76
type_guessed: string
name: read_data
arguments: data_label: D1
type_guessed: string
name: read_data
arguments: data_label: D25
type_guessed: string
name: read_data
arguments: data_label: D79
type_guessed: string
name: read_data
arguments: data_label: D58
type_guessed: string
name: read_data
arguments: data_label: D86
type_guessed: string
name: read_data
arguments: data_label: D47
type_guessed: string
name: read_data
arguments: data_label: D74
type_guessed: string
name: read_data
arguments: data_label: D77
type_guessed: string

tool: D76: Interpolation Search 

tool: D1: %d

tool: D25: Total Elements : 

tool: D79: Number Input (Sorted Order)

tool: D58: Number to be Searched : 

tool: D86: Number (%d) found at Index : %d 


tool: D47: Invalid Input 

tool: D74: Input Not Sorted 

tool: D77: Number (%d) not found 


assistant: ```c
int main() {
  printf("Interpolation Search \n");
  printf("\n");
  int i, n, key, index;
  printf("Total Elements : ");
  scanf("%d", &n);
  printf("\n");
  if (n < 1) {
    printf("Invalid Input \n");
    printf("\n");
    return 1;
  }
  int *A = (int *)calloc(n, sizeof(int));
  printf("Number Input (Sorted Order)\n");
  for (i = 0; i < n; i++) {
    scanf("%d", (A + i));
    if (i > 0 && *(A + (i - 1)) > *(A + i)) {
      printf("Input Not Sorted \n");
      printf("\n");
      return 1;
    }
  }
  printf("\n");
  printf("Number to be Searched : ");
  scanf("%d", &key);
  printf("\n");
  index = interpolationSearch(A, n, key);
  if (index == -1) {
    printf("Number (%d) not found \n", key);
  } else {
    printf("Number (%d) found at Index : %d \n", key, index);
  }
  printf("\n");
  return 0;
}
```