#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*/ fprintf(int /*<<< orphan*/, char *, char *, char *, char *,
                           char *, char *, char *, char *, char *, char *);
int /*<<< orphan*/ stderr;
void usage(int argc, char **argv) {
  (void)argc;
  fprintf(stderr,
          "Usage: %s l_string s_reduce l_chains n_chains n_parts part dst\n"
          "create a new Rainbow Table in dst\n"
          "\n"
          "PARAMS:\n"
          "  l_string   length of the non-hashed string / key\n"
          "  s_reduce   reduction function seed (i.e. table index)\n"
          "  l_chains   length of the chains to generate\n"
          "  n_chains   the number of chains to be generated\n"
          "  n_parts    the number of parts to split the table in\n"
          "  part       number of the table part (i.e. table part)\n"
          "  dst        destination file\n"
          "\n"
          "Examples\n"
          "  $ %s 6 0 1000 500000 4 0 a0_0.rt\n"
          "  $ %s 6 0 1000 500000 4 1 a0_1.rt\n"
          "  $ %s 6 0 1000 500000 4 2 a0_2.rt\n"
          "  $ %s 6 0 1000 500000 4 3 a0_3.rt\n"
          "\n"
          "  $ %s 6 1 1000 500000 4 0 a0_0.rt\n"
          "  $ %s 6 1 1000 500000 4 1 a0_1.rt\n"
          "  $ %s 6 1 1000 500000 4 2 a0_2.rt\n"
          "  $ %s 6 1 1000 500000 4 3 a0_3.rt\n"
          "...\n",
          argv[0], argv[0], argv[0], argv[0], argv[0], argv[0], argv[0],
          argv[0], argv[0]);
}


x86 assembly (clang, -O0):
<usage>:
push   %rbp
mov    %rsp,%rbp
push   %r14
push   %rbx
sub    $0x40,%rsp
mov    %edi,-0x14(%rbp)
mov    %rsi,-0x20(%rbp)
mov    0x2eb7(%rip),%rax
mov    (%rax),%edi
mov    -0x20(%rbp),%rax
mov    (%rax),%rdx
mov    -0x20(%rbp),%rax
mov    (%rax),%rcx
mov    -0x20(%rbp),%rax
mov    (%rax),%r8
mov    -0x20(%rbp),%rax
mov    (%rax),%r9
mov    -0x20(%rbp),%rax
mov    (%rax),%r14
mov    -0x20(%rbp),%rax
mov    (%rax),%rbx
mov    -0x20(%rbp),%rax
mov    (%rax),%r11
mov    -0x20(%rbp),%rax
mov    (%rax),%r10
mov    -0x20(%rbp),%rax
mov    (%rax),%rax
lea    0xe8f(%rip),%rsi
mov    %r14,(%rsp)
mov    %rbx,0x8(%rsp)
mov    %r11,0x10(%rsp)
mov    %r10,0x18(%rsp)
mov    %rax,0x20(%rsp)
call   1030 <fprintf@plt>
add    $0x40,%rsp
pop    %rbx
pop    %r14
pop    %rbp
ret

x86 assembly (clang, -O2):
<usage>:
push   %rax
mov    0x2ec8(%rip),%rax
mov    (%rax),%edi
mov    (%rsi),%rcx
sub    $0x8,%rsp
lea    0xed8(%rip),%rsi
mov    %rcx,%rdx
mov    %rcx,%r8
mov    %rcx,%r9
push   %rcx
push   %rcx
push   %rcx
push   %rcx
push   %rcx
call   1030 <fprintf@plt>
add    $0x30,%rsp
pop    %rax
ret

LLVM IR (-O0):
@stderr = global i32 0
@.str = [746 x i8] c"Usage: %s l_string s_reduce l_chains n_chains n_parts part dst\0Acreate a new Rainbow Table in dst\0A\0APARAMS:\0A l_string length of the non-hashed string / key\0A s_reduce reduction function seed (i.e. table index)\0A l_chains length of the chains to generate\0A n_chains the number of chains to be generated\0A n_parts the number of parts to split the table in\0A part number of the table part (i.e. table part)\0A dst destination file\0A\0AExamples\0A $ %s 6 0 1000 500000 4 0 a0_0.rt\0A $ %s 6 0 1000 500000 4 1 a0_1.rt\0A $ %s 6 0 1000 500000 4 2 a0_2.rt\0A $ %s 6 0 1000 500000 4 3 a0_3.rt\0A\0A $ %s 6 1 1000 500000 4 0 a0_0.rt\0A $ %s 6 1 1000 500000 4 1 a0_1.rt\0A $ %s 6 1 1000 500000 4 2 a0_2.rt\0A $ %s 6 1 1000 500000 4 3 a0_3.rt\0A...\0A\00"
define void @usage(i32 %0, i8** %1) {
%3 = alloca i32
%4 = alloca i8**
store i32 %0, i32* %3
store i8** %1, i8*** %4
%5 = load i32, i32* %3
%6 = load i32, i32* @stderr
%7 = load i8**, i8*** %4
%8 = getelementptr inbounds i8*, i8** %7, i64 0
%9 = load i8*, i8** %8
%10 = load i8**, i8*** %4
%11 = getelementptr inbounds i8*, i8** %10, i64 0
%12 = load i8*, i8** %11
%13 = load i8**, i8*** %4
%14 = getelementptr inbounds i8*, i8** %13, i64 0
%15 = load i8*, i8** %14
%16 = load i8**, i8*** %4
%17 = getelementptr inbounds i8*, i8** %16, i64 0
%18 = load i8*, i8** %17
%19 = load i8**, i8*** %4
%20 = getelementptr inbounds i8*, i8** %19, i64 0
%21 = load i8*, i8** %20
%22 = load i8**, i8*** %4
%23 = getelementptr inbounds i8*, i8** %22, i64 0
%24 = load i8*, i8** %23
%25 = load i8**, i8*** %4
%26 = getelementptr inbounds i8*, i8** %25, i64 0
%27 = load i8*, i8** %26
%28 = load i8**, i8*** %4
%29 = getelementptr inbounds i8*, i8** %28, i64 0
%30 = load i8*, i8** %29
%31 = load i8**, i8*** %4
%32 = getelementptr inbounds i8*, i8** %31, i64 0
%33 = load i8*, i8** %32
%34 = call i32 @fprintf(i32 %6, i8* getelementptr inbounds ([746 x i8], [746 x i8]* @.str, i64 0, i64 0), i8* %9, i8* %12, i8* %15, i8* %18, i8* %21, i8* %24, i8* %27, i8* %30, i8* %33)
ret void
}

LLVM IR (-O2):
@stderr = global i32 0
@.str = [746 x i8] c"Usage: %s l_string s_reduce l_chains n_chains n_parts part dst\0Acreate a new Rainbow Table in dst\0A\0APARAMS:\0A l_string length of the non-hashed string / key\0A s_reduce reduction function seed (i.e. table index)\0A l_chains length of the chains to generate\0A n_chains the number of chains to be generated\0A n_parts the number of parts to split the table in\0A part number of the table part (i.e. table part)\0A dst destination file\0A\0AExamples\0A $ %s 6 0 1000 500000 4 0 a0_0.rt\0A $ %s 6 0 1000 500000 4 1 a0_1.rt\0A $ %s 6 0 1000 500000 4 2 a0_2.rt\0A $ %s 6 0 1000 500000 4 3 a0_3.rt\0A\0A $ %s 6 1 1000 500000 4 0 a0_0.rt\0A $ %s 6 1 1000 500000 4 1 a0_1.rt\0A $ %s 6 1 1000 500000 4 2 a0_2.rt\0A $ %s 6 1 1000 500000 4 3 a0_3.rt\0A...\0A\00"
define void @usage(i32 %0, i8** nocapture %1) {
%3 = load i32, i32* @stderr
%4 = load i8*, i8** %1
%5 = tail call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([746 x i8], [746 x i8]* @.str, i64 0, i64 0), i8* %4, i8* %4, i8* %4, i8* %4, i8* %4, i8* %4, i8* %4, i8* %4, i8* %4)
ret void
}