OLD | NEW |
---|---|
(Empty) | |
1 // Copyright 2015 the V8 project authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 | |
5 #include "src/v8.h" | |
6 | |
7 #include "test/cctest/expression-type-collector.h" | |
8 | |
9 #include "src/ast.h" | |
10 #include "src/codegen.h" | |
11 #include "src/scopes.h" | |
12 | |
13 namespace v8 { | |
14 namespace internal { | |
15 namespace { | |
16 | |
17 struct { | |
18 AstNode::NodeType type; | |
19 const char* name; | |
20 } NodeTypeNameList[] = { | |
21 #define DECLARE_VISIT(type) \ | |
22 { AstNode::k##type, #type } \ | |
23 , | |
24 AST_NODE_LIST(DECLARE_VISIT) | |
25 #undef DECLARE_VISIT | |
26 }; | |
27 } | |
28 | |
29 | |
30 void ExpressionTypeCollector::Run(CompilationInfo* info, | |
31 ZoneVector<ExpressionTypeEntry>* dst) { | |
32 ExpressionTypeCollector* visitor = | |
rossberg
2015/08/20 16:34:26
Same here, no reason for heap allocation.
bradn
2015/08/20 21:35:47
Done.
| |
33 new (info->zone()) ExpressionTypeCollector(info); | |
34 dst->clear(); | |
35 visitor->result_ = dst; | |
36 visitor->VisitAll(); | |
37 } | |
38 | |
39 | |
40 void ExpressionTypeCollector::VisitExpression(Expression* expression) { | |
41 ExpressionTypeEntry e; | |
42 e.depth = depth(); | |
43 VariableProxy* proxy = expression->AsVariableProxy(); | |
44 if (proxy) { | |
45 e.name = proxy->raw_name(); | |
46 } | |
47 e.bounds = expression->bounds(); | |
48 AstNode::NodeType type = expression->node_type(); | |
49 e.kind = "unknown"; | |
50 for (size_t i = 0; i < arraysize(NodeTypeNameList); ++i) { | |
51 if (NodeTypeNameList[i].type == type) { | |
52 e.kind = NodeTypeNameList[i].name; | |
53 break; | |
54 } | |
55 } | |
56 result_->push_back(e); | |
57 } | |
58 | |
59 | |
60 ExpressionTypeCollector::ExpressionTypeCollector(CompilationInfo* info) | |
61 : AstExpressionVisitor(info) {} | |
62 } | |
63 } | |
OLD | NEW |