Home
last modified time | relevance | path

Searched refs:bounded (Results 1 – 25 of 36) sorted by relevance

12

/llvm-project/libcxx/test/libcxx/ranges/range.access/
H A Dend.incomplete_type.pass.cpp24 extern Incomplete bounded[10]; in test()
25 assert((!std::is_invocable_v<decltype(std::ranges::end), decltype((bounded))>)); in test()
26 assert((!std::is_invocable_v<decltype(std::ranges::cend), decltype((bounded))>)); in test()
27 assert((!std::is_invocable_v<decltype(std::ranges::end), decltype(std::as_const(bounded))>)); in test()
28 assert((!std::is_invocable_v<decltype(std::ranges::cend), decltype(std::as_const(bounded))>)); in test()
/llvm-project/polly/lib/External/isl/
H A Dbound.c75 isl_bool bounded; in verify_point() local
108 bounded = isl_set_is_bounded(dom); in verify_point()
110 if (bounded < 0) in verify_point()
113 if (!bounded) in verify_point()
122 if (vpb->exact && bounded) in verify_point()
144 p = isl_printer_print_str(p, bounded ? "opt" : "sample"); in verify_point()
H A Disl_scheduler_clustering.c749 isl_bool bounded; in distance_is_bounded() local
757 bounded = isl_set_is_empty(test); in distance_is_bounded()
760 if (bounded < 0 || !bounded) in distance_is_bounded()
761 return bounded; in distance_is_bounded()
765 bounded = isl_set_is_empty(test); in distance_is_bounded()
768 return bounded; in distance_is_bounded()
845 isl_bool bounded; in has_bounded_distances() local
856 bounded = isl_bool_true; in has_bounded_distances()
872 bounded = isl_bool_false; in has_bounded_distances()
881 bounded = isl_bool_false; in has_bounded_distances()
[all …]
H A Disl_sample.c955 struct isl_basic_set *bounded; in isl_basic_set_sample_with_cone() local
973 bounded = isl_basic_set_copy(bset); in isl_basic_set_sample_with_cone()
974 bounded = isl_basic_set_drop_constraints_involving(bounded, in isl_basic_set_sample_with_cone()
976 bounded = isl_basic_set_drop_dims(bounded, total - cone_dim, cone_dim); in isl_basic_set_sample_with_cone()
977 sample = sample_bounded(bounded); in isl_basic_set_sample_with_cone()
1154 int bounded) in basic_set_sample() argument
1183 return sample_eq(bset, bounded ? isl_basic_set_sample_bounded in basic_set_sample()
1190 return bounded ? sample_bounded(bset) : gbr_sample(bset); in basic_set_sample()
H A Disl_bound.c90 int bounded; in compressed_guarded_poly_bound() local
106 bounded = isl_basic_set_is_bounded(bset); in compressed_guarded_poly_bound()
107 if (bounded < 0) in compressed_guarded_poly_bound()
109 if (bounded) in compressed_guarded_poly_bound()
H A Disl_convex_hull.c813 isl_bool bounded; in isl_basic_set_is_bounded() local
821 bounded = isl_tab_cone_is_bounded(tab); in isl_basic_set_is_bounded()
823 return bounded; in isl_basic_set_is_bounded()
833 isl_bool bounded; in isl_basic_map_image_is_bounded() local
842 bounded = isl_basic_set_is_bounded(bset_from_bmap(bmap)); in isl_basic_map_image_is_bounded()
845 return bounded; in isl_basic_map_image_is_bounded()
858 isl_bool bounded = isl_basic_set_is_bounded(set->p[i]); in isl_set_is_bounded() local
859 if (!bounded || bounded < 0) in isl_set_is_bounded()
860 return bounded; in isl_set_is_bounded()
1794 isl_bool bounded; in uset_convex_hull() local
[all …]
H A DREADME2 of integer points bounded by affine constraints. The descriptions of
H A Disl_test.c581 isl_bool bounded; in test_bounded() local
584 bounded = isl_set_is_bounded(set); in test_bounded()
587 if (bounded < 0) in test_bounded()
589 if (!bounded) in test_bounded()
594 bounded = isl_set_is_bounded(set); in test_bounded()
595 assert(!bounded); in test_bounded()
598 if (bounded < 0) in test_bounded()
600 if (bounded) in test_bounded()
605 bounded = isl_set_is_bounded(set); in test_bounded()
608 if (bounded < 0) in test_bounded()
[all …]
H A Disl_map.c11490 isl_bool bounded; in isl_map_dim_is_bounded() local
11491 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos); in isl_map_dim_is_bounded()
11492 if (bounded < 0 || !bounded) in isl_map_dim_is_bounded()
11493 return bounded; in isl_map_dim_is_bounded()
11521 isl_bool bounded; in has_any_bound() local
11522 bounded = fn(map->p[i], type, pos); in has_any_bound()
11523 if (bounded < 0 || bounded) in has_any_bound()
11524 return bounded; in has_any_bound()
11561 isl_bool bounded; in has_bound() local
11562 bounded = fn(map->p[i], type, pos); in has_bound()
[all …]
H A Disl_polynomial.c4882 isl_bool bounded; in isl_basic_set_multiplicative_call() local
4899 bounded = isl_basic_set_is_bounded(bset); in isl_basic_set_multiplicative_call()
4900 if (bounded < 0) in isl_basic_set_multiplicative_call()
4902 if (!bounded) in isl_basic_set_multiplicative_call()
/llvm-project/llvm/test/Transforms/InstCombine/
H A DAddOverFlow.ll44 declare i16 @bounded(i16 %input);
52 ; CHECK-NEXT: [[C:%.*]] = call i16 @bounded(i16 [[A:%.*]]), !range [[RNG0:![0-9]+]]
53 ; CHECK-NEXT: [[D:%.*]] = invoke i16 @bounded(i16 [[B:%.*]])
64 %c = call i16 @bounded(i16 %a), !range !0
65 %d = invoke i16 @bounded(i16 %b) to label %cont unwind label %lpad, !range !0
79 ; CHECK-NEXT: [[C:%.*]] = call i16 @bounded(i16 [[A:%.*]]), !range [[RNG1:![0-9]+]]
80 ; CHECK-NEXT: [[D:%.*]] = invoke i16 @bounded(i16 [[B:%.*]])
91 %c = call i16 @bounded(i16 %a), !range !1
92 %d = invoke i16 @bounded(i16 %b) to label %cont unwind label %lpad, !range !1
/llvm-project/mlir/include/mlir/Dialect/Affine/TransformOps/
H A DAffineTransformOps.td39 result of index type. The sets of target ops and bounded ops must not
45 target handle and does not produce any handle. It reads the bounded op
/llvm-project/libc/docs/math/
H A Dlog.rst
/llvm-project/clang/test/Analysis/
H A DMismatchedDeallocator-checker-test.mm180 // Check for intersection with unix.Malloc bounded with
218 // Check for intersection with cplusplus.NewDelete bounded with
/llvm-project/mlir/lib/Dialect/Arith/IR/
H A DArithOps.cpp2467 bool bounded = false; in fold()
2470 bounded = b.ult(b.getBitWidth());
2473 return bounded ? result : Attribute();
2485 bool bounded = false; in getIdentityValueAttr()
2488 bounded = b.ult(b.getBitWidth()); in getIdentityValueAttr()
2491 return bounded ? result : Attribute(); in getIdentityValueAttr()
2503 bool bounded = false; in getIdentityValueAttr()
2506 bounded = b.ult(b.getBitWidth()); in getIdentityValueAttr()
2509 return bounded ? result : Attribute(); in getIdentityValueAttr()
2426 bool bounded = false; fold() local
2444 bool bounded = false; fold() local
2462 bool bounded = false; fold() local
/llvm-project/llvm/docs/HistoricalNotes/
H A D2001-05-19-ExceptionResponse.txt21 bounded) I don't think this is a big deal. One of the really nice things
/llvm-project/clang-tools-extra/pseudo/
H A DDesignNotes.md
/llvm-project/libcxx/docs/
H A DHardening.rst110 work, bounded iterators must be enabled in the ABI. Types like
320 containers (see below) to a bounded iterator that keeps track of whether it's
332 ``basic_string`` to a bounded iterator that keeps track of whether it's within
340 ``vector`` to a bounded iterator that keeps track of whether it's within the
358 bounded iterator that keeps track of whether it's within the bounds of the container and asserts it
/llvm-project/libcxx/modules/std/
H A Dalgorithm.inc588 // [alg.clamp], bounded value
/llvm-project/polly/lib/External/isl/doc/
H A Disl.bib336 relations of sequences of integers bounded by (quasi-)affine constraints.
/llvm-project/mlir/docs/
H A DShapeInference.md68 or bounded shapes at a later point). This allows for decoupling of these:
H A DPatternRewriter.md122 patterns have a proper bounded recursion, and will fail if recursion is
/llvm-project/polly/test/ScopInfo/
H A Dcomplex-successor-structure-2.ll8 ; anymore after B3. This will keep the condition construction bounded.
/llvm-project/libcxx/docs/Status/
H A DCxx20Papers.csv95 "`P1357R1 <https://wg21.link/P1357R1>`__","Traits for [Un]bounded Arrays","2019-02 (Kona)","|Complete|","9",""
/llvm-project/lldb/docs/resources/
H A Dprojects.rst15 particular is slow, but rather that we somehow turned an bounded search (maybe

12