#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*/ swap(int *, int *);
void insertsort(int *array, int n) {
  int c, d;
  for (c = 1; c <= n - 1; c++) {
    d = c;
    while (d > 0 && array[d] < array[d - 1]) {
      swap(&array[d], &array[d - 1]);
      d--;
    }
  }
}


x86 assembly (clang, -O0):
<insertsort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %esi,-0xc(%rbp)
movl   $0x1,-0x10(%rbp)
mov    -0x10(%rbp),%eax
mov    -0xc(%rbp),%ecx
sub    $0x1,%ecx
cmp    %ecx,%eax
jg     11c5 <insertsort+0xb5>
mov    -0x10(%rbp),%eax
mov    %eax,-0x14(%rbp)
xor    %eax,%eax
cmpl   $0x0,-0x14(%rbp)
mov    %al,-0x15(%rbp)
jle    116d <insertsort+0x5d>
mov    -0x8(%rbp),%rax
movslq -0x14(%rbp),%rcx
mov    (%rax,%rcx,4),%eax
mov    -0x8(%rbp),%rcx
mov    -0x14(%rbp),%edx
sub    $0x1,%edx
movslq %edx,%rdx
cmp    (%rcx,%rdx,4),%eax
setl   %al
mov    %al,-0x15(%rbp)
mov    -0x15(%rbp),%al
test   $0x1,%al
jne    117d <insertsort+0x6d>
jmp    11b2 <insertsort+0xa2>
mov    -0x8(%rbp),%rdi
movslq -0x14(%rbp),%rax
shl    $0x2,%rax
add    %rax,%rdi
mov    -0x8(%rbp),%rsi
mov    -0x14(%rbp),%eax
sub    $0x1,%eax
cltq
shl    $0x2,%rax
add    %rax,%rsi
call   1030 <swap@plt>
mov    -0x14(%rbp),%eax
add    $0xffffffff,%eax
mov    %eax,-0x14(%rbp)
jmp    113d <insertsort+0x2d>
jmp    11b7 <insertsort+0xa7>
mov    -0x10(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x10(%rbp)
jmp    1126 <insertsort+0x16>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<insertsort>:
push   %rbp
push   %r15
push   %r14
push   %r12
push   %rbx
cmp    $0x2,%esi
jl     1174 <insertsort+0x64>
mov    %esi,%r14d
mov    %rdi,%rbx
mov    $0x1,%r15d
mov    $0x2,%r12d
jmp    114d <insertsort+0x3d>
cs nopw 0x0(%rax,%rax,1)
nopl   0x0(%rax,%rax,1)
add    $0x1,%r15d
add    $0x1,%r12d
cmp    %r14d,%r15d
je     1174 <insertsort+0x64>
mov    %r12d,%ebp
mov    %ebp,%eax
lea    -0x1(%rax),%ebp
mov    (%rbx,%rbp,4),%ecx
add    $0xfffffffe,%eax
cmp    (%rbx,%rax,4),%ecx
jge    1140 <insertsort+0x30>
lea    (%rbx,%rbp,4),%rdi
lea    (%rbx,%rax,4),%rsi
call   1030 <swap@plt>
cmp    $0x1,%ebp
jg     1150 <insertsort+0x40>
jmp    1140 <insertsort+0x30>
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
define void @insertsort(i32* %0, i32 %1) {
%3 = alloca i32*
%4 = alloca i32
%5 = alloca i32
%6 = alloca i32
store i32* %0, i32** %3
store i32 %1, i32* %4
store i32 1, i32* %5
br label %7
7: ; preds = %46, %2
%8 = load i32, i32* %5
%9 = load i32, i32* %4
%10 = sub nsw i32 %9, 1
%11 = icmp sle i32 %8, %10
br i1 %11, label %12, label %49
12: ; preds = %7
%13 = load i32, i32* %5
store i32 %13, i32* %6
br label %14
14: ; preds = %32, %12
%15 = load i32, i32* %6
%16 = icmp sgt i32 %15, 0
br i1 %16, label %17, label %30
17: ; preds = %14
%18 = load i32*, i32** %3
%19 = load i32, i32* %6
%20 = sext i32 %19 to i64
%21 = getelementptr inbounds i32, i32* %18, i64 %20
%22 = load i32, i32* %21
%23 = load i32*, i32** %3
%24 = load i32, i32* %6
%25 = sub nsw i32 %24, 1
%26 = sext i32 %25 to i64
%27 = getelementptr inbounds i32, i32* %23, i64 %26
%28 = load i32, i32* %27
%29 = icmp slt i32 %22, %28
br label %30
30: ; preds = %17, %14
%31 = phi i1 [ false, %14 ], [ %29, %17 ]
br i1 %31, label %32, label %45
32: ; preds = %30
%33 = load i32*, i32** %3
%34 = load i32, i32* %6
%35 = sext i32 %34 to i64
%36 = getelementptr inbounds i32, i32* %33, i64 %35
%37 = load i32*, i32** %3
%38 = load i32, i32* %6
%39 = sub nsw i32 %38, 1
%40 = sext i32 %39 to i64
%41 = getelementptr inbounds i32, i32* %37, i64 %40
%42 = call i32 @swap(i32* %36, i32* %41)
%43 = load i32, i32* %6
%44 = add nsw i32 %43, -1
store i32 %44, i32* %6
br label %14
45: ; preds = %30
br label %46
46: ; preds = %45
%47 = load i32, i32* %5
%48 = add nsw i32 %47, 1
store i32 %48, i32* %5
br label %7
49: ; preds = %7
ret void
}

LLVM IR (-O2):
define void @insertsort(i32* %0, i32 %1) {
%3 = icmp sgt i32 %1, 1
br i1 %3, label %4, label %22
4: ; preds = %2, %19
%5 = phi i32 [ %20, %19 ], [ 1, %2 ]
br label %6
6: ; preds = %4, %16
%7 = phi i32 [ %5, %4 ], [ %11, %16 ]
%8 = zext i32 %7 to i64
%9 = getelementptr inbounds i32, i32* %0, i64 %8
%10 = load i32, i32* %9
%11 = add nsw i32 %7, -1
%12 = zext i32 %11 to i64
%13 = getelementptr inbounds i32, i32* %0, i64 %12
%14 = load i32, i32* %13
%15 = icmp slt i32 %10, %14
br i1 %15, label %16, label %19
16: ; preds = %6
%17 = tail call i32 @swap(i32* %9, i32* %13)
%18 = icmp sgt i32 %7, 1
br i1 %18, label %6, label %19
19: ; preds = %6, %16
%20 = add nuw nsw i32 %5, 1
%21 = icmp eq i32 %20, %1
br i1 %21, label %22, label %4
22: ; preds = %19, %2
ret void
}