#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 find_bitwise_xor_positive_nums_v1(int);
int main() {
  assert(-1 == find_bitwise_xor_positive_nums_v1(-100));
  assert(-1 == find_bitwise_xor_positive_nums_v1(0));
  assert(7 == find_bitwise_xor_positive_nums_v1(6));
  assert(0 == find_bitwise_xor_positive_nums_v1(7));
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0xffffff9c,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
mov    %eax,%ecx
mov    $0xffffffff,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1030 <assert@plt>
xor    %edi,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
mov    %eax,%ecx
mov    $0xffffffff,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1030 <assert@plt>
mov    $0x6,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
mov    %eax,%ecx
mov    $0x7,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1030 <assert@plt>
mov    $0x7,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
mov    %eax,%ecx
xor    %eax,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1030 <assert@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
mov    $0xffffff9c,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1030 <assert@plt>
xor    %edi,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
xor    %edi,%edi
cmp    $0xffffffff,%eax
sete   %dil
call   1030 <assert@plt>
mov    $0x6,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
xor    %edi,%edi
cmp    $0x7,%eax
sete   %dil
call   1030 <assert@plt>
mov    $0x7,%edi
call   1040 <find_bitwise_xor_positive_nums_v1@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1030 <assert@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @find_bitwise_xor_positive_nums_v1(i32 -100)
%3 = icmp eq i32 -1, %2
%4 = zext i1 %3 to i32
%5 = call i32 @assert(i32 %4)
%6 = call i32 @find_bitwise_xor_positive_nums_v1(i32 0)
%7 = icmp eq i32 -1, %6
%8 = zext i1 %7 to i32
%9 = call i32 @assert(i32 %8)
%10 = call i32 @find_bitwise_xor_positive_nums_v1(i32 6)
%11 = icmp eq i32 7, %10
%12 = zext i1 %11 to i32
%13 = call i32 @assert(i32 %12)
%14 = call i32 @find_bitwise_xor_positive_nums_v1(i32 7)
%15 = icmp eq i32 0, %14
%16 = zext i1 %15 to i32
%17 = call i32 @assert(i32 %16)
ret i32 0
}

LLVM IR (-O2):
define i32 @main() {
%1 = tail call i32 @find_bitwise_xor_positive_nums_v1(i32 -100)
%2 = icmp eq i32 %1, -1
%3 = zext i1 %2 to i32
%4 = tail call i32 @assert(i32 %3)
%5 = tail call i32 @find_bitwise_xor_positive_nums_v1(i32 0)
%6 = icmp eq i32 %5, -1
%7 = zext i1 %6 to i32
%8 = tail call i32 @assert(i32 %7)
%9 = tail call i32 @find_bitwise_xor_positive_nums_v1(i32 6)
%10 = icmp eq i32 %9, 7
%11 = zext i1 %10 to i32
%12 = tail call i32 @assert(i32 %11)
%13 = tail call i32 @find_bitwise_xor_positive_nums_v1(i32 7)
%14 = icmp eq i32 %13, 0
%15 = zext i1 %14 to i32
%16 = tail call i32 @assert(i32 %15)
ret i32 0
}