#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 *);
int /*<<< orphan*/ stderr;
int tr_sdi_usage() {
  fprintf(stderr, "\n");
  fprintf(
      stderr,
      "Usage  : treebest sdi [-r|-H|-R|-m <tree0>|-l <spec_list>] <tree>\n\n");
  fprintf(stderr, "Options: -r         reroot\n");
  fprintf(
      stderr,
      "         -c         use core species tree instead of the default one\n");
  fprintf(
      stderr,
      "         -H         reroot by minimizing tree height, instead of by\n");
  fprintf(stderr,
          "                    minimizing the number of duplication events.\n");
  fprintf(stderr, "         -R         do not reorder the leaves.\n");
  fprintf(stderr, "         -s FILE    species tree [default taxa tree]\n");
  fprintf(stderr, "         -l FILE    cut a subtree that contains genes whose "
                  "species exist in list [null]\n");
  fprintf(stderr, "         -m FILE    compare topology with FILE and re-order "
                  "the leaves [null]\n\n");
  return 1;
}


x86 assembly (clang, -O0):
<tr_sdi_usage>:
push   %rbp
mov    %rsp,%rbp
mov    0x2ec5(%rip),%rax
mov    (%rax),%edi
lea    0xf1e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2eb0(%rip),%rax
mov    (%rax),%edi
lea    0xec7(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e9b(%rip),%rax
mov    (%rax),%edi
lea    0xef6(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e86(%rip),%rax
mov    (%rax),%edi
lea    0xefd(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e71(%rip),%rax
mov    (%rax),%edi
lea    0xf2e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e5c(%rip),%rax
mov    (%rax),%edi
lea    0xf5e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e47(%rip),%rax
mov    (%rax),%edi
lea    0xf8b(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e32(%rip),%rax
mov    (%rax),%edi
lea    0xfa6(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e1d(%rip),%rax
mov    (%rax),%edi
lea    0xfc7(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e08(%rip),%rax
mov    (%rax),%edi
lea    0x100c(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0x1,%eax
pop    %rbp
ret

x86 assembly (clang, -O2):
<tr_sdi_usage>:
push   %rbx
mov    0x2ec8(%rip),%rbx
mov    (%rbx),%edi
lea    0xf21(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xed1(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf07(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf15(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf4d(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf84(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfb8(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfda(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1002(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x104e(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0x1,%eax
pop    %rbx
ret

LLVM IR (-O0):
@stderr = global i32 0
@.str = [2 x i8] c"\0A\00"
@.str.1 = [68 x i8] c"Usage : treebest sdi [-r|-H|-R|-m <tree0>|-l <spec_list>] <tree>\0A\0A\00"
@.str.2 = [28 x i8] c"Options: -r reroot\0A\00"
@.str.3 = [70 x i8] c" -c use core species tree instead of the default one\0A\00"
@.str.4 = [69 x i8] c" -H reroot by minimizing tree height, instead of by\0A\00"
@.str.5 = [66 x i8] c" minimizing the number of duplication events.\0A\00"
@.str.6 = [48 x i8] c" -R do not reorder the leaves.\0A\00"
@.str.7 = [54 x i8] c" -s FILE species tree [default taxa tree]\0A\00"
@.str.8 = [90 x i8] c" -l FILE cut a subtree that contains genes whose species exist in list [null]\0A\00"
@.str.9 = [80 x i8] c" -m FILE compare topology with FILE and re-order the leaves [null]\0A\0A\00"
define i32 @tr_sdi_usage() {
%1 = load i32, i32* @stderr
%2 = call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.2, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.3, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.4, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.5, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.6, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.7, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([90 x i8], [90 x i8]* @.str.8, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.9, i64 0, i64 0))
ret i32 1
}

LLVM IR (-O2):
@stderr = global i32 0
@.str = [2 x i8] c"\0A\00"
@.str.1 = [68 x i8] c"Usage : treebest sdi [-r|-H|-R|-m <tree0>|-l <spec_list>] <tree>\0A\0A\00"
@.str.2 = [28 x i8] c"Options: -r reroot\0A\00"
@.str.3 = [70 x i8] c" -c use core species tree instead of the default one\0A\00"
@.str.4 = [69 x i8] c" -H reroot by minimizing tree height, instead of by\0A\00"
@.str.5 = [66 x i8] c" minimizing the number of duplication events.\0A\00"
@.str.6 = [48 x i8] c" -R do not reorder the leaves.\0A\00"
@.str.7 = [54 x i8] c" -s FILE species tree [default taxa tree]\0A\00"
@.str.8 = [90 x i8] c" -l FILE cut a subtree that contains genes whose species exist in list [null]\0A\00"
@.str.9 = [80 x i8] c" -m FILE compare topology with FILE and re-order the leaves [null]\0A\0A\00"
define i32 @tr_sdi_usage() {
%1 = load i32, i32* @stderr
%2 = tail call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = tail call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = tail call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.2, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = tail call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.3, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = tail call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.4, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = tail call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.5, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = tail call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.6, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = tail call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.7, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = tail call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([90 x i8], [90 x i8]* @.str.8, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = tail call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.9, i64 0, i64 0))
ret i32 1
}