#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ triexit(int /*<<< orphan*/);
void syntax() {
  printf("triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__iFlsCQVh] input_file\n");
  printf("    -p  Triangulates a Planar Straight Line Graph (.poly file).\n");
  printf("    -r  Refines a previously generated mesh.\n");
  printf(
      "    -q  Quality mesh generation.  A minimum angle may be specified.\n");
  printf("    -a  Applies a maximum triangle area constraint.\n");
  printf("    -u  Applies a user-defined triangle constraint.\n");
  printf(
      "    -A  Applies attributes to identify triangles in certain regions.\n");
  printf("    -c  Encloses the convex hull with segments.\n");
  printf("    -D  Conforming Delaunay:  all triangles are truly Delaunay.\n");
  printf("    -j  Jettison unused vertices from output .node file.\n");
  printf("    -e  Generates an edge list.\n");
  printf("    -v  Generates a Voronoi diagram.\n");
  printf("    -n  Generates a list of triangle neighbors.\n");
  printf("    -g  Generates an .off file for Geomview.\n");
  printf("    -B  Suppresses output of boundary information.\n");
  printf("    -P  Suppresses output of .poly file.\n");
  printf("    -N  Suppresses output of .node file.\n");
  printf("    -E  Suppresses output of .ele file.\n");
  printf("    -I  Suppresses mesh iteration numbers.\n");
  printf("    -O  Ignores holes in .poly file.\n");
  printf("    -X  Suppresses use of exact arithmetic.\n");
  printf("    -z  Numbers all items starting from zero (rather than one).\n");
  printf("    -o2 Generates second-order subparametric elements.\n");
  printf("    -Y  Suppresses boundary segment splitting.\n");
  printf("    -S  Specifies maximum number of added Steiner points.\n");
  printf("    -i  Uses incremental method, rather than divide-and-conquer.\n");
  printf("    -F  Uses Fortune's sweepline algorithm, rather than d-and-c.\n");
  printf("    -l  Uses vertical cuts only, rather than alternating cuts.\n");
  printf("    -s  Force segments into mesh by splitting (instead of using "
         "CDT).\n");
  printf("    -C  Check consistency of final mesh.\n");
  printf("    -Q  Quiet:  No terminal output except errors.\n");
  printf("    -V  Verbose:  Detailed information on what I'm doing.\n");
  printf("    -h  Help:  Detailed instructions for Triangle.\n");
  triexit(0);
}


x86 assembly (clang, -O0):
<syntax>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
call   1040 <printf@plt>
lea    0xf09(%rip),%rdi
call   1040 <printf@plt>
lea    0xf3e(%rip),%rdi
call   1040 <printf@plt>
lea    0xf60(%rip),%rdi
call   1040 <printf@plt>
lea    0xf99(%rip),%rdi
call   1040 <printf@plt>
lea    0xfc2(%rip),%rdi
call   1040 <printf@plt>
lea    0xfeb(%rip),%rdi
call   1040 <printf@plt>
lea    0x1025(%rip),%rdi
call   1040 <printf@plt>
lea    0x104a(%rip),%rdi
call   1040 <printf@plt>
lea    0x107f(%rip),%rdi
call   1040 <printf@plt>
lea    0x10ad(%rip),%rdi
call   1040 <printf@plt>
lea    0x10c2(%rip),%rdi
call   1040 <printf@plt>
lea    0x10dc(%rip),%rdi
call   1040 <printf@plt>
lea    0x1101(%rip),%rdi
call   1040 <printf@plt>
lea    0x1123(%rip),%rdi
call   1040 <printf@plt>
lea    0x114b(%rip),%rdi
call   1040 <printf@plt>
lea    0x1169(%rip),%rdi
call   1040 <printf@plt>
lea    0x1187(%rip),%rdi
call   1040 <printf@plt>
lea    0x11a4(%rip),%rdi
call   1040 <printf@plt>
lea    0x11c4(%rip),%rdi
call   1040 <printf@plt>
lea    0x11de(%rip),%rdi
call   1040 <printf@plt>
lea    0x11ff(%rip),%rdi
call   1040 <printf@plt>
lea    0x1234(%rip),%rdi
call   1040 <printf@plt>
lea    0x1260(%rip),%rdi
call   1040 <printf@plt>
lea    0x1284(%rip),%rdi
call   1040 <printf@plt>
lea    0x12b3(%rip),%rdi
call   1040 <printf@plt>
lea    0x12e9(%rip),%rdi
call   1040 <printf@plt>
lea    0x131f(%rip),%rdi
call   1040 <printf@plt>
lea    0x1353(%rip),%rdi
call   1040 <printf@plt>
lea    0x138e(%rip),%rdi
call   1040 <printf@plt>
lea    0x13ac(%rip),%rdi
call   1040 <printf@plt>
lea    0x13d3(%rip),%rdi
call   1040 <printf@plt>
lea    0x1402(%rip),%rdi
call   1040 <printf@plt>
xor    %edi,%edi
call   1030 <triexit@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<syntax>:
push   %rax
lea    0xed8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf0b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3f(%rip),%rdi
call   1030 <puts@plt>
lea    0xf60(%rip),%rdi
call   1030 <puts@plt>
lea    0xf98(%rip),%rdi
call   1030 <puts@plt>
lea    0xfc0(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe8(%rip),%rdi
call   1030 <puts@plt>
lea    0x1021(%rip),%rdi
call   1030 <puts@plt>
lea    0x1045(%rip),%rdi
call   1030 <puts@plt>
lea    0x1079(%rip),%rdi
call   1030 <puts@plt>
lea    0x10a6(%rip),%rdi
call   1030 <puts@plt>
lea    0x10ba(%rip),%rdi
call   1030 <puts@plt>
lea    0x10d3(%rip),%rdi
call   1030 <puts@plt>
lea    0x10f7(%rip),%rdi
call   1030 <puts@plt>
lea    0x1118(%rip),%rdi
call   1030 <puts@plt>
lea    0x113f(%rip),%rdi
call   1030 <puts@plt>
lea    0x115c(%rip),%rdi
call   1030 <puts@plt>
lea    0x1179(%rip),%rdi
call   1030 <puts@plt>
lea    0x1195(%rip),%rdi
call   1030 <puts@plt>
lea    0x11b4(%rip),%rdi
call   1030 <puts@plt>
lea    0x11cd(%rip),%rdi
call   1030 <puts@plt>
lea    0x11ed(%rip),%rdi
call   1030 <puts@plt>
lea    0x1221(%rip),%rdi
call   1030 <puts@plt>
lea    0x124c(%rip),%rdi
call   1030 <puts@plt>
lea    0x126f(%rip),%rdi
call   1030 <puts@plt>
lea    0x129d(%rip),%rdi
call   1030 <puts@plt>
lea    0x12d2(%rip),%rdi
call   1030 <puts@plt>
lea    0x1307(%rip),%rdi
call   1030 <puts@plt>
lea    0x133a(%rip),%rdi
call   1030 <puts@plt>
lea    0x1374(%rip),%rdi
call   1030 <puts@plt>
lea    0x1391(%rip),%rdi
call   1030 <puts@plt>
lea    0x13b7(%rip),%rdi
call   1030 <puts@plt>
lea    0x13e5(%rip),%rdi
call   1030 <puts@plt>
xor    %edi,%edi
pop    %rax
jmp    1040 <triexit@plt>

LLVM IR (-O0):
@.str = [64 x i8] c"triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__iFlsCQVh] input_file\0A\00"
@.str.1 = [65 x i8] c" -p Triangulates a Planar Straight Line Graph (.poly file).\0A\00"
@.str.2 = [46 x i8] c" -r Refines a previously generated mesh.\0A\00"
@.str.3 = [69 x i8] c" -q Quality mesh generation. A minimum angle may be specified.\0A\00"
@.str.4 = [53 x i8] c" -a Applies a maximum triangle area constraint.\0A\00"
@.str.5 = [53 x i8] c" -u Applies a user-defined triangle constraint.\0A\00"
@.str.6 = [70 x i8] c" -A Applies attributes to identify triangles in certain regions.\0A\00"
@.str.7 = [49 x i8] c" -c Encloses the convex hull with segments.\0A\00"
@.str.8 = [65 x i8] c" -D Conforming Delaunay: all triangles are truly Delaunay.\0A\00"
@.str.9 = [58 x i8] c" -j Jettison unused vertices from output .node file.\0A\00"
@.str.10 = [33 x i8] c" -e Generates an edge list.\0A\00"
@.str.11 = [38 x i8] c" -v Generates a Voronoi diagram.\0A\00"
@.str.12 = [49 x i8] c" -n Generates a list of triangle neighbors.\0A\00"
@.str.13 = [46 x i8] c" -g Generates an .off file for Geomview.\0A\00"
@.str.14 = [52 x i8] c" -B Suppresses output of boundary information.\0A\00"
@.str.15 = [42 x i8] c" -P Suppresses output of .poly file.\0A\00"
@.str.16 = [42 x i8] c" -N Suppresses output of .node file.\0A\00"
@.str.17 = [41 x i8] c" -E Suppresses output of .ele file.\0A\00"
@.str.18 = [44 x i8] c" -I Suppresses mesh iteration numbers.\0A\00"
@.str.19 = [38 x i8] c" -O Ignores holes in .poly file.\0A\00"
@.str.20 = [45 x i8] c" -X Suppresses use of exact arithmetic.\0A\00"
@.str.21 = [65 x i8] c" -z Numbers all items starting from zero (rather than one).\0A\00"
@.str.22 = [56 x i8] c" -o2 Generates second-order subparametric elements.\0A\00"
@.str.23 = [48 x i8] c" -Y Suppresses boundary segment splitting.\0A\00"
@.str.24 = [59 x i8] c" -S Specifies maximum number of added Steiner points.\0A\00"
@.str.25 = [66 x i8] c" -i Uses incremental method, rather than divide-and-conquer.\0A\00"
@.str.26 = [66 x i8] c" -F Uses Fortune's sweepline algorithm, rather than d-and-c.\0A\00"
@.str.27 = [64 x i8] c" -l Uses vertical cuts only, rather than alternating cuts.\0A\00"
@.str.28 = [71 x i8] c" -s Force segments into mesh by splitting (instead of using CDT).\0A\00"
@.str.29 = [42 x i8] c" -C Check consistency of final mesh.\0A\00"
@.str.30 = [51 x i8] c" -Q Quiet: No terminal output except errors.\0A\00"
@.str.31 = [59 x i8] c" -V Verbose: Detailed information on what I'm doing.\0A\00"
@.str.32 = [52 x i8] c" -h Help: Detailed instructions for Triangle.\0A\00"
define void @syntax() {
%1 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.19, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.20, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.21, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.22, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.23, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.24, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.25, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.26, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.27, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.28, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.29, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.30, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.31, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.32, i64 0, i64 0))
%34 = call i32 @triexit(i32 0)
ret void
}

LLVM IR (-O2):
@str = [63 x i8] c"triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__iFlsCQVh] input_file\00"
@str.33 = [64 x i8] c" -p Triangulates a Planar Straight Line Graph (.poly file).\00"
@str.34 = [45 x i8] c" -r Refines a previously generated mesh.\00"
@str.35 = [68 x i8] c" -q Quality mesh generation. A minimum angle may be specified.\00"
@str.36 = [52 x i8] c" -a Applies a maximum triangle area constraint.\00"
@str.37 = [52 x i8] c" -u Applies a user-defined triangle constraint.\00"
@str.38 = [69 x i8] c" -A Applies attributes to identify triangles in certain regions.\00"
@str.39 = [48 x i8] c" -c Encloses the convex hull with segments.\00"
@str.40 = [64 x i8] c" -D Conforming Delaunay: all triangles are truly Delaunay.\00"
@str.41 = [57 x i8] c" -j Jettison unused vertices from output .node file.\00"
@str.42 = [32 x i8] c" -e Generates an edge list.\00"
@str.43 = [37 x i8] c" -v Generates a Voronoi diagram.\00"
@str.44 = [48 x i8] c" -n Generates a list of triangle neighbors.\00"
@str.45 = [45 x i8] c" -g Generates an .off file for Geomview.\00"
@str.46 = [51 x i8] c" -B Suppresses output of boundary information.\00"
@str.47 = [41 x i8] c" -P Suppresses output of .poly file.\00"
@str.48 = [41 x i8] c" -N Suppresses output of .node file.\00"
@str.49 = [40 x i8] c" -E Suppresses output of .ele file.\00"
@str.50 = [43 x i8] c" -I Suppresses mesh iteration numbers.\00"
@str.51 = [37 x i8] c" -O Ignores holes in .poly file.\00"
@str.52 = [44 x i8] c" -X Suppresses use of exact arithmetic.\00"
@str.53 = [64 x i8] c" -z Numbers all items starting from zero (rather than one).\00"
@str.54 = [55 x i8] c" -o2 Generates second-order subparametric elements.\00"
@str.55 = [47 x i8] c" -Y Suppresses boundary segment splitting.\00"
@str.56 = [58 x i8] c" -S Specifies maximum number of added Steiner points.\00"
@str.57 = [65 x i8] c" -i Uses incremental method, rather than divide-and-conquer.\00"
@str.58 = [65 x i8] c" -F Uses Fortune's sweepline algorithm, rather than d-and-c.\00"
@str.59 = [63 x i8] c" -l Uses vertical cuts only, rather than alternating cuts.\00"
@str.60 = [70 x i8] c" -s Force segments into mesh by splitting (instead of using CDT).\00"
@str.61 = [41 x i8] c" -C Check consistency of final mesh.\00"
@str.62 = [50 x i8] c" -Q Quiet: No terminal output except errors.\00"
@str.63 = [58 x i8] c" -V Verbose: Detailed information on what I'm doing.\00"
@str.64 = [51 x i8] c" -h Help: Detailed instructions for Triangle.\00"
define void @syntax() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.33, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.34, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.35, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.36, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.37, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.38, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.39, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.40, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.41, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.42, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.43, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.44, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.45, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.46, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.47, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.48, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.49, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.50, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.51, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.52, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.53, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.54, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.55, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.56, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.57, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.58, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.59, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.60, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.61, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.62, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.63, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.64, i64 0, i64 0))
%34 = tail call i32 @triexit(i32 0)
ret void
}