forked from Samsung/escargot
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayPatternNode.h
More file actions
141 lines (120 loc) · 6.56 KB
/
ArrayPatternNode.h
File metadata and controls
141 lines (120 loc) · 6.56 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
/*
* Copyright (c) 2019-present Samsung Electronics Co., Ltd
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
* USA
*/
#ifndef ArrayPatternNode_h
#define ArrayPatternNode_h
#include "Node.h"
#include "LiteralNode.h"
#include "TryStatementNode.h"
#include "runtime/Context.h"
namespace Escargot {
class ArrayPatternNode : public Node {
public:
ArrayPatternNode(const NodeList& elements)
: m_elements(elements)
{
}
ArrayPatternNode(const NodeList& elements, NodeLOC& loc)
: m_elements(elements)
{
m_loc = loc;
}
virtual ASTNodeType type() override { return ASTNodeType::ArrayPattern; }
virtual void generateStoreByteCode(ByteCodeBlock* codeBlock, ByteCodeGenerateContext* context, ByteCodeRegisterIndex srcRegister, bool needToReferenceSelf) override
{
// store each element by iterator
bool isLexicallyDeclaredBindingInitialization = context->m_isLexicallyDeclaredBindingInitialization;
size_t baseCountBefore = context->m_registerStack->size();
// set m_isLexicallyDeclaredBindingInitialization to false for the case of empty array pattern
context->m_isLexicallyDeclaredBindingInitialization = false;
size_t iteratorRecordIndex = context->getRegister();
size_t iteratorValueIndex = context->getRegister();
IteratorOperation::GetIteratorData data;
data.m_isSyncIterator = true;
data.m_srcObjectRegisterIndex = srcRegister;
data.m_dstIteratorRecordIndex = iteratorRecordIndex;
data.m_dstIteratorObjectIndex = REGISTER_LIMIT;
codeBlock->pushCode(IteratorOperation(ByteCodeLOC(m_loc.index), data), context, this);
TryStatementNode::TryStatementByteCodeContext iteratorBindingContext;
TryStatementNode::generateTryStatementStartByteCode(codeBlock, context, this, iteratorBindingContext);
for (SentinelNode* element = m_elements.begin(); element != m_elements.end(); element = element->next()) {
if (element->astNode()) {
// enable lexical declaration only if each element exists
context->m_isLexicallyDeclaredBindingInitialization = isLexicallyDeclaredBindingInitialization;
if (LIKELY(element->astNode()->type() != RestElement)) {
element->astNode()->generateResolveAddressByteCode(codeBlock, context);
IteratorOperation::IteratorBindData iteratorBindData;
iteratorBindData.m_registerIndex = iteratorValueIndex;
iteratorBindData.m_iterRegisterIndex = iteratorRecordIndex;
codeBlock->pushCode(IteratorOperation(ByteCodeLOC(m_loc.index), iteratorBindData), context, this);
element->astNode()->generateStoreByteCode(codeBlock, context, iteratorValueIndex, false);
} else {
element->astNode()->generateStoreByteCode(codeBlock, context, iteratorRecordIndex, false);
}
} else {
IteratorOperation::IteratorBindData iteratorBindData;
iteratorBindData.m_registerIndex = iteratorValueIndex;
iteratorBindData.m_iterRegisterIndex = iteratorRecordIndex;
codeBlock->pushCode(IteratorOperation(ByteCodeLOC(m_loc.index), iteratorBindData), context, this);
}
}
context->giveUpRegister(); // for drop iteratorValueIndex
TryStatementNode::generateTryStatementBodyEndByteCode(codeBlock, context, this, iteratorBindingContext);
TryStatementNode::generateTryFinalizerStatementStartByteCode(codeBlock, context, this, iteratorBindingContext, true);
// If iteratorRecord.[[Done]] is false, return ? IteratorClose(iteratorRecord, result).
size_t doneIndex = context->getRegister();
IteratorOperation::IteratorTestDoneData iteratorTestDoneData;
iteratorTestDoneData.m_iteratorRecordOrObjectRegisterIndex = iteratorRecordIndex;
iteratorTestDoneData.m_dstRegisterIndex = doneIndex;
iteratorTestDoneData.m_isIteratorRecord = true;
codeBlock->pushCode(IteratorOperation(ByteCodeLOC(m_loc.index), iteratorTestDoneData), context, this);
codeBlock->pushCode(JumpIfTrue(ByteCodeLOC(m_loc.index), doneIndex), context, this);
size_t jumpPos = codeBlock->lastCodePosition<JumpIfTrue>();
IteratorOperation::IteratorCloseData iteratorCloseData;
iteratorCloseData.m_iterRegisterIndex = iteratorRecordIndex;
iteratorCloseData.m_execeptionRegisterIndexIfExists = REGISTER_LIMIT;
codeBlock->pushCode(IteratorOperation(ByteCodeLOC(m_loc.index), iteratorCloseData), context, this);
codeBlock->peekCode<JumpIfTrue>(jumpPos)->m_jumpPosition = codeBlock->currentCodeSize();
TryStatementNode::generateTryFinalizerStatementEndByteCode(codeBlock, context, this, iteratorBindingContext, true);
ASSERT(!context->m_isLexicallyDeclaredBindingInitialization);
context->giveUpRegister(); // for drop doneIndex
context->giveUpRegister(); // for drop iteratorRecordIndex
codeBlock->m_shouldClearStack = true;
ASSERT(context->m_registerStack->size() == baseCountBefore);
}
virtual void iterateChildrenIdentifier(const std::function<void(AtomicString name, bool isAssignment)>& fn) override
{
for (SentinelNode* element = m_elements.begin(); element != m_elements.end(); element = element->next()) {
if (element->astNode()) {
element->astNode()->iterateChildrenIdentifier(fn);
}
}
}
virtual void iterateChildren(const std::function<void(Node* node)>& fn) override
{
fn(this);
for (SentinelNode* element = m_elements.begin(); element != m_elements.end(); element = element->next()) {
if (element->astNode())
element->astNode()->iterateChildren(fn);
}
}
private:
NodeList m_elements;
};
} // namespace Escargot
#endif