Home
last modified time | relevance | path

Searched refs:upper (Results 1 – 25 of 503) sorted by relevance

12345678910>>...21

/llvm-project/llvm/test/Transforms/ConstraintElimination/
H A Dgeps-inbounds-precondition.ll29 %upper = getelementptr inbounds i32, ptr %src, i64 5
30 call void @noundef(ptr %upper)
34 %cmp.upper.4 = icmp ule ptr %src.idx.4, %upper
36 %cmp.upper.5 = icmp ule ptr %src.idx.5, %upper
37 %res.0 = xor i1 %cmp.upper.4, %cmp.upper.5
40 %cmp.upper.6 = icmp ule ptr %src.idx.6, %upper
41 %res.1 = xor i1 %res.0, %cmp.upper.6
44 %cmp.upper.neg.1 = icmp ule ptr %src.idx.neg.1, %upper
45 %res.2 = xor i1 %res.1, %cmp.upper.neg.1
70 %upper = getelementptr inbounds i32, ptr %src, i64 %n.ext
[all …]
H A Dgeps-inbounds-precondition-ub-in-use-blocks.ll32 %upper = getelementptr inbounds i32, ptr %src, i64 %n.ext
39 call void @noundef(ptr %upper)
40 %cmp.upper.1 = icmp ule ptr %src.idx, %upper
41 ret i1 %cmp.upper.1
44 %cmp.upper.2 = icmp ule ptr %src.idx, %upper
45 ret i1 %cmp.upper.2
67 %upper = getelementptr inbounds i32, ptr %src, i64 %n.ext
74 %cmp.upper.1 = icmp ule ptr %src.idx, %upper
75 call void @noundef(ptr %upper)
76 ret i1 %cmp.upper.1
[all …]
H A Dgep-add-multiple-indices.ll14 %upper = getelementptr inbounds ptr, ptr %dst, i64 2
16 %c.1 = icmp ult ptr %gep.1, %upper
28 %upper = getelementptr inbounds ptr, ptr %dst, i64 3
30 %c.1 = icmp ult ptr %gep.1, %upper
42 %upper = getelementptr inbounds ptr, ptr %dst, i64 2
44 %c = icmp ult ptr %gep.1, %upper
56 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
58 %c = icmp ult ptr %gep.1, %upper
70 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
86 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
[all …]
H A Dgep-arithmetic-different-types.ll6 define i1 @gep_constant_positive_index(ptr %A, ptr %upper) {
18 %c.0 = icmp ult ptr %add.i8.4, %upper
22 %c.1 = icmp ult ptr %add.i16.4, %upper
25 %t.1 = icmp ult ptr %add.i16.2, %upper
30 define i1 @gep_constant_positive_index_chained(ptr %A, ptr %upper) {
43 %c.0 = icmp ult ptr %add.i8.4, %upper
49 %t.1 = icmp ult ptr %add.i16.1, %upper
51 %c.1 = icmp ult ptr %add.i16.2, %upper
56 define i1 @gep_var_positive_index(ptr %A, ptr %upper, i8 %idx) {
72 %c.0 = icmp ult ptr %add.i16.idx, %upper
[all …]
H A Dloops-bottom-tested-pointer-cmps.ll6 define void @checks_in_loops_removable(ptr %ptr, ptr %lower, ptr %upper, i8 %n) {
43 %cmp.ptr.n.upper = icmp ult ptr %ptr.n, %upper
44 br i1 %cmp.ptr.n.upper, label %pre.2, label %trap
57 %cmp.ptr.iv.upper = icmp ule ptr %upper, %ptr.iv
58 %or = or i1 %cmp.ptr.iv.lower, %cmp.ptr.iv.upper
71 define void @some_checks_in_loops_removable(ptr %ptr, ptr %lower, ptr %upper, i8 %n) {
114 %cmp.ptr.n.upper = icmp ult ptr %ptr.n, %upper
115 br i1 %cmp.ptr.n.upper, label %pre.2, label %trap
128 %cmp.ptr.iv.upper = icmp ule ptr %upper, %ptr.iv
129 %or = or i1 %cmp.ptr.iv.lower, %cmp.ptr.iv.upper
[all …]
H A Dgep-add-multiple-indices-signed-predicates.ll15 %upper = getelementptr inbounds ptr, ptr %dst, i64 2
17 %c.1 = icmp slt ptr %gep.1, %upper
30 %upper = getelementptr inbounds ptr, ptr %dst, i64 3
32 %c.1 = icmp slt ptr %gep.1, %upper
45 %upper = getelementptr inbounds ptr, ptr %dst, i64 2
47 %c = icmp slt ptr %gep.1, %upper
60 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
62 %c = icmp slt ptr %gep.1, %upper
75 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
92 %upper = getelementptr inbounds [2 x i32], ptr %dst, i64 0, i64 2
[all …]
H A Dgep-arithmetic.ll6 define i1 @gep_constant_positive_index(ptr %dst, ptr %lower, ptr %upper) {
30 %pre.dst.upper = icmp ult ptr %dst.add.4, %upper
31 %and = and i1 %pre.dst.lower, %pre.dst.upper
36 %cmp.dst.upper = icmp ult ptr %dst, %upper
37 %res.1 = xor i1 %cmp.dst.lower, %cmp.dst.upper
40 %cmp.dst.add.3.upper = icmp ult ptr %dst.add.3, %upper
42 %res.3 = xor i1 %res.2, %cmp.dst.add.3.upper
[all...]
H A Dgep-arithmetic-signed-predicates.ll6 define i1 @gep_constant_positive_index(ptr %dst, ptr %lower, ptr %upper) {
35 %pre.dst.upper = icmp slt ptr %dst.add.4, %upper
36 %and = and i1 %pre.dst.lower, %pre.dst.upper
41 %cmp.dst.upper = icmp slt ptr %dst, %upper
42 %res.1 = xor i1 %cmp.dst.lower, %cmp.dst.upper
45 %cmp.dst.add.3.upper = icmp slt ptr %dst.add.3, %upper
47 %res.3 = xor i1 %res.2, %cmp.dst.add.3.upper
49 %cmp.dst.add.4.upper = icmp slt ptr %dst.add.4, %upper
51 %res.5 = xor i1 %res.4, %cmp.dst.add.4.upper
54 %cmp.dst.add.5.upper = icmp slt ptr %dst.add.5, %upper
[all …]
H A Dloops-header-tested-pointer-cmps.ll6 define void @test1(ptr %src, ptr noundef %lower, ptr noundef %upper, i8 %N) {
52 %cmp.src.end = icmp uge ptr %src.end, %upper
67 %cmp.iv.end = icmp uge ptr %src.iv, %upper
77 %cmp.iv.1.end = icmp uge ptr %src.iv.1, %upper
87 %cmp.iv.2.end = icmp uge ptr %src.iv.2, %upper
101 define void @test2(ptr %src, ptr %lower, ptr %upper, i8 %N) {
146 %cmp.src.end = icmp uge ptr %src.end, %upper
164 %cmp.iv.end = icmp uge ptr %src.iv, %upper
172 %cmp.iv.1.end = icmp uge ptr %src.iv.1, %upper
180 %cmp.iv.2.end = icmp uge ptr %src.iv.2, %upper
[all …]
H A Dmonotonic-pointer-phis-constant-upper-offset.ll30 %upper = getelementptr inbounds i32, ptr %start, i16 10
35 %c = icmp eq ptr %ptr.iv, %upper
40 %t.2 = icmp ult ptr %ptr.iv, %upper
73 %upper = getelementptr inbounds i8, ptr %start, i16 15
78 %c = icmp eq ptr %ptr.iv, %upper
83 %t.2 = icmp ult ptr %ptr.iv, %upper
116 %upper = getelementptr inbounds i8, ptr %start, i16 16
121 %c = icmp eq ptr %ptr.iv, %upper
126 %t.2 = icmp ult ptr %ptr.iv, %upper
160 %upper = getelementptr inbounds i8, ptr %start, i16 15
[all …]
H A Dloops-header-tested-pointer-iv.ll6 define void @loop_pointer_iv(ptr %start, ptr %end, ptr %upper) {
27 %end.lt.upper = icmp ult ptr %end, %upper
28 br i1 %end.lt.upper, label %loop.header, label %exit
40 %t.1 = icmp ult ptr %iv, %upper
49 define void @loop_pointer_iv_null_start(ptr %end, ptr %upper) {
69 %end.lt.upper = icmp ult ptr %end, %upper
70 br i1 %end.lt.upper, label %loop.header, label %exit
82 %c.4 = icmp ult ptr %iv, %upper
/llvm-project/libcxx/utils/
H A Dgenerate_width_estimation_table.py27 upper: int = -1 variable in PropertyRange
38 r"^(?P<lower>[0-9A-F]{4,6})(?:\.\.(?P<upper>[0-9A-F]{4,6}))?\s*;\s*(?P<prop>\w+)"
50 if element.lower >= 0x4DC0 and element.upper <= 0x4DFF:
54 if element.lower >= 0x1F300 and element.upper <= 0x1F5FF:
58 if element.lower >= 0x1F900 and element.upper <= 0x1F9FF:
67 lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
69 result.upper = result.lower
71 result.upper = int(upper_str, base=16)
93 and x.lower <= result[-1].upper + 1
95 result[-1].upper
[all...]
H A Dgenerate_escaped_output_table.py27 upper: int = -1 variable in PropertyRange
38 r"^(?P<lower>[0-9A-F]{4,6})(?:\.\.(?P<upper>[0-9A-F]{4,6}))?\s*;\s*(?P<prop>\w+)"
52 lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
54 result.upper = result.lower
56 result.upper = int(upper_str, base=16)
78 and x.lower <= result[-1].upper + 1
80 result[-1].upper = max(result[-1].upper, x.upper)
117 /// - bits [14, 31] The lower bound code point of the range. The upper boun
[all...]
H A Dgenerate_indic_conjunct_break_table.py27 upper: int = -1 variable in PropertyRange
39 r"^(?P<lower>[0-9A-F]{4,5})(?:\.\.(?P<upper>[0-9A-F]{4,5}))?\s*;\s*InCB;\s*(?P<prop>\w+)"
45 lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
47 result.upper = result.lower
49 result.upper = int(upper_str, base=16)
69 and result[-1].upper + 1 == x.lower
71 result[-1].upper = x.upper
98 /// - bits [11, 31] The lower bound code point of the range. The upper bound of
115 // The algorithm searches for the upper boun
[all...]
H A Dgenerate_extended_grapheme_cluster_table.py27 upper: int = -1 variable in PropertyRange
39 r"^(?P<lower>[0-9A-F]{4,5})(?:\.\.(?P<upper>[0-9A-F]{4,5}))?\s*;\s*(?P<prop>\w+)"
46 lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
48 result.upper = result.lower
50 result.upper = int(upper_str, base=16)
69 and result[-1].upper + 1 == x.lower
71 result[-1].upper = x.upper
105 /// - bits [11, 31] The lower bound code point of the range. The upper bound of
122 // The algorithm searches for the upper boun
[all...]
/llvm-project/llvm/test/Transforms/CorrelatedValuePropagation/
H A Durem-expansion.ll14 %cmp.x.upper = icmp ult i8 %x, 3
15 call void @llvm.assume(i1 %cmp.x.upper)
29 %cmp.x.upper = icmp ult i8 %x, 4
30 call void @llvm.assume(i1 %cmp.x.upper)
70 %cmp.x.upper = icmp ult i8 %x, 5
71 call void @llvm.assume(i1 %cmp.x.upper)
85 %cmp.x.upper = icmp ult i8 %x, 6
86 call void @llvm.assume(i1 %cmp.x.upper)
97 %cmp.x.upper = icmp ult i8 %x, 7
98 call void @llvm.assume(i1 %cmp.x.upper)
[all...]
H A Dudiv-expansion.ll14 %cmp.x.upper = icmp ult i8 %x, 3
15 call void @llvm.assume(i1 %cmp.x.upper)
27 %cmp.x.upper = icmp ult i8 %x, 4
28 call void @llvm.assume(i1 %cmp.x.upper)
62 %cmp.x.upper = icmp ult i8 %x, 5
63 call void @llvm.assume(i1 %cmp.x.upper)
75 %cmp.x.upper = icmp ult i8 %x, 6
76 call void @llvm.assume(i1 %cmp.x.upper)
87 %cmp.x.upper = icmp ult i8 %x, 7
88 call void @llvm.assume(i1 %cmp.x.upper)
[all...]
/llvm-project/llvm/utils/
H A Drsp_bisect.py125 upper = num_files_in_rsp
126 while lower != upper - 1:
127 assert lower < upper - 1
128 mid = int((lower + upper) / 2)
129 assert lower != mid and mid != upper
130 print("Trying {} ({}-{})".format(mid, lower, upper))
137 upper = mid
138 return upper
/llvm-project/libcxx/test/std/re/re.traits/
H A Dlookup_classname.pass.cpp63 LIBCPP_ASSERT((std::ctype_base::upper & std::regex_traits<char>::__regex_word) == 0); in main()
77 | std::ctype_base::upper | std::ctype_base::lower); in main()
79 | std::ctype_base::upper | std::ctype_base::lower); in main()
81 | std::ctype_base::upper | std::ctype_base::lower, true); in main()
83 | std::ctype_base::upper | std::ctype_base::lower, true); in main()
145 test("upper", std::ctype_base::upper); in main()
146 test("UPPER", std::ctype_base::upper); in main()
147 test("upper", std::ctype_base::upper | std::ctype_base::alpha, true); in main()
148 test("Upper", std::ctype_base::upper | std::ctype_base::alpha, true); in main()
166 | std::ctype_base::upper | std::ctype_base::lower); in main()
[all …]
/llvm-project/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype.byname/
H A Dis_many.pass.cpp47 assert( (m[0] & F::upper)); in main()
61 assert(!(m[1] & F::upper)); in main()
75 assert( (m[2] & F::upper)); in main()
89 assert(!(m[3] & F::upper)); in main()
103 assert(!(m[4] & F::upper)); in main()
117 assert(!(m[5] & F::upper)); in main()
131 assert(!(m[6] & F::upper)); in main()
164 assert( (m[0] & F::upper)); in main()
170 assert(!(m[0] & F::upper)); in main()
180 assert(!(m[1] & F::upper)); in main()
[all …]
/llvm-project/flang/lib/Semantics/
H A Dcheck-case.cpp53 "CASE has lower bound greater than upper bound"_warn_en_US); in AddCase()
65 cases_.back().upper = std::move(pair.second); in AddCase()
131 if (x.upper) { in ComputeBounds()
132 hi = GetValue(*x.upper); in ComputeBounds()
134 if ((x.lower && !lo) || (x.upper && !hi)) { in ComputeBounds()
145 bool IsDefault() const { return !lower && !upper; } in ComputeBounds()
152 if (!upper) { in AsFortran()
154 } else if (*lower != *upper) { in AsFortran()
155 evaluate::Constant<T>{*upper}.AsFortran(bs << ':'); in AsFortran()
158 } else if (upper) { in AsFortran()
172 std::optional<Value> lower, upper; global() member
[all...]
/llvm-project/openmp/runtime/src/
H A Dkmp_sched.cpp592 T upper = *pupper; in __kmp_dist_for_static_init() local
602 *plastiter = *plower <= upper && *pupperDist > upper - incr; in __kmp_dist_for_static_init()
603 if (*pupperDist > upper) in __kmp_dist_for_static_init()
604 *pupperDist = upper; // tracker C73258 in __kmp_dist_for_static_init()
613 *plastiter = *plower >= upper && *pupperDist < upper - incr; in __kmp_dist_for_static_init()
614 if (*pupperDist < upper) in __kmp_dist_for_static_init()
615 *pupperDist = upper; // tracker C73258 in __kmp_dist_for_static_init()
663 T upper = *pupperDist; in __kmp_dist_for_static_init() local
673 !(*plower <= upper && *pupper > upper - incr)) in __kmp_dist_for_static_init()
675 if (*pupper > upper) in __kmp_dist_for_static_init()
[all …]
/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVRange.cpp33 << hexValue(RangeEntry.upper()) << "]\n"; in startSearch()
36 RangesTree.insert(RangeEntry.lower(), RangeEntry.upper(), in startSearch()
112 if (LowerAddress >= RangeEntry.lower() && UpperAddress < RangeEntry.upper()) in getEntry()
121 UpperAddress == RangeEntry.upper()) in hasEntry()
136 return lhs.upper() < rhs.upper(); in sort()
153 OS << format("[0x%08x,0x%08x] ", RangeEntry.lower(), RangeEntry.upper()) in print()
/llvm-project/llvm/utils/TableGen/
H A DARMTargetDefEmitter.cpp
/llvm-project/flang/lib/Evaluate/
H A Dfold.cpp38 auto lower{triplet.lower()}, upper{triplet.upper()}; in GetConstantSubscript() local
43 if (!upper) { in GetConstantSubscript()
45 upper = ComputeUpperBound( in GetConstantSubscript()
49 auto lbi{ToInt64(lower)}, ubi{ToInt64(upper)}; in GetConstantSubscript()
136 MaybeExtentExpr upper{triplet.upper()}; in FoldOperation() local
137 return {Fold(context, std::move(lower)), Fold(context, std::move(upper)), in FoldOperation()
197 auto upper{Fold(context, substring.upper())}; in FoldOperation() local
200 std::move(lower), std::move(upper)}; in FoldOperation()
203 return Substring{std::move(p), std::move(lower), std::move(upper)}; in FoldOperation()

12345678910>>...21