93   CacheNode* GetParent(CacheNode* node) {  in GetParent()  argument
94     return node->parent_index == 0u ? nullptr : nodes_ + node->parent_index;  in GetParent()
97   int GetNodeIndex(CacheNode* node) { return node - nodes_; }  in GetNodeIndex()  argument
99   void RemoveNodeFromLRUList(CacheNode* node) {  in RemoveNodeFromLRUList()  argument
100     CacheNode* prev = &nodes_[node->leaf_link_prev];  in RemoveNodeFromLRUList()
101     CacheNode* next = &nodes_[node->leaf_link_next];  in RemoveNodeFromLRUList()
102     prev->leaf_link_next = node->leaf_link_next;  in RemoveNodeFromLRUList()
103     next->leaf_link_prev = node->leaf_link_prev;  in RemoveNodeFromLRUList()
106   void AppendNodeToLRUList(CacheNode* node) {  in AppendNodeToLRUList()  argument
109     node->leaf_link_next = 0;  in AppendNodeToLRUList()
110     node->leaf_link_prev = next->leaf_link_prev;  in AppendNodeToLRUList()
111     next->leaf_link_prev = prev->leaf_link_next = GetNodeIndex(node);  in AppendNodeToLRUList()
114   void DecreaseChildCountOfNode(CacheNode* node) {  in DecreaseChildCountOfNode()  argument
115     if (--node->children_count == 0u) {  in DecreaseChildCountOfNode()
116       node->is_leaf = true;  in DecreaseChildCountOfNode()
117       AppendNodeToLRUList(node);  in DecreaseChildCountOfNode()