#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 print_usage() {
  printf("\n\n=============================\n");
  printf("Good time of day, dear user!\n");
  printf("This is qsort_my program. Using it you can sort arrays of strings in "
         "increase order without flags.\n");
  printf("Or in decrease order with -r flag.\n");
  printf("Also it's possible to disable case sensetivity with flag -f;\n");
  printf("Or set by -d the directory order option, which makes comparasion "
         "only on letters, numbers or blanks.\n");
  printf("Also you can set field-searching by setting fields by setting -1 +3, "
         "which makes field starts from first symbol and ends on third.\n");
  printf("Each field sorted according independent set of options;\n");
  printf("=============================\n\n");
}


x86 assembly (clang, -O0):
<print_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xefa(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf64(%rip),%rdi
call   1030 <printf@plt>
lea    0xf7c(%rip),%rdi
call   1030 <printf@plt>
lea    0xfae(%rip),%rdi
call   1030 <printf@plt>
lea    0x1008(%rip),%rdi
call   1030 <printf@plt>
lea    0x1080(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ad(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xefc(%rip),%rdi
call   1030 <puts@plt>
lea    0xf0d(%rip),%rdi
call   1030 <puts@plt>
lea    0xf64(%rip),%rdi
call   1030 <puts@plt>
lea    0xf7b(%rip),%rdi
call   1030 <puts@plt>
lea    0xfac(%rip),%rdi
call   1030 <puts@plt>
lea    0x1005(%rip),%rdi
call   1030 <puts@plt>
lea    0x107c(%rip),%rdi
call   1030 <puts@plt>
lea    0x10a8(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [33 x i8] c"\0A\0A=============================\0A\00"
@.str.1 = [30 x i8] c"Good time of day, dear user!\0A\00"
@.str.2 = [100 x i8] c"This is qsort_my program. Using it you can sort arrays of strings in increase order without flags.\0A\00"
@.str.3 = [36 x i8] c"Or in decrease order with -r flag.\0A\00"
@.str.4 = [62 x i8] c"Also it's possible to disable case sensetivity with flag -f;\0A\00"
@.str.5 = [102 x i8] c"Or set by -d the directory order option, which makes comparasion only on letters, numbers or blanks.\0A\00"
@.str.6 = [132 x i8] c"Also you can set field-searching by setting fields by setting -1 +3, which makes field starts from first symbol and ends on third.\0A\00"
@.str.7 = [57 x i8] c"Each field sorted according independent set of options;\0A\00"
@.str.8 = [32 x i8] c"=============================\0A\0A\00"
define void @print_usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([30 x i8], [30 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 ([36 x i8], [36 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([102 x i8], [102 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([132 x i8], [132 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.8, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [32 x i8] c"\0A\0A=============================\00"
@str.9 = [29 x i8] c"Good time of day, dear user!\00"
@str.10 = [99 x i8] c"This is qsort_my program. Using it you can sort arrays of strings in increase order without flags.\00"
@str.11 = [35 x i8] c"Or in decrease order with -r flag.\00"
@str.12 = [61 x i8] c"Also it's possible to disable case sensetivity with flag -f;\00"
@str.13 = [101 x i8] c"Or set by -d the directory order option, which makes comparasion only on letters, numbers or blanks.\00"
@str.14 = [131 x i8] c"Also you can set field-searching by setting fields by setting -1 +3, which makes field starts from first symbol and ends on third.\00"
@str.15 = [56 x i8] c"Each field sorted according independent set of options;\00"
@str.16 = [31 x i8] c"=============================\0A\00"
define void @print_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.9, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([99 x i8], [99 x i8]* @str.10, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.11, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.12, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([101 x i8], [101 x i8]* @str.13, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([131 x i8], [131 x i8]* @str.14, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([56 x i8], [56 x i8]* @str.15, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.16, i64 0, i64 0))
ret void
}