Home
last modified time | relevance | path

Searched refs:inc2 (Results 1 – 25 of 64) sorted by relevance

123

/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dnowrap-preinc-limits.ll12 %idx.inc2 = add i32 %idx.inc, 1
13 %idx.inc2.zext = zext i32 %idx.inc2 to i64
15 ; CHECK: %idx.inc2.zext = zext i32 %idx.inc2 to i64
34 %idx.inc2 = add i32 %idx.inc, -1
35 %idx.inc2.sext = sext i32 %idx.inc2 to i64
36 ; CHECK: %idx.inc2.sext = sext i32 %idx.inc2 to i64
H A Dtrip-count-non-unit-stride.ll30 %iv.inc2 = add nuw i64 %iv, 2
31 %cmp2 = icmp ult i64 %iv.inc2, %len
64 %iv.inc2 = add nuw i64 %iv, 2
65 %cmp2 = icmp ult i64 %iv.inc2, %len
95 %iv.inc2 = add nsw i64 %iv, 2
96 %cmp2 = icmp slt i64 %iv.inc2, %len
129 %iv.inc2 = add nsw i64 %iv, 2
130 %cmp2 = icmp slt i64 %iv.inc2, %len
160 %iv.inc2 = add nsw i64 %iv, -2
161 %cmp2 = icmp sgt i64 %iv.inc2, %lim
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/
H A DPR27684_contains_ref_to_incomplete_type.pass.cpp26 extern IncompleteType inc2;
28 IncompleteType const& cinc2 = inc2;
36 assert(&std::get<1>(t) == &inc2); in main()
40 Tup t(inc1, inc2); in main()
42 assert(&std::get<1>(t) == &inc2); in main()
50 IncompleteType inc2; variable
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Posix/
H A Dasan-symbolize-sanity-test.cpp33 fun_t *inc2 = (fun_t*)dlsym(lib, "inc2"); in main() local
34 if (!inc2) return 1; in main()
37 inc2(array, 1); in main()
38 inc2(array, -1); // BOOM in main()
61 void inc2(int *a, int index) { in inc2() function
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dtypepromotion-phisret.ll33 %val = phi i8 [ %1, %preheader ], [ %inc2, %if.end ]
46 %inc2 = phi i8 [ %inc, %if.then ], [ %inc1, %if.else ]
47 %cmp1 = icmp eq i8 %inc2, -1
81 %val = phi i8 [ %1, %preheader ], [ %inc2, %if.end ]
95 %cmp1 = icmp eq i8 %inc2, -1
120 %val = phi i16 [ 0, %entry ], [ %inc2, %if.end ]
134 %cmp1 = icmp ult i16 %inc2, 253
159 %val = phi i8 [ 0, %entry ], [ %inc2, %if.end ]
173 %cmp1 = icmp ult i8 %inc2, -3
177 ret i8 %inc2
[all …]
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/GreedyFuse/
H A Dfuse-double.ll38 %k2 = phi i32 [0, %outer.exit1], [%k2.inc, %outer.inc2]
43 %j2 = phi i32 [0, %outer.for2], [%j2.inc, %inc2]
50 br label %inc2
52 inc2:
57 br label %outer.inc2
59 outer.inc2:
H A Dnofuse-simple.ll28 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
36 br label %inc2
38 inc2:
H A Dfuse-simple.ll26 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
33 br label %inc2
35 inc2:
H A Dfuse-inner-carried.ll31 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
38 br label %inc2
40 inc2:
H A Dfuse-inner.ll31 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
38 br label %inc2
40 inc2:
H A Dfuse-except-third.ll28 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
35 br label %inc2
37 inc2:
H A Dfuse-inner-third.ll28 %j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
35 br label %inc2
37 inc2:
/llvm-project-15.0.7/llvm/test/Transforms/LoopSimplifyCFG/
H A Dmerge-header.ll16 %y.2 = phi i32 [ 0, %entry ], [ %y.inc2, %outer.latch2 ]
23 %y.inc2 = add nsw i32 %y.2, 1
24 %exitcond.outer = icmp eq i32 %y.inc2, 3
29 %t = sext i32 %y.inc2 to i64
H A Dscev.ll49 %iv2 = phi i32 [0, %exit], [%inc2, %loop.body2]
50 %inc2 = add i32 %iv2, 1
51 %cmp2 = icmp ult i32 %inc2, 10
/llvm-project-15.0.7/llvm/test/Transforms/TypePromotion/ARM/
H A Dphis-ret.ll47 %val = phi i8 [ %1, %preheader ], [ %inc2, %if.end ]
60 %inc2 = phi i8 [ %inc, %if.then], [ %inc1, %if.else ]
61 %cmp1 = icmp eq i8 %inc2, 255
110 %val = phi i8 [ %1, %preheader ], [ %inc2, %if.end ]
124 %cmp1 = icmp eq i8 %inc2, 255
157 %val = phi i16 [ 0, %entry ], [ %inc2, %if.end ]
171 %cmp1 = icmp ult i16 %inc2, 253
204 %val = phi i8 [ 0, %entry ], [ %inc2, %if.end ]
218 %cmp1 = icmp ult i8 %inc2, 253
222 ret i8 %inc2
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/
H A Dpr18223.ll32 %inc2 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
33 %sub = add i32 %inc2, -1
34 %cmp1 = icmp uge i32 %sub, %inc2
39 %inc = add nsw i32 %inc2, 1
/llvm-project-15.0.7/llvm/test/Transforms/GuardWidening/
H A Drange-check-merging.ll32 %x.inc2 = add i32 %x, 2
68 %x.inc2 = add i32 %x.inc1, 2
72 %x.inc3 = add i32 %x.inc2, 3
106 %x.inc2 = or i32 %x, 2
144 %x.inc2 = or i32 %x.inc1, 2
148 %x.inc3 = add i32 %x.inc2, 3
182 %x.inc2 = add i32 %x, 2
218 %x.inc2 = add i32 %x.inc1, -200
222 %x.inc3 = add i32 %x.inc2, 3
266 %x.inc2 = add i32 %x, 2
[all …]
/llvm-project-15.0.7/polly/test/ScopInfo/
H A Dmax-loop-depth.ll30 for.body2: ; preds = %for.body1, %for.inc2
31 %i.1 = phi i64 [ 0, %for.body1 ], [ %i.next.1, %for.inc2 ]
36 br label %for.inc2
38 for.inc2: ; preds = %for.body2
44 for.end2: ; preds = %for.inc2, %for.body1
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Druntime-loop4.ll35 %iv2 = phi i32 [ 0, %loop2.header ], [ %inc2, %loop2 ]
38 %inc2 = add i32 %iv2, 1
39 %exitcnd2 = icmp uge i32 %inc2, %iter
H A Dopt-levels.ll30 %iv2 = phi i32 [ 0, %loop2.header ], [ %inc2, %loop2 ]
33 %inc2 = add i32 %iv2, 1
34 %exitcnd2 = icmp uge i32 %inc2, %iter
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/AArch64/
H A Dpartial.ll41 %iv2 = phi i32 [ 0, %loop2.header ], [ %inc2, %loop2 ]
42 %inc2 = add i32 %iv2, 1
43 %exitcnd2 = icmp uge i32 %inc2, 1024
/llvm-project-15.0.7/llvm/test/Transforms/SCCP/
H A Dconditions-ranges-with-undef.ll79 ; CHECK: inc2:
91 br i1 %cond, label %inc1, label %inc2
96 inc2:
100 %p = phi i32 [ 10, %inc1 ], [ undef, %inc2 ]
126 ; CHECK: inc2:
142 br i1 %cond, label %inc1, label %inc2
147 inc2:
151 %p = phi i32 [ %a.127, %inc1 ], [ undef, %inc2 ]
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dipra-reg-alias.ll13 %inc2 = mul i8 %inc, 5
14 ret i8 %inc2
/llvm-project-15.0.7/llvm/test/Analysis/DDG/
H A Droot-node.ll14 ; CHECK: %i2.03 = phi i64 [ 0, %for.body.lr.ph ], [ %inc2, %test1.for.body ]
33 %i2.03 = phi i64 [ 0, %for.body.lr.ph ], [ %inc2, %test1.for.body ]
40 %inc2 = add i64 %i2.03, 1
/llvm-project-15.0.7/polly/test/CodeGen/
H A Dsplit_edges.ll23 %ind2 = phi i32 [0, %bb1], [ %inc2, %bb3]
24 %inc2 = add i32 %ind2, 1

123