33 struct CacheNode {  struct
52 static_assert(sizeof(CacheNode) == 32, "");  argument
77   CacheNode* FindNode(uint32_t tid, uint64_t ip, uint64_t sp) {  in FindNode()
78     CacheNode key;  in FindNode()
87   static bool CacheNodeEqual(const CacheNode* n1, const CacheNode* n2);
88   static size_t CacheNodeHash(const CacheNode* n);
90   typedef std::unordered_set<CacheNode*, decltype(&CacheNodeHash), decltype(&CacheNodeEqual)>
93   CacheNode* GetParent(CacheNode* node) {  in GetParent()
97   int GetNodeIndex(CacheNode* node) { return node - nodes_; }  in GetNodeIndex()
99   void RemoveNodeFromLRUList(CacheNode* node) {  in RemoveNodeFromLRUList()
100     CacheNode* prev = &nodes_[node->leaf_link_prev];  in RemoveNodeFromLRUList()
101     CacheNode* next = &nodes_[node->leaf_link_next];  in RemoveNodeFromLRUList()
106   void AppendNodeToLRUList(CacheNode* node) {  in AppendNodeToLRUList()
107     CacheNode* next = &nodes_[0];  in AppendNodeToLRUList()
108     CacheNode* prev = &nodes_[next->leaf_link_prev];  in AppendNodeToLRUList()
114   void DecreaseChildCountOfNode(CacheNode* node) {  in DecreaseChildCountOfNode()
121   CacheNode* GetNode(uint32_t tid, uint64_t ip, uint64_t sp);
122   CacheNode* AllocNode();
123   void LinkParent(CacheNode* child, CacheNode* new_parent);
124   void UnlinkParent(CacheNode* child);
126   CacheNode* nodes_;