#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*/ EXIT_FAILURE;
int /*<<< orphan*/ exit(int /*<<< orphan*/);
int /*<<< orphan*/ printf(char *);
void NidxUsage() {
  printf("**************************************************\n");
  printf(" netindex v1.0 - graph (network) indexing program\n");
  printf("**************************************************\n");
  printf(" Author:\n\tArnold Kuzniar\n");
  printf(" Last update:\n\tApr 2008\n");
  printf(" Description:\n\tThe program indexes an input graph for the "
         "'netclust' program.\n");
  printf(" Usage:\n");
  printf("       netindex [FILE] [WEIGHT TYPE] [WEIGHT CUTOFF]\n\n");
  printf("       FILE (mandatory)         - input file of graph edges\n");
  printf("       WEIGHT TYPE (optional)   - similarity or distance between "
         "nodes [S/D] (default S)\n");
  printf("       WEIGHT CUTOFF (optional) - edge weight cutoff value\n");
  printf("                                  range of values for S - 0..N "
         "(default 0)\n");
  printf("                                  range of values for D - 0..1 "
         "(default 1)\n\n");
  exit(EXIT_FAILURE);
}


x86 assembly (clang, -O0):
<NidxUsage>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
call   1030 <printf@plt>
lea    0xefd(%rip),%rdi
call   1030 <printf@plt>
lea    0xebd(%rip),%rdi
call   1030 <printf@plt>
lea    0xf18(%rip),%rdi
call   1030 <printf@plt>
lea    0xf26(%rip),%rdi
call   1030 <printf@plt>
lea    0xf33(%rip),%rdi
call   1030 <printf@plt>
lea    0xf76(%rip),%rdi
call   1030 <printf@plt>
lea    0xf73(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfcf(%rip),%rdi
call   1030 <printf@plt>
lea    0x101d(%rip),%rdi
call   1030 <printf@plt>
lea    0x104d(%rip),%rdi
call   1030 <printf@plt>
lea    0x108d(%rip),%rdi
call   1030 <printf@plt>
mov    0x2e19(%rip),%rax
mov    (%rax),%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<NidxUsage>:
push   %rbx
lea    0xf0a(%rip),%rbx
mov    %rbx,%rdi
call   1030 <puts@plt>
lea    0xec9(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1030 <puts@plt>
lea    0xf1a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf27(%rip),%rdi
call   1030 <puts@plt>
lea    0xf33(%rip),%rdi
call   1030 <puts@plt>
lea    0xf75(%rip),%rdi
call   1030 <puts@plt>
lea    0xf71(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9b(%rip),%rdi
call   1030 <puts@plt>
lea    0xfcb(%rip),%rdi
call   1030 <puts@plt>
lea    0x1018(%rip),%rdi
call   1030 <puts@plt>
lea    0x1047(%rip),%rdi
call   1030 <puts@plt>
lea    0x1086(%rip),%rdi
call   1030 <puts@plt>
mov    0x2e1d(%rip),%rax
mov    (%rax),%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@.str = [52 x i8] c"**************************************************\0A\00"
@.str.1 = [51 x i8] c" netindex v1.0 - graph (network) indexing program\0A\00"
@.str.2 = [26 x i8] c" Author:\0A\09Arnold Kuzniar\0A\00"
@.str.3 = [25 x i8] c" Last update:\0A\09Apr 2008\0A\00"
@.str.4 = [79 x i8] c" Description:\0A\09The program indexes an input graph for the 'netclust' program.\0A\00"
@.str.5 = [9 x i8] c" Usage:\0A\00"
@.str.6 = [55 x i8] c" netindex [FILE] [WEIGHT TYPE] [WEIGHT CUTOFF]\0A\0A\00"
@.str.7 = [61 x i8] c" FILE (mandatory) - input file of graph edges\0A\00"
@.str.8 = [90 x i8] c" WEIGHT TYPE (optional) - similarity or distance between nodes [S/D] (default S)\0A\00"
@.str.9 = [60 x i8] c" WEIGHT CUTOFF (optional) - edge weight cutoff value\0A\00"
@.str.10 = [76 x i8] c" range of values for S - 0..N (default 0)\0A\00"
@.str.11 = [77 x i8] c" range of values for D - 0..1 (default 1)\0A\0A\00"
@EXIT_FAILURE = global i32 0
define void @NidxUsage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.2, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.4, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.5, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.6, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.7, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([90 x i8], [90 x i8]* @.str.8, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.9, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.10, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.11, i64 0, i64 0))
%14 = load i32, i32* @EXIT_FAILURE
%15 = call i32 @exit(i32 %14)
unreachable
}

LLVM IR (-O2):
@EXIT_FAILURE = global i32 0
@str.12 = [50 x i8] c" netindex v1.0 - graph (network) indexing program\00"
@str.13 = [51 x i8] c"**************************************************\00"
@str.14 = [25 x i8] c" Author:\0A\09Arnold Kuzniar\00"
@str.15 = [24 x i8] c" Last update:\0A\09Apr 2008\00"
@str.16 = [78 x i8] c" Description:\0A\09The program indexes an input graph for the 'netclust' program.\00"
@str.17 = [8 x i8] c" Usage:\00"
@str.18 = [54 x i8] c" netindex [FILE] [WEIGHT TYPE] [WEIGHT CUTOFF]\0A\00"
@str.19 = [60 x i8] c" FILE (mandatory) - input file of graph edges\00"
@str.20 = [89 x i8] c" WEIGHT TYPE (optional) - similarity or distance between nodes [S/D] (default S)\00"
@str.21 = [59 x i8] c" WEIGHT CUTOFF (optional) - edge weight cutoff value\00"
@str.22 = [75 x i8] c" range of values for S - 0..N (default 0)\00"
@str.23 = [76 x i8] c" range of values for D - 0..1 (default 1)\0A\00"
define void @NidxUsage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.13, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.12, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.13, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.14, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.15, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.16, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str.17, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.18, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.19, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([89 x i8], [89 x i8]* @str.20, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.21, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.22, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.23, i64 0, i64 0))
%14 = load i32, i32* @EXIT_FAILURE
%15 = tail call i32 @exit(i32 %14)
unreachable
}