#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("\n");
  printf("Note that problem size is the NUMBER of searches to execute.\n\n");
  printf("   -p n Ratio in range [0,1] of available elements in target "
         "[default: .25] \n");
  printf("   -d s Distribution type ('u' for uniform, 'w' for weighted) "
         "[default: u]\n");
  printf(
      "   -e n Size of the element Strings drawn from {a,b}* [default: 6]\n");
  printf("   -f   Always search for the first element in list [default: 0]\n");
  printf("   -v   Verbose. Print all elements once done [default: no]\n");
  printf("   -z n Size of the linear list being searched. [default: 50]\n");
}


x86 assembly (clang, -O0):
<problemUsage>:
push   %rbp
mov    %rsp,%rbp
lea    0xf22(%rip),%rdi
call   1030 <printf@plt>
lea    0xed9(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf8e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfc6(%rip),%rdi
call   1030 <printf@plt>
lea    0xffc(%rip),%rdi
call   1030 <printf@plt>
lea    0x102d(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<problemUsage>:
push   %rax
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xece(%rip),%rdi
call   1040 <puts@plt>
lea    0xf00(%rip),%rdi
call   1040 <puts@plt>
lea    0xf41(%rip),%rdi
call   1040 <puts@plt>
lea    0xf80(%rip),%rdi
call   1040 <puts@plt>
lea    0xfb7(%rip),%rdi
call   1040 <puts@plt>
lea    0xfec(%rip),%rdi
call   1040 <puts@plt>
lea    0x101c(%rip),%rdi
pop    %rax
jmp    1040 <puts@plt>

LLVM IR (-O0):
@.str = [2 x i8] c"\0A\00"
@.str.1 = [63 x i8] c"Note that problem size is the NUMBER of searches to execute.\0A\0A\00"
@.str.2 = [78 x i8] c" -p n Ratio in range [0,1] of available elements in target [default: .25] \0A\00"
@.str.3 = [76 x i8] c" -d s Distribution type ('u' for uniform, 'w' for weighted) [default: u]\0A\00"
@.str.4 = [68 x i8] c" -e n Size of the element Strings drawn from {a,b}* [default: 6]\0A\00"
@.str.5 = [66 x i8] c" -f Always search for the first element in list [default: 0]\0A\00"
@.str.6 = [61 x i8] c" -v Verbose. Print all elements once done [default: no]\0A\00"
@.str.7 = [63 x i8] c" -z n Size of the linear list being searched. [default: 50]\0A\00"
define void @problemUsage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.7, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [62 x i8] c"Note that problem size is the NUMBER of searches to execute.\0A\00"
@str.8 = [77 x i8] c" -p n Ratio in range [0,1] of available elements in target [default: .25] \00"
@str.9 = [75 x i8] c" -d s Distribution type ('u' for uniform, 'w' for weighted) [default: u]\00"
@str.10 = [67 x i8] c" -e n Size of the element Strings drawn from {a,b}* [default: 6]\00"
@str.11 = [65 x i8] c" -f Always search for the first element in list [default: 0]\00"
@str.12 = [60 x i8] c" -v Verbose. Print all elements once done [default: no]\00"
@str.13 = [62 x i8] c" -z n Size of the linear list being searched. [default: 50]\00"
define void @problemUsage() {
%1 = tail call i32 @putchar(i32 10)
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.8, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.9, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.10, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.11, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.12, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.13, i64 0, i64 0))
ret void
}