Home
last modified time | relevance | path

Searched refs:unbounded (Results 1 – 23 of 23) sorted by relevance

/llvm-project-15.0.7/libcxx/test/libcxx/ranges/range.access/
H A Dend.incomplete_type.pass.cpp31 extern Incomplete unbounded[]; in test()
32 assert((!std::is_invocable_v<decltype(std::ranges::end), decltype((unbounded))>)); in test()
33 assert((!std::is_invocable_v<decltype(std::ranges::cend), decltype((unbounded))>)); in test()
34 assert((!std::is_invocable_v<decltype(std::ranges::end), decltype(std::as_const(unbounded))>)); in test()
35 assert((!std::is_invocable_v<decltype(std::ranges::cend), decltype(std::as_const(unbounded))>)); in test()
/llvm-project-15.0.7/mlir/include/mlir/Interfaces/
H A DInferIntRangeInterface.td33 and maximum values for its type (the unbounded range).
44 order. Non-integer arguments will have the an unbounded range of width-0
/llvm-project-15.0.7/polly/test/ScopInfo/
H A Dbounded_loop_assumptions.ll4 ; allows an "unbounded" loop trip count. We assume that does not happen, thus
7 ; finally, if N == 2 we would have an unbounded inner loop.
H A Disl_trip_count_02.ll3 ; TODO: We do not allow unbounded loops at the moment.
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dpr22856.ll6 define void @unbounded() {
/llvm-project-15.0.7/llvm/test/DebugInfo/Generic/
H A Darray.ll2 ; Do not emit AT_upper_bound for an unbounded array.
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DPresburgerSetTest.cpp826 PresburgerSet unbounded(parsePoly("(x, y) : (2*x - y >= 0, y - 3*x >= 0)")); in TEST() local
827 expectComputedVolumeIsValidOverapprox(unbounded, /*trueVolume=*/{}, in TEST()
831 expectComputedVolumeIsValidOverapprox(unbounded.unionSet(diamond), in TEST()
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dvscale_sext_and_zext.ll80 ; unbounded vscale_range maximum (0)
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_coalesce.c1373 goto unbounded; in add_selected_wraps()
1391 goto unbounded; in add_selected_wraps()
1398 unbounded: in add_selected_wraps()
1792 goto unbounded; in can_wrap_in_facet()
1799 goto unbounded; in can_wrap_in_facet()
1804 unbounded: in can_wrap_in_facet()
2339 goto unbounded; in check_eq_adj_eq()
2350 goto unbounded; in check_eq_adj_eq()
2357 unbounded: in check_eq_adj_eq()
/llvm-project-15.0.7/clang/test/Analysis/
H A Dsecurity-syntax-checks.m199 … insecure as it does not provide bounding of the memory buffer. Replace unbounded copy functions w…
204 … insecure as it does not provide bounding of the memory buffer. Replace unbounded copy functions w…
238 … insecure as it does not provide bounding of the memory buffer. Replace unbounded copy functions w…
/llvm-project-15.0.7/llvm/test/Transforms/Inline/
H A Dinline-tail.ll39 ; to prevent unbounded stack growth.
/llvm-project-15.0.7/mlir/docs/Dialects/
H A DAffine.md286 set with no constraints is a set that is unbounded along all of the set's
/llvm-project-15.0.7/clang/docs/analyzer/developer-docs/
H A DIPA.rst183 depth. This prevents unbounded analysis due to infinite recursion, but also
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Dimplementation.tex151 If any LP problem is unbounded, then the corresponding constraint
327 When the optimum is unbounded, the optimal value computed for
336 $\fract {\alpha M } = 0$. It should be noted, though, that an unbounded
363 produce an error if the problem turns out to be unbounded.
H A Duser.pod6526 there is one, negative infinity or infinity if the problem is unbounded and
6556 there is one, negative infinity or infinity if the problem is unbounded and
6570 there is one, (negative) infinity if the problem is unbounded and
6683 finite, so if the path lengths are unbounded (possibly due to
/llvm-project-15.0.7/llvm/docs/CommandGuide/
H A Dllvm-mca.rst849 ``-register-file-size``. A value of zero for this option means *unbounded*. By
920 load and store queues respectively. The queues are unbounded by default.
/llvm-project-15.0.7/lldb/docs/status/
H A Dprojects.rst19 a subtype of "std::string" into an unbounded search (all things with the name
/llvm-project-15.0.7/clang/docs/
H A DDataFlowAnalysisIntro.md372 grow unbounded. A practical static analysis system must control this growth to
H A DInternalsManual.rst1220 ``_Pragma`` and will most likely be used to handle unbounded look-ahead for the
/llvm-project-15.0.7/llvm/test/Transforms/Attributor/
H A Dwillreturn.ll568 ; unbounded trip count
/llvm-project-15.0.7/llvm/docs/
H A DCodeGenerator.rst1262 :raw-html:`<b><tt>` P\ :sub:`v`\ :raw-html:`</tt></b>`, that can use an unbounded
H A DLangRef.rst2229 unbounded. If the optional max value is omitted then max is set to the
11656 #. The call will not cause unbounded stack growth if it is part of a
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DAttrDocs.td563 unbounded stack growth if it is part of a recursive cycle in the call graph.
568 unbounded stack growth.