Mercurial > hg > CbC > CbC_llvm

comparison polly/test/ScopDetect/ignore_func_flag_regex.ll @ 252:1f2b6ac9f198 llvm-original

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
LLVM16-1
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Fri, 18 Aug 2023 09:04:13 +0900
parents c4bab56944e8
children
comparison
equal deleted inserted replaced
237:c80f45b162ad 252:1f2b6ac9f198
23 ; for (int i = 0; i <= 100; i++) 23 ; for (int i = 0; i <= 100; i++)
24 ; sum += i * 3; 24 ; sum += i * 3;
25 ; } 25 ; }
26 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64" 26 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
27 27
28 define void @f1(i32* %sum) { 28 define void @f1(ptr %sum) {
29 entry: 29 entry:
30 br label %entry.split1 30 br label %entry.split1
31 31
32 entry.split1: ; preds = %entry 32 entry.split1: ; preds = %entry
33 br label %entry.split 33 br label %entry.split
35 entry.split: ; preds = %entry.split1 35 entry.split: ; preds = %entry.split1
36 br label %for.cond 36 br label %for.cond
37 37
38 for.cond: ; preds = %for.cond, %entry.split 38 for.cond: ; preds = %for.cond, %entry.split
39 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] 39 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
40 %sum.reload = load i32, i32* %sum 40 %sum.reload = load i32, ptr %sum
41 %mul = mul nsw i32 %i1.0, 3 41 %mul = mul nsw i32 %i1.0, 3
42 %add = add nsw i32 %sum.reload, %mul 42 %add = add nsw i32 %sum.reload, %mul
43 %inc = add nsw i32 %i1.0, 1 43 %inc = add nsw i32 %i1.0, 1
44 store i32 %add, i32* %sum 44 store i32 %add, ptr %sum
45 %cmp = icmp slt i32 %i1.0, 100 45 %cmp = icmp slt i32 %i1.0, 100
46 br i1 %cmp, label %for.cond, label %for.end 46 br i1 %cmp, label %for.cond, label %for.end
47 47
48 for.end: ; preds = %for.cond 48 for.end: ; preds = %for.cond
49 ret void 49 ret void
50 } 50 }
51 51
52 52
53 define void @f2(i32* %sum) { 53 define void @f2(ptr %sum) {
54 entry: 54 entry:
55 br label %entry.split1 55 br label %entry.split1
56 56
57 entry.split1: ; preds = %entry 57 entry.split1: ; preds = %entry
58 br label %entry.split 58 br label %entry.split
60 entry.split: ; preds = %entry.split1 60 entry.split: ; preds = %entry.split1
61 br label %for.cond 61 br label %for.cond
62 62
63 for.cond: ; preds = %for.cond, %entry.split 63 for.cond: ; preds = %for.cond, %entry.split
64 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] 64 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
65 %sum.reload = load i32, i32* %sum 65 %sum.reload = load i32, ptr %sum
66 %mul = mul nsw i32 %i1.0, 3 66 %mul = mul nsw i32 %i1.0, 3
67 %add = add nsw i32 %sum.reload, %mul 67 %add = add nsw i32 %sum.reload, %mul
68 %inc = add nsw i32 %i1.0, 1 68 %inc = add nsw i32 %i1.0, 1
69 store i32 %add, i32* %sum 69 store i32 %add, ptr %sum
70 %cmp = icmp slt i32 %i1.0, 100 70 %cmp = icmp slt i32 %i1.0, 100
71 br i1 %cmp, label %for.cond, label %for.end 71 br i1 %cmp, label %for.cond, label %for.end
72 72
73 for.end: ; preds = %for.cond 73 for.end: ; preds = %for.cond
74 ret void 74 ret void
75 } 75 }
76 76
77 define void @g1(i32* %sum) { 77 define void @g1(ptr %sum) {
78 entry: 78 entry:
79 br label %entry.split1 79 br label %entry.split1
80 80
81 entry.split1: ; preds = %entry 81 entry.split1: ; preds = %entry
82 br label %entry.split 82 br label %entry.split
84 entry.split: ; preds = %entry.split1 84 entry.split: ; preds = %entry.split1
85 br label %for.cond 85 br label %for.cond
86 86
87 for.cond: ; preds = %for.cond, %entry.split 87 for.cond: ; preds = %for.cond, %entry.split
88 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] 88 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
89 %sum.reload = load i32, i32* %sum 89 %sum.reload = load i32, ptr %sum
90 %mul = mul nsw i32 %i1.0, 3 90 %mul = mul nsw i32 %i1.0, 3
91 %add = add nsw i32 %sum.reload, %mul 91 %add = add nsw i32 %sum.reload, %mul
92 %inc = add nsw i32 %i1.0, 1 92 %inc = add nsw i32 %i1.0, 1
93 store i32 %add, i32* %sum 93 store i32 %add, ptr %sum
94 %cmp = icmp slt i32 %i1.0, 100 94 %cmp = icmp slt i32 %i1.0, 100
95 br i1 %cmp, label %for.cond, label %for.end 95 br i1 %cmp, label %for.cond, label %for.end
96 96
97 for.end: ; preds = %for.cond 97 for.end: ; preds = %for.cond
98 ret void 98 ret void
99 } 99 }
100 100
101 define void @h(i32* %sum) { 101 define void @h(ptr %sum) {
102 entry: 102 entry:
103 br label %entry.split1 103 br label %entry.split1
104 104
105 entry.split1: ; preds = %entry 105 entry.split1: ; preds = %entry
106 br label %entry.split 106 br label %entry.split
108 entry.split: ; preds = %entry.split1 108 entry.split: ; preds = %entry.split1
109 br label %for.cond 109 br label %for.cond
110 110
111 for.cond: ; preds = %for.cond, %entry.split 111 for.cond: ; preds = %for.cond, %entry.split
112 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] 112 %i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
113 %sum.reload = load i32, i32* %sum 113 %sum.reload = load i32, ptr %sum
114 %mul = mul nsw i32 %i1.0, 3 114 %mul = mul nsw i32 %i1.0, 3
115 %add = add nsw i32 %sum.reload, %mul 115 %add = add nsw i32 %sum.reload, %mul
116 %inc = add nsw i32 %i1.0, 1 116 %inc = add nsw i32 %i1.0, 1
117 store i32 %add, i32* %sum 117 store i32 %add, ptr %sum
118 %cmp = icmp slt i32 %i1.0, 100 118 %cmp = icmp slt i32 %i1.0, 100
119 br i1 %cmp, label %for.cond, label %for.end 119 br i1 %cmp, label %for.cond, label %for.end
120 120
121 for.end: ; preds = %for.cond 121 for.end: ; preds = %for.cond
122 ret void 122 ret void