#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 *);
int /*<<< orphan*/ splash();
void usage(void) {
  splash();
  printf("     fileop [-f X ]|[-l # -u #] [-s Y] [-e] [-b] [-w] [-d <dir>] "
         "[-t] [-v] [-h]\n");
  printf("\n");
  printf(
      "     -f #      Force factor. X^3 files will be created and removed.\n");
  printf("     -l #      Lower limit on the value of the Force factor.\n");
  printf("     -u #      Upper limit on the value of the Force factor.\n");
  printf("     -s #      Optional. Sets filesize for the create/write. May use "
         "suffix 'K' or 'M'.\n");
  printf("     -e        Excel importable format.\n");
  printf("     -b        Output best case results.\n");
  printf("     -i #      Increment force factor by this increment.\n");
  printf("     -w        Output worst case results.\n");
  printf("     -d <dir>  Specify starting directory.\n");
  printf("     -U <dir>  Mount point to remount between tests.\n");
  printf("     -t        Verbose output option.\n");
  printf("     -v        Version information.\n");
  printf("     -h        Help text.\n");
  printf("\n");
  printf("     The structure of the file tree is:\n");
  printf("     X number of Level 1 directories, with X number of\n");
  printf("     level 2 directories, with X number of files in each\n");
  printf("     of the level 2 directories.\n");
  printf("\n");
  printf("     Example:  fileop 2\n");
  printf("\n");
  printf("             dir_1                        dir_2\n");
  printf("            /     \\                      /     \\ \n");
  printf("      sdir_1       sdir_2          sdir_1       sdir_2\n");
  printf("      /     \\     /     \\          /     \\      /     \\ \n");
  printf("   file_1 file_2 file_1 file_2   file_1 file_2 file_1 file_2\n");
  printf("\n");
  printf("   Each file will be created, and then Y bytes is written to the "
         "file.\n");
  printf("\n");
}


x86 assembly (clang, -O0):
<usage>:
push   %rbp
mov    %rsp,%rbp
mov    $0x0,%al
call   1040 <splash@plt>
lea    0xece(%rip),%rdi
call   1030 <printf@plt>
lea    0x12e6(%rip),%rdi
call   1030 <printf@plt>
lea    0xf07(%rip),%rdi
call   1030 <printf@plt>
lea    0xf40(%rip),%rdi
call   1030 <printf@plt>
lea    0xf72(%rip),%rdi
call   1030 <printf@plt>
lea    0xfa4(%rip),%rdi
call   1030 <printf@plt>
lea    0xff1(%rip),%rdi
call   1030 <printf@plt>
lea    0x100e(%rip),%rdi
call   1030 <printf@plt>
lea    0x102c(%rip),%rdi
call   1030 <printf@plt>
lea    0x105a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1079(%rip),%rdi
call   1030 <printf@plt>
lea    0x1099(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c3(%rip),%rdi
call   1030 <printf@plt>
lea    0x10de(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f7(%rip),%rdi
call   1030 <printf@plt>
lea    0x123e(%rip),%rdi
call   1030 <printf@plt>
lea    0x10fa(%rip),%rdi
call   1030 <printf@plt>
lea    0x1117(%rip),%rdi
call   1030 <printf@plt>
lea    0x1143(%rip),%rdi
call   1030 <printf@plt>
lea    0x1171(%rip),%rdi
call   1030 <printf@plt>
lea    0x1202(%rip),%rdi
call   1030 <printf@plt>
lea    0x117b(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ea(%rip),%rdi
call   1030 <printf@plt>
lea    0x117c(%rip),%rdi
call   1030 <printf@plt>
lea    0x11a1(%rip),%rdi
call   1030 <printf@plt>
lea    0x11c8(%rip),%rdi
call   1030 <printf@plt>
lea    0x11f4(%rip),%rdi
call   1030 <printf@plt>
lea    0x1222(%rip),%rdi
call   1030 <printf@plt>
lea    0x11a2(%rip),%rdi
call   1030 <printf@plt>
lea    0x1248(%rip),%rdi
call   1030 <printf@plt>
lea    0x118a(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<usage>:
push   %rax
xor    %eax,%eax
call   1050 <splash@plt>
lea    0xec1(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xefb(%rip),%rdi
call   1040 <puts@plt>
lea    0xf33(%rip),%rdi
call   1040 <puts@plt>
lea    0xf64(%rip),%rdi
call   1040 <puts@plt>
lea    0xf95(%rip),%rdi
call   1040 <puts@plt>
lea    0xfe1(%rip),%rdi
call   1040 <puts@plt>
lea    0xffd(%rip),%rdi
call   1040 <puts@plt>
lea    0x101a(%rip),%rdi
call   1040 <puts@plt>
lea    0x1047(%rip),%rdi
call   1040 <puts@plt>
lea    0x1065(%rip),%rdi
call   1040 <puts@plt>
lea    0x1084(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ad(%rip),%rdi
call   1040 <puts@plt>
lea    0x10c7(%rip),%rdi
call   1040 <puts@plt>
lea    0x10df(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x10e3(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ff(%rip),%rdi
call   1040 <puts@plt>
lea    0x112a(%rip),%rdi
call   1040 <puts@plt>
lea    0x1157(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1162(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1164(%rip),%rdi
call   1040 <puts@plt>
lea    0x1188(%rip),%rdi
call   1040 <puts@plt>
lea    0x11ae(%rip),%rdi
call   1040 <puts@plt>
lea    0x11d9(%rip),%rdi
call   1040 <puts@plt>
lea    0x1206(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x122d(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rax
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [81 x i8] c" fileop [-f X ]|[-l # -u #] [-s Y] [-e] [-b] [-w] [-d <dir>] [-t] [-v] [-h]\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [69 x i8] c" -f # Force factor. X^3 files will be created and removed.\0A\00"
@.str.3 = [62 x i8] c" -l # Lower limit on the value of the Force factor.\0A\00"
@.str.4 = [62 x i8] c" -u # Upper limit on the value of the Force factor.\0A\00"
@.str.5 = [89 x i8] c" -s # Optional. Sets filesize for the create/write. May use suffix 'K' or 'M'.\0A\00"
@.str.6 = [41 x i8] c" -e Excel importable format.\0A\00"
@.str.7 = [42 x i8] c" -b Output best case results.\0A\00"
@.str.8 = [58 x i8] c" -i # Increment force factor by this increment.\0A\00"
@.str.9 = [43 x i8] c" -w Output worst case results.\0A\00"
@.str.10 = [44 x i8] c" -d <dir> Specify starting directory.\0A\00"
@.str.11 = [54 x i8] c" -U <dir> Mount point to remount between tests.\0A\00"
@.str.12 = [39 x i8] c" -t Verbose output option.\0A\00"
@.str.13 = [37 x i8] c" -v Version information.\0A\00"
@.str.14 = [27 x i8] c" -h Help text.\0A\00"
@.str.15 = [41 x i8] c" The structure of the file tree is:\0A\00"
@.str.16 = [56 x i8] c" X number of Level 1 directories, with X number of\0A\00"
@.str.17 = [58 x i8] c" level 2 directories, with X number of files in each\0A\00"
@.str.18 = [34 x i8] c" of the level 2 directories.\0A\00"
@.str.19 = [25 x i8] c" Example: fileop 2\0A\00"
@.str.20 = [49 x i8] c" dir_1 dir_2\0A\00"
@.str.21 = [51 x i8] c" / \\ / \\ \0A\00"
@.str.22 = [56 x i8] c" sdir_1 sdir_2 sdir_1 sdir_2\0A\00"
@.str.23 = [58 x i8] c" / \\ / \\ / \\ / \\ \0A\00"
@.str.24 = [62 x i8] c" file_1 file_2 file_1 file_2 file_1 file_2 file_1 file_2\0A\00"
@.str.25 = [72 x i8] c" Each file will be created, and then Y bytes is written to the file.\0A\00"
define void @usage() {
%1 = call i32 (...) @splash()
%2 = call i32 @printf(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.2, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.4, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.5, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.6, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.7, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.8, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.9, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.10, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.11, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.12, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.13, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.14, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.15, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.16, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.17, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.18, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.19, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.20, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.21, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.22, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.23, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.24, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.25, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [80 x i8] c" fileop [-f X ]|[-l # -u #] [-s Y] [-e] [-b] [-w] [-d <dir>] [-t] [-v] [-h]\00"
@str.26 = [68 x i8] c" -f # Force factor. X^3 files will be created and removed.\00"
@str.27 = [61 x i8] c" -l # Lower limit on the value of the Force factor.\00"
@str.28 = [61 x i8] c" -u # Upper limit on the value of the Force factor.\00"
@str.29 = [88 x i8] c" -s # Optional. Sets filesize for the create/write. May use suffix 'K' or 'M'.\00"
@str.30 = [40 x i8] c" -e Excel importable format.\00"
@str.31 = [41 x i8] c" -b Output best case results.\00"
@str.32 = [57 x i8] c" -i # Increment force factor by this increment.\00"
@str.33 = [42 x i8] c" -w Output worst case results.\00"
@str.34 = [43 x i8] c" -d <dir> Specify starting directory.\00"
@str.35 = [53 x i8] c" -U <dir> Mount point to remount between tests.\00"
@str.36 = [38 x i8] c" -t Verbose output option.\00"
@str.37 = [36 x i8] c" -v Version information.\00"
@str.38 = [26 x i8] c" -h Help text.\00"
@str.39 = [40 x i8] c" The structure of the file tree is:\00"
@str.40 = [55 x i8] c" X number of Level 1 directories, with X number of\00"
@str.41 = [57 x i8] c" level 2 directories, with X number of files in each\00"
@str.42 = [33 x i8] c" of the level 2 directories.\00"
@str.43 = [24 x i8] c" Example: fileop 2\00"
@str.44 = [48 x i8] c" dir_1 dir_2\00"
@str.45 = [50 x i8] c" / \\ / \\ \00"
@str.46 = [55 x i8] c" sdir_1 sdir_2 sdir_1 sdir_2\00"
@str.47 = [57 x i8] c" / \\ / \\ / \\ / \\ \00"
@str.48 = [61 x i8] c" file_1 file_2 file_1 file_2 file_1 file_2 file_1 file_2\00"
@str.49 = [71 x i8] c" Each file will be created, and then Y bytes is written to the file.\00"
define void @usage() {
%1 = tail call i32 (...) @splash()
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([80 x i8], [80 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @putchar(i32 10)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.26, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.27, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.28, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([88 x i8], [88 x i8]* @str.29, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.30, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.31, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.32, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.33, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.34, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.35, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.36, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.37, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.38, i64 0, i64 0))
%17 = tail call i32 @putchar(i32 10)
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.39, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.40, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.41, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.42, i64 0, i64 0))
%22 = tail call i32 @putchar(i32 10)
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.43, i64 0, i64 0))
%24 = tail call i32 @putchar(i32 10)
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.44, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.45, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.46, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.47, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.48, i64 0, i64 0))
%30 = tail call i32 @putchar(i32 10)
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([71 x i8], [71 x i8]* @str.49, i64 0, i64 0))
%32 = tail call i32 @putchar(i32 10)
ret void
}