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

/* Variables and functions */
int /*<<< orphan*/ assert(int /*<<< orphan*/);
int /*<<< orphan*/ bubble_sort(int *, int);
int /*<<< orphan*/ check_if_not_sorted(int *, int);
int main() {
  int array0[] = {5, 6, 7, 8, 1, 2, 3, 4};
  int len0 = sizeof(array0) / sizeof(int);
  bubble_sort(array0, len0);
  assert(check_if_not_sorted(array0, len0));
  int array1[100];
  int len1 = sizeof(array1) / sizeof(int);
  bubble_sort(array1, len1);
  assert(check_if_not_sorted(array1, len1));
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x1e0,%rsp
movl   $0x0,-0x4(%rbp)
mov    0xeb7(%rip),%rax
mov    %rax,-0x30(%rbp)
mov    0xeb4(%rip),%rax
mov    %rax,-0x28(%rbp)
mov    0xeb1(%rip),%rax
mov    %rax,-0x20(%rbp)
mov    0xeae(%rip),%rax
mov    %rax,-0x18(%rbp)
movl   $0x8,-0x34(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1050 <bubble_sort@plt>
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1030 <check_if_not_sorted@plt>
mov    %eax,%edi
call   1040 <assert@plt>
movl   $0x64,-0x1d4(%rbp)
lea    -0x1d0(%rbp),%rdi
mov    -0x1d4(%rbp),%esi
call   1050 <bubble_sort@plt>
lea    -0x1d0(%rbp),%rdi
mov    -0x1d4(%rbp),%esi
call   1030 <check_if_not_sorted@plt>
mov    %eax,%edi
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x1e0,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
sub    $0x1b0,%rsp
movaps 0xed1(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeb5(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rbx
mov    %rbx,%rdi
mov    $0x8,%esi
call   1050 <bubble_sort@plt>
mov    %rbx,%rdi
mov    $0x8,%esi
call   1030 <check_if_not_sorted@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0x20(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x64,%esi
call   1050 <bubble_sort@plt>
mov    %rbx,%rdi
mov    $0x64,%esi
call   1030 <check_if_not_sorted@plt>
mov    %eax,%edi
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x1b0,%rsp
pop    %rbx
ret

LLVM IR (-O0):
@__const.main.array0 = [8 x i32] [i32 5, i32 6, i32 7, i32 8, i32 1, i32 2, i32 3, i32 4]
define i32 @main() {
%1 = alloca i32
%2 = alloca [8 x i32]
%3 = alloca i32
%4 = alloca [100 x i32]
%5 = alloca i32
store i32 0, i32* %1
%6 = bitcast [8 x i32]* %2 to i8*
store i32 8, i32* %3
%7 = getelementptr inbounds [8 x i32], [8 x i32]* %2, i64 0, i64 0
%8 = load i32, i32* %3
%9 = call i32 @bubble_sort(i32* %7, i32 %8)
%10 = getelementptr inbounds [8 x i32], [8 x i32]* %2, i64 0, i64 0
%11 = load i32, i32* %3
%12 = call i32 @check_if_not_sorted(i32* %10, i32 %11)
%13 = call i32 @assert(i32 %12)
store i32 100, i32* %5
%14 = getelementptr inbounds [100 x i32], [100 x i32]* %4, i64 0, i64 0
%15 = load i32, i32* %5
%16 = call i32 @bubble_sort(i32* %14, i32 %15)
%17 = getelementptr inbounds [100 x i32], [100 x i32]* %4, i64 0, i64 0
%18 = load i32, i32* %5
%19 = call i32 @check_if_not_sorted(i32* %17, i32 %18)
%20 = call i32 @assert(i32 %19)
ret i32 0
}

LLVM IR (-O2):
@__const.main.array0 = [8 x i32] [i32 5, i32 6, i32 7, i32 8, i32 1, i32 2, i32 3, i32 4]
define i32 @main() {
%1 = alloca [8 x i32]
%2 = alloca [100 x i32]
%3 = bitcast [8 x i32]* %1 to i8*
%4 = getelementptr inbounds [8 x i32], [8 x i32]* %1, i64 0, i64 0
%5 = call i32 @bubble_sort(i32* %4, i32 8)
%6 = call i32 @check_if_not_sorted(i32* %4, i32 8)
%7 = call i32 @assert(i32 %6)
%8 = bitcast [100 x i32]* %2 to i8*
%9 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%10 = call i32 @bubble_sort(i32* %9, i32 100)
%11 = call i32 @check_if_not_sorted(i32* %9, i32 100)
%12 = call i32 @assert(i32 %11)
ret i32 0
}