; LLVM IR from bartobri/data-structures-c :: FIFO-queue/array-first-class (main)

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

@.str = external hidden unnamed_addr constant [5 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [2 x i8], align 1

; Function Attrs: nounwind uwtable
define dso_local i32 @main(i32 noundef %0, ptr noundef %1) #0 {
  %3 = alloca i32, align 4
  %4 = alloca i32, align 4
  %5 = alloca ptr, align 8
  %6 = alloca i32, align 4
  %7 = alloca i32, align 4
  %8 = alloca i32, align 4
  %9 = alloca [10 x ptr], align 16
  store i32 0, ptr %3, align 4
  store i32 %0, ptr %4, align 4, !tbaa !5
  store ptr %1, ptr %5, align 8, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #5
  call void @llvm.lifetime.start.p0(i64 4, ptr %7) #5
  call void @llvm.lifetime.start.p0(i64 4, ptr %8) #5
  %10 = load ptr, ptr %5, align 8, !tbaa !9
  %11 = getelementptr inbounds ptr, ptr %10, i64 1
  %12 = load ptr, ptr %11, align 8, !tbaa !9
  %13 = call i32 @atoi(ptr noundef %12) #6
  store i32 %13, ptr %8, align 4, !tbaa !5
  %14 = call i64 @time(ptr noundef null) #5
  %15 = trunc i64 %14 to i32
  call void @srand(i32 noundef %15) #5
  call void @llvm.lifetime.start.p0(i64 80, ptr %9) #5
  store i32 0, ptr %6, align 4, !tbaa !5
  br label %16

16:                                               ; preds = %25, %2
  %17 = load i32, ptr %6, align 4, !tbaa !5
  %18 = icmp slt i32 %17, 10
  br i1 %18, label %19, label %28

19:                                               ; preds = %16
  %20 = load i32, ptr %8, align 4, !tbaa !5
  %21 = call ptr @QUEUEinit(i32 noundef %20)
  %22 = load i32, ptr %6, align 4, !tbaa !5
  %23 = sext i32 %22 to i64
  %24 = getelementptr inbounds [10 x ptr], ptr %9, i64 0, i64 %23
  store ptr %21, ptr %24, align 8, !tbaa !9
  br label %25

25:                                               ; preds = %19
  %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 %16, !llvm.loop !11

28:                                               ; preds = %16
  store i32 0, ptr %6, align 4, !tbaa !5
  br label %29

29:                                               ; preds = %40, %28
  %30 = load i32, ptr %6, align 4, !tbaa !5
  %31 = load i32, ptr %8, align 4, !tbaa !5
  %32 = icmp slt i32 %30, %31
  br i1 %32, label %33, label %43

33:                                               ; preds = %29
  %34 = call i32 @rand() #5
  %35 = srem i32 %34, 10
  %36 = sext i32 %35 to i64
  %37 = getelementptr inbounds [10 x ptr], ptr %9, i64 0, i64 %36
  %38 = load ptr, ptr %37, align 8, !tbaa !9
  %39 = load i32, ptr %6, align 4, !tbaa !5
  call void @QUEUEput(ptr noundef %38, i32 noundef %39)
  br label %40

40:                                               ; preds = %33
  %41 = load i32, ptr %6, align 4, !tbaa !5
  %42 = add nsw i32 %41, 1
  store i32 %42, ptr %6, align 4, !tbaa !5
  br label %29, !llvm.loop !13

43:                                               ; preds = %29
  store i32 0, ptr %6, align 4, !tbaa !5
  br label %44

44:                                               ; preds = %68, %43
  %45 = load i32, ptr %6, align 4, !tbaa !5
  %46 = icmp slt i32 %45, 10
  br i1 %46, label %47, label %71

47:                                               ; preds = %44
  store i32 0, ptr %7, align 4, !tbaa !5
  br label %48

48:                                               ; preds = %63, %47
  %49 = load i32, ptr %6, align 4, !tbaa !5
  %50 = sext i32 %49 to i64
  %51 = getelementptr inbounds [10 x ptr], ptr %9, i64 0, i64 %50
  %52 = load ptr, ptr %51, align 8, !tbaa !9
  %53 = call i32 @QUEUEempty(ptr noundef %52)
  %54 = icmp ne i32 %53, 0
  %55 = xor i1 %54, true
  br i1 %55, label %56, label %66

56:                                               ; preds = %48
  %57 = load i32, ptr %6, align 4, !tbaa !5
  %58 = sext i32 %57 to i64
  %59 = getelementptr inbounds [10 x ptr], ptr %9, i64 0, i64 %58
  %60 = load ptr, ptr %59, align 8, !tbaa !9
  %61 = call i32 @QUEUEget(ptr noundef %60)
  %62 = call i32 (ptr, ...) @printf(ptr noundef @.str, i32 noundef %61)
  br label %63

63:                                               ; preds = %56
  %64 = load i32, ptr %7, align 4, !tbaa !5
  %65 = add nsw i32 %64, 1
  store i32 %65, ptr %7, align 4, !tbaa !5
  br label %48, !llvm.loop !14

66:                                               ; preds = %48
  %67 = call i32 (ptr, ...) @printf(ptr noundef @.str.1)
  br label %68

68:                                               ; preds = %66
  %69 = load i32, ptr %6, align 4, !tbaa !5
  %70 = add nsw i32 %69, 1
  store i32 %70, ptr %6, align 4, !tbaa !5
  br label %44, !llvm.loop !15

71:                                               ; preds = %44
  call void @llvm.lifetime.end.p0(i64 80, ptr %9) #5
  call void @llvm.lifetime.end.p0(i64 4, ptr %8) #5
  call void @llvm.lifetime.end.p0(i64 4, ptr %7) #5
  call void @llvm.lifetime.end.p0(i64 4, ptr %6) #5
  ret i32 0
}

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

; Function Attrs: inlinehint nounwind willreturn memory(read) uwtable
declare i32 @atoi(ptr noundef nonnull) #2

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

; Function Attrs: nounwind
declare i64 @time(ptr noundef) #3

declare ptr @QUEUEinit(i32 noundef) #4

declare void @QUEUEput(ptr noundef, i32 noundef) #4

; Function Attrs: nounwind
declare i32 @rand() #3

declare i32 @QUEUEempty(ptr noundef) #4

declare i32 @printf(ptr noundef, ...) #4

declare i32 @QUEUEget(ptr noundef) #4

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #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 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { inlinehint nounwind willreturn memory(read) 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 #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 = { "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 = { nounwind willreturn memory(read) }

!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, !10, i64 0}
!10 = !{!"any pointer", !7, i64 0}
!11 = distinct !{!11, !12}
!12 = !{!"llvm.loop.mustprogress"}
!13 = distinct !{!13, !12}
!14 = distinct !{!14, !12}
!15 = distinct !{!15, !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"

@.str = external hidden unnamed_addr constant [5 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [2 x i8], align 1

; Function Attrs: nounwind uwtable
define dso_local noundef i32 @main(i32 noundef %0, ptr nocapture noundef readonly %1) local_unnamed_addr #0 {
.preheader15:
  %2 = alloca [10 x ptr], align 16
  %3 = getelementptr inbounds i8, ptr %1, i64 8
  %4 = load ptr, ptr %3, align 8, !tbaa !5
  %5 = tail call i32 @atoi(ptr nocapture noundef %4) #6
  %6 = tail call i64 @time(ptr noundef null) #7
  %7 = trunc i64 %6 to i32
  tail call void @srand(i32 noundef %7) #7
  call void @llvm.lifetime.start.p0(i64 80, ptr nonnull %2) #7
  %8 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  store ptr %8, ptr %2, align 16, !tbaa !5
  %9 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %10 = getelementptr inbounds i8, ptr %2, i64 8
  store ptr %9, ptr %10, align 8, !tbaa !5
  %11 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %12 = getelementptr inbounds i8, ptr %2, i64 16
  store ptr %11, ptr %12, align 16, !tbaa !5
  %13 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %14 = getelementptr inbounds i8, ptr %2, i64 24
  store ptr %13, ptr %14, align 8, !tbaa !5
  %15 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %16 = getelementptr inbounds i8, ptr %2, i64 32
  store ptr %15, ptr %16, align 16, !tbaa !5
  %17 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %18 = getelementptr inbounds i8, ptr %2, i64 40
  store ptr %17, ptr %18, align 8, !tbaa !5
  %19 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %20 = getelementptr inbounds i8, ptr %2, i64 48
  store ptr %19, ptr %20, align 16, !tbaa !5
  %21 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %22 = getelementptr inbounds i8, ptr %2, i64 56
  store ptr %21, ptr %22, align 8, !tbaa !5
  %23 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %24 = getelementptr inbounds i8, ptr %2, i64 64
  store ptr %23, ptr %24, align 16, !tbaa !5
  %25 = tail call ptr @QUEUEinit(i32 noundef %5) #7
  %26 = getelementptr inbounds i8, ptr %2, i64 72
  store ptr %25, ptr %26, align 8, !tbaa !5
  %27 = icmp sgt i32 %5, 0
  br i1 %27, label %.lr.ph, label %.preheader14

.preheader14:                                     ; preds = %.lr.ph, %.preheader15
  %28 = tail call i32 @QUEUEempty(ptr noundef %8) #7
  %.not18 = icmp eq i32 %28, 0
  br i1 %.not18, label %.lr.ph19, label %._crit_edge

.lr.ph:                                           ; preds = %.preheader15, %.lr.ph
  %.117 = phi i32 [ %34, %.lr.ph ], [ 0, %.preheader15 ]
  %29 = tail call i32 @rand() #7
  %30 = srem i32 %29, 10
  %31 = sext i32 %30 to i64
  %32 = getelementptr inbounds [10 x ptr], ptr %2, i64 0, i64 %31
  %33 = load ptr, ptr %32, align 8, !tbaa !5
  tail call void @QUEUEput(ptr noundef %33, i32 noundef %.117) #7
  %34 = add nuw nsw i32 %.117, 1
  %exitcond.not = icmp eq i32 %34, %5
  br i1 %exitcond.not, label %.preheader14, label %.lr.ph, !llvm.loop !9

.lr.ph19:                                         ; preds = %.preheader14, %.lr.ph19
  %35 = tail call i32 @QUEUEget(ptr noundef %8) #7
  %36 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %35)
  %37 = tail call i32 @QUEUEempty(ptr noundef %8) #7
  %.not = icmp eq i32 %37, 0
  br i1 %.not, label %.lr.ph19, label %._crit_edge, !llvm.loop !11

._crit_edge:                                      ; preds = %.lr.ph19, %.preheader14
  %38 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %39 = tail call i32 @QUEUEempty(ptr noundef %9) #7
  %.not18.1 = icmp eq i32 %39, 0
  br i1 %.not18.1, label %.lr.ph19.1, label %._crit_edge.1

.lr.ph19.1:                                       ; preds = %._crit_edge, %.lr.ph19.1
  %40 = tail call i32 @QUEUEget(ptr noundef %9) #7
  %41 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %40)
  %42 = tail call i32 @QUEUEempty(ptr noundef %9) #7
  %.not.1 = icmp eq i32 %42, 0
  br i1 %.not.1, label %.lr.ph19.1, label %._crit_edge.1, !llvm.loop !11

._crit_edge.1:                                    ; preds = %.lr.ph19.1, %._crit_edge
  %43 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %44 = tail call i32 @QUEUEempty(ptr noundef %11) #7
  %.not18.2 = icmp eq i32 %44, 0
  br i1 %.not18.2, label %.lr.ph19.2, label %._crit_edge.2

.lr.ph19.2:                                       ; preds = %._crit_edge.1, %.lr.ph19.2
  %45 = tail call i32 @QUEUEget(ptr noundef %11) #7
  %46 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %45)
  %47 = tail call i32 @QUEUEempty(ptr noundef %11) #7
  %.not.2 = icmp eq i32 %47, 0
  br i1 %.not.2, label %.lr.ph19.2, label %._crit_edge.2, !llvm.loop !11

._crit_edge.2:                                    ; preds = %.lr.ph19.2, %._crit_edge.1
  %48 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %49 = tail call i32 @QUEUEempty(ptr noundef %13) #7
  %.not18.3 = icmp eq i32 %49, 0
  br i1 %.not18.3, label %.lr.ph19.3, label %._crit_edge.3

.lr.ph19.3:                                       ; preds = %._crit_edge.2, %.lr.ph19.3
  %50 = tail call i32 @QUEUEget(ptr noundef %13) #7
  %51 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %50)
  %52 = tail call i32 @QUEUEempty(ptr noundef %13) #7
  %.not.3 = icmp eq i32 %52, 0
  br i1 %.not.3, label %.lr.ph19.3, label %._crit_edge.3, !llvm.loop !11

._crit_edge.3:                                    ; preds = %.lr.ph19.3, %._crit_edge.2
  %53 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %54 = tail call i32 @QUEUEempty(ptr noundef %15) #7
  %.not18.4 = icmp eq i32 %54, 0
  br i1 %.not18.4, label %.lr.ph19.4, label %._crit_edge.4

.lr.ph19.4:                                       ; preds = %._crit_edge.3, %.lr.ph19.4
  %55 = tail call i32 @QUEUEget(ptr noundef %15) #7
  %56 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %55)
  %57 = tail call i32 @QUEUEempty(ptr noundef %15) #7
  %.not.4 = icmp eq i32 %57, 0
  br i1 %.not.4, label %.lr.ph19.4, label %._crit_edge.4, !llvm.loop !11

._crit_edge.4:                                    ; preds = %.lr.ph19.4, %._crit_edge.3
  %58 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %59 = tail call i32 @QUEUEempty(ptr noundef %17) #7
  %.not18.5 = icmp eq i32 %59, 0
  br i1 %.not18.5, label %.lr.ph19.5, label %._crit_edge.5

.lr.ph19.5:                                       ; preds = %._crit_edge.4, %.lr.ph19.5
  %60 = tail call i32 @QUEUEget(ptr noundef %17) #7
  %61 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %60)
  %62 = tail call i32 @QUEUEempty(ptr noundef %17) #7
  %.not.5 = icmp eq i32 %62, 0
  br i1 %.not.5, label %.lr.ph19.5, label %._crit_edge.5, !llvm.loop !11

._crit_edge.5:                                    ; preds = %.lr.ph19.5, %._crit_edge.4
  %63 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %64 = tail call i32 @QUEUEempty(ptr noundef %19) #7
  %.not18.6 = icmp eq i32 %64, 0
  br i1 %.not18.6, label %.lr.ph19.6, label %._crit_edge.6

.lr.ph19.6:                                       ; preds = %._crit_edge.5, %.lr.ph19.6
  %65 = tail call i32 @QUEUEget(ptr noundef %19) #7
  %66 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %65)
  %67 = tail call i32 @QUEUEempty(ptr noundef %19) #7
  %.not.6 = icmp eq i32 %67, 0
  br i1 %.not.6, label %.lr.ph19.6, label %._crit_edge.6, !llvm.loop !11

._crit_edge.6:                                    ; preds = %.lr.ph19.6, %._crit_edge.5
  %68 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %69 = tail call i32 @QUEUEempty(ptr noundef %21) #7
  %.not18.7 = icmp eq i32 %69, 0
  br i1 %.not18.7, label %.lr.ph19.7, label %._crit_edge.7

.lr.ph19.7:                                       ; preds = %._crit_edge.6, %.lr.ph19.7
  %70 = tail call i32 @QUEUEget(ptr noundef %21) #7
  %71 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %70)
  %72 = tail call i32 @QUEUEempty(ptr noundef %21) #7
  %.not.7 = icmp eq i32 %72, 0
  br i1 %.not.7, label %.lr.ph19.7, label %._crit_edge.7, !llvm.loop !11

._crit_edge.7:                                    ; preds = %.lr.ph19.7, %._crit_edge.6
  %73 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %74 = tail call i32 @QUEUEempty(ptr noundef %23) #7
  %.not18.8 = icmp eq i32 %74, 0
  br i1 %.not18.8, label %.lr.ph19.8, label %._crit_edge.8

.lr.ph19.8:                                       ; preds = %._crit_edge.7, %.lr.ph19.8
  %75 = tail call i32 @QUEUEget(ptr noundef %23) #7
  %76 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %75)
  %77 = tail call i32 @QUEUEempty(ptr noundef %23) #7
  %.not.8 = icmp eq i32 %77, 0
  br i1 %.not.8, label %.lr.ph19.8, label %._crit_edge.8, !llvm.loop !11

._crit_edge.8:                                    ; preds = %.lr.ph19.8, %._crit_edge.7
  %78 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  %79 = tail call i32 @QUEUEempty(ptr noundef %25) #7
  %.not18.9 = icmp eq i32 %79, 0
  br i1 %.not18.9, label %.lr.ph19.9, label %._crit_edge.9

.lr.ph19.9:                                       ; preds = %._crit_edge.8, %.lr.ph19.9
  %80 = tail call i32 @QUEUEget(ptr noundef %25) #7
  %81 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str, i32 noundef %80)
  %82 = tail call i32 @QUEUEempty(ptr noundef %25) #7
  %.not.9 = icmp eq i32 %82, 0
  br i1 %.not.9, label %.lr.ph19.9, label %._crit_edge.9, !llvm.loop !11

._crit_edge.9:                                    ; preds = %.lr.ph19.9, %._crit_edge.8
  %83 = tail call i32 (ptr, ...) @printf(ptr noundef nonnull dereferenceable(1) @.str.1)
  call void @llvm.lifetime.end.p0(i64 80, ptr nonnull %2) #7
  ret i32 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: inlinehint mustprogress nofree nounwind willreturn memory(read) uwtable
declare i32 @atoi(ptr nocapture noundef nonnull) local_unnamed_addr #2

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

; Function Attrs: nounwind
declare i64 @time(ptr noundef) local_unnamed_addr #3

declare ptr @QUEUEinit(i32 noundef) local_unnamed_addr #4

declare void @QUEUEput(ptr noundef, i32 noundef) local_unnamed_addr #4

; Function Attrs: nounwind
declare i32 @rand() local_unnamed_addr #3

declare i32 @QUEUEempty(ptr noundef) local_unnamed_addr #4

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

declare i32 @QUEUEget(ptr noundef) local_unnamed_addr #4

; Function Attrs: mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #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 = { mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { inlinehint mustprogress nofree nounwind willreturn memory(read) 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 #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 = { "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 = { 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 #6 = { nounwind willreturn memory(read) }
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 = distinct !{!9, !10}
!10 = !{!"llvm.loop.mustprogress"}
!11 = distinct !{!11, !10}


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