#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 usage_2(void) {
  printf("Enter any of the following commands after the prompt > :\n");
  printf("\ti <k>  -- Insert <k> (an integer) as both key and value).\n");
  printf("\tf <k>  -- Find the value under key <k>.\n");
  printf("\tp <k> -- Print the path from the root to key k and its associated "
         "value.\n");
  printf("\tr <k1> <k2> -- Print the keys and values found in the range "
         "[<k1>, <k2>\n");
  printf("\td <k>  -- Delete key <k> and its associated value.\n");
  printf("\tx -- Destroy the whole tree.  Start again with an empty tree of "
         "the same order.\n");
  printf("\tt -- Print the B+ tree.\n");
  printf("\tl -- Print the keys of the leaves (bottom row of the tree).\n");
  printf("\tv -- Toggle output of pointer addresses (\"verbose\") in tree and "
         "leaves.\n");
  printf("\tq -- Quit. (Or use Ctl-D.)\n");
  printf("\t? -- Print this help message.\n");
}


x86 assembly (clang, -O0):
<usage_2>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf13(%rip),%rdi
call   1030 <printf@plt>
lea    0xf43(%rip),%rdi
call   1030 <printf@plt>
lea    0xf61(%rip),%rdi
call   1030 <printf@plt>
lea    0xfa0(%rip),%rdi
call   1030 <printf@plt>
lea    0xfde(%rip),%rdi
call   1030 <printf@plt>
lea    0x1007(%rip),%rdi
call   1030 <printf@plt>
lea    0x104d(%rip),%rdi
call   1030 <printf@plt>
lea    0x105b(%rip),%rdi
call   1030 <printf@plt>
lea    0x108d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10cb(%rip),%rdi
call   1030 <printf@plt>
lea    0x10dc(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<usage_2>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf15(%rip),%rdi
call   1030 <puts@plt>
lea    0xf44(%rip),%rdi
call   1030 <puts@plt>
lea    0xf61(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9f(%rip),%rdi
call   1030 <puts@plt>
lea    0xfdc(%rip),%rdi
call   1030 <puts@plt>
lea    0x1004(%rip),%rdi
call   1030 <puts@plt>
lea    0x1049(%rip),%rdi
call   1030 <puts@plt>
lea    0x1056(%rip),%rdi
call   1030 <puts@plt>
lea    0x1087(%rip),%rdi
call   1030 <puts@plt>
lea    0x10c4(%rip),%rdi
call   1030 <puts@plt>
lea    0x10d4(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [58 x i8] c"Enter any of the following commands after the prompt > :\0A\00"
@.str.1 = [60 x i8] c"\09i <k> -- Insert <k> (an integer) as both key and value).\0A\00"
@.str.2 = [42 x i8] c"\09f <k> -- Find the value under key <k>.\0A\00"
@.str.3 = [75 x i8] c"\09p <k> -- Print the path from the root to key k and its associated value.\0A\00"
@.str.4 = [74 x i8] c"\09r <k1> <k2> -- Print the keys and values found in the range [<k1>, <k2>\0A\00"
@.str.5 = [53 x i8] c"\09d <k> -- Delete key <k> and its associated value.\0A\00"
@.str.6 = [82 x i8] c"\09x -- Destroy the whole tree. Start again with an empty tree of the same order.\0A\00"
@.str.7 = [26 x i8] c"\09t -- Print the B+ tree.\0A\00"
@.str.8 = [62 x i8] c"\09l -- Print the keys of the leaves (bottom row of the tree).\0A\00"
@.str.9 = [74 x i8] c"\09v -- Toggle output of pointer addresses (\22verbose\22) in tree and leaves.\0A\00"
@.str.10 = [29 x i8] c"\09q -- Quit. (Or use Ctl-D.)\0A\00"
@.str.11 = [32 x i8] c"\09? -- Print this help message.\0A\00"
define void @usage_2() {
%1 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.11, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [57 x i8] c"Enter any of the following commands after the prompt > :\00"
@str.12 = [59 x i8] c"\09i <k> -- Insert <k> (an integer) as both key and value).\00"
@str.13 = [41 x i8] c"\09f <k> -- Find the value under key <k>.\00"
@str.14 = [74 x i8] c"\09p <k> -- Print the path from the root to key k and its associated value.\00"
@str.15 = [73 x i8] c"\09r <k1> <k2> -- Print the keys and values found in the range [<k1>, <k2>\00"
@str.16 = [52 x i8] c"\09d <k> -- Delete key <k> and its associated value.\00"
@str.17 = [81 x i8] c"\09x -- Destroy the whole tree. Start again with an empty tree of the same order.\00"
@str.18 = [25 x i8] c"\09t -- Print the B+ tree.\00"
@str.19 = [61 x i8] c"\09l -- Print the keys of the leaves (bottom row of the tree).\00"
@str.20 = [73 x i8] c"\09v -- Toggle output of pointer addresses (\22verbose\22) in tree and leaves.\00"
@str.21 = [28 x i8] c"\09q -- Quit. (Or use Ctl-D.)\00"
@str.22 = [31 x i8] c"\09? -- Print this help message.\00"
define void @usage_2() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.12, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.13, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.14, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.15, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.16, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([81 x i8], [81 x i8]* @str.17, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.18, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.19, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.20, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.21, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.22, i64 0, i64 0))
ret void
}