#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*/ exit(int /*<<< orphan*/);
int /*<<< orphan*/ printf(char *);
void usage() {
  printf("Usage: nnbathy -i <XYZ file>\n");
  printf("               -o <XY file> | -n <nx>x<ny> [-c|-s] [-z <zoom>]\n");
  printf("               [-x <xmin xmax>] [-xmin <xmin>] [-xmax <xmax>]\n");
  printf("               [-y <ymin ymax>] [-ymin <ymin>] [-ymax <ymax>]\n");
  printf("               [-v|-T <vertex id>|-V]\n");
  printf("               [-D [<nx>x<ny>]]\n");
  printf("               [-L <dist>]\n");
  printf("               [-N]\n");
  printf("               [-P alg={l|nn|ns}]\n");
  printf("               [-W <min weight>]\n");
  printf("Options:\n");
  printf("  -c               -- scale internally so that the enclosing minimal "
         "ellipse\n");
  printf("                      turns into a circle (this produces results "
         "invariant to\n");
  printf("                      affine transformations)\n");
  printf("  -i <XYZ file>    -- three-column file with points to interpolate "
         "from\n");
  printf("                      (use \"-i stdin\" or \"-i -\" for standard "
         "input)\n");
  printf("  -n <nx>x<ny>     -- generate <nx>x<ny> output rectangular grid\n");
  printf(
      "  -o <XY file>     -- two-column file with points to interpolate in\n");
  printf("                      (use \"-o stdin\" or \"-o -\" for standard "
         "input)\n");
  printf("  -s               -- scale internally so that Xmax - Xmin = Ymax - "
         "Ymin\n");
  printf("  -x <xmin> <xmax> -- set Xmin and Xmax for the output grid\n");
  printf("  -xmin <xmin>     -- set Xmin for the output grid\n");
  printf("  -xmax <xmax>     -- set Xmin for the output grid\n");
  printf("  -y <ymin> <ymax> -- set Ymin and Ymax for the output grid\n");
  printf("  -ymin <ymin>     -- set Ymin for the output grid\n");
  printf("  -ymax <ymax>     -- set Ymin for the output grid\n");
  printf("  -v               -- verbose / version\n");
  printf("  -z <zoom>        -- zoom in (if <zoom> < 1) or out (<zoom> > 1) "
         "(activated\n");
  printf("                      only when used in conjunction with -n)\n");
  printf("  -D [<nx>x<ny>]   -- thin input data by averaging X, Y and Z values "
         "within\n");
  printf("                      every cell of the rectangular <nx>x<ny> grid "
         "(size\n");
  printf("                      optional with -n)\n");
  printf("  -L <dist>        -- thin input data by averaging X, Y and Z values "
         "within\n");
  printf("                      clusters of consequitive input points such "
         "that the\n");
  printf("                      sum of distances between points within each "
         "cluster\n");
  printf("                      does not exceed the specified maximum value\n");
  printf("  -N               -- do not interpolate, only pre-process\n");
  printf("  -P alg=<l|nn|ns> -- use the following algorithm:\n");
  printf("                        l -- linear interpolation\n");
  printf("                        nn -- Sibson interpolation (default)\n");
  printf("                        ns -- Non-Sibsonian interpolation\n");
  printf("  -T <vertex id>   -- verbose; in weights output print weights "
         "associated\n");
  printf("                      with this vertex only\n");
  printf("  -V               -- very verbose / version\n");
  printf("  -W <min weight>  -- restricts extrapolation by assigning minimal "
         "allowed\n");
  printf("                      weight for a vertex (normally \"-1\" or so; "
         "lower\n");
  printf("                      values correspond to lower reliability; \"0\" "
         "means\n");
  printf("                      no extrapolation)\n");
  printf("Description:\n");
  printf("  `nnbathy' interpolates scalar 2D data in specified points using "
         "Natural\n");
  printf("  Neighbours interpolation. The interpolated values are written to "
         "standard\n");
  printf("  output.\n");
  exit(0);
}


x86 assembly (clang, -O0):
<usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee7(%rip),%rdi
call   1030 <printf@plt>
lea    0xf1b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf81(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9c(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb1(%rip),%rdi
call   1030 <printf@plt>
lea    0xfc1(%rip),%rdi
call   1030 <printf@plt>
lea    0xfca(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe1(%rip),%rdi
call   1030 <printf@plt>
lea    0xff7(%rip),%rdi
call   1030 <printf@plt>
lea    0xff5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1037(%rip),%rdi
call   1030 <printf@plt>
lea    0x107a(%rip),%rdi
call   1030 <printf@plt>
lea    0x109d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10da(%rip),%rdi
call   1030 <printf@plt>
lea    0x1113(%rip),%rdi
call   1030 <printf@plt>
lea    0x1149(%rip),%rdi
call   1030 <printf@plt>
lea    0x1182(%rip),%rdi
call   1030 <printf@plt>
lea    0x11bb(%rip),%rdi
call   1030 <printf@plt>
lea    0x11f9(%rip),%rdi
call   1030 <printf@plt>
lea    0x122a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1252(%rip),%rdi
call   1030 <printf@plt>
lea    0x127a(%rip),%rdi
call   1030 <printf@plt>
lea    0x12ab(%rip),%rdi
call   1030 <printf@plt>
lea    0x12d3(%rip),%rdi
call   1030 <printf@plt>
lea    0x12fb(%rip),%rdi
call   1030 <printf@plt>
lea    0x1318(%rip),%rdi
call   1030 <printf@plt>
lea    0x135a(%rip),%rdi
call   1030 <printf@plt>
lea    0x138c(%rip),%rdi
call   1030 <printf@plt>
lea    0x13cd(%rip),%rdi
call   1030 <printf@plt>
lea    0x140b(%rip),%rdi
call   1030 <printf@plt>
lea    0x1428(%rip),%rdi
call   1030 <printf@plt>
lea    0x1469(%rip),%rdi
call   1030 <printf@plt>
lea    0x14a8(%rip),%rdi
call   1030 <printf@plt>
lea    0x14e7(%rip),%rdi
call   1030 <printf@plt>
lea    0x151e(%rip),%rdi
call   1030 <printf@plt>
lea    0x154e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1576(%rip),%rdi
call   1030 <printf@plt>
lea    0x159d(%rip),%rdi
call   1030 <printf@plt>
lea    0x15cf(%rip),%rdi
call   1030 <printf@plt>
lea    0x15fe(%rip),%rdi
call   1030 <printf@plt>
lea    0x163d(%rip),%rdi
call   1030 <printf@plt>
lea    0x165e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1680(%rip),%rdi
call   1030 <printf@plt>
lea    0x16c0(%rip),%rdi
call   1030 <printf@plt>
lea    0x16fb(%rip),%rdi
call   1030 <printf@plt>
lea    0x1738(%rip),%rdi
call   1030 <printf@plt>
lea    0x1755(%rip),%rdi
call   1030 <printf@plt>
lea    0x1757(%rip),%rdi
call   1030 <printf@plt>
lea    0x1796(%rip),%rdi
call   1030 <printf@plt>
lea    0x17d7(%rip),%rdi
call   1030 <printf@plt>
xor    %edi,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<usage>:
push   %rax
lea    0xed8(%rip),%rdi
call   1030 <puts@plt>
lea    0xee9(%rip),%rdi
call   1030 <puts@plt>
lea    0xf1c(%rip),%rdi
call   1030 <puts@plt>
lea    0xf4e(%rip),%rdi
call   1030 <puts@plt>
lea    0xf80(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9a(%rip),%rdi
call   1030 <puts@plt>
lea    0xfae(%rip),%rdi
call   1030 <puts@plt>
lea    0xfbd(%rip),%rdi
call   1030 <puts@plt>
lea    0xfc5(%rip),%rdi
call   1030 <puts@plt>
lea    0xfdb(%rip),%rdi
call   1030 <puts@plt>
lea    0xff0(%rip),%rdi
call   1030 <puts@plt>
lea    0xfed(%rip),%rdi
call   1030 <puts@plt>
lea    0x102e(%rip),%rdi
call   1030 <puts@plt>
lea    0x1070(%rip),%rdi
call   1030 <puts@plt>
lea    0x1092(%rip),%rdi
call   1030 <puts@plt>
lea    0x10ce(%rip),%rdi
call   1030 <puts@plt>
lea    0x1106(%rip),%rdi
call   1030 <puts@plt>
lea    0x113b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1173(%rip),%rdi
call   1030 <puts@plt>
lea    0x11ab(%rip),%rdi
call   1030 <puts@plt>
lea    0x11e8(%rip),%rdi
call   1030 <puts@plt>
lea    0x1218(%rip),%rdi
call   1030 <puts@plt>
lea    0x123f(%rip),%rdi
call   1030 <puts@plt>
lea    0x1266(%rip),%rdi
call   1030 <puts@plt>
lea    0x1296(%rip),%rdi
call   1030 <puts@plt>
lea    0x12bd(%rip),%rdi
call   1030 <puts@plt>
lea    0x12e4(%rip),%rdi
call   1030 <puts@plt>
lea    0x1300(%rip),%rdi
call   1030 <puts@plt>
lea    0x1341(%rip),%rdi
call   1030 <puts@plt>
lea    0x1372(%rip),%rdi
call   1030 <puts@plt>
lea    0x13b2(%rip),%rdi
call   1030 <puts@plt>
lea    0x13ef(%rip),%rdi
call   1030 <puts@plt>
lea    0x140b(%rip),%rdi
call   1030 <puts@plt>
lea    0x144b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1489(%rip),%rdi
call   1030 <puts@plt>
lea    0x14c7(%rip),%rdi
call   1030 <puts@plt>
lea    0x14fd(%rip),%rdi
call   1030 <puts@plt>
lea    0x152c(%rip),%rdi
call   1030 <puts@plt>
lea    0x1553(%rip),%rdi
call   1030 <puts@plt>
lea    0x1579(%rip),%rdi
call   1030 <puts@plt>
lea    0x15aa(%rip),%rdi
call   1030 <puts@plt>
lea    0x15d8(%rip),%rdi
call   1030 <puts@plt>
lea    0x1616(%rip),%rdi
call   1030 <puts@plt>
lea    0x1636(%rip),%rdi
call   1030 <puts@plt>
lea    0x1657(%rip),%rdi
call   1030 <puts@plt>
lea    0x1696(%rip),%rdi
call   1030 <puts@plt>
lea    0x16d0(%rip),%rdi
call   1030 <puts@plt>
lea    0x170c(%rip),%rdi
call   1030 <puts@plt>
lea    0x1728(%rip),%rdi
call   1030 <puts@plt>
lea    0x1729(%rip),%rdi
call   1030 <puts@plt>
lea    0x1767(%rip),%rdi
call   1030 <puts@plt>
lea    0x17a7(%rip),%rdi
call   1030 <puts@plt>
xor    %edi,%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@.str = [30 x i8] c"Usage: nnbathy -i <XYZ file>\0A\00"
@.str.1 = [64 x i8] c" -o <XY file> | -n <nx>x<ny> [-c|-s] [-z <zoom>]\0A\00"
@.str.2 = [63 x i8] c" [-x <xmin xmax>] [-xmin <xmin>] [-xmax <xmax>]\0A\00"
@.str.3 = [63 x i8] c" [-y <ymin ymax>] [-ymin <ymin>] [-ymax <ymax>]\0A\00"
@.str.4 = [39 x i8] c" [-v|-T <vertex id>|-V]\0A\00"
@.str.5 = [33 x i8] c" [-D [<nx>x<ny>]]\0A\00"
@.str.6 = [28 x i8] c" [-L <dist>]\0A\00"
@.str.7 = [21 x i8] c" [-N]\0A\00"
@.str.8 = [35 x i8] c" [-P alg={l|nn|ns}]\0A\00"
@.str.9 = [34 x i8] c" [-W <min weight>]\0A\00"
@.str.10 = [10 x i8] c"Options:\0A\00"
@.str.11 = [78 x i8] c" -c -- scale internally so that the enclosing minimal ellipse\0A\00"
@.str.12 = [79 x i8] c" turns into a circle (this produces results invariant to\0A\00"
@.str.13 = [47 x i8] c" affine transformations)\0A\00"
@.str.14 = [73 x i8] c" -i <XYZ file> -- three-column file with points to interpolate from\0A\00"
@.str.15 = [69 x i8] c" (use \22-i stdin\22 or \22-i -\22 for standard input)\0A\00"
@.str.16 = [66 x i8] c" -n <nx>x<ny> -- generate <nx>x<ny> output rectangular grid\0A\00"
@.str.17 = [69 x i8] c" -o <XY file> -- two-column file with points to interpolate in\0A\00"
@.str.18 = [69 x i8] c" (use \22-o stdin\22 or \22-o -\22 for standard input)\0A\00"
@.str.19 = [74 x i8] c" -s -- scale internally so that Xmax - Xmin = Ymax - Ymin\0A\00"
@.str.20 = [61 x i8] c" -x <xmin> <xmax> -- set Xmin and Xmax for the output grid\0A\00"
@.str.21 = [52 x i8] c" -xmin <xmin> -- set Xmin for the output grid\0A\00"
@.str.22 = [52 x i8] c" -xmax <xmax> -- set Xmin for the output grid\0A\00"
@.str.23 = [61 x i8] c" -y <ymin> <ymax> -- set Ymin and Ymax for the output grid\0A\00"
@.str.24 = [52 x i8] c" -ymin <ymin> -- set Ymin for the output grid\0A\00"
@.str.25 = [52 x i8] c" -ymax <ymax> -- set Ymin for the output grid\0A\00"
@.str.26 = [41 x i8] c" -v -- verbose / version\0A\00"
@.str.27 = [78 x i8] c" -z <zoom> -- zoom in (if <zoom> < 1) or out (<zoom> > 1) (activated\0A\00"
@.str.28 = [62 x i8] c" only when used in conjunction with -n)\0A\00"
@.str.29 = [77 x i8] c" -D [<nx>x<ny>] -- thin input data by averaging X, Y and Z values within\0A\00"
@.str.30 = [74 x i8] c" every cell of the rectangular <nx>x<ny> grid (size\0A\00"
@.str.31 = [41 x i8] c" optional with -n)\0A\00"
@.str.32 = [77 x i8] c" -L <dist> -- thin input data by averaging X, Y and Z values within\0A\00"
@.str.33 = [75 x i8] c" clusters of consequitive input points such that the\0A\00"
@.str.34 = [75 x i8] c" sum of distances between points within each cluster\0A\00"
@.str.35 = [67 x i8] c" does not exceed the specified maximum value\0A\00"
@.str.36 = [60 x i8] c" -N -- do not interpolate, only pre-process\0A\00"
@.str.37 = [52 x i8] c" -P alg=<l|nn|ns> -- use the following algorithm:\0A\00"
@.str.38 = [51 x i8] c" l -- linear interpolation\0A\00"
@.str.39 = [62 x i8] c" nn -- Sibson interpolation (default)\0A\00"
@.str.40 = [59 x i8] c" ns -- Non-Sibsonian interpolation\0A\00"
@.str.41 = [75 x i8] c" -T <vertex id> -- verbose; in weights output print weights associated\0A\00"
@.str.42 = [45 x i8] c" with this vertex only\0A\00"
@.str.43 = [46 x i8] c" -V -- very verbose / version\0A\00"
@.str.44 = [76 x i8] c" -W <min weight> -- restricts extrapolation by assigning minimal allowed\0A\00"
@.str.45 = [71 x i8] c" weight for a vertex (normally \22-1\22 or so; lower\0A\00"
@.str.46 = [73 x i8] c" values correspond to lower reliability; \220\22 means\0A\00"
@.str.47 = [41 x i8] c" no extrapolation)\0A\00"
@.str.48 = [14 x i8] c"Description:\0A\00"
@.str.49 = [75 x i8] c" `nnbathy' interpolates scalar 2D data in specified points using Natural\0A\00"
@.str.50 = [77 x i8] c" Neighbours interpolation. The interpolated values are written to standard\0A\00"
@.str.51 = [11 x i8] c" output.\0A\00"
define void @usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.19, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.20, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.21, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.22, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.23, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.24, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.25, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.26, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.27, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.28, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.29, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.30, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.31, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.32, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.33, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.34, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.35, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.36, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.37, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.38, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.39, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.40, i64 0, i64 0))
%42 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.41, i64 0, i64 0))
%43 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.42, i64 0, i64 0))
%44 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.43, i64 0, i64 0))
%45 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.44, i64 0, i64 0))
%46 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.45, i64 0, i64 0))
%47 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.46, i64 0, i64 0))
%48 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.47, i64 0, i64 0))
%49 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.48, i64 0, i64 0))
%50 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.49, i64 0, i64 0))
%51 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.50, i64 0, i64 0))
%52 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.51, i64 0, i64 0))
%53 = call i32 @exit(i32 0)
unreachable
}

LLVM IR (-O2):
@str = [29 x i8] c"Usage: nnbathy -i <XYZ file>\00"
@str.52 = [63 x i8] c" -o <XY file> | -n <nx>x<ny> [-c|-s] [-z <zoom>]\00"
@str.53 = [62 x i8] c" [-x <xmin xmax>] [-xmin <xmin>] [-xmax <xmax>]\00"
@str.54 = [62 x i8] c" [-y <ymin ymax>] [-ymin <ymin>] [-ymax <ymax>]\00"
@str.55 = [38 x i8] c" [-v|-T <vertex id>|-V]\00"
@str.56 = [32 x i8] c" [-D [<nx>x<ny>]]\00"
@str.57 = [27 x i8] c" [-L <dist>]\00"
@str.58 = [20 x i8] c" [-N]\00"
@str.59 = [34 x i8] c" [-P alg={l|nn|ns}]\00"
@str.60 = [33 x i8] c" [-W <min weight>]\00"
@str.61 = [9 x i8] c"Options:\00"
@str.62 = [77 x i8] c" -c -- scale internally so that the enclosing minimal ellipse\00"
@str.63 = [78 x i8] c" turns into a circle (this produces results invariant to\00"
@str.64 = [46 x i8] c" affine transformations)\00"
@str.65 = [72 x i8] c" -i <XYZ file> -- three-column file with points to interpolate from\00"
@str.66 = [68 x i8] c" (use \22-i stdin\22 or \22-i -\22 for standard input)\00"
@str.67 = [65 x i8] c" -n <nx>x<ny> -- generate <nx>x<ny> output rectangular grid\00"
@str.68 = [68 x i8] c" -o <XY file> -- two-column file with points to interpolate in\00"
@str.69 = [68 x i8] c" (use \22-o stdin\22 or \22-o -\22 for standard input)\00"
@str.70 = [73 x i8] c" -s -- scale internally so that Xmax - Xmin = Ymax - Ymin\00"
@str.71 = [60 x i8] c" -x <xmin> <xmax> -- set Xmin and Xmax for the output grid\00"
@str.72 = [51 x i8] c" -xmin <xmin> -- set Xmin for the output grid\00"
@str.73 = [51 x i8] c" -xmax <xmax> -- set Xmin for the output grid\00"
@str.74 = [60 x i8] c" -y <ymin> <ymax> -- set Ymin and Ymax for the output grid\00"
@str.75 = [51 x i8] c" -ymin <ymin> -- set Ymin for the output grid\00"
@str.76 = [51 x i8] c" -ymax <ymax> -- set Ymin for the output grid\00"
@str.77 = [40 x i8] c" -v -- verbose / version\00"
@str.78 = [77 x i8] c" -z <zoom> -- zoom in (if <zoom> < 1) or out (<zoom> > 1) (activated\00"
@str.79 = [61 x i8] c" only when used in conjunction with -n)\00"
@str.80 = [76 x i8] c" -D [<nx>x<ny>] -- thin input data by averaging X, Y and Z values within\00"
@str.81 = [73 x i8] c" every cell of the rectangular <nx>x<ny> grid (size\00"
@str.82 = [40 x i8] c" optional with -n)\00"
@str.83 = [76 x i8] c" -L <dist> -- thin input data by averaging X, Y and Z values within\00"
@str.84 = [74 x i8] c" clusters of consequitive input points such that the\00"
@str.85 = [74 x i8] c" sum of distances between points within each cluster\00"
@str.86 = [66 x i8] c" does not exceed the specified maximum value\00"
@str.87 = [59 x i8] c" -N -- do not interpolate, only pre-process\00"
@str.88 = [51 x i8] c" -P alg=<l|nn|ns> -- use the following algorithm:\00"
@str.89 = [50 x i8] c" l -- linear interpolation\00"
@str.90 = [61 x i8] c" nn -- Sibson interpolation (default)\00"
@str.91 = [58 x i8] c" ns -- Non-Sibsonian interpolation\00"
@str.92 = [74 x i8] c" -T <vertex id> -- verbose; in weights output print weights associated\00"
@str.93 = [44 x i8] c" with this vertex only\00"
@str.94 = [45 x i8] c" -V -- very verbose / version\00"
@str.95 = [75 x i8] c" -W <min weight> -- restricts extrapolation by assigning minimal allowed\00"
@str.96 = [70 x i8] c" weight for a vertex (normally \22-1\22 or so; lower\00"
@str.97 = [72 x i8] c" values correspond to lower reliability; \220\22 means\00"
@str.98 = [40 x i8] c" no extrapolation)\00"
@str.99 = [13 x i8] c"Description:\00"
@str.100 = [74 x i8] c" `nnbathy' interpolates scalar 2D data in specified points using Natural\00"
@str.101 = [76 x i8] c" Neighbours interpolation. The interpolated values are written to standard\00"
@str.102 = [10 x i8] c" output.\00"
define void @usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.52, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.53, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.54, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.55, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.56, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.57, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str.58, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.59, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.60, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.61, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.62, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.63, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.64, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.65, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.66, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.67, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.68, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.69, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.70, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.71, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.72, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.73, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.74, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.75, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.76, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.77, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.78, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.79, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.80, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.81, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.82, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.83, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.84, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.85, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.86, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.87, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.88, i64 0, i64 0))
%39 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.89, i64 0, i64 0))
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.90, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.91, i64 0, i64 0))
%42 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.92, i64 0, i64 0))
%43 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.93, i64 0, i64 0))
%44 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.94, i64 0, i64 0))
%45 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.95, i64 0, i64 0))
%46 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.96, i64 0, i64 0))
%47 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.97, i64 0, i64 0))
%48 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.98, i64 0, i64 0))
%49 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.99, i64 0, i64 0))
%50 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.100, i64 0, i64 0))
%51 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.101, i64 0, i64 0))
%52 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.102, i64 0, i64 0))
%53 = tail call i32 @exit(i32 0)
unreachable
}