; LLVM IR from MostafaTwfiq/C-DataStructures-And-Algorithms :: DataStructure/Graphs/Sources (UndirectedGraph)

; 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.UndirectedGraph = type { ptr, ptr, ptr }
%struct.UDGraphNode = type { ptr, ptr, ptr, ptr }
%struct.UDGraphEdge = type { ptr, i32 }

@stderr = external global ptr, align 8
@.str = external hidden unnamed_addr constant [42 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [32 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [6 x i8], align 1
@.str.7 = external hidden unnamed_addr constant [31 x i8], align 1
@.str.16 = external hidden unnamed_addr constant [23 x i8], align 1
@.str.21 = external hidden unnamed_addr constant [20 x i8], align 1

; Function Attrs: nounwind uwtable
declare dso_local void @UDGraphNodeFreeFun(ptr 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: nounwind
declare void @free(ptr noundef) #2

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

; Function Attrs: nounwind
declare i32 @fprintf(ptr noundef, ptr noundef, ...) #2

; Function Attrs: noreturn nounwind
declare void @exit(i32 noundef) #3

; Function Attrs: nounwind allocsize(0)
declare noalias ptr @malloc(i64 noundef) #4

declare ptr @hashMapGet(ptr noundef, ptr noundef) #5

declare ptr @arrayListGet(ptr noundef, i32 noundef) #5

declare i32 @arrayListGetLength(ptr noundef) #5

; Function Attrs: nounwind uwtable
declare dso_local void @UDGFreeUintptr_t(ptr noundef) #0

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

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

declare ptr @hashSetInitialization(ptr noundef, ptr noundef, ptr noundef) #5

declare void @hashSetInsert(ptr noundef, ptr noundef) #5

declare i32 @hashSetContains(ptr noundef, ptr noundef) #5

declare void @destroyHashSet(ptr noundef) #5

; Function Attrs: nounwind uwtable
define dso_local void @UDGraphBreadthFirstTraversal(ptr noundef %0, ptr noundef %1, ptr noundef %2) #0 {
  %4 = alloca ptr, align 8
  %5 = alloca ptr, align 8
  %6 = alloca ptr, align 8
  %7 = alloca ptr, align 8
  %8 = alloca ptr, align 8
  %9 = alloca ptr, align 8
  %10 = alloca ptr, align 8
  %11 = alloca ptr, align 8
  %12 = alloca i32, align 4
  %13 = alloca ptr, align 8
  %14 = alloca ptr, align 8
  store ptr %0, ptr %4, align 8, !tbaa !5
  store ptr %1, ptr %5, align 8, !tbaa !5
  store ptr %2, ptr %6, align 8, !tbaa !5
  %15 = load ptr, ptr %4, align 8, !tbaa !5
  %16 = icmp eq ptr %15, null
  br i1 %16, label %17, label %20

17:                                               ; preds = %3
  %18 = load ptr, ptr @stderr, align 8, !tbaa !5
  %19 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %18, ptr noundef @.str.7, ptr noundef @.str.6, ptr noundef @.str.2) #6
  call void @exit(i32 noundef -83386157) #7
  unreachable

20:                                               ; preds = %3
  %21 = load ptr, ptr %5, align 8, !tbaa !5
  %22 = icmp eq ptr %21, null
  br i1 %22, label %23, label %26

23:                                               ; preds = %20
  %24 = load ptr, ptr @stderr, align 8, !tbaa !5
  %25 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %24, ptr noundef @.str, ptr noundef @.str.21, ptr noundef @.str.2) #6
  call void @exit(i32 noundef -83384987) #7
  unreachable

26:                                               ; preds = %20
  %27 = load ptr, ptr %6, align 8, !tbaa !5
  %28 = icmp eq ptr %27, null
  br i1 %28, label %29, label %32

29:                                               ; preds = %26
  %30 = load ptr, ptr @stderr, align 8, !tbaa !5
  %31 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %30, ptr noundef @.str, ptr noundef @.str.16, ptr noundef @.str.2) #6
  call void @exit(i32 noundef -83384987) #7
  unreachable

32:                                               ; preds = %26
  br label %33

33:                                               ; preds = %32
  br label %34

34:                                               ; preds = %33
  call void @llvm.lifetime.start.p0(i64 8, ptr %7) #6
  %35 = load ptr, ptr %4, align 8, !tbaa !5
  %36 = getelementptr inbounds %struct.UndirectedGraph, ptr %35, i32 0, i32 0
  %37 = load ptr, ptr %36, align 8, !tbaa !9
  %38 = load ptr, ptr %5, align 8, !tbaa !5
  %39 = call ptr @hashMapGet(ptr noundef %37, ptr noundef %38)
  store ptr %39, ptr %7, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %8) #6
  %40 = call ptr @queueInitialization(ptr noundef @UDGraphNodeFreeFun)
  store ptr %40, ptr %8, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %9) #6
  %41 = call ptr @hashSetInitialization(ptr noundef @UDGFreeUintptr_t, ptr noundef @UDGCompUintptr_t, ptr noundef @uintptr_tHashFunUDirG)
  store ptr %41, ptr %9, align 8, !tbaa !5
  %42 = load ptr, ptr %8, align 8, !tbaa !5
  %43 = load ptr, ptr %7, align 8, !tbaa !5
  call void @queueEnqueue(ptr noundef %42, ptr noundef %43)
  call void @llvm.lifetime.start.p0(i64 8, ptr %10) #6
  %44 = call noalias ptr @malloc(i64 noundef 8) #8
  store ptr %44, ptr %10, align 8, !tbaa !5
  %45 = load ptr, ptr %7, align 8, !tbaa !5
  %46 = getelementptr inbounds %struct.UDGraphNode, ptr %45, i32 0, i32 0
  %47 = load ptr, ptr %46, align 8, !tbaa !11
  %48 = ptrtoint ptr %47 to i64
  %49 = load ptr, ptr %10, align 8, !tbaa !5
  store i64 %48, ptr %49, align 8, !tbaa !13
  %50 = load ptr, ptr %9, align 8, !tbaa !5
  %51 = load ptr, ptr %10, align 8, !tbaa !5
  call void @hashSetInsert(ptr noundef %50, ptr noundef %51)
  br label %52

52:                                               ; preds = %101, %34
  %53 = load ptr, ptr %8, align 8, !tbaa !5
  %54 = call i32 @queueIsEmpty(ptr noundef %53)
  %55 = icmp ne i32 %54, 0
  %56 = xor i1 %55, true
  br i1 %56, label %57, label %102

57:                                               ; preds = %52
  call void @llvm.lifetime.start.p0(i64 8, ptr %11) #6
  %58 = load ptr, ptr %8, align 8, !tbaa !5
  %59 = call ptr @queueDequeue(ptr noundef %58)
  store ptr %59, ptr %11, align 8, !tbaa !5
  %60 = load ptr, ptr %6, align 8, !tbaa !5
  %61 = load ptr, ptr %11, align 8, !tbaa !5
  %62 = getelementptr inbounds %struct.UDGraphNode, ptr %61, i32 0, i32 0
  %63 = load ptr, ptr %62, align 8, !tbaa !11
  call void %60(ptr noundef %63)
  call void @llvm.lifetime.start.p0(i64 4, ptr %12) #6
  store i32 0, ptr %12, align 4, !tbaa !15
  br label %64

64:                                               ; preds = %98, %57
  %65 = load i32, ptr %12, align 4, !tbaa !15
  %66 = load ptr, ptr %11, align 8, !tbaa !5
  %67 = getelementptr inbounds %struct.UDGraphNode, ptr %66, i32 0, i32 1
  %68 = load ptr, ptr %67, align 8, !tbaa !17
  %69 = call i32 @arrayListGetLength(ptr noundef %68)
  %70 = icmp slt i32 %65, %69
  br i1 %70, label %72, label %71

71:                                               ; preds = %64
  call void @llvm.lifetime.end.p0(i64 4, ptr %12) #6
  br label %101

72:                                               ; preds = %64
  call void @llvm.lifetime.start.p0(i64 8, ptr %13) #6
  %73 = load ptr, ptr %11, align 8, !tbaa !5
  %74 = getelementptr inbounds %struct.UDGraphNode, ptr %73, i32 0, i32 1
  %75 = load ptr, ptr %74, align 8, !tbaa !17
  %76 = load i32, ptr %12, align 4, !tbaa !15
  %77 = call ptr @arrayListGet(ptr noundef %75, i32 noundef %76)
  %78 = getelementptr inbounds %struct.UDGraphEdge, ptr %77, i32 0, i32 0
  %79 = load ptr, ptr %78, align 8, !tbaa !18
  store ptr %79, ptr %13, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %14) #6
  %80 = call noalias ptr @malloc(i64 noundef 8) #8
  store ptr %80, ptr %14, align 8, !tbaa !5
  %81 = load ptr, ptr %13, align 8, !tbaa !5
  %82 = getelementptr inbounds %struct.UDGraphNode, ptr %81, i32 0, i32 0
  %83 = load ptr, ptr %82, align 8, !tbaa !11
  %84 = ptrtoint ptr %83 to i64
  %85 = load ptr, ptr %14, align 8, !tbaa !5
  store i64 %84, ptr %85, align 8, !tbaa !13
  %86 = load ptr, ptr %9, align 8, !tbaa !5
  %87 = load ptr, ptr %14, align 8, !tbaa !5
  %88 = call i32 @hashSetContains(ptr noundef %86, ptr noundef %87)
  %89 = icmp ne i32 %88, 0
  br i1 %89, label %95, label %90

90:                                               ; preds = %72
  %91 = load ptr, ptr %8, align 8, !tbaa !5
  %92 = load ptr, ptr %13, align 8, !tbaa !5
  call void @queueEnqueue(ptr noundef %91, ptr noundef %92)
  %93 = load ptr, ptr %9, align 8, !tbaa !5
  %94 = load ptr, ptr %14, align 8, !tbaa !5
  call void @hashSetInsert(ptr noundef %93, ptr noundef %94)
  br label %97

95:                                               ; preds = %72
  %96 = load ptr, ptr %14, align 8, !tbaa !5
  call void @free(ptr noundef %96) #6
  br label %97

97:                                               ; preds = %95, %90
  call void @llvm.lifetime.end.p0(i64 8, ptr %14) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %13) #6
  br label %98

98:                                               ; preds = %97
  %99 = load i32, ptr %12, align 4, !tbaa !15
  %100 = add nsw i32 %99, 1
  store i32 %100, ptr %12, align 4, !tbaa !15
  br label %64, !llvm.loop !20

101:                                              ; preds = %71
  call void @llvm.lifetime.end.p0(i64 8, ptr %11) #6
  br label %52, !llvm.loop !22

102:                                              ; preds = %52
  %103 = load ptr, ptr %8, align 8, !tbaa !5
  call void @destroyQueue(ptr noundef %103)
  %104 = load ptr, ptr %9, align 8, !tbaa !5
  call void @destroyHashSet(ptr noundef %104)
  call void @llvm.lifetime.end.p0(i64 8, ptr %10) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %9) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %8) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %7) #6
  ret void
}

declare ptr @queueInitialization(ptr noundef) #5

declare void @queueEnqueue(ptr noundef, ptr noundef) #5

declare i32 @queueIsEmpty(ptr noundef) #5

declare ptr @queueDequeue(ptr noundef) #5

declare void @destroyQueue(ptr noundef) #5

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 = { 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 #3 = { noreturn 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 = { nounwind allocsize(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 #5 = { "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 #6 = { nounwind }
attributes #7 = { noreturn nounwind }
attributes #8 = { nounwind allocsize(0) }

!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, !6, i64 0}
!10 = !{!"UndirectedGraph", !6, i64 0, !6, i64 8, !6, i64 16}
!11 = !{!12, !6, i64 0}
!12 = !{!"UDGraphNode", !6, i64 0, !6, i64 8, !6, i64 16, !6, i64 24}
!13 = !{!14, !14, i64 0}
!14 = !{!"long", !7, i64 0}
!15 = !{!16, !16, i64 0}
!16 = !{!"int", !7, i64 0}
!17 = !{!12, !6, i64 8}
!18 = !{!19, !6, i64 0}
!19 = !{!"UDGraphEdge", !6, i64 0, !16, i64 8}
!20 = distinct !{!20, !21}
!21 = !{!"llvm.loop.mustprogress"}
!22 = distinct !{!22, !21}


; 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"

@stderr = external local_unnamed_addr global ptr, align 8
@.str = external hidden unnamed_addr constant [42 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [32 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [6 x i8], align 1
@.str.7 = external hidden unnamed_addr constant [31 x i8], align 1
@.str.16 = external hidden unnamed_addr constant [23 x i8], align 1
@.str.21 = external hidden unnamed_addr constant [20 x i8], align 1

; Function Attrs: nounwind uwtable
declare dso_local void @UDGraphNodeFreeFun(ptr noundef) #0

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

; Function Attrs: nofree nounwind
declare noundef i32 @fprintf(ptr nocapture noundef, ptr nocapture noundef readonly, ...) local_unnamed_addr #2

; Function Attrs: noreturn nounwind
declare void @exit(i32 noundef) local_unnamed_addr #3

; Function Attrs: mustprogress nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(inaccessiblemem: readwrite)
declare noalias noundef ptr @malloc(i64 noundef) local_unnamed_addr #4

declare ptr @hashMapGet(ptr noundef, ptr noundef) local_unnamed_addr #5

declare ptr @arrayListGet(ptr noundef, i32 noundef) local_unnamed_addr #5

declare i32 @arrayListGetLength(ptr noundef) local_unnamed_addr #5

; Function Attrs: nounwind uwtable
declare dso_local void @UDGFreeUintptr_t(ptr noundef) #0

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

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

declare ptr @hashSetInitialization(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #5

declare void @hashSetInsert(ptr noundef, ptr noundef) local_unnamed_addr #5

declare i32 @hashSetContains(ptr noundef, ptr noundef) local_unnamed_addr #5

declare void @destroyHashSet(ptr noundef) local_unnamed_addr #5

; Function Attrs: nounwind uwtable
define dso_local void @UDGraphBreadthFirstTraversal(ptr noundef readonly %0, ptr noundef %1, ptr noundef readonly %2) local_unnamed_addr #0 {
  %4 = icmp eq ptr %0, null
  br i1 %4, label %5, label %8

5:                                                ; preds = %3
  %6 = load ptr, ptr @stderr, align 8, !tbaa !5
  %7 = tail call i32 (ptr, ptr, ...) @fprintf(ptr noundef %6, ptr noundef nonnull @.str.7, ptr noundef nonnull @.str.6, ptr noundef nonnull @.str.2) #6
  tail call void @exit(i32 noundef -83386157) #7
  unreachable

8:                                                ; preds = %3
  %9 = icmp eq ptr %1, null
  br i1 %9, label %10, label %13

10:                                               ; preds = %8
  %11 = load ptr, ptr @stderr, align 8, !tbaa !5
  %12 = tail call i32 (ptr, ptr, ...) @fprintf(ptr noundef %11, ptr noundef nonnull @.str, ptr noundef nonnull @.str.21, ptr noundef nonnull @.str.2) #6
  tail call void @exit(i32 noundef -83384987) #7
  unreachable

13:                                               ; preds = %8
  %14 = icmp eq ptr %2, null
  br i1 %14, label %15, label %18

15:                                               ; preds = %13
  %16 = load ptr, ptr @stderr, align 8, !tbaa !5
  %17 = tail call i32 (ptr, ptr, ...) @fprintf(ptr noundef %16, ptr noundef nonnull @.str, ptr noundef nonnull @.str.16, ptr noundef nonnull @.str.2) #6
  tail call void @exit(i32 noundef -83384987) #7
  unreachable

18:                                               ; preds = %13
  %19 = load ptr, ptr %0, align 8, !tbaa !9
  %20 = tail call ptr @hashMapGet(ptr noundef %19, ptr noundef nonnull %1) #8
  %21 = tail call ptr @queueInitialization(ptr noundef nonnull @UDGraphNodeFreeFun) #8
  %22 = tail call ptr @hashSetInitialization(ptr noundef nonnull @UDGFreeUintptr_t, ptr noundef nonnull @UDGCompUintptr_t, ptr noundef nonnull @uintptr_tHashFunUDirG) #8
  tail call void @queueEnqueue(ptr noundef %21, ptr noundef %20) #8
  %23 = tail call noalias dereferenceable_or_null(8) ptr @malloc(i64 noundef 8) #9
  %24 = load ptr, ptr %20, align 8, !tbaa !11
  %25 = ptrtoint ptr %24 to i64
  store i64 %25, ptr %23, align 8, !tbaa !13
  tail call void @hashSetInsert(ptr noundef %22, ptr noundef nonnull %23) #8
  %26 = tail call i32 @queueIsEmpty(ptr noundef %21) #8
  %.not35 = icmp eq i32 %26, 0
  br i1 %.not35, label %.lr.ph36, label %._crit_edge

.loopexit:                                        ; preds = %43, %.lr.ph36
  %27 = tail call i32 @queueIsEmpty(ptr noundef %21) #8
  %.not = icmp eq i32 %27, 0
  br i1 %.not, label %.lr.ph36, label %._crit_edge, !llvm.loop !15

.lr.ph36:                                         ; preds = %18, %.loopexit
  %28 = tail call ptr @queueDequeue(ptr noundef %21) #8
  %29 = load ptr, ptr %28, align 8, !tbaa !11
  tail call void %2(ptr noundef %29) #8
  %30 = getelementptr inbounds i8, ptr %28, i64 8
  %31 = load ptr, ptr %30, align 8, !tbaa !17
  %32 = tail call i32 @arrayListGetLength(ptr noundef %31) #8
  %33 = icmp sgt i32 %32, 0
  br i1 %33, label %.lr.ph, label %.loopexit

.lr.ph:                                           ; preds = %.lr.ph36, %43
  %.034 = phi i32 [ %44, %43 ], [ 0, %.lr.ph36 ]
  %34 = load ptr, ptr %30, align 8, !tbaa !17
  %35 = tail call ptr @arrayListGet(ptr noundef %34, i32 noundef %.034) #8
  %36 = load ptr, ptr %35, align 8, !tbaa !18
  %37 = tail call noalias dereferenceable_or_null(8) ptr @malloc(i64 noundef 8) #9
  %38 = load ptr, ptr %36, align 8, !tbaa !11
  %39 = ptrtoint ptr %38 to i64
  store i64 %39, ptr %37, align 8, !tbaa !13
  %40 = tail call i32 @hashSetContains(ptr noundef %22, ptr noundef nonnull %37) #8
  %.not33 = icmp eq i32 %40, 0
  br i1 %.not33, label %41, label %42

41:                                               ; preds = %.lr.ph
  tail call void @queueEnqueue(ptr noundef %21, ptr noundef nonnull %36) #8
  tail call void @hashSetInsert(ptr noundef %22, ptr noundef nonnull %37) #8
  br label %43

42:                                               ; preds = %.lr.ph
  tail call void @free(ptr noundef nonnull %37) #8
  br label %43

43:                                               ; preds = %42, %41
  %44 = add nuw nsw i32 %.034, 1
  %45 = load ptr, ptr %30, align 8, !tbaa !17
  %46 = tail call i32 @arrayListGetLength(ptr noundef %45) #8
  %47 = icmp slt i32 %44, %46
  br i1 %47, label %.lr.ph, label %.loopexit, !llvm.loop !21

._crit_edge:                                      ; preds = %.loopexit, %18
  tail call void @destroyQueue(ptr noundef %21) #8
  tail call void @destroyHashSet(ptr noundef %22) #8
  ret void
}

declare ptr @queueInitialization(ptr noundef) local_unnamed_addr #5

declare void @queueEnqueue(ptr noundef, ptr noundef) local_unnamed_addr #5

declare i32 @queueIsEmpty(ptr noundef) local_unnamed_addr #5

declare ptr @queueDequeue(ptr noundef) local_unnamed_addr #5

declare void @destroyQueue(ptr noundef) local_unnamed_addr #5

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 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 #2 = { nofree 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 #3 = { noreturn 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 = { mustprogress nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(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 #5 = { "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 #6 = { cold nounwind }
attributes #7 = { noreturn nounwind }
attributes #8 = { nounwind }
attributes #9 = { nounwind allocsize(0) }

!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, !6, i64 0}
!10 = !{!"UndirectedGraph", !6, i64 0, !6, i64 8, !6, i64 16}
!11 = !{!12, !6, i64 0}
!12 = !{!"UDGraphNode", !6, i64 0, !6, i64 8, !6, i64 16, !6, i64 24}
!13 = !{!14, !14, i64 0}
!14 = !{!"long", !7, i64 0}
!15 = distinct !{!15, !16}
!16 = !{!"llvm.loop.mustprogress"}
!17 = !{!12, !6, i64 8}
!18 = !{!19, !6, i64 0}
!19 = !{!"UDGraphEdge", !6, i64 0, !20, i64 8}
!20 = !{!"int", !7, i64 0}
!21 = distinct !{!21, !16}


; Effective O3 passes: CorrelatedValuePropagationPass,EarlyCSEPass,GlobalOptPass,InferFunctionAttrsPass,InstCombinePass,JumpThreadingPass,LICMPass,LoopRotatePass,LoopSimplifyPass,LoopUnrollPass,PostOrderFunctionAttrsPass,SROAPass,SimplifyCFGPass,TailCallElimPass