Home
last modified time | relevance | path

Searched refs:LinkedNode (Results 1 – 21 of 21) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/
Dtagged_hash_array.cpp54 LinkedNode *nextNode = LinkedNode::Cast(nextNodeVa.GetTaggedObject()); in GetNode()
64 JSHandle<LinkedNode> TaggedHashArray::NewLinkedNode(JSThread *thread, int hash, JSHandle<JSTaggedVa… in NewLinkedNode()
68 JSHandle<LinkedNode> hole(thread, JSTaggedValue::Hole()); in NewLinkedNode()
72 JSHandle<LinkedNode> TaggedHashArray::CreateLinkedNodeFrom(JSThread *thread, JSHandle<RBTreeNode> t… in CreateLinkedNodeFrom()
86 JSHandle<RBTreeNode> TaggedHashArray::CreateTreeNodeFrom(JSThread *thread, JSHandle<LinkedNode> lin… in CreateTreeNodeFrom()
99 JSHandle<LinkedNode> node(thread, nodeVa); in TreeingBin()
100 JSHandle<RBTreeNode> root = LinkedNode::Treeing(thread, node); in TreeingBin()
123 LinkedNode *node = LinkedNode::Cast(oldValue.GetTaggedValue().GetTaggedObject()); in Resize()
144 next = LinkedNode::Cast(nodeVa.GetTaggedObject())->GetNext(); in NodeDisperse()
145 if (((LinkedNode::Cast(nodeVa.GetTaggedObject())->GetHash().GetInt()) & oldCapacity) == 0) { in NodeDisperse()
[all …]
Dtagged_node.h87 class LinkedNode : public TaggedNode {
90 JSHandle<JSTaggedValue> value, JSHandle<LinkedNode> next) in InitLinkedNode()
96 static LinkedNode *Cast(TaggedObject *object) in Cast()
99 return static_cast<LinkedNode *>(object); in Cast()
110 static JSHandle<RBTreeNode> Treeing(JSThread *thread, const JSHandle<LinkedNode> &head);
116 JSHandle<LinkedNode> lowerHead;
117 JSHandle<LinkedNode> lowerTail;
118 JSHandle<LinkedNode> higherHead;
119 JSHandle<LinkedNode> higherTail;
147 JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail);
[all …]
Dtagged_node.cpp22 JSHandle<RBTreeNode> LinkedNode::Treeing(JSThread *thread, const JSHandle<LinkedNode> &head) in Treeing()
25 JSMutableHandle<LinkedNode> next(thread, head); in Treeing()
58 JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail) in InOrderTraverse()
63 JSHandle<LinkedNode> linkedNode = TaggedHashArray::CreateLinkedNodeFrom(thread, treeNode); in InOrderTraverse()
75 JSHandle<LinkedNode> RBTreeNode::Detreeing(JSThread *thread, const JSHandle<RBTreeNode> &root) in Detreeing()
77 JSHandle<LinkedNode> head(thread, JSTaggedValue::Hole()); in Detreeing()
78 JSHandle<LinkedNode> tail(thread, JSTaggedValue::Hole()); in Detreeing()
92 JSHandle<LinkedNode> linkedNode = TaggedHashArray::CreateLinkedNodeFrom(thread, treeNode); in InOrderTraverse()
120 LinkedNodeStruct nodeStruct {JSHandle<LinkedNode>(thread, JSTaggedValue::Hole()), in Divide()
121 JSHandle<LinkedNode>(thread, JSTaggedValue::Hole()), in Divide()
[all …]
Dtagged_hash_array.h44 … static JSHandle<LinkedNode> NewLinkedNode(JSThread *thread, int hash, JSHandle<JSTaggedValue> key,
46 … static JSHandle<LinkedNode> CreateLinkedNodeFrom(JSThread *thread, JSHandle<RBTreeNode> treeNode);
49 … static JSHandle<RBTreeNode> CreateTreeNodeFrom(JSThread *thread, JSHandle<LinkedNode> linkedNode);
Dobject_factory.h119 class LinkedNode; variable
628 JSHandle<LinkedNode> NewLinkedNode(int hash, const JSHandle<JSTaggedValue> &key,
630 const JSHandle<LinkedNode> &next);
Dglobal_env_constants.cpp291 factory->NewEcmaHClass(hClass, LinkedNode::SIZE, JSType::LINKED_NODE)); in InitRootsClass()
Ddump.cpp1112 LinkedNode::Cast(obj)->Dump(os); in DumpObject()
1605 void LinkedNode::Dump(std::ostream &os) const in Dump()
4227 LinkedNode::Cast(obj)->DumpForSnapshot(vec); in DumpObject()
4573 LinkedNode *node = LinkedNode::Cast(value.GetTaggedObject()); in DumpForSnapshot()
4760 void LinkedNode::DumpForSnapshot(std::vector<Reference> &vec) const in DumpForSnapshot()
4764 LinkedNode *nextNode = LinkedNode::Cast(next.GetTaggedObject()); in DumpForSnapshot()
Dglobal_env_constants.h119 …V(JSTaggedValue, LinkedNode, LINKED_NODE_CLASS_INDEX, ecma_roots_class) …
Dobject_factory.cpp2681 JSHandle<LinkedNode> ObjectFactory::NewLinkedNode(int hash, const JSHandle<JSTaggedValue> &key, in NewLinkedNode()
2683 const JSHandle<LinkedNode> &next) in NewLinkedNode()
2688 JSHClass::Cast(globalConst->GetLinkedNode().GetTaggedObject()), LinkedNode::SIZE); in NewLinkedNode()
2689 JSHandle<LinkedNode> node(thread_, header); in NewLinkedNode()
/arkcompiler/ets_runtime/ecmascript/tests/
Dlinked_node_test.cpp62 JSHandle<LinkedNode> CreateLinkedList() in CreateLinkedList()
69 JSHandle<LinkedNode> head(thread, JSTaggedValue::Hole()); in CreateLinkedList()
90 JSHandle<LinkedNode> hole(thread, JSTaggedValue::Hole()); in HWTEST_F_L0()
91 JSHandle<LinkedNode> newNode = factory->NewLinkedNode(hash, key, value, hole); in HWTEST_F_L0()
98 JSHandle<LinkedNode> head = CreateLinkedList(); in HWTEST_F_L0()
99 JSHandle<RBTreeNode> root = LinkedNode::Treeing(thread, head); in HWTEST_F_L0()
Drb_tree_node_test.cpp188 for (JSHandle<LinkedNode> node = JSHandle<LinkedNode>(thread, loNode); in HWTEST_F_L0()
190 node = JSHandle<LinkedNode>(thread, node->GetNext())) { in HWTEST_F_L0()
199 for (JSHandle<LinkedNode> node = JSHandle<LinkedNode>(thread, hiNode); in HWTEST_F_L0()
201 node = JSHandle<LinkedNode>(thread, node->GetNext())) { in HWTEST_F_L0()
229 JSHandle<LinkedNode> head = RBTreeNode::Detreeing(thread, rootNode); in HWTEST_F_L0()
232 for (; !head.GetTaggedValue().IsHole(); head = JSHandle<LinkedNode>(thread, head->GetNext())) { in HWTEST_F_L0()
Dtagged_hash_array_test.cpp82 JSHandle<LinkedNode> linkedNode = in HWTEST_F_L0()
149 JSHandle<LinkedNode> hashNode(thread, hashNodeVal); in HWTEST_F_L0()
338 JSHandle<LinkedNode> hashNode(thread, taggedHashArray->Get(hashArrayIndex)); in HWTEST_F_L0()
Ddump_test.cpp1120 CHECK_DUMP_FIELDS(TaggedObject::TaggedObjectSize(), LinkedNode::SIZE, 4U); in HWTEST_F_L0()
/arkcompiler/ets_runtime/ecmascript/js_api/
Djs_api_hashmap.cpp69 LinkedNode *p = LinkedNode::Cast(node.GetTaggedObject()); in HasValueLinkedNode()
105 LinkedNode::Cast(nodeVa.GetTaggedObject())->SetValue(thread, newValue); in Replace()
146 return LinkedNode::Cast(node.GetTaggedObject())->GetValue(); in Get()
161 SetAllLinkedNode(thread, dst, JSMutableHandle<LinkedNode>::Cast(node)); in SetAll()
168 …etAllLinkedNode(JSThread *thread, JSHandle<JSAPIHashMap> hashMap, JSMutableHandle<LinkedNode> node) in SetAllLinkedNode()
236 JSHandle<LinkedNode> head = RBTreeNode::Detreeing(thread, root); in Remove()
Djs_api_hashmap_iterator.cpp104 JSHandle<LinkedNode> prevNode = JSHandle<LinkedNode>::Cast(prevNodeValue); in FastGetCurrentNode()
Djs_api_hashset_iterator.cpp99 JSHandle<LinkedNode> prevNode = JSHandle<LinkedNode>::Cast(prevNodeValue); in FastGetCurrentNode()
Djs_api_hashmap.h58 …tAllLinkedNode(JSThread *thread, JSHandle<JSAPIHashMap> hashMap, JSMutableHandle<LinkedNode> node);
Djs_api_hashset.cpp109 JSHandle<LinkedNode> head = RBTreeNode::Detreeing(thread, root); in Remove()
/arkcompiler/ets_runtime/ecmascript/compiler/builtins/
Dcontainers_stub_builder.cpp554 … type == ContainersType::HASHSET_FOREACH ? LinkedNode::KEY_OFFSET : LinkedNode::VALUE_OFFSET)); in ContainersHashCall()
555 key = Load(VariableType::JS_POINTER(), *node, IntPtr(LinkedNode::KEY_OFFSET)); in ContainersHashCall()
566 node = Load(VariableType::JS_POINTER(), *node, IntPtr(LinkedNode::NEXT_OFFSET)); in ContainersHashCall()
/arkcompiler/ets_runtime/ecmascript/mem/
Dobject_xray.h585 LinkedNode::Cast(object)->VisitRangeSlot<visitType>(visitor); in VisitObjectBody()
/arkcompiler/ets_runtime/ecmascript/debugger/
Ddebugger_api.cpp65 using ecmascript::LinkedNode;