#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("\nUsage:\n");
  printf("------\n");
  printf("lexperm N -- N is the order of the permutation. Generates all the "
         "permutations of the given order.\n");
  printf("lexperm PERMUTATION -- PERMUTATION is a permutation of n order with "
         "its digits space separated. Generates the next lexicographic "
         "permutation.\n\n");
  printf("Examples:\n");
  printf("---------\n");
  printf(
      "lexperm 4 -- Generates all the permutations of order 4 in lexicographic "
      "order. The number of the permutations is n! so beware of the N.\n");
  printf("lexperm 2 4 1 3 -- Generates the next permutation in lexicographic "
         "order.\n\n");
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe4(%rip),%rdi
call   1030 <printf@plt>
lea    0xed6(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb2(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb1(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb0(%rip),%rdi
call   1030 <printf@plt>
lea    0x102d(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<help>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe3(%rip),%rdi
call   1030 <puts@plt>
lea    0xed8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf2f(%rip),%rdi
call   1030 <puts@plt>
lea    0xfb2(%rip),%rdi
call   1030 <puts@plt>
lea    0xfb0(%rip),%rdi
call   1030 <puts@plt>
lea    0xfae(%rip),%rdi
call   1030 <puts@plt>
lea    0x102a(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [9 x i8] c"\0AUsage:\0A\00"
@.str.1 = [8 x i8] c"------\0A\00"
@.str.2 = [100 x i8] c"lexperm N -- N is the order of the permutation. Generates all the permutations of the given order.\0A\00"
@.str.3 = [144 x i8] c"lexperm PERMUTATION -- PERMUTATION is a permutation of n order with its digits space separated. Generates the next lexicographic permutation.\0A\0A\00"
@.str.4 = [11 x i8] c"Examples:\0A\00"
@.str.5 = [11 x i8] c"---------\0A\00"
@.str.6 = [137 x i8] c"lexperm 4 -- Generates all the permutations of order 4 in lexicographic order. The number of the permutations is n! so beware of the N.\0A\00"
@.str.7 = [76 x i8] c"lexperm 2 4 1 3 -- Generates the next permutation in lexicographic order.\0A\0A\00"
define void @help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([100 x i8], [100 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([144 x i8], [144 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([137 x i8], [137 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.7, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [8 x i8] c"\0AUsage:\00"
@str.8 = [7 x i8] c"------\00"
@str.9 = [99 x i8] c"lexperm N -- N is the order of the permutation. Generates all the permutations of the given order.\00"
@str.10 = [143 x i8] c"lexperm PERMUTATION -- PERMUTATION is a permutation of n order with its digits space separated. Generates the next lexicographic permutation.\0A\00"
@str.11 = [10 x i8] c"Examples:\00"
@str.12 = [10 x i8] c"---------\00"
@str.13 = [136 x i8] c"lexperm 4 -- Generates all the permutations of order 4 in lexicographic order. The number of the permutations is n! so beware of the N.\00"
@str.14 = [75 x i8] c"lexperm 2 4 1 3 -- Generates the next permutation in lexicographic order.\0A\00"
define void @help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @str.8, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([99 x i8], [99 x i8]* @str.9, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([143 x i8], [143 x i8]* @str.10, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.11, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.12, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([136 x i8], [136 x i8]* @str.13, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.14, i64 0, i64 0))
ret void
}