#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 print_help() {
  printf(" genfib version 0.1\n");
  printf(" Licensed under the MIT License\n");
  printf(" Copyright Steven Velozo (steven@velozo.com) 2013\n");
  printf("\n");
  printf("   Command Line Arguments:\n");
  printf(" --------------------------------\n");
  printf(" -h                         Show the CSV Header\n");
  printf(" -a                         Show Column Value\n");
  printf(" -d                         Show Row Value\n");
  printf(" -s                         Show the Approximate Number of "
         "Characters\n");
  printf(" -o                         Show the Ordinal\n");
  printf(" -r [number]                Show [number] Rows (default 10)\n");
  printf(" -R [iteration_number]      Use [iteration_number] Algorithm for Row "
         "Values\n");
  printf(" -c [number]                Show [number] Columns (default 10)\n");
  printf(" -C [iteration_number]      Use [iteration_number] Algorithm for "
         "Column Values\n");
  printf(" -I [computation_style]     Use [computation_style] for "
         "Intersections\n");
  printf(" -?                         Show help\n");
  printf("\n");
  printf("   Iteration Styles:\n");
  printf(" -------------------------------\n");
  printf(" 1 . . . . . . . . . . Fibonacci\n");
  printf(" 2 . . . . . . . . . . . . Lucas\n");
  printf(" 3 . . . . . . . . . Incremental\n");
  printf(" 4 . . . . . . . . . . . Padovan\n");
  printf(" 5 . . . . . . . . . . . .  Pell\n");
  printf("\n");
  printf("   Computation Styles:\n");
  printf(" -------------------------------\n");
  printf(" 1 . . . . . . . . . . .  Modulo\n");
  printf(" 2 . . . . . . . . . . .  Divide\n");
  printf(" 3 . . . . . . . . . .  Multiply\n");
  printf(" 4 . . . . . . . . . . . . . Add\n");
  printf(" 5 . .. . . . . . . . . Subtract\n");
  printf("\n");
  return;
}


x86 assembly (clang, -O0):
<print_help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xeee(%rip),%rdi
call   1030 <printf@plt>
lea    0xf03(%rip),%rdi
call   1030 <printf@plt>
lea    0x1132(%rip),%rdi
call   1030 <printf@plt>
lea    0xf1e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf45(%rip),%rdi
call   1030 <printf@plt>
lea    0xf6a(%rip),%rdi
call   1030 <printf@plt>
lea    0xf8d(%rip),%rdi
call   1030 <printf@plt>
lea    0xfad(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe8(%rip),%rdi
call   1030 <printf@plt>
lea    0x100a(%rip),%rdi
call   1030 <printf@plt>
lea    0x103b(%rip),%rdi
call   1030 <printf@plt>
lea    0x107c(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b0(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f4(%rip),%rdi
call   1030 <printf@plt>
lea    0x112f(%rip),%rdi
call   1030 <printf@plt>
lea    0x108a(%rip),%rdi
call   1030 <printf@plt>
lea    0x113e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1148(%rip),%rdi
call   1030 <printf@plt>
lea    0x115e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1174(%rip),%rdi
call   1030 <printf@plt>
lea    0x118a(%rip),%rdi
call   1030 <printf@plt>
lea    0x11a0(%rip),%rdi
call   1030 <printf@plt>
lea    0x11b6(%rip),%rdi
call   1030 <printf@plt>
lea    0x102a(%rip),%rdi
call   1030 <printf@plt>
lea    0x11c0(%rip),%rdi
call   1030 <printf@plt>
lea    0x10e8(%rip),%rdi
call   1030 <printf@plt>
lea    0x11c0(%rip),%rdi
call   1030 <printf@plt>
lea    0x11d6(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ec(%rip),%rdi
call   1030 <printf@plt>
lea    0x1202(%rip),%rdi
call   1030 <printf@plt>
lea    0x1218(%rip),%rdi
call   1030 <printf@plt>
lea    0xfca(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_help>:
push   %rbx
lea    0xed8(%rip),%rdi
call   1040 <puts@plt>
lea    0xee0(%rip),%rdi
call   1040 <puts@plt>
lea    0xef4(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xf10(%rip),%rdi
call   1040 <puts@plt>
lea    0xf1f(%rip),%rdi
call   1040 <puts@plt>
lea    0xf35(%rip),%rdi
call   1040 <puts@plt>
lea    0xf59(%rip),%rdi
call   1040 <puts@plt>
lea    0xf7b(%rip),%rdi
call   1040 <puts@plt>
lea    0xf9a(%rip),%rdi
call   1040 <puts@plt>
lea    0xfd4(%rip),%rdi
call   1040 <puts@plt>
lea    0xff5(%rip),%rdi
call   1040 <puts@plt>
lea    0x1025(%rip),%rdi
call   1040 <puts@plt>
lea    0x1065(%rip),%rdi
call   1040 <puts@plt>
lea    0x1098(%rip),%rdi
call   1040 <puts@plt>
lea    0x10db(%rip),%rdi
call   1040 <puts@plt>
lea    0x1115(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1125(%rip),%rdi
call   1040 <puts@plt>
lea    0x11ea(%rip),%rbx
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0x111f(%rip),%rdi
call   1040 <puts@plt>
lea    0x1134(%rip),%rdi
call   1040 <puts@plt>
lea    0x1149(%rip),%rdi
call   1040 <puts@plt>
lea    0x115e(%rip),%rdi
call   1040 <puts@plt>
lea    0x1173(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x117e(%rip),%rdi
call   1040 <puts@plt>
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0x11a2(%rip),%rdi
call   1040 <puts@plt>
lea    0x11b7(%rip),%rdi
call   1040 <puts@plt>
lea    0x11cc(%rip),%rdi
call   1040 <puts@plt>
lea    0x11e1(%rip),%rdi
call   1040 <puts@plt>
lea    0x11f6(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rbx
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [21 x i8] c" genfib version 0.1\0A\00"
@.str.1 = [33 x i8] c" Licensed under the MIT License\0A\00"
@.str.2 = [51 x i8] c" Copyright Steven Velozo (steven@velozo.com) 2013\0A\00"
@.str.3 = [2 x i8] c"\0A\00"
@.str.4 = [28 x i8] c" Command Line Arguments:\0A\00"
@.str.5 = [35 x i8] c" --------------------------------\0A\00"
@.str.6 = [49 x i8] c" -h Show the CSV Header\0A\00"
@.str.7 = [47 x i8] c" -a Show Column Value\0A\00"
@.str.8 = [44 x i8] c" -d Show Row Value\0A\00"
@.str.9 = [71 x i8] c" -s Show the Approximate Number of Characters\0A\00"
@.str.10 = [46 x i8] c" -o Show the Ordinal\0A\00"
@.str.11 = [61 x i8] c" -r [number] Show [number] Rows (default 10)\0A\00"
@.str.12 = [77 x i8] c" -R [iteration_number] Use [iteration_number] Algorithm for Row Values\0A\00"
@.str.13 = [64 x i8] c" -c [number] Show [number] Columns (default 10)\0A\00"
@.str.14 = [80 x i8] c" -C [iteration_number] Use [iteration_number] Algorithm for Column Values\0A\00"
@.str.15 = [71 x i8] c" -I [computation_style] Use [computation_style] for Intersections\0A\00"
@.str.16 = [39 x i8] c" -? Show help\0A\00"
@.str.17 = [22 x i8] c" Iteration Styles:\0A\00"
@.str.18 = [34 x i8] c" -------------------------------\0A\00"
@.str.19 = [34 x i8] c" 1 . . . . . . . . . . Fibonacci\0A\00"
@.str.20 = [34 x i8] c" 2 . . . . . . . . . . . . Lucas\0A\00"
@.str.21 = [34 x i8] c" 3 . . . . . . . . . Incremental\0A\00"
@.str.22 = [34 x i8] c" 4 . . . . . . . . . . . Padovan\0A\00"
@.str.23 = [34 x i8] c" 5 . . . . . . . . . . . . Pell\0A\00"
@.str.24 = [24 x i8] c" Computation Styles:\0A\00"
@.str.25 = [34 x i8] c" 1 . . . . . . . . . . . Modulo\0A\00"
@.str.26 = [34 x i8] c" 2 . . . . . . . . . . . Divide\0A\00"
@.str.27 = [34 x i8] c" 3 . . . . . . . . . . Multiply\0A\00"
@.str.28 = [34 x i8] c" 4 . . . . . . . . . . . . . Add\0A\00"
@.str.29 = [34 x i8] c" 5 . .. . . . . . . . . Subtract\0A\00"
define void @print_help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.17, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.18, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.19, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.20, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.21, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.22, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.23, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.24, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.18, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.25, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.26, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.27, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.28, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.29, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [20 x i8] c" genfib version 0.1\00"
@str.30 = [32 x i8] c" Licensed under the MIT License\00"
@str.31 = [50 x i8] c" Copyright Steven Velozo (steven@velozo.com) 2013\00"
@str.32 = [27 x i8] c" Command Line Arguments:\00"
@str.33 = [34 x i8] c" --------------------------------\00"
@str.34 = [48 x i8] c" -h Show the CSV Header\00"
@str.35 = [46 x i8] c" -a Show Column Value\00"
@str.36 = [43 x i8] c" -d Show Row Value\00"
@str.37 = [70 x i8] c" -s Show the Approximate Number of Characters\00"
@str.38 = [45 x i8] c" -o Show the Ordinal\00"
@str.39 = [60 x i8] c" -r [number] Show [number] Rows (default 10)\00"
@str.40 = [76 x i8] c" -R [iteration_number] Use [iteration_number] Algorithm for Row Values\00"
@str.41 = [63 x i8] c" -c [number] Show [number] Columns (default 10)\00"
@str.42 = [79 x i8] c" -C [iteration_number] Use [iteration_number] Algorithm for Column Values\00"
@str.43 = [70 x i8] c" -I [computation_style] Use [computation_style] for Intersections\00"
@str.44 = [38 x i8] c" -? Show help\00"
@str.45 = [21 x i8] c" Iteration Styles:\00"
@str.47 = [33 x i8] c" 1 . . . . . . . . . . Fibonacci\00"
@str.48 = [33 x i8] c" 2 . . . . . . . . . . . . Lucas\00"
@str.49 = [33 x i8] c" 3 . . . . . . . . . Incremental\00"
@str.50 = [33 x i8] c" 4 . . . . . . . . . . . Padovan\00"
@str.51 = [33 x i8] c" 5 . . . . . . . . . . . . Pell\00"
@str.52 = [23 x i8] c" Computation Styles:\00"
@str.53 = [33 x i8] c" -------------------------------\00"
@str.54 = [33 x i8] c" 1 . . . . . . . . . . . Modulo\00"
@str.55 = [33 x i8] c" 2 . . . . . . . . . . . Divide\00"
@str.56 = [33 x i8] c" 3 . . . . . . . . . . Multiply\00"
@str.57 = [33 x i8] c" 4 . . . . . . . . . . . . . Add\00"
@str.58 = [33 x i8] c" 5 . .. . . . . . . . . Subtract\00"
define void @print_help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.30, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.31, i64 0, i64 0))
%4 = tail call i32 @putchar(i32 10)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.32, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.33, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.34, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.35, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.36, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.37, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.38, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.39, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.40, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.41, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.42, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.43, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.44, i64 0, i64 0))
%18 = tail call i32 @putchar(i32 10)
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @str.45, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.53, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.47, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.48, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.49, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.50, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.51, i64 0, i64 0))
%26 = tail call i32 @putchar(i32 10)
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.52, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.53, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.54, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.55, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.56, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.57, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.58, i64 0, i64 0))
%34 = tail call i32 @putchar(i32 10)
ret void
}