#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 partition(int *, int *, int, int);
void quickSort(int *a, int *b, int left, int right) {
  int q = 0;
  if (left < right) {
    q = partition(a, b, left, right);
    quickSort(a, b, left, q);
    quickSort(a, b, q + 1, right);
  }
}


x86 assembly (clang, -O0):
<quickSort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
mov    %edx,-0x14(%rbp)
mov    %ecx,-0x18(%rbp)
movl   $0x0,-0x1c(%rbp)
mov    -0x14(%rbp),%eax
cmp    -0x18(%rbp),%eax
jge    1188 <quickSort+0x68>
mov    -0x8(%rbp),%rdi
mov    -0x10(%rbp),%rsi
mov    -0x14(%rbp),%edx
mov    -0x18(%rbp),%ecx
call   1030 <partition@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0x10(%rbp),%rsi
mov    -0x14(%rbp),%edx
mov    -0x1c(%rbp),%ecx
call   1040 <quickSort@plt>
mov    -0x8(%rbp),%rdi
mov    -0x10(%rbp),%rsi
mov    -0x1c(%rbp),%edx
add    $0x1,%edx
mov    -0x18(%rbp),%ecx
call   1040 <quickSort@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<quickSort>:
push   %rbp
push   %r15
push   %r14
push   %r12
push   %rbx
cmp    %ecx,%edx
jge    116b <quickSort+0x4b>
mov    %ecx,%r14d
mov    %edx,%ebp
mov    %rsi,%r15
mov    %rdi,%r12
nopw   0x0(%rax,%rax,1)
mov    %r12,%rdi
mov    %r15,%rsi
mov    %ebp,%edx
mov    %r14d,%ecx
call   1030 <partition@plt>
mov    %eax,%ebx
mov    %r12,%rdi
mov    %r15,%rsi
mov    %ebp,%edx
mov    %eax,%ecx
call   1040 <quickSort@plt>
add    $0x1,%ebx
mov    %ebx,%ebp
cmp    %r14d,%ebx
jl     1140 <quickSort+0x20>
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
define void @quickSort(i32* %0, i32* %1, i32 %2, i32 %3) {
%5 = alloca i32*
%6 = alloca i32*
%7 = alloca i32
%8 = alloca i32
%9 = alloca i32
store i32* %0, i32** %5
store i32* %1, i32** %6
store i32 %2, i32* %7
store i32 %3, i32* %8
store i32 0, i32* %9
%10 = load i32, i32* %7
%11 = load i32, i32* %8
%12 = icmp slt i32 %10, %11
br i1 %12, label %13, label %28
13: ; preds = %4
%14 = load i32*, i32** %5
%15 = load i32*, i32** %6
%16 = load i32, i32* %7
%17 = load i32, i32* %8
%18 = call i32 @partition(i32* %14, i32* %15, i32 %16, i32 %17)
store i32 %18, i32* %9
%19 = load i32*, i32** %5
%20 = load i32*, i32** %6
%21 = load i32, i32* %7
%22 = load i32, i32* %9
%23 = load i32*, i32** %5
%24 = load i32*, i32** %6
%25 = load i32, i32* %9
%26 = add nsw i32 %25, 1
%27 = load i32, i32* %8
br label %28
28: ; preds = %13, %4
ret void
}

LLVM IR (-O2):
define void @quickSort(i32* %0, i32* %1, i32 %2, i32 %3) {
%5 = icmp slt i32 %2, %3
br i1 %5, label %6, label %11
6: ; preds = %4, %6
%7 = phi i32 [ %9, %6 ], [ %2, %4 ]
%8 = tail call i32 @partition(i32* %0, i32* %1, i32 %7, i32 %3)
tail call void @quickSort(i32* %0, i32* %1, i32 %7, i32 %8)
%9 = add nsw i32 %8, 1
%10 = icmp slt i32 %9, %3
br i1 %10, label %6, label %11
11: ; preds = %6, %4
ret void
}