#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*/ QuickSort(int *, int /*<<< orphan*/, int);
int /*<<< orphan*/ print(int *, int /*<<< orphan*/, int);
int /*<<< orphan*/ printf(char *);
int main() {
  int arr[] = {10, 80, 30, 90, 40, 50, 70};
  int n = sizeof(arr) / sizeof(arr[0]);
  printf("before: ");
  print(arr, 0, n - 1);
  QuickSort(arr, 0, n - 1);
  printf("after : ");
  print(arr, 0, n - 1);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x30,%rsp
mov    0xec1(%rip),%rax
mov    %rax,-0x20(%rbp)
mov    0xebe(%rip),%rax
mov    %rax,-0x18(%rbp)
mov    0xebb(%rip),%rax
mov    %rax,-0x10(%rbp)
mov    0xeb9(%rip),%eax
mov    %eax,-0x8(%rbp)
movl   $0x7,-0x24(%rbp)
lea    0xeac(%rip),%rdi
call   1030 <printf@plt>
lea    -0x20(%rbp),%rdi
mov    -0x24(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1040 <print@plt>
lea    -0x20(%rbp),%rdi
mov    -0x24(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1050 <QuickSort@plt>
lea    0xe87(%rip),%rdi
call   1030 <printf@plt>
lea    -0x20(%rbp),%rdi
mov    -0x24(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1040 <print@plt>
xor    %eax,%eax
add    $0x30,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
sub    $0x20,%rsp
movups 0xed0(%rip),%xmm0
movups %xmm0,0xc(%rsp)
movaps 0xeb8(%rip),%xmm0
movaps %xmm0,(%rsp)
lea    0xec9(%rip),%rdi
call   1030 <printf@plt>
mov    %rsp,%rbx
mov    %rbx,%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1040 <print@plt>
mov    %rbx,%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1050 <QuickSort@plt>
lea    0xea5(%rip),%rdi
call   1030 <printf@plt>
mov    %rbx,%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1040 <print@plt>
xor    %eax,%eax
add    $0x20,%rsp
pop    %rbx
ret

LLVM IR (-O0):
@__const.main.arr = [7 x i32] [i32 10, i32 80, i32 30, i32 90, i32 40, i32 50, i32 70]
@.str = [9 x i8] c"before: \00"
@.str.1 = [9 x i8] c"after : \00"
define i32 @main() {
%1 = alloca [7 x i32]
%2 = alloca i32
%3 = bitcast [7 x i32]* %1 to i8*
store i32 7, i32* %2
%4 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0))
%5 = getelementptr inbounds [7 x i32], [7 x i32]* %1, i64 0, i64 0
%6 = load i32, i32* %2
%7 = sub nsw i32 %6, 1
%8 = call i32 @print(i32* %5, i32 0, i32 %7)
%9 = getelementptr inbounds [7 x i32], [7 x i32]* %1, i64 0, i64 0
%10 = load i32, i32* %2
%11 = sub nsw i32 %10, 1
%12 = call i32 @QuickSort(i32* %9, i32 0, i32 %11)
%13 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.1, i64 0, i64 0))
%14 = getelementptr inbounds [7 x i32], [7 x i32]* %1, i64 0, i64 0
%15 = load i32, i32* %2
%16 = sub nsw i32 %15, 1
%17 = call i32 @print(i32* %14, i32 0, i32 %16)
ret i32 0
}

LLVM IR (-O2):
@__const.main.arr = [7 x i32] [i32 10, i32 80, i32 30, i32 90, i32 40, i32 50, i32 70]
@.str = [9 x i8] c"before: \00"
@.str.1 = [9 x i8] c"after : \00"
define i32 @main() {
%1 = alloca [7 x i32]
%2 = bitcast [7 x i32]* %1 to i8*
%3 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0))
%4 = getelementptr inbounds [7 x i32], [7 x i32]* %1, i64 0, i64 0
%5 = call i32 @print(i32* %4, i32 0, i32 6)
%6 = call i32 @QuickSort(i32* %4, i32 0, i32 6)
%7 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @.str.1, i64 0, i64 0))
%8 = call i32 @print(i32* %4, i32 0, i32 6)
ret i32 0
}