| /netbsd-src/external/gpl2/groff/dist/contrib/groffer/ |
| H A D | groffer2.sh | 1060 if obj _APROPOS_PROG is_empty
1064 if obj _APROPOS_SECTIONS is_empty
1066 if obj _OPT_SECTIONS is_empty
1112 if obj _APROPOS_PROG is_empty
1238 if is_empty "$1"
1242 if is_empty "$2"
1537 is_empty() function
1539 func_check is_empty '=' 1 "$@";
1661 if is_empty "$1"
1757 if obj DISPLAY is_empty
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | hash-table.h | 415 bool is_empty () const { return elements () == 0; } in is_empty() function
539 static bool is_empty (value_type &v) in is_empty() function
541 return Descriptor::is_empty (v); in is_empty()
665 else if (!is_empty (entry)) in hash_table()
681 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i])) in ~hash_table()
741 if (is_empty (*slot)) in find_empty_slot_for_expand()
753 if (is_empty (*slot)) in find_empty_slot_for_expand()
819 if (!is_empty (x) && !is_deleted (x)) in expand()
850 if (!is_empty (entries[i]) && !is_deleted (entries[i])) in empty_slow()
894 || is_empty (*slot) || is_deleted (*slot))); in clear_slot()
[all …]
|
| H A D | hash-map-traits.h | 40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) in is_empty() function
75 return H::is_empty (entry.m_key); in is_empty()
118 template <typename T> static inline bool is_empty (const T &);
135 unbounded_hashmap_traits <Value>::is_empty (const T &entry) in is_empty() function
137 return default_hash_traits <Value>::is_empty (entry.m_value); in is_empty()
|
| H A D | hash-traits.h | 106 static inline bool is_empty (Type);
147 int_hash <Type, Empty, Deleted>::is_empty (Type x) in is_empty() function
169 static inline bool is_empty (Type *);
212 pointer_hash <Type>::is_empty (Type *e) in is_empty() function
348 static inline bool is_empty (const value_type &);
396 pair_hash <T1, T2>::is_empty (const value_type &x) in is_empty() function
398 return T1::is_empty (x.first); in is_empty()
|
| H A D | hash-map.h | 71 static bool is_empty (const hash_entry &e) { return Traits::is_empty (e); } in class() function
172 bool ins = hash_entry::is_empty (*e); in class()
190 return Traits::is_empty (e) ? NULL : &e.m_value; in class()
201 bool ins = Traits::is_empty (*e); in class()
248 bool is_empty () const { return m_table.is_empty (); } in class()
|
| H A D | hash-set.h | 59 bool existed = !Traits::is_empty (*e); in add()
74 return !Traits::is_empty (e); in contains()
102 bool is_empty () const { return m_table.is_empty (); } in is_empty() function
|
| H A D | gimple-predicate-analysis.h | 88 bool is_empty () const in is_empty() function
90 return m_preds.is_empty (); in is_empty()
|
| H A D | gimple-predicate-analysis.cc | 1192 if (preds.is_empty ()) in can_be_invalidated_p()
1266 if (def_preds.is_empty ()) in use_cannot_happen()
1417 if (m_preds[i].is_empty ()) in simplify_2()
1536 if (m_preds[i].is_empty ()) in simplify_4()
1759 gcc_assert (is_empty ()); in init_from_phi_def()
1802 return !is_empty (); in init_from_phi_def()
1842 if (is_empty ()) in is_use_guarded()
1854 if (use_preds.is_empty ()) in is_use_guarded()
1871 if (is_empty ()) in is_use_guarded()
2041 while (!work_list.is_empty ()) in normalize()
[all …]
|
| H A D | cfganal.cc | 86 while (!stack.is_empty ()) in mark_dfs_back_edges()
676 while (!stack.is_empty ()) in post_order_compute()
875 while (!stack.is_empty ()) in inverted_post_order_compute()
944 if (has_unvisited_bb && stack.is_empty ()) in inverted_post_order_compute()
957 while (!stack.is_empty ()); in inverted_post_order_compute()
1003 while (!stack.is_empty ()) in pre_and_rev_post_order_compute_fn()
1260 if (!ei_stack.is_empty ()) in rev_post_order_and_mark_dfs_back_seme()
1384 && !bb_data[dest->index].scc_exits.is_empty ()) in rev_post_order_and_mark_dfs_back_seme()
1409 while (!estack.is_empty () in rev_post_order_and_mark_dfs_back_seme()
1432 && (estack.is_empty () in rev_post_order_and_mark_dfs_back_seme()
[all …]
|
| H A D | gimple-if-to-switch.cc | 204 bool has_forwarder = !info->m_true_edge_phi_mapping.is_empty (); in is_beneficial()
311 if (!info->m_true_edge_phi_mapping.is_empty ()) in convert_if_conditions_to_switch()
422 if (!info->m_ranges.is_empty ()) in find_conditions()
501 if (conditions_in_bbs.is_empty ()) in execute()
572 if (!all_candidates.is_empty ()) in execute()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | hash-table.h | 415 bool is_empty () const { return elements () == 0; } in is_empty() function
539 static bool is_empty (value_type &v) in is_empty() function
541 return Descriptor::is_empty (v); in is_empty()
665 else if (!is_empty (entry)) in hash_table()
681 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i])) in ~hash_table()
741 if (is_empty (*slot)) in find_empty_slot_for_expand()
753 if (is_empty (*slot)) in find_empty_slot_for_expand()
819 if (!is_empty (x) && !is_deleted (x)) in expand()
847 if (!is_empty (entries[i]) && !is_deleted (entries[i])) in empty_slow()
891 || is_empty (*slot) || is_deleted (*slot))); in clear_slot()
[all …]
|
| H A D | hash-map-traits.h | 40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) in is_empty() function
75 return H::is_empty (entry.m_key); in is_empty()
118 template <typename T> static inline bool is_empty (const T &);
135 unbounded_hashmap_traits <Value>::is_empty (const T &entry) in is_empty() function
137 return default_hash_traits <Value>::is_empty (entry.m_value); in is_empty()
|
| H A D | hash-traits.h | 94 static inline bool is_empty (Type);
135 int_hash <Type, Empty, Deleted>::is_empty (Type x) in is_empty() function
157 static inline bool is_empty (Type *);
200 pointer_hash <Type>::is_empty (Type *e) in is_empty() function
331 static inline bool is_empty (const value_type &);
379 pair_hash <T1, T2>::is_empty (const value_type &x) in is_empty() function
381 return T1::is_empty (x.first); in is_empty()
|
| H A D | hash-map.h | 71 static bool is_empty (const hash_entry &e) { return Traits::is_empty (e); } in class() function
168 bool ins = hash_entry::is_empty (*e); in class()
185 return Traits::is_empty (e) ? NULL : &e.m_value; in class()
196 bool ins = Traits::is_empty (*e); in class()
241 bool is_empty () const { return m_table.is_empty (); } in class()
|
| H A D | hash-set.h | 59 bool existed = !Traits::is_empty (*e); in add()
74 return !Traits::is_empty (e); in contains()
102 bool is_empty () const { return m_table.is_empty (); } in is_empty() function
|
| H A D | cfganal.c | 85 while (!stack.is_empty ()) in mark_dfs_back_edges()
647 while (!stack.is_empty ()) in post_order_compute()
848 while (!stack.is_empty ()) in inverted_post_order_compute()
917 if (has_unvisited_bb && stack.is_empty ()) in inverted_post_order_compute()
930 while (!stack.is_empty ()); in inverted_post_order_compute()
976 while (!stack.is_empty ()) in pre_and_rev_post_order_compute_fn()
1233 if (!ei_stack.is_empty ()) in rev_post_order_and_mark_dfs_back_seme()
1357 && !bb_data[dest->index].scc_exits.is_empty ()) in rev_post_order_and_mark_dfs_back_seme()
1382 while (!estack.is_empty () in rev_post_order_and_mark_dfs_back_seme()
1405 && (estack.is_empty () in rev_post_order_and_mark_dfs_back_seme()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/contrib/ |
| H A D | check-MAINTAINERS.py | 62 def is_empty(line): function
91 chunk = list(takewhile(is_empty, lines))
98 chunk = list(takewhile(is_empty, lines))
105 chunk = list(takewhile(is_empty, lines))
|
| /netbsd-src/external/mit/isl/dist/ |
| 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()
234 return not map.lex_ge_at(id).is_empty()
254 def is_empty(s): function
255 return s.is_empty()
256 assert(not us.every_set(is_empty))
259 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 | 52 bool b_true = empty.is_empty(); in test_return_bool()
53 bool b_false = univ.is_empty(); in test_return_bool()
56 null.is_empty(); in test_return_bool()
140 return !map.lex_ge_at(id).is_empty(); in test_foreach_scc()
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/stdcpp/ |
| H A D | xutility.d | 43 import core.stdcpp.type_traits : is_empty; in version()
311 extern (C++, class) struct _Compressed_pair(_Ty1, _Ty2, bool Ty1Empty = is_empty!_Ty1.value) in version()
341 import core.stdcpp.type_traits : is_empty; in version()
349 enum Ty1Empty = is_empty!_T1.value; in version()
350 enum Ty2Empty = is_empty!_T2.value; in version()
|
| /netbsd-src/external/gpl2/groff/dist/src/include/ |
| H A D | symbol.h | 42 int is_empty() const;
78 inline int symbol::is_empty() const in is_empty() function
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/ |
| H A D | svalue.h | 219 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } in is_empty() function
389 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
496 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
618 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
706 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
797 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
878 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
965 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
1141 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
1255 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); }
[all …]
|
| H A D | call-string.cc | 207 if (m_elements.is_empty ()) in calc_recursion_depth()
268 if(m_elements.is_empty ()) in get_callee_node()
278 if(m_elements.is_empty ()) in get_caller_node()
|