| /llvm-project-15.0.7/libcxx/test/std/input.output/filesystems/fs.op.funcs/fs.op.is_empty/ |
| H A D | is_empty.pass.cpp | 32 ASSERT_NOT_NOEXCEPT(is_empty(p, ec)); in TEST_CASE()
33 ASSERT_NOT_NOEXCEPT(is_empty(p)); in TEST_CASE()
41 TEST_CHECK(is_empty(p, ec) == false); in TEST_CASE()
49 TEST_CHECK(!is_empty(static_env.Dir)); in TEST_CASE()
50 TEST_CHECK(!is_empty(static_env.SymlinkToDir)); in TEST_CASE()
56 TEST_CHECK(is_empty(env.test_root)); in TEST_CASE()
58 TEST_CHECK(!is_empty(env.test_root)); in TEST_CASE()
64 TEST_CHECK(is_empty(static_env.EmptyFile)); in TEST_CASE()
85 TEST_CHECK(is_empty(p, ec) == false); in TEST_CASE()
108 TEST_CHECK(is_empty(dir, ec) == false); in TEST_CASE()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/ |
| H A D | is_empty.pass.cpp | 27 static_assert( std::is_empty<T>::value, ""); in test_is_empty()
28 static_assert( std::is_empty<const T>::value, ""); in test_is_empty()
29 static_assert( std::is_empty<volatile T>::value, ""); in test_is_empty()
30 static_assert( std::is_empty<const volatile T>::value, ""); in test_is_empty()
42 static_assert(!std::is_empty<T>::value, ""); in test_is_not_empty()
43 static_assert(!std::is_empty<const T>::value, ""); in test_is_not_empty()
44 static_assert(!std::is_empty<volatile T>::value, ""); in test_is_not_empty()
45 static_assert(!std::is_empty<const volatile T>::value, ""); in test_is_not_empty()
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_pw_union_opt.c | 185 isl_bool is_subset, is_empty; in FN() local
200 is_empty = isl_set_is_empty(better); in FN()
201 if (is_empty >= 0 && is_empty) in FN()
207 if (is_empty < 0 || is_subset < 0) in FN()
313 if (FN(PW,is_empty)(pw1)) { in FN()
318 if (FN(PW,is_empty)(pw2)) { in FN()
|
| H A D | isl_test_python.py | 128 b_true = empty.is_empty()
129 b_false = univ.is_empty()
203 def is_empty(s): function
204 return s.is_empty()
205 assert(not us.every_set(is_empty))
208 return not s.is_empty()
|
| H A D | isl_test_cpp-generic.cc | 33 assert(IS_TRUE(empty.is_empty())); in test_pointer()
202 auto is_empty = [] (isl::set s) { in test_every_generic() local
203 return s.is_empty(); in test_every_generic()
205 assert(!IS_TRUE(us.every_set(is_empty))); in test_every_generic()
208 return !s.is_empty(); in test_every_generic()
|
| H A D | isl_test_cpp.cc | 50 bool b_true = empty.is_empty(); in test_return_bool()
51 bool b_false = univ.is_empty(); in test_return_bool()
54 null.is_empty(); in test_return_bool()
|
| H A D | isl_test_cpp-checked.cc | 67 isl::boolean b_true = empty.is_empty(); in test_return_bool()
68 isl::boolean b_false = univ.is_empty(); in test_return_bool()
69 isl::boolean b_error = null.is_empty(); in test_return_bool()
|
| H A D | isl_map_subtract.c | 698 isl_bool is_empty = isl_bool_true; in map_diff_is_empty() local
704 is_empty = basic_map_diff_is_empty(map1->p[i], map2); in map_diff_is_empty()
705 if (is_empty < 0 || !is_empty) in map_diff_is_empty()
709 return is_empty; in map_diff_is_empty()
|
| H A D | isl_fold.c | 943 #define EL_IS_ZERO is_empty
1569 isl_bool is_empty; in isl_pw_qpolynomial_fold_covers() local
1575 is_empty = isl_set_is_empty(common); in isl_pw_qpolynomial_fold_covers()
1576 if (is_empty < 0 || is_empty) { in isl_pw_qpolynomial_fold_covers()
1578 if (is_empty < 0) in isl_pw_qpolynomial_fold_covers()
|
| H A D | isl_transitive_closure.c | 2345 isl_bool is_empty, is_exact; in check_exactness_omega() local
2355 is_empty = isl_set_is_empty(delta); in check_exactness_omega()
2357 if (is_empty < 0 || !is_empty) in check_exactness_omega()
2358 return is_empty; in check_exactness_omega()
|
| /llvm-project-15.0.7/clang/test/Lexer/ |
| H A D | has_feature_type_traits.cpp | 68 #if __has_feature(is_empty)
69 int is_empty();
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/ |
| H A D | stringview-nullptr.rst | 26 bool is_empty = sv == nullptr;
43 bool is_empty = sv.empty();
|
| /llvm-project-15.0.7/libcxx/include/__type_traits/ |
| H A D | is_empty.h | 22 struct _LIBCPP_TEMPLATE_VIS is_empty struct
|
| /llvm-project-15.0.7/polly/lib/Transform/ |
| H A D | DeLICM.cpp | 397 if (!ExistingConflictingKnown.is_empty()) in isConflicting()
400 if (!ProposedConflictingKnown.is_empty()) in isConflicting()
450 if (!ProposedConflictingKnown.is_empty()) in isConflicting()
479 if (!ExistingConflictingKnown.is_empty()) in isConflicting()
508 if (!ExistingConflictingWritten.is_empty()) in isConflicting()
511 if (!ProposedConflictingWritten.is_empty()) in isConflicting()
|
| H A D | Simplify.cpp | 234 return EffectiveDomain.is_empty(); in removeEmptyDomainStmts()
594 if (!AccRel.is_empty().is_true()) in removeEmptyPartialAccesses()
|
| H A D | FlattenAlgo.cpp | 184 while (!ScatterSet.is_empty()) { in tryFlattenSequence()
|
| H A D | MaximalStaticExpansion.cpp | 305 if (MapDependences.is_empty()) in mapAccess()
|
| /llvm-project-15.0.7/polly/lib/CodeGen/ |
| H A D | IslAst.cpp | 368 if (!AFirst.intersect_params(Params).domain().is_empty() && in buildCondition()
369 !BSecond.intersect_params(Params).domain().is_empty()) { in buildCondition()
375 if (!BFirst.intersect_params(Params).domain().is_empty() && in buildCondition()
376 !ASecond.intersect_params(Params).domain().is_empty()) { in buildCondition()
|
| /llvm-project-15.0.7/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libcxx/string/simulator/ |
| H A D | main.cpp | 37 std::is_empty<_Tp>::value && !std::is_final<_Tp>::value>
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | filesystem | 153 bool is_empty(const path& p);
154 bool is_empty(const path& p, error_code& ec) noexcept;
|
| H A D | type_traits | 103 template <class T> struct is_empty;
307 = is_empty<T>::value; // C++17
461 #include <__type_traits/is_empty.h>
|
| /llvm-project-15.0.7/libcxx/include/__memory/ |
| H A D | compressed_pair.h | 29 template <class _Tp, int _Idx, bool _CanBeEmptyBase = is_empty<_Tp>::value && !__libcpp_is_final<_T…
|
| /llvm-project-15.0.7/libcxx/include/__filesystem/ |
| H A D | operations.h | 122 inline _LIBCPP_HIDE_FROM_ABI bool is_empty(const path& __p) { return __fs_is_empty(__p); } in is_empty() function
123 inline _LIBCPP_HIDE_FROM_ABI bool is_empty(const path& __p, error_code& __ec) { return __fs_is_empt… in is_empty() function
|
| /llvm-project-15.0.7/polly/lib/Analysis/ |
| H A D | ScopBuilder.cpp | 1032 if (InvalidDomain.is_empty()) { in propagateInvalidStmtDomains()
1159 assert(!USet.is_empty()); in mapToDimension()
2549 Valid = Valid && OverlapAccs.is_empty(); in checkForReductions()
2713 assert(!AccessRelation.is_empty()); in getNonHoistableCtx()
2738 bool IsWritten = !WrittenCtx.is_empty(); in getNonHoistableCtx()
2804 bool StmtInvalidCtxIsEmpty = StmtInvalidCtx.is_empty(); in addInvariantLoads()
2855 bool NonHoistableCtxIsEmpty = NHCtx.is_empty(); in addInvariantLoads()
2856 bool MAInvalidCtxIsEmpty = MAInvalidCtx.is_empty(); in addInvariantLoads()
3209 bool StmtDomainEmpty = StmtDomain.is_empty(); in buildAliasGroupsForAccesses()
|
| H A D | ScopInfo.cpp | 265 return bool(WriteSet.is_empty()); in isReadOnly()
1095 if (Domain.is_empty()) in getSchedule()
1101 if (Schedule.is_empty()) in getSchedule()
1681 return Domain.is_empty(); in removeStmtNotInDomainMap()
1881 return PositiveContext.is_empty().is_false() && in hasFeasibleRuntimeContext()
1953 bool IsTrivial = (Sign == AS_RESTRICTION && Set.is_empty()) || in trackAssumption()
2285 if (NewStmtDomain.is_empty()) in restrictDomains()
|