#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*/ printArray(int *, int);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ quickSort(int *, int);
void test_quickSort() {
  printf("TEST: quickSort\n");
  int test[] = {8, 1, 4, 9, 0, 3, 5, 2, 7, 6};
  printf("Before quickSort: ");
  printArray(test, 10);
  quickSort(test, 10);
  printf("After quickSort: ");
  printArray(test, 10);
}


x86 assembly (clang, -O0):
<test_quickSort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x30,%rsp
lea    0xeb1(%rip),%rdi
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
lea    0xee1(%rip),%rsi
mov    $0x28,%edx
call   1040 <memcpy@plt>
lea    0xea1(%rip),%rdi
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0xa,%esi
call   1060 <printArray@plt>
lea    -0x30(%rbp),%rdi
mov    $0xa,%esi
call   1050 <quickSort@plt>
lea    0xe8c(%rip),%rdi
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0xa,%esi
call   1060 <printArray@plt>
add    $0x30,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_quickSort>:
push   %rbx
sub    $0x30,%rsp
lea    0xf01(%rip),%rdi
call   1030 <puts@plt>
mov    0xec8(%rip),%rax
mov    %rax,0x20(%rsp)
movaps 0xeac(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xe90(%rip),%xmm0
movaps %xmm0,(%rsp)
lea    0xead(%rip),%rdi
call   1040 <printf@plt>
mov    %rsp,%rbx
mov    %rbx,%rdi
mov    $0xa,%esi
call   1060 <printArray@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1050 <quickSort@plt>
lea    0xe97(%rip),%rdi
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1060 <printArray@plt>
add    $0x30,%rsp
pop    %rbx
ret

LLVM IR (-O0):
@.str = [17 x i8] c"TEST: quickSort\0A\00"
@__const.test_quickSort.test = [10 x i32] [i32 8, i32 1, i32 4, i32 9, i32 0, i32 3, i32 5, i32 2, i32 7, i32 6]
@.str.1 = [19 x i8] c"Before quickSort: \00"
@.str.2 = [18 x i8] c"After quickSort: \00"
define void @test_quickSort() {
%1 = alloca [10 x i32]
%2 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str, i64 0, i64 0))
%3 = bitcast [10 x i32]* %1 to i8*
%4 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.1, i64 0, i64 0))
%5 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%6 = call i32 @printArray(i32* %5, i32 10)
%7 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%8 = call i32 @quickSort(i32* %7, i32 10)
%9 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.2, i64 0, i64 0))
%10 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%11 = call i32 @printArray(i32* %10, i32 10)
ret void
}

LLVM IR (-O2):
@__const.test_quickSort.test = [10 x i32] [i32 8, i32 1, i32 4, i32 9, i32 0, i32 3, i32 5, i32 2, i32 7, i32 6]
@.str.1 = [19 x i8] c"Before quickSort: \00"
@.str.2 = [18 x i8] c"After quickSort: \00"
@str = [16 x i8] c"TEST: quickSort\00"
define void @test_quickSort() {
%1 = alloca [10 x i32]
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str, i64 0, i64 0))
%3 = bitcast [10 x i32]* %1 to i8*
%4 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([19 x i8], [19 x i8]* @.str.1, i64 0, i64 0))
%5 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%6 = call i32 @printArray(i32* %5, i32 10)
%7 = call i32 @quickSort(i32* %5, i32 10)
%8 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @.str.2, i64 0, i64 0))
%9 = call i32 @printArray(i32* %5, i32 10)
ret void
}