; LLVM IR from MostafaTwfiq/C-DataStructures-And-Algorithms :: Algorithms/Sorting/Sources (CountingSort)

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

@stderr = external global ptr, align 8
@.str = external hidden unnamed_addr constant [31 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [14 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [42 x i8], align 1
@.str.4 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [20 x i8], align 1

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

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

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

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

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

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

21:                                               ; preds = %4
  %22 = load ptr, ptr @stderr, align 8, !tbaa !5
  %23 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %22, ptr noundef @.str, ptr noundef @.str.1, ptr noundef @.str.2) #5
  call void @exit(i32 noundef -83386157) #6
  unreachable

24:                                               ; preds = %4
  %25 = load i32, ptr %6, align 4, !tbaa !9
  %26 = icmp slt i32 %25, 0
  br i1 %26, label %27, label %30

27:                                               ; preds = %24
  %28 = load ptr, ptr @stderr, align 8, !tbaa !5
  %29 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %28, ptr noundef @.str.3, ptr noundef @.str.4, ptr noundef @.str.2) #5
  call void @exit(i32 noundef -83384987) #6
  unreachable

30:                                               ; preds = %24
  %31 = load i32, ptr %8, align 4, !tbaa !9
  %32 = load i32, ptr %7, align 4, !tbaa !9
  %33 = icmp ult i32 %31, %32
  br i1 %33, label %34, label %37

34:                                               ; preds = %30
  %35 = load ptr, ptr @stderr, align 8, !tbaa !5
  %36 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %35, ptr noundef @.str.3, ptr noundef @.str.5, ptr noundef @.str.2) #5
  call void @exit(i32 noundef -83384987) #6
  unreachable

37:                                               ; preds = %30
  br label %38

38:                                               ; preds = %37
  br label %39

39:                                               ; preds = %38
  call void @llvm.lifetime.start.p0(i64 8, ptr %9) #5
  %40 = call ptr @hashMapInitialization(ptr noundef @intFreeFunCountSort, ptr noundef @intFreeFunCountSort, ptr noundef @intCmpCountSort, ptr noundef @intHashFunCountSort)
  store ptr %40, ptr %9, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr %10) #5
  store i32 0, ptr %10, align 4, !tbaa !9
  br label %41

41:                                               ; preds = %74, %39
  %42 = load i32, ptr %10, align 4, !tbaa !9
  %43 = load i32, ptr %6, align 4, !tbaa !9
  %44 = icmp slt i32 %42, %43
  br i1 %44, label %46, label %45

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

46:                                               ; preds = %41
  call void @llvm.lifetime.start.p0(i64 8, ptr %11) #5
  %47 = load ptr, ptr %5, align 8, !tbaa !5
  %48 = load i32, ptr %10, align 4, !tbaa !9
  %49 = sext i32 %48 to i64
  %50 = getelementptr inbounds i32, ptr %47, i64 %49
  %51 = call ptr @generateIntPointerCountSort(ptr noundef %50)
  store ptr %51, ptr %11, align 8, !tbaa !5
  %52 = load ptr, ptr %9, align 8, !tbaa !5
  %53 = load ptr, ptr %11, align 8, !tbaa !5
  %54 = call i32 @hashMapContains(ptr noundef %52, ptr noundef %53)
  %55 = icmp ne i32 %54, 0
  br i1 %55, label %61, label %56

56:                                               ; preds = %46
  call void @llvm.lifetime.start.p0(i64 4, ptr %12) #5
  store i32 1, ptr %12, align 4, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 8, ptr %13) #5
  %57 = call ptr @generateIntPointerCountSort(ptr noundef %12)
  store ptr %57, ptr %13, align 8, !tbaa !5
  %58 = load ptr, ptr %9, align 8, !tbaa !5
  %59 = load ptr, ptr %11, align 8, !tbaa !5
  %60 = load ptr, ptr %13, align 8, !tbaa !5
  call void @hashMapInsert(ptr noundef %58, ptr noundef %59, ptr noundef %60)
  call void @llvm.lifetime.end.p0(i64 8, ptr %13) #5
  call void @llvm.lifetime.end.p0(i64 4, ptr %12) #5
  br label %73

61:                                               ; preds = %46
  call void @llvm.lifetime.start.p0(i64 8, ptr %14) #5
  %62 = load ptr, ptr %9, align 8, !tbaa !5
  %63 = load ptr, ptr %11, align 8, !tbaa !5
  %64 = call ptr @hashMapGet(ptr noundef %62, ptr noundef %63)
  store ptr %64, ptr %14, align 8, !tbaa !5
  %65 = load ptr, ptr %14, align 8, !tbaa !5
  %66 = load i32, ptr %65, align 4, !tbaa !9
  %67 = add i32 %66, 1
  store i32 %67, ptr %65, align 4, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 8, ptr %15) #5
  %68 = load ptr, ptr %14, align 8, !tbaa !5
  %69 = call ptr @generateIntPointerCountSort(ptr noundef %68)
  store ptr %69, ptr %15, align 8, !tbaa !5
  %70 = load ptr, ptr %9, align 8, !tbaa !5
  %71 = load ptr, ptr %11, align 8, !tbaa !5
  %72 = load ptr, ptr %15, align 8, !tbaa !5
  call void @hashMapInsert(ptr noundef %70, ptr noundef %71, ptr noundef %72)
  call void @llvm.lifetime.end.p0(i64 8, ptr %15) #5
  call void @llvm.lifetime.end.p0(i64 8, ptr %14) #5
  br label %73

73:                                               ; preds = %61, %56
  call void @llvm.lifetime.end.p0(i64 8, ptr %11) #5
  br label %74

74:                                               ; preds = %73
  %75 = load i32, ptr %10, align 4, !tbaa !9
  %76 = add nsw i32 %75, 1
  store i32 %76, ptr %10, align 4, !tbaa !9
  br label %41, !llvm.loop !11

77:                                               ; preds = %45
  call void @llvm.lifetime.start.p0(i64 4, ptr %16) #5
  %78 = load i32, ptr %7, align 4, !tbaa !9
  store i32 %78, ptr %16, align 4, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 4, ptr %17) #5
  store i32 0, ptr %17, align 4, !tbaa !9
  br label %79

79:                                               ; preds = %107, %77
  %80 = load i32, ptr %16, align 4, !tbaa !9
  %81 = load i32, ptr %8, align 4, !tbaa !9
  %82 = icmp ule i32 %80, %81
  br i1 %82, label %84, label %83

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

84:                                               ; preds = %79
  call void @llvm.lifetime.start.p0(i64 8, ptr %18) #5
  %85 = load ptr, ptr %9, align 8, !tbaa !5
  %86 = call ptr @hashMapGet(ptr noundef %85, ptr noundef %16)
  store ptr %86, ptr %18, align 8, !tbaa !5
  br label %87

87:                                               ; preds = %96, %84
  %88 = load ptr, ptr %18, align 8, !tbaa !5
  %89 = icmp ne ptr %88, null
  br i1 %89, label %90, label %94

90:                                               ; preds = %87
  %91 = load ptr, ptr %18, align 8, !tbaa !5
  %92 = load i32, ptr %91, align 4, !tbaa !9
  %93 = icmp ugt i32 %92, 0
  br label %94

94:                                               ; preds = %90, %87
  %95 = phi i1 [ false, %87 ], [ %93, %90 ]
  br i1 %95, label %96, label %106

96:                                               ; preds = %94
  %97 = load i32, ptr %16, align 4, !tbaa !9
  %98 = load ptr, ptr %5, align 8, !tbaa !5
  %99 = load i32, ptr %17, align 4, !tbaa !9
  %100 = add i32 %99, 1
  store i32 %100, ptr %17, align 4, !tbaa !9
  %101 = zext i32 %99 to i64
  %102 = getelementptr inbounds i32, ptr %98, i64 %101
  store i32 %97, ptr %102, align 4, !tbaa !9
  %103 = load ptr, ptr %18, align 8, !tbaa !5
  %104 = load i32, ptr %103, align 4, !tbaa !9
  %105 = sub i32 %104, 1
  store i32 %105, ptr %103, align 4, !tbaa !9
  br label %87, !llvm.loop !13

106:                                              ; preds = %94
  call void @llvm.lifetime.end.p0(i64 8, ptr %18) #5
  br label %107

107:                                              ; preds = %106
  %108 = load i32, ptr %16, align 4, !tbaa !9
  %109 = add i32 %108, 1
  store i32 %109, ptr %16, align 4, !tbaa !9
  br label %79, !llvm.loop !14

110:                                              ; preds = %83
  %111 = load ptr, ptr %9, align 8, !tbaa !5
  call void @destroyHashMap(ptr noundef %111)
  call void @llvm.lifetime.end.p0(i64 8, ptr %9) #5
  ret void
}

declare ptr @hashMapInitialization(ptr noundef, ptr noundef, ptr noundef, ptr noundef) #4

declare i32 @hashMapContains(ptr noundef, ptr noundef) #4

declare void @hashMapInsert(ptr noundef, ptr noundef, ptr noundef) #4

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

declare void @destroyHashMap(ptr noundef) #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 = { 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 = { "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 = { nounwind }
attributes #6 = { noreturn 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, !10, i64 0}
!10 = !{!"int", !7, i64 0}
!11 = distinct !{!11, !12}
!12 = !{!"llvm.loop.mustprogress"}
!13 = distinct !{!13, !12}
!14 = distinct !{!14, !12}


; 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 [31 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [14 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [42 x i8], align 1
@.str.4 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [20 x i8], align 1

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

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

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

; 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: nounwind uwtable
define dso_local void @countingSortH(ptr noundef %0, i32 noundef %1, i32 noundef %2, i32 noundef %3) local_unnamed_addr #0 {
  %5 = alloca i32, align 4
  %6 = alloca i32, align 4
  %7 = icmp eq ptr %0, null
  br i1 %7, label %8, label %11

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

11:                                               ; preds = %4
  %12 = icmp slt i32 %1, 0
  br i1 %12, label %13, label %16

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

16:                                               ; preds = %11
  %17 = icmp ult i32 %3, %2
  br i1 %17, label %18, label %21

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

21:                                               ; preds = %16
  %22 = tail call ptr @hashMapInitialization(ptr noundef nonnull @intFreeFunCountSort, ptr noundef nonnull @intFreeFunCountSort, ptr noundef nonnull @intCmpCountSort, ptr noundef nonnull @intHashFunCountSort) #7
  %.not53 = icmp eq i32 %1, 0
  br i1 %.not53, label %.lr.ph51.preheader, label %.lr.ph.preheader

.lr.ph.preheader:                                 ; preds = %21
  %wide.trip.count = zext nneg i32 %1 to i64
  br label %.lr.ph

.lr.ph51.preheader:                               ; preds = %33, %21
  call void @llvm.lifetime.start.p0(i64 4, ptr nonnull %6) #7
  store i32 %2, ptr %6, align 4, !tbaa !9
  br label %.lr.ph51

.lr.ph:                                           ; preds = %.lr.ph.preheader, %33
  %indvars.iv = phi i64 [ 0, %.lr.ph.preheader ], [ %indvars.iv.next, %33 ]
  %23 = getelementptr inbounds i32, ptr %0, i64 %indvars.iv
  %24 = call ptr @generateIntPointerCountSort(ptr noundef nonnull %23)
  %25 = call i32 @hashMapContains(ptr noundef %22, ptr noundef %24) #7
  %.not37 = icmp eq i32 %25, 0
  br i1 %.not37, label %26, label %28

26:                                               ; preds = %.lr.ph
  call void @llvm.lifetime.start.p0(i64 4, ptr nonnull %5) #7
  store i32 1, ptr %5, align 4, !tbaa !9
  %27 = call ptr @generateIntPointerCountSort(ptr noundef nonnull %5)
  call void @hashMapInsert(ptr noundef %22, ptr noundef %24, ptr noundef %27) #7
  call void @llvm.lifetime.end.p0(i64 4, ptr nonnull %5) #7
  br label %33

28:                                               ; preds = %.lr.ph
  %29 = call ptr @hashMapGet(ptr noundef %22, ptr noundef %24) #7
  %30 = load i32, ptr %29, align 4, !tbaa !9
  %31 = add i32 %30, 1
  store i32 %31, ptr %29, align 4, !tbaa !9
  %32 = call ptr @generateIntPointerCountSort(ptr noundef nonnull %29)
  call void @hashMapInsert(ptr noundef %22, ptr noundef %24, ptr noundef %32) #7
  br label %33

33:                                               ; preds = %28, %26
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  %exitcond.not = icmp eq i64 %indvars.iv.next, %wide.trip.count
  br i1 %exitcond.not, label %.lr.ph51.preheader, label %.lr.ph, !llvm.loop !11

._crit_edge52:                                    ; preds = %.critedge
  call void @llvm.lifetime.end.p0(i64 4, ptr nonnull %6) #7
  call void @destroyHashMap(ptr noundef %22) #7
  ret void

.lr.ph51:                                         ; preds = %.lr.ph51.preheader, %.critedge
  %.02949 = phi i32 [ %.1.lcssa, %.critedge ], [ 0, %.lr.ph51.preheader ]
  %34 = call ptr @hashMapGet(ptr noundef %22, ptr noundef nonnull %6) #7
  %.not35 = icmp eq ptr %34, null
  br i1 %.not35, label %.critedge, label %.lr.ph41.split

.lr.ph41.split:                                   ; preds = %.lr.ph51
  %35 = load i32, ptr %34, align 4, !tbaa !9
  %.not3645 = icmp eq i32 %35, 0
  br i1 %.not3645, label %.critedge, label %.lr.ph47

.lr.ph47:                                         ; preds = %.lr.ph41.split, %.lr.ph47
  %.13946 = phi i32 [ %37, %.lr.ph47 ], [ %.02949, %.lr.ph41.split ]
  %36 = load i32, ptr %6, align 4, !tbaa !9
  %37 = add i32 %.13946, 1
  %38 = zext i32 %.13946 to i64
  %39 = getelementptr inbounds i32, ptr %0, i64 %38
  store i32 %36, ptr %39, align 4, !tbaa !9
  %40 = load i32, ptr %34, align 4, !tbaa !9
  %41 = add i32 %40, -1
  store i32 %41, ptr %34, align 4, !tbaa !9
  %.not36 = icmp eq i32 %41, 0
  br i1 %.not36, label %.critedge, label %.lr.ph47

.critedge:                                        ; preds = %.lr.ph47, %.lr.ph41.split, %.lr.ph51
  %.1.lcssa = phi i32 [ %.02949, %.lr.ph51 ], [ %.02949, %.lr.ph41.split ], [ %37, %.lr.ph47 ]
  %42 = load i32, ptr %6, align 4, !tbaa !9
  %43 = add i32 %42, 1
  store i32 %43, ptr %6, align 4, !tbaa !9
  %.not = icmp ugt i32 %43, %3
  br i1 %.not, label %._crit_edge52, label %.lr.ph51, !llvm.loop !13
}

declare ptr @hashMapInitialization(ptr noundef, ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #4

declare i32 @hashMapContains(ptr noundef, ptr noundef) local_unnamed_addr #4

declare void @hashMapInsert(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #4

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

declare void @destroyHashMap(ptr noundef) local_unnamed_addr #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 = { mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
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 = { "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 = { cold nounwind }
attributes #6 = { noreturn nounwind }
attributes #7 = { 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, !10, i64 0}
!10 = !{!"int", !7, i64 0}
!11 = distinct !{!11, !12}
!12 = !{!"llvm.loop.mustprogress"}
!13 = distinct !{!13, !12}


; Effective O3 passes: GVNPass,GlobalOptPass,IndVarSimplifyPass,InferFunctionAttrsPass,InstCombinePass,InstSimplifyPass,JumpThreadingPass,LCSSAPass,LICMPass,LoopInstSimplifyPass,LoopRotatePass,LoopSimplifyCFGPass,LoopSimplifyPass,LoopUnrollPass,SCCPPass,SROAPass,SimplifyCFGPass,TailCallElimPass