; LLVM IR from MostafaTwfiq/C-DataStructures-And-Algorithms :: Unit Test/Tests/DataStructuresTests/TreesTest/RedBlackTreeTest (RedBlackTreeTest)

; Unoptimized IR (clang -disable-llvm-passes):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

%struct.ErrorTestStruct = type { i32 }
%struct.RBTree = type { ptr, i32, ptr, ptr }

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local global ptr, align 8
@__const.testRBTreeInsert.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) #0

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @compareIntPointersRBTT(ptr noundef, ptr noundef) #0

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) #2

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) #2

; Function Attrs: nounwind
declare void @free(ptr noundef) #3

declare void @destroyRBTree(ptr noundef) #2

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidRBTree(ptr noundef, ptr noundef, i32 noundef) #0

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidBinaryTreeRBTT(ptr noundef, ptr noundef) #0

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeInsert(ptr noundef %0) #0 {
  %2 = alloca ptr, align 8
  %3 = alloca ptr, align 8
  %4 = alloca [13 x i32], align 16
  %5 = alloca i32, align 4
  store ptr %0, ptr %2, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %3) #5
  %6 = call ptr @redBlackTreeInitialization(ptr noundef @free, ptr noundef @compareIntPointersRBTT)
  store ptr %6, ptr %3, align 8, !tbaa !5
  call void @rBTreeInsert(ptr noundef null, ptr noundef null)
  %7 = load ptr, ptr %2, align 8, !tbaa !5
  %8 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %9 = getelementptr inbounds %struct.ErrorTestStruct, ptr %8, i32 0, i32 0
  %10 = load i32, ptr %9, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %7, ptr noundef @.str, i32 noundef 122, ptr noundef null, i32 noundef -83386157, i32 noundef %10)
  %11 = load ptr, ptr %3, align 8, !tbaa !5
  call void @rBTreeInsert(ptr noundef %11, ptr noundef null)
  %12 = load ptr, ptr %2, align 8, !tbaa !5
  %13 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %14 = getelementptr inbounds %struct.ErrorTestStruct, ptr %13, i32 0, i32 0
  %15 = load i32, ptr %14, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %12, ptr noundef @.str, i32 noundef 125, ptr noundef null, i32 noundef -83384987, i32 noundef %15)
  call void @llvm.lifetime.start.p0(i64 52, ptr %4) #5
  call void @llvm.memcpy.p0.p0.i64(ptr align 16 %4, ptr align 16 @__const.testRBTreeInsert.valuesArr, i64 52, i1 false)
  call void @llvm.lifetime.start.p0(i64 4, ptr %5) #5
  store i32 0, ptr %5, align 4, !tbaa !12
  br label %16

16:                                               ; preds = %40, %1
  %17 = load i32, ptr %5, align 4, !tbaa !12
  %18 = icmp slt i32 %17, 13
  br i1 %18, label %20, label %19

19:                                               ; preds = %16
  call void @llvm.lifetime.end.p0(i64 4, ptr %5) #5
  br label %43

20:                                               ; preds = %16
  %21 = load ptr, ptr %3, align 8, !tbaa !5
  %22 = load i32, ptr %5, align 4, !tbaa !12
  %23 = sext i32 %22 to i64
  %24 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 %23
  %25 = load i32, ptr %24, align 4, !tbaa !12
  %26 = call ptr @generateIntPointerRBTT(i32 noundef %25)
  call void @rBTreeInsert(ptr noundef %21, ptr noundef %26)
  %27 = load ptr, ptr %2, align 8, !tbaa !5
  %28 = load ptr, ptr %3, align 8, !tbaa !5
  %29 = getelementptr inbounds %struct.RBTree, ptr %28, i32 0, i32 0
  %30 = load ptr, ptr %29, align 8, !tbaa !13
  %31 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %30, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %27, ptr noundef @.str, i32 noundef 133, ptr noundef null, i32 noundef 1, i32 noundef %31)
  %32 = load ptr, ptr %2, align 8, !tbaa !5
  %33 = load ptr, ptr %3, align 8, !tbaa !5
  %34 = getelementptr inbounds %struct.RBTree, ptr %33, i32 0, i32 0
  %35 = load ptr, ptr %34, align 8, !tbaa !13
  %36 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %35, i32 noundef 0)
  %37 = icmp eq i32 %36, -1
  %38 = zext i1 %37 to i64
  %39 = select i1 %37, i32 0, i32 1
  call void @CuAssertIntEquals_LineMsg(ptr noundef %32, ptr noundef @.str, i32 noundef 134, ptr noundef null, i32 noundef 1, i32 noundef %39)
  br label %40

40:                                               ; preds = %20
  %41 = load i32, ptr %5, align 4, !tbaa !12
  %42 = add nsw i32 %41, 1
  store i32 %42, ptr %5, align 4, !tbaa !12
  br label %16, !llvm.loop !15

43:                                               ; preds = %19
  %44 = load ptr, ptr %3, align 8, !tbaa !5
  call void @destroyRBTree(ptr noundef %44)
  call void @llvm.lifetime.end.p0(i64 52, ptr %4) #5
  call void @llvm.lifetime.end.p0(i64 8, ptr %3) #5
  ret void
}

declare void @rBTreeInsert(ptr noundef, ptr noundef) #2

; Function Attrs: nocallback nofree nounwind willreturn memory(argmem: readwrite)
declare void @llvm.memcpy.p0.p0.i64(ptr noalias nocapture writeonly, ptr noalias nocapture readonly, i64, i1 immarg) #4

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { nounwind "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #4 = { nocallback nofree nounwind willreturn memory(argmem: readwrite) }
attributes #5 = { nounwind }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"any pointer", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}
!13 = !{!14, !6, i64 0}
!14 = !{!"RBTree", !6, i64 0, !11, i64 8, !6, i64 16, !6, i64 24}
!15 = distinct !{!15, !16}
!16 = !{!"llvm.loop.mustprogress"}


; Optimized IR (opt -passes='default<O3>'):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local local_unnamed_addr global ptr, align 8
@__const.testRBTreeInsert.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
declare dso_local i32 @compareIntPointersRBTT(ptr noundef, ptr noundef) #0

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) local_unnamed_addr #1

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) local_unnamed_addr #1

; Function Attrs: mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite)
declare void @free(ptr allocptr nocapture noundef) #2

declare void @destroyRBTree(ptr noundef) local_unnamed_addr #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidRBTree(ptr noundef, ptr noundef, i32 noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidBinaryTreeRBTT(ptr noundef, ptr noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeInsert(ptr noundef %0) local_unnamed_addr #0 {
  %2 = tail call ptr @redBlackTreeInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersRBTT) #3
  tail call void @rBTreeInsert(ptr noundef null, ptr noundef null) #3
  %3 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %4 = load i32, ptr %3, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 122, ptr noundef null, i32 noundef -83386157, i32 noundef %4) #3
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef null) #3
  %5 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %6 = load i32, ptr %5, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 125, ptr noundef null, i32 noundef -83384987, i32 noundef %6) #3
  br label %8

7:                                                ; preds = %8
  tail call void @destroyRBTree(ptr noundef nonnull %2) #3
  ret void

8:                                                ; preds = %1, %8
  %indvars.iv = phi i64 [ 0, %1 ], [ %indvars.iv.next, %8 ]
  %9 = getelementptr inbounds [13 x i32], ptr @__const.testRBTreeInsert.valuesArr, i64 0, i64 %indvars.iv
  %10 = load i32, ptr %9, align 4, !tbaa !12
  %11 = tail call ptr @generateIntPointerRBTT(i32 noundef %10)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %11) #3
  %12 = load ptr, ptr %2, align 8, !tbaa !13
  %13 = tail call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %12, ptr noundef null)
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 133, ptr noundef null, i32 noundef 1, i32 noundef %13) #3
  %14 = load ptr, ptr %2, align 8, !tbaa !13
  %15 = tail call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %14, i32 noundef 0)
  %16 = icmp ne i32 %15, -1
  %17 = zext i1 %16 to i32
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 134, ptr noundef null, i32 noundef 1, i32 noundef %17) #3
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  %exitcond.not = icmp eq i64 %indvars.iv.next, 13
  br i1 %exitcond.not, label %7, label %8, !llvm.loop !15
}

declare void @rBTreeInsert(ptr noundef, ptr noundef) local_unnamed_addr #1

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #2 = { mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite) "alloc-family"="malloc" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { nounwind }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"any pointer", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}
!13 = !{!14, !6, i64 0}
!14 = !{!"RBTree", !6, i64 0, !11, i64 8, !6, i64 16, !6, i64 24}
!15 = distinct !{!15, !16}
!16 = !{!"llvm.loop.mustprogress"}


; Effective O3 passes: EarlyCSEPass,GlobalOptPass,IndVarSimplifyPass,InferFunctionAttrsPass,InstCombinePass,LoopRotatePass,SROAPass,SimplifyCFGPass,TailCallElimPass