#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 */
typedef int /*<<< orphan*/ arr;

/* Variables and functions */
int /*<<< orphan*/ insertSort(int *, int);
int /*<<< orphan*/ printArr(int *, int);
int /*<<< orphan*/ puts(char *);
int main(void) {
  int arr[10] = {4, 6, 5, 3, 2, 1, 9, 8, 0, 7};
  int size = (int)sizeof(arr) / sizeof(int);
  puts("Array before insertion sort");
  printArr(arr, size);
  insertSort(arr, size);
  puts("Array After insertion sort");
  printArr(arr, size);
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x40,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
lea    0xea6(%rip),%rsi
mov    $0x28,%edx
call   1050 <memcpy@plt>
movl   $0xa,-0x34(%rbp)
lea    0xeb6(%rip),%rdi
call   1030 <puts@plt>
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1060 <printArr@plt>
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1040 <insertSort@plt>
lea    0xeae(%rip),%rdi
call   1030 <puts@plt>
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1060 <printArr@plt>
xor    %eax,%eax
add    $0x40,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
sub    $0x30,%rsp
mov    0xee4(%rip),%rax
mov    %rax,0x20(%rsp)
movaps 0xec8(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeac(%rip),%xmm0
movaps %xmm0,(%rsp)
lea    0xec9(%rip),%rdi
call   1030 <puts@plt>
mov    %rsp,%rbx
mov    %rbx,%rdi
mov    $0xa,%esi
call   1050 <printArr@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1040 <insertSort@plt>
lea    0xebc(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1050 <printArr@plt>
xor    %eax,%eax
add    $0x30,%rsp
pop    %rbx
ret

LLVM IR (-O0):
@__const.main.arr = [10 x i32] [i32 4, i32 6, i32 5, i32 3, i32 2, i32 1, i32 9, i32 8, i32 0, i32 7]
@.str = [28 x i8] c"Array before insertion sort\00"
@.str.1 = [27 x i8] c"Array After insertion sort\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca [10 x i32]
%3 = alloca i32
store i32 0, i32* %1
%4 = bitcast [10 x i32]* %2 to i8*
store i32 10, i32* %3
%5 = call i32 @puts(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str, i64 0, i64 0))
%6 = getelementptr inbounds [10 x i32], [10 x i32]* %2, i64 0, i64 0
%7 = load i32, i32* %3
%8 = call i32 @printArr(i32* %6, i32 %7)
%9 = getelementptr inbounds [10 x i32], [10 x i32]* %2, i64 0, i64 0
%10 = load i32, i32* %3
%11 = call i32 @insertSort(i32* %9, i32 %10)
%12 = call i32 @puts(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.1, i64 0, i64 0))
%13 = getelementptr inbounds [10 x i32], [10 x i32]* %2, i64 0, i64 0
%14 = load i32, i32* %3
%15 = call i32 @printArr(i32* %13, i32 %14)
ret i32 0
}

LLVM IR (-O2):
@__const.main.arr = [10 x i32] [i32 4, i32 6, i32 5, i32 3, i32 2, i32 1, i32 9, i32 8, i32 0, i32 7]
@.str = [28 x i8] c"Array before insertion sort\00"
@.str.1 = [27 x i8] c"Array After insertion sort\00"
define i32 @main() {
%1 = alloca [10 x i32]
%2 = bitcast [10 x i32]* %1 to i8*
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @.str, i64 0, i64 0))
%4 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%5 = call i32 @printArr(i32* %4, i32 10)
%6 = call i32 @insertSort(i32* %4, i32 10)
%7 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str.1, i64 0, i64 0))
%8 = call i32 @printArr(i32* %4, i32 10)
ret i32 0
}