; LLVM IR from lfarcaro/ARINC653_ARMV7A_Z7000 :: ARINC653_ARMV7A_Z7000.sw/MEASURE/src/Algorithms (algorithm_dijkstra1)

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

@algorithm_dijkstra1_AdjMatrix = external dso_local global [50 x [50 x i8]], align 16
@algorithm_dijkstra1_rgnNodes = external dso_local global [50 x %struct._NODE], align 16

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

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

; Function Attrs: nounwind uwtable
declare dso_local i32 @algorithm_dijkstra1_enqueue(i32 noundef, i32 noundef, i32 noundef) #1

; Function Attrs: nounwind uwtable
declare dso_local void @algorithm_dijkstra1_dequeue(ptr noundef, ptr noundef, ptr noundef) #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @algorithm_dijkstra1_qcount() #1

; Function Attrs: nounwind uwtable
define dso_local i32 @algorithm_dijkstra1_find(i32 noundef %0, i32 noundef %1) #1 {
  %3 = alloca i32, align 4
  %4 = alloca i32, align 4
  %5 = alloca i32, align 4
  %6 = alloca i32, align 4
  %7 = alloca i32, align 4
  %8 = alloca i32, align 4
  %9 = alloca i32, align 4
  %10 = alloca i32, align 4
  %11 = alloca i32, align 4
  %12 = alloca i32, align 4
  store i32 %0, ptr %4, align 4, !tbaa !5
  store i32 %1, ptr %5, align 4, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #2
  call void @llvm.lifetime.start.p0(i64 4, ptr %7) #2
  call void @llvm.lifetime.start.p0(i64 4, ptr %8) #2
  store i32 0, ptr %8, align 4, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr %9) #2
  call void @llvm.lifetime.start.p0(i64 4, ptr %10) #2
  store i32 0, ptr %10, align 4, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr %11) #2
  store i32 0, ptr %6, align 4, !tbaa !5
  br label %13

13:                                               ; preds = %25, %2
  %14 = load i32, ptr %6, align 4, !tbaa !5
  %15 = icmp slt i32 %14, 50
  br i1 %15, label %16, label %28

16:                                               ; preds = %13
  %17 = load i32, ptr %6, align 4, !tbaa !5
  %18 = sext i32 %17 to i64
  %19 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %18
  %20 = getelementptr inbounds %struct._NODE, ptr %19, i32 0, i32 0
  store i32 9999, ptr %20, align 8, !tbaa !9
  %21 = load i32, ptr %6, align 4, !tbaa !5
  %22 = sext i32 %21 to i64
  %23 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %22
  %24 = getelementptr inbounds %struct._NODE, ptr %23, i32 0, i32 1
  store i32 9999, ptr %24, align 4, !tbaa !11
  br label %25

25:                                               ; preds = %16
  %26 = load i32, ptr %6, align 4, !tbaa !5
  %27 = add nsw i32 %26, 1
  store i32 %27, ptr %6, align 4, !tbaa !5
  br label %13, !llvm.loop !12

28:                                               ; preds = %13
  %29 = load i32, ptr %4, align 4, !tbaa !5
  %30 = load i32, ptr %5, align 4, !tbaa !5
  %31 = icmp eq i32 %29, %30
  br i1 %31, label %32, label %33

32:                                               ; preds = %28
  br label %110

33:                                               ; preds = %28
  %34 = load i32, ptr %4, align 4, !tbaa !5
  %35 = sext i32 %34 to i64
  %36 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %35
  %37 = getelementptr inbounds %struct._NODE, ptr %36, i32 0, i32 0
  store i32 0, ptr %37, align 8, !tbaa !9
  %38 = load i32, ptr %4, align 4, !tbaa !5
  %39 = sext i32 %38 to i64
  %40 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %39
  %41 = getelementptr inbounds %struct._NODE, ptr %40, i32 0, i32 1
  store i32 9999, ptr %41, align 4, !tbaa !11
  %42 = load i32, ptr %4, align 4, !tbaa !5
  %43 = call i32 @algorithm_dijkstra1_enqueue(i32 noundef %42, i32 noundef 0, i32 noundef 9999)
  %44 = icmp eq i32 %43, -1
  br i1 %44, label %45, label %46

45:                                               ; preds = %33
  store i32 -1, ptr %3, align 4
  store i32 1, ptr %12, align 4
  br label %111

46:                                               ; preds = %33
  br label %47

47:                                               ; preds = %108, %46
  %48 = call i32 @algorithm_dijkstra1_qcount()
  %49 = icmp sgt i32 %48, 0
  br i1 %49, label %50, label %109

50:                                               ; preds = %47
  call void @algorithm_dijkstra1_dequeue(ptr noundef %8, ptr noundef %10, ptr noundef %7)
  store i32 0, ptr %11, align 4, !tbaa !5
  br label %51

51:                                               ; preds = %105, %50
  %52 = load i32, ptr %11, align 4, !tbaa !5
  %53 = icmp slt i32 %52, 50
  br i1 %53, label %54, label %108

54:                                               ; preds = %51
  %55 = load i32, ptr %8, align 4, !tbaa !5
  %56 = sext i32 %55 to i64
  %57 = getelementptr inbounds [50 x [50 x i8]], ptr @algorithm_dijkstra1_AdjMatrix, i64 0, i64 %56
  %58 = load i32, ptr %11, align 4, !tbaa !5
  %59 = sext i32 %58 to i64
  %60 = getelementptr inbounds [50 x i8], ptr %57, i64 0, i64 %59
  %61 = load i8, ptr %60, align 1, !tbaa !14
  %62 = zext i8 %61 to i32
  store i32 %62, ptr %9, align 4, !tbaa !5
  %63 = icmp ne i32 %62, 9999
  br i1 %63, label %64, label %104

64:                                               ; preds = %54
  %65 = load i32, ptr %11, align 4, !tbaa !5
  %66 = sext i32 %65 to i64
  %67 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %66
  %68 = getelementptr inbounds %struct._NODE, ptr %67, i32 0, i32 0
  %69 = load i32, ptr %68, align 8, !tbaa !9
  %70 = icmp eq i32 9999, %69
  br i1 %70, label %81, label %71

71:                                               ; preds = %64
  %72 = load i32, ptr %11, align 4, !tbaa !5
  %73 = sext i32 %72 to i64
  %74 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %73
  %75 = getelementptr inbounds %struct._NODE, ptr %74, i32 0, i32 0
  %76 = load i32, ptr %75, align 8, !tbaa !9
  %77 = load i32, ptr %9, align 4, !tbaa !5
  %78 = load i32, ptr %10, align 4, !tbaa !5
  %79 = add nsw i32 %77, %78
  %80 = icmp sgt i32 %76, %79
  br i1 %80, label %81, label %103

81:                                               ; preds = %71, %64
  %82 = load i32, ptr %10, align 4, !tbaa !5
  %83 = load i32, ptr %9, align 4, !tbaa !5
  %84 = add nsw i32 %82, %83
  %85 = load i32, ptr %11, align 4, !tbaa !5
  %86 = sext i32 %85 to i64
  %87 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %86
  %88 = getelementptr inbounds %struct._NODE, ptr %87, i32 0, i32 0
  store i32 %84, ptr %88, align 8, !tbaa !9
  %89 = load i32, ptr %8, align 4, !tbaa !5
  %90 = load i32, ptr %11, align 4, !tbaa !5
  %91 = sext i32 %90 to i64
  %92 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %91
  %93 = getelementptr inbounds %struct._NODE, ptr %92, i32 0, i32 1
  store i32 %89, ptr %93, align 4, !tbaa !11
  %94 = load i32, ptr %11, align 4, !tbaa !5
  %95 = load i32, ptr %10, align 4, !tbaa !5
  %96 = load i32, ptr %9, align 4, !tbaa !5
  %97 = add nsw i32 %95, %96
  %98 = load i32, ptr %8, align 4, !tbaa !5
  %99 = call i32 @algorithm_dijkstra1_enqueue(i32 noundef %94, i32 noundef %97, i32 noundef %98)
  %100 = icmp eq i32 %99, -1
  br i1 %100, label %101, label %102

101:                                              ; preds = %81
  store i32 -1, ptr %3, align 4
  store i32 1, ptr %12, align 4
  br label %111

102:                                              ; preds = %81
  br label %103

103:                                              ; preds = %102, %71
  br label %104

104:                                              ; preds = %103, %54
  br label %105

105:                                              ; preds = %104
  %106 = load i32, ptr %11, align 4, !tbaa !5
  %107 = add nsw i32 %106, 1
  store i32 %107, ptr %11, align 4, !tbaa !5
  br label %51, !llvm.loop !15

108:                                              ; preds = %51
  br label %47, !llvm.loop !16

109:                                              ; preds = %47
  br label %110

110:                                              ; preds = %109, %32
  store i32 0, ptr %3, align 4
  store i32 1, ptr %12, align 4
  br label %111

111:                                              ; preds = %110, %101, %45
  call void @llvm.lifetime.end.p0(i64 4, ptr %11) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr %10) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr %9) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr %8) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr %7) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr %6) #2
  %112 = load i32, ptr %3, align 4
  ret i32 %112
}

attributes #0 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #1 = { 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 #2 = { 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 = !{!"int", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !6, i64 0}
!10 = !{!"_NODE", !6, i64 0, !6, i64 4}
!11 = !{!10, !6, i64 4}
!12 = distinct !{!12, !13}
!13 = !{!"llvm.loop.mustprogress"}
!14 = !{!7, !7, i64 0}
!15 = distinct !{!15, !13}
!16 = distinct !{!16, !13}


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

%struct._NODE = type { i32, i32 }

@algorithm_dijkstra1_AdjMatrix = external dso_local local_unnamed_addr global [50 x [50 x i8]], align 16
@algorithm_dijkstra1_rgnNodes = external dso_local local_unnamed_addr global [50 x %struct._NODE], align 16

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

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

; Function Attrs: nounwind uwtable
declare dso_local i32 @algorithm_dijkstra1_enqueue(i32 noundef, i32 noundef, i32 noundef) local_unnamed_addr #1

; Function Attrs: nounwind uwtable
declare dso_local void @algorithm_dijkstra1_dequeue(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @algorithm_dijkstra1_qcount() local_unnamed_addr #1

; Function Attrs: nounwind uwtable
define dso_local range(i32 -1, 1) i32 @algorithm_dijkstra1_find(i32 noundef %0, i32 noundef %1) local_unnamed_addr #1 {
  %3 = alloca i32, align 4
  %4 = alloca i32, align 4
  %5 = alloca i32, align 4
  call void @llvm.lifetime.start.p0(i64 4, ptr nonnull %3) #2
  call void @llvm.lifetime.start.p0(i64 4, ptr nonnull %4) #2
  store i32 0, ptr %4, align 4, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr nonnull %5) #2
  store i32 0, ptr %5, align 4, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr @algorithm_dijkstra1_rgnNodes, align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 16), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 32), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 48), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 64), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 80), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 96), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 112), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 128), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 144), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 160), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 176), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 192), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 208), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 224), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 240), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 256), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 272), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 288), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 304), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 320), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 336), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 352), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 368), align 16, !tbaa !5
  store <4 x i32> <i32 9999, i32 9999, i32 9999, i32 9999>, ptr getelementptr inbounds (i8, ptr @algorithm_dijkstra1_rgnNodes, i64 384), align 16, !tbaa !5
  %6 = icmp eq i32 %0, %1
  br i1 %6, label %.loopexit25, label %7

7:                                                ; preds = %2
  %8 = sext i32 %0 to i64
  %9 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %8
  store i32 0, ptr %9, align 8, !tbaa !9
  %10 = getelementptr inbounds i8, ptr %9, i64 4
  store i32 9999, ptr %10, align 4, !tbaa !11
  %11 = tail call i32 @algorithm_dijkstra1_enqueue(i32 noundef %0, i32 noundef 0, i32 noundef 9999)
  %12 = icmp eq i32 %11, -1
  br i1 %12, label %.loopexit25, label %.preheader

.preheader:                                       ; preds = %7
  %13 = tail call i32 @algorithm_dijkstra1_qcount()
  %14 = icmp sgt i32 %13, 0
  br i1 %14, label %.lr.ph, label %.loopexit25

.loopexit:                                        ; preds = %31
  %15 = call i32 @algorithm_dijkstra1_qcount()
  %16 = icmp sgt i32 %15, 0
  br i1 %16, label %.lr.ph, label %.loopexit25, !llvm.loop !12

.lr.ph:                                           ; preds = %.preheader, %.loopexit
  call void @algorithm_dijkstra1_dequeue(ptr noundef nonnull %4, ptr noundef nonnull %5, ptr noundef nonnull %3)
  br label %17

17:                                               ; preds = %.lr.ph, %31
  %indvars.iv = phi i64 [ 0, %.lr.ph ], [ %indvars.iv.next, %31 ]
  %18 = load i32, ptr %4, align 4, !tbaa !5
  %19 = sext i32 %18 to i64
  %20 = getelementptr inbounds [50 x [50 x i8]], ptr @algorithm_dijkstra1_AdjMatrix, i64 0, i64 %19, i64 %indvars.iv
  %21 = load i8, ptr %20, align 1, !tbaa !14
  %22 = zext i8 %21 to i32
  %23 = getelementptr inbounds [50 x %struct._NODE], ptr @algorithm_dijkstra1_rgnNodes, i64 0, i64 %indvars.iv
  %24 = load i32, ptr %23, align 8, !tbaa !9
  %25 = icmp eq i32 %24, 9999
  %.pre = load i32, ptr %5, align 4, !tbaa !5
  %.pre32 = add nsw i32 %.pre, %22
  %26 = icmp sgt i32 %24, %.pre32
  %or.cond = select i1 %25, i1 true, i1 %26
  br i1 %or.cond, label %._crit_edge, label %31

._crit_edge:                                      ; preds = %17
  store i32 %.pre32, ptr %23, align 8, !tbaa !9
  %27 = getelementptr inbounds i8, ptr %23, i64 4
  store i32 %18, ptr %27, align 4, !tbaa !11
  %28 = trunc nuw nsw i64 %indvars.iv to i32
  %29 = call i32 @algorithm_dijkstra1_enqueue(i32 noundef %28, i32 noundef %.pre32, i32 noundef %18)
  %30 = icmp eq i32 %29, -1
  br i1 %30, label %.loopexit25, label %31

31:                                               ; preds = %17, %._crit_edge
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  %exitcond.not = icmp eq i64 %indvars.iv.next, 50
  br i1 %exitcond.not, label %.loopexit, label %17, !llvm.loop !15

.loopexit25:                                      ; preds = %.loopexit, %._crit_edge, %.preheader, %2, %7
  %.021 = phi i32 [ -1, %7 ], [ 0, %2 ], [ 0, %.preheader ], [ -1, %._crit_edge ], [ 0, %.loopexit ]
  call void @llvm.lifetime.end.p0(i64 4, ptr nonnull %5) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr nonnull %4) #2
  call void @llvm.lifetime.end.p0(i64 4, ptr nonnull %3) #2
  ret i32 %.021
}

attributes #0 = { mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #1 = { 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 #2 = { 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 = !{!"int", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !6, i64 0}
!10 = !{!"_NODE", !6, i64 0, !6, i64 4}
!11 = !{!10, !6, i64 4}
!12 = distinct !{!12, !13}
!13 = !{!"llvm.loop.mustprogress"}
!14 = !{!7, !7, i64 0}
!15 = distinct !{!15, !13}


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