Lines Matching refs:node_
83 : entry_(NULL, Addr(0)), node_(NULL, Addr(0)) {
121 node_.Data()->dirty = current_id == 1 ? -1 : current_id - 1;
122 node_.Store();
123 } else if (node_.HasData() && node_.Data()->dirty) {
124 node_.Data()->dirty = 0;
125 node_.Store();
172 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
177 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
191 DCHECK(node_.Data()->dirty);
254 DCHECK(node_.Data()->dirty);
353 DCHECK(node_.Data()->dirty);
367 DCHECK(node_.Data()->dirty);
416 RankingsNode* node = node_.Data();
419 if (!node_.LazyInit(backend_->File(node_address), node_address))
467 DCHECK(node_.HasData());
468 if (!node_.Data()->dirty) {
469 node_.Data()->dirty = backend_->GetCurrentEntryId();
470 node_.Store();
510 memset(node_.buffer(), 0, node_.size());
512 node_.Store();
515 backend_->DeleteBlock(node_.address(), false);
531 if (!node_.LazyInit(backend_->File(address), address))
533 return node_.Load();
537 DCHECK(node_.HasData());
539 RankingsNode* rankings = node_.Data();
542 if (!node_.Store())
549 DCHECK(node_.HasData());
552 if (node_.Data()->dummy)
555 return node_.Data()->dirty && current_id != node_.Data()->dirty;
559 node_.Data()->dirty = 0;
563 node_.Data()->dirty = new_id;
564 node_.Data()->dummy = 0;
565 node_.Store();
594 node_.Data()->last_used = last_used.ToInternalValue();
595 node_.Data()->last_modified = last_modified.ToInternalValue();
596 node_.set_modified();
680 node_.Data()->last_used = current.ToInternalValue();
683 node_.Data()->last_modified = current.ToInternalValue();
919 if (node_.HasData()) {
920 dirty = node_.Data()->dirty;
924 entry_.address().value(), node_.address().value());
