Lines Matching refs:node_
295 : entry_(NULL, Addr(0)), node_(NULL, Addr(0)), backend_(backend),
353 DCHECK(node_.Data()->dirty || read_only_);
367 DCHECK(node_.Data()->dirty || read_only_);
407 RankingsNode* node = node_.Data();
410 if (!node_.LazyInit(backend_->File(node_address), node_address))
461 DCHECK(node_.HasData());
462 if (!node_.Data()->dirty) {
463 node_.Data()->dirty = backend_->GetCurrentEntryId();
464 node_.Store();
499 // Note that at this point node_ and entry_ are just two blocks of data, and
509 backend_->DeleteBlock(node_.address(), true);
525 if (!node_.LazyInit(backend_->File(address), address))
527 return node_.Load();
531 DCHECK(node_.HasData());
536 RankingsNode* rankings = node_.Data();
539 if (!node_.Store())
546 DCHECK(node_.HasData());
549 if (node_.Data()->dummy)
552 if (node_.Data()->dirty && current_id != node_.Data()->dirty)
560 node_.Data()->dirty = new_id;
561 node_
562 node_.Store();
566 return !node_.Data()->contents;
682 node_.Data()->last_used = last_used.ToInternalValue();
683 node_.Data()->last_modified = last_modified.ToInternalValue();
684 node_.set_modified();
776 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
781 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
798 DCHECK(node_.Data()->dirty || read_only_);
819 DCHECK(node_.Data()->dirty || read_only_);
916 node_.Data()->dirty = current_id == 1 ? -1 : current_id - 1;
917 node_.Store();
918 } else if (node_.HasData() && !dirty_) {
919 node_.Data()->dirty = 0;
920 node_.Store();
933 DCHECK(node_.Data()->dirty || read_only_);
1004 DCHECK(node_.Data()->dirty || read_only_);
1160 node_.Data()->last_used = current.ToInternalValue();
1163 node_.Data()->last_modified = current.ToInternalValue();
1465 if (node_.HasData()) {
1466 dirty = node_.Data()->dirty;
1470 entry_.address().value(), node_.address().value());
