#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*/ bit();
int /*<<< orphan*/ cryptography();
int /*<<< orphan*/ histogram();
int /*<<< orphan*/ horner();
int /*<<< orphan*/ monte_carlo();
int /*<<< orphan*/ monte_carlo_ellipse();
int /*<<< orphan*/ order();
int /*<<< orphan*/ order_mod();
int /*<<< orphan*/ order_negative();
int /*<<< orphan*/ order_random();
int /*<<< orphan*/ order_random_mod();
int /*<<< orphan*/ pascal();
int /*<<< orphan*/ recurrence_relation();
int main(void) {
  recurrence_relation();
  horner();
  pascal();
  histogram();
  cryptography();
  bit();
  order();
  order_mod();
  order_negative();
  order_random();
  order_random_mod();
  monte_carlo();
  monte_carlo_ellipse();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0x0,%al
call   1070 <recurrence_relation@plt>
mov    $0x0,%al
call   10e0 <horner@plt>
mov    $0x0,%al
call   10d0 <pascal@plt>
mov    $0x0,%al
call   1050 <histogram@plt>
mov    $0x0,%al
call   10a0 <cryptography@plt>
mov    $0x0,%al
call   1060 <bit@plt>
mov    $0x0,%al
call   1080 <order@plt>
mov    $0x0,%al
call   10f0 <order_mod@plt>
mov    $0x0,%al
call   1040 <order_negative@plt>
mov    $0x0,%al
call   10c0 <order_random@plt>
mov    $0x0,%al
call   1030 <order_random_mod@plt>
mov    $0x0,%al
call   10b0 <monte_carlo@plt>
mov    $0x0,%al
call   1090 <monte_carlo_ellipse@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
xor    %eax,%eax
call   1070 <recurrence_relation@plt>
xor    %eax,%eax
call   10e0 <horner@plt>
xor    %eax,%eax
call   10d0 <pascal@plt>
xor    %eax,%eax
call   1050 <histogram@plt>
xor    %eax,%eax
call   10a0 <cryptography@plt>
xor    %eax,%eax
call   1060 <bit@plt>
xor    %eax,%eax
call   1080 <order@plt>
xor    %eax,%eax
call   10f0 <order_mod@plt>
xor    %eax,%eax
call   1040 <order_negative@plt>
xor    %eax,%eax
call   10c0 <order_random@plt>
xor    %eax,%eax
call   1030 <order_random_mod@plt>
xor    %eax,%eax
call   10b0 <monte_carlo@plt>
xor    %eax,%eax
call   1090 <monte_carlo_ellipse@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 (...) @recurrence_relation()
%3 = call i32 (...) @horner()
%4 = call i32 (...) @pascal()
%5 = call i32 (...) @histogram()
%6 = call i32 (...) @cryptography()
%7 = call i32 (...) @bit()
%8 = call i32 (...) @order()
%9 = call i32 (...) @order_mod()
%10 = call i32 (...) @order_negative()
%11 = call i32 (...) @order_random()
%12 = call i32 (...) @order_random_mod()
%13 = call i32 (...) @monte_carlo()
%14 = call i32 (...) @monte_carlo_ellipse()
ret i32 0
}

LLVM IR (-O2):
define i32 @main() {
%1 = tail call i32 (...) @recurrence_relation()
%2 = tail call i32 (...) @horner()
%3 = tail call i32 (...) @pascal()
%4 = tail call i32 (...) @histogram()
%5 = tail call i32 (...) @cryptography()
%6 = tail call i32 (...) @bit()
%7 = tail call i32 (...) @order()
%8 = tail call i32 (...) @order_mod()
%9 = tail call i32 (...) @order_negative()
%10 = tail call i32 (...) @order_random()
%11 = tail call i32 (...) @order_random_mod()
%12 = tail call i32 (...) @monte_carlo()
%13 = tail call i32 (...) @monte_carlo_ellipse()
ret i32 0
}