#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 *);
void help() {
  printf("semver-c "
         "0.0.0"
         "\n");
  printf("\n");
  printf("A C implementation of the http://semver.org/ specification\n");
  printf("Copyright Conrad Pankoff <deoxxa@fknsrs.biz>\n");
  printf("\n");
  printf("This is a very rough clone of node-semver - please see\n");
  printf("https://github.com/isaacs/node-semver for what that is.\n");
  printf("\n");
  printf("Usage: semver-c [options] <version> [<version> [...]]\n");
  printf("Prints valid versions sorted by SemVer precedence\n");
  printf("\n");
  printf("Options:\n");
  printf("-v\n");
  printf("\tPrints out the version number.\n");
  printf("\n");
  printf("-h\n");
  printf("\tThis is the help. You're looking at it.\n");
  printf("\n");
  printf("-r <range>\n");
  printf("\tPrint versions that match the specified range.\n");
  printf("\n");
  printf("-R\n");
  printf("\tPrint versions in reverse order.\n");
  printf("\n");
  printf("Program exits successfully if any valid version satisfies all\n");
  printf("supplied ranges, and prints all satisfying versions.\n");
  printf("\n");
  printf("If no satisfying versions are found, then exits failure.\n");
  printf("\n");
  printf("Versions are printed in order, so supplying multiple versions\n");
  printf("to the utility will just sort them.\n");
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c6(%rip),%rdi
call   1030 <printf@plt>
lea    0xedd(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10a2(%rip),%rdi
call   1030 <printf@plt>
lea    0xf23(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4f(%rip),%rdi
call   1030 <printf@plt>
lea    0x107e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf70(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9b(%rip),%rdi
call   1030 <printf@plt>
lea    0x105a(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb6(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb4(%rip),%rdi
call   1030 <printf@plt>
lea    0xfac(%rip),%rdi
call   1030 <printf@plt>
lea    0x102a(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb5(%rip),%rdi
call   1030 <printf@plt>
lea    0xfad(%rip),%rdi
call   1030 <printf@plt>
lea    0x1006(%rip),%rdi
call   1030 <printf@plt>
lea    0xfbf(%rip),%rdi
call   1030 <printf@plt>
lea    0xfbf(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe2(%rip),%rdi
call   1030 <printf@plt>
lea    0xfd8(%rip),%rdi
call   1030 <printf@plt>
lea    0xfd0(%rip),%rdi
call   1030 <printf@plt>
lea    0xfbe(%rip),%rdi
call   1030 <printf@plt>
lea    0xfdb(%rip),%rdi
call   1030 <printf@plt>
lea    0x100e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9a(%rip),%rdi
call   1030 <printf@plt>
lea    0x102c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf82(%rip),%rdi
call   1030 <printf@plt>
lea    0x104e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1081(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<help>:
push   %rax
lea    0xed8(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xed1(%rip),%rdi
call   1040 <puts@plt>
lea    0xf00(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xf17(%rip),%rdi
call   1040 <puts@plt>
lea    0xf42(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xf64(%rip),%rdi
call   1040 <puts@plt>
lea    0xf8e(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfaa(%rip),%rdi
call   1040 <puts@plt>
lea    0xfa7(%rip),%rdi
call   1040 <puts@plt>
lea    0xf9e(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfa8(%rip),%rdi
call   1040 <puts@plt>
lea    0xf9f(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfb2(%rip),%rdi
call   1040 <puts@plt>
lea    0xfb1(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfcb(%rip),%rdi
call   1040 <puts@plt>
lea    0xfc2(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfce(%rip),%rdi
call   1040 <puts@plt>
lea    0x1000(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x101f(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1042(%rip),%rdi
call   1040 <puts@plt>
lea    0x1074(%rip),%rdi
pop    %rax
jmp    1040 <puts@plt>

LLVM IR (-O0):
@.str = [16 x i8] c"semver-c 0.0.0\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [60 x i8] c"A C implementation of the http://semver.org/ specification\0A\00"
@.str.3 = [46 x i8] c"Copyright Conrad Pankoff <deoxxa@fknsrs.biz>\0A\00"
@.str.4 = [56 x i8] c"This is a very rough clone of node-semver - please see\0A\00"
@.str.5 = [57 x i8] c"https://github.com/isaacs/node-semver for what that is.\0A\00"
@.str.6 = [55 x i8] c"Usage: semver-c [options] <version> [<version> [...]]\0A\00"
@.str.7 = [51 x i8] c"Prints valid versions sorted by SemVer precedence\0A\00"
@.str.8 = [10 x i8] c"Options:\0A\00"
@.str.9 = [4 x i8] c"-v\0A\00"
@.str.10 = [33 x i8] c"\09Prints out the version number.\0A\00"
@.str.11 = [4 x i8] c"-h\0A\00"
@.str.12 = [42 x i8] c"\09This is the help. You're looking at it.\0A\00"
@.str.13 = [12 x i8] c"-r <range>\0A\00"
@.str.14 = [49 x i8] c"\09Print versions that match the specified range.\0A\00"
@.str.15 = [4 x i8] c"-R\0A\00"
@.str.16 = [35 x i8] c"\09Print versions in reverse order.\0A\00"
@.str.17 = [63 x i8] c"Program exits successfully if any valid version satisfies all\0A\00"
@.str.18 = [54 x i8] c"supplied ranges, and prints all satisfying versions.\0A\00"
@.str.19 = [58 x i8] c"If no satisfying versions are found, then exits failure.\0A\00"
@.str.20 = [63 x i8] c"Versions are printed in order, so supplying multiple versions\0A\00"
@.str.21 = [37 x i8] c"to the utility will just sort them.\0A\00"
define void @help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.4, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.5, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.6, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.7, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.8, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.9, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.10, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.11, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.12, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.13, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.14, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.15, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.16, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.17, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.18, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.19, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.20, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.21, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [15 x i8] c"semver-c 0.0.0\00"
@str.22 = [59 x i8] c"A C implementation of the http://semver.org/ specification\00"
@str.23 = [45 x i8] c"Copyright Conrad Pankoff <deoxxa@fknsrs.biz>\00"
@str.24 = [55 x i8] c"This is a very rough clone of node-semver - please see\00"
@str.25 = [56 x i8] c"https://github.com/isaacs/node-semver for what that is.\00"
@str.26 = [54 x i8] c"Usage: semver-c [options] <version> [<version> [...]]\00"
@str.27 = [50 x i8] c"Prints valid versions sorted by SemVer precedence\00"
@str.28 = [9 x i8] c"Options:\00"
@str.29 = [3 x i8] c"-v\00"
@str.30 = [32 x i8] c"\09Prints out the version number.\00"
@str.31 = [3 x i8] c"-h\00"
@str.32 = [41 x i8] c"\09This is the help. You're looking at it.\00"
@str.33 = [11 x i8] c"-r <range>\00"
@str.34 = [48 x i8] c"\09Print versions that match the specified range.\00"
@str.35 = [3 x i8] c"-R\00"
@str.36 = [34 x i8] c"\09Print versions in reverse order.\00"
@str.37 = [62 x i8] c"Program exits successfully if any valid version satisfies all\00"
@str.38 = [53 x i8] c"supplied ranges, and prints all satisfying versions.\00"
@str.39 = [57 x i8] c"If no satisfying versions are found, then exits failure.\00"
@str.40 = [62 x i8] c"Versions are printed in order, so supplying multiple versions\00"
@str.41 = [36 x i8] c"to the utility will just sort them.\00"
define void @help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @putchar(i32 10)
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.22, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.23, i64 0, i64 0))
%5 = tail call i32 @putchar(i32 10)
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.24, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([56 x i8], [56 x i8]* @str.25, i64 0, i64 0))
%8 = tail call i32 @putchar(i32 10)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.26, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.27, i64 0, i64 0))
%11 = tail call i32 @putchar(i32 10)
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.28, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([3 x i8], [3 x i8]* @str.29, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.30, i64 0, i64 0))
%15 = tail call i32 @putchar(i32 10)
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([3 x i8], [3 x i8]* @str.31, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.32, i64 0, i64 0))
%18 = tail call i32 @putchar(i32 10)
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.33, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.34, i64 0, i64 0))
%21 = tail call i32 @putchar(i32 10)
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([3 x i8], [3 x i8]* @str.35, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.36, i64 0, i64 0))
%24 = tail call i32 @putchar(i32 10)
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.37, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.38, i64 0, i64 0))
%27 = tail call i32 @putchar(i32 10)
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.39, i64 0, i64 0))
%29 = tail call i32 @putchar(i32 10)
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.40, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.41, i64 0, i64 0))
ret void
}