Lines Matching defs:node
194 MemEntryImpl* node = next;
197 if (node->GetLastUsed() < initial_time)
200 if (node->GetLastUsed() < end_time)
201 node->Doom();
238 MemEntryImpl* node = rankings_.GetNext(current);
241 while (node && node->type() != MemEntryImpl::kParentEntry) {
242 node = rankings_.GetNext(node);
244 *next_entry = node;
245 *iter = node;
247 if (node)
248 node->Open();
250 return NULL != node;
272 MemEntryImpl* node = next;
274 if (!node->InUse() || empty) {
275 node->Doom();
302 void MemBackendImpl::UpdateRank(MemEntryImpl* node) {
303 rankings_.UpdateRank(node);
