; 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.testRBTreeDelete.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

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

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

declare i32 @rBTreeContains(ptr noundef, ptr noundef) #2

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeDelete(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
  %6 = alloca i32, align 4
  store ptr %0, ptr %2, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %3) #5
  %7 = call ptr @redBlackTreeInitialization(ptr noundef @free, ptr noundef @compareIntPointersRBTT)
  store ptr %7, ptr %3, align 8, !tbaa !5
  call void @rBTreeDelete(ptr noundef null, ptr noundef null)
  %8 = load ptr, ptr %2, align 8, !tbaa !5
  %9 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %10 = getelementptr inbounds %struct.ErrorTestStruct, ptr %9, i32 0, i32 0
  %11 = load i32, ptr %10, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %8, ptr noundef @.str, i32 noundef 250, ptr noundef null, i32 noundef -83386157, i32 noundef %11)
  %12 = load ptr, ptr %3, align 8, !tbaa !5
  call void @rBTreeDelete(ptr noundef %12, ptr noundef null)
  %13 = load ptr, ptr %2, align 8, !tbaa !5
  %14 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %15 = getelementptr inbounds %struct.ErrorTestStruct, ptr %14, i32 0, i32 0
  %16 = load i32, ptr %15, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %13, ptr noundef @.str, i32 noundef 253, ptr noundef null, i32 noundef -83384987, i32 noundef %16)
  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.testRBTreeDelete.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 %17

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

20:                                               ; preds = %17
  call void @llvm.lifetime.end.p0(i64 4, ptr %5) #5
  br label %31

21:                                               ; preds = %17
  %22 = load ptr, ptr %3, align 8, !tbaa !5
  %23 = load i32, ptr %5, align 4, !tbaa !12
  %24 = sext i32 %23 to i64
  %25 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 %24
  %26 = load i32, ptr %25, align 4, !tbaa !12
  %27 = call ptr @generateIntPointerRBTT(i32 noundef %26)
  call void @rBTreeInsert(ptr noundef %22, ptr noundef %27)
  br label %28

28:                                               ; preds = %21
  %29 = load i32, ptr %5, align 4, !tbaa !12
  %30 = add nsw i32 %29, 1
  store i32 %30, ptr %5, align 4, !tbaa !12
  br label %17, !llvm.loop !13

31:                                               ; preds = %20
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #5
  store i32 0, ptr %6, align 4, !tbaa !12
  br label %32

32:                                               ; preds = %62, %31
  %33 = load i32, ptr %6, align 4, !tbaa !12
  %34 = icmp slt i32 %33, 13
  br i1 %34, label %36, label %35

35:                                               ; preds = %32
  call void @llvm.lifetime.end.p0(i64 4, ptr %6) #5
  br label %65

36:                                               ; preds = %32
  %37 = load ptr, ptr %3, align 8, !tbaa !5
  %38 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 0
  %39 = load i32, ptr %6, align 4, !tbaa !12
  %40 = sext i32 %39 to i64
  %41 = getelementptr inbounds i32, ptr %38, i64 %40
  call void @rBTreeDelete(ptr noundef %37, ptr noundef %41)
  %42 = load ptr, ptr %2, align 8, !tbaa !5
  %43 = load ptr, ptr %3, align 8, !tbaa !5
  %44 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 0
  %45 = load i32, ptr %6, align 4, !tbaa !12
  %46 = sext i32 %45 to i64
  %47 = getelementptr inbounds i32, ptr %44, i64 %46
  %48 = call i32 @rBTreeContains(ptr noundef %43, ptr noundef %47)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %42, ptr noundef @.str, i32 noundef 262, ptr noundef null, i32 noundef 0, i32 noundef %48)
  %49 = load ptr, ptr %2, align 8, !tbaa !5
  %50 = load ptr, ptr %3, align 8, !tbaa !5
  %51 = getelementptr inbounds %struct.RBTree, ptr %50, i32 0, i32 0
  %52 = load ptr, ptr %51, align 8, !tbaa !15
  %53 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %52, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %49, ptr noundef @.str, i32 noundef 263, ptr noundef null, i32 noundef 1, i32 noundef %53)
  %54 = load ptr, ptr %2, align 8, !tbaa !5
  %55 = load ptr, ptr %3, align 8, !tbaa !5
  %56 = getelementptr inbounds %struct.RBTree, ptr %55, i32 0, i32 0
  %57 = load ptr, ptr %56, align 8, !tbaa !15
  %58 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %57, i32 noundef 0)
  %59 = icmp eq i32 %58, -1
  %60 = zext i1 %59 to i64
  %61 = select i1 %59, i32 0, i32 1
  call void @CuAssertIntEquals_LineMsg(ptr noundef %54, ptr noundef @.str, i32 noundef 264, ptr noundef null, i32 noundef 1, i32 noundef %61)
  br label %62

62:                                               ; preds = %36
  %63 = load i32, ptr %6, align 4, !tbaa !12
  %64 = add nsw i32 %63, 1
  store i32 %64, ptr %6, align 4, !tbaa !12
  br label %32, !llvm.loop !17

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

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 = distinct !{!13, !14}
!14 = !{!"llvm.loop.mustprogress"}
!15 = !{!16, !6, i64 0}
!16 = !{!"RBTree", !6, i64 0, !11, i64 8, !6, i64 16, !6, i64 24}
!17 = distinct !{!17, !14}


; 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.testRBTreeDelete.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: mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: mustprogress 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) local_unnamed_addr #2

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

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

declare void @destroyRBTree(ptr noundef) local_unnamed_addr #2

; 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

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

; Function Attrs: mustprogress 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

declare void @rBTreeDelete(ptr noundef, ptr noundef) local_unnamed_addr #2

declare i32 @rBTreeContains(ptr noundef, ptr noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeDelete(ptr noundef %0) local_unnamed_addr #0 {
.preheader.preheader:
  %1 = alloca [13 x i32], align 16
  %2 = tail call ptr @redBlackTreeInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersRBTT) #5
  tail call void @rBTreeDelete(ptr noundef null, ptr noundef null) #5
  %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 250, ptr noundef null, i32 noundef -83386157, i32 noundef %4) #5
  tail call void @rBTreeDelete(ptr noundef %2, ptr noundef null) #5
  %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 253, ptr noundef null, i32 noundef -83384987, i32 noundef %6) #5
  call void @llvm.lifetime.start.p0(i64 52, ptr nonnull %1) #5
  call void @llvm.memcpy.p0.p0.i64(ptr noundef nonnull align 16 dereferenceable(52) %1, ptr noundef nonnull align 16 dereferenceable(52) @__const.testRBTreeDelete.valuesArr, i64 52, i1 false)
  %7 = load i32, ptr %1, align 16, !tbaa !12
  %8 = tail call ptr @generateIntPointerRBTT(i32 noundef %7)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %8) #5
  %9 = getelementptr inbounds i8, ptr %1, i64 4
  %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) #5
  %12 = getelementptr inbounds i8, ptr %1, i64 8
  %13 = load i32, ptr %12, align 8, !tbaa !12
  %14 = tail call ptr @generateIntPointerRBTT(i32 noundef %13)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %14) #5
  %15 = getelementptr inbounds i8, ptr %1, i64 12
  %16 = load i32, ptr %15, align 4, !tbaa !12
  %17 = tail call ptr @generateIntPointerRBTT(i32 noundef %16)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %17) #5
  %18 = getelementptr inbounds i8, ptr %1, i64 16
  %19 = load i32, ptr %18, align 16, !tbaa !12
  %20 = tail call ptr @generateIntPointerRBTT(i32 noundef %19)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %20) #5
  %21 = getelementptr inbounds i8, ptr %1, i64 20
  %22 = load i32, ptr %21, align 4, !tbaa !12
  %23 = tail call ptr @generateIntPointerRBTT(i32 noundef %22)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %23) #5
  %24 = getelementptr inbounds i8, ptr %1, i64 24
  %25 = load i32, ptr %24, align 8, !tbaa !12
  %26 = tail call ptr @generateIntPointerRBTT(i32 noundef %25)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %26) #5
  %27 = getelementptr inbounds i8, ptr %1, i64 28
  %28 = load i32, ptr %27, align 4, !tbaa !12
  %29 = tail call ptr @generateIntPointerRBTT(i32 noundef %28)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %29) #5
  %30 = getelementptr inbounds i8, ptr %1, i64 32
  %31 = load i32, ptr %30, align 16, !tbaa !12
  %32 = tail call ptr @generateIntPointerRBTT(i32 noundef %31)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %32) #5
  %33 = getelementptr inbounds i8, ptr %1, i64 36
  %34 = load i32, ptr %33, align 4, !tbaa !12
  %35 = tail call ptr @generateIntPointerRBTT(i32 noundef %34)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %35) #5
  %36 = getelementptr inbounds i8, ptr %1, i64 40
  %37 = load i32, ptr %36, align 8, !tbaa !12
  %38 = tail call ptr @generateIntPointerRBTT(i32 noundef %37)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %38) #5
  %39 = getelementptr inbounds i8, ptr %1, i64 44
  %40 = load i32, ptr %39, align 4, !tbaa !12
  %41 = tail call ptr @generateIntPointerRBTT(i32 noundef %40)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %41) #5
  %42 = getelementptr inbounds i8, ptr %1, i64 48
  %43 = load i32, ptr %42, align 16, !tbaa !12
  %44 = tail call ptr @generateIntPointerRBTT(i32 noundef %43)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %44) #5
  br label %.preheader

45:                                               ; preds = %.preheader
  call void @destroyRBTree(ptr noundef nonnull %2) #5
  call void @llvm.lifetime.end.p0(i64 52, ptr nonnull %1) #5
  ret void

.preheader:                                       ; preds = %.preheader.preheader, %.preheader
  %indvars.iv = phi i64 [ 0, %.preheader.preheader ], [ %indvars.iv.next, %.preheader ]
  %46 = getelementptr inbounds i32, ptr %1, i64 %indvars.iv
  call void @rBTreeDelete(ptr noundef %2, ptr noundef nonnull %46) #5
  %47 = call i32 @rBTreeContains(ptr noundef %2, ptr noundef nonnull %46) #5
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 262, ptr noundef null, i32 noundef 0, i32 noundef %47) #5
  %48 = load ptr, ptr %2, align 8, !tbaa !13
  %49 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %48, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 263, ptr noundef null, i32 noundef 1, i32 noundef %49) #5
  %50 = load ptr, ptr %2, align 8, !tbaa !13
  %51 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %50, i32 noundef 0)
  %52 = icmp ne i32 %51, -1
  %53 = zext i1 %52 to i32
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 264, ptr noundef null, i32 noundef 1, i32 noundef %53) #5
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  %exitcond.not = icmp eq i64 %indvars.iv.next, 13
  br i1 %exitcond.not, label %45, label %.preheader, !llvm.loop !15
}

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 = { mustprogress 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 = { 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 #4 = { mustprogress 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"}


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