#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*/ fp_msg(char *);
int /*<<< orphan*/ fp_usage();
int /*<<< orphan*/ fp_version();
int fp_help(void) {
  fp_msg("fpack, a FITS image compression program.  Version ");
  fp_version();
  fp_usage();
  fp_msg("\n");
  fp_msg("Flags must be separate and appear before filenames:\n");
  fp_msg(" -r          Rice compression [default], or\n");
  fp_msg(" -h          Hcompress compression, or\n");
  fp_msg(" -g  or -g1  GZIP_1 (per-tile) compression, or\n");
  fp_msg(
      " -g2         GZIP_2 (per-tile) compression (with byte shuffling), or\n");
  fp_msg(" -p          PLIO compression (only for positive 8 or 16-bit integer "
         "images).\n");
  fp_msg(" -d          Tile the image without compression (debugging mode).\n");
  fp_msg(" -w          Compress the whole image as a single large tile.\n");
  fp_msg(" -t <axes>   Comma separated list of tile dimensions [default is row "
         "by row].\n");
  fp_msg(" -q <level>  Quantized level spacing when converting floating point "
         "images to\n");
  fp_msg("             scaled integers. (+value relative to sigma of "
         "background noise;\n");
  fp_msg("             -value is absolute). Default q value of 4 gives a "
         "compression ratio\n");
  fp_msg("             of about 6 with very high fidelity (only 0.26% increase "
         "in noise).\n");
  fp_msg("             Using q values of  2, or 1 will give compression ratios "
         "of\n");
  fp_msg("             about 8, or 10, respectively (with 1.0% or 4.1% noise "
         "increase).\n");
  fp_msg("             The scaled quantized values are randomly dithered using "
         "a seed \n");
  fp_msg("             value determined from the system clock at run time.\n");
  fp_msg("             Use -q0 instead of -q to suppress random dithering.\n");
  fp_msg("             Use -qt to compute random dithering seed from first "
         "tile checksum.\n");
  fp_msg("             Use -qN, (N in range 1 to 10000) to use a specific "
         "dithering seed.\n");
  fp_msg("             Floating-point images can be losslessly compressed by "
         "selecting\n");
  fp_msg("             the GZIP algorithm and specifying -q 0, but this is "
         "slower and often\n");
  fp_msg("             produces much less compression than the default "
         "quantization method.\n");
  fp_msg(" -i2f        Convert integer images to floating point, then quantize "
         "and compress\n");
  fp_msg("             using the specified q level.  When used appropriately, "
         "this lossy\n");
  fp_msg("             compression method can give much better compression "
         "than the normal\n");
  fp_msg("             lossless compression methods without significant loss "
         "of information.\n");
  fp_msg("             The -n3ratio and -n3min flags control the minimum noise "
         "thresholds;\n");
  fp_msg("             Images below these thresholds will be losslessly "
         "compressed.\n");
  fp_msg(" -n3ratio    Minimum ratio of background noise sigma divided by q.  "
         "Default = 1.2.\n");
  fp_msg(" -n3min      Minimum background noise sigma. Default = 6. The -i2f "
         "flag will be ignored\n");
  fp_msg("             if the noise level in the image does not exceed both "
         "thresholds.\n");
  fp_msg(" -s <scale>  Scale factor for lossy Hcompress [default = 0 = "
         "lossless]\n");
  fp_msg("             (+values relative to RMS noise; -value is absolute)\n");
  fp_msg(" -n <noise>  Rescale scaled-integer images to reduce noise and "
         "improve compression.\n");
  fp_msg(" -v          Verbose mode; list each file as it is processed.\n");
  fp_msg(" -T          Show compression algorithm comparison test statistics; "
         "files unchanged.\n");
  fp_msg(" -R <file>   Write the comparison test report (above) to a text "
         "file.\n");
  fp_msg(" -BETAtable  Compress FITS binary tables using prototype method.\n");
  fp_msg(
      "             This option is ONLY for experimental use!  Do NOT use\n");
  fp_msg(
      "             on FITS data files that are to be publicly distributed.\n");
  fp_msg(" -fast       Used with -BETAtable to favor speed over maximum "
         "compression.\n");
  fp_msg("\nkeywords shared with funpack:\n");
  fp_msg(" -F          Overwrite input file by output file with same name.\n");
  fp_msg(" -D          Delete input file after writing output.\n");
  fp_msg(" -Y          Suppress prompts to confirm -F or -D options.\n");
  fp_msg(" -S          Output compressed FITS files to STDOUT.\n");
  fp_msg(" -L          List contents; files unchanged.\n");
  fp_msg(" -C          Don't update FITS checksum keywords.\n");
  fp_msg(" -H          Show this message.\n");
  fp_msg(" -V          Show version number.\n");
  fp_msg("\n <FITS>      FITS files to pack; enter '-' (a hyphen) to read "
         "input from stdin stream.\n");
  fp_msg(" Refer to the fpack User's Guide for more extensive help.\n");
  return (0);
}


x86 assembly (clang, -O0):
<fp_help>:
push   %rbp
mov    %rsp,%rbp
lea    0xec5(%rip),%rdi
call   1030 <fp_msg@plt>
mov    $0x0,%al
call   1050 <fp_version@plt>
mov    $0x0,%al
call   1040 <fp_usage@plt>
lea    0x1322(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xed2(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xefb(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf1c(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf38(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf5c(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf96(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xfd9(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1010(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1043(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1086(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x10c9(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x110b(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1151(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1196(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x11d3(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1216(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1258(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x128e(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x12c4(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1309(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x134e(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1390(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x13d7(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x141e(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1465(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x14a9(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x14ef(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1537(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x157d(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x15bc(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1604(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1651(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1694(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x16d0(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1706(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x174f(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1782(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x17cc(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1807(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x183d(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1875(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x18af(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x18ef(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1903(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1939(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1963(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1993(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x19bd(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x19df(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a06(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a1b(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a32(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a7f(%rip),%rdi
call   1030 <fp_msg@plt>
xor    %eax,%eax
pop    %rbp
ret

x86 assembly (clang, -O2):
<fp_help>:
push   %rax
lea    0xec8(%rip),%rdi
call   1030 <fp_msg@plt>
xor    %eax,%eax
call   1050 <fp_version@plt>
xor    %eax,%eax
call   1040 <fp_usage@plt>
lea    0x1325(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xed5(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xefe(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf1f(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf3b(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf5f(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xf99(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0xfdc(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1013(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1046(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1089(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x10cc(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x110e(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1154(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1199(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x11d6(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1219(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x125b(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1291(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x12c7(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x130c(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1351(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1393(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x13da(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1421(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1468(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x14ac(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x14f2(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x153a(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1580(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x15bf(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1607(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1654(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1697(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x16d3(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1709(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1752(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1785(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x17cf(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x180a(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1840(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1878(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x18b2(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x18f2(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1906(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x193c(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1966(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1996(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x19c0(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x19e2(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a09(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a1e(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a35(%rip),%rdi
call   1030 <fp_msg@plt>
lea    0x1a82(%rip),%rdi
call   1030 <fp_msg@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [51 x i8] c"fpack, a FITS image compression program. Version \00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [53 x i8] c"Flags must be separate and appear before filenames:\0A\00"
@.str.3 = [45 x i8] c" -r Rice compression [default], or\0A\00"
@.str.4 = [40 x i8] c" -h Hcompress compression, or\0A\00"
@.str.5 = [48 x i8] c" -g or -g1 GZIP_1 (per-tile) compression, or\0A\00"
@.str.6 = [70 x i8] c" -g2 GZIP_2 (per-tile) compression (with byte shuffling), or\0A\00"
@.str.7 = [79 x i8] c" -p PLIO compression (only for positive 8 or 16-bit integer images).\0A\00"
@.str.8 = [67 x i8] c" -d Tile the image without compression (debugging mode).\0A\00"
@.str.9 = [63 x i8] c" -w Compress the whole image as a single large tile.\0A\00"
@.str.10 = [79 x i8] c" -t <axes> Comma separated list of tile dimensions [default is row by row].\0A\00"
@.str.11 = [79 x i8] c" -q <level> Quantized level spacing when converting floating point images to\0A\00"
@.str.12 = [78 x i8] c" scaled integers. (+value relative to sigma of background noise;\0A\00"
@.str.13 = [82 x i8] c" -value is absolute). Default q value of 4 gives a compression ratio\0A\00"
@.str.14 = [81 x i8] c" of about 6 with very high fidelity (only 0.26% increase in noise).\0A\00"
@.str.15 = [73 x i8] c" Using q values of 2, or 1 will give compression ratios of\0A\00"
@.str.16 = [79 x i8] c" about 8, or 10, respectively (with 1.0% or 4.1% noise increase).\0A\00"
@.str.17 = [78 x i8] c" The scaled quantized values are randomly dithered using a seed \0A\00"
@.str.18 = [66 x i8] c" value determined from the system clock at run time.\0A\00"
@.str.19 = [66 x i8] c" Use -q0 instead of -q to suppress random dithering.\0A\00"
@.str.20 = [81 x i8] c" Use -qt to compute random dithering seed from first tile checksum.\0A\00"
@.str.21 = [81 x i8] c" Use -qN, (N in range 1 to 10000) to use a specific dithering seed.\0A\00"
@.str.22 = [78 x i8] c" Floating-point images can be losslessly compressed by selecting\0A\00"
@.str.23 = [83 x i8] c" the GZIP algorithm and specifying -q 0, but this is slower and often\0A\00"
@.str.24 = [83 x i8] c" produces much less compression than the default quantization method.\0A\00"
@.str.25 = [83 x i8] c" -i2f Convert integer images to floating point, then quantize and compress\0A\00"
@.str.26 = [80 x i8] c" using the specified q level. When used appropriately, this lossy\0A\00"
@.str.27 = [82 x i8] c" compression method can give much better compression than the normal\0A\00"
@.str.28 = [84 x i8] c" lossless compression methods without significant loss of information.\0A\00"
@.str.29 = [82 x i8] c" The -n3ratio and -n3min flags control the minimum noise thresholds;\0A\00"
@.str.30 = [75 x i8] c" Images below these thresholds will be losslessly compressed.\0A\00"
@.str.31 = [84 x i8] c" -n3ratio Minimum ratio of background noise sigma divided by q. Default = 1.2.\0A\00"
@.str.32 = [89 x i8] c" -n3min Minimum background noise sigma. Default = 6. The -i2f flag will be ignored\0A\00"
@.str.33 = [79 x i8] c" if the noise level in the image does not exceed both thresholds.\0A\00"
@.str.34 = [72 x i8] c" -s <scale> Scale factor for lossy Hcompress [default = 0 = lossless]\0A\00"
@.str.35 = [66 x i8] c" (+values relative to RMS noise; -value is absolute)\0A\00"
@.str.36 = [85 x i8] c" -n <noise> Rescale scaled-integer images to reduce noise and improve compression.\0A\00"
@.str.37 = [63 x i8] c" -v Verbose mode; list each file as it is processed.\0A\00"
@.str.38 = [86 x i8] c" -T Show compression algorithm comparison test statistics; files unchanged.\0A\00"
@.str.39 = [71 x i8] c" -R <file> Write the comparison test report (above) to a text file.\0A\00"
@.str.40 = [66 x i8] c" -BETAtable Compress FITS binary tables using prototype method.\0A\00"
@.str.41 = [68 x i8] c" This option is ONLY for experimental use! Do NOT use\0A\00"
@.str.42 = [70 x i8] c" on FITS data files that are to be publicly distributed.\0A\00"
@.str.43 = [76 x i8] c" -fast Used with -BETAtable to favor speed over maximum compression.\0A\00"
@.str.44 = [32 x i8] c"\0Akeywords shared with funpack:\0A\00"
@.str.45 = [66 x i8] c" -F Overwrite input file by output file with same name.\0A\00"
@.str.46 = [54 x i8] c" -D Delete input file after writing output.\0A\00"
@.str.47 = [60 x i8] c" -Y Suppress prompts to confirm -F or -D options.\0A\00"
@.str.48 = [54 x i8] c" -S Output compressed FITS files to STDOUT.\0A\00"
@.str.49 = [46 x i8] c" -L List contents; files unchanged.\0A\00"
@.str.50 = [51 x i8] c" -C Don't update FITS checksum keywords.\0A\00"
@.str.51 = [33 x i8] c" -H Show this message.\0A\00"
@.str.52 = [35 x i8] c" -V Show version number.\0A\00"
@.str.53 = [89 x i8] c"\0A <FITS> FITS files to pack; enter '-' (a hyphen) to read input from stdin stream.\0A\00"
@.str.54 = [59 x i8] c" Refer to the fpack User's Guide for more extensive help.\0A\00"
define i32 @fp_help() {
%1 = call i32 @fp_msg(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str, i64 0, i64 0))
%2 = call i32 (...) @fp_version()
%3 = call i32 (...) @fp_usage()
%4 = call i32 @fp_msg(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @fp_msg(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.2, i64 0, i64 0))
%6 = call i32 @fp_msg(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.3, i64 0, i64 0))
%7 = call i32 @fp_msg(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.4, i64 0, i64 0))
%8 = call i32 @fp_msg(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.5, i64 0, i64 0))
%9 = call i32 @fp_msg(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.6, i64 0, i64 0))
%10 = call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.7, i64 0, i64 0))
%11 = call i32 @fp_msg(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.8, i64 0, i64 0))
%12 = call i32 @fp_msg(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.9, i64 0, i64 0))
%13 = call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.10, i64 0, i64 0))
%14 = call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.11, i64 0, i64 0))
%15 = call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.12, i64 0, i64 0))
%16 = call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.13, i64 0, i64 0))
%17 = call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.14, i64 0, i64 0))
%18 = call i32 @fp_msg(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.15, i64 0, i64 0))
%19 = call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.16, i64 0, i64 0))
%20 = call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.17, i64 0, i64 0))
%21 = call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.18, i64 0, i64 0))
%22 = call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.19, i64 0, i64 0))
%23 = call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.20, i64 0, i64 0))
%24 = call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.21, i64 0, i64 0))
%25 = call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.22, i64 0, i64 0))
%26 = call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.23, i64 0, i64 0))
%27 = call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.24, i64 0, i64 0))
%28 = call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.25, i64 0, i64 0))
%29 = call i32 @fp_msg(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.26, i64 0, i64 0))
%30 = call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.27, i64 0, i64 0))
%31 = call i32 @fp_msg(i8* getelementptr inbounds ([84 x i8], [84 x i8]* @.str.28, i64 0, i64 0))
%32 = call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.29, i64 0, i64 0))
%33 = call i32 @fp_msg(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.30, i64 0, i64 0))
%34 = call i32 @fp_msg(i8* getelementptr inbounds ([84 x i8], [84 x i8]* @.str.31, i64 0, i64 0))
%35 = call i32 @fp_msg(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.32, i64 0, i64 0))
%36 = call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.33, i64 0, i64 0))
%37 = call i32 @fp_msg(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.34, i64 0, i64 0))
%38 = call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.35, i64 0, i64 0))
%39 = call i32 @fp_msg(i8* getelementptr inbounds ([85 x i8], [85 x i8]* @.str.36, i64 0, i64 0))
%40 = call i32 @fp_msg(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.37, i64 0, i64 0))
%41 = call i32 @fp_msg(i8* getelementptr inbounds ([86 x i8], [86 x i8]* @.str.38, i64 0, i64 0))
%42 = call i32 @fp_msg(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.39, i64 0, i64 0))
%43 = call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.40, i64 0, i64 0))
%44 = call i32 @fp_msg(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.41, i64 0, i64 0))
%45 = call i32 @fp_msg(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.42, i64 0, i64 0))
%46 = call i32 @fp_msg(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.43, i64 0, i64 0))
%47 = call i32 @fp_msg(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.44, i64 0, i64 0))
%48 = call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.45, i64 0, i64 0))
%49 = call i32 @fp_msg(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.46, i64 0, i64 0))
%50 = call i32 @fp_msg(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.47, i64 0, i64 0))
%51 = call i32 @fp_msg(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.48, i64 0, i64 0))
%52 = call i32 @fp_msg(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.49, i64 0, i64 0))
%53 = call i32 @fp_msg(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.50, i64 0, i64 0))
%54 = call i32 @fp_msg(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.51, i64 0, i64 0))
%55 = call i32 @fp_msg(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.52, i64 0, i64 0))
%56 = call i32 @fp_msg(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.53, i64 0, i64 0))
%57 = call i32 @fp_msg(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.54, i64 0, i64 0))
ret i32 0
}

LLVM IR (-O2):
@.str = [51 x i8] c"fpack, a FITS image compression program. Version \00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [53 x i8] c"Flags must be separate and appear before filenames:\0A\00"
@.str.3 = [45 x i8] c" -r Rice compression [default], or\0A\00"
@.str.4 = [40 x i8] c" -h Hcompress compression, or\0A\00"
@.str.5 = [48 x i8] c" -g or -g1 GZIP_1 (per-tile) compression, or\0A\00"
@.str.6 = [70 x i8] c" -g2 GZIP_2 (per-tile) compression (with byte shuffling), or\0A\00"
@.str.7 = [79 x i8] c" -p PLIO compression (only for positive 8 or 16-bit integer images).\0A\00"
@.str.8 = [67 x i8] c" -d Tile the image without compression (debugging mode).\0A\00"
@.str.9 = [63 x i8] c" -w Compress the whole image as a single large tile.\0A\00"
@.str.10 = [79 x i8] c" -t <axes> Comma separated list of tile dimensions [default is row by row].\0A\00"
@.str.11 = [79 x i8] c" -q <level> Quantized level spacing when converting floating point images to\0A\00"
@.str.12 = [78 x i8] c" scaled integers. (+value relative to sigma of background noise;\0A\00"
@.str.13 = [82 x i8] c" -value is absolute). Default q value of 4 gives a compression ratio\0A\00"
@.str.14 = [81 x i8] c" of about 6 with very high fidelity (only 0.26% increase in noise).\0A\00"
@.str.15 = [73 x i8] c" Using q values of 2, or 1 will give compression ratios of\0A\00"
@.str.16 = [79 x i8] c" about 8, or 10, respectively (with 1.0% or 4.1% noise increase).\0A\00"
@.str.17 = [78 x i8] c" The scaled quantized values are randomly dithered using a seed \0A\00"
@.str.18 = [66 x i8] c" value determined from the system clock at run time.\0A\00"
@.str.19 = [66 x i8] c" Use -q0 instead of -q to suppress random dithering.\0A\00"
@.str.20 = [81 x i8] c" Use -qt to compute random dithering seed from first tile checksum.\0A\00"
@.str.21 = [81 x i8] c" Use -qN, (N in range 1 to 10000) to use a specific dithering seed.\0A\00"
@.str.22 = [78 x i8] c" Floating-point images can be losslessly compressed by selecting\0A\00"
@.str.23 = [83 x i8] c" the GZIP algorithm and specifying -q 0, but this is slower and often\0A\00"
@.str.24 = [83 x i8] c" produces much less compression than the default quantization method.\0A\00"
@.str.25 = [83 x i8] c" -i2f Convert integer images to floating point, then quantize and compress\0A\00"
@.str.26 = [80 x i8] c" using the specified q level. When used appropriately, this lossy\0A\00"
@.str.27 = [82 x i8] c" compression method can give much better compression than the normal\0A\00"
@.str.28 = [84 x i8] c" lossless compression methods without significant loss of information.\0A\00"
@.str.29 = [82 x i8] c" The -n3ratio and -n3min flags control the minimum noise thresholds;\0A\00"
@.str.30 = [75 x i8] c" Images below these thresholds will be losslessly compressed.\0A\00"
@.str.31 = [84 x i8] c" -n3ratio Minimum ratio of background noise sigma divided by q. Default = 1.2.\0A\00"
@.str.32 = [89 x i8] c" -n3min Minimum background noise sigma. Default = 6. The -i2f flag will be ignored\0A\00"
@.str.33 = [79 x i8] c" if the noise level in the image does not exceed both thresholds.\0A\00"
@.str.34 = [72 x i8] c" -s <scale> Scale factor for lossy Hcompress [default = 0 = lossless]\0A\00"
@.str.35 = [66 x i8] c" (+values relative to RMS noise; -value is absolute)\0A\00"
@.str.36 = [85 x i8] c" -n <noise> Rescale scaled-integer images to reduce noise and improve compression.\0A\00"
@.str.37 = [63 x i8] c" -v Verbose mode; list each file as it is processed.\0A\00"
@.str.38 = [86 x i8] c" -T Show compression algorithm comparison test statistics; files unchanged.\0A\00"
@.str.39 = [71 x i8] c" -R <file> Write the comparison test report (above) to a text file.\0A\00"
@.str.40 = [66 x i8] c" -BETAtable Compress FITS binary tables using prototype method.\0A\00"
@.str.41 = [68 x i8] c" This option is ONLY for experimental use! Do NOT use\0A\00"
@.str.42 = [70 x i8] c" on FITS data files that are to be publicly distributed.\0A\00"
@.str.43 = [76 x i8] c" -fast Used with -BETAtable to favor speed over maximum compression.\0A\00"
@.str.44 = [32 x i8] c"\0Akeywords shared with funpack:\0A\00"
@.str.45 = [66 x i8] c" -F Overwrite input file by output file with same name.\0A\00"
@.str.46 = [54 x i8] c" -D Delete input file after writing output.\0A\00"
@.str.47 = [60 x i8] c" -Y Suppress prompts to confirm -F or -D options.\0A\00"
@.str.48 = [54 x i8] c" -S Output compressed FITS files to STDOUT.\0A\00"
@.str.49 = [46 x i8] c" -L List contents; files unchanged.\0A\00"
@.str.50 = [51 x i8] c" -C Don't update FITS checksum keywords.\0A\00"
@.str.51 = [33 x i8] c" -H Show this message.\0A\00"
@.str.52 = [35 x i8] c" -V Show version number.\0A\00"
@.str.53 = [89 x i8] c"\0A <FITS> FITS files to pack; enter '-' (a hyphen) to read input from stdin stream.\0A\00"
@.str.54 = [59 x i8] c" Refer to the fpack User's Guide for more extensive help.\0A\00"
define i32 @fp_help() {
%1 = tail call i32 @fp_msg(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str, i64 0, i64 0))
%2 = tail call i32 (...) @fp_version()
%3 = tail call i32 (...) @fp_usage()
%4 = tail call i32 @fp_msg(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%5 = tail call i32 @fp_msg(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.2, i64 0, i64 0))
%6 = tail call i32 @fp_msg(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.3, i64 0, i64 0))
%7 = tail call i32 @fp_msg(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.4, i64 0, i64 0))
%8 = tail call i32 @fp_msg(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.5, i64 0, i64 0))
%9 = tail call i32 @fp_msg(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.6, i64 0, i64 0))
%10 = tail call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.7, i64 0, i64 0))
%11 = tail call i32 @fp_msg(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.8, i64 0, i64 0))
%12 = tail call i32 @fp_msg(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.9, i64 0, i64 0))
%13 = tail call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.10, i64 0, i64 0))
%14 = tail call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.11, i64 0, i64 0))
%15 = tail call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.12, i64 0, i64 0))
%16 = tail call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.13, i64 0, i64 0))
%17 = tail call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.14, i64 0, i64 0))
%18 = tail call i32 @fp_msg(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.15, i64 0, i64 0))
%19 = tail call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.16, i64 0, i64 0))
%20 = tail call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.17, i64 0, i64 0))
%21 = tail call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.18, i64 0, i64 0))
%22 = tail call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.19, i64 0, i64 0))
%23 = tail call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.20, i64 0, i64 0))
%24 = tail call i32 @fp_msg(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.21, i64 0, i64 0))
%25 = tail call i32 @fp_msg(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.22, i64 0, i64 0))
%26 = tail call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.23, i64 0, i64 0))
%27 = tail call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.24, i64 0, i64 0))
%28 = tail call i32 @fp_msg(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.25, i64 0, i64 0))
%29 = tail call i32 @fp_msg(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.26, i64 0, i64 0))
%30 = tail call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.27, i64 0, i64 0))
%31 = tail call i32 @fp_msg(i8* getelementptr inbounds ([84 x i8], [84 x i8]* @.str.28, i64 0, i64 0))
%32 = tail call i32 @fp_msg(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.29, i64 0, i64 0))
%33 = tail call i32 @fp_msg(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.30, i64 0, i64 0))
%34 = tail call i32 @fp_msg(i8* getelementptr inbounds ([84 x i8], [84 x i8]* @.str.31, i64 0, i64 0))
%35 = tail call i32 @fp_msg(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.32, i64 0, i64 0))
%36 = tail call i32 @fp_msg(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.33, i64 0, i64 0))
%37 = tail call i32 @fp_msg(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.34, i64 0, i64 0))
%38 = tail call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.35, i64 0, i64 0))
%39 = tail call i32 @fp_msg(i8* getelementptr inbounds ([85 x i8], [85 x i8]* @.str.36, i64 0, i64 0))
%40 = tail call i32 @fp_msg(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.37, i64 0, i64 0))
%41 = tail call i32 @fp_msg(i8* getelementptr inbounds ([86 x i8], [86 x i8]* @.str.38, i64 0, i64 0))
%42 = tail call i32 @fp_msg(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.39, i64 0, i64 0))
%43 = tail call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.40, i64 0, i64 0))
%44 = tail call i32 @fp_msg(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.41, i64 0, i64 0))
%45 = tail call i32 @fp_msg(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.42, i64 0, i64 0))
%46 = tail call i32 @fp_msg(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.43, i64 0, i64 0))
%47 = tail call i32 @fp_msg(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.44, i64 0, i64 0))
%48 = tail call i32 @fp_msg(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.45, i64 0, i64 0))
%49 = tail call i32 @fp_msg(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.46, i64 0, i64 0))
%50 = tail call i32 @fp_msg(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.47, i64 0, i64 0))
%51 = tail call i32 @fp_msg(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.48, i64 0, i64 0))
%52 = tail call i32 @fp_msg(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.49, i64 0, i64 0))
%53 = tail call i32 @fp_msg(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.50, i64 0, i64 0))
%54 = tail call i32 @fp_msg(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.51, i64 0, i64 0))
%55 = tail call i32 @fp_msg(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.52, i64 0, i64 0))
%56 = tail call i32 @fp_msg(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.53, i64 0, i64 0))
%57 = tail call i32 @fp_msg(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.54, i64 0, i64 0))
ret i32 0
}