; 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.testRBTreeDeleteWtoFr.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 i32 @rBTreeContains(ptr noundef, ptr noundef) #2

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

20:                                               ; preds = %31, %1
  %21 = load i32, ptr %5, align 4, !tbaa !12
  %22 = icmp slt i32 %21, 13
  br i1 %22, label %24, label %23

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

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

31:                                               ; preds = %24
  %32 = load i32, ptr %5, align 4, !tbaa !12
  %33 = add nsw i32 %32, 1
  store i32 %33, ptr %5, align 4, !tbaa !12
  br label %20, !llvm.loop !13

34:                                               ; preds = %23
  call void @llvm.lifetime.start.p0(i64 8, ptr %6) #5
  call void @llvm.lifetime.start.p0(i64 4, ptr %7) #5
  store i32 0, ptr %7, align 4, !tbaa !12
  br label %35

35:                                               ; preds = %74, %34
  %36 = load i32, ptr %7, align 4, !tbaa !12
  %37 = icmp slt i32 %36, 13
  br i1 %37, label %39, label %38

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

39:                                               ; preds = %35
  %40 = load ptr, ptr %3, align 8, !tbaa !5
  %41 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 0
  %42 = load i32, ptr %7, align 4, !tbaa !12
  %43 = sext i32 %42 to i64
  %44 = getelementptr inbounds i32, ptr %41, i64 %43
  %45 = call ptr @rBTreeDeleteWtoFr(ptr noundef %40, ptr noundef %44)
  store ptr %45, ptr %6, align 8, !tbaa !5
  %46 = load ptr, ptr %2, align 8, !tbaa !5
  %47 = load i32, ptr %7, align 4, !tbaa !12
  %48 = sext i32 %47 to i64
  %49 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 %48
  %50 = load i32, ptr %49, align 4, !tbaa !12
  %51 = load ptr, ptr %6, align 8, !tbaa !5
  %52 = load i32, ptr %51, align 4, !tbaa !12
  call void @CuAssertIntEquals_LineMsg(ptr noundef %46, ptr noundef @.str, i32 noundef 293, ptr noundef null, i32 noundef %50, i32 noundef %52)
  %53 = load ptr, ptr %2, align 8, !tbaa !5
  %54 = load ptr, ptr %3, align 8, !tbaa !5
  %55 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 0
  %56 = load i32, ptr %7, align 4, !tbaa !12
  %57 = sext i32 %56 to i64
  %58 = getelementptr inbounds i32, ptr %55, i64 %57
  %59 = call i32 @rBTreeContains(ptr noundef %54, ptr noundef %58)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %53, ptr noundef @.str, i32 noundef 294, ptr noundef null, i32 noundef 0, i32 noundef %59)
  %60 = load ptr, ptr %2, align 8, !tbaa !5
  %61 = load ptr, ptr %3, align 8, !tbaa !5
  %62 = getelementptr inbounds %struct.RBTree, ptr %61, i32 0, i32 0
  %63 = load ptr, ptr %62, align 8, !tbaa !15
  %64 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %63, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %60, ptr noundef @.str, i32 noundef 295, ptr noundef null, i32 noundef 1, i32 noundef %64)
  %65 = load ptr, ptr %2, align 8, !tbaa !5
  %66 = load ptr, ptr %3, align 8, !tbaa !5
  %67 = getelementptr inbounds %struct.RBTree, ptr %66, i32 0, i32 0
  %68 = load ptr, ptr %67, align 8, !tbaa !15
  %69 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %68, i32 noundef 0)
  %70 = icmp eq i32 %69, -1
  %71 = zext i1 %70 to i64
  %72 = select i1 %70, i32 0, i32 1
  call void @CuAssertIntEquals_LineMsg(ptr noundef %65, ptr noundef @.str, i32 noundef 296, ptr noundef null, i32 noundef 1, i32 noundef %72)
  %73 = load ptr, ptr %6, align 8, !tbaa !5
  call void @free(ptr noundef %73) #5
  br label %74

74:                                               ; preds = %39
  %75 = load i32, ptr %7, align 4, !tbaa !12
  %76 = add nsw i32 %75, 1
  store i32 %76, ptr %7, align 4, !tbaa !12
  br label %35, !llvm.loop !17

77:                                               ; preds = %38
  %78 = load ptr, ptr %3, align 8, !tbaa !5
  call void @destroyRBTree(ptr noundef %78)
  call void @llvm.lifetime.end.p0(i64 8, ptr %6) #5
  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 ptr @rBTreeDeleteWtoFr(ptr noundef, ptr noundef) #2

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.testRBTreeDeleteWtoFr.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 i32 @rBTreeContains(ptr noundef, ptr noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeDeleteWtoFr(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
  %3 = tail call ptr @rBTreeDeleteWtoFr(ptr noundef null, ptr noundef null) #5
  %4 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %5 = load i32, ptr %4, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 278, ptr noundef null, i32 noundef -83386157, i32 noundef %5) #5
  %6 = tail call ptr @rBTreeDeleteWtoFr(ptr noundef %2, ptr noundef null) #5
  %7 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %8 = load i32, ptr %7, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 281, ptr noundef null, i32 noundef -83384987, i32 noundef %8) #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.testRBTreeDeleteWtoFr.valuesArr, i64 52, i1 false)
  %9 = load i32, ptr %1, align 16, !tbaa !12
  %10 = tail call ptr @generateIntPointerRBTT(i32 noundef %9)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %10) #5
  %11 = getelementptr inbounds i8, ptr %1, i64 4
  %12 = load i32, ptr %11, align 4, !tbaa !12
  %13 = tail call ptr @generateIntPointerRBTT(i32 noundef %12)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %13) #5
  %14 = getelementptr inbounds i8, ptr %1, i64 8
  %15 = load i32, ptr %14, align 8, !tbaa !12
  %16 = tail call ptr @generateIntPointerRBTT(i32 noundef %15)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %16) #5
  %17 = getelementptr inbounds i8, ptr %1, i64 12
  %18 = load i32, ptr %17, align 4, !tbaa !12
  %19 = tail call ptr @generateIntPointerRBTT(i32 noundef %18)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %19) #5
  %20 = getelementptr inbounds i8, ptr %1, i64 16
  %21 = load i32, ptr %20, align 16, !tbaa !12
  %22 = tail call ptr @generateIntPointerRBTT(i32 noundef %21)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %22) #5
  %23 = getelementptr inbounds i8, ptr %1, i64 20
  %24 = load i32, ptr %23, align 4, !tbaa !12
  %25 = tail call ptr @generateIntPointerRBTT(i32 noundef %24)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %25) #5
  %26 = getelementptr inbounds i8, ptr %1, i64 24
  %27 = load i32, ptr %26, align 8, !tbaa !12
  %28 = tail call ptr @generateIntPointerRBTT(i32 noundef %27)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %28) #5
  %29 = getelementptr inbounds i8, ptr %1, i64 28
  %30 = load i32, ptr %29, align 4, !tbaa !12
  %31 = tail call ptr @generateIntPointerRBTT(i32 noundef %30)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %31) #5
  %32 = getelementptr inbounds i8, ptr %1, i64 32
  %33 = load i32, ptr %32, align 16, !tbaa !12
  %34 = tail call ptr @generateIntPointerRBTT(i32 noundef %33)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %34) #5
  %35 = getelementptr inbounds i8, ptr %1, i64 36
  %36 = load i32, ptr %35, align 4, !tbaa !12
  %37 = tail call ptr @generateIntPointerRBTT(i32 noundef %36)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %37) #5
  %38 = getelementptr inbounds i8, ptr %1, i64 40
  %39 = load i32, ptr %38, align 8, !tbaa !12
  %40 = tail call ptr @generateIntPointerRBTT(i32 noundef %39)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %40) #5
  %41 = getelementptr inbounds i8, ptr %1, i64 44
  %42 = load i32, ptr %41, align 4, !tbaa !12
  %43 = tail call ptr @generateIntPointerRBTT(i32 noundef %42)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %43) #5
  %44 = getelementptr inbounds i8, ptr %1, i64 48
  %45 = load i32, ptr %44, align 16, !tbaa !12
  %46 = tail call ptr @generateIntPointerRBTT(i32 noundef %45)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %46) #5
  br label %.preheader

47:                                               ; 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 ]
  %48 = getelementptr inbounds i32, ptr %1, i64 %indvars.iv
  %49 = call ptr @rBTreeDeleteWtoFr(ptr noundef %2, ptr noundef nonnull %48) #5
  %50 = load i32, ptr %48, align 4, !tbaa !12
  %51 = load i32, ptr %49, align 4, !tbaa !12
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 293, ptr noundef null, i32 noundef %50, i32 noundef %51) #5
  %52 = call i32 @rBTreeContains(ptr noundef %2, ptr noundef nonnull %48) #5
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 294, ptr noundef null, i32 noundef 0, i32 noundef %52) #5
  %53 = load ptr, ptr %2, align 8, !tbaa !13
  %54 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %53, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 295, ptr noundef null, i32 noundef 1, i32 noundef %54) #5
  %55 = load ptr, ptr %2, align 8, !tbaa !13
  %56 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %55, i32 noundef 0)
  %57 = icmp ne i32 %56, -1
  %58 = zext i1 %57 to i32
  call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 296, ptr noundef null, i32 noundef 1, i32 noundef %58) #5
  call void @free(ptr noundef %49) #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 %47, label %.preheader, !llvm.loop !15
}

declare ptr @rBTreeDeleteWtoFr(ptr noundef, ptr noundef) local_unnamed_addr #2

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