#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 *, char const *);
void print_usage(const char *program) {
  int i;
  const char *usage[] = {
      " [--method=<method>] [--max=<max>]",
      "",
      "    method is the computation method you want to use.  Valid choices "
      "are",
      "    recursive, generative.  The default is recursive.",
      "",
      "    max is an integer representing the maximum number (i.e. sum of all",
      "    even Fibonacci numbers below <max>).  The value must be between 2",
      "    and 1000000000.  The default is 4000000.",
      NULL};
  printf("%s", program);
  for (i = 0; usage[i]; i++) {
    printf("%s\n", usage[i]);
  }
}


x86 assembly (clang, -O0):
<print_usage>:
push   %rbp
mov    %rsp,%rbp
sub    $0x60,%rsp
mov    %rdi,-0x8(%rbp)
lea    -0x60(%rbp),%rdi
lea    0x2c99(%rip),%rsi
mov    $0x48,%edx
call   1040 <memcpy@plt>
mov    -0x8(%rbp),%rsi
lea    0x1010(%rip),%rdi
call   1030 <printf@plt>
movl   $0x0,-0xc(%rbp)
movslq -0xc(%rbp),%rax
cmpq   $0x0,-0x60(%rbp,%rax,8)
je     118b <print_usage+0x6b>
movslq -0xc(%rbp),%rax
mov    -0x60(%rbp,%rax,8),%rsi
lea    0xfe7(%rip),%rdi
call   1030 <printf@plt>
mov    -0xc(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0xc(%rbp)
jmp    1158 <print_usage+0x38>
add    $0x60,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_usage>:
push   %r14
push   %rbx
push   %rax
mov    %rdi,%rsi
lea    0x103e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1035(%rip),%rbx
lea    0xecf(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0x1022(%rip),%r14
mov    %rbx,%rdi
mov    %r14,%rsi
call   1030 <printf@plt>
lea    0xed1(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0xf0b(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
mov    %rbx,%rdi
mov    %r14,%rsi
call   1030 <printf@plt>
lea    0xf27(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0xf5f(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0xf96(%rip),%rsi
mov    %rbx,%rdi
add    $0x8,%rsp
pop    %rbx
pop    %r14
jmp    1030 <printf@plt>

LLVM IR (-O0):
@.str = [35 x i8] c" [--method=<method>] [--max=<max>]\00"
@.str.1 = [1 x i8] zeroinitializer
@.str.2 = [73 x i8] c" method is the computation method you want to use. Valid choices are\00"
@.str.3 = [54 x i8] c" recursive, generative. The default is recursive.\00"
@.str.4 = [71 x i8] c" max is an integer representing the maximum number (i.e. sum of all\00"
@.str.5 = [70 x i8] c" even Fibonacci numbers below <max>). The value must be between 2\00"
@.str.6 = [45 x i8] c" and 1000000000. The default is 4000000.\00"
@__const.print_usage.usage = [9 x i8*] [i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i32 0, i32 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.1, i32 0, i32 0), i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.2, i32 0, i32 0), i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.3, i32 0, i32 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.1, i32 0, i32 0), i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i32 0, i32 0), i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.5, i32 0, i32 0), i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.6, i32 0, i32 0), i8* null]
@.str.7 = [3 x i8] c"%s\00"
@.str.8 = [4 x i8] c"%s\0A\00"
define void @print_usage(i8* %0) {
%2 = alloca i8*
%3 = alloca i32
%4 = alloca [9 x i8*]
store i8* %0, i8** %2
%5 = bitcast [9 x i8*]* %4 to i8*
%6 = load i8*, i8** %2
%7 = call i32 @printf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.7, i64 0, i64 0), i8* %6)
store i32 0, i32* %3
br label %8
8: ; preds = %20, %1
%9 = load i32, i32* %3
%10 = sext i32 %9 to i64
%11 = getelementptr inbounds [9 x i8*], [9 x i8*]* %4, i64 0, i64 %10
%12 = load i8*, i8** %11
%13 = icmp ne i8* %12, null
br i1 %13, label %14, label %23
14: ; preds = %8
%15 = load i32, i32* %3
%16 = sext i32 %15 to i64
%17 = getelementptr inbounds [9 x i8*], [9 x i8*]* %4, i64 0, i64 %16
%18 = load i8*, i8** %17
%19 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* %18)
br label %20
20: ; preds = %14
%21 = load i32, i32* %3
%22 = add nsw i32 %21, 1
store i32 %22, i32* %3
br label %8
23: ; preds = %8
ret void
}

LLVM IR (-O2):
@.str = [35 x i8] c" [--method=<method>] [--max=<max>]\00"
@.str.1 = [1 x i8] zeroinitializer
@.str.2 = [73 x i8] c" method is the computation method you want to use. Valid choices are\00"
@.str.3 = [54 x i8] c" recursive, generative. The default is recursive.\00"
@.str.4 = [71 x i8] c" max is an integer representing the maximum number (i.e. sum of all\00"
@.str.5 = [70 x i8] c" even Fibonacci numbers below <max>). The value must be between 2\00"
@.str.6 = [45 x i8] c" and 1000000000. The default is 4000000.\00"
@.str.7 = [3 x i8] c"%s\00"
@.str.8 = [4 x i8] c"%s\0A\00"
define void @print_usage(i8* %0) {
%2 = tail call i32 @printf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.7, i64 0, i64 0), i8* %0)
%3 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0))
%4 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.1, i64 0, i64 0))
%5 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.2, i64 0, i64 0))
%6 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.3, i64 0, i64 0))
%7 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.1, i64 0, i64 0))
%8 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i64 0, i64 0))
%9 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.5, i64 0, i64 0))
%10 = tail call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0), i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.6, i64 0, i64 0))
ret void
}