#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*/ printf(char *);
void problemUsage() {
  printf("   -a declares that the array should be sorted ascending for worst "
         "case behavior. Incompatible with -d\n");
  printf("   -d declares that the array should be sorted ascending for worst "
         "case behavior. Incompatible with -a\n");
  printf("   -g define the groupings size for worst-case linear kth selection "
         "algorithm.\n");
  printf("   -k declares that the array should be prepared according to the "
         "median-of-3 killer algorithm, Musser (1997)\n");
  printf("   -u #,# determines number of pairs out of order, if sorted, and "
         "distance with which to swap.\n");
  printf("   -w instead of random permutations of alphabet string, draw words "
         "from 160,136 English word dictionary\n");
}


x86 assembly (clang, -O0):
<problemUsage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf41(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9d(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe1(%rip),%rdi
call   1030 <printf@plt>
lea    0x1044(%rip),%rdi
call   1030 <printf@plt>
lea    0x1098(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<problemUsage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf43(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9e(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe1(%rip),%rdi
call   1030 <puts@plt>
lea    0x1043(%rip),%rdi
call   1030 <puts@plt>
lea    0x1096(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [104 x i8] c" -a declares that the array should be sorted ascending for worst case behavior. Incompatible with -d\0A\00"
@.str.1 = [104 x i8] c" -d declares that the array should be sorted ascending for worst case behavior. Incompatible with -a\0A\00"
@.str.2 = [80 x i8] c" -g define the groupings size for worst-case linear kth selection algorithm.\0A\00"
@.str.3 = [111 x i8] c" -k declares that the array should be prepared according to the median-of-3 killer algorithm, Musser (1997)\0A\00"
@.str.4 = [96 x i8] c" -u #,# determines number of pairs out of order, if sorted, and distance with which to swap.\0A\00"
@.str.5 = [106 x i8] c" -w instead of random permutations of alphabet string, draw words from 160,136 English word dictionary\0A\00"
define void @problemUsage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([104 x i8], [104 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([104 x i8], [104 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([111 x i8], [111 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([96 x i8], [96 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([106 x i8], [106 x i8]* @.str.5, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [103 x i8] c" -a declares that the array should be sorted ascending for worst case behavior. Incompatible with -d\00"
@str.6 = [103 x i8] c" -d declares that the array should be sorted ascending for worst case behavior. Incompatible with -a\00"
@str.7 = [79 x i8] c" -g define the groupings size for worst-case linear kth selection algorithm.\00"
@str.8 = [110 x i8] c" -k declares that the array should be prepared according to the median-of-3 killer algorithm, Musser (1997)\00"
@str.9 = [95 x i8] c" -u #,# determines number of pairs out of order, if sorted, and distance with which to swap.\00"
@str.10 = [105 x i8] c" -w instead of random permutations of alphabet string, draw words from 160,136 English word dictionary\00"
define void @problemUsage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([103 x i8], [103 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([103 x i8], [103 x i8]* @str.6, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.7, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([110 x i8], [110 x i8]* @str.8, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([95 x i8], [95 x i8]* @str.9, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([105 x i8], [105 x i8]* @str.10, i64 0, i64 0))
ret void
}