#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 usage_en_simplify(void) {
  printf("Route file simplification\n");
  printf("-------------------------\n");
  printf("sort [FILE]           : sort FILE by prefix\n");
  printf("sortby name [FILE]    : sort FILE by (prefix|gw|mask), prefix is a "
         "tie-breaker\n");
  printf("sortby help	      : print available sort options\n");
  printf("subnetagg [FILE]      : sort and aggregate subnets in FILE; GW is "
         "not checked\n");
  printf("routeagg  [FILE]      : sort and aggregate subnets in FILE; GW is "
         "checked\n");
  printf("routesimplify1 [FILE] : simplify CSV subnet file duplicate or "
         "included networks are removed;\n");
  printf("routesimplify2 [FILE] : simplify CSV subnet file; prints redundant "
         "routes that can be removed\n");
}


x86 assembly (clang, -O0):
<usage_en_simplify>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xef4(%rip),%rdi
call   1030 <printf@plt>
lea    0xf03(%rip),%rdi
call   1030 <printf@plt>
lea    0xf24(%rip),%rdi
call   1030 <printf@plt>
lea    0xf68(%rip),%rdi
call   1030 <printf@plt>
lea    0xf8e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfd1(%rip),%rdi
call   1030 <printf@plt>
lea    0x1010(%rip),%rdi
call   1030 <printf@plt>
lea    0x1062(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<usage_en_simplify>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xef6(%rip),%rdi
call   1030 <puts@plt>
lea    0xf04(%rip),%rdi
call   1030 <puts@plt>
lea    0xf24(%rip),%rdi
call   1030 <puts@plt>
lea    0xf67(%rip),%rdi
call   1030 <puts@plt>
lea    0xf8c(%rip),%rdi
call   1030 <puts@plt>
lea    0xfce(%rip),%rdi
call   1030 <puts@plt>
lea    0x100c(%rip),%rdi
call   1030 <puts@plt>
lea    0x105d(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [27 x i8] c"Route file simplification\0A\00"
@.str.1 = [27 x i8] c"-------------------------\0A\00"
@.str.2 = [45 x i8] c"sort [FILE] : sort FILE by prefix\0A\00"
@.str.3 = [80 x i8] c"sortby name [FILE] : sort FILE by (prefix|gw|mask), prefix is a tie-breaker\0A\00"
@.str.4 = [50 x i8] c"sortby help\09 : print available sort options\0A\00"
@.str.5 = [79 x i8] c"subnetagg [FILE] : sort and aggregate subnets in FILE; GW is not checked\0A\00"
@.str.6 = [75 x i8] c"routeagg [FILE] : sort and aggregate subnets in FILE; GW is checked\0A\00"
@.str.7 = [94 x i8] c"routesimplify1 [FILE] : simplify CSV subnet file duplicate or included networks are removed;\0A\00"
@.str.8 = [95 x i8] c"routesimplify2 [FILE] : simplify CSV subnet file; prints redundant routes that can be removed\0A\00"
define void @usage_en_simplify() {
%1 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([94 x i8], [94 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([95 x i8], [95 x i8]* @.str.8, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [26 x i8] c"Route file simplification\00"
@str.9 = [26 x i8] c"-------------------------\00"
@str.10 = [44 x i8] c"sort [FILE] : sort FILE by prefix\00"
@str.11 = [79 x i8] c"sortby name [FILE] : sort FILE by (prefix|gw|mask), prefix is a tie-breaker\00"
@str.12 = [49 x i8] c"sortby help\09 : print available sort options\00"
@str.13 = [78 x i8] c"subnetagg [FILE] : sort and aggregate subnets in FILE; GW is not checked\00"
@str.14 = [74 x i8] c"routeagg [FILE] : sort and aggregate subnets in FILE; GW is checked\00"
@str.15 = [93 x i8] c"routesimplify1 [FILE] : simplify CSV subnet file duplicate or included networks are removed;\00"
@str.16 = [94 x i8] c"routesimplify2 [FILE] : simplify CSV subnet file; prints redundant routes that can be removed\00"
define void @usage_en_simplify() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.9, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.10, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.11, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.12, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.13, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.14, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([93 x i8], [93 x i8]* @str.15, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([94 x i8], [94 x i8]* @str.16, i64 0, i64 0))
ret void
}