; LLVM IR from qc-tum/chemtensor :: src/tensor (su2_graph)

; 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.su2_graph = type { ptr, ptr, i32, i32 }
%struct.su2_graph_edge = type { [2 x i32] }
%struct.su2_graph_node = type { i32, [2 x i32], i32 }
%struct.su2_fuse_split_tree = type { ptr, ptr, i32 }

@.str.1 = external hidden unnamed_addr constant [74 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [46 x i8], align 1
@__PRETTY_FUNCTION__.su2_graph_to_fuse_split_tree = external hidden unnamed_addr constant [90 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

; Function Attrs: nounwind uwtable
declare dso_local zeroext i1 @su2_graph_has_fuse_split_tree_topology(ptr noundef) #2

; Function Attrs: inlinehint nounwind uwtable
declare hidden zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef, i32 noundef) #3

; Function Attrs: inlinehint nounwind uwtable
declare hidden zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef, i32 noundef) #3

; Function Attrs: nounwind uwtable
define dso_local void @su2_graph_to_fuse_split_tree(ptr noundef %0, ptr noundef %1) #2 {
  %3 = alloca ptr, align 8
  %4 = alloca ptr, align 8
  %5 = alloca i32, align 4
  store ptr %0, ptr %3, align 8, !tbaa !5
  store ptr %1, ptr %4, align 8, !tbaa !5
  %6 = load ptr, ptr %3, align 8, !tbaa !5
  %7 = call zeroext i1 @su2_graph_has_fuse_split_tree_topology(ptr noundef %6)
  br i1 %7, label %8, label %9

8:                                                ; preds = %2
  br label %10

9:                                                ; preds = %2
  call void @__assert_fail(ptr noundef @.str.5, ptr noundef @.str.1, i32 noundef 347, ptr noundef @__PRETTY_FUNCTION__.su2_graph_to_fuse_split_tree) #4
  unreachable

10:                                               ; preds = %8
  call void @llvm.lifetime.start.p0(i64 4, ptr %5) #5
  store i32 0, ptr %5, align 4, !tbaa !9
  br label %11

11:                                               ; preds = %38, %10
  %12 = load ptr, ptr %3, align 8, !tbaa !5
  %13 = load ptr, ptr %3, align 8, !tbaa !5
  %14 = getelementptr inbounds %struct.su2_graph, ptr %13, i32 0, i32 1
  %15 = load ptr, ptr %14, align 8, !tbaa !11
  %16 = load i32, ptr %5, align 4, !tbaa !9
  %17 = sext i32 %16 to i64
  %18 = getelementptr inbounds %struct.su2_graph_edge, ptr %15, i64 %17
  %19 = getelementptr inbounds %struct.su2_graph_edge, ptr %18, i32 0, i32 0
  %20 = getelementptr inbounds [2 x i32], ptr %19, i64 0, i64 0
  %21 = load i32, ptr %20, align 4, !tbaa !9
  %22 = call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef %12, i32 noundef %21)
  br i1 %22, label %23, label %36

23:                                               ; preds = %11
  %24 = load ptr, ptr %3, align 8, !tbaa !5
  %25 = load ptr, ptr %3, align 8, !tbaa !5
  %26 = getelementptr inbounds %struct.su2_graph, ptr %25, i32 0, i32 1
  %27 = load ptr, ptr %26, align 8, !tbaa !11
  %28 = load i32, ptr %5, align 4, !tbaa !9
  %29 = sext i32 %28 to i64
  %30 = getelementptr inbounds %struct.su2_graph_edge, ptr %27, i64 %29
  %31 = getelementptr inbounds %struct.su2_graph_edge, ptr %30, i32 0, i32 0
  %32 = getelementptr inbounds [2 x i32], ptr %31, i64 0, i64 1
  %33 = load i32, ptr %32, align 4, !tbaa !9
  %34 = call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef %24, i32 noundef %33)
  %35 = xor i1 %34, true
  br label %36

36:                                               ; preds = %23, %11
  %37 = phi i1 [ false, %11 ], [ %35, %23 ]
  br i1 %37, label %38, label %55

38:                                               ; preds = %36
  %39 = load ptr, ptr %3, align 8, !tbaa !5
  %40 = getelementptr inbounds %struct.su2_graph, ptr %39, i32 0, i32 0
  %41 = load ptr, ptr %40, align 8, !tbaa !13
  %42 = load ptr, ptr %3, align 8, !tbaa !5
  %43 = getelementptr inbounds %struct.su2_graph, ptr %42, i32 0, i32 1
  %44 = load ptr, ptr %43, align 8, !tbaa !11
  %45 = load i32, ptr %5, align 4, !tbaa !9
  %46 = sext i32 %45 to i64
  %47 = getelementptr inbounds %struct.su2_graph_edge, ptr %44, i64 %46
  %48 = getelementptr inbounds %struct.su2_graph_edge, ptr %47, i32 0, i32 0
  %49 = getelementptr inbounds [2 x i32], ptr %48, i64 0, i64 1
  %50 = load i32, ptr %49, align 4, !tbaa !9
  %51 = sext i32 %50 to i64
  %52 = getelementptr inbounds %struct.su2_graph_node, ptr %41, i64 %51
  %53 = getelementptr inbounds %struct.su2_graph_node, ptr %52, i32 0, i32 0
  %54 = load i32, ptr %53, align 4, !tbaa !14
  store i32 %54, ptr %5, align 4, !tbaa !9
  br label %11, !llvm.loop !16

55:                                               ; preds = %36
  br label %56

56:                                               ; preds = %83, %55
  %57 = load ptr, ptr %3, align 8, !tbaa !5
  %58 = load ptr, ptr %3, align 8, !tbaa !5
  %59 = getelementptr inbounds %struct.su2_graph, ptr %58, i32 0, i32 1
  %60 = load ptr, ptr %59, align 8, !tbaa !11
  %61 = load i32, ptr %5, align 4, !tbaa !9
  %62 = sext i32 %61 to i64
  %63 = getelementptr inbounds %struct.su2_graph_edge, ptr %60, i64 %62
  %64 = getelementptr inbounds %struct.su2_graph_edge, ptr %63, i32 0, i32 0
  %65 = getelementptr inbounds [2 x i32], ptr %64, i64 0, i64 1
  %66 = load i32, ptr %65, align 4, !tbaa !9
  %67 = call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef %57, i32 noundef %66)
  br i1 %67, label %68, label %81

68:                                               ; preds = %56
  %69 = load ptr, ptr %3, align 8, !tbaa !5
  %70 = load ptr, ptr %3, align 8, !tbaa !5
  %71 = getelementptr inbounds %struct.su2_graph, ptr %70, i32 0, i32 1
  %72 = load ptr, ptr %71, align 8, !tbaa !11
  %73 = load i32, ptr %5, align 4, !tbaa !9
  %74 = sext i32 %73 to i64
  %75 = getelementptr inbounds %struct.su2_graph_edge, ptr %72, i64 %74
  %76 = getelementptr inbounds %struct.su2_graph_edge, ptr %75, i32 0, i32 0
  %77 = getelementptr inbounds [2 x i32], ptr %76, i64 0, i64 0
  %78 = load i32, ptr %77, align 4, !tbaa !9
  %79 = call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef %69, i32 noundef %78)
  %80 = xor i1 %79, true
  br label %81

81:                                               ; preds = %68, %56
  %82 = phi i1 [ false, %56 ], [ %80, %68 ]
  br i1 %82, label %83, label %100

83:                                               ; preds = %81
  %84 = load ptr, ptr %3, align 8, !tbaa !5
  %85 = getelementptr inbounds %struct.su2_graph, ptr %84, i32 0, i32 0
  %86 = load ptr, ptr %85, align 8, !tbaa !13
  %87 = load ptr, ptr %3, align 8, !tbaa !5
  %88 = getelementptr inbounds %struct.su2_graph, ptr %87, i32 0, i32 1
  %89 = load ptr, ptr %88, align 8, !tbaa !11
  %90 = load i32, ptr %5, align 4, !tbaa !9
  %91 = sext i32 %90 to i64
  %92 = getelementptr inbounds %struct.su2_graph_edge, ptr %89, i64 %91
  %93 = getelementptr inbounds %struct.su2_graph_edge, ptr %92, i32 0, i32 0
  %94 = getelementptr inbounds [2 x i32], ptr %93, i64 0, i64 0
  %95 = load i32, ptr %94, align 4, !tbaa !9
  %96 = sext i32 %95 to i64
  %97 = getelementptr inbounds %struct.su2_graph_node, ptr %86, i64 %96
  %98 = getelementptr inbounds %struct.su2_graph_node, ptr %97, i32 0, i32 0
  %99 = load i32, ptr %98, align 4, !tbaa !14
  store i32 %99, ptr %5, align 4, !tbaa !9
  br label %56, !llvm.loop !18

100:                                              ; preds = %81
  %101 = load ptr, ptr %3, align 8, !tbaa !5
  %102 = load i32, ptr %5, align 4, !tbaa !9
  %103 = call ptr @su2_subgraph_to_tree(ptr noundef %101, i32 noundef %102, i32 noundef 0)
  %104 = load ptr, ptr %4, align 8, !tbaa !5
  %105 = getelementptr inbounds %struct.su2_fuse_split_tree, ptr %104, i32 0, i32 0
  store ptr %103, ptr %105, align 8, !tbaa !19
  %106 = load ptr, ptr %3, align 8, !tbaa !5
  %107 = load i32, ptr %5, align 4, !tbaa !9
  %108 = call ptr @su2_subgraph_to_tree(ptr noundef %106, i32 noundef %107, i32 noundef 1)
  %109 = load ptr, ptr %4, align 8, !tbaa !5
  %110 = getelementptr inbounds %struct.su2_fuse_split_tree, ptr %109, i32 0, i32 1
  store ptr %108, ptr %110, align 8, !tbaa !21
  %111 = load ptr, ptr %3, align 8, !tbaa !5
  %112 = getelementptr inbounds %struct.su2_graph, ptr %111, i32 0, i32 3
  %113 = load i32, ptr %112, align 4, !tbaa !22
  %114 = load ptr, ptr %4, align 8, !tbaa !5
  %115 = getelementptr inbounds %struct.su2_fuse_split_tree, ptr %114, i32 0, i32 2
  store i32 %113, ptr %115, align 8, !tbaa !23
  call void @llvm.lifetime.end.p0(i64 4, ptr %5) #5
  ret void
}

; Function Attrs: nounwind uwtable
declare hidden ptr @su2_subgraph_to_tree(ptr noundef, i32 noundef, i32 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 = { 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 #3 = { 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 #4 = { noreturn nounwind }
attributes #5 = { 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 = !{!12, !6, i64 8}
!12 = !{!"su2_graph", !6, i64 0, !6, i64 8, !10, i64 16, !10, i64 20}
!13 = !{!12, !6, i64 0}
!14 = !{!15, !10, i64 0}
!15 = !{!"su2_graph_node", !10, i64 0, !7, i64 4, !10, i64 12}
!16 = distinct !{!16, !17}
!17 = !{!"llvm.loop.mustprogress"}
!18 = distinct !{!18, !17}
!19 = !{!20, !6, i64 0}
!20 = !{!"su2_fuse_split_tree", !6, i64 0, !6, i64 8, !10, i64 16}
!21 = !{!20, !6, i64 8}
!22 = !{!12, !10, i64 20}
!23 = !{!20, !10, i64 16}


; 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.su2_graph_edge = type { [2 x i32] }
%struct.su2_graph_node = type { i32, [2 x i32], i32 }

@.str.1 = external hidden unnamed_addr constant [74 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [46 x i8], align 1
@__PRETTY_FUNCTION__.su2_graph_to_fuse_split_tree = external hidden unnamed_addr constant [90 x i8], align 1

; Function Attrs: noreturn nounwind
declare void @__assert_fail(ptr noundef, ptr noundef, i32 noundef, ptr noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
declare dso_local zeroext i1 @su2_graph_has_fuse_split_tree_topology(ptr noundef) local_unnamed_addr #1

; Function Attrs: inlinehint nounwind uwtable
declare hidden zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: inlinehint nounwind uwtable
declare hidden zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
define dso_local void @su2_graph_to_fuse_split_tree(ptr noundef %0, ptr nocapture noundef writeonly %1) local_unnamed_addr #1 {
  %3 = tail call zeroext i1 @su2_graph_has_fuse_split_tree_topology(ptr noundef %0)
  br i1 %3, label %.preheader, label %12

.preheader:                                       ; preds = %2
  %4 = getelementptr inbounds i8, ptr %0, i64 8
  %5 = load ptr, ptr %4, align 8, !tbaa !5
  %6 = load i32, ptr %5, align 4, !tbaa !11
  %7 = tail call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef %0, i32 noundef %6)
  br i1 %7, label %.lr.ph.preheader, label %.critedge

.lr.ph.preheader:                                 ; preds = %.preheader
  %8 = load ptr, ptr %4, align 8, !tbaa !5
  %9 = getelementptr inbounds i8, ptr %8, i64 4
  %10 = load i32, ptr %9, align 4, !tbaa !11
  %11 = tail call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef nonnull %0, i32 noundef %10)
  br i1 %11, label %.critedge, label %.lr.ph38

12:                                               ; preds = %2
  tail call void @__assert_fail(ptr noundef nonnull @.str.5, ptr noundef nonnull @.str.1, i32 noundef 347, ptr noundef nonnull @__PRETTY_FUNCTION__.su2_graph_to_fuse_split_tree) #3
  unreachable

.lr.ph:                                           ; preds = %.lr.ph38
  %13 = load ptr, ptr %4, align 8, !tbaa !5
  %14 = getelementptr inbounds %struct.su2_graph_edge, ptr %13, i64 %25, i32 0, i64 1
  %15 = load i32, ptr %14, align 4, !tbaa !11
  %16 = tail call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef nonnull %0, i32 noundef %15)
  br i1 %16, label %.critedge, label %.lr.ph38, !llvm.loop !12

.lr.ph38:                                         ; preds = %.lr.ph.preheader, %.lr.ph
  %17 = phi i64 [ %25, %.lr.ph ], [ 0, %.lr.ph.preheader ]
  %18 = load ptr, ptr %0, align 8, !tbaa !14
  %19 = load ptr, ptr %4, align 8, !tbaa !5
  %20 = getelementptr inbounds %struct.su2_graph_edge, ptr %19, i64 %17, i32 0, i64 1
  %21 = load i32, ptr %20, align 4, !tbaa !11
  %22 = sext i32 %21 to i64
  %23 = getelementptr inbounds %struct.su2_graph_node, ptr %18, i64 %22
  %24 = load i32, ptr %23, align 4, !tbaa !15
  %25 = sext i32 %24 to i64
  %26 = getelementptr inbounds %struct.su2_graph_edge, ptr %19, i64 %25
  %27 = load i32, ptr %26, align 4, !tbaa !11
  %28 = tail call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef nonnull %0, i32 noundef %27)
  br i1 %28, label %.lr.ph, label %.critedge, !llvm.loop !12

.critedge:                                        ; preds = %.lr.ph38, %.lr.ph, %.lr.ph.preheader, %.preheader
  %.0.lcssa = phi i32 [ 0, %.preheader ], [ 0, %.lr.ph.preheader ], [ %24, %.lr.ph ], [ %24, %.lr.ph38 ]
  %29 = load ptr, ptr %4, align 8, !tbaa !5
  %30 = sext i32 %.0.lcssa to i64
  %31 = getelementptr inbounds %struct.su2_graph_edge, ptr %29, i64 %30, i32 0, i64 1
  %32 = load i32, ptr %31, align 4, !tbaa !11
  %33 = tail call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef nonnull %0, i32 noundef %32)
  br i1 %33, label %.lr.ph34.preheader, label %.critedge2

.lr.ph34.preheader:                               ; preds = %.critedge
  %34 = load ptr, ptr %4, align 8, !tbaa !5
  %35 = getelementptr inbounds %struct.su2_graph_edge, ptr %34, i64 %30
  %36 = load i32, ptr %35, align 4, !tbaa !11
  %37 = tail call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef nonnull %0, i32 noundef %36)
  br i1 %37, label %.critedge2, label %.lr.ph40

.lr.ph34:                                         ; preds = %.lr.ph40
  %38 = load ptr, ptr %4, align 8, !tbaa !5
  %39 = getelementptr inbounds %struct.su2_graph_edge, ptr %38, i64 %50
  %40 = load i32, ptr %39, align 4, !tbaa !11
  %41 = tail call zeroext i1 @su2_graph_node_fuse_or_leaf(ptr noundef nonnull %0, i32 noundef %40)
  br i1 %41, label %.critedge2, label %.lr.ph40, !llvm.loop !17

.lr.ph40:                                         ; preds = %.lr.ph34.preheader, %.lr.ph34
  %42 = phi i64 [ %50, %.lr.ph34 ], [ %30, %.lr.ph34.preheader ]
  %43 = load ptr, ptr %0, align 8, !tbaa !14
  %44 = load ptr, ptr %4, align 8, !tbaa !5
  %45 = getelementptr inbounds %struct.su2_graph_edge, ptr %44, i64 %42
  %46 = load i32, ptr %45, align 4, !tbaa !11
  %47 = sext i32 %46 to i64
  %48 = getelementptr inbounds %struct.su2_graph_node, ptr %43, i64 %47
  %49 = load i32, ptr %48, align 4, !tbaa !15
  %50 = sext i32 %49 to i64
  %51 = getelementptr inbounds %struct.su2_graph_edge, ptr %44, i64 %50, i32 0, i64 1
  %52 = load i32, ptr %51, align 4, !tbaa !11
  %53 = tail call zeroext i1 @su2_graph_node_split_or_leaf(ptr noundef nonnull %0, i32 noundef %52)
  br i1 %53, label %.lr.ph34, label %.critedge2, !llvm.loop !17

.critedge2:                                       ; preds = %.lr.ph40, %.lr.ph34, %.lr.ph34.preheader, %.critedge
  %.1.lcssa = phi i32 [ %.0.lcssa, %.critedge ], [ %.0.lcssa, %.lr.ph34.preheader ], [ %49, %.lr.ph34 ], [ %49, %.lr.ph40 ]
  %54 = tail call ptr @su2_subgraph_to_tree(ptr noundef nonnull %0, i32 noundef %.1.lcssa, i32 noundef 0)
  store ptr %54, ptr %1, align 8, !tbaa !18
  %55 = tail call ptr @su2_subgraph_to_tree(ptr noundef nonnull %0, i32 noundef %.1.lcssa, i32 noundef 1)
  %56 = getelementptr inbounds i8, ptr %1, i64 8
  store ptr %55, ptr %56, align 8, !tbaa !20
  %57 = getelementptr inbounds i8, ptr %0, i64 20
  %58 = load i32, ptr %57, align 4, !tbaa !21
  %59 = getelementptr inbounds i8, ptr %1, i64 16
  store i32 %58, ptr %59, align 8, !tbaa !22
  ret void
}

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

attributes #0 = { 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 #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 = { 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 #3 = { 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, !7, i64 8}
!6 = !{!"su2_graph", !7, i64 0, !7, i64 8, !10, i64 16, !10, i64 20}
!7 = !{!"any pointer", !8, i64 0}
!8 = !{!"omnipotent char", !9, i64 0}
!9 = !{!"Simple C/C++ TBAA"}
!10 = !{!"int", !8, i64 0}
!11 = !{!10, !10, i64 0}
!12 = distinct !{!12, !13}
!13 = !{!"llvm.loop.mustprogress"}
!14 = !{!6, !7, i64 0}
!15 = !{!16, !10, i64 0}
!16 = !{!"su2_graph_node", !10, i64 0, !8, i64 4, !10, i64 12}
!17 = distinct !{!17, !13}
!18 = !{!19, !7, i64 0}
!19 = !{!"su2_fuse_split_tree", !7, i64 0, !7, i64 8, !10, i64 16}
!20 = !{!19, !7, i64 8}
!21 = !{!6, !10, i64 20}
!22 = !{!19, !10, i64 16}


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