#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 *, char *, char *, char *);
void help(char *argv[]) {
  printf(
      "Trims a tree at a certain depth.\n"
      "\n"
      "Synopsis\n"
      "--------\n"
      "\n"
      "%s [-ah] <newick trees filename|-> <maximum depth>\n"
      "\n"
      "Input\n"
      "-----\n"
      "\n"
      "The first argument is the name of a file that contains Newick trees, or "
      "'-'\n"
      "(in which case trees are read from standard input). The second argument "
      "is\n"
      "the maximum depth: nodes deeper than this will be trimmed.\n"
      "\n"
      "Output\n"
      "------\n"
      "\n"
      "A tree whose depth is at most the maximum depth (second argument).\n"
      "Effectively, it is like cutting the tree at that value: nodes that are "
      "too\n"
      "deep get trimmed, and internal nodes also lose their children.\n"
      "\n"
      "Options\n"
      "-------\n"
      "\n"
      "    -a: the maximum depth is expressed in number of ancestors, not "
      "distance.\n"
      "        Nodes are not shortened, but no node is retained that has more\n"
      "        ancestors than the maximum.\n"
      "    -h: print this message and exit\n"
      "\n"
      "Examples\n"
      "--------\n"
      "\n"
      "# Cut tree at depth 20\n"
      "$ %s data/catarrhini 20\n"
      "\n"
      "# Discard nodes with more than 3 ancestors\n"
      "$ %s -a data/catarrhini 3\n",
      argv[0], argv[0], argv[0]);
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
mov    -0x8(%rbp),%rax
mov    (%rax),%rsi
mov    -0x8(%rbp),%rax
mov    (%rax),%rdx
mov    -0x8(%rbp),%rax
mov    (%rax),%rcx
lea    0xec8(%rip),%rdi
call   1030 <printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<help>:
mov    (%rdi),%rcx
lea    0xee6(%rip),%rdi
mov    %rcx,%rsi
mov    %rcx,%rdx
jmp    1030 <printf@plt>

LLVM IR (-O0):
@.str = [925 x i8] c"Trims a tree at a certain depth.\0A\0ASynopsis\0A--------\0A\0A%s [-ah] <newick trees filename|-> <maximum depth>\0A\0AInput\0A-----\0A\0AThe first argument is the name of a file that contains Newick trees, or '-'\0A(in which case trees are read from standard input). The second argument is\0Athe maximum depth: nodes deeper than this will be trimmed.\0A\0AOutput\0A------\0A\0AA tree whose depth is at most the maximum depth (second argument).\0AEffectively, it is like cutting the tree at that value: nodes that are too\0Adeep get trimmed, and internal nodes also lose their children.\0A\0AOptions\0A-------\0A\0A -a: the maximum depth is expressed in number of ancestors, not distance.\0A Nodes are not shortened, but no node is retained that has more\0A ancestors than the maximum.\0A -h: print this message and exit\0A\0AExamples\0A--------\0A\0A# Cut tree at depth 20\0A$ %s data/catarrhini 20\0A\0A# Discard nodes with more than 3 ancestors\0A$ %s -a data/catarrhini 3\0A\00"
define void @help(i8** %0) {
%2 = alloca i8**
store i8** %0, i8*** %2
%3 = load i8**, i8*** %2
%4 = getelementptr inbounds i8*, i8** %3, i64 0
%5 = load i8*, i8** %4
%6 = load i8**, i8*** %2
%7 = getelementptr inbounds i8*, i8** %6, i64 0
%8 = load i8*, i8** %7
%9 = load i8**, i8*** %2
%10 = getelementptr inbounds i8*, i8** %9, i64 0
%11 = load i8*, i8** %10
%12 = call i32 @printf(i8* getelementptr inbounds ([925 x i8], [925 x i8]* @.str, i64 0, i64 0), i8* %5, i8* %8, i8* %11)
ret void
}

LLVM IR (-O2):
@.str = [925 x i8] c"Trims a tree at a certain depth.\0A\0ASynopsis\0A--------\0A\0A%s [-ah] <newick trees filename|-> <maximum depth>\0A\0AInput\0A-----\0A\0AThe first argument is the name of a file that contains Newick trees, or '-'\0A(in which case trees are read from standard input). The second argument is\0Athe maximum depth: nodes deeper than this will be trimmed.\0A\0AOutput\0A------\0A\0AA tree whose depth is at most the maximum depth (second argument).\0AEffectively, it is like cutting the tree at that value: nodes that are too\0Adeep get trimmed, and internal nodes also lose their children.\0A\0AOptions\0A-------\0A\0A -a: the maximum depth is expressed in number of ancestors, not distance.\0A Nodes are not shortened, but no node is retained that has more\0A ancestors than the maximum.\0A -h: print this message and exit\0A\0AExamples\0A--------\0A\0A# Cut tree at depth 20\0A$ %s data/catarrhini 20\0A\0A# Discard nodes with more than 3 ancestors\0A$ %s -a data/catarrhini 3\0A\00"
define void @help(i8** nocapture %0) {
%2 = load i8*, i8** %0
%3 = tail call i32 @printf(i8* getelementptr inbounds ([925 x i8], [925 x i8]* @.str, i64 0, i64 0), i8* %2, i8* %2, i8* %2)
ret void
}