#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*/ puts(char *);
void print_usage() {
  puts("Copyright (C) 2009 Andrew Chalaturnyk and William Kocay.\n\n"
       "This program is free software: you can redistribute it and/or modify\n"
       "it under the terms of the GNU General Public License as published by\n"
       "the Free Software Foundation, either version 3 of the License, or\n"
       "(at your option) any later version.\n"
       "\n"
       "This program is distributed in the hope that it will be useful,\n"
       "but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
       "MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n"
       "GNU General Public License for more details.\n"
       "\n"
       "You should have received a copy of the GNU General Public License\n"
       "along with this program.  If not, see "
       "<http://www.gnu.org/licenses/>.\n");
  puts("This program outputs the hamiltonian cycle counts found"
       " for each of the the inputed graphs.\n");
  puts("Usage: hc [-p] files...\n");
  puts("Flags:\n\t-h\thelp\n\t-p\tUse pruning algorithm during search.\n");
}


x86 assembly (clang, -O0):
<print_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <puts@plt>
lea    0x1178(%rip),%rdi
call   1030 <puts@plt>
lea    0x11c9(%rip),%rdi
call   1030 <puts@plt>
lea    0x11d6(%rip),%rdi
call   1030 <puts@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0x117b(%rip),%rdi
call   1030 <puts@plt>
lea    0x11cc(%rip),%rdi
call   1030 <puts@plt>
lea    0x11d9(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [671 x i8] c"Copyright (C) 2009 Andrew Chalaturnyk and William Kocay.\0A\0AThis program is free software: you can redistribute it and/or modify\0Ait under the terms of the GNU General Public License as published by\0Athe Free Software Foundation, either version 3 of the License, or\0A(at your option) any later version.\0A\0AThis program is distributed in the hope that it will be useful,\0Abut WITHOUT ANY WARRANTY; without even the implied warranty of\0AMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\0AGNU General Public License for more details.\0A\0AYou should have received a copy of the GNU General Public License\0Aalong with this program. If not, see <http://www.gnu.org/licenses/>.\0A\00"
@.str.1 = [93 x i8] c"This program outputs the hamiltonian cycle counts found for each of the the inputed graphs.\0A\00"
@.str.2 = [25 x i8] c"Usage: hc [-p] files...\0A\00"
@.str.3 = [58 x i8] c"Flags:\0A\09-h\09help\0A\09-p\09Use pruning algorithm during search.\0A\00"
define void @print_usage() {
%1 = call i32 @puts(i8* getelementptr inbounds ([671 x i8], [671 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @puts(i8* getelementptr inbounds ([93 x i8], [93 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @puts(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @puts(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.3, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@.str = [671 x i8] c"Copyright (C) 2009 Andrew Chalaturnyk and William Kocay.\0A\0AThis program is free software: you can redistribute it and/or modify\0Ait under the terms of the GNU General Public License as published by\0Athe Free Software Foundation, either version 3 of the License, or\0A(at your option) any later version.\0A\0AThis program is distributed in the hope that it will be useful,\0Abut WITHOUT ANY WARRANTY; without even the implied warranty of\0AMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\0AGNU General Public License for more details.\0A\0AYou should have received a copy of the GNU General Public License\0Aalong with this program. If not, see <http://www.gnu.org/licenses/>.\0A\00"
@.str.1 = [93 x i8] c"This program outputs the hamiltonian cycle counts found for each of the the inputed graphs.\0A\00"
@.str.2 = [25 x i8] c"Usage: hc [-p] files...\0A\00"
@.str.3 = [58 x i8] c"Flags:\0A\09-h\09help\0A\09-p\09Use pruning algorithm during search.\0A\00"
define void @print_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([671 x i8], [671 x i8]* @.str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([93 x i8], [93 x i8]* @.str.1, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.2, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @.str.3, i64 0, i64 0))
ret void
}