| /external/llvm-project/llvm/test/Transforms/IRCE/ |
| D | stride_more_than_1.ll | 257 ; CHECK-NEXT: %exit.preloop.at = add nsw i32 %len, -1
258 ; CHECK-NEXT: [[COND1:%[^ ]+]] = icmp sgt i32 100, %exit.preloop.at
259 ; CHECK-NEXT: br i1 [[COND1]], label %loop.preloop.preheader, label %preloop.pseudo.exit
260 ; CHECK: loop.preloop.preheader:
261 ; CHECK-NEXT: br label %loop.preloop
265 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
274 ; CHECK: loop.preloop:
275 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 100, %loop.prel…
276 ; CHECK-NEXT: %idx.next.preloop = add i32 %idx.preloop, -7
277 ; CHECK-NEXT: %abc.preloop = icmp slt i32 %idx.preloop, %len
[all …]
|
| D | unsigned_comparisons_ugt.ll | 24 ; CHECK-NOT: loop.preloop:
62 ; CHECK-NEXT: %exit.preloop.at = add nsw i32 [[UMIN]], -1
63 ; CHECK-NEXT: [[COND2:%[^ ]+]] = icmp ugt i32 100, %exit.preloop.at
64 ; CHECK-NEXT: br i1 [[COND2]], label %loop.preloop.preheader, label %preloop.pseudo.exit
68 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
73 ; CHECK: loop.preloop:
74 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 100, %loop.pr…
75 ; CHECK-NEXT: %idx.next.preloop = add i32 %idx.preloop, -1
76 ; CHECK-NEXT: %abc.preloop = icmp ult i32 %idx.preloop, %len
77 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
[all …]
|
| D | ranges_of_different_types.ll | 6 ; No preloop,
23 ; CHECK-NOT: preloop
63 ; %exit.preloop.at = 13
88 ; CHECK-NEXT: br i1 true, label %loop.preloop.preheader
89 ; CHECK: loop.preloop:
90 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 0, %loop.pre…
91 ; CHECK-NEXT: %idx.next.preloop = add i32 %idx.preloop, 1
92 ; CHECK-NEXT: %idx.offset.preloop = sub i32 %idx.preloop, 13
93 ; CHECK-NEXT: %abc.preloop = icmp ult i32 %idx.offset.preloop, %len
94 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
[all …]
|
| D | pre_post_loops.ll | 70 ; CHECK-NEXT: br i1 true, label %loop.preloop.preheader
74 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
83 ; CHECK: loop.preloop:
84 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 2147483647, %lo…
85 ; CHECK-NEXT: %idx.next.preloop = add i32 %idx.preloop, -1
86 ; CHECK-NEXT: %abc.preloop = icmp slt i32 %idx.preloop, %len
87 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
88 ; CHECK: in.bounds.preloop:
89 ; CHECK-NEXT: %addr.preloop = getelementptr i32, i32* %arr, i32 %idx.preloop
90 ; CHECK-NEXT: store i32 0, i32* %addr.preloop
[all …]
|
| D | unsigned_comparisons_ult.ll | 27 ; CHECK-NOT: loop.preloop:
65 ; CHECK-NEXT: %exit.preloop.at = add nsw i32 [[UMIN]], -1
66 ; CHECK-NEXT: [[COND2:%[^ ]+]] = icmp ugt i32 100, %exit.preloop.at
67 ; CHECK-NEXT: br i1 [[COND2]], label %loop.preloop.preheader, label %preloop.pseudo.exit
71 ; CHECK-NEXT: %idx = phi i32 [ %idx.preloop.copy, %mainloop ], [ %idx.next, %in.bounds ]
76 ; CHECK: loop.preloop:
77 ; CHECK-NEXT: %idx.preloop = phi i32 [ %idx.next.preloop, %in.bounds.preloop ], [ 100, %loop.pr…
78 ; CHECK-NEXT: %idx.next.preloop = add i32 %idx.preloop, -1
79 ; CHECK-NEXT: %abc.preloop = icmp ult i32 %idx.preloop, %len
80 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
[all …]
|
| D | single-access-with-preloop.ll | 76 ; CHECK: in.bounds.preloop:
77 ; CHECK: [[continue_preloop_cond:[^ ]+]] = icmp slt i32 %idx.next.preloop, [[exit_preloop_at]]
78 ; CHECK: br i1 [[continue_preloop_cond]], label %loop.preloop, label %preloop.exit.selector
80 ; CHECK: preloop.exit.selector:
81 ; CHECK: [[preloop_its_left:[^ ]+]] = icmp slt i32 %idx.next.preloop.lcssa, %n
82 ; CHECK: br i1 [[preloop_its_left]], label %preloop.pseudo.exit, label %exit.loopexit
|
| D | wide_indvar.ll | 8 ; CHECK-NOT: preloop
38 ; CHECK-NOT: preloop
67 ; General case. If both %N and %M are non-negative, we do not need a preloop.
71 ; CHECK-NOT: preloop
102 ; General case. Even though %M may be negative, we do not need a preloop because
108 ; CHECK-NOT: preloop
139 ; General case with preloop.
148 ; CHECK: preloop
177 ; CHECK-NOT: preloop
252 ; CHECK-NOT: preloop
[all …]
|
| D | correct-loop-info.ll | 22 ; CHECK: innerheader.preloop.preheader:
88 ; CHECK: innerheader.preloop:
92 ; CHECK: bb5.preloop:
96 ; CHECK: bb8.preloop:
100 ; CHECK: preloop.exit.selector:
104 ; CHECK: preloop.pseudo.exit:
|
| D | add-metadata-pre-post-loops.ll | 41 ; CHECK-LABEL: in.bounds.preloop
42 ; CHECK: br i1 [[COND:%[^ ]+]], label %loop.preloop, label %preloop.exit.selector, !llvm.loop !8, !…
|
| D | decrementing-loop.ll | 36 ; CHECK: %exit.preloop.at = add nsw i32 [[not_exit_preloop_at]], -1
49 ; CHECK: loop.preloop:
88 ; CHECK: loop.preloop:
128 ; CHECK: loop.preloop:
175 ; CHECK: loop.preloop:
224 ; CHECK: loop.preloop:
|
| D | eq_ne.ll | 170 ; CHECK: preloop.exit.selector:
171 ; CHECK-NEXT: [[PSEUDO_PHI:%[^ ]+]] = phi i32 [ %idx.next.preloop, %in.bounds.preloop ]
231 ; CHECK: preloop.exit.selector:
232 ; CHECK-NEXT: [[PSEUDO_PHI:%[^ ]+]] = phi i32 [ %idx.next.preloop, %in.bounds.preloop ]
|
| D | bad_expander.ll | 19 ; CHECK-NOT: preloop
53 ; CHECK-NOT: preloop
97 ; CHECK-NOT: preloop
|
| D | range_intersect_miscompile.ll | 20 ; CHECK-NOT: preloop
79 ; CHECK-NOT: preloop
129 ; CHECK-NOT: preloop
178 ; CHECK-NOT: preloop
227 ; CHECK-NOT: preloop
|
| D | empty_ranges.ll | 16 ; CHECK-NOT: preloop
|
| /external/llvm/test/Transforms/IRCE/ |
| D | single-access-with-preloop.ll | 58 ; CHECK-LABEL: in.bounds.preloop:
59 ; CHECK: [[continue_preloop_cond:[^ ]+]] = icmp slt i32 %idx.next.preloop, [[exit_preloop_at]]
60 ; CHECK: br i1 [[continue_preloop_cond]], label %loop.preloop, label %preloop.exit.selector
62 ; CHECK-LABEL: preloop.exit.selector:
63 ; CHECK: [[preloop_its_left:[^ ]+]] = icmp slt i32 %idx.next.preloop, %n
64 ; CHECK: br i1 [[preloop_its_left]], label %preloop.pseudo.exit, label %exit.loopexit
|
| D | decrementing-loop.ll | 38 ; CHECK: %exit.preloop.at = add i32 [[not_exit_preloop_at]], -1
|
| /external/python/cpython3/Lib/ |
| D | cmd.py | 105 self.preloop()
161 def preloop(self): member in Cmd
|
| /external/python/cpython2/Lib/ |
| D | cmd.py | 109 self.preloop()
165 def preloop(self): member in Cmd
|
| /external/python/cpython3/Lib/test/ |
| D | test_cmd.py | 136 def preloop(self): member in samplecmdclass
|
| /external/python/cpython2/Lib/test/ |
| D | test_cmd.py | 137 def preloop(self): member in samplecmdclass
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| D | Dbg.stg | 193 @positiveClosureBlock.preloop() ::= "<enterSubRule()>"
204 @closureBlock.preloop() ::= "<enterSubRule()>"
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| D | Dbg.stg | 175 @positiveClosureBlock.preloop() ::= "<enterSubRule()>"
186 @closureBlock.preloop() ::= "<enterSubRule()>"
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| D | Dbg.stg | 258 //@positiveClosureBlock.preloop() ::= "<enterSubRule()>"
269 //@closureBlock.preloop() ::= "<enterSubRule()>"
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| D | Dbg.stg | 213 @positiveClosureBlock.preloop() ::= "<enterSubRule()>"
224 @closureBlock.preloop() ::= "<enterSubRule()>"
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| D | Dbg.stg | 259 //@positiveClosureBlock.preloop() ::= "<enterSubRule()>"
270 //@closureBlock.preloop() ::= "<enterSubRule()>"
|