Searched refs:nodeIndex (Results 1 – 4 of 4) sorted by relevance
314 TraceNode(TraceTree* tree, uint32_t nodeIndex);319 TraceNode* FindChild(uint32_t nodeIndex);320 TraceNode* FindOrAddChild(uint32_t nodeIndex);
759 TraceNode::TraceNode(TraceTree* tree, uint32_t nodeIndex) in TraceNode() argument761 nodeIndex_(nodeIndex), in TraceNode()790 TraceNode* TraceNode::FindOrAddChild(uint32_t nodeIndex) in FindOrAddChild() argument792 TraceNode* child = FindChild(nodeIndex); in FindOrAddChild()794 child = new TraceNode(tree_, nodeIndex); in FindOrAddChild()800 TraceNode* TraceNode::FindChild(uint32_t nodeIndex) in FindChild() argument803 if (node->GetNodeIndex() == nodeIndex) { in FindChild()
379 uint32_t nodeIndex = static_cast<uint32_t>(numOfElement - 1) & keyHash; in HWTEST_F_L0() local381 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()