Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/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-15.0.7/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_sample.c952 struct isl_basic_set *bounded; in isl_basic_set_sample_with_cone() local
970 bounded = isl_basic_set_copy(bset); in isl_basic_set_sample_with_cone()
971 bounded = isl_basic_set_drop_constraints_involving(bounded, in isl_basic_set_sample_with_cone()
973 bounded = isl_basic_set_drop_dims(bounded, total - cone_dim, cone_dim); in isl_basic_set_sample_with_cone()
974 sample = sample_bounded(bounded); in isl_basic_set_sample_with_cone()
1151 int bounded) in basic_set_sample() argument
1182 return sample_eq(bset, bounded ? isl_basic_set_sample_bounded in basic_set_sample()
1189 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
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
1818 bounded = isl_set_is_bounded(set); in uset_convex_hull()
[all …]
H A DREADME2 of integer points bounded by affine constraints. The descriptions of
H A Disl_scheduler.c6689 isl_bool bounded; in distance_is_bounded() local
6700 if (bounded < 0 || !bounded) in distance_is_bounded()
6701 return bounded; in distance_is_bounded()
6708 return bounded; in distance_is_bounded()
6785 isl_bool bounded; in has_bounded_distances() local
6796 bounded = isl_bool_true; in has_bounded_distances()
6821 bounded = isl_bool_false; in has_bounded_distances()
6829 return bounded; in has_bounded_distances()
6855 isl_bool bounded; in ok_to_merge_proximity() local
6868 if (bounded < 0 || bounded) in ok_to_merge_proximity()
[all …]
H A Disl_test.c550 isl_bool bounded; in test_bounded() local
553 bounded = isl_set_is_bounded(set); in test_bounded()
556 if (bounded < 0) in test_bounded()
558 if (!bounded) in test_bounded()
563 bounded = isl_set_is_bounded(set); in test_bounded()
564 assert(!bounded); in test_bounded()
567 if (bounded < 0) in test_bounded()
569 if (bounded) in test_bounded()
577 if (bounded < 0) in test_bounded()
579 if (bounded) in test_bounded()
[all …]
H A Disl_map.c11470 isl_bool bounded; in isl_map_dim_is_bounded() local
11472 if (bounded < 0 || !bounded) in isl_map_dim_is_bounded()
11473 return bounded; in isl_map_dim_is_bounded()
11501 isl_bool bounded; in has_any_bound() local
11502 bounded = fn(map->p[i], type, pos); in has_any_bound()
11503 if (bounded < 0 || bounded) in has_any_bound()
11504 return bounded; in has_any_bound()
11541 isl_bool bounded; in has_bound() local
11542 bounded = fn(map->p[i], type, pos); in has_bound()
11543 if (bounded < 0 || !bounded) in has_bound()
[all …]
H A Disl_polynomial.c4879 isl_bool bounded; in isl_basic_set_multiplicative_call() local
4896 bounded = isl_basic_set_is_bounded(bset); in isl_basic_set_multiplicative_call()
4897 if (bounded < 0) in isl_basic_set_multiplicative_call()
4899 if (!bounded) in isl_basic_set_multiplicative_call()
/llvm-project-15.0.7/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-15.0.7/mlir/lib/Dialect/Arithmetic/IR/
H A DArithmeticOps.cpp1909 bool bounded = false; in fold() local
1912 bounded = b.ule(b.getBitWidth()); in fold()
1915 return bounded ? result : Attribute(); in fold()
1924 bool bounded = false; in fold() local
1927 bounded = b.ule(b.getBitWidth()); in fold()
1930 return bounded ? result : Attribute(); in fold()
1939 bool bounded = false; in fold() local
1942 bounded = b.ule(b.getBitWidth()); in fold()
1945 return bounded ? result : Attribute(); in fold()
/llvm-project-15.0.7/clang/test/Analysis/
H A DMismatchedDeallocator-checker-test.mm132 // Check for intersection with unix.Malloc bounded with
170 // Check for intersection with cplusplus.NewDelete bounded with
/llvm-project-15.0.7/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-15.0.7/clang-tools-extra/pseudo/
H A DDesignNotes.md3 Problem: we have two fairly generic cases of recovery bounded within a range:
/llvm-project-15.0.7/polly/lib/External/ppcg/
H A DREADME193 bounded loops iterating over them.
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Disl.bib336 relations of sequences of integers bounded by (quasi-)affine constraints.
/llvm-project-15.0.7/mlir/docs/
H A DShapeInference.md66 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-15.0.7/polly/test/ScopInfo/
H A Dcomplex-successor-structure-2.ll8 ; anymore after B3. This will keep the condition construction bounded.
/llvm-project-15.0.7/libcxx/docs/Status/
H A DCxx20Papers.csv94 "`P1357R1 <https://wg21.link/P1357R1>`__","LWG","Traits for [Un]bounded Arrays","Kona","|Complete|"…
/llvm-project-15.0.7/lldb/docs/status/
H A Dprojects.rst18 particular is slow, but rather that we somehow turned an bounded search (maybe
/llvm-project-15.0.7/llvm/docs/AMDGPUDwarfExtensionAllowLocationDescriptionOnTheDwarfExpressionStack/
H A DAMDGPUDwarfExtensionAllowLocationDescriptionOnTheDwarfExpressionStack.md2741 lifetime bounded by a starting and ending address. The starting address is
2749 There are several kinds of bounded location description entries which differ
2756 bounded location description entry applies.
2759 within the range of any bounded location description entry.
2765 bounded location description entries. The applicable base address of a
2766 bounded location description entry is the address specified by the closest
2780 The address ranges defined by the bounded location description entries of a
/llvm-project-15.0.7/llvm/include/llvm/Target/GlobalISel/
H A DCombine.td213 // [us]itofp(undef) = 0, because the result value is bounded.
/llvm-project-15.0.7/llvm/docs/
H A DAMDGPUDwarfExtensionsForHeterogeneousDebugging.rst2893 lifetime bounded by a starting and ending address. The starting address is the
2901 There are several kinds of bounded location description entries which differ
2908 bounded location description entry applies.
2911 within the range of any bounded location description entry.
2917 bounded location description entries. The applicable base address of a bounded
2931 The address ranges defined by the bounded location description entries of a

12