Searched refs:free_nodes_pool_ (Results 1 – 6 of 6) sorted by relevance
54 std::set<int>::iterator it = free_nodes_pool_.find(tab_node_id); in AssociateTabNode()55 DCHECK(it != free_nodes_pool_.end()); in AssociateTabNode()56 free_nodes_pool_.erase(it); in AssociateTabNode()65 if (free_nodes_pool_.empty()) { in GetFreeTabNode()86 free_nodes_pool_.insert(tab_node_id); in GetFreeTabNode()90 return *free_nodes_pool_.begin(); in GetFreeTabNode()106 DCHECK(free_nodes_pool_.find(tab_node_id) == free_nodes_pool_.end()); in FreeTabNodeInternal()108 free_nodes_pool_.insert(tab_node_id); in FreeTabNodeInternal()114 if (free_nodes_pool_.size() > kFreeNodesHighWatermark) { in FreeTabNodeInternal()115 for (std::set<int>::iterator free_it = free_nodes_pool_.begin(); in FreeTabNodeInternal()[all …]
145 std::set<int> free_nodes_pool_; variable
29 pool_.free_nodes_pool_.insert(node_ids[i]); in AddFreeTabNodes()
60 std::set<int>::iterator it = free_nodes_pool_.find(tab_node_id); in AssociateTabNode()61 DCHECK(it != free_nodes_pool_.end()); in AssociateTabNode()62 free_nodes_pool_.erase(it); in AssociateTabNode()70 if (free_nodes_pool_.empty()) { in GetFreeTabNode()100 free_nodes_pool_.insert(tab_node_id); in GetFreeTabNode()104 return *free_nodes_pool_.begin(); in GetFreeTabNode()116 DCHECK(free_nodes_pool_.find(tab_node_id) == free_nodes_pool_.end()); in FreeTabNodeInternal()117 free_nodes_pool_.insert(tab_node_id); in FreeTabNodeInternal()123 if (free_nodes_pool_.size() > kFreeNodesHighWatermark) { in FreeTabNodeInternal()125 for (std::set<int>::iterator free_it = free_nodes_pool_.begin(); in FreeTabNodeInternal()[all …]
125 std::set<int> free_nodes_pool_; variable
25 pool_.free_nodes_pool_.insert(node_ids[i]); in AddFreeTabNodes()