Searched refs:linkedNode (Results 1 – 4 of 4) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/ |
| D | tagged_node.cpp | 63 JSHandle<LinkedNode> linkedNode = TaggedHashArray::CreateLinkedNodeFrom(thread, treeNode); in InOrderTraverse() local
65 head = linkedNode; in InOrderTraverse()
67 tail->SetNext(thread, linkedNode.GetTaggedValue()); in InOrderTraverse()
69 tail = linkedNode; in InOrderTraverse()
92 JSHandle<LinkedNode> linkedNode = TaggedHashArray::CreateLinkedNodeFrom(thread, treeNode); in InOrderTraverse() local
95 if ((linkedNode->GetHash().GetInt() & bit) == 0) { in InOrderTraverse()
97 nodeStruct.lowerHead = linkedNode; in InOrderTraverse()
99 nodeStruct.lowerTail->SetNext(thread, linkedNode.GetTaggedValue()); in InOrderTraverse()
101 nodeStruct.lowerTail = linkedNode; in InOrderTraverse()
104 nodeStruct.higherHead = linkedNode; in InOrderTraverse()
[all …]
|
| D | tagged_hash_array.cpp | 87 …<RBTreeNode> TaggedHashArray::CreateTreeNodeFrom(JSThread *thread, JSHandle<LinkedNode> linkedNode) in CreateTreeNodeFrom() argument
89 JSHandle<JSTaggedValue> key(thread, linkedNode->GetKey()); in CreateTreeNodeFrom()
90 JSHandle<JSTaggedValue> value(thread, linkedNode->GetValue()); in CreateTreeNodeFrom()
91 return NewTreeNode(thread, linkedNode->GetHash().GetInt(), key, value); in CreateTreeNodeFrom()
|
| D | tagged_hash_array.h | 49 … static JSHandle<RBTreeNode> CreateTreeNodeFrom(JSThread *thread, JSHandle<LinkedNode> linkedNode);
|
| /arkcompiler/ets_runtime/ecmascript/tests/ |
| D | tagged_hash_array_test.cpp | 94 JSHandle<LinkedNode> linkedNode = in HWTEST_F_L0() local
96 EXPECT_TRUE(*linkedNode != nullptr); in HWTEST_F_L0()
97 EXPECT_TRUE(linkedNode->GetNext().IsHole()); in HWTEST_F_L0()
98 EXPECT_EQ(linkedNode->GetKey(), hashKey.GetTaggedValue()); in HWTEST_F_L0()
99 EXPECT_EQ(linkedNode->GetValue(), hashKeyValue.GetTaggedValue()); in HWTEST_F_L0()
100 EXPECT_EQ(linkedNode->GetHash().GetInt(), keyHash); in HWTEST_F_L0()
|