Searched refs:nodeIndex (Results 1 – 4 of 4) sorted by relevance
291 TraceNode(TraceTree* tree, uint32_t nodeIndex);296 TraceNode* FindChild(uint32_t nodeIndex);297 TraceNode* FindOrAddChild(uint32_t nodeIndex);
691 TraceNode::TraceNode(TraceTree* tree, uint32_t nodeIndex) in TraceNode() argument693 nodeIndex_(nodeIndex), in TraceNode()722 TraceNode* TraceNode::FindOrAddChild(uint32_t nodeIndex) in FindOrAddChild() argument724 TraceNode* child = FindChild(nodeIndex); in FindOrAddChild()726 child = new TraceNode(tree_, nodeIndex); in FindOrAddChild()732 TraceNode* TraceNode::FindChild(uint32_t nodeIndex) in FindChild() argument735 if (node->GetNodeIndex() == nodeIndex) { in FindChild()
395 uint32_t nodeIndex = static_cast<uint32_t>(numOfElement - 1) & keyHash; in HWTEST_F_L0() local397 TaggedHashArray::GetCurrentNode(thread, taggedQueue, taggedHashArray, nodeIndex); in HWTEST_F_L0()
134 bool IsVaildRBTree(JSThread *thread, JSHandle<T> &tree, int nodeIndex) in IsVaildRBTree() argument137 nodes.emplace(nodeIndex); in IsVaildRBTree()