#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 isPalindromeIterative(char *, int);
int is_palindrome_recursive(char *, int);
int /*<<< orphan*/ printf(char *, int);
int main(void) {
  printf("Is hello a palindrome (iterative): %d\n",
         isPalindromeIterative("hello", 5));
  printf("Is racecar a palindrome (iterative): %d\n",
         isPalindromeIterative("racecar", 7));
  printf("Is aba a palindrome (iterative): %d\n",
         isPalindromeIterative("aba", 3));
  printf("Is hello a palindrome (recursive): %d\n",
         is_palindrome_recursive("hello", 5));
  printf("Is racecar a palindrome (recursive): %d\n",
         is_palindrome_recursive("racecar", 7));
  printf("Is aba a palindrome (recursive): %d\n",
         is_palindrome_recursive("aba", 3));
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xee1(%rip),%rdi
mov    $0x5,%esi
call   1030 <isPalindromeIterative@plt>
mov    %eax,%esi
lea    0xea7(%rip),%rdi
call   1040 <printf@plt>
lea    0xef1(%rip),%rdi
mov    $0x7,%esi
call   1030 <isPalindromeIterative@plt>
mov    %eax,%esi
lea    0xeb5(%rip),%rdi
call   1040 <printf@plt>
lea    0xeff(%rip),%rdi
mov    $0x3,%esi
call   1030 <isPalindromeIterative@plt>
mov    %eax,%esi
lea    0xec7(%rip),%rdi
call   1040 <printf@plt>
lea    0xe84(%rip),%rdi
mov    $0x5,%esi
call   1050 <is_palindrome_recursive@plt>
mov    %eax,%esi
lea    0xed1(%rip),%rdi
call   1040 <printf@plt>
lea    0xe94(%rip),%rdi
mov    $0x7,%esi
call   1050 <is_palindrome_recursive@plt>
mov    %eax,%esi
lea    0xed9(%rip),%rdi
call   1040 <printf@plt>
lea    0xea2(%rip),%rdi
mov    $0x3,%esi
call   1050 <is_palindrome_recursive@plt>
mov    %eax,%esi
lea    0xee3(%rip),%rdi
call   1040 <printf@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r15
push   %r14
push   %rbx
lea    0xeeb(%rip),%r14
mov    %r14,%rdi
mov    $0x5,%esi
call   1030 <isPalindromeIterative@plt>
lea    0xeb0(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
lea    0xef8(%rip),%r15
mov    %r15,%rdi
mov    $0x7,%esi
call   1030 <isPalindromeIterative@plt>
lea    0xebb(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
lea    0xf03(%rip),%rbx
mov    %rbx,%rdi
mov    $0x3,%esi
call   1030 <isPalindromeIterative@plt>
lea    0xeca(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
mov    %r14,%rdi
mov    $0x5,%esi
call   1050 <is_palindrome_recursive@plt>
lea    0xed8(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
mov    %r15,%rdi
mov    $0x7,%esi
call   1050 <is_palindrome_recursive@plt>
lea    0xee4(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    $0x3,%esi
call   1050 <is_palindrome_recursive@plt>
lea    0xef2(%rip),%rdi
mov    %eax,%esi
call   1040 <printf@plt>
xor    %eax,%eax
pop    %rbx
pop    %r14
pop    %r15
ret

LLVM IR (-O0):
@.str = [39 x i8] c"Is hello a palindrome (iterative): %d\0A\00"
@.str.1 = [6 x i8] c"hello\00"
@.str.2 = [41 x i8] c"Is racecar a palindrome (iterative): %d\0A\00"
@.str.3 = [8 x i8] c"racecar\00"
@.str.4 = [37 x i8] c"Is aba a palindrome (iterative): %d\0A\00"
@.str.5 = [4 x i8] c"aba\00"
@.str.6 = [39 x i8] c"Is hello a palindrome (recursive): %d\0A\00"
@.str.7 = [41 x i8] c"Is racecar a palindrome (recursive): %d\0A\00"
@.str.8 = [37 x i8] c"Is aba a palindrome (recursive): %d\0A\00"
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @isPalindromeIterative(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32 5)
%3 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str, i64 0, i64 0), i32 %2)
%4 = call i32 @isPalindromeIterative(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 7)
%5 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.2, i64 0, i64 0), i32 %4)
%6 = call i32 @isPalindromeIterative(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i32 3)
%7 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.4, i64 0, i64 0), i32 %6)
%8 = call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32 5)
%9 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.6, i64 0, i64 0), i32 %8)
%10 = call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 7)
%11 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.7, i64 0, i64 0), i32 %10)
%12 = call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i32 3)
%13 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.8, i64 0, i64 0), i32 %12)
ret i32 0
}

LLVM IR (-O2):
@.str = [39 x i8] c"Is hello a palindrome (iterative): %d\0A\00"
@.str.1 = [6 x i8] c"hello\00"
@.str.2 = [41 x i8] c"Is racecar a palindrome (iterative): %d\0A\00"
@.str.3 = [8 x i8] c"racecar\00"
@.str.4 = [37 x i8] c"Is aba a palindrome (iterative): %d\0A\00"
@.str.5 = [4 x i8] c"aba\00"
@.str.6 = [39 x i8] c"Is hello a palindrome (recursive): %d\0A\00"
@.str.7 = [41 x i8] c"Is racecar a palindrome (recursive): %d\0A\00"
@.str.8 = [37 x i8] c"Is aba a palindrome (recursive): %d\0A\00"
define i32 @main() {
%1 = tail call i32 @isPalindromeIterative(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32 5)
%2 = tail call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str, i64 0, i64 0), i32 %1)
%3 = tail call i32 @isPalindromeIterative(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 7)
%4 = tail call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.2, i64 0, i64 0), i32 %3)
%5 = tail call i32 @isPalindromeIterative(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i32 3)
%6 = tail call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.4, i64 0, i64 0), i32 %5)
%7 = tail call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32 5)
%8 = tail call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.6, i64 0, i64 0), i32 %7)
%9 = tail call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 7)
%10 = tail call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.7, i64 0, i64 0), i32 %9)
%11 = tail call i32 @is_palindrome_recursive(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i32 3)
%12 = tail call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.8, i64 0, i64 0), i32 %11)
ret i32 0
}