#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ IntArrayInsSort(int *, int);
int /*<<< orphan*/ IntArraySelSort(int *, int);
int /*<<< orphan*/ cloneIntArray(int **, int *, int);
int /*<<< orphan*/ free(int *);
int /*<<< orphan*/ intArrayHeapSort(int **, int);
int /*<<< orphan*/ intArrayMergeSort(int *, int /*<<< orphan*/, int);
int /*<<< orphan*/ intArrayQuickSort(int *, int /*<<< orphan*/, int);
scalar_t__ malloc(int);
int /*<<< orphan*/ printIntArray(int *, int);
int /*<<< orphan*/ printIntArrayReverse(int *, int);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ scanf(char *, int *);
int /*<<< orphan*/ srand(int /*<<< orphan*/);
int /*<<< orphan*/ time(int /*<<< orphan*/ *);
int main() {
  int *a = NULL, *temp = NULL, n, i;
  printf("How many elements do you want store in the array? ");
  scanf("%d", &n);
  a = (int *)malloc(sizeof(int) * n);
  printf("Insert elements:\n");
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  printf("This is your array:\n");
  printIntArray(a, n);
  cloneIntArray(&temp, a, n);
  printf("This is the temporary array that we're going to order:\n");
  printIntArray(temp, n);
  IntArraySelSort(temp, n);
  printf("This is the array ordered with selection sort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  IntArrayInsSort(temp, n);
  printf("This is the array ordered with insertion sort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  intArrayMergeSort(temp, 0, n - 1);
  printf("This is the array ordered with mergesort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  srand(time(NULL));
  intArrayQuickSort(temp, 0, n - 1);
  printf("This is the array ordered with quicksort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  intArrayHeapSort(&temp, n);
  printf("This is the array ordered with heapsort:\n");
  printIntArrayReverse(temp, n);
  free(temp);
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
movl   $0x0,-0x4(%rbp)
movq   $0x0,-0x10(%rbp)
movq   $0x0,-0x18(%rbp)
lea    0xdfa(%rip),%rdi
call   1070 <printf@plt>
lea    0xe21(%rip),%rdi
lea    -0x1c(%rbp),%rsi
call   10e0 <scanf@plt>
movslq -0x1c(%rbp),%rax
shl    $0x2,%rax
mov    %eax,%edi
call   10d0 <malloc@plt>
mov    %rax,-0x10(%rbp)
lea    0xe01(%rip),%rdi
call   1070 <printf@plt>
movl   $0x0,-0x20(%rbp)
mov    -0x20(%rbp),%eax
cmp    -0x1c(%rbp),%eax
jge    1276 <main+0x96>
mov    -0x10(%rbp),%rsi
movslq -0x20(%rbp),%rax
shl    $0x2,%rax
add    %rax,%rsi
lea    0xdd0(%rip),%rdi
call   10e0 <scanf@plt>
mov    -0x20(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x20(%rbp)
jmp    1241 <main+0x61>
lea    0xdcb(%rip),%rdi
call   1070 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
lea    -0x18(%rbp),%rdi
call   10b0 <cloneIntArray@plt>
lea    0xdb8(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   1040 <IntArraySelSort@plt>
lea    0xdcc(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
lea    -0x18(%rbp),%rdi
call   10b0 <cloneIntArray@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   1090 <IntArrayInsSort@plt>
lea    0xdbf(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
lea    -0x18(%rbp),%rdi
call   10b0 <cloneIntArray@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1050 <intArrayMergeSort@plt>
lea    0xdad(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
lea    -0x18(%rbp),%rdi
call   10b0 <cloneIntArray@plt>
xor    %eax,%eax
mov    %eax,%edi
call   10c0 <time@plt>
mov    %eax,%edi
call   10a0 <srand@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1080 <intArrayQuickSort@plt>
lea    0xd86(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   10f0 <printIntArray@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
lea    -0x18(%rbp),%rdi
call   10b0 <cloneIntArray@plt>
mov    -0x1c(%rbp),%esi
lea    -0x18(%rbp),%rdi
call   1060 <intArrayHeapSort@plt>
lea    0xd74(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%esi
call   1100 <printIntArrayReverse@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
xor    %eax,%eax
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r15
push   %r14
push   %r12
push   %rbx
sub    $0x18,%rsp
movq   $0x0,0x10(%rsp)
lea    0xdf5(%rip),%rdi
call   1080 <printf@plt>
lea    0xe1c(%rip),%rdi
lea    0xc(%rsp),%rsi
call   10f0 <scanf@plt>
mov    0xc(%rsp),%edi
shl    $0x2,%edi
call   10e0 <malloc@plt>
mov    %rax,%r15
lea    0xdff(%rip),%rdi
call   1060 <puts@plt>
cmpl   $0x0,0xc(%rsp)
jle    126d <main+0x7d>
xor    %r12d,%r12d
lea    0xde6(%rip),%r14
mov    %r15,%rbx
mov    %r14,%rdi
mov    %rbx,%rsi
call   10f0 <scanf@plt>
add    $0x1,%r12
movslq 0xc(%rsp),%rax
add    $0x4,%rbx
cmp    %rax,%r12
jl     1250 <main+0x60>
lea    0xdd3(%rip),%rdi
call   1060 <puts@plt>
mov    0xc(%rsp),%esi
mov    %r15,%rdi
call   1100 <printIntArray@plt>
mov    0xc(%rsp),%edx
lea    0x10(%rsp),%r14
mov    %r14,%rdi
mov    %r15,%rsi
call   10c0 <cloneIntArray@plt>
lea    0xdbb(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1100 <printIntArray@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1040 <IntArraySelSort@plt>
lea    0xdca(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1100 <printIntArray@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
mov    0xc(%rsp),%edx
mov    %r14,%rdi
mov    %r15,%rsi
call   10c0 <cloneIntArray@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   10a0 <IntArrayInsSort@plt>
lea    0xdb8(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1100 <printIntArray@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
mov    0xc(%rsp),%edx
mov    %r14,%rdi
mov    %r15,%rsi
call   10c0 <cloneIntArray@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%edx
add    $0xffffffff,%edx
xor    %esi,%esi
call   1050 <intArrayMergeSort@plt>
lea    0xda1(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1100 <printIntArray@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
mov    0xc(%rsp),%edx
mov    %r14,%rdi
mov    %r15,%rsi
call   10c0 <cloneIntArray@plt>
xor    %edi,%edi
call   10d0 <time@plt>
mov    %eax,%edi
call   10b0 <srand@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%edx
add    $0xffffffff,%edx
xor    %esi,%esi
call   1090 <intArrayQuickSort@plt>
lea    0xd77(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1100 <printIntArray@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
mov    0xc(%rsp),%edx
mov    %r14,%rdi
mov    %r15,%rsi
call   10c0 <cloneIntArray@plt>
mov    0xc(%rsp),%esi
mov    %r14,%rdi
call   1070 <intArrayHeapSort@plt>
lea    0xd62(%rip),%rdi
call   1060 <puts@plt>
mov    0x10(%rsp),%rdi
mov    0xc(%rsp),%esi
call   1110 <printIntArrayReverse@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
xor    %eax,%eax
add    $0x18,%rsp
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
ret

LLVM IR (-O0):
@.str = [51 x i8] c"How many elements do you want store in the array? \00"
@.str.1 = [3 x i8] c"%d\00"
@.str.2 = [18 x i8] c"Insert elements:\0A\00"
@.str.3 = [21 x i8] c"This is your array:\0A\00"
@.str.4 = [56 x i8] c"This is the temporary array that we're going to order:\0A\00"
@.str.5 = [48 x i8] c"This is the array ordered with selection sort:\0A\00"
@.str.6 = [48 x i8] c"This is the array ordered with insertion sort:\0A\00"
@.str.7 = [43 x i8] c"This is the array ordered with mergesort:\0A\00"
@.str.8 = [43 x i8] c"This is the array ordered with quicksort:\0A\00"
@.str.9 = [42 x i8] c"This is the array ordered with heapsort:\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32*
%3 = alloca i32*
%4 = alloca i32
%5 = alloca i32
store i32 0, i32* %1
store i32* null, i32** %2
store i32* null, i32** %3
%6 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str, i64 0, i64 0))
%7 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %4)
%8 = load i32, i32* %4
%9 = sext i32 %8 to i64
%10 = mul i64 4, %9
%11 = trunc i64 %10 to i32
%12 = call i64 @malloc(i32 %11)
%13 = inttoptr i64 %12 to i32*
store i32* %13, i32** %2
%14 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.2, i64 0, i64 0))
store i32 0, i32* %5
br label %15
15: ; preds = %25, %0
%16 = load i32, i32* %5
%17 = load i32, i32* %4
%18 = icmp slt i32 %16, %17
br i1 %18, label %19, label %28
19: ; preds = %15
%20 = load i32*, i32** %2
%21 = load i32, i32* %5
%22 = sext i32 %21 to i64
%23 = getelementptr inbounds i32, i32* %20, i64 %22
%24 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %23)
br label %25
25: ; preds = %19
%26 = load i32, i32* %5
%27 = add nsw i32 %26, 1
store i32 %27, i32* %5
br label %15
28: ; preds = %15
%29 = call i32 @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.3, i64 0, i64 0))
%30 = load i32*, i32** %2
%31 = load i32, i32* %4
%32 = call i32 @printIntArray(i32* %30, i32 %31)
%33 = load i32*, i32** %2
%34 = load i32, i32* %4
%35 = call i32 @cloneIntArray(i32** %3, i32* %33, i32 %34)
%36 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.4, i64 0, i64 0))
%37 = load i32*, i32** %3
%38 = load i32, i32* %4
%39 = call i32 @printIntArray(i32* %37, i32 %38)
%40 = load i32*, i32** %3
%41 = load i32, i32* %4
%42 = call i32 @IntArraySelSort(i32* %40, i32 %41)
%43 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.5, i64 0, i64 0))
%44 = load i32*, i32** %3
%45 = load i32, i32* %4
%46 = call i32 @printIntArray(i32* %44, i32 %45)
%47 = load i32*, i32** %3
%48 = call i32 @free(i32* %47)
%49 = load i32*, i32** %2
%50 = load i32, i32* %4
%51 = call i32 @cloneIntArray(i32** %3, i32* %49, i32 %50)
%52 = load i32*, i32** %3
%53 = load i32, i32* %4
%54 = call i32 @IntArrayInsSort(i32* %52, i32 %53)
%55 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.6, i64 0, i64 0))
%56 = load i32*, i32** %3
%57 = load i32, i32* %4
%58 = call i32 @printIntArray(i32* %56, i32 %57)
%59 = load i32*, i32** %3
%60 = call i32 @free(i32* %59)
%61 = load i32*, i32** %2
%62 = load i32, i32* %4
%63 = call i32 @cloneIntArray(i32** %3, i32* %61, i32 %62)
%64 = load i32*, i32** %3
%65 = load i32, i32* %4
%66 = sub nsw i32 %65, 1
%67 = call i32 @intArrayMergeSort(i32* %64, i32 0, i32 %66)
%68 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.7, i64 0, i64 0))
%69 = load i32*, i32** %3
%70 = load i32, i32* %4
%71 = call i32 @printIntArray(i32* %69, i32 %70)
%72 = load i32*, i32** %3
%73 = call i32 @free(i32* %72)
%74 = load i32*, i32** %2
%75 = load i32, i32* %4
%76 = call i32 @cloneIntArray(i32** %3, i32* %74, i32 %75)
%77 = call i32 @time(i32* null)
%78 = call i32 @srand(i32 %77)
%79 = load i32*, i32** %3
%80 = load i32, i32* %4
%81 = sub nsw i32 %80, 1
%82 = call i32 @intArrayQuickSort(i32* %79, i32 0, i32 %81)
%83 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.8, i64 0, i64 0))
%84 = load i32*, i32** %3
%85 = load i32, i32* %4
%86 = call i32 @printIntArray(i32* %84, i32 %85)
%87 = load i32*, i32** %3
%88 = call i32 @free(i32* %87)
%89 = load i32*, i32** %2
%90 = load i32, i32* %4
%91 = call i32 @cloneIntArray(i32** %3, i32* %89, i32 %90)
%92 = load i32, i32* %4
%93 = call i32 @intArrayHeapSort(i32** %3, i32 %92)
%94 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.9, i64 0, i64 0))
%95 = load i32*, i32** %3
%96 = load i32, i32* %4
%97 = call i32 @printIntArrayReverse(i32* %95, i32 %96)
%98 = load i32*, i32** %3
%99 = call i32 @free(i32* %98)
ret i32 0
}

LLVM IR (-O2):
@.str = [51 x i8] c"How many elements do you want store in the array? \00"
@.str.1 = [3 x i8] c"%d\00"
@str = [17 x i8] c"Insert elements:\00"
@str.10 = [20 x i8] c"This is your array:\00"
@str.11 = [55 x i8] c"This is the temporary array that we're going to order:\00"
@str.12 = [47 x i8] c"This is the array ordered with selection sort:\00"
@str.13 = [47 x i8] c"This is the array ordered with insertion sort:\00"
@str.14 = [42 x i8] c"This is the array ordered with mergesort:\00"
@str.15 = [42 x i8] c"This is the array ordered with quicksort:\00"
@str.16 = [41 x i8] c"This is the array ordered with heapsort:\00"
define i32 @main() {
%1 = alloca i32*
%2 = alloca i32
%3 = bitcast i32** %1 to i8*
store i32* null, i32** %1
%4 = bitcast i32* %2 to i8*
%5 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @.str, i64 0, i64 0))
%6 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %2)
%7 = load i32, i32* %2
%8 = shl i32 %7, 2
%9 = call i64 @malloc(i32 %8)
%10 = inttoptr i64 %9 to i32*
%11 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([17 x i8], [17 x i8]* @str, i64 0, i64 0))
%12 = load i32, i32* %2
%13 = icmp sgt i32 %12, 0
br i1 %13, label %14, label %22
14: ; preds = %0, %14
%15 = phi i64 [ %18, %14 ], [ 0, %0 ]
%16 = getelementptr inbounds i32, i32* %10, i64 %15
%17 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %16)
%18 = add nuw nsw i64 %15, 1
%19 = load i32, i32* %2
%20 = sext i32 %19 to i64
%21 = icmp slt i64 %18, %20
br i1 %21, label %14, label %22
22: ; preds = %14, %0
%23 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str.10, i64 0, i64 0))
%24 = load i32, i32* %2
%25 = call i32 @printIntArray(i32* %10, i32 %24)
%26 = load i32, i32* %2
%27 = call i32 @cloneIntArray(i32** %1, i32* %10, i32 %26)
%28 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.11, i64 0, i64 0))
%29 = load i32*, i32** %1
%30 = load i32, i32* %2
%31 = call i32 @printIntArray(i32* %29, i32 %30)
%32 = load i32*, i32** %1
%33 = load i32, i32* %2
%34 = call i32 @IntArraySelSort(i32* %32, i32 %33)
%35 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.12, i64 0, i64 0))
%36 = load i32*, i32** %1
%37 = load i32, i32* %2
%38 = call i32 @printIntArray(i32* %36, i32 %37)
%39 = load i32*, i32** %1
%40 = call i32 @free(i32* %39)
%41 = load i32, i32* %2
%42 = call i32 @cloneIntArray(i32** %1, i32* %10, i32 %41)
%43 = load i32*, i32** %1
%44 = load i32, i32* %2
%45 = call i32 @IntArrayInsSort(i32* %43, i32 %44)
%46 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.13, i64 0, i64 0))
%47 = load i32*, i32** %1
%48 = load i32, i32* %2
%49 = call i32 @printIntArray(i32* %47, i32 %48)
%50 = load i32*, i32** %1
%51 = call i32 @free(i32* %50)
%52 = load i32, i32* %2
%53 = call i32 @cloneIntArray(i32** %1, i32* %10, i32 %52)
%54 = load i32*, i32** %1
%55 = load i32, i32* %2
%56 = add nsw i32 %55, -1
%57 = call i32 @intArrayMergeSort(i32* %54, i32 0, i32 %56)
%58 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.14, i64 0, i64 0))
%59 = load i32*, i32** %1
%60 = load i32, i32* %2
%61 = call i32 @printIntArray(i32* %59, i32 %60)
%62 = load i32*, i32** %1
%63 = call i32 @free(i32* %62)
%64 = load i32, i32* %2
%65 = call i32 @cloneIntArray(i32** %1, i32* %10, i32 %64)
%66 = call i32 @time(i32* null)
%67 = call i32 @srand(i32 %66)
%68 = load i32*, i32** %1
%69 = load i32, i32* %2
%70 = add nsw i32 %69, -1
%71 = call i32 @intArrayQuickSort(i32* %68, i32 0, i32 %70)
%72 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.15, i64 0, i64 0))
%73 = load i32*, i32** %1
%74 = load i32, i32* %2
%75 = call i32 @printIntArray(i32* %73, i32 %74)
%76 = load i32*, i32** %1
%77 = call i32 @free(i32* %76)
%78 = load i32, i32* %2
%79 = call i32 @cloneIntArray(i32** %1, i32* %10, i32 %78)
%80 = load i32, i32* %2
%81 = call i32 @intArrayHeapSort(i32** %1, i32 %80)
%82 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.16, i64 0, i64 0))
%83 = load i32*, i32** %1
%84 = load i32, i32* %2
%85 = call i32 @printIntArrayReverse(i32* %83, i32 %84)
%86 = load i32*, i32** %1
%87 = call i32 @free(i32* %86)
ret i32 0
}