#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*/ glp_printf(char *, ...);
void print_help(const char *my_name) {
  glp_printf("Usage: %s [options...] filename\n", my_name);
  glp_printf("\n");
  glp_printf("General options:\n");
  glp_printf("   --mps             read LP/MIP problem in fixed MPS fo"
             "rmat\n");
  glp_printf("   --freemps         read LP/MIP problem in free MPS for"
             "mat (default)\n");
  glp_printf("   --lp              read LP/MIP problem in CPLEX LP for"
             "mat\n");
  glp_printf("   --glp             read LP/MIP problem in GLPK format "
             "\n");
  glp_printf("   --math            read LP/MIP model written in GNU Ma"
             "thProg modeling\n");
  glp_printf("                     language\n");
  glp_printf("   -m filename, --model filename\n");
  glp_printf("                     read model section and optional dat"
             "a section from\n");
  glp_printf("                     filename (same as --math)\n");
  glp_printf("   -d filename, --data filename\n");
  glp_printf("                     read data section from filename (fo"
             "r --math only);\n");
  glp_printf("                     if model file also has data section"
             ", it is ignored\n");
  glp_printf("   -y filename, --display filename\n");
  glp_printf("                     send display output to filename (fo"
             "r --math only);\n");
  glp_printf("                     by default the output is sent to te"
             "rminal\n");
  glp_printf("   --seed value      initialize pseudo-random number gen"
             "erator used in\n");
  glp_printf("                     MathProg model with specified seed "
             "(any integer);\n");
  glp_printf("                     if seed value is ?, some random see"
             "d will be used\n");
  glp_printf("   --mincost         read min-cost flow problem in DIMAC"
             "S format\n");
  glp_printf("   --maxflow         read maximum flow problem in DIMACS"
             " format\n");
  glp_printf("   --cnf             read CNF-SAT problem in DIMACS form"
             "at\n");
  glp_printf("   --simplex         use simplex method (default)\n");
  glp_printf("   --interior        use interior point method (LP only)"
             "\n");
  glp_printf("   -r filename, --read filename\n");
  glp_printf("                     read solution from filename rather "
             "to find it with\n");
  glp_printf("                     the solver\n");
  glp_printf("   --min             minimization\n");
  glp_printf("   --max             maximization\n");
  glp_printf("   --scale           scale problem (default)\n");
  glp_printf("   --noscale         do not scale problem\n");
  glp_printf("   -o filename, --output filename\n");
  glp_printf("                     write solution to filename in print"
             "able format\n");
  glp_printf("   -w filename, --write filename\n");
  glp_printf("                     write solution to filename in plain"
             " text format\n");
  glp_printf("   --ranges filename\n");
  glp_printf("                     write sensitivity analysis report t"
             "o filename in\n");
  glp_printf("                     printable format (simplex only)\n");
  glp_printf("   --tmlim nnn       limit solution time to nnn seconds "
             "\n");
  glp_printf("   --memlim nnn      limit available memory to nnn megab"
             "ytes\n");
  glp_printf("   --check           do not solve problem, check input d"
             "ata only\n");
  glp_printf("   --name probname   change problem name to probname\n");
  glp_printf("   --wmps filename   write problem to filename in fixed "
             "MPS format\n");
  glp_printf("   --wfreemps filename\n");
  glp_printf("                     write problem to filename in free M"
             "PS format\n");
  glp_printf("   --wlp filename    write problem to filename in CPLEX "
             "LP format\n");
  glp_printf("   --wglp filename   write problem to filename in GLPK f"
             "ormat\n");
  glp_printf("   --wcnf filename   write problem to filename in DIMACS"
             " CNF-SAT format\n");
  glp_printf("   --log filename    write copy of terminal output to fi"
             "lename\n");
  glp_printf("   -h, --help        display this help information and e"
             "xit\n");
  glp_printf("   -v, --version     display program version and exit\n");
  glp_printf("\n");
  glp_printf("LP basis factorization options:\n");
  glp_printf("   --luf             LU + Forrest-Tomlin update\n");
  glp_printf("                     (faster, less stable; default)\n");
  glp_printf("   --cbg             LU + Schur complement + Bartels-Gol"
             "ub update\n");
  glp_printf("                     (slower, more stable)\n");
  glp_printf("   --cgr             LU + Schur complement + Givens rota"
             "tion update\n");
  glp_printf("                     (slower, more stable)\n");
  glp_printf("\n");
  glp_printf("Options specific to simplex solver:\n");
  glp_printf("   --primal          use primal simplex (default)\n");
  glp_printf("   --dual            use dual simplex\n");
  glp_printf("   --std             use standard initial basis of all s"
             "lacks\n");
  glp_printf("   --adv             use advanced initial basis (default"
             ")\n");
  glp_printf("   --bib             use Bixby's initial basis\n");
  glp_printf("   --ini filename    use as initial basis previously sav"
             "ed with -w\n");
  glp_printf("                     (disables LP presolver)\n");
  glp_printf("   --steep           use steepest edge technique (defaul"
             "t)\n");
  glp_printf("   --nosteep         use standard \"textbook\" pricing\n");
  glp_printf("   --relax           use Harris' two-pass ratio test (de"
             "fault)\n");
  glp_printf("   --norelax         use standard \"textbook\" ratio tes"
             "t\n");
  glp_printf("   --presol          use presolver (default; assumes --s"
             "cale and --adv)\n");
  glp_printf("   --nopresol        do not use presolver\n");
  glp_printf("   --exact           use simplex method based on exact a"
             "rithmetic\n");
  glp_printf("   --xcheck          check final basis using exact arith"
             "metic\n");
  glp_printf("\n");
  glp_printf("Options specific to interior-point solver:\n");
  glp_printf("   --nord            use natural (original) ordering\n");
  glp_printf("   --qmd             use quotient minimum degree orderin"
             "g\n");
  glp_printf("   --amd             use approximate minimum degree orde"
             "ring (default)\n");
  glp_printf("   --symamd          use approximate minimum degree orde"
             "ring\n");
  glp_printf("\n");
  glp_printf("Options specific to MIP solver:\n");
  glp_printf("   --nomip           consider all integer variables as c"
             "ontinuous\n");
  glp_printf("                     (allows solving MIP as pure LP)\n");
  glp_printf("   --first           branch on first integer variable\n");
  glp_printf("   --last            branch on last integer variable\n");
  glp_printf("   --mostf           branch on most fractional variable "
             "\n");
  glp_printf("   --drtom           branch using heuristic by Driebeck "
             "and Tomlin\n");
  glp_printf("                     (default)\n");
  glp_printf("   --pcost           branch using hybrid pseudocost heur"
             "istic (may be\n");
  glp_printf("                     useful for hard instances)\n");
  glp_printf("   --dfs             backtrack using depth first search "
             "\n");
  glp_printf("   --bfs             backtrack using breadth first searc"
             "h\n");
  glp_printf("   --bestp           backtrack using the best projection"
             " heuristic\n");
  glp_printf("   --bestb           backtrack using node with best loca"
             "l bound\n");
  glp_printf("                     (default)\n");
  glp_printf("   --intopt          use MIP presolver (default)\n");
  glp_printf("   --nointopt        do not use MIP presolver\n");
  glp_printf("   --binarize        replace general integer variables b"
             "y binary ones\n");
  glp_printf("                     (assumes --intopt)\n");
  glp_printf("   --fpump           apply feasibility pump heuristic\n");
  glp_printf("   --gomory          generate Gomory's mixed integer cut"
             "s\n");
  glp_printf("   --mir             generate MIR (mixed integer roundin"
             "g) cuts\n");
  glp_printf("   --cover           generate mixed cover cuts\n");
  glp_printf("   --clique          generate clique cuts\n");
  glp_printf("   --cuts            generate all cuts above\n");
  glp_printf("   --mipgap tol      set relative mip gap tolerance to t"
             "ol\n");
  glp_printf("   --minisat         translate integer feasibility probl"
             "em to CNF-SAT\n");
  glp_printf("                     and solve it with MiniSat solver\n");
  glp_printf("   --objbnd bound    add inequality obj <= bound (minimi"
             "zation) or\n");
  glp_printf("                     obj >= bound (maximization) to inte"
             "ger feasibility\n");
  glp_printf("                     problem (assumes --minisat)\n");
  glp_printf("\n");
  glp_printf("For description of the MPS and CPLEX LP formats see Refe"
             "rence Manual.\n");
  glp_printf("For description of the modeling language see \"GLPK: Mod"
             "eling Language\n");
  glp_printf("GNU MathProg\". Both documents are included in the GLPK "
             "distribution.\n");
  glp_printf("\n");
  glp_printf("See GLPK web page at <http://www.gnu.org/software/glpk/g"
             "lpk.html>.\n");
  glp_printf("\n");
  glp_printf("Please report bugs to <bug-glpk@gnu.org>.\n");
  return;
}


x86 assembly (clang, -O0):
<print_help>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
mov    -0x8(%rbp),%rsi
lea    0xed9(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x2114(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xede(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xee2(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xf12(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xf4b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xf7a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xfa6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xfe1(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0xff2(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1006(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1040(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1062(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1075(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x10b0(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x10eb(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1101(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x113c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x116e(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x11a8(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x11e2(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x121c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1250(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1283(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x12b1(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x12d6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1302(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1315(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1350(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1363(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1378(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x138d(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x13ad(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x13ca(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x13df(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1416(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x142a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1462(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x146a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x14a3(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x14cb(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x14f7(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1527(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x155b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1583(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x15b9(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x15c3(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x15f8(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x162d(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x165e(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1699(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x16cb(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x16fa(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1e3c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1715(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1728(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x174b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1772(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x17a7(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x17c5(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x178b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1dcc(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x17e0(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x17f7(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x181c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1835(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1866(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1893(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x18b5(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x18eb(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x190b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1939(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1961(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1993(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x19be(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x19f9(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a16(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a4b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1cde(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a6e(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a8c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1ab4(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1ae1(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1b1b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1c8a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1b3d(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1b50(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1b85(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1bad(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1bd6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1bfe(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1c2a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1c60(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1c72(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1cab(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1cce(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1cfa(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1d27(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1d5d(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1bfe(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1d82(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1da6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1dc7(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1e00(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1e1b(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1e44(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1e71(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1ea4(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1ec6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1ee3(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1f03(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1f31(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1f6a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1f93(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1fc9(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x2004(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1aca(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x201a(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x2053(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x208c(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a92(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x20b6(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x1a76(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
lea    0x20de(%rip),%rdi
mov    $0x0,%al
call   1030 <glp_printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_help>:
push   %r14
push   %rbx
push   %rax
mov    %rdi,%rsi
lea    0xee2(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x211d(%rip),%r14
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xee4(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xee8(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xf18(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xf51(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xf80(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xfac(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xfe7(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0xff8(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x100c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1046(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1068(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x107b(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x10b6(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x10f1(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1107(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1142(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1174(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x11ae(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x11e8(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1222(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1256(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1289(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x12b7(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x12dc(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1308(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x131b(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1356(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1369(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x137e(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1393(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x13b3(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x13d0(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x13e5(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x141c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1430(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1468(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1470(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x14a9(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x14d1(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x14fd(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x152d(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1561(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1589(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x15bf(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x15c9(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x15fe(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1633(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1664(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x169f(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x16d1(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1700(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x171f(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1732(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1755(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x177c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x17b1(%rip),%rbx
mov    %rbx,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x17cc(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %rbx,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x17ef(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1806(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x182b(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1844(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1875(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x18a2(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x18c4(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x18fa(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x191a(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1948(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1970(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x19a2(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x19cd(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1a08(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1a25(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1a5a(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1a81(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1a9f(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1ac7(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1af4(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1b2e(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1b54(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1b67(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1b9c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1bc4(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1bed(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1c15(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1c41(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1c77(%rip),%rbx
mov    %rbx,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1c86(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1cbf(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1ce2(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1d0e(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1d3b(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1d71(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %rbx,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1d9a(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1dbe(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1ddf(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1e18(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1e33(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1e5c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1e89(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1ebc(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1ede(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1efb(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1f1b(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1f49(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1f82(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1fab(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x1fe1(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x201c(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x2036(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x206f(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x20a8(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x20d6(%rip),%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
mov    %r14,%rdi
xor    %eax,%eax
call   1030 <glp_printf@plt>
lea    0x2102(%rip),%rdi
xor    %eax,%eax
add    $0x8,%rsp
pop    %rbx
pop    %r14
jmp    1030 <glp_printf@plt>

LLVM IR (-O0):
@.str = [33 x i8] c"Usage: %s [options...] filename\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [18 x i8] c"General options:\0A\00"
@.str.3 = [62 x i8] c" --mps read LP/MIP problem in fixed MPS format\0A\00"
@.str.4 = [71 x i8] c" --freemps read LP/MIP problem in free MPS format (default)\0A\00"
@.str.5 = [61 x i8] c" --lp read LP/MIP problem in CPLEX LP format\0A\00"
@.str.6 = [58 x i8] c" --glp read LP/MIP problem in GLPK format \0A\00"
@.str.7 = [73 x i8] c" --math read LP/MIP model written in GNU MathProg modeling\0A\00"
@.str.8 = [31 x i8] c" language\0A\00"
@.str.9 = [34 x i8] c" -m filename, --model filename\0A\00"
@.str.10 = [72 x i8] c" read model section and optional data section from\0A\00"
@.str.11 = [48 x i8] c" filename (same as --math)\0A\00"
@.str.12 = [33 x i8] c" -d filename, --data filename\0A\00"
@.str.13 = [73 x i8] c" read data section from filename (for --math only);\0A\00"
@.str.14 = [73 x i8] c" if model file also has data section, it is ignored\0A\00"
@.str.15 = [36 x i8] c" -y filename, --display filename\0A\00"
@.str.16 = [73 x i8] c" send display output to filename (for --math only);\0A\00"
@.str.17 = [64 x i8] c" by default the output is sent to terminal\0A\00"
@.str.18 = [72 x i8] c" --seed value initialize pseudo-random number generator used in\0A\00"
@.str.19 = [72 x i8] c" MathProg model with specified seed (any integer);\0A\00"
@.str.20 = [72 x i8] c" if seed value is ?, some random seed will be used\0A\00"
@.str.21 = [66 x i8] c" --mincost read min-cost flow problem in DIMACS format\0A\00"
@.str.22 = [65 x i8] c" --maxflow read maximum flow problem in DIMACS format\0A\00"
@.str.23 = [60 x i8] c" --cnf read CNF-SAT problem in DIMACS format\0A\00"
@.str.24 = [51 x i8] c" --simplex use simplex method (default)\0A\00"
@.str.25 = [58 x i8] c" --interior use interior point method (LP only)\0A\00"
@.str.26 = [33 x i8] c" -r filename, --read filename\0A\00"
@.str.27 = [73 x i8] c" read solution from filename rather to find it with\0A\00"
@.str.28 = [33 x i8] c" the solver\0A\00"
@.str.29 = [35 x i8] c" --min minimization\0A\00"
@.str.30 = [35 x i8] c" --max maximization\0A\00"
@.str.31 = [46 x i8] c" --scale scale problem (default)\0A\00"
@.str.32 = [43 x i8] c" --noscale do not scale problem\0A\00"
@.str.33 = [35 x i8] c" -o filename, --output filename\0A\00"
@.str.34 = [69 x i8] c" write solution to filename in printable format\0A\00"
@.str.35 = [34 x i8] c" -w filename, --write filename\0A\00"
@.str.36 = [70 x i8] c" write solution to filename in plain text format\0A\00"
@.str.37 = [22 x i8] c" --ranges filename\0A\00"
@.str.38 = [71 x i8] c" write sensitivity analysis report to filename in\0A\00"
@.str.39 = [54 x i8] c" printable format (simplex only)\0A\00"
@.str.40 = [58 x i8] c" --tmlim nnn limit solution time to nnn seconds \0A\00"
@.str.41 = [62 x i8] c" --memlim nnn limit available memory to nnn megabytes\0A\00"
@.str.42 = [66 x i8] c" --check do not solve problem, check input data only\0A\00"
@.str.43 = [54 x i8] c" --name probname change problem name to probname\0A\00"
@.str.44 = [68 x i8] c" --wmps filename write problem to filename in fixed MPS format\0A\00"
@.str.45 = [24 x i8] c" --wfreemps filename\0A\00"
@.str.46 = [67 x i8] c" write problem to filename in free MPS format\0A\00"
@.str.47 = [67 x i8] c" --wlp filename write problem to filename in CPLEX LP format\0A\00"
@.str.48 = [63 x i8] c" --wglp filename write problem to filename in GLPK format\0A\00"
@.str.49 = [73 x i8] c" --wcnf filename write problem to filename in DIMACS CNF-SAT format\0A\00"
@.str.50 = [64 x i8] c" --log filename write copy of terminal output to filename\0A\00"
@.str.51 = [61 x i8] c" -h, --help display this help information and exit\0A\00"
@.str.52 = [55 x i8] c" -v, --version display program version and exit\0A\00"
@.str.53 = [33 x i8] c"LP basis factorization options:\0A\00"
@.str.54 = [49 x i8] c" --luf LU + Forrest-Tomlin update\0A\00"
@.str.55 = [53 x i8] c" (faster, less stable; default)\0A\00"
@.str.56 = [67 x i8] c" --cbg LU + Schur complement + Bartels-Golub update\0A\00"
@.str.57 = [44 x i8] c" (slower, more stable)\0A\00"
@.str.58 = [69 x i8] c" --cgr LU + Schur complement + Givens rotation update\0A\00"
@.str.59 = [37 x i8] c"Options specific to simplex solver:\0A\00"
@.str.60 = [51 x i8] c" --primal use primal simplex (default)\0A\00"
@.str.61 = [39 x i8] c" --dual use dual simplex\0A\00"
@.str.62 = [63 x i8] c" --std use standard initial basis of all slacks\0A\00"
@.str.63 = [59 x i8] c" --adv use advanced initial basis (default)\0A\00"
@.str.64 = [48 x i8] c" --bib use Bixby's initial basis\0A\00"
@.str.65 = [68 x i8] c" --ini filename use as initial basis previously saved with -w\0A\00"
@.str.66 = [46 x i8] c" (disables LP presolver)\0A\00"
@.str.67 = [60 x i8] c" --steep use steepest edge technique (default)\0A\00"
@.str.68 = [54 x i8] c" --nosteep use standard \22textbook\22 pricing\0A\00"
@.str.69 = [64 x i8] c" --relax use Harris' two-pass ratio test (default)\0A\00"
@.str.70 = [57 x i8] c" --norelax use standard \22textbook\22 ratio test\0A\00"
@.str.71 = [73 x i8] c" --presol use presolver (default; assumes --scale and --adv)\0A\00"
@.str.72 = [43 x i8] c" --nopresol do not use presolver\0A\00"
@.str.73 = [67 x i8] c" --exact use simplex method based on exact arithmetic\0A\00"
@.str.74 = [63 x i8] c" --xcheck check final basis using exact arithmetic\0A\00"
@.str.75 = [44 x i8] c"Options specific to interior-point solver:\0A\00"
@.str.76 = [54 x i8] c" --nord use natural (original) ordering\0A\00"
@.str.77 = [59 x i8] c" --qmd use quotient minimum degree ordering\0A\00"
@.str.78 = [72 x i8] c" --amd use approximate minimum degree ordering (default)\0A\00"
@.str.79 = [62 x i8] c" --symamd use approximate minimum degree ordering\0A\00"
@.str.80 = [33 x i8] c"Options specific to MIP solver:\0A\00"
@.str.81 = [67 x i8] c" --nomip consider all integer variables as continuous\0A\00"
@.str.82 = [54 x i8] c" (allows solving MIP as pure LP)\0A\00"
@.str.83 = [55 x i8] c" --first branch on first integer variable\0A\00"
@.str.84 = [54 x i8] c" --last branch on last integer variable\0A\00"
@.str.85 = [58 x i8] c" --mostf branch on most fractional variable \0A\00"
@.str.86 = [68 x i8] c" --drtom branch using heuristic by Driebeck and Tomlin\0A\00"
@.str.87 = [32 x i8] c" (default)\0A\00"
@.str.88 = [71 x i8] c" --pcost branch using hybrid pseudocost heuristic (may be\0A\00"
@.str.89 = [49 x i8] c" useful for hard instances)\0A\00"
@.str.90 = [58 x i8] c" --dfs backtrack using depth first search \0A\00"
@.str.91 = [59 x i8] c" --bfs backtrack using breadth first search\0A\00"
@.str.92 = [68 x i8] c" --bestp backtrack using the best projection heuristic\0A\00"
@.str.93 = [65 x i8] c" --bestb backtrack using node with best local bound\0A\00"
@.str.94 = [50 x i8] c" --intopt use MIP presolver (default)\0A\00"
@.str.95 = [47 x i8] c" --nointopt do not use MIP presolver\0A\00"
@.str.96 = [71 x i8] c" --binarize replace general integer variables by binary ones\0A\00"
@.str.97 = [41 x i8] c" (assumes --intopt)\0A\00"
@.str.98 = [55 x i8] c" --fpump apply feasibility pump heuristic\0A\00"
@.str.99 = [59 x i8] c" --gomory generate Gomory's mixed integer cuts\0A\00"
@.str.100 = [65 x i8] c" --mir generate MIR (mixed integer rounding) cuts\0A\00"
@.str.101 = [48 x i8] c" --cover generate mixed cover cuts\0A\00"
@.str.102 = [43 x i8] c" --clique generate clique cuts\0A\00"
@.str.103 = [46 x i8] c" --cuts generate all cuts above\0A\00"
@.str.104 = [60 x i8] c" --mipgap tol set relative mip gap tolerance to tol\0A\00"
@.str.105 = [71 x i8] c" --minisat translate integer feasibility problem to CNF-SAT\0A\00"
@.str.106 = [55 x i8] c" and solve it with MiniSat solver\0A\00"
@.str.107 = [68 x i8] c" --objbnd bound add inequality obj <= bound (minimization) or\0A\00"
@.str.108 = [73 x i8] c" obj >= bound (maximization) to integer feasibility\0A\00"
@.str.109 = [50 x i8] c" problem (assumes --minisat)\0A\00"
@.str.110 = [71 x i8] c"For description of the MPS and CPLEX LP formats see Reference Manual.\0A\00"
@.str.111 = [71 x i8] c"For description of the modeling language see \22GLPK: Modeling Language\0A\00"
@.str.112 = [70 x i8] c"GNU MathProg\22. Both documents are included in the GLPK distribution.\0A\00"
@.str.113 = [68 x i8] c"See GLPK web page at <http://www.gnu.org/software/glpk/glpk.html>.\0A\00"
@.str.114 = [43 x i8] c"Please report bugs to <bug-glpk@gnu.org>.\0A\00"
define void @print_help(i8* %0) {
%2 = alloca i8*
store i8* %0, i8** %2
%3 = load i8*, i8** %2
%4 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0), i8* %3)
%5 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%6 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.2, i64 0, i64 0))
%7 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i64 0, i64 0))
%9 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.5, i64 0, i64 0))
%10 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.6, i64 0, i64 0))
%11 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.7, i64 0, i64 0))
%12 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.8, i64 0, i64 0))
%13 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.9, i64 0, i64 0))
%14 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.10, i64 0, i64 0))
%15 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.11, i64 0, i64 0))
%16 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.12, i64 0, i64 0))
%17 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.13, i64 0, i64 0))
%18 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.14, i64 0, i64 0))
%19 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.15, i64 0, i64 0))
%20 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.16, i64 0, i64 0))
%21 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.17, i64 0, i64 0))
%22 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.18, i64 0, i64 0))
%23 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.19, i64 0, i64 0))
%24 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.20, i64 0, i64 0))
%25 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.21, i64 0, i64 0))
%26 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.22, i64 0, i64 0))
%27 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.23, i64 0, i64 0))
%28 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.24, i64 0, i64 0))
%29 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.25, i64 0, i64 0))
%30 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.26, i64 0, i64 0))
%31 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.27, i64 0, i64 0))
%32 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.28, i64 0, i64 0))
%33 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.29, i64 0, i64 0))
%34 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.30, i64 0, i64 0))
%35 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.31, i64 0, i64 0))
%36 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.32, i64 0, i64 0))
%37 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.33, i64 0, i64 0))
%38 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.34, i64 0, i64 0))
%39 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.35, i64 0, i64 0))
%40 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.36, i64 0, i64 0))
%41 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.37, i64 0, i64 0))
%42 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.38, i64 0, i64 0))
%43 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.39, i64 0, i64 0))
%44 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.40, i64 0, i64 0))
%45 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.41, i64 0, i64 0))
%46 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.42, i64 0, i64 0))
%47 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.43, i64 0, i64 0))
%48 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.44, i64 0, i64 0))
%49 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.45, i64 0, i64 0))
%50 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.46, i64 0, i64 0))
%51 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.47, i64 0, i64 0))
%52 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.48, i64 0, i64 0))
%53 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.49, i64 0, i64 0))
%54 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.50, i64 0, i64 0))
%55 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.51, i64 0, i64 0))
%56 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.52, i64 0, i64 0))
%57 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%58 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.53, i64 0, i64 0))
%59 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.54, i64 0, i64 0))
%60 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.55, i64 0, i64 0))
%61 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.56, i64 0, i64 0))
%62 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.57, i64 0, i64 0))
%63 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.58, i64 0, i64 0))
%64 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.57, i64 0, i64 0))
%65 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%66 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.59, i64 0, i64 0))
%67 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.60, i64 0, i64 0))
%68 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.61, i64 0, i64 0))
%69 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.62, i64 0, i64 0))
%70 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.63, i64 0, i64 0))
%71 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.64, i64 0, i64 0))
%72 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.65, i64 0, i64 0))
%73 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.66, i64 0, i64 0))
%74 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.67, i64 0, i64 0))
%75 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.68, i64 0, i64 0))
%76 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.69, i64 0, i64 0))
%77 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.70, i64 0, i64 0))
%78 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.71, i64 0, i64 0))
%79 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.72, i64 0, i64 0))
%80 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.73, i64 0, i64 0))
%81 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.74, i64 0, i64 0))
%82 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%83 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.75, i64 0, i64 0))
%84 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.76, i64 0, i64 0))
%85 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.77, i64 0, i64 0))
%86 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.78, i64 0, i64 0))
%87 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.79, i64 0, i64 0))
%88 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%89 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.80, i64 0, i64 0))
%90 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.81, i64 0, i64 0))
%91 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.82, i64 0, i64 0))
%92 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.83, i64 0, i64 0))
%93 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.84, i64 0, i64 0))
%94 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.85, i64 0, i64 0))
%95 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.86, i64 0, i64 0))
%96 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.87, i64 0, i64 0))
%97 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.88, i64 0, i64 0))
%98 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.89, i64 0, i64 0))
%99 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.90, i64 0, i64 0))
%100 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.91, i64 0, i64 0))
%101 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.92, i64 0, i64 0))
%102 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.93, i64 0, i64 0))
%103 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.87, i64 0, i64 0))
%104 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.94, i64 0, i64 0))
%105 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.95, i64 0, i64 0))
%106 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.96, i64 0, i64 0))
%107 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.97, i64 0, i64 0))
%108 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.98, i64 0, i64 0))
%109 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.99, i64 0, i64 0))
%110 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.100, i64 0, i64 0))
%111 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.101, i64 0, i64 0))
%112 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.102, i64 0, i64 0))
%113 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.103, i64 0, i64 0))
%114 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.104, i64 0, i64 0))
%115 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.105, i64 0, i64 0))
%116 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.106, i64 0, i64 0))
%117 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.107, i64 0, i64 0))
%118 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.108, i64 0, i64 0))
%119 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.109, i64 0, i64 0))
%120 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%121 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.110, i64 0, i64 0))
%122 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.111, i64 0, i64 0))
%123 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.112, i64 0, i64 0))
%124 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%125 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.113, i64 0, i64 0))
%126 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%127 = call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.114, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@.str = [33 x i8] c"Usage: %s [options...] filename\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [18 x i8] c"General options:\0A\00"
@.str.3 = [62 x i8] c" --mps read LP/MIP problem in fixed MPS format\0A\00"
@.str.4 = [71 x i8] c" --freemps read LP/MIP problem in free MPS format (default)\0A\00"
@.str.5 = [61 x i8] c" --lp read LP/MIP problem in CPLEX LP format\0A\00"
@.str.6 = [58 x i8] c" --glp read LP/MIP problem in GLPK format \0A\00"
@.str.7 = [73 x i8] c" --math read LP/MIP model written in GNU MathProg modeling\0A\00"
@.str.8 = [31 x i8] c" language\0A\00"
@.str.9 = [34 x i8] c" -m filename, --model filename\0A\00"
@.str.10 = [72 x i8] c" read model section and optional data section from\0A\00"
@.str.11 = [48 x i8] c" filename (same as --math)\0A\00"
@.str.12 = [33 x i8] c" -d filename, --data filename\0A\00"
@.str.13 = [73 x i8] c" read data section from filename (for --math only);\0A\00"
@.str.14 = [73 x i8] c" if model file also has data section, it is ignored\0A\00"
@.str.15 = [36 x i8] c" -y filename, --display filename\0A\00"
@.str.16 = [73 x i8] c" send display output to filename (for --math only);\0A\00"
@.str.17 = [64 x i8] c" by default the output is sent to terminal\0A\00"
@.str.18 = [72 x i8] c" --seed value initialize pseudo-random number generator used in\0A\00"
@.str.19 = [72 x i8] c" MathProg model with specified seed (any integer);\0A\00"
@.str.20 = [72 x i8] c" if seed value is ?, some random seed will be used\0A\00"
@.str.21 = [66 x i8] c" --mincost read min-cost flow problem in DIMACS format\0A\00"
@.str.22 = [65 x i8] c" --maxflow read maximum flow problem in DIMACS format\0A\00"
@.str.23 = [60 x i8] c" --cnf read CNF-SAT problem in DIMACS format\0A\00"
@.str.24 = [51 x i8] c" --simplex use simplex method (default)\0A\00"
@.str.25 = [58 x i8] c" --interior use interior point method (LP only)\0A\00"
@.str.26 = [33 x i8] c" -r filename, --read filename\0A\00"
@.str.27 = [73 x i8] c" read solution from filename rather to find it with\0A\00"
@.str.28 = [33 x i8] c" the solver\0A\00"
@.str.29 = [35 x i8] c" --min minimization\0A\00"
@.str.30 = [35 x i8] c" --max maximization\0A\00"
@.str.31 = [46 x i8] c" --scale scale problem (default)\0A\00"
@.str.32 = [43 x i8] c" --noscale do not scale problem\0A\00"
@.str.33 = [35 x i8] c" -o filename, --output filename\0A\00"
@.str.34 = [69 x i8] c" write solution to filename in printable format\0A\00"
@.str.35 = [34 x i8] c" -w filename, --write filename\0A\00"
@.str.36 = [70 x i8] c" write solution to filename in plain text format\0A\00"
@.str.37 = [22 x i8] c" --ranges filename\0A\00"
@.str.38 = [71 x i8] c" write sensitivity analysis report to filename in\0A\00"
@.str.39 = [54 x i8] c" printable format (simplex only)\0A\00"
@.str.40 = [58 x i8] c" --tmlim nnn limit solution time to nnn seconds \0A\00"
@.str.41 = [62 x i8] c" --memlim nnn limit available memory to nnn megabytes\0A\00"
@.str.42 = [66 x i8] c" --check do not solve problem, check input data only\0A\00"
@.str.43 = [54 x i8] c" --name probname change problem name to probname\0A\00"
@.str.44 = [68 x i8] c" --wmps filename write problem to filename in fixed MPS format\0A\00"
@.str.45 = [24 x i8] c" --wfreemps filename\0A\00"
@.str.46 = [67 x i8] c" write problem to filename in free MPS format\0A\00"
@.str.47 = [67 x i8] c" --wlp filename write problem to filename in CPLEX LP format\0A\00"
@.str.48 = [63 x i8] c" --wglp filename write problem to filename in GLPK format\0A\00"
@.str.49 = [73 x i8] c" --wcnf filename write problem to filename in DIMACS CNF-SAT format\0A\00"
@.str.50 = [64 x i8] c" --log filename write copy of terminal output to filename\0A\00"
@.str.51 = [61 x i8] c" -h, --help display this help information and exit\0A\00"
@.str.52 = [55 x i8] c" -v, --version display program version and exit\0A\00"
@.str.53 = [33 x i8] c"LP basis factorization options:\0A\00"
@.str.54 = [49 x i8] c" --luf LU + Forrest-Tomlin update\0A\00"
@.str.55 = [53 x i8] c" (faster, less stable; default)\0A\00"
@.str.56 = [67 x i8] c" --cbg LU + Schur complement + Bartels-Golub update\0A\00"
@.str.57 = [44 x i8] c" (slower, more stable)\0A\00"
@.str.58 = [69 x i8] c" --cgr LU + Schur complement + Givens rotation update\0A\00"
@.str.59 = [37 x i8] c"Options specific to simplex solver:\0A\00"
@.str.60 = [51 x i8] c" --primal use primal simplex (default)\0A\00"
@.str.61 = [39 x i8] c" --dual use dual simplex\0A\00"
@.str.62 = [63 x i8] c" --std use standard initial basis of all slacks\0A\00"
@.str.63 = [59 x i8] c" --adv use advanced initial basis (default)\0A\00"
@.str.64 = [48 x i8] c" --bib use Bixby's initial basis\0A\00"
@.str.65 = [68 x i8] c" --ini filename use as initial basis previously saved with -w\0A\00"
@.str.66 = [46 x i8] c" (disables LP presolver)\0A\00"
@.str.67 = [60 x i8] c" --steep use steepest edge technique (default)\0A\00"
@.str.68 = [54 x i8] c" --nosteep use standard \22textbook\22 pricing\0A\00"
@.str.69 = [64 x i8] c" --relax use Harris' two-pass ratio test (default)\0A\00"
@.str.70 = [57 x i8] c" --norelax use standard \22textbook\22 ratio test\0A\00"
@.str.71 = [73 x i8] c" --presol use presolver (default; assumes --scale and --adv)\0A\00"
@.str.72 = [43 x i8] c" --nopresol do not use presolver\0A\00"
@.str.73 = [67 x i8] c" --exact use simplex method based on exact arithmetic\0A\00"
@.str.74 = [63 x i8] c" --xcheck check final basis using exact arithmetic\0A\00"
@.str.75 = [44 x i8] c"Options specific to interior-point solver:\0A\00"
@.str.76 = [54 x i8] c" --nord use natural (original) ordering\0A\00"
@.str.77 = [59 x i8] c" --qmd use quotient minimum degree ordering\0A\00"
@.str.78 = [72 x i8] c" --amd use approximate minimum degree ordering (default)\0A\00"
@.str.79 = [62 x i8] c" --symamd use approximate minimum degree ordering\0A\00"
@.str.80 = [33 x i8] c"Options specific to MIP solver:\0A\00"
@.str.81 = [67 x i8] c" --nomip consider all integer variables as continuous\0A\00"
@.str.82 = [54 x i8] c" (allows solving MIP as pure LP)\0A\00"
@.str.83 = [55 x i8] c" --first branch on first integer variable\0A\00"
@.str.84 = [54 x i8] c" --last branch on last integer variable\0A\00"
@.str.85 = [58 x i8] c" --mostf branch on most fractional variable \0A\00"
@.str.86 = [68 x i8] c" --drtom branch using heuristic by Driebeck and Tomlin\0A\00"
@.str.87 = [32 x i8] c" (default)\0A\00"
@.str.88 = [71 x i8] c" --pcost branch using hybrid pseudocost heuristic (may be\0A\00"
@.str.89 = [49 x i8] c" useful for hard instances)\0A\00"
@.str.90 = [58 x i8] c" --dfs backtrack using depth first search \0A\00"
@.str.91 = [59 x i8] c" --bfs backtrack using breadth first search\0A\00"
@.str.92 = [68 x i8] c" --bestp backtrack using the best projection heuristic\0A\00"
@.str.93 = [65 x i8] c" --bestb backtrack using node with best local bound\0A\00"
@.str.94 = [50 x i8] c" --intopt use MIP presolver (default)\0A\00"
@.str.95 = [47 x i8] c" --nointopt do not use MIP presolver\0A\00"
@.str.96 = [71 x i8] c" --binarize replace general integer variables by binary ones\0A\00"
@.str.97 = [41 x i8] c" (assumes --intopt)\0A\00"
@.str.98 = [55 x i8] c" --fpump apply feasibility pump heuristic\0A\00"
@.str.99 = [59 x i8] c" --gomory generate Gomory's mixed integer cuts\0A\00"
@.str.100 = [65 x i8] c" --mir generate MIR (mixed integer rounding) cuts\0A\00"
@.str.101 = [48 x i8] c" --cover generate mixed cover cuts\0A\00"
@.str.102 = [43 x i8] c" --clique generate clique cuts\0A\00"
@.str.103 = [46 x i8] c" --cuts generate all cuts above\0A\00"
@.str.104 = [60 x i8] c" --mipgap tol set relative mip gap tolerance to tol\0A\00"
@.str.105 = [71 x i8] c" --minisat translate integer feasibility problem to CNF-SAT\0A\00"
@.str.106 = [55 x i8] c" and solve it with MiniSat solver\0A\00"
@.str.107 = [68 x i8] c" --objbnd bound add inequality obj <= bound (minimization) or\0A\00"
@.str.108 = [73 x i8] c" obj >= bound (maximization) to integer feasibility\0A\00"
@.str.109 = [50 x i8] c" problem (assumes --minisat)\0A\00"
@.str.110 = [71 x i8] c"For description of the MPS and CPLEX LP formats see Reference Manual.\0A\00"
@.str.111 = [71 x i8] c"For description of the modeling language see \22GLPK: Modeling Language\0A\00"
@.str.112 = [70 x i8] c"GNU MathProg\22. Both documents are included in the GLPK distribution.\0A\00"
@.str.113 = [68 x i8] c"See GLPK web page at <http://www.gnu.org/software/glpk/glpk.html>.\0A\00"
@.str.114 = [43 x i8] c"Please report bugs to <bug-glpk@gnu.org>.\0A\00"
define void @print_help(i8* %0) {
%2 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0), i8* %0)
%3 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%4 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.2, i64 0, i64 0))
%5 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.3, i64 0, i64 0))
%6 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i64 0, i64 0))
%7 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.5, i64 0, i64 0))
%8 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.6, i64 0, i64 0))
%9 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.7, i64 0, i64 0))
%10 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.8, i64 0, i64 0))
%11 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.9, i64 0, i64 0))
%12 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.10, i64 0, i64 0))
%13 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.11, i64 0, i64 0))
%14 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.12, i64 0, i64 0))
%15 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.13, i64 0, i64 0))
%16 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.14, i64 0, i64 0))
%17 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.15, i64 0, i64 0))
%18 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.16, i64 0, i64 0))
%19 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.17, i64 0, i64 0))
%20 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.18, i64 0, i64 0))
%21 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.19, i64 0, i64 0))
%22 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.20, i64 0, i64 0))
%23 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.21, i64 0, i64 0))
%24 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.22, i64 0, i64 0))
%25 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.23, i64 0, i64 0))
%26 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.24, i64 0, i64 0))
%27 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.25, i64 0, i64 0))
%28 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.26, i64 0, i64 0))
%29 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.27, i64 0, i64 0))
%30 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.28, i64 0, i64 0))
%31 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.29, i64 0, i64 0))
%32 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.30, i64 0, i64 0))
%33 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.31, i64 0, i64 0))
%34 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.32, i64 0, i64 0))
%35 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.33, i64 0, i64 0))
%36 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.34, i64 0, i64 0))
%37 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.35, i64 0, i64 0))
%38 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.36, i64 0, i64 0))
%39 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.37, i64 0, i64 0))
%40 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.38, i64 0, i64 0))
%41 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.39, i64 0, i64 0))
%42 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.40, i64 0, i64 0))
%43 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.41, i64 0, i64 0))
%44 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.42, i64 0, i64 0))
%45 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.43, i64 0, i64 0))
%46 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.44, i64 0, i64 0))
%47 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.45, i64 0, i64 0))
%48 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.46, i64 0, i64 0))
%49 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.47, i64 0, i64 0))
%50 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.48, i64 0, i64 0))
%51 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.49, i64 0, i64 0))
%52 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.50, i64 0, i64 0))
%53 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.51, i64 0, i64 0))
%54 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.52, i64 0, i64 0))
%55 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%56 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.53, i64 0, i64 0))
%57 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.54, i64 0, i64 0))
%58 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.55, i64 0, i64 0))
%59 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.56, i64 0, i64 0))
%60 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.57, i64 0, i64 0))
%61 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.58, i64 0, i64 0))
%62 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.57, i64 0, i64 0))
%63 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%64 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.59, i64 0, i64 0))
%65 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.60, i64 0, i64 0))
%66 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.61, i64 0, i64 0))
%67 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.62, i64 0, i64 0))
%68 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.63, i64 0, i64 0))
%69 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.64, i64 0, i64 0))
%70 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.65, i64 0, i64 0))
%71 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.66, i64 0, i64 0))
%72 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.67, i64 0, i64 0))
%73 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.68, i64 0, i64 0))
%74 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.69, i64 0, i64 0))
%75 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.70, i64 0, i64 0))
%76 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.71, i64 0, i64 0))
%77 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.72, i64 0, i64 0))
%78 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.73, i64 0, i64 0))
%79 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.74, i64 0, i64 0))
%80 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%81 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.75, i64 0, i64 0))
%82 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.76, i64 0, i64 0))
%83 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.77, i64 0, i64 0))
%84 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.78, i64 0, i64 0))
%85 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.79, i64 0, i64 0))
%86 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%87 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.80, i64 0, i64 0))
%88 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.81, i64 0, i64 0))
%89 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.82, i64 0, i64 0))
%90 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.83, i64 0, i64 0))
%91 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.84, i64 0, i64 0))
%92 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.85, i64 0, i64 0))
%93 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.86, i64 0, i64 0))
%94 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.87, i64 0, i64 0))
%95 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.88, i64 0, i64 0))
%96 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.89, i64 0, i64 0))
%97 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.90, i64 0, i64 0))
%98 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.91, i64 0, i64 0))
%99 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.92, i64 0, i64 0))
%100 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.93, i64 0, i64 0))
%101 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.87, i64 0, i64 0))
%102 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.94, i64 0, i64 0))
%103 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.95, i64 0, i64 0))
%104 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.96, i64 0, i64 0))
%105 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.97, i64 0, i64 0))
%106 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.98, i64 0, i64 0))
%107 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.99, i64 0, i64 0))
%108 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.100, i64 0, i64 0))
%109 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.101, i64 0, i64 0))
%110 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.102, i64 0, i64 0))
%111 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.103, i64 0, i64 0))
%112 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.104, i64 0, i64 0))
%113 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.105, i64 0, i64 0))
%114 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.106, i64 0, i64 0))
%115 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.107, i64 0, i64 0))
%116 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.108, i64 0, i64 0))
%117 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.109, i64 0, i64 0))
%118 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%119 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.110, i64 0, i64 0))
%120 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.111, i64 0, i64 0))
%121 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.112, i64 0, i64 0))
%122 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%123 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.113, i64 0, i64 0))
%124 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%125 = tail call i32 (i8*, ...) @glp_printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.114, i64 0, i64 0))
ret void
}