Lines Matching refs:node_

299     : entry_(NULL, Addr(0)), node_(NULL, Addr(0)),
356 DCHECK(node_.Data()->dirty || read_only_);
370 DCHECK(node_.Data()->dirty || read_only_);
410 RankingsNode* node = node_.Data();
413 if (!node_.LazyInit(backend_->File(node_address), node_address))
463 DCHECK(node_.HasData());
464 if (!node_.Data()->dirty) {
465 node_.Data()->dirty = backend_->GetCurrentEntryId();
466 node_.Store();
501 // Note that at this point node_ and entry_ are just two blocks of data, and
512 backend_->DeleteBlock(node_.address(), true);
513 node_.Discard();
530 if (!node_.LazyInit(backend_->File(address), address))
532 return node_.Load();
536 DCHECK(node_.HasData());
541 RankingsNode* rankings = node_.Data();
544 if (!node_.Store())
551 DCHECK(node_.HasData());
552 if (node_.Data()->dirty && current_id != node_.Data()->dirty)
560 node_.Data()->dirty = new_id;
561 node_.Store();
565 return !node_.Data()->contents;
689 node_.Data()->last_used = last_used.ToInternalValue();
690 node_.Data()->last_modified = last_modified.ToInternalValue();
691 node_.set_modified();
795 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
800 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_);
817 DCHECK(node_.Data()->dirty || read_only_);
840 DCHECK(node_.Data()->dirty || read_only_);
922 node_.clear_modified();
959 node_.Data()->dirty = current_id == 1 ? -1 : current_id - 1;
960 node_.Store();
961 } else if (node_.HasData() && !dirty_ && node_.Data()->dirty) {
962 node_.Data()->dirty = 0;
963 node_.Store();
977 DCHECK(node_.Data()->dirty || read_only_);
1063 DCHECK(node_.Data()->dirty || read_only_);
1232 node_.Data()->last_used = current.ToInternalValue();
1235 node_.Data()->last_modified = current.ToInternalValue();
1541 if (node_.HasData()) {
1542 dirty = node_.Data()->dirty;
1546 entry_.address().value(), node_.address().value());