Lines Matching refs:address
232 Trace("Insert 0x%x l %d", node->address().value(), list);
236 Transaction lock(control_data_, node->address(), INSERT, list);
243 head.Data()->prev != node->address().value()) { // FinishInsert().
248 head.Data()->prev = node->address().value();
255 node->Data()->prev = node->address().value();
256 my_head.set_value(node->address().value());
258 if (!my_tail.is_initialized() || my_tail.value() == node->address().value()) {
259 my_tail.set_value(node->address().value());
302 Trace("Remove 0x%x (0x%x 0x%x) l %d", node->address().value(),
326 Transaction lock(control_data_, node->address(), REMOVE, list);
327 prev.Data()->next = next.address().value();
328 next.Data()->prev = prev.address().value();
331 CacheAddr node_value = node->address().value();
344 my_head.set_value(next.address().value());
345 next.Data()->prev = next.address().value();
350 my_tail.set_value(prev.address().value());
351 prev.Data()->next = prev.address().value();
384 if (my_head.value() == node->address().value()) {
409 if (my_tail.value() == node->address().value())
411 Addr address(node->Data()->next);
412 if (address.value() == node->address().value())
414 next.reset(new CacheRankingsBlock(backend_->File(address), address));
442 if (my_head.value() == node->address().value())
444 Addr address(node->Data()->prev);
445 if (address.value() == node->address().value())
447 prev.reset(new CacheRankingsBlock(backend_->File(address), address));
471 IteratorPair current(node->address().value(), node);
501 if ((node->address().value() == data->prev) && !IsHead(data->prev, &list))
504 if ((node->address().value() == data->next) && !IsTail(data->next, &list))
531 void Rankings::SetContents(CacheRankingsBlock* node, CacheAddr address) {
532 node->Data()->contents = address;
555 if (!rankings->address().is_initialized())
646 if (my_head.value() != node->address().value()) {
647 if (my_tail.value() == node->address().value()) {
679 CacheAddr node_value = node->address().value();
682 prev.Data()->next == next.address().value());
685 next.Data()->prev == prev.address().value());
700 } else if (my_head.value() == next.address().value()) {
702 prev.Data()->next = next.address().value();
704 } else if (my_tail.value() == prev.address().value()) {
706 next.Data()->prev = prev.address().value();
726 CacheAddr node_addr = node->address().value();
736 if (node_addr != prev->address().value() &&
737 node_addr != next->address().value() &&
738 prev->Data()->next == next->address().value() &&
739 next->Data()->prev == prev->address().value()) {
765 if (prev->Data()->next != next->address().value() ||
766 next->Data()->prev != prev->address().value()) {
796 Addr address(my_head.value());
800 node.reset(new CacheRankingsBlock(backend_->File(address), address));
807 prev.set_value(address.value());
808 address.set_value(node->Data()->next);
809 if (!address.is_initialized() || address.is_separate_file())
813 } while (node->address().value() != address.value());
845 CacheAddr address = node->address().value();
848 if (it->first == address && it->second->HasData()) {
856 CacheAddr address = node->address().value();
859 if (it->first == address) {
863 LOG(WARNING) << "Invalidating iterator at 0x" << std::hex << address;
