; LLVM IR from clausecker/24puzzle :: bitpdb (bitpdb_lookup_puzzle)

; 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.puzzle = type { [25 x i8], [7 x i8], [25 x i8], [7 x i8] }
%struct.move = type { i32, i32 }
%struct.index = type { i32, i32, i32 }
%struct.bitpdb = type { %struct.index_aux, i32, ptr, [16 x i8] }
%struct.index_aux = type { [32 x i8], [16 x i8], i32, i32, i32, i32, i32, ptr, [16 x i8] }

@.str.1 = external hidden unnamed_addr constant [62 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [12 x i8], align 1
@__PRETTY_FUNCTION__.bitpdb_lookup_puzzle = external hidden unnamed_addr constant [65 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [11 x i8], align 1
@solved_puzzle = external constant %struct.puzzle, align 8
@.str.4 = external hidden unnamed_addr constant [55 x i8], align 1

; 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: noreturn nounwind
declare void @__assert_fail(ptr noundef, ptr noundef, i32 noundef, ptr noundef) #1

declare void @compute_index(ptr noundef, ptr noundef, ptr noundef) #2

; Function Attrs: nounwind uwtable
declare hidden i32 @bitpdb_diff_lookup_idx(ptr noundef, ptr noundef, i32 noundef, ptr noundef) #3

; Function Attrs: nounwind uwtable
define dso_local i32 @bitpdb_lookup_puzzle(ptr noundef %0, ptr noundef %1) #3 {
  %3 = alloca ptr, align 8
  %4 = alloca ptr, align 8
  %5 = alloca [80 x %struct.move], align 16
  %6 = alloca %struct.index, align 4
  %7 = alloca %struct.puzzle, align 8
  %8 = alloca i64, align 8
  %9 = alloca i64, align 8
  %10 = alloca i32, align 4
  %11 = alloca i32, align 4
  %12 = alloca i32, align 4
  store ptr %0, ptr %3, align 8, !tbaa !5
  store ptr %1, ptr %4, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 640, ptr %5) #7
  call void @llvm.lifetime.start.p0(i64 12, ptr %6) #7
  call void @llvm.lifetime.start.p0(i64 64, ptr %7) #7
  %13 = load ptr, ptr %4, align 8, !tbaa !5
  call void @llvm.memcpy.p0.p0.i64(ptr align 8 %7, ptr align 8 %13, i64 64, i1 false), !tbaa.struct !9
  call void @llvm.lifetime.start.p0(i64 8, ptr %8) #7
  call void @llvm.lifetime.start.p0(i64 8, ptr %9) #7
  call void @llvm.lifetime.start.p0(i64 4, ptr %10) #7
  call void @llvm.lifetime.start.p0(i64 4, ptr %11) #7
  call void @llvm.lifetime.start.p0(i64 4, ptr %12) #7
  %14 = load ptr, ptr %3, align 8, !tbaa !5
  %15 = getelementptr inbounds %struct.bitpdb, ptr %14, i32 0, i32 0
  call void @compute_index(ptr noundef %15, ptr noundef %6, ptr noundef %7)
  %16 = load ptr, ptr %3, align 8, !tbaa !5
  %17 = getelementptr inbounds %struct.bitpdb, ptr %16, i32 0, i32 0
  %18 = call i32 @partial_parity(ptr noundef %17, ptr noundef %7)
  %19 = or i32 256, %18
  %20 = load ptr, ptr %3, align 8, !tbaa !5
  %21 = call i32 @bitpdb_lookup_bit(ptr noundef %20, ptr noundef %6)
  %22 = or i32 %19, %21
  store i32 %22, ptr %10, align 4, !tbaa !11
  %23 = load i32, ptr %10, align 4, !tbaa !11
  store i32 %23, ptr %12, align 4, !tbaa !11
  br label %24

24:                                               ; preds = %75, %2
  %25 = load i32, ptr %12, align 4, !tbaa !11
  store i32 %25, ptr %11, align 4, !tbaa !11
  %26 = getelementptr inbounds [80 x %struct.move], ptr %5, i64 0, i64 0
  %27 = load ptr, ptr %3, align 8, !tbaa !5
  %28 = getelementptr inbounds %struct.bitpdb, ptr %27, i32 0, i32 0
  %29 = call i32 @eqclass_from_index(ptr noundef %28, ptr noundef %6)
  %30 = call i64 @generate_moves(ptr noundef %26, i32 noundef %29)
  store i64 %30, ptr %8, align 8, !tbaa !13
  %31 = load i64, ptr %8, align 8, !tbaa !13
  %32 = icmp ugt i64 %31, 0
  br i1 %32, label %33, label %34

33:                                               ; preds = %24
  br label %35

34:                                               ; preds = %24
  call void @__assert_fail(ptr noundef @.str.2, ptr noundef @.str.1, i32 noundef 312, ptr noundef @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

35:                                               ; preds = %33
  store i64 0, ptr %9, align 8, !tbaa !13
  br label %36

36:                                               ; preds = %66, %35
  %37 = load i64, ptr %9, align 8, !tbaa !13
  %38 = load i64, ptr %8, align 8, !tbaa !13
  %39 = icmp ult i64 %37, %38
  br i1 %39, label %40, label %69

40:                                               ; preds = %36
  %41 = load i64, ptr %9, align 8, !tbaa !13
  %42 = getelementptr inbounds [80 x %struct.move], ptr %5, i64 0, i64 %41
  %43 = getelementptr inbounds %struct.move, ptr %42, i32 0, i32 0
  %44 = load i32, ptr %43, align 8, !tbaa !15
  %45 = zext i32 %44 to i64
  call void @move(ptr noundef %7, i64 noundef %45)
  %46 = load i64, ptr %9, align 8, !tbaa !13
  %47 = getelementptr inbounds [80 x %struct.move], ptr %5, i64 0, i64 %46
  %48 = getelementptr inbounds %struct.move, ptr %47, i32 0, i32 1
  %49 = load i32, ptr %48, align 4, !tbaa !17
  %50 = zext i32 %49 to i64
  call void @move(ptr noundef %7, i64 noundef %50)
  %51 = load ptr, ptr %3, align 8, !tbaa !5
  %52 = getelementptr inbounds %struct.bitpdb, ptr %51, i32 0, i32 0
  call void @compute_index(ptr noundef %52, ptr noundef %6, ptr noundef %7)
  %53 = load ptr, ptr %3, align 8, !tbaa !5
  %54 = load i32, ptr %11, align 4, !tbaa !11
  %55 = call i32 @bitpdb_diff_lookup_idx(ptr noundef %53, ptr noundef %7, i32 noundef %54, ptr noundef %6)
  store i32 %55, ptr %12, align 4, !tbaa !11
  %56 = load i32, ptr %12, align 4, !tbaa !11
  %57 = load i32, ptr %11, align 4, !tbaa !11
  %58 = icmp slt i32 %56, %57
  br i1 %58, label %59, label %60

59:                                               ; preds = %40
  br label %69

60:                                               ; preds = %40
  %61 = load i64, ptr %9, align 8, !tbaa !13
  %62 = getelementptr inbounds [80 x %struct.move], ptr %5, i64 0, i64 %61
  %63 = getelementptr inbounds %struct.move, ptr %62, i32 0, i32 0
  %64 = load i32, ptr %63, align 8, !tbaa !15
  %65 = zext i32 %64 to i64
  call void @move(ptr noundef %7, i64 noundef %65)
  br label %66

66:                                               ; preds = %60
  %67 = load i64, ptr %9, align 8, !tbaa !13
  %68 = add i64 %67, 1
  store i64 %68, ptr %9, align 8, !tbaa !13
  br label %36, !llvm.loop !18

69:                                               ; preds = %59, %36
  %70 = load i32, ptr %12, align 4, !tbaa !11
  %71 = icmp sgt i32 %70, 0
  br i1 %71, label %72, label %73

72:                                               ; preds = %69
  br label %74

73:                                               ; preds = %69
  call void @__assert_fail(ptr noundef @.str.3, ptr noundef @.str.1, i32 noundef 326, ptr noundef @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

74:                                               ; preds = %72
  br label %75

75:                                               ; preds = %74
  %76 = load i32, ptr %12, align 4, !tbaa !11
  %77 = load i32, ptr %11, align 4, !tbaa !11
  %78 = icmp slt i32 %76, %77
  br i1 %78, label %24, label %79, !llvm.loop !20

79:                                               ; preds = %75
  %80 = load ptr, ptr %3, align 8, !tbaa !5
  %81 = getelementptr inbounds %struct.bitpdb, ptr %80, i32 0, i32 0
  %82 = call i32 @puzzle_partially_equal(ptr noundef @solved_puzzle, ptr noundef %7, ptr noundef %81)
  %83 = icmp ne i32 %82, 0
  br i1 %83, label %84, label %85

84:                                               ; preds = %79
  br label %86

85:                                               ; preds = %79
  call void @__assert_fail(ptr noundef @.str.4, ptr noundef @.str.1, i32 noundef 330, ptr noundef @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

86:                                               ; preds = %84
  %87 = load i32, ptr %10, align 4, !tbaa !11
  %88 = load i32, ptr %11, align 4, !tbaa !11
  %89 = sub nsw i32 %87, %88
  call void @llvm.lifetime.end.p0(i64 4, ptr %12) #7
  call void @llvm.lifetime.end.p0(i64 4, ptr %11) #7
  call void @llvm.lifetime.end.p0(i64 4, ptr %10) #7
  call void @llvm.lifetime.end.p0(i64 8, ptr %9) #7
  call void @llvm.lifetime.end.p0(i64 8, ptr %8) #7
  call void @llvm.lifetime.end.p0(i64 64, ptr %7) #7
  call void @llvm.lifetime.end.p0(i64 12, ptr %6) #7
  call void @llvm.lifetime.end.p0(i64 640, ptr %5) #7
  ret i32 %89
}

; 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
declare hidden i32 @partial_parity(ptr noundef, ptr noundef) #3

; Function Attrs: nounwind uwtable
declare hidden i32 @bitpdb_lookup_bit(ptr noundef, ptr noundef) #3

declare i64 @generate_moves(ptr noundef, i32 noundef) #2

; Function Attrs: inlinehint nounwind uwtable
declare hidden i32 @eqclass_from_index(ptr noundef, ptr noundef) #5

; Function Attrs: inlinehint nounwind uwtable
declare hidden void @move(ptr noundef, i64 noundef) #6

declare i32 @puzzle_partially_equal(ptr noundef, ptr noundef, ptr noundef) #2

attributes #0 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #1 = { 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 #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 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 #4 = { nocallback nofree nounwind willreturn memory(argmem: readwrite) }
attributes #5 = { inlinehint nounwind uwtable "min-legal-vector-width"="128" "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 = { inlinehint 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 #7 = { nounwind }
attributes #8 = { 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 = !{i64 0, i64 25, !10, i64 32, i64 25, !10}
!10 = !{!7, !7, i64 0}
!11 = !{!12, !12, i64 0}
!12 = !{!"int", !7, i64 0}
!13 = !{!14, !14, i64 0}
!14 = !{!"long", !7, i64 0}
!15 = !{!16, !12, i64 0}
!16 = !{!"move", !12, i64 0, !12, i64 4}
!17 = !{!16, !12, i64 4}
!18 = distinct !{!18, !19}
!19 = !{!"llvm.loop.mustprogress"}
!20 = distinct !{!20, !19}


; 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.puzzle = type { [25 x i8], [7 x i8], [25 x i8], [7 x i8] }
%struct.move = type { i32, i32 }
%struct.index = type { i32, i32, i32 }

@.str.1 = external hidden unnamed_addr constant [62 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [12 x i8], align 1
@__PRETTY_FUNCTION__.bitpdb_lookup_puzzle = external hidden unnamed_addr constant [65 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [11 x i8], align 1
@solved_puzzle = external constant %struct.puzzle, align 8
@.str.4 = external hidden unnamed_addr constant [55 x i8], align 1

; 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: noreturn nounwind
declare void @__assert_fail(ptr noundef, ptr noundef, i32 noundef, ptr noundef) local_unnamed_addr #1

declare void @compute_index(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
declare hidden i32 @bitpdb_diff_lookup_idx(ptr noundef, ptr noundef, i32 noundef, ptr noundef) local_unnamed_addr #3

; Function Attrs: nounwind uwtable
define dso_local i32 @bitpdb_lookup_puzzle(ptr noundef %0, ptr nocapture noundef readonly %1) local_unnamed_addr #3 {
  %3 = alloca [80 x %struct.move], align 16
  %4 = alloca %struct.index, align 4
  %5 = alloca %struct.puzzle, align 8
  call void @llvm.lifetime.start.p0(i64 640, ptr nonnull %3) #7
  call void @llvm.lifetime.start.p0(i64 12, ptr nonnull %4) #7
  call void @llvm.lifetime.start.p0(i64 64, ptr nonnull %5) #7
  call void @llvm.memcpy.p0.p0.i64(ptr noundef nonnull align 8 dereferenceable(64) %5, ptr noundef nonnull align 8 dereferenceable(64) %1, i64 64, i1 false), !tbaa.struct !5
  call void @compute_index(ptr noundef %0, ptr noundef nonnull %4, ptr noundef nonnull %5) #7
  %6 = call i32 @partial_parity(ptr noundef %0, ptr noundef nonnull %5)
  %7 = call i32 @bitpdb_lookup_bit(ptr noundef %0, ptr noundef nonnull %4)
  %8 = or i32 %6, %7
  %9 = or i32 %8, 256
  br label %10

10:                                               ; preds = %26, %2
  %.0 = phi i32 [ %9, %2 ], [ %20, %26 ]
  %11 = call i32 @eqclass_from_index(ptr noundef %0, ptr noundef nonnull %4)
  %12 = call i64 @generate_moves(ptr noundef nonnull %3, i32 noundef %11) #7
  %.not = icmp eq i64 %12, 0
  br i1 %.not, label %13, label %.preheader

13:                                               ; preds = %10
  call void @__assert_fail(ptr noundef nonnull @.str.2, ptr noundef nonnull @.str.1, i32 noundef 312, ptr noundef nonnull @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

.preheader:                                       ; preds = %10, %22
  %.02431 = phi i64 [ %25, %22 ], [ 0, %10 ]
  %14 = getelementptr inbounds [80 x %struct.move], ptr %3, i64 0, i64 %.02431
  %15 = load i32, ptr %14, align 8, !tbaa !9
  %16 = zext i32 %15 to i64
  call void @move(ptr noundef nonnull %5, i64 noundef %16)
  %17 = getelementptr inbounds i8, ptr %14, i64 4
  %18 = load i32, ptr %17, align 4, !tbaa !12
  %19 = zext i32 %18 to i64
  call void @move(ptr noundef nonnull %5, i64 noundef %19)
  call void @compute_index(ptr noundef %0, ptr noundef nonnull %4, ptr noundef nonnull %5) #7
  %20 = call i32 @bitpdb_diff_lookup_idx(ptr noundef %0, ptr noundef nonnull %5, i32 noundef %.0, ptr noundef nonnull %4)
  %21 = icmp slt i32 %20, %.0
  br i1 %21, label %26, label %22

22:                                               ; preds = %.preheader
  %23 = load i32, ptr %14, align 8, !tbaa !9
  %24 = zext i32 %23 to i64
  call void @move(ptr noundef nonnull %5, i64 noundef %24)
  %25 = add nuw i64 %.02431, 1
  %exitcond.not = icmp eq i64 %25, %12
  br i1 %exitcond.not, label %.thread, label %.preheader, !llvm.loop !13

26:                                               ; preds = %.preheader
  %27 = icmp sgt i32 %20, 0
  br i1 %27, label %10, label %.loopexit

.thread:                                          ; preds = %22
  %28 = icmp sgt i32 %20, 0
  br i1 %28, label %29, label %.loopexit

.loopexit:                                        ; preds = %26, %.thread
  call void @__assert_fail(ptr noundef nonnull @.str.3, ptr noundef nonnull @.str.1, i32 noundef 326, ptr noundef nonnull @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

29:                                               ; preds = %.thread
  %30 = call i32 @puzzle_partially_equal(ptr noundef nonnull @solved_puzzle, ptr noundef nonnull %5, ptr noundef %0) #7
  %.not28 = icmp eq i32 %30, 0
  br i1 %.not28, label %31, label %32

31:                                               ; preds = %29
  call void @__assert_fail(ptr noundef nonnull @.str.4, ptr noundef nonnull @.str.1, i32 noundef 330, ptr noundef nonnull @__PRETTY_FUNCTION__.bitpdb_lookup_puzzle) #8
  unreachable

32:                                               ; preds = %29
  %33 = sub nsw i32 %9, %.0
  call void @llvm.lifetime.end.p0(i64 64, ptr nonnull %5) #7
  call void @llvm.lifetime.end.p0(i64 12, ptr nonnull %4) #7
  call void @llvm.lifetime.end.p0(i64 640, ptr nonnull %3) #7
  ret i32 %33
}

; Function Attrs: mustprogress 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
declare hidden i32 @partial_parity(ptr noundef, ptr noundef) local_unnamed_addr #3

; Function Attrs: nounwind uwtable
declare hidden i32 @bitpdb_lookup_bit(ptr noundef, ptr noundef) local_unnamed_addr #3

declare i64 @generate_moves(ptr noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: inlinehint nounwind uwtable
declare hidden i32 @eqclass_from_index(ptr noundef, ptr noundef) local_unnamed_addr #5

; Function Attrs: inlinehint nounwind uwtable
declare hidden void @move(ptr noundef, i64 noundef) local_unnamed_addr #6

declare i32 @puzzle_partially_equal(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #2

attributes #0 = { mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #1 = { 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 #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 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 #4 = { mustprogress nocallback nofree nounwind willreturn memory(argmem: readwrite) }
attributes #5 = { inlinehint nounwind uwtable "min-legal-vector-width"="128" "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 = { inlinehint 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 #7 = { nounwind }
attributes #8 = { 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 = !{i64 0, i64 25, !6, i64 32, i64 25, !6}
!6 = !{!7, !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"move", !11, i64 0, !11, i64 4}
!11 = !{!"int", !7, i64 0}
!12 = !{!10, !11, i64 4}
!13 = distinct !{!13, !14}
!14 = !{!"llvm.loop.mustprogress"}


; Effective O3 passes: EarlyCSEPass,GVNPass,GlobalOptPass,IPSCCPPass,IndVarSimplifyPass,InferFunctionAttrsPass,InstCombinePass,InstSimplifyPass,JumpThreadingPass,LCSSAPass,LoopRotatePass,LoopSimplifyPass,LoopUnrollPass,PostOrderFunctionAttrsPass,ReassociatePass,SROAPass,SimplifyCFGPass