#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*/ exit(int);
int /*<<< orphan*/ printf(char *, ...);
void syntax_error(char *arg0) {
  printf("Syntax error - Usage:\n");
  printf("%s -q -h -m -s -c  [mem size] \n", arg0);
  printf("\t-q Perofrms a Quick Sort\n");
  printf("\t-h Performs a Heap Sort\n");
  printf("\t-m Perofrms a Merge Sort(Note: Merge sort, needs 1.5x more memory "
         "than other sorts\n");
  printf("\t-s Performs a Shell Sort(Warning: Extremely slow!)\n");
  printf("\t-c Partions memory into chunks and sorts each chunk locally\n");
  printf("\t[mem size]	Memory size to be tested(in MB)\n", arg0);
  exit(1);
}


x86 assembly (clang, -O0):
<syntax_error>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
lea    0xecd(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%rsi
lea    0xed2(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xee4(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xef1(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xefd(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf44(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf6b(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%rsi
lea    0xf97(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    $0x1,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<syntax_error>:
push   %rbx
mov    %rdi,%rbx
lea    0xee5(%rip),%rdi
call   1030 <puts@plt>
lea    0xeb9(%rip),%rdi
mov    %rbx,%rsi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xede(%rip),%rdi
call   1030 <puts@plt>
lea    0xeec(%rip),%rdi
call   1030 <puts@plt>
lea    0xef9(%rip),%rdi
call   1030 <puts@plt>
lea    0xf41(%rip),%rdi
call   1030 <puts@plt>
lea    0xf69(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9a(%rip),%rdi
call   1030 <puts@plt>
mov    $0x1,%edi
call   1050 <exit@plt>

LLVM IR (-O0):
@.str = [23 x i8] c"Syntax error - Usage:\0A\00"
@.str.1 = [32 x i8] c"%s -q -h -m -s -c [mem size] \0A\00"
@.str.2 = [27 x i8] c"\09-q Perofrms a Quick Sort\0A\00"
@.str.3 = [26 x i8] c"\09-h Performs a Heap Sort\0A\00"
@.str.4 = [85 x i8] c"\09-m Perofrms a Merge Sort(Note: Merge sort, needs 1.5x more memory than other sorts\0A\00"
@.str.5 = [53 x i8] c"\09-s Performs a Shell Sort(Warning: Extremely slow!)\0A\00"
@.str.6 = [62 x i8] c"\09-c Partions memory into chunks and sorts each chunk locally\0A\00"
@.str.7 = [45 x i8] c"\09[mem size]\09Memory size to be tested(in MB)\0A\00"
define void @syntax_error(i8* %0) {
%2 = alloca i8*
store i8* %0, i8** %2
%3 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str, i64 0, i64 0))
%4 = load i8*, i8** %2
%5 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.1, i64 0, i64 0), i8* %4)
%6 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.2, i64 0, i64 0))
%7 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([85 x i8], [85 x i8]* @.str.4, i64 0, i64 0))
%9 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.5, i64 0, i64 0))
%10 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.6, i64 0, i64 0))
%11 = load i8*, i8** %2
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.7, i64 0, i64 0), i8* %11)
%13 = call i32 @exit(i32 1)
unreachable
}

LLVM IR (-O2):
@.str.1 = [32 x i8] c"%s -q -h -m -s -c [mem size] \0A\00"
@str = [22 x i8] c"Syntax error - Usage:\00"
@str.8 = [26 x i8] c"\09-q Perofrms a Quick Sort\00"
@str.9 = [25 x i8] c"\09-h Performs a Heap Sort\00"
@str.10 = [84 x i8] c"\09-m Perofrms a Merge Sort(Note: Merge sort, needs 1.5x more memory than other sorts\00"
@str.11 = [52 x i8] c"\09-s Performs a Shell Sort(Warning: Extremely slow!)\00"
@str.12 = [61 x i8] c"\09-c Partions memory into chunks and sorts each chunk locally\00"
@str.13 = [44 x i8] c"\09[mem size]\09Memory size to be tested(in MB)\00"
define void @syntax_error(i8* %0) {
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @.str.1, i64 0, i64 0), i8* %0)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.8, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.9, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([84 x i8], [84 x i8]* @str.10, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.11, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.12, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.13, i64 0, i64 0))
%10 = tail call i32 @exit(i32 1)
unreachable
}