#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*/ generate_morton(int);
int /*<<< orphan*/ generate_reverse();
int /*<<< orphan*/ generate_shuffle();
int /*<<< orphan*/ printf(char *);
int main() {
  printf("// byte reverse look up table\n");
  generate_reverse();
  printf("// Morton table for interleaving bytes\n");
  generate_morton(0);
  printf("// Morton table for interleaving bytes, shifted left 1 bit\n");
  generate_morton(1);
  printf("// Tables for shuffling\n");
  generate_shuffle();
  return 1;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xeaa(%rip),%rdi
call   1030 <printf@plt>
mov    $0x0,%al
call   1050 <generate_reverse@plt>
lea    0xeb6(%rip),%rdi
call   1030 <printf@plt>
xor    %edi,%edi
call   1040 <generate_morton@plt>
lea    0xecb(%rip),%rdi
call   1030 <printf@plt>
mov    $0x1,%edi
call   1040 <generate_morton@plt>
lea    0xef1(%rip),%rdi
call   1030 <printf@plt>
mov    $0x0,%al
call   1060 <generate_shuffle@plt>
mov    $0x1,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xeb8(%rip),%rdi
call   1030 <puts@plt>
xor    %eax,%eax
call   1050 <generate_reverse@plt>
lea    0xec3(%rip),%rdi
call   1030 <puts@plt>
xor    %edi,%edi
call   1040 <generate_morton@plt>
lea    0xed7(%rip),%rdi
call   1030 <puts@plt>
mov    $0x1,%edi
call   1040 <generate_morton@plt>
lea    0xefc(%rip),%rdi
call   1030 <puts@plt>
xor    %eax,%eax
call   1060 <generate_shuffle@plt>
mov    $0x1,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [31 x i8] c"// byte reverse look up table\0A\00"
@.str.1 = [40 x i8] c"// Morton table for interleaving bytes\0A\00"
@.str.2 = [60 x i8] c"// Morton table for interleaving bytes, shifted left 1 bit\0A\00"
@.str.3 = [25 x i8] c"// Tables for shuffling\0A\00"
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str, i64 0, i64 0))
%3 = call i32 (...) @generate_reverse()
%4 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @generate_morton(i32 0)
%6 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.2, i64 0, i64 0))
%7 = call i32 @generate_morton(i32 1)
%8 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.3, i64 0, i64 0))
%9 = call i32 (...) @generate_shuffle()
ret i32 1
}

LLVM IR (-O2):
@str = [30 x i8] c"// byte reverse look up table\00"
@str.4 = [39 x i8] c"// Morton table for interleaving bytes\00"
@str.5 = [59 x i8] c"// Morton table for interleaving bytes, shifted left 1 bit\00"
@str.6 = [24 x i8] c"// Tables for shuffling\00"
define i32 @main() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 (...) @generate_reverse()
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.4, i64 0, i64 0))
%4 = tail call i32 @generate_morton(i32 0)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.5, i64 0, i64 0))
%6 = tail call i32 @generate_morton(i32 1)
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.6, i64 0, i64 0))
%8 = tail call i32 (...) @generate_shuffle()
ret i32 1
}