#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 *, unsigned int, unsigned int, int (*)(int, int));
void quick_sort(int *collection, unsigned int low, unsigned int high,
                int (*comp)(int, int)) {
  if (low < high) {
    int p = partition(collection, low, high, comp);
    quick_sort(collection, low, p, comp);
    quick_sort(collection, p + 1, high, comp);
  }
}


x86 assembly (clang, -O0):
<quick_sort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %esi,-0xc(%rbp)
mov    %edx,-0x10(%rbp)
mov    %rcx,-0x18(%rbp)
mov    -0xc(%rbp),%eax
cmp    -0x10(%rbp),%eax
jae    1181 <quick_sort+0x61>
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
mov    -0x10(%rbp),%edx
mov    -0x18(%rbp),%rcx
call   1030 <partition@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
mov    -0x1c(%rbp),%edx
mov    -0x18(%rbp),%rcx
call   1040 <quick_sort@plt>
mov    -0x8(%rbp),%rdi
mov    -0x1c(%rbp),%esi
add    $0x1,%esi
mov    -0x10(%rbp),%edx
mov    -0x18(%rbp),%rcx
call   1040 <quick_sort@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<quick_sort>:
push   %rbp
push   %r15
push   %r14
push   %r12
push   %rbx
cmp    %edx,%esi
jae    116b <quick_sort+0x4b>
mov    %rcx,%r14
mov    %edx,%r15d
mov    %esi,%ebx
mov    %rdi,%r12
nopw   0x0(%rax,%rax,1)
mov    %r12,%rdi
mov    %ebx,%esi
mov    %r15d,%edx
mov    %r14,%rcx
call   1030 <partition@plt>
mov    %eax,%ebp
mov    %r12,%rdi
mov    %ebx,%esi
mov    %eax,%edx
mov    %r14,%rcx
call   1040 <quick_sort@plt>
add    $0x1,%ebp
mov    %ebp,%ebx
cmp    %r15d,%ebp
jb     1140 <quick_sort+0x20>
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
ret

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

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