#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_usage() {
  printf("Usage:\n");
  printf("  ocr_train [OPTIONS] network training_data validation_data\n");
  printf("\nOptions:\n");
  printf("  -b B, --batch=B\n");
  printf("       Train the network in batches. Each batch consists of\n");
  printf("       of a loop over the whole training set. After every B\n");
  printf("       batches, network is checked against the validation set.\n");
  printf("  -c, --create-network\n");
  printf("       Create a new network instead of reading one from a\n");
  printf("       file.\n");
  printf("  -n H, --hidden-nodes=H\n");
  printf("       When creating a new network give it H hidden nodes.\n");
  printf("       Default for H is 10.\n");
  printf("  -e E, --error=E\n");
  printf("       Stop training when the average error on the validation\n");
  printf("       set is less than E.\n");
  printf("  -t T, --trainings=T\n");
  printf("	  Stop training when T input/target pairs have been\n");
  printf("       trained.\n");
  printf("  -f, --first-bump\n");
  printf("       Stop training when the error on the validation set\n");
  printf("       starts to increase.\n");
  printf("  -h, --help\n");
  printf("       Display this help and exit.\n");
}


x86 assembly (clang, -O0):
<print_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee1(%rip),%rdi
call   1030 <printf@plt>
lea    0xf12(%rip),%rdi
call   1030 <printf@plt>
lea    0xf11(%rip),%rdi
call   1030 <printf@plt>
lea    0xf18(%rip),%rdi
call   1030 <printf@plt>
lea    0xf49(%rip),%rdi
call   1030 <printf@plt>
lea    0xf7a(%rip),%rdi
call   1030 <printf@plt>
lea    0xfae(%rip),%rdi
call   1030 <printf@plt>
lea    0xfba(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe9(%rip),%rdi
call   1030 <printf@plt>
lea    0xfeb(%rip),%rdi
call   1030 <printf@plt>
lea    0xff9(%rip),%rdi
call   1030 <printf@plt>
lea    0x1029(%rip),%rdi
call   1030 <printf@plt>
lea    0x103a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1041(%rip),%rdi
call   1030 <printf@plt>
lea    0x1074(%rip),%rdi
call   1030 <printf@plt>
lea    0x1084(%rip),%rdi
call   1030 <printf@plt>
lea    0x108f(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b9(%rip),%rdi
call   1030 <printf@plt>
lea    0x10be(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c6(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1105(%rip),%rdi
call   1030 <printf@plt>
lea    0x1107(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xee3(%rip),%rdi
call   1030 <puts@plt>
lea    0xf13(%rip),%rdi
call   1030 <puts@plt>
lea    0xf11(%rip),%rdi
call   1030 <puts@plt>
lea    0xf17(%rip),%rdi
call   1030 <puts@plt>
lea    0xf47(%rip),%rdi
call   1030 <puts@plt>
lea    0xf77(%rip),%rdi
call   1030 <puts@plt>
lea    0xfaa(%rip),%rdi
call   1030 <puts@plt>
lea    0xfb5(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe3(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe4(%rip),%rdi
call   1030 <puts@plt>
lea    0xff1(%rip),%rdi
call   1030 <puts@plt>
lea    0x1020(%rip),%rdi
call   1030 <puts@plt>
lea    0x1030(%rip),%rdi
call   1030 <puts@plt>
lea    0x1036(%rip),%rdi
call   1030 <puts@plt>
lea    0x1068(%rip),%rdi
call   1030 <puts@plt>
lea    0x1077(%rip),%rdi
call   1030 <puts@plt>
lea    0x1081(%rip),%rdi
call   1030 <puts@plt>
lea    0x10aa(%rip),%rdi
call   1030 <puts@plt>
lea    0x10ae(%rip),%rdi
call   1030 <puts@plt>
lea    0x10b5(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e3(%rip),%rdi
call   1030 <puts@plt>
lea    0x10f2(%rip),%rdi
call   1030 <puts@plt>
lea    0x10f3(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [8 x i8] c"Usage:\0A\00"
@.str.1 = [61 x i8] c" ocr_train [OPTIONS] network training_data validation_data\0A\00"
@.str.2 = [11 x i8] c"\0AOptions:\0A\00"
@.str.3 = [19 x i8] c" -b B, --batch=B\0A\00"
@.str.4 = [61 x i8] c" Train the network in batches. Each batch consists of\0A\00"
@.str.5 = [61 x i8] c" of a loop over the whole training set. After every B\0A\00"
@.str.6 = [64 x i8] c" batches, network is checked against the validation set.\0A\00"
@.str.7 = [24 x i8] c" -c, --create-network\0A\00"
@.str.8 = [59 x i8] c" Create a new network instead of reading one from a\0A\00"
@.str.9 = [14 x i8] c" file.\0A\00"
@.str.10 = [26 x i8] c" -n H, --hidden-nodes=H\0A\00"
@.str.11 = [60 x i8] c" When creating a new network give it H hidden nodes.\0A\00"
@.str.12 = [29 x i8] c" Default for H is 10.\0A\00"
@.str.13 = [19 x i8] c" -e E, --error=E\0A\00"
@.str.14 = [63 x i8] c" Stop training when the average error on the validation\0A\00"
@.str.15 = [28 x i8] c" set is less than E.\0A\00"
@.str.16 = [23 x i8] c" -t T, --trainings=T\0A\00"
@.str.17 = [54 x i8] c"\09 Stop training when T input/target pairs have been\0A\00"
@.str.18 = [17 x i8] c" trained.\0A\00"
@.str.19 = [20 x i8] c" -f, --first-bump\0A\00"
@.str.20 = [59 x i8] c" Stop training when the error on the validation set\0A\00"
@.str.21 = [28 x i8] c" starts to increase.\0A\00"
@.str.22 = [14 x i8] c" -h, --help\0A\00"
@.str.23 = [36 x i8] c" Display this help and exit.\0A\00"
define void @print_usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.19, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.20, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.21, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.22, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.23, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [7 x i8] c"Usage:\00"
@str.24 = [60 x i8] c" ocr_train [OPTIONS] network training_data validation_data\00"
@str.25 = [10 x i8] c"\0AOptions:\00"
@str.26 = [18 x i8] c" -b B, --batch=B\00"
@str.27 = [60 x i8] c" Train the network in batches. Each batch consists of\00"
@str.28 = [60 x i8] c" of a loop over the whole training set. After every B\00"
@str.29 = [63 x i8] c" batches, network is checked against the validation set.\00"
@str.30 = [23 x i8] c" -c, --create-network\00"
@str.31 = [58 x i8] c" Create a new network instead of reading one from a\00"
@str.32 = [13 x i8] c" file.\00"
@str.33 = [25 x i8] c" -n H, --hidden-nodes=H\00"
@str.34 = [59 x i8] c" When creating a new network give it H hidden nodes.\00"
@str.35 = [28 x i8] c" Default for H is 10.\00"
@str.36 = [18 x i8] c" -e E, --error=E\00"
@str.37 = [62 x i8] c" Stop training when the average error on the validation\00"
@str.38 = [27 x i8] c" set is less than E.\00"
@str.39 = [22 x i8] c" -t T, --trainings=T\00"
@str.40 = [53 x i8] c"\09 Stop training when T input/target pairs have been\00"
@str.41 = [16 x i8] c" trained.\00"
@str.42 = [19 x i8] c" -f, --first-bump\00"
@str.43 = [58 x i8] c" Stop training when the error on the validation set\00"
@str.44 = [27 x i8] c" starts to increase.\00"
@str.45 = [13 x i8] c" -h, --help\00"
@str.46 = [35 x i8] c" Display this help and exit.\00"
define void @print_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.24, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.25, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.26, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.27, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.28, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.29, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.30, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.31, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.32, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.33, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.34, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.35, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.36, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.37, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.38, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.39, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.40, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str.41, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([19 x i8], [19 x i8]* @str.42, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.43, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.44, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.45, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.46, i64 0, i64 0))
ret void
}