#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 EXIT_SUCCESS;
int /*<<< orphan*/ basic_sort();
int /*<<< orphan*/ binary_search();
int /*<<< orphan*/ binary_search2();
int /*<<< orphan*/ boyer_moore_match();
int /*<<< orphan*/ bubble_sort();
int /*<<< orphan*/ direct_sort();
int /*<<< orphan*/ hash_main();
int /*<<< orphan*/ hash_main2();
int /*<<< orphan*/ mod_shell_sort();
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ replace_main();
int /*<<< orphan*/ replace_main2();
int /*<<< orphan*/ sequential_search();
int /*<<< orphan*/ shaker_sort();
int /*<<< orphan*/ shell_sort();
int /*<<< orphan*/ simple_merge();
int /*<<< orphan*/ simple_merge_sentinel();
int /*<<< orphan*/ sort_pointer();
int /*<<< orphan*/ string_match();
int main(void) {
  direct_sort();
  bubble_sort();
  shaker_sort();
  sort_pointer();
  basic_sort();
  shell_sort();
  mod_shell_sort();
  sequential_search();
  binary_search();
  binary_search2();
  simple_merge();
  simple_merge_sentinel();
  string_match();
  boyer_moore_match();
  replace_main();
  replace_main2();
  hash_main();
  hash_main2();
  printf("end");
  return EXIT_SUCCESS;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0x0,%al
call   1120 <direct_sort@plt>
mov    $0x0,%al
call   1150 <bubble_sort@plt>
mov    $0x0,%al
call   1040 <shaker_sort@plt>
mov    $0x0,%al
call   1090 <sort_pointer@plt>
mov    $0x0,%al
call   1080 <basic_sort@plt>
mov    $0x0,%al
call   10f0 <shell_sort@plt>
mov    $0x0,%al
call   1070 <mod_shell_sort@plt>
mov    $0x0,%al
call   10e0 <sequential_search@plt>
mov    $0x0,%al
call   10d0 <binary_search@plt>
mov    $0x0,%al
call   10c0 <binary_search2@plt>
mov    $0x0,%al
call   1110 <simple_merge@plt>
mov    $0x0,%al
call   1140 <simple_merge_sentinel@plt>
mov    $0x0,%al
call   1130 <string_match@plt>
mov    $0x0,%al
call   1050 <boyer_moore_match@plt>
mov    $0x0,%al
call   10b0 <replace_main@plt>
mov    $0x0,%al
call   1030 <replace_main2@plt>
mov    $0x0,%al
call   10a0 <hash_main@plt>
mov    $0x0,%al
call   1100 <hash_main2@plt>
lea    0xd3c(%rip),%rdi
call   1060 <printf@plt>
mov    0x2d10(%rip),%rax
mov    (%rax),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
xor    %eax,%eax
call   1120 <direct_sort@plt>
xor    %eax,%eax
call   1150 <bubble_sort@plt>
xor    %eax,%eax
call   1040 <shaker_sort@plt>
xor    %eax,%eax
call   1090 <sort_pointer@plt>
xor    %eax,%eax
call   1080 <basic_sort@plt>
xor    %eax,%eax
call   10f0 <shell_sort@plt>
xor    %eax,%eax
call   1070 <mod_shell_sort@plt>
xor    %eax,%eax
call   10e0 <sequential_search@plt>
xor    %eax,%eax
call   10d0 <binary_search@plt>
xor    %eax,%eax
call   10c0 <binary_search2@plt>
xor    %eax,%eax
call   1110 <simple_merge@plt>
xor    %eax,%eax
call   1140 <simple_merge_sentinel@plt>
xor    %eax,%eax
call   1130 <string_match@plt>
xor    %eax,%eax
call   1050 <boyer_moore_match@plt>
xor    %eax,%eax
call   10b0 <replace_main@plt>
xor    %eax,%eax
call   1030 <replace_main2@plt>
xor    %eax,%eax
call   10a0 <hash_main@plt>
xor    %eax,%eax
call   1100 <hash_main2@plt>
lea    0xd4a(%rip),%rdi
call   1060 <printf@plt>
mov    0x2d1e(%rip),%rax
mov    (%rax),%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [4 x i8] c"end\00"
@EXIT_SUCCESS = global i32 0
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 (...) @direct_sort()
%3 = call i32 (...) @bubble_sort()
%4 = call i32 (...) @shaker_sort()
%5 = call i32 (...) @sort_pointer()
%6 = call i32 (...) @basic_sort()
%7 = call i32 (...) @shell_sort()
%8 = call i32 (...) @mod_shell_sort()
%9 = call i32 (...) @sequential_search()
%10 = call i32 (...) @binary_search()
%11 = call i32 (...) @binary_search2()
%12 = call i32 (...) @simple_merge()
%13 = call i32 (...) @simple_merge_sentinel()
%14 = call i32 (...) @string_match()
%15 = call i32 (...) @boyer_moore_match()
%16 = call i32 (...) @replace_main()
%17 = call i32 (...) @replace_main2()
%18 = call i32 (...) @hash_main()
%19 = call i32 (...) @hash_main2()
%20 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0))
%21 = load i32, i32* @EXIT_SUCCESS
ret i32 %21
}

LLVM IR (-O2):
@.str = [4 x i8] c"end\00"
@EXIT_SUCCESS = global i32 0
define i32 @main() {
%1 = tail call i32 (...) @direct_sort()
%2 = tail call i32 (...) @bubble_sort()
%3 = tail call i32 (...) @shaker_sort()
%4 = tail call i32 (...) @sort_pointer()
%5 = tail call i32 (...) @basic_sort()
%6 = tail call i32 (...) @shell_sort()
%7 = tail call i32 (...) @mod_shell_sort()
%8 = tail call i32 (...) @sequential_search()
%9 = tail call i32 (...) @binary_search()
%10 = tail call i32 (...) @binary_search2()
%11 = tail call i32 (...) @simple_merge()
%12 = tail call i32 (...) @simple_merge_sentinel()
%13 = tail call i32 (...) @string_match()
%14 = tail call i32 (...) @boyer_moore_match()
%15 = tail call i32 (...) @replace_main()
%16 = tail call i32 (...) @replace_main2()
%17 = tail call i32 (...) @hash_main()
%18 = tail call i32 (...) @hash_main2()
%19 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0))
%20 = load i32, i32* @EXIT_SUCCESS
ret i32 %20
}