#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 *);
int /*<<< orphan*/ test_circularDoubleLinkedList();
int /*<<< orphan*/ test_circularDoubleLinkedListJosephus();
int /*<<< orphan*/ test_cyclicShiftJosephus();
int /*<<< orphan*/ test_josephus();
int /*<<< orphan*/ test_reccurenceJosephus();
int /*<<< orphan*/ test_reccurenceJosephusZero();
int /*<<< orphan*/ test_recurrenceImproved();
int main() {
  printf("///////////////////////\n");
  printf("// CIRCULAR DOUBLE LINKED LIST TEST\n");
  printf("///////////////////////\n");
  test_circularDoubleLinkedList();
  printf("\n");
  printf("///////////////////////\n");
  printf("// JOSEPHUS PROBLEM SOLUTIONS TEST\n");
  printf("///////////////////////\n");
  test_circularDoubleLinkedListJosephus();
  test_cyclicShiftJosephus();
  test_reccurenceJosephus();
  test_reccurenceJosephusZero();
  test_recurrenceImproved();
  test_josephus();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xe6a(%rip),%rdi
call   1050 <printf@plt>
lea    0xe77(%rip),%rdi
call   1050 <printf@plt>
lea    0xe52(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1030 <test_circularDoubleLinkedList@plt>
lea    0xe56(%rip),%rdi
call   1050 <printf@plt>
lea    0xe33(%rip),%rdi
call   1050 <printf@plt>
lea    0xe65(%rip),%rdi
call   1050 <printf@plt>
lea    0xe1b(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1080 <test_circularDoubleLinkedListJosephus@plt>
mov    $0x0,%al
call   1040 <test_cyclicShiftJosephus@plt>
mov    $0x0,%al
call   1070 <test_reccurenceJosephus@plt>
mov    $0x0,%al
call   10a0 <test_reccurenceJosephusZero@plt>
mov    $0x0,%al
call   1090 <test_recurrenceImproved@plt>
mov    $0x0,%al
call   1060 <test_josephus@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
lea    0xeaf(%rip),%rbx
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0xe59(%rip),%rdi
call   1040 <puts@plt>
mov    %rbx,%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1050 <test_circularDoubleLinkedList@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0xe50(%rip),%rdi
call   1040 <puts@plt>
mov    %rbx,%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1090 <test_circularDoubleLinkedListJosephus@plt>
xor    %eax,%eax
call   1060 <test_cyclicShiftJosephus@plt>
xor    %eax,%eax
call   1080 <test_reccurenceJosephus@plt>
xor    %eax,%eax
call   10b0 <test_reccurenceJosephusZero@plt>
xor    %eax,%eax
call   10a0 <test_recurrenceImproved@plt>
xor    %eax,%eax
call   1070 <test_josephus@plt>
xor    %eax,%eax
pop    %rbx
ret

LLVM IR (-O0):
@.str = [25 x i8] c"///////////////////////\0A\00"
@.str.1 = [37 x i8] c"// CIRCULAR DOUBLE LINKED LIST TEST\0A\00"
@.str.2 = [2 x i8] c"\0A\00"
@.str.3 = [36 x i8] c"// JOSEPHUS PROBLEM SOLUTIONS TEST\0A\00"
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.1, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
%5 = call i32 (...) @test_circularDoubleLinkedList()
%6 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.3, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
%10 = call i32 (...) @test_circularDoubleLinkedListJosephus()
%11 = call i32 (...) @test_cyclicShiftJosephus()
%12 = call i32 (...) @test_reccurenceJosephus()
%13 = call i32 (...) @test_reccurenceJosephusZero()
%14 = call i32 (...) @test_recurrenceImproved()
%15 = call i32 (...) @test_josephus()
ret i32 0
}

LLVM IR (-O2):
@str.4 = [36 x i8] c"// CIRCULAR DOUBLE LINKED LIST TEST\00"
@str.7 = [35 x i8] c"// JOSEPHUS PROBLEM SOLUTIONS TEST\00"
@str.8 = [24 x i8] c"///////////////////////\00"
define i32 @main() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.8, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.4, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.8, i64 0, i64 0))
%4 = tail call i32 (...) @test_circularDoubleLinkedList()
%5 = tail call i32 @putchar(i32 10)
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.8, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.7, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.8, i64 0, i64 0))
%9 = tail call i32 (...) @test_circularDoubleLinkedListJosephus()
%10 = tail call i32 (...) @test_cyclicShiftJosephus()
%11 = tail call i32 (...) @test_reccurenceJosephus()
%12 = tail call i32 (...) @test_reccurenceJosephusZero()
%13 = tail call i32 (...) @test_recurrenceImproved()
%14 = tail call i32 (...) @test_josephus()
ret i32 0
}