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

; 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.BinaryHeap = type { ptr, i32, i32, ptr, ptr }

@.str = external hidden unnamed_addr constant [156 x i8], align 1
@ERROR_TEST = external dso_local global ptr, align 8
@__const.testBinaryHeapDeleteRoot.values = external hidden unnamed_addr constant [10 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerBHT(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 @compareIntPointersBHT1(ptr noundef, ptr noundef) #0

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

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

declare ptr @binaryHeapInitialization(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 @destroyBinaryHeap(ptr noundef) #2

declare void @binaryHeapInsert(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

; Function Attrs: nounwind uwtable
define dso_local void @testBinaryHeapDeleteRoot(ptr noundef %0) #0 {
  %2 = alloca ptr, align 8
  %3 = alloca ptr, align 8
  %4 = alloca ptr, align 8
  %5 = alloca [10 x i32], align 16
  %6 = alloca i32, align 4
  %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 @binaryHeapInitialization(ptr noundef @free, ptr noundef @compareIntPointersBHT1)
  store ptr %8, ptr %3, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %4) #5
  %9 = call ptr @binaryHeapInitialization(ptr noundef @free, ptr noundef @compareIntPointersBHT2)
  store ptr %9, ptr %4, align 8, !tbaa !5
  call void @binaryHeapDeleteRoot(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 182, ptr noundef null, i32 noundef -83386157, i32 noundef %13)
  call void @llvm.lifetime.start.p0(i64 40, ptr %5) #5
  call void @llvm.memcpy.p0.p0.i64(ptr align 16 %5, ptr align 16 @__const.testBinaryHeapDeleteRoot.values, i64 40, i1 false)
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #5
  store i32 0, ptr %6, align 4, !tbaa !12
  br label %14

14:                                               ; preds = %31, %1
  %15 = load i32, ptr %6, align 4, !tbaa !12
  %16 = icmp slt i32 %15, 10
  br i1 %16, label %18, label %17

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

18:                                               ; preds = %14
  %19 = load ptr, ptr %3, align 8, !tbaa !5
  %20 = load i32, ptr %6, align 4, !tbaa !12
  %21 = sext i32 %20 to i64
  %22 = getelementptr inbounds [10 x i32], ptr %5, i64 0, i64 %21
  %23 = load i32, ptr %22, align 4, !tbaa !12
  %24 = call ptr @generateIntPointerBHT(i32 noundef %23)
  call void @binaryHeapInsert(ptr noundef %19, ptr noundef %24)
  %25 = load ptr, ptr %4, align 8, !tbaa !5
  %26 = load i32, ptr %6, align 4, !tbaa !12
  %27 = sext i32 %26 to i64
  %28 = getelementptr inbounds [10 x i32], ptr %5, i64 0, i64 %27
  %29 = load i32, ptr %28, align 4, !tbaa !12
  %30 = call ptr @generateIntPointerBHT(i32 noundef %29)
  call void @binaryHeapInsert(ptr noundef %25, ptr noundef %30)
  br label %31

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

34:                                               ; preds = %17
  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 = %64, %34
  %36 = load i32, ptr %7, align 4, !tbaa !12
  %37 = icmp slt i32 %36, 10
  br i1 %37, label %39, label %38

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

39:                                               ; preds = %35
  %40 = load ptr, ptr %3, align 8, !tbaa !5
  call void @binaryHeapDeleteRoot(ptr noundef %40)
  %41 = load ptr, ptr %4, align 8, !tbaa !5
  call void @binaryHeapDeleteRoot(ptr noundef %41)
  %42 = load ptr, ptr %2, align 8, !tbaa !5
  %43 = load ptr, ptr %3, align 8, !tbaa !5
  %44 = getelementptr inbounds %struct.BinaryHeap, ptr %43, i32 0, i32 0
  %45 = load ptr, ptr %44, align 8, !tbaa !15
  %46 = load ptr, ptr %3, align 8, !tbaa !5
  %47 = getelementptr inbounds %struct.BinaryHeap, ptr %46, i32 0, i32 2
  %48 = load i32, ptr %47, align 4, !tbaa !17
  %49 = load ptr, ptr %3, align 8, !tbaa !5
  %50 = getelementptr inbounds %struct.BinaryHeap, ptr %49, i32 0, i32 4
  %51 = load ptr, ptr %50, align 8, !tbaa !18
  %52 = call i32 @isValidBinaryHeap(ptr noundef %45, i32 noundef 0, i32 noundef %48, ptr noundef %51)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %42, ptr noundef @.str, i32 noundef 197, ptr noundef null, i32 noundef 1, i32 noundef %52)
  %53 = load ptr, ptr %2, align 8, !tbaa !5
  %54 = load ptr, ptr %4, align 8, !tbaa !5
  %55 = getelementptr inbounds %struct.BinaryHeap, ptr %54, i32 0, i32 0
  %56 = load ptr, ptr %55, align 8, !tbaa !15
  %57 = load ptr, ptr %4, align 8, !tbaa !5
  %58 = getelementptr inbounds %struct.BinaryHeap, ptr %57, i32 0, i32 2
  %59 = load i32, ptr %58, align 4, !tbaa !17
  %60 = load ptr, ptr %4, align 8, !tbaa !5
  %61 = getelementptr inbounds %struct.BinaryHeap, ptr %60, i32 0, i32 4
  %62 = load ptr, ptr %61, align 8, !tbaa !18
  %63 = call i32 @isValidBinaryHeap(ptr noundef %56, i32 noundef 0, i32 noundef %59, ptr noundef %62)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %53, ptr noundef @.str, i32 noundef 198, ptr noundef null, i32 noundef 1, i32 noundef %63)
  br label %64

64:                                               ; preds = %39
  %65 = load i32, ptr %7, align 4, !tbaa !12
  %66 = add nsw i32 %65, 1
  store i32 %66, ptr %7, align 4, !tbaa !12
  br label %35, !llvm.loop !19

67:                                               ; preds = %38
  %68 = load ptr, ptr %3, align 8, !tbaa !5
  call void @destroyBinaryHeap(ptr noundef %68)
  %69 = load ptr, ptr %4, align 8, !tbaa !5
  call void @destroyBinaryHeap(ptr noundef %69)
  call void @llvm.lifetime.end.p0(i64 40, ptr %5) #5
  call void @llvm.lifetime.end.p0(i64 8, ptr %4) #5
  call void @llvm.lifetime.end.p0(i64 8, ptr %3) #5
  ret void
}

declare void @binaryHeapDeleteRoot(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 = !{!"BinaryHeap", !6, i64 0, !11, i64 8, !11, i64 12, !6, i64 16, !6, i64 24}
!17 = !{!16, !11, i64 12}
!18 = !{!16, !6, i64 24}
!19 = distinct !{!19, !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 [156 x i8], align 1
@ERROR_TEST = external dso_local local_unnamed_addr global ptr, align 8
@__const.testBinaryHeapDeleteRoot.values = external hidden unnamed_addr constant [10 x i32], align 16

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

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

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

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

declare ptr @binaryHeapInitialization(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 @destroyBinaryHeap(ptr noundef) local_unnamed_addr #1

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

; Function Attrs: nounwind uwtable
define dso_local void @testBinaryHeapDeleteRoot(ptr noundef %0) local_unnamed_addr #0 {
.preheader:
  %1 = tail call ptr @binaryHeapInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersBHT1) #3
  %2 = tail call ptr @binaryHeapInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersBHT2) #3
  tail call void @binaryHeapDeleteRoot(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 182, ptr noundef null, i32 noundef -83386157, i32 noundef %4) #3
  %5 = load i32, ptr @__const.testBinaryHeapDeleteRoot.values, align 16, !tbaa !12
  %6 = tail call ptr @generateIntPointerBHT(i32 noundef %5)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %6) #3
  %7 = tail call ptr @generateIntPointerBHT(i32 noundef %5)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %7) #3
  %8 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 4), align 4, !tbaa !12
  %9 = tail call ptr @generateIntPointerBHT(i32 noundef %8)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %9) #3
  %10 = tail call ptr @generateIntPointerBHT(i32 noundef %8)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %10) #3
  %11 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 8), align 8, !tbaa !12
  %12 = tail call ptr @generateIntPointerBHT(i32 noundef %11)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %12) #3
  %13 = tail call ptr @generateIntPointerBHT(i32 noundef %11)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %13) #3
  %14 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 12), align 4, !tbaa !12
  %15 = tail call ptr @generateIntPointerBHT(i32 noundef %14)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %15) #3
  %16 = tail call ptr @generateIntPointerBHT(i32 noundef %14)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %16) #3
  %17 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 16), align 16, !tbaa !12
  %18 = tail call ptr @generateIntPointerBHT(i32 noundef %17)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %18) #3
  %19 = tail call ptr @generateIntPointerBHT(i32 noundef %17)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %19) #3
  %20 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 20), align 4, !tbaa !12
  %21 = tail call ptr @generateIntPointerBHT(i32 noundef %20)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %21) #3
  %22 = tail call ptr @generateIntPointerBHT(i32 noundef %20)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %22) #3
  %23 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 24), align 8, !tbaa !12
  %24 = tail call ptr @generateIntPointerBHT(i32 noundef %23)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %24) #3
  %25 = tail call ptr @generateIntPointerBHT(i32 noundef %23)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %25) #3
  %26 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 28), align 4, !tbaa !12
  %27 = tail call ptr @generateIntPointerBHT(i32 noundef %26)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %27) #3
  %28 = tail call ptr @generateIntPointerBHT(i32 noundef %26)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %28) #3
  %29 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 32), align 16, !tbaa !12
  %30 = tail call ptr @generateIntPointerBHT(i32 noundef %29)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %30) #3
  %31 = tail call ptr @generateIntPointerBHT(i32 noundef %29)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %31) #3
  %32 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testBinaryHeapDeleteRoot.values, i64 36), align 4, !tbaa !12
  %33 = tail call ptr @generateIntPointerBHT(i32 noundef %32)
  tail call void @binaryHeapInsert(ptr noundef %1, ptr noundef %33) #3
  %34 = tail call ptr @generateIntPointerBHT(i32 noundef %32)
  tail call void @binaryHeapInsert(ptr noundef %2, ptr noundef %34) #3
  %35 = getelementptr inbounds i8, ptr %1, i64 12
  %36 = getelementptr inbounds i8, ptr %1, i64 24
  %37 = getelementptr inbounds i8, ptr %2, i64 12
  %38 = getelementptr inbounds i8, ptr %2, i64 24
  br label %40

39:                                               ; preds = %40
  tail call void @destroyBinaryHeap(ptr noundef nonnull %1) #3
  tail call void @destroyBinaryHeap(ptr noundef nonnull %2) #3
  ret void

40:                                               ; preds = %.preheader, %40
  %.022 = phi i32 [ 0, %.preheader ], [ %49, %40 ]
  tail call void @binaryHeapDeleteRoot(ptr noundef %1) #3
  tail call void @binaryHeapDeleteRoot(ptr noundef %2) #3
  %41 = load ptr, ptr %1, align 8, !tbaa !13
  %42 = load i32, ptr %35, align 4, !tbaa !15
  %43 = load ptr, ptr %36, align 8, !tbaa !16
  %44 = tail call i32 @isValidBinaryHeap(ptr noundef %41, i32 noundef 0, i32 noundef %42, ptr noundef %43)
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 197, ptr noundef null, i32 noundef 1, i32 noundef %44) #3
  %45 = load ptr, ptr %2, align 8, !tbaa !13
  %46 = load i32, ptr %37, align 4, !tbaa !15
  %47 = load ptr, ptr %38, align 8, !tbaa !16
  %48 = tail call i32 @isValidBinaryHeap(ptr noundef %45, i32 noundef 0, i32 noundef %46, ptr noundef %47)
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 198, ptr noundef null, i32 noundef 1, i32 noundef %48) #3
  %49 = add nuw nsw i32 %.022, 1
  %exitcond.not = icmp eq i32 %49, 10
  br i1 %exitcond.not, label %39, label %40, !llvm.loop !17
}

declare void @binaryHeapDeleteRoot(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 = !{!"BinaryHeap", !6, i64 0, !11, i64 8, !11, i64 12, !6, i64 16, !6, i64 24}
!15 = !{!14, !11, i64 12}
!16 = !{!14, !6, i64 24}
!17 = distinct !{!17, !18}
!18 = !{!"llvm.loop.mustprogress"}


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