Lines Matching refs:node
44 JSTaggedValue node(array[index]);
45 if (node.IsHole()) {
48 if (node.IsLinkedNode()) {
49 if (HasValueLinkedNode(node, taggedValue)) {
53 if (HasValueRBTreeNode(node, taggedValue)) {
61 bool JSAPIHashMap::HasValueLinkedNode(JSTaggedValue node, JSTaggedValue value)
63 ASSERT(node.IsLinkedNode());
64 while (!node.IsHole()) {
65 LinkedNode *p = LinkedNode::Cast(node.GetTaggedObject());
69 node = p->GetNext();
74 bool JSAPIHashMap::HasValueRBTreeNode(JSTaggedValue node, JSTaggedValue value)
76 ASSERT(node.IsRBTreeNode());
77 RBTreeNode *p = RBTreeNode::Cast(node.GetTaggedObject());
136 JSTaggedValue node = hashArray->GetNode(thread, hash, key);
137 if (node.IsHole()) {
139 } else if (node.IsRBTreeNode()) {
140 return RBTreeNode::Cast(node.GetTaggedObject())->GetValue();
142 return LinkedNode::Cast(node.GetTaggedObject())->GetValue();
150 JSMutableHandle<JSTaggedValue> node(thread, JSTaggedValue::Hole());
152 node.Update(hashArray->Get(index));
153 if (node->IsHole()) {
156 if (node->IsLinkedNode()) {
157 SetAllLinkedNode(thread, dst, JSMutableHandle<LinkedNode>::Cast(node));
159 SetAllRBTreeNode(thread, dst, JSHandle<RBTreeNode>(node));
164 void JSAPIHashMap::SetAllLinkedNode(JSThread *thread, JSHandle<JSAPIHashMap> hashMap, JSMutableHandle<LinkedNode> node)
166 ASSERT(node.GetTaggedValue().IsLinkedNode());
167 while (!node.GetTaggedValue().IsHole()) {
168 if (!hashMap->Replace(thread, node->GetKey(), node->GetValue())) {
169 JSHandle<JSTaggedValue> key(thread, node->GetKey());
170 JSHandle<JSTaggedValue> value(thread, node->GetValue());
173 node.Update(node->GetNext());
177 void JSAPIHashMap::SetAllRBTreeNode(JSThread *thread, JSHandle<JSAPIHashMap> hashMap, JSHandle<RBTreeNode> node)
179 ASSERT(node.GetTaggedValue().IsRBTreeNode());
180 JSMutableHandle<JSTaggedValue> key(thread, node->GetKey());
181 JSMutableHandle<JSTaggedValue> value(thread, node->GetValue());
185 JSMutableHandle<RBTreeNode> left(thread, node->GetLeft());
189 JSMutableHandle<RBTreeNode> right(thread, node->GetRight());