#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*/ mergeArray(int *, int, int, int, int *);
void mergeSort(int a[], int first, int last, int temp[]) {
  if (first < last) {
    int mid = (first + last) / 2;
    mergeSort(a, first, mid, temp);
    mergeSort(a, mid + 1, last, temp);
    mergeArray(a, first, mid, last, temp);
  }
}


x86 assembly (clang, -O0):
<mergeSort>:
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
jge    1192 <mergeSort+0x72>
mov    -0xc(%rbp),%eax
add    -0x10(%rbp),%eax
mov    $0x2,%ecx
cltd
idiv   %ecx
mov    %eax,-0x1c(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
mov    -0x1c(%rbp),%edx
mov    -0x18(%rbp),%rcx
call   1040 <mergeSort@plt>
mov    -0x8(%rbp),%rdi
mov    -0x1c(%rbp),%esi
add    $0x1,%esi
mov    -0x10(%rbp),%edx
mov    -0x18(%rbp),%rcx
call   1040 <mergeSort@plt>
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
mov    -0x1c(%rbp),%edx
mov    -0x10(%rbp),%ecx
mov    -0x18(%rbp),%r8
call   1030 <mergeArray@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<mergeSort>:
cmp    %edx,%esi
jge    117a <mergeSort+0x5a>
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
mov    %rcx,%r14
mov    %edx,%r15d
mov    %esi,%r13d
mov    %rdi,%r12
lea    (%r15,%r13,1),%eax
mov    %eax,%ebx
shr    $0x1f,%ebx
add    %eax,%ebx
sar    %ebx
mov    %ebx,%edx
call   1040 <mergeSort@plt>
lea    0x1(%rbx),%esi
mov    %r12,%rdi
mov    %r15d,%edx
mov    %r14,%rcx
call   1040 <mergeSort@plt>
mov    %r12,%rdi
mov    %r13d,%esi
mov    %ebx,%edx
mov    %r15d,%ecx
mov    %r14,%r8
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
jmp    1030 <mergeArray@plt>
ret

LLVM IR (-O0):
define void @mergeSort(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
%10 = load i32, i32* %6
%11 = load i32, i32* %7
%12 = icmp slt i32 %10, %11
br i1 %12, label %13, label %33
13: ; preds = %4
%14 = load i32, i32* %6
%15 = load i32, i32* %7
%16 = add nsw i32 %14, %15
%17 = sdiv i32 %16, 2
store i32 %17, i32* %9
%18 = load i32*, i32** %5
%19 = load i32, i32* %6
%20 = load i32, i32* %9
%21 = load i32*, i32** %8
%22 = load i32*, i32** %5
%23 = load i32, i32* %9
%24 = add nsw i32 %23, 1
%25 = load i32, i32* %7
%26 = load i32*, i32** %8
%27 = load i32*, i32** %5
%28 = load i32, i32* %6
%29 = load i32, i32* %9
%30 = load i32, i32* %7
%31 = load i32*, i32** %8
%32 = call i32 @mergeArray(i32* %27, i32 %28, i32 %29, i32 %30, i32* %31)
br label %33
33: ; preds = %13, %4
ret void
}

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