#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*/ assert(int);
int is_palindrome(char *, int /*<<< orphan*/, int);
int main() {
  assert(!is_palindrome("ankit", 0, 4));
  assert(!is_palindrome("lirxil", 0, 5));
  assert(!is_palindrome("kaayak", 0, 5));
  assert(!is_palindrome("ka ya k", 0, 6));
  assert(!is_palindrome("namasman", 0, 7));
  assert(is_palindrome("liril", 0, 4));
  assert(is_palindrome("kayak", 0, 4));
  assert(is_palindrome("racecar", 0, 6));
  assert(is_palindrome("rotator", 0, 6));
  assert(is_palindrome("rottaattor", 0, 9));
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xeca(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
cmp    $0x0,%eax
setne  %al
xor    $0xff,%al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    0xeab(%rip),%rdi
xor    %esi,%esi
mov    $0x5,%edx
call   1030 <is_palindrome@plt>
cmp    $0x0,%eax
setne  %al
xor    $0xff,%al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    0xe8d(%rip),%rdi
xor    %esi,%esi
mov    $0x5,%edx
call   1030 <is_palindrome@plt>
cmp    $0x0,%eax
setne  %al
xor    $0xff,%al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    0xe6f(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
cmp    $0x0,%eax
setne  %al
xor    $0xff,%al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    0xe52(%rip),%rdi
xor    %esi,%esi
mov    $0x7,%edx
call   1030 <is_palindrome@plt>
cmp    $0x0,%eax
setne  %al
xor    $0xff,%al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
lea    0xe36(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe22(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe0e(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xdfc(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xdea(%rip),%rdi
xor    %esi,%esi
mov    $0x9,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xed8(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
lea    0xebe(%rip),%rdi
xor    %esi,%esi
mov    $0x5,%edx
call   1030 <is_palindrome@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
lea    0xea5(%rip),%rdi
xor    %esi,%esi
mov    $0x5,%edx
call   1030 <is_palindrome@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
lea    0xe8c(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
lea    0xe74(%rip),%rdi
xor    %esi,%esi
mov    $0x7,%edx
call   1030 <is_palindrome@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
lea    0xe5d(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe49(%rip),%rdi
xor    %esi,%esi
mov    $0x4,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe35(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe23(%rip),%rdi
xor    %esi,%esi
mov    $0x6,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
lea    0xe11(%rip),%rdi
xor    %esi,%esi
mov    $0x9,%edx
call   1030 <is_palindrome@plt>
mov    %eax,%edi
call   1040 <assert@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [6 x i8] c"ankit\00"
@.str.1 = [7 x i8] c"lirxil\00"
@.str.2 = [7 x i8] c"kaayak\00"
@.str.3 = [8 x i8] c"ka ya k\00"
@.str.4 = [9 x i8] c"namasman\00"
@.str.5 = [6 x i8] c"liril\00"
@.str.6 = [6 x i8] c"kayak\00"
@.str.7 = [8 x i8] c"racecar\00"
@.str.8 = [8 x i8] c"rotator\00"
@.str.9 = [11 x i8] c"rottaattor\00"
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str, i64 0, i64 0), i32 0, i32 4)
%3 = icmp ne i32 %2, 0
%4 = xor i1 %3, true
%5 = zext i1 %4 to i32
%6 = call i32 @assert(i32 %5)
%7 = call i32 @is_palindrome(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.1, i64 0, i64 0), i32 0, i32 5)
%8 = icmp ne i32 %7, 0
%9 = xor i1 %8, true
%10 = zext i1 %9 to i32
%11 = call i32 @assert(i32 %10)
%12 = call i32 @is_palindrome(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.2, i64 0, i64 0), i32 0, i32 5)
%13 = icmp ne i32 %12, 0
%14 = xor i1 %13, true
%15 = zext i1 %14 to i32
%16 = call i32 @assert(i32 %15)
%17 = call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 0, i32 6)
%18 = icmp ne i32 %17, 0
%19 = xor i1 %18, true
%20 = zext i1 %19 to i32
%21 = call i32 @assert(i32 %20)
%22 = call i32 @is_palindrome(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.4, i64 0, i64 0), i32 0, i32 7)
%23 = icmp ne i32 %22, 0
%24 = xor i1 %23, true
%25 = zext i1 %24 to i32
%26 = call i32 @assert(i32 %25)
%27 = call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.5, i64 0, i64 0), i32 0, i32 4)
%28 = call i32 @assert(i32 %27)
%29 = call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.6, i64 0, i64 0), i32 0, i32 4)
%30 = call i32 @assert(i32 %29)
%31 = call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.7, i64 0, i64 0), i32 0, i32 6)
%32 = call i32 @assert(i32 %31)
%33 = call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.8, i64 0, i64 0), i32 0, i32 6)
%34 = call i32 @assert(i32 %33)
%35 = call i32 @is_palindrome(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.9, i64 0, i64 0), i32 0, i32 9)
%36 = call i32 @assert(i32 %35)
ret i32 0
}

LLVM IR (-O2):
@.str = [6 x i8] c"ankit\00"
@.str.1 = [7 x i8] c"lirxil\00"
@.str.2 = [7 x i8] c"kaayak\00"
@.str.3 = [8 x i8] c"ka ya k\00"
@.str.4 = [9 x i8] c"namasman\00"
@.str.5 = [6 x i8] c"liril\00"
@.str.6 = [6 x i8] c"kayak\00"
@.str.7 = [8 x i8] c"racecar\00"
@.str.8 = [8 x i8] c"rotator\00"
@.str.9 = [11 x i8] c"rottaattor\00"
define i32 @main() {
%1 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str, i64 0, i64 0), i32 0, i32 4)
%2 = icmp eq i32 %1, 0
%3 = zext i1 %2 to i32
%4 = tail call i32 @assert(i32 %3)
%5 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.1, i64 0, i64 0), i32 0, i32 5)
%6 = icmp eq i32 %5, 0
%7 = zext i1 %6 to i32
%8 = tail call i32 @assert(i32 %7)
%9 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.2, i64 0, i64 0), i32 0, i32 5)
%10 = icmp eq i32 %9, 0
%11 = zext i1 %10 to i32
%12 = tail call i32 @assert(i32 %11)
%13 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0), i32 0, i32 6)
%14 = icmp eq i32 %13, 0
%15 = zext i1 %14 to i32
%16 = tail call i32 @assert(i32 %15)
%17 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.4, i64 0, i64 0), i32 0, i32 7)
%18 = icmp eq i32 %17, 0
%19 = zext i1 %18 to i32
%20 = tail call i32 @assert(i32 %19)
%21 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.5, i64 0, i64 0), i32 0, i32 4)
%22 = tail call i32 @assert(i32 %21)
%23 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.6, i64 0, i64 0), i32 0, i32 4)
%24 = tail call i32 @assert(i32 %23)
%25 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.7, i64 0, i64 0), i32 0, i32 6)
%26 = tail call i32 @assert(i32 %25)
%27 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.8, i64 0, i64 0), i32 0, i32 6)
%28 = tail call i32 @assert(i32 %27)
%29 = tail call i32 @is_palindrome(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.9, i64 0, i64 0), i32 0, i32 9)
%30 = tail call i32 @assert(i32 %29)
ret i32 0
}