Searched defs:empty (Results 1 - 25 of 610) sorted by last modified time

1234567891011>>

/external/yaffs2/yaffs2/direct/
H A Dyaffs_ramem2k.c57 int empty; // is this empty? member in struct:__anon34302
105 blk->page[i]->empty = 1;
214 ned.block[blk]->page[pg]->empty = 0;
/external/yaffs2/yaffs2/mtdemul/
H A Dnandemul2k.c69 int empty; // is this empty? member in struct:__anon34308
146 blk->page[i]->empty = 1;
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_config.c200 macaddr empty = { 0 }; local
201 return os_memcmp(a, empty, sizeof(macaddr));
/external/wpa_supplicant_8/src/ap/
H A Dap_config.c200 macaddr empty = { 0 }; local
201 return os_memcmp(a, empty, sizeof(macaddr));
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_config.c200 macaddr empty = { 0 }; local
201 return os_memcmp(a, empty, sizeof(macaddr));
/external/valgrind/main/none/tests/x86-linux/
H A Dseg_override.c82 unsigned int empty:25; member in struct:modify_ldt_ldt_s
/external/valgrind/main/helgrind/
H A Dhg_wordset.c159 WordSet empty; /* cached, for speed */ member in struct:_WordSetU
362 WordVec* empty; local
379 empty = new_WV_of_size( wsu, 0 );
380 wsu->empty = add_or_dealloc_WordVec( wsu, empty );
397 return wsu->empty;
405 tl_assert(ws == wsu->empty);
408 tl_assert(ws != wsu->empty);
468 return; // we never die the empty set.
655 /* special case empty se
[all...]
/external/valgrind/main/none/tests/
H A Dexec-sigmask.c51 do_exec(argv[0], "empty", &mask);
55 int empty; local
58 empty = 0;
59 else if (strcmp(argv[1], "empty") == 0)
60 empty = 1;
62 fprintf(stderr, "empty or full?\n");
72 if (empty) {
74 printf("empty: signal %d added to mask\n", i);
/external/tinyxml/
H A Dtinystr.h62 // TiXmlString empty constructor
138 // Checks if a TiXmlString is empty
139 bool empty () const { return rep_->size == 0; } function in class:TiXmlString
/external/stlport/src/
H A Dnum_get_float.cpp65 unsigned int empty:16; member in struct:ieee854_long_double::__anon31248
/external/stlport/stlport/stl/
H A D_bvector.h491 bool empty() const { return begin() == end(); } function in class:__BVECTOR_QUALIFIED
H A D_deque.h63 * that an empty deque must have one node, and that a deque
72 * [map, map + map_size) is a valid, non-empty range.
473 bool empty() const { return this->_M_finish == this->_M_start; } function in class:deque
H A D_hash_map.h168 bool empty() const { return _M_ht.empty(); } function in class:hash_map
359 bool empty() const { return _M_ht.empty(); } function in class:hash_multimap
H A D_hash_set.h169 bool empty() const { return _M_ht.empty(); } function in class:hash_set
351 bool empty() const { return _M_ht.empty(); } function in class:hash_multiset
H A D_hashtable.h365 bool empty() const { return size() == 0; } function in class:hashtable
H A D_list.h194 if (src.get().empty())
195 //We force this to empty.
208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; } function in class:_List_base
402 if (__x.empty()) {
403 if (this->empty()) {
407 } else if (this->empty()) {
600 if (!__x.empty()) {
H A D_map.h171 bool empty() const { return _M_t.empty(); } function in class:map
357 bool empty() const { return _M_t.empty(); } function in class:multimap
H A D_queue.h94 bool empty() const { return c.empty(); } function in class:queue
220 bool empty() const { return c.empty(); } function in class:priority_queue
H A D_rope.h1316 // Assumes the result is not empty.
1356 bool empty() const { return 0 == _M_tree_ptr._M_data; } function in class:rope
H A D_set.h159 bool empty() const { return _M_t.empty(); } function in class:set
330 bool empty() const { return _M_t.empty(); } function in class:multiset
H A D_slist.h408 // insert_after, erase_after, etc. Note that even for an empty
428 bool empty() const { return this->_M_head._M_data._M_next == 0; } function in class:slist
H A D_stack.h82 bool empty() const { return c.empty(); } function in class:stack
H A D_string.h292 /* We need an additionnal constructor to build an empty string without
422 if (!empty()) {
428 bool empty() const { return this->_M_Start() == this->_M_Finish(); } function in class:basic_string
H A D_string_sum.h114 bool empty() const { return size() == 0; } function in class:__bstr_sum
H A D_tree.h432 bool empty() const { return _M_node_count == 0; } function in class:_Rb_tree
437 if (__t.empty()) {
438 if (this->empty()) return;
443 else if (this->empty()) {

Completed in 7327 milliseconds

1234567891011>>