Home
last modified time | relevance | path

Searched refs:bounds (Results 1 – 25 of 369) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/llvm/test/Transforms/IRCE/
H A Dunsigned_comparisons_ult.ll42 br i1 %abc, label %in.bounds, label %out.of.bounds
44 in.bounds:
89 br i1 %abc, label %in.bounds, label %out.of.bounds
91 in.bounds:
132 br i1 %abc, label %in.bounds, label %out.of.bounds
134 in.bounds:
177 in.bounds:
223 in.bounds:
266 in.bounds:
296 in.bounds:
[all …]
H A Dunsigned_comparisons_ugt.ll39 br i1 %abc, label %in.bounds, label %out.of.bounds
41 in.bounds:
86 br i1 %abc, label %in.bounds, label %out.of.bounds
88 in.bounds:
129 br i1 %abc, label %in.bounds, label %out.of.bounds
131 in.bounds:
176 br i1 %abc, label %in.bounds, label %out.of.bounds
178 in.bounds:
206 br i1 %abc, label %in.bounds, label %out.of.bounds
208 in.bounds:
[all …]
H A Deq_ne.ll32 br i1 %abc, label %in.bounds, label %out.of.bounds
34 in.bounds:
65 br i1 %abc, label %in.bounds, label %out.of.bounds
67 in.bounds:
94 br i1 %abc, label %in.bounds, label %out.of.bounds
96 in.bounds:
128 in.bounds:
153 in.bounds:
185 in.bounds:
214 in.bounds:
[all …]
H A Dwith-parent-loops.ll17 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
20 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
51 %idx.i = phi i32 [ 0, %loop ], [ %idx.next.i, %in.bounds.i ]
54 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
100 br i1 %abc.i.i, label %in.bounds.i.i, label %out.of.bounds.i.i, !prof !1
144 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
167 br i1 %abc.i5, label %in.bounds.i9, label %out.of.bounds.i10, !prof !1
214 br i1 %abc.i.i, label %in.bounds.i.i, label %out.of.bounds.i.i, !prof !1
246 br i1 %abc.i.i9, label %in.bounds.i.i13, label %out.of.bounds.i.i14, !prof !1
290 br i1 %abc.i, label %in.bounds.i, label %out.of.bounds.i, !prof !1
[all …]
H A Dstride_more_than_1.ll63 br i1 %abc, label %in.bounds, label %out.of.bounds
65 in.bounds:
128 br i1 %abc, label %in.bounds, label %out.of.bounds
130 in.bounds:
194 br i1 %abc, label %in.bounds, label %out.of.bounds
196 in.bounds:
238 in.bounds:
304 in.bounds:
370 in.bounds:
399 in.bounds:
[all …]
H A Dsingle-access-no-preloop.ll14 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
16 in.bounds:
22 out.of.bounds:
32 ; CHECK: br i1 true, label %in.bounds, label %out.of.bounds
71 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
73 in.bounds:
79 out.of.bounds:
96 ; CHECK: br i1 true, label %in.bounds, label %out.of.bounds
128 in.bounds:
134 out.of.bounds:
[all …]
H A Dpre_post_loops.ll18 ; CHECK: in.bounds:
34 ; CHECK-NEXT: br i1 %abc.postloop, label %in.bounds.postloop, label %out.of.bounds.loopexit
49 br i1 %abc, label %in.bounds, label %out.of.bounds
51 in.bounds:
57 out.of.bounds:
78 ; CHECK: in.bounds:
87 ; CHECK-NEXT: br i1 %abc.preloop, label %in.bounds.preloop, label %out.of.bounds.loopexit
88 ; CHECK: in.bounds.preloop:
103 br i1 %abc, label %in.bounds, label %out.of.bounds
105 in.bounds:
[all …]
H A Dempty_ranges.ll19 ; CHECK: in.bounds.1:
25 ; CHECK: in.bounds.2:
29 ; CHECK: in.bounds.3:
43 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds.3 ]
46 br i1 %c1, label %in.bounds.1, label %out.of.bounds
48 in.bounds.1:
53 br i1 %c2, label %in.bounds.2, label %exit
55 in.bounds.2:
58 br i1 %c3, label %in.bounds.3, label %exit
60 in.bounds.3:
[all …]
H A Ddecrementing-loop.ll17 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
19 in.bounds:
25 out.of.bounds:
61 br i1 %rc, label %in.bounds, label %out.of.bounds, !prof !1
63 in.bounds:
71 out.of.bounds:
102 in.bounds:
151 in.bounds:
157 out.of.bounds:
200 in.bounds:
[all …]
H A Dadd-metadata-pre-post-loops.ll11 ; CHECK-LABEL: in.bounds.postloop
20 %idx = phi i32 [ 0, %entry ], [ %idx.next, %in.bounds ]
23 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
25 in.bounds: ; preds = %loop
31 out.of.bounds: ; preds = %loop
41 ; CHECK-LABEL: in.bounds.preloop
43 ; CHECK-LABEL: in.bounds.postloop
51 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
57 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
59 in.bounds:
[all …]
H A Dunhandled.ll17 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
24 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
26 in.bounds:
32 out.of.bounds:
54 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
56 in.bounds:
67 out.of.bounds:
81 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
84 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
86 in.bounds:
[all …]
H A Drc-negative-bound.ll43 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !0
45 in.bounds:
51 out.of.bounds:
92 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !0
94 in.bounds:
183 in.bounds:
269 in.bounds:
320 in.bounds:
371 in.bounds:
462 in.bounds:
[all …]
H A Dranges_of_different_types.ll86 br i1 %abc, label %in.bounds, label %out.of.bounds
88 in.bounds:
209 br i1 %abc, label %in.bounds, label %out.of.bounds
211 in.bounds:
305 br i1 %abc, label %in.bounds, label %out.of.bounds
307 in.bounds:
428 in.bounds:
509 in.bounds:
617 in.bounds:
698 in.bounds:
[all …]
H A Donly-lower-check.ll7 ; CHECK-NEXT: CheckUse: br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1 Operand: 0
8 …er_check: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
18 %idx = phi i32 [ %start, %entry ] , [ %idx.dec, %in.bounds ]
21 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
23 in.bounds:
29 out.of.bounds:
H A Donly-upper-check.ll7 ; CHECK-NEXT: CheckUse: br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1 Operand: 0
8 …ementing: constrained Loop at depth 1 containing: %loop<header><exiting>,%in.bounds<latch><exiting>
17 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
21 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
23 in.bounds:
29 out.of.bounds:
H A Dnot-likely-taken.ll18 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds.b ]
21 br i1 %abc.a, label %in.bounds.a, label %out.of.bounds, !prof !1
23 in.bounds.a:
27 br i1 %abc.b, label %in.bounds.b, label %out.of.bounds, !prof !1
29 in.bounds.b:
35 out.of.bounds:
H A Dmultiple-access-no-preloop.ll25 ; CHECK: in.bounds.a:
30 ; CHECK: in.bounds.b:
44 ; CHECK: out.of.bounds.loopexit:
48 ; CHECK: out.of.bounds:
63 ; CHECK: in.bounds.a.postloop:
68 ; CHECK: in.bounds.b.postloop:
86 br i1 %abc.a, label %in.bounds.a, label %out.of.bounds, !prof !1
88 in.bounds.a:
92 br i1 %abc.b, label %in.bounds.b, label %out.of.bounds, !prof !1
94 in.bounds.b:
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dinfer-via-ranges.ll12 %idx = phi i32 [ %start, %entry ] , [ %idx.dec, %in.bounds ]
15 ; CHECK: br i1 true, label %in.bounds, label %out.of.bounds
16 br i1 %abc, label %in.bounds, label %out.of.bounds
18 in.bounds:
19 ; CHECK-LABEL: in.bounds:
25 out.of.bounds:
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dloop-fusion-slice-computation.mlir10 …t slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1) loop bounds: [(d0) -> (d0), (d…
14 …{{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bounds: [(d0) -> (d0), (d…
27 …{{slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1) loop bounds: [(d0) -> (d0), (d…
31 …t slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bounds: [(d0) -> (d0), (d…
40 // Slice loop bounds should be adjusted such that the load/store are for the
47 …t slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 2) loop bounds: [(d0) -> (d0 + 3)…
52 …{{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bounds: [(d0) -> (d0 - 3)…
61 // Slices at loop depth 1 should only slice the loop bounds of the first scf.
62 // Slices at loop depth 2 should slice loop bounds of both loops.
75 …{{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bounds: [(d0) -> (d0), (d…
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dpr36292.ll20 ; CHECK-NEXT: .LBB0_1: # %bounds.ok
30 ; CHECK-NEXT: .LBB0_2: # %bounds.fail
35 forcond: ; preds = %bounds.ok, %0
38 %bounds.cmp = icmp ult i64 %1, %.len1
39 br i1 %bounds.cmp, label %bounds.ok, label %bounds.fail
41 bounds.ok: ; preds = %forcond
50 bounds.fail: ; preds = %forcond
/llvm-project-15.0.7/polly/lib/External/ppcg/
H A Dhybrid.c57 if (!bounds) in ppcg_ht_bounds_free()
61 free(bounds); in ppcg_ht_bounds_free()
80 if (!bounds) in ppcg_ht_bounds_alloc()
87 bounds->lower = isl_multi_val_set_val(bounds->lower, i, v); in ppcg_ht_bounds_alloc()
90 if (!bounds->lower || !bounds->upper) in ppcg_ht_bounds_alloc()
93 return bounds; in ppcg_ht_bounds_alloc()
101 if (!bounds) in ppcg_ht_bounds_dump()
115 if (!bounds) in ppcg_ht_bounds_get_upper()
143 if (!bounds) in ppcg_ht_bounds_get_lower()
176 if (!bounds) in ppcg_ht_bounds_is_valid()
[all …]
/llvm-project-15.0.7/clang/utils/ABITest/
H A DEnumeration.py177 S,M = getNthPairVariableBounds(N, bounds)
190 def getNthPairVariableBounds(N, bounds): argument
197 if not bounds:
199 if not (0 <= N < sum(bounds)):
203 active = list(range(len(bounds)))
204 active.sort(key=lambda i: bounds[i])
207 level = bounds[index]
224 x,y = GNVP(N,bounds)
225 assert 0 <= x < len(bounds) and 0 <= y < bounds[x]
252 bounds = [2,2,4,aleph0,5,aleph0]
[all …]
/llvm-project-15.0.7/flang/include/flang/Lower/
H A DBoxAnalyzer.h131 : bounds{std::move(bounds)} {} in DynamicBound()
144 llvm::SmallVector<const Fortran::semantics::ShapeSpec *> bounds; member
152 : ScalarSym{sym}, DynamicBound{std::move(bounds)} {} in DynamicArray()
194 : ScalarStaticChar{sym, len}, DynamicBound{std::move(bounds)} {} in DynamicArrayStaticChar()
207 : ScalarDynamicChar{sym, len}, DynamicBound{std::move(bounds)} {} in DynamicArrayDynamicChar()
211 : ScalarDynamicChar{sym}, DynamicBound{std::move(bounds)} {} in DynamicArrayDynamicChar()
374 return match([](const DynamicArray &x) -> A { return x.bounds; }, in dynamicBound()
388 llvm::SmallVector<const Fortran::semantics::ShapeSpec *> bounds; in analyze() local
390 bounds.push_back(&subs); in analyze()
435 box = DynamicArrayDynamicChar(sym, std::move(bounds)); in analyze()
[all …]
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/cppcoreguidelines/
H A Dpro-bounds-constant-array-index.rst1 .. title:: clang-tidy - cppcoreguidelines-pro-bounds-constant-array-index
3 cppcoreguidelines-pro-bounds-constant-array-index
8 are out of bounds (for ``std::array``). For out-of-bounds checking of static
9 arrays, see the `-Warray-bounds` Clang diagnostic.
12 https://github.com/isocpp/CppCoreGuidelines/blob/master/CppCoreGuidelines.md#Pro-bounds-arrayindex.
/llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/
H A Dbackedge-on-min-max.ll17 %in.bounds = icmp slt i32 %idx, %a_len
18 br i1 %in.bounds, label %ok, label %latch
45 %in.bounds = icmp sgt i32 %a_len, %idx
73 %in.bounds = icmp slt i32 %idx, 42
101 %in.bounds = icmp sgt i32 42, %idx
185 %in.bounds = icmp sgt i32 %idx, 42
213 %in.bounds = icmp slt i32 42, %idx
299 %in.bounds = icmp ult i32 %idx, 42
327 %in.bounds = icmp ugt i32 42, %idx
411 %in.bounds = icmp ugt i32 %idx, 42
[all …]

12345678910>>...15