/external/chromium/net/disk_cache/ |
H A D | mem_entry_impl.cc | 94 DCHECK(children_->empty()); 473 // Find the first child and record the number of empty bytes. 474 int empty = FindNextChild(offset, len, ¤t_child); local 476 *start = offset + empty; 477 len -= empty;
|
/external/chromium/third_party/libevent/test/ |
H A D | regress_http.c | 217 int empty = evhttp_find_header(req->input_headers, "Empty") != NULL; local 238 /* allow sending of an empty reply */ 240 !empty ? evb : NULL); 473 /* make another request: request empty reply */
|
/external/clang/include/clang/AST/ |
H A D | ASTVector.h | 61 // Default ctor - Initialize to empty. 100 bool empty() const { return Begin == End; } function in class:clang::ASTVector 144 /// data - Return a pointer to the vector's buffer, even if empty(). 149 /// data - Return a pointer to the vector's buffer, even if empty(). 214 if (I == this->end()) { // Important special case for empty vector. 236 if (I == this->end()) { // Important special case for empty vector. 284 if (I == this->end()) { // Important special case for empty vector.
|
/external/clang/include/clang/Sema/ |
H A D | DelayedDiagnostic.h | 237 bool empty() const { function in class:clang::sema::DelayedDiagnosticPool 238 return (Diagnostics.empty() && (Parent == NULL || Parent->empty())); 248 if (pool.Diagnostics.empty()) return; 250 if (Diagnostics.empty()) { 262 bool pool_empty() const { return Diagnostics.empty(); }
|
/external/clang/test/CodeGenCXX/ |
H A D | x86_64-arguments.cpp | 86 Empty empty; member in struct:test5::X 90 Empty empty; member in struct:test5::Y
|
/external/icu4c/common/ |
H A D | uvector.cpp | 374 UHashTok empty; local 375 empty.pointer = NULL; 376 empty.integer = 0; 378 elements[i] = empty;
|
/external/icu4c/i18n/ |
H A D | ucoleitr.cpp | 65 UBool empty() const; 84 UBool RCEBuffer::empty() const function in class:RCEBuffer 138 UBool empty() const; 162 UBool PCEBuffer::empty() const function in class:PCEBuffer 543 while (elems->pce->pceBuffer.empty()) { 548 // **** do we need to reset rceb, or will it always be empty at this point **** 555 if (! rceb.empty()) { 566 while (! rceb.empty()) { 578 if (elems->pce->pceBuffer.empty()) {
|
/external/ipsec-tools/src/racoon/ |
H A D | gssapi.c | 278 gss_buffer_desc empty, name_token; local 288 empty.length = 0; 289 empty.value = NULL; 290 dummy = ∅
|
/external/llvm/include/llvm/ADT/ |
H A D | SmallBitVector.h | 136 /// SmallBitVector default ctor - Creates an empty bitvector. 167 /// empty - Tests whether there are no bits in this bitvector. 168 bool empty() const { function in class:llvm::SmallBitVector 169 return isSmall() ? getSmallSize() == 0 : getPointer()->empty();
|
/external/llvm/include/llvm/Bitcode/ |
H A D | Archive.h | 239 inline bool empty() const { return members.empty(); } function in class:llvm::Archive 266 /// Create an empty archive file and associate it with the \p Filename. This 268 /// empty Archive object. If the writeToDisk method is called, the archive 272 /// @brief Create an empty Archive. 297 /// members are not read by this method, the archive will appear empty upon
|
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAGInstrs.h | 51 assert(Deps.empty() && "stale loop dependencies"); 139 /// For simplicity we expect the map to be empty(). 142 /// Returns true if the map is empty. 143 bool empty() const { return PhysRegSet.empty(); } function in class:llvm::Reg2SUnitsMap 151 /// Otherwise map the register and return an empty SUnits vector. 154 assert((!New || SUnits[Reg].empty()) && "stale SUnits vector"); 330 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
|
/external/llvm/include/llvm/ |
H A D | Function.h | 317 /// empty for external functions. 358 bool empty() const { return BasicBlocks.empty(); } function in class:llvm::Function
|
H A D | PassManagers.h | 153 bool empty() const { return S.empty(); } function in class:llvm::PMStack
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 45 bool empty() const { return Queue.empty(); } function in struct:__anon9312::FastPriorityQueue 52 if (empty()) return NULL; 510 return !LRegs.empty(); 523 if (!SUnits.empty()) { 525 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); 530 // While Available queue is not empty, grab the node with the highest 535 while (!AvailableQueue.empty()) {
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 47 /// Checks whether the heap is empty. 48 bool empty() const { return Storage.empty(); } function in class:__anon9802::PriorityQueue 66 /// Remove the minimum value in the heap. Only valid on a non-empty heap. 68 assert(!empty()); 188 while (!Queue.empty()) { 508 assert(TentativeValues.empty()); 645 if (L->empty() && R->empty()) 647 else if (L->empty()) [all...] |
/external/openfst/src/include/fst/ |
H A D | synchronize.h | 121 const String *empty = FindString(new String()); local 122 StateId start = FindState(Element(fst_->Start(), empty, empty)); 132 if ((w != Weight::Zero()) && (e.istring)->empty() && (e.ostring)->empty()) 176 if (!s->empty()) 188 if (l && !(s->empty())) r->push_back(l); 201 // Tests if the concatenation of s and l is empty 203 if (s->empty())
|
/external/oprofile/libpp/ |
H A D | profile_spec.cpp | 237 if (!image_or_lib_image.empty()) { 245 if (!image.empty()) { 249 } else if (!image_or_lib_image.empty()) { 250 // image.empty() means match all except if user 256 if (!lib_image.empty()) { 260 } else if (image.empty() && !image_or_lib_image.empty()) { 261 // lib_image empty means match all except if user 272 vector<string> empty; local 273 glob_filter filter(empty, image_exclud [all...] |
/external/qemu/distrib/sdl-1.2.15/src/main/macos/ |
H A D | SDL_main.c | 133 int empty; local 142 empty = (fgetc(file) == EOF) ? 1 : 0; 144 if ( empty ) { 150 empty = (fgetc(file) == EOF) ? 1 : 0; 152 if ( empty ) {
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | synchronize.h | 99 const String *empty = FindString(new String()); local 100 StateId start = FindState(Element(fst_->Start(), empty, empty)); 110 if ((w != Weight::Zero()) && (e.istring)->empty() && (e.ostring)->empty()) 145 if (!s->empty()) 157 if (l && !(s->empty())) r->push_back(l); 170 // Tests if the concatenation of s and l is empty 172 if (s->empty())
|
/external/stlport/stlport/stl/ |
H A D | _hash_map.h | 168 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.h | 169 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 | _unordered_map.h | 122 bool empty() const { return _M_ht.empty(); } function in class:unordered_map 290 bool empty() const { return _M_ht.empty(); } function in class:unordered_multimap
|
H A D | _unordered_set.h | 116 bool empty() const { return _M_ht.empty(); } function in class:unordered_set 266 bool empty() const { return _M_ht.empty(); } function in class:unordered_multiset
|
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 167 bool empty() const { return _M_non_dbg_impl.empty(); } function in class:hashtable
|
H A D | _slist.h | 199 bool empty() const { return _M_non_dbg_impl.empty(); } function in class:slist 212 _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER) 216 _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER) 221 _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
|