Searched refs:is_empty (Results 1 - 25 of 409) sorted by relevance

1234567891011>>

/netbsd-current/external/gpl2/groff/dist/src/include/
H A Dsymbol.h42 int is_empty() const;
78 inline int symbol::is_empty() const function in class:symbol
/netbsd-current/external/gpl3/gcc/dist/contrib/
H A Dcheck-MAINTAINERS.py62 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-current/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dcall-string.h52 bool empty_p () const { return m_return_edges.is_empty (); }
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dhash-set.h59 bool existed = !Traits::is_empty (*e);
74 return !Traits::is_empty (e);
102 bool is_empty () const { return m_table.is_empty (); } function in class:hash_set
H A Dtree-hasher.h42 static bool is_empty (const value_type &v) { return v.to == NULL; } function in struct:int_tree_hasher
H A Dhash-map-traits.h40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) function in class:simple_hashmap_traits
75 return H::is_empty (entry.m_key);
118 template <typename T> static inline bool is_empty (const T &);
135 unbounded_hashmap_traits <Value>::is_empty (const T &entry) function in class:unbounded_hashmap_traits
137 return default_hash_traits <Value>::is_empty (entry.m_value);
H A Dhash-traits.h94 static inline bool is_empty (Type);
135 int_hash <Type, Empty, Deleted>::is_empty (Type x) function in class:int_hash
157 static inline bool is_empty (Type *);
200 pointer_hash <Type>::is_empty (Type *e) function in class:pointer_hash
331 static inline bool is_empty (const value_type &);
379 pair_hash <T1, T2>::is_empty (const value_type &x) function in class:pair_hash
381 return T1::is_empty (x.first);
H A Dhash-table.h415 bool is_empty () const { return elements () == 0; } function in class:hash_table
539 static bool is_empty (value_type &v) function in class:hash_table
541 return Descriptor::is_empty (v);
665 else if (!is_empty (entry))
681 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i]))
741 if (is_empty (*slot))
753 if (is_empty (*slot))
819 if (!is_empty (x) && !is_deleted (x))
847 if (!is_empty (entries[i]) && !is_deleted (entries[i]))
891 || is_empty (*slo
[all...]
H A Dhash-map.h71 static bool is_empty (const hash_entry &e) { return Traits::is_empty (e); } function in struct:hash_entry
168 bool ins = hash_entry::is_empty (*e);
185 return Traits::is_empty (e) ? NULL : &e.m_value;
196 bool ins = Traits::is_empty (*e);
241 bool is_empty () const { return m_table.is_empty (); } function
H A Dcfganal.c86 while (!stack.is_empty ())
651 while (!stack.is_empty ())
852 while (!stack.is_empty ())
921 if (has_unvisited_bb && stack.is_empty ())
934 while (!stack.is_empty ());
980 while (!stack.is_empty ())
1237 if (!ei_stack.is_empty ())
1361 && !bb_data[dest->index].scc_exits.is_empty ())
1386 while (!estack.is_empty ()
1409 && (estack.is_empty ()
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dhash-set.h59 bool existed = !Traits::is_empty (*e);
74 return !Traits::is_empty (e);
102 bool is_empty () const { return m_table.is_empty (); } function in class:hash_set
H A Dtree-hasher.h42 static bool is_empty (const value_type &v) { return v.to == NULL; } function in struct:int_tree_hasher
H A Dgimple-predicate-analysis.h88 bool is_empty () const function in class:predicate
90 return m_preds.is_empty ();
H A Dhash-map-traits.h40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) function in class:simple_hashmap_traits
75 return H::is_empty (entry.m_key);
118 template <typename T> static inline bool is_empty (const T &);
135 unbounded_hashmap_traits <Value>::is_empty (const T &entry) function in class:unbounded_hashmap_traits
137 return default_hash_traits <Value>::is_empty (entry.m_value);
H A Dhash-traits.h106 static inline bool is_empty (Type);
147 int_hash <Type, Empty, Deleted>::is_empty (Type x) function in class:int_hash
169 static inline bool is_empty (Type *);
212 pointer_hash <Type>::is_empty (Type *e) function in class:pointer_hash
348 static inline bool is_empty (const value_type &);
396 pair_hash <T1, T2>::is_empty (const value_type &x) function in class:pair_hash
398 return T1::is_empty (x.first);
H A Dhash-table.h415 bool is_empty () const { return elements () == 0; } function in class:hash_table
539 static bool is_empty (value_type &v) function in class:hash_table
541 return Descriptor::is_empty (v);
665 else if (!is_empty (entry))
681 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i]))
741 if (is_empty (*slot))
753 if (is_empty (*slot))
819 if (!is_empty (x) && !is_deleted (x))
850 if (!is_empty (entries[i]) && !is_deleted (entries[i]))
894 || is_empty (*slo
[all...]
H A Dhash-map.h71 static bool is_empty (const hash_entry &e) { return Traits::is_empty (e); } function in struct:hash_entry
172 bool ins = hash_entry::is_empty (*e);
190 return Traits::is_empty (e) ? NULL : &e.m_value;
201 bool ins = Traits::is_empty (*e);
248 bool is_empty () const { return m_table.is_empty (); } function
/netbsd-current/external/gpl2/groff/dist/contrib/groffer/
H A Dgroffer2.sh1060 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"
1530 # is_empty (<string>)
1537 is_empty() function
1539 func_check is_empty '=' 1 "$@";
1661 if is_empty "
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/
H A Dcall-string.h80 bool empty_p () const { return m_elements.is_empty (); }
H A Dcall-string.cc207 if (m_elements.is_empty ())
268 if(m_elements.is_empty ())
278 if(m_elements.is_empty ())
H A Dsvalue.h219 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::region_svalue::key_t
389 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::poisoned_svalue::key_t
496 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::setjmp_svalue::key_t
618 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::unaryop_svalue::key_t
706 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::binop_svalue::key_t
797 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::sub_svalue::key_t
878 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::repeated_svalue::key_t
965 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::bits_within_svalue::key_t
1141 bool is_empty () const { return m_type == reinterpret_cast<tree> (2); } function in struct:ana::widening_svalue::key_t
1255 bool is_empty () cons function in struct:ana::compound_svalue::key_t
1383 bool is_empty () const { return m_stmt == NULL; } function in struct:ana::conjured_svalue::key_t
1493 bool is_empty () const { return m_asm_string == NULL; } function in struct:ana::asm_output_svalue::key_t
1626 bool is_empty () const { return m_fndecl == NULL; } function in struct:ana::const_fn_result_svalue::key_t
[all...]
/netbsd-current/external/mit/isl/dist/
H A Disl_pw_union_opt.c185 isl_bool is_subset, is_empty; local
200 is_empty = isl_set_is_empty(better);
201 if (is_empty >= 0 && is_empty)
207 if (is_empty < 0 || is_subset < 0)
313 if (FN(PW,is_empty)(pw1)) {
318 if (FN(PW,is_empty)(pw2)) {
H A Disl_test_python.py128 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 in function:test_every
255 return s.is_empty()
256 assert(not us.every_set(is_empty))
259 return not s.is_empty()
H A Disl_test_cpp.cc52 bool b_true = empty.is_empty();
53 bool b_false = univ.is_empty();
56 null.is_empty();
140 return !map.lex_ge_at(id).is_empty();
H A Disl_test_cpp-generic.cc33 assert(IS_TRUE(empty.is_empty()));
202 auto is_empty = [] (isl::set s) { local
203 return s.is_empty();
205 assert(!IS_TRUE(us.every_set(is_empty)));
208 return !s.is_empty();

Completed in 160 milliseconds

1234567891011>>