Lines Matching refs:Data
184 node->Data()->last_used = now.ToInternalValue(); in UpdateTimes()
186 node->Data()->last_modified = now.ToInternalValue(); in UpdateTimes()
246 if (head.Data()->prev != my_head.value() && // Normal path. in Insert()
247 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert()
252 head.Data()->prev = node->address().value(); in Insert()
258 node->Data()->next = my_head.value(); in Insert()
259 node->Data()->prev = node->address().value(); in Insert()
264 node->Data()->next = my_tail.value(); in Insert()
307 node->Data()->next, node->Data()->prev, list); in Remove()
312 Addr next_addr(node->Data()->next); in Remove()
313 Addr prev_addr(node->Data()->prev); in Remove()
331 prev.Data()->next = next.address().value(); in Remove()
332 next.Data()->prev = prev.address().value(); in Remove()
349 next.Data()->prev = next.address().value(); in Remove()
355 prev.Data()->next = prev.address().value(); in Remove()
367 node->Data()->next = 0; in Remove()
368 node->Data()->prev = 0; in Remove()
415 Addr address(node->Data()->next); in GetNext()
448 Addr address(node->Data()->prev); in GetPrev()
495 const RankingsNode* data = node->Data(); in SanityCheck()
524 const RankingsNode* data = node->Data(); in DataSanityCheck()
536 node->Data()->contents = address; in SetContents()
574 if (!rankings->Data()->dirty && !rankings->Data()->dummy) in GetRanking()
583 rankings->Data()->dummy = 0; in GetRanking()
584 rankings->Data()->dirty = backend_->GetCurrentEntryId() - 1; in GetRanking()
585 if (!rankings->Data()->dirty) in GetRanking()
586 rankings->Data()->dirty--; in GetRanking()
591 rankings->SetData(entry->rankings()->Data()); in GetRanking()
605 *temp.Data() = *rankings->Data(); in ConvertToLongLived()
607 *rankings->Data() = *temp.Data(); in ConvertToLongLived()
624 node.Data()->dummy = 0; in CompleteTransaction()
653 node->Data()->next = my_tail.value(); in FinishInsert()
664 Addr next_addr(node->Data()->next); in RevertRemove()
665 Addr prev_addr(node->Data()->prev); in RevertRemove()
684 DCHECK(prev.Data()->next == node_value || in RevertRemove()
685 prev.Data()->next == prev_addr.value() || in RevertRemove()
686 prev.Data()->next == next.address().value()); in RevertRemove()
687 DCHECK(next.Data()->prev == node_value || in RevertRemove()
688 next.Data()->prev == next_addr.value() || in RevertRemove()
689 next.Data()->prev == prev.address().value()); in RevertRemove()
692 prev.Data()->next = node_value; in RevertRemove()
694 next.Data()->prev = node_value; in RevertRemove()
706 prev.Data()->next = next.address().value(); in RevertRemove()
710 next.Data()->prev = prev.address().value(); in RevertRemove()
721 if (!rankings->Data()->dummy) in CheckEntry()
725 return backend_->GetCurrentEntryId() != rankings->Data()->dirty; in CheckEntry()
731 if (prev->Data()->next == node_addr && in CheckLinks()
732 next->Data()->prev == node_addr) { in CheckLinks()
738 prev->Data()->next, next->Data()->prev); in CheckLinks()
742 prev->Data()->next == next->address().value() && in CheckLinks()
743 next->Data()->prev == prev->address().value()) { in CheckLinks()
746 node->Data()->next = 0; in CheckLinks()
747 node->Data()->prev = 0; in CheckLinks()
752 if (prev->Data()->next == node_addr || in CheckLinks()
753 next->Data()->prev == node_addr) { in CheckLinks()
755 if (prev->Data()->next != node_addr && IsHead(node_addr, list)) in CheckLinks()
758 if (next->Data()->prev != node_addr && IsTail(node_addr, list)) in CheckLinks()
769 if (prev->Data()->next != next->address().value() || in CheckSingleLink()
770 next->Data()->prev != prev->address().value()) { in CheckSingleLink()
806 if (node->Data()->prev != prev.value()) in CheckList()
812 address.set_value(node->Data()->next); in CheckList()
854 *other->Data() = *node->Data(); in UpdateIterators()