#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*/ data;

/* Variables and functions */
int /*<<< orphan*/ mergeSort(int *, int);
int /*<<< orphan*/ printf(char *);
void testMergeSort() {
  printf("---------- MergeSort ----------\n");
  {
    int data[] = {11, 99, 33, 55, 77, 66, 22, 88, 44};
    int size = sizeof(data) / sizeof(int);
    mergeSort(data, size);
  }
  printf("----------\n");
  {
    int data[] = {11, 4,  99, 33, 8, 55, 9,  77, 2,
                  3,  66, 5,  22, 6, 1,  88, 7,  44};
    int size = sizeof(data) / sizeof(int);
    mergeSort(data, size);
  }
}


x86 assembly (clang, -O0):
<testMergeSort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x90,%rsp
lea    0xebe(%rip),%rdi
call   1030 <printf@plt>
lea    -0x30(%rbp),%rdi
lea    0xede(%rip),%rsi
mov    $0x24,%edx
call   1040 <memcpy@plt>
movl   $0x9,-0x34(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x34(%rbp),%esi
call   1050 <mergeSort@plt>
lea    0xe9f(%rip),%rdi
call   1030 <printf@plt>
lea    -0x80(%rbp),%rdi
lea    0xeda(%rip),%rsi
mov    $0x48,%edx
call   1040 <memcpy@plt>
movl   $0x12,-0x84(%rbp)
lea    -0x80(%rbp),%rdi
mov    -0x84(%rbp),%esi
call   1050 <mergeSort@plt>
add    $0x90,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<testMergeSort>:
sub    $0x48,%rsp
lea    0xf4d(%rip),%rdi
call   1030 <puts@plt>
mov    0xeea(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xecf(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeb3(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rdi
mov    $0x9,%esi
call   1040 <mergeSort@plt>
lea    0xf28(%rip),%rdi
call   1030 <puts@plt>
mov    0xeff(%rip),%rax
mov    %rax,0x40(%rsp)
movaps 0xee3(%rip),%xmm0
movaps %xmm0,0x30(%rsp)
movaps 0xec7(%rip),%xmm0
movaps %xmm0,0x20(%rsp)
movaps 0xeab(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xe8f(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%rdi
mov    $0x12,%esi
call   1040 <mergeSort@plt>
add    $0x48,%rsp
ret

LLVM IR (-O0):
@.str = [33 x i8] c"---------- MergeSort ----------\0A\00"
@__const.testMergeSort.data = [9 x i32] [i32 11, i32 99, i32 33, i32 55, i32 77, i32 66, i32 22, i32 88, i32 44]
@.str.1 = [12 x i8] c"----------\0A\00"
@__const.testMergeSort.data.2 = [18 x i32] [i32 11, i32 4, i32 99, i32 33, i32 8, i32 55, i32 9, i32 77, i32 2, i32 3, i32 66, i32 5, i32 22, i32 6, i32 1, i32 88, i32 7, i32 44]
define void @testMergeSort() {
%1 = alloca [9 x i32]
%2 = alloca i32
%3 = alloca [18 x i32]
%4 = alloca i32
%5 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0))
%6 = bitcast [9 x i32]* %1 to i8*
store i32 9, i32* %2
%7 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%8 = load i32, i32* %2
%9 = call i32 @mergeSort(i32* %7, i32 %8)
%10 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.1, i64 0, i64 0))
%11 = bitcast [18 x i32]* %3 to i8*
store i32 18, i32* %4
%12 = getelementptr inbounds [18 x i32], [18 x i32]* %3, i64 0, i64 0
%13 = load i32, i32* %4
%14 = call i32 @mergeSort(i32* %12, i32 %13)
ret void
}

LLVM IR (-O2):
@__const.testMergeSort.data = [9 x i32] [i32 11, i32 99, i32 33, i32 55, i32 77, i32 66, i32 22, i32 88, i32 44]
@__const.testMergeSort.data.2 = [18 x i32] [i32 11, i32 4, i32 99, i32 33, i32 8, i32 55, i32 9, i32 77, i32 2, i32 3, i32 66, i32 5, i32 22, i32 6, i32 1, i32 88, i32 7, i32 44]
@str = [32 x i8] c"---------- MergeSort ----------\00"
@str.3 = [11 x i8] c"----------\00"
define void @testMergeSort() {
%1 = alloca [9 x i32]
%2 = alloca [18 x i32]
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str, i64 0, i64 0))
%4 = bitcast [9 x i32]* %1 to i8*
%5 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%6 = call i32 @mergeSort(i32* %5, i32 9)
%7 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.3, i64 0, i64 0))
%8 = bitcast [18 x i32]* %2 to i8*
%9 = getelementptr inbounds [18 x i32], [18 x i32]* %2, i64 0, i64 0
%10 = call i32 @mergeSort(i32* %9, i32 18)
ret void
}