#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 *, char *, char *);
void help(char *argv[]) {
  printf(
      "Prints distances between nodes, following tree branches, in various "
      "ways.\n"
      "\n"
      "Synopsis\n"
      "--------\n"
      "\n"
      "%s [-hmnst] <tree file|-> [label]*\n"
      "\n"
      "Input\n"
      "-----\n"
      "\n"
      "First argument is the name of a file containing one or more trees, or "
      "'-'\n"
      "(in which case trees are read from standard input). Any subsequent "
      "arguments\n"
      "are node labels.\n"
      "\n"
      "Output\n"
      "------\n"
      "\n"
      "Output is controlled by the mode and the selection. The mode specifies "
      "how\n"
      "to compute distances, and the selection specifies which nodes to "
      "compute\n"
      "distances for. There are four modes:\n"
      "    o root mode (default): print distances from the tree's root to all\n"
      "      nodes in the selection\n"
      "    o last common ancestor mode: print distances from the LCA of all "
      "nodes\n"
      "      in the selection to all nodes in the selection\n"
      "    o parent mode: print distances from each node in the selection\n"
      "      to its parent (0 for the root node)\n"
      "    o matrix mode: print distances from each node in the selection\n"
      "      to each node in the selection\n"
      "Valid selections are:\n"
      "    o all labeled leaves (default): selection is formed by all labeled\n"
      "      leaf nodes, in the order in which they appear in the Newick "
      "string\n"
      "      (= Newick order)\n"
      "    o all labeled nodes: selection is formed by all labeled nodes, in\n"
      "      Newick order (see Option -s)\n"
      "    o all leaves: selection is formed by all leaves nodes, in\n"
      "      Newick order (see Option -s)\n"
      "    o all internal nodes: selection is formed by all internal nodes, "
      "in\n"
      "      Newick order (see Option -s)\n"
      "    o all nodes: selection is formed by all nodes, in Newick order\n"
      "      (see Option -s)\n"
      "    o command line arguments: labels are passed on the command line,\n"
      "      and the selection is formed by the corresponding nodes, in the\n"
      "      same order.\n"
      "\n"
      "Options\n"
      "-------\n"
      "\n"
      "    -h: print this message and exit \n"
      "    -m <mode>: selects mode (see Output). Mode is determined by the "
      "first\n"
      "        letter of the argument: 'r' for root mode (default), 'l' for "
      "LCA,\n"
      "        'p' for parent, and 'm' for matrix. Thus, '-mm', '-m matrix',\n"
      "        and '-m mat' all select matrix mode.\n"
      "    -n: prints labels (or '' if empty) in addition to distances.\n"
      "    -s <selection>, where selection is determined by the first letter "
      "of\n"
      "        the argument: 'a' for all nodes, 'l' for labeled nodes,\n"
      "        'i' for inner nodes, 'f' for leaves.\n"
      "        E.g. '-s a' and '-s all' both select all nodes.\n"
      "    -t: in matrix mode, print a triangular matrix. In other modes,\n"
      "        print values on a line, separated by TABs.\n"
      "\n"
      "Assumptions and Limitations\n"
      "---------------------------\n"
      "\n"
      "Labels passed as arguments are assumed to exist in the tree. Behaviour "
      "is\n"
      "undefined if a label is not found.\n"
      "\n"
      "Examples\n"
      "--------\n"
      "\n"
      "$ %s data/catarrhini	# all (labeled) leaves, from root\n"
      "\n"
      "# Pongo and Homo, from their LCA, with labels, single line\n"
      "$ %s -m lca -t -n data/catarrhini Homo Pongo \n"
      "\n"
      "# All labeled nodes, matrix form, with labels\n"
      "$ %s -mm -n -sl data/catarrhini\n"
      "\n"
      "# All nodes, distance to parent\n"
      "$ %s -m p -s a data/catarrhini\n",
      argv[0], argv[0], 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
mov    -0x8(%rbp),%rax
mov    (%rax),%r8
mov    -0x8(%rbp),%rax
mov    (%rax),%r9
lea    0xeba(%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
mov    %rcx,%r8
mov    %rcx,%r9
jmp    1030 <printf@plt>

LLVM IR (-O0):
@.str = [2926 x i8] c"Prints distances between nodes, following tree branches, in various ways.\0A\0ASynopsis\0A--------\0A\0A%s [-hmnst] <tree file|-> [label]*\0A\0AInput\0A-----\0A\0AFirst argument is the name of a file containing one or more trees, or '-'\0A(in which case trees are read from standard input). Any subsequent arguments\0Aare node labels.\0A\0AOutput\0A------\0A\0AOutput is controlled by the mode and the selection. The mode specifies how\0Ato compute distances, and the selection specifies which nodes to compute\0Adistances for. There are four modes:\0A o root mode (default): print distances from the tree's root to all\0A nodes in the selection\0A o last common ancestor mode: print distances from the LCA of all nodes\0A in the selection to all nodes in the selection\0A o parent mode: print distances from each node in the selection\0A to its parent (0 for the root node)\0A o matrix mode: print distances from each node in the selection\0A to each node in the selection\0AValid selections are:\0A o all labeled leaves (default): selection is formed by all labeled\0A leaf nodes, in the order in which they appear in the Newick string\0A (= Newick order)\0A o all labeled nodes: selection is formed by all labeled nodes, in\0A Newick order (see Option -s)\0A o all leaves: selection is formed by all leaves nodes, in\0A Newick order (see Option -s)\0A o all internal nodes: selection is formed by all internal nodes, in\0A Newick order (see Option -s)\0A o all nodes: selection is formed by all nodes, in Newick order\0A (see Option -s)\0A o command line arguments: labels are passed on the command line,\0A and the selection is formed by the corresponding nodes, in the\0A same order.\0A\0AOptions\0A-------\0A\0A -h: print this message and exit \0A -m <mode>: selects mode (see Output). Mode is determined by the first\0A letter of the argument: 'r' for root mode (default), 'l' for LCA,\0A 'p' for parent, and 'm' for matrix. Thus, '-mm', '-m matrix',\0A and '-m mat' all select matrix mode.\0A -n: prints labels (or '' if empty) in addition to distances.\0A -s <selection>, where selection is determined by the first letter of\0A the argument: 'a' for all nodes, 'l' for labeled nodes,\0A 'i' for inner nodes, 'f' for leaves.\0A E.g. '-s a' and '-s all' both select all nodes.\0A -t: in matrix mode, print a triangular matrix. In other modes,\0A print values on a line, separated by TABs.\0A\0AAssumptions and Limitations\0A---------------------------\0A\0ALabels passed as arguments are assumed to exist in the tree. Behaviour is\0Aundefined if a label is not found.\0A\0AExamples\0A--------\0A\0A$ %s data/catarrhini\09# all (labeled) leaves, from root\0A\0A# Pongo and Homo, from their LCA, with labels, single line\0A$ %s -m lca -t -n data/catarrhini Homo Pongo \0A\0A# All labeled nodes, matrix form, with labels\0A$ %s -mm -n -sl data/catarrhini\0A\0A# All nodes, distance to parent\0A$ %s -m p -s a data/catarrhini\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 = load i8**, i8*** %2
%13 = getelementptr inbounds i8*, i8** %12, i64 0
%14 = load i8*, i8** %13
%15 = load i8**, i8*** %2
%16 = getelementptr inbounds i8*, i8** %15, i64 0
%17 = load i8*, i8** %16
%18 = call i32 @printf(i8* getelementptr inbounds ([2926 x i8], [2926 x i8]* @.str, i64 0, i64 0), i8* %5, i8* %8, i8* %11, i8* %14, i8* %17)
ret void
}

LLVM IR (-O2):
@.str = [2926 x i8] c"Prints distances between nodes, following tree branches, in various ways.\0A\0ASynopsis\0A--------\0A\0A%s [-hmnst] <tree file|-> [label]*\0A\0AInput\0A-----\0A\0AFirst argument is the name of a file containing one or more trees, or '-'\0A(in which case trees are read from standard input). Any subsequent arguments\0Aare node labels.\0A\0AOutput\0A------\0A\0AOutput is controlled by the mode and the selection. The mode specifies how\0Ato compute distances, and the selection specifies which nodes to compute\0Adistances for. There are four modes:\0A o root mode (default): print distances from the tree's root to all\0A nodes in the selection\0A o last common ancestor mode: print distances from the LCA of all nodes\0A in the selection to all nodes in the selection\0A o parent mode: print distances from each node in the selection\0A to its parent (0 for the root node)\0A o matrix mode: print distances from each node in the selection\0A to each node in the selection\0AValid selections are:\0A o all labeled leaves (default): selection is formed by all labeled\0A leaf nodes, in the order in which they appear in the Newick string\0A (= Newick order)\0A o all labeled nodes: selection is formed by all labeled nodes, in\0A Newick order (see Option -s)\0A o all leaves: selection is formed by all leaves nodes, in\0A Newick order (see Option -s)\0A o all internal nodes: selection is formed by all internal nodes, in\0A Newick order (see Option -s)\0A o all nodes: selection is formed by all nodes, in Newick order\0A (see Option -s)\0A o command line arguments: labels are passed on the command line,\0A and the selection is formed by the corresponding nodes, in the\0A same order.\0A\0AOptions\0A-------\0A\0A -h: print this message and exit \0A -m <mode>: selects mode (see Output). Mode is determined by the first\0A letter of the argument: 'r' for root mode (default), 'l' for LCA,\0A 'p' for parent, and 'm' for matrix. Thus, '-mm', '-m matrix',\0A and '-m mat' all select matrix mode.\0A -n: prints labels (or '' if empty) in addition to distances.\0A -s <selection>, where selection is determined by the first letter of\0A the argument: 'a' for all nodes, 'l' for labeled nodes,\0A 'i' for inner nodes, 'f' for leaves.\0A E.g. '-s a' and '-s all' both select all nodes.\0A -t: in matrix mode, print a triangular matrix. In other modes,\0A print values on a line, separated by TABs.\0A\0AAssumptions and Limitations\0A---------------------------\0A\0ALabels passed as arguments are assumed to exist in the tree. Behaviour is\0Aundefined if a label is not found.\0A\0AExamples\0A--------\0A\0A$ %s data/catarrhini\09# all (labeled) leaves, from root\0A\0A# Pongo and Homo, from their LCA, with labels, single line\0A$ %s -m lca -t -n data/catarrhini Homo Pongo \0A\0A# All labeled nodes, matrix form, with labels\0A$ %s -mm -n -sl data/catarrhini\0A\0A# All nodes, distance to parent\0A$ %s -m p -s a data/catarrhini\0A\00"
define void @help(i8** nocapture %0) {
%2 = load i8*, i8** %0
%3 = tail call i32 @printf(i8* getelementptr inbounds ([2926 x i8], [2926 x i8]* @.str, i64 0, i64 0), i8* %2, i8* %2, i8* %2, i8* %2, i8* %2)
ret void
}