Home
last modified time | relevance | path

Searched refs:nodeVa (Results 1 – 5 of 5) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/
Dtagged_hash_array.cpp97 JSTaggedValue nodeVa = tab->Get(index); in TreeingBin() local
98 if (!nodeVa.IsHole()) { in TreeingBin()
99 JSHandle<LinkedNode> node(thread, nodeVa); in TreeingBin()
136 JSTaggedValue nodeVa, int index, int oldCapacity) in NodeDisperse() argument
144 next = LinkedNode::Cast(nodeVa.GetTaggedObject())->GetNext(); in NodeDisperse()
145 if (((LinkedNode::Cast(nodeVa.GetTaggedObject())->GetHash().GetInt()) & oldCapacity) == 0) { in NodeDisperse()
147 loHead = nodeVa; in NodeDisperse()
149 LinkedNode::Cast(loTail.GetTaggedObject())->SetNext(thread, nodeVa); in NodeDisperse()
151 loTail = nodeVa; in NodeDisperse()
154 hiHead = nodeVa; in NodeDisperse()
[all …]
Dtagged_hash_array.h64 JSTaggedValue nodeVa, int index, int oldCapacity);
Dtagged_node.h139 JSHandle<JSTaggedValue> nodeVa, int index, int bit);
Dtagged_node.cpp117 JSHandle<JSTaggedValue> nodeVa, int index, int bit) in Divide() argument
119 JSHandle<RBTreeNode> self = JSHandle<RBTreeNode>::Cast(nodeVa); in Divide()
/arkcompiler/ets_runtime/ecmascript/js_api/
Djs_api_hashmap.cpp100 JSTaggedValue nodeVa = hashArray->GetNode(thread, hash, key); in Replace() local
101 if (nodeVa.IsHole()) { in Replace()
104 if (nodeVa.IsLinkedNode()) { in Replace()
105 LinkedNode::Cast(nodeVa.GetTaggedObject())->SetValue(thread, newValue); in Replace()
107 RBTreeNode::Cast(nodeVa.GetTaggedObject())->SetValue(thread, newValue); in Replace()