From 5f54b6c091ddfd69f02c4365820ac27432e87e9f Mon Sep 17 00:00:00 2001 From: Roberto Raggi Date: Tue, 19 Jul 2011 11:16:33 +0200 Subject: [PATCH] Removed QDeclarativeJS::NodePool Change-Id: I69d39ef005900803f6c620ea8f1ca00d054dc8d2 Reviewed-on: http://codereview.qt.nokia.com/3757 Reviewed-by: Roberto Raggi Reviewed-by: Qt Sanity Bot --- src/declarative/qml/parser/parser.pri | 1 - src/declarative/qml/parser/qdeclarativejs.g | 375 ++++++++++---------- src/declarative/qml/parser/qdeclarativejsast_p.h | 11 +- .../qml/parser/qdeclarativejsengine_p.cpp | 27 +-- .../qml/parser/qdeclarativejsengine_p.h | 8 +- src/declarative/qml/parser/qdeclarativejslexer.cpp | 3 +- .../qml/parser/qdeclarativejsmemorypool_p.h | 15 +- .../qml/parser/qdeclarativejsnodepool_p.h | 139 -------- .../qml/parser/qdeclarativejsparser.cpp | 372 ++++++++++---------- .../qml/parser/qdeclarativejsparser_p.h | 1 + src/declarative/qml/qdeclarativerewrite.cpp | 2 - src/declarative/qml/qdeclarativerewrite_p.h | 2 +- src/declarative/qml/qdeclarativescriptparser.cpp | 6 +- .../declarative/compilation/tst_compilation.cpp | 2 +- 14 files changed, 409 insertions(+), 555 deletions(-) delete mode 100644 src/declarative/qml/parser/qdeclarativejsnodepool_p.h diff --git a/src/declarative/qml/parser/parser.pri b/src/declarative/qml/parser/parser.pri index 74e870d..4f1ff2f 100644 --- a/src/declarative/qml/parser/parser.pri +++ b/src/declarative/qml/parser/parser.pri @@ -8,7 +8,6 @@ HEADERS += \ $$PWD/qdeclarativejsgrammar_p.h \ $$PWD/qdeclarativejslexer_p.h \ $$PWD/qdeclarativejsmemorypool_p.h \ - $$PWD/qdeclarativejsnodepool_p.h \ $$PWD/qdeclarativejsparser_p.h \ $$PWD/qdeclarativejsglobal_p.h \ $$PWD/qdeclarativejskeywords_p.h diff --git a/src/declarative/qml/parser/qdeclarativejs.g b/src/declarative/qml/parser/qdeclarativejs.g index 8a96ae5..49b66d7 100644 --- a/src/declarative/qml/parser/qdeclarativejs.g +++ b/src/declarative/qml/parser/qdeclarativejs.g @@ -132,7 +132,7 @@ #include "qdeclarativejsengine_p.h" #include "qdeclarativejslexer_p.h" #include "qdeclarativejsast_p.h" -#include "qdeclarativejsnodepool_p.h" +#include "qdeclarativejsmemorypool_p.h" ./ @@ -342,6 +342,7 @@ protected: protected: Engine *driver; + MemoryPool *pool; int tos; int stack_size; Value *sym_stack; @@ -416,6 +417,7 @@ inline static bool automatic(Engine *driver, int token) Parser::Parser(Engine *engine): driver(engine), + pool(engine->pool()), tos(0), stack_size(0), sym_stack(0), @@ -460,12 +462,12 @@ AST::UiQualifiedId *Parser::reparseAsQualifiedId(AST::ExpressionNode *expr) } if (AST::IdentifierExpression *idExpr = AST::cast(it)) { - AST::UiQualifiedId *q = makeAstNode(driver->nodePool(), idExpr->name); + AST::UiQualifiedId *q = new (pool) AST::UiQualifiedId(idExpr->name); q->identifierToken = idExpr->identifierToken; AST::UiQualifiedId *currentId = q; for (int i = nameIds.size() - 1; i != -1; --i) { - currentId = makeAstNode(driver->nodePool(), currentId, nameIds[i]); + currentId = new (pool) AST::UiQualifiedId(currentId, nameIds[i]); currentId->identifierToken = locations[i]; } @@ -586,7 +588,7 @@ case $rule_number: { UiProgram: UiImportListOpt UiRootMember ; /. case $rule_number: { - sym(1).UiProgram = makeAstNode (driver->nodePool(), sym(1).UiImportList, + sym(1).UiProgram = new (pool) AST::UiProgram(sym(1).UiImportList, sym(2).UiObjectMemberList->finish()); } break; ./ @@ -602,15 +604,14 @@ case $rule_number: { UiImportList: UiImport ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiImport); + sym(1).Node = new (pool) AST::UiImportList(sym(1).UiImport); } break; ./ UiImportList: UiImportList UiImport ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), - sym(1).UiImportList, sym(2).UiImport); + sym(1).Node = new (pool) AST::UiImportList(sym(1).UiImportList, sym(2).UiImport); } break; ./ @@ -663,10 +664,10 @@ case $rule_number: { AST::UiImport *node = 0; if (AST::StringLiteral *importIdLiteral = AST::cast(sym(2).Expression)) { - node = makeAstNode(driver->nodePool(), importIdLiteral->value); + node = new (pool) AST::UiImport(importIdLiteral->value); node->fileNameToken = loc(2); } else if (AST::UiQualifiedId *qualifiedId = reparseAsQualifiedId(sym(2).Expression)) { - node = makeAstNode(driver->nodePool(), qualifiedId); + node = new (pool) AST::UiImport(qualifiedId); node->fileNameToken = loc(2); } @@ -693,21 +694,21 @@ case $rule_number: { UiRootMember: UiObjectDefinition ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiObjectMemberList(sym(1).UiObjectMember); } break; ./ UiObjectMemberList: UiObjectMember ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiObjectMemberList(sym(1).UiObjectMember); } break; ./ UiObjectMemberList: UiObjectMemberList UiObjectMember ; /. case $rule_number: { - AST::UiObjectMemberList *node = makeAstNode (driver->nodePool(), + AST::UiObjectMemberList *node = new (pool) AST:: UiObjectMemberList( sym(1).UiObjectMemberList, sym(2).UiObjectMember); sym(1).Node = node; } break; @@ -716,14 +717,14 @@ case $rule_number: { UiArrayMemberList: UiObjectDefinition ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiArrayMemberList(sym(1).UiObjectMember); } break; ./ UiArrayMemberList: UiArrayMemberList T_COMMA UiObjectDefinition ; /. case $rule_number: { - AST::UiArrayMemberList *node = makeAstNode (driver->nodePool(), + AST::UiArrayMemberList *node = new (pool) AST::UiArrayMemberList( sym(1).UiArrayMemberList, sym(3).UiObjectMember); node->commaToken = loc(2); sym(1).Node = node; @@ -733,7 +734,7 @@ case $rule_number: { UiObjectInitializer: T_LBRACE T_RBRACE ; /. case $rule_number: { - AST::UiObjectInitializer *node = makeAstNode (driver->nodePool(), (AST::UiObjectMemberList*)0); + AST::UiObjectInitializer *node = new (pool) AST::UiObjectInitializer((AST::UiObjectMemberList*)0); node->lbraceToken = loc(1); node->rbraceToken = loc(2); sym(1).Node = node; @@ -743,7 +744,7 @@ case $rule_number: { UiObjectInitializer: T_LBRACE UiObjectMemberList T_RBRACE ; /. case $rule_number: { - AST::UiObjectInitializer *node = makeAstNode (driver->nodePool(), sym(2).UiObjectMemberList->finish()); + AST::UiObjectInitializer *node = new (pool) AST::UiObjectInitializer(sym(2).UiObjectMemberList->finish()); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; @@ -753,7 +754,7 @@ case $rule_number: { UiObjectDefinition: UiQualifiedId UiObjectInitializer ; /. case $rule_number: { - AST::UiObjectDefinition *node = makeAstNode (driver->nodePool(), sym(1).UiQualifiedId, + AST::UiObjectDefinition *node = new (pool) AST::UiObjectDefinition(sym(1).UiQualifiedId, sym(2).UiObjectInitializer); sym(1).Node = node; } break; @@ -764,7 +765,7 @@ UiObjectMember: UiObjectDefinition ; UiObjectMember: UiQualifiedId T_COLON T_LBRACKET UiArrayMemberList T_RBRACKET ; /. case $rule_number: { - AST::UiArrayBinding *node = makeAstNode (driver->nodePool(), + AST::UiArrayBinding *node = new (pool) AST::UiArrayBinding( sym(1).UiQualifiedId, sym(4).UiArrayMemberList->finish()); node->colonToken = loc(2); node->lbracketToken = loc(3); @@ -776,7 +777,7 @@ case $rule_number: { UiObjectMember: UiQualifiedId T_COLON UiQualifiedId UiObjectInitializer ; /. case $rule_number: { - AST::UiObjectBinding *node = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *node = new (pool) AST::UiObjectBinding( sym(1).UiQualifiedId, sym(3).UiQualifiedId, sym(4).UiObjectInitializer); node->colonToken = loc(2); sym(1).Node = node; @@ -786,7 +787,7 @@ case $rule_number: { UiObjectMember: UiQualifiedId T_ON UiQualifiedId UiObjectInitializer ; /. case $rule_number: { - AST::UiObjectBinding *node = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *node = new (pool) AST::UiObjectBinding( sym(3).UiQualifiedId, sym(1).UiQualifiedId, sym(4).UiObjectInitializer); node->colonToken = loc(2); node->hasOnToken = true; @@ -803,7 +804,7 @@ UiObjectMember: UiQualifiedId T_COLON UiScriptStatement ; /. case $rule_number: { - AST::UiScriptBinding *node = makeAstNode (driver->nodePool(), + AST::UiScriptBinding *node = new (pool) AST::UiScriptBinding( sym(1).UiQualifiedId, sym(3).Statement); node->colonToken = loc(2); sym(1).Node = node; @@ -831,7 +832,7 @@ case $rule_number: { UiParameterList: UiPropertyType JsIdentifier ; /. case $rule_number: { - AST::UiParameterList *node = makeAstNode (driver->nodePool(), stringRef(1), stringRef(2)); + AST::UiParameterList *node = new (pool) AST::UiParameterList(stringRef(1), stringRef(2)); node->identifierToken = loc(2); sym(1).Node = node; } break; @@ -840,7 +841,7 @@ case $rule_number: { UiParameterList: UiParameterList T_COMMA UiPropertyType JsIdentifier ; /. case $rule_number: { - AST::UiParameterList *node = makeAstNode (driver->nodePool(), sym(1).UiParameterList, stringRef(3), stringRef(4)); + AST::UiParameterList *node = new (pool) AST::UiParameterList(sym(1).UiParameterList, stringRef(3), stringRef(4)); node->commaToken = loc(2); node->identifierToken = loc(4); sym(1).Node = node; @@ -851,7 +852,7 @@ UiObjectMember: T_SIGNAL T_IDENTIFIER T_LPAREN UiParameterListOpt T_RPAREN T_AUT UiObjectMember: T_SIGNAL T_IDENTIFIER T_LPAREN UiParameterListOpt T_RPAREN T_SEMICOLON ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), QStringRef(), stringRef(2)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(QStringRef(), stringRef(2)); node->type = AST::UiPublicMember::Signal; node->propertyToken = loc(1); node->typeToken = loc(2); @@ -866,7 +867,7 @@ UiObjectMember: T_SIGNAL T_IDENTIFIER T_AUTOMATIC_SEMICOLON ; UiObjectMember: T_SIGNAL T_IDENTIFIER T_SEMICOLON ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), QStringRef(), stringRef(2)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(QStringRef(), stringRef(2)); node->type = AST::UiPublicMember::Signal; node->propertyToken = loc(1); node->typeToken = loc(2); @@ -880,7 +881,7 @@ UiObjectMember: T_PROPERTY T_IDENTIFIER T_LT UiPropertyType T_GT JsIdentifier T_ UiObjectMember: T_PROPERTY T_IDENTIFIER T_LT UiPropertyType T_GT JsIdentifier T_SEMICOLON ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(4), stringRef(6)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(4), stringRef(6)); node->typeModifier = stringRef(2); node->propertyToken = loc(1); node->typeModifierToken = loc(2); @@ -895,7 +896,7 @@ UiObjectMember: T_PROPERTY UiPropertyType JsIdentifier T_AUTOMATIC_SEMICOLON ; UiObjectMember: T_PROPERTY UiPropertyType JsIdentifier T_SEMICOLON ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3)); node->propertyToken = loc(1); node->typeToken = loc(2); node->identifierToken = loc(3); @@ -908,7 +909,7 @@ UiObjectMember: T_DEFAULT T_PROPERTY UiPropertyType JsIdentifier T_AUTOMATIC_SEM UiObjectMember: T_DEFAULT T_PROPERTY UiPropertyType JsIdentifier T_SEMICOLON ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4)); node->isDefaultMember = true; node->defaultToken = loc(1); node->propertyToken = loc(2); @@ -922,7 +923,7 @@ case $rule_number: { UiObjectMember: T_PROPERTY UiPropertyType JsIdentifier T_COLON UiScriptStatement ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3), sym(5).Statement); node->propertyToken = loc(1); node->typeToken = loc(2); @@ -935,7 +936,7 @@ case $rule_number: { UiObjectMember: T_READONLY T_PROPERTY UiPropertyType JsIdentifier T_COLON UiScriptStatement ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4), sym(6).Statement); node->isReadonlyMember = true; node->readonlyToken = loc(1); @@ -950,7 +951,7 @@ case $rule_number: { UiObjectMember: T_DEFAULT T_PROPERTY UiPropertyType JsIdentifier T_COLON UiScriptStatement ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4), sym(6).Statement); node->isDefaultMember = true; node->defaultToken = loc(1); @@ -965,7 +966,7 @@ case $rule_number: { UiObjectMember: T_PROPERTY T_IDENTIFIER T_LT UiPropertyType T_GT JsIdentifier T_COLON T_LBRACKET UiArrayMemberList T_RBRACKET ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(4), stringRef(6)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(4), stringRef(6)); node->typeModifier = stringRef(2); node->propertyToken = loc(1); node->typeModifierToken = loc(2); @@ -973,11 +974,11 @@ case $rule_number: { node->identifierToken = loc(6); node->semicolonToken = loc(7); // insert a fake ';' before ':' - AST::UiQualifiedId *propertyName = makeAstNode(driver->nodePool(), stringRef(6)); + AST::UiQualifiedId *propertyName = new (pool) AST::UiQualifiedId(stringRef(6)); propertyName->identifierToken = loc(6); propertyName->next = 0; - AST::UiArrayBinding *binding = makeAstNode (driver->nodePool(), + AST::UiArrayBinding *binding = new (pool) AST::UiArrayBinding( propertyName, sym(9).UiArrayMemberList->finish()); binding->colonToken = loc(7); binding->lbracketToken = loc(8); @@ -992,17 +993,17 @@ case $rule_number: { UiObjectMember: T_PROPERTY UiPropertyType JsIdentifier T_COLON UiQualifiedId UiObjectInitializer ; /. case $rule_number: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3)); node->propertyToken = loc(1); node->typeToken = loc(2); node->identifierToken = loc(3); node->semicolonToken = loc(4); // insert a fake ';' before ':' - AST::UiQualifiedId *propertyName = makeAstNode(driver->nodePool(), stringRef(3)); + AST::UiQualifiedId *propertyName = new (pool) AST::UiQualifiedId(stringRef(3)); propertyName->identifierToken = loc(3); propertyName->next = 0; - AST::UiObjectBinding *binding = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *binding = new (pool) AST::UiObjectBinding( propertyName, sym(5).UiQualifiedId, sym(6).UiObjectInitializer); binding->colonToken = loc(4); @@ -1015,14 +1016,14 @@ case $rule_number: { UiObjectMember: FunctionDeclaration ; /. case $rule_number: { - sym(1).Node = makeAstNode(driver->nodePool(), sym(1).Node); + sym(1).Node = new (pool) AST::UiSourceElement(sym(1).Node); } break; ./ UiObjectMember: VariableStatement ; /. case $rule_number: { - sym(1).Node = makeAstNode(driver->nodePool(), sym(1).Node); + sym(1).Node = new (pool) AST::UiSourceElement(sym(1).Node); } break; ./ @@ -1040,7 +1041,7 @@ JsIdentifier: T_ON ; PrimaryExpression: T_THIS ; /. case $rule_number: { - AST::ThisExpression *node = makeAstNode (driver->nodePool()); + AST::ThisExpression *node = new (pool) AST::ThisExpression(); node->thisToken = loc(1); sym(1).Node = node; } break; @@ -1049,7 +1050,7 @@ case $rule_number: { PrimaryExpression: JsIdentifier ; /. case $rule_number: { - AST::IdentifierExpression *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierExpression *node = new (pool) AST::IdentifierExpression(stringRef(1)); node->identifierToken = loc(1); sym(1).Node = node; } break; @@ -1058,7 +1059,7 @@ case $rule_number: { PrimaryExpression: T_NULL ; /. case $rule_number: { - AST::NullExpression *node = makeAstNode (driver->nodePool()); + AST::NullExpression *node = new (pool) AST::NullExpression(); node->nullToken = loc(1); sym(1).Node = node; } break; @@ -1067,7 +1068,7 @@ case $rule_number: { PrimaryExpression: T_TRUE ; /. case $rule_number: { - AST::TrueLiteral *node = makeAstNode (driver->nodePool()); + AST::TrueLiteral *node = new (pool) AST::TrueLiteral(); node->trueToken = loc(1); sym(1).Node = node; } break; @@ -1076,7 +1077,7 @@ case $rule_number: { PrimaryExpression: T_FALSE ; /. case $rule_number: { - AST::FalseLiteral *node = makeAstNode (driver->nodePool()); + AST::FalseLiteral *node = new (pool) AST::FalseLiteral(); node->falseToken = loc(1); sym(1).Node = node; } break; @@ -1085,7 +1086,7 @@ case $rule_number: { PrimaryExpression: T_NUMERIC_LITERAL ; /. case $rule_number: { - AST::NumericLiteral *node = makeAstNode (driver->nodePool(), sym(1).dval); + AST::NumericLiteral *node = new (pool) AST::NumericLiteral(sym(1).dval); node->literalToken = loc(1); sym(1).Node = node; } break; @@ -1097,7 +1098,7 @@ PrimaryExpression: T_MULTILINE_STRING_LITERAL ; PrimaryExpression: T_STRING_LITERAL ; /. case $rule_number: { - AST::StringLiteral *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::StringLiteral *node = new (pool) AST::StringLiteral(stringRef(1)); node->literalToken = loc(1); sym(1).Node = node; } break; @@ -1117,7 +1118,7 @@ case $rule_number: { loc(1).length = lexer->tokenLength(); - AST::RegExpLiteral *node = makeAstNode (driver->nodePool(), + AST::RegExpLiteral *node = new (pool) AST::RegExpLiteral( driver->newStringRef(lexer->regExpPattern()), lexer->regExpFlags()); node->literalToken = loc(1); sym(1).Node = node; @@ -1138,7 +1139,7 @@ case $rule_number: { loc(1).length = lexer->tokenLength(); - AST::RegExpLiteral *node = makeAstNode (driver->nodePool(), + AST::RegExpLiteral *node = new (pool) AST::RegExpLiteral( driver->newStringRef(lexer->regExpPattern()), lexer->regExpFlags()); node->literalToken = loc(1); sym(1).Node = node; @@ -1148,7 +1149,7 @@ case $rule_number: { PrimaryExpression: T_LBRACKET T_RBRACKET ; /. case $rule_number: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), (AST::Elision *) 0); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral((AST::Elision *) 0); node->lbracketToken = loc(1); node->rbracketToken = loc(2); sym(1).Node = node; @@ -1158,7 +1159,7 @@ case $rule_number: { PrimaryExpression: T_LBRACKET Elision T_RBRACKET ; /. case $rule_number: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).Elision->finish()); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).Elision->finish()); node->lbracketToken = loc(1); node->rbracketToken = loc(3); sym(1).Node = node; @@ -1168,7 +1169,7 @@ case $rule_number: { PrimaryExpression: T_LBRACKET ElementList T_RBRACKET ; /. case $rule_number: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish ()); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish ()); node->lbracketToken = loc(1); node->rbracketToken = loc(3); sym(1).Node = node; @@ -1178,7 +1179,7 @@ case $rule_number: { PrimaryExpression: T_LBRACKET ElementList T_COMMA T_RBRACKET ; /. case $rule_number: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish (), + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish (), (AST::Elision *) 0); node->lbracketToken = loc(1); node->commaToken = loc(3); @@ -1190,7 +1191,7 @@ case $rule_number: { PrimaryExpression: T_LBRACKET ElementList T_COMMA Elision T_RBRACKET ; /. case $rule_number: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish (), + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish (), sym(4).Elision->finish()); node->lbracketToken = loc(1); node->commaToken = loc(3); @@ -1202,7 +1203,7 @@ case $rule_number: { -- PrimaryExpression: T_LBRACE T_RBRACE ; -- /. -- case $rule_number: { --- sym(1).Node = makeAstNode (driver->nodePool()); +-- sym(1).Node = new (pool) AST::ObjectLiteral(); -- } break; -- ./ @@ -1211,10 +1212,10 @@ PrimaryExpression: T_LBRACE PropertyNameAndValueListOpt T_RBRACE ; case $rule_number: { AST::ObjectLiteral *node = 0; if (sym(2).Node) - node = makeAstNode (driver->nodePool(), + node = new (pool) AST::ObjectLiteral( sym(2).PropertyNameAndValueList->finish ()); else - node = makeAstNode (driver->nodePool()); + node = new (pool) AST::ObjectLiteral(); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; @@ -1224,7 +1225,7 @@ case $rule_number: { PrimaryExpression: T_LBRACE PropertyNameAndValueList T_COMMA T_RBRACE ; /. case $rule_number: { - AST::ObjectLiteral *node = makeAstNode (driver->nodePool(), + AST::ObjectLiteral *node = new (pool) AST::ObjectLiteral( sym(2).PropertyNameAndValueList->finish ()); node->lbraceToken = loc(1); node->rbraceToken = loc(4); @@ -1235,7 +1236,7 @@ case $rule_number: { PrimaryExpression: T_LPAREN Expression T_RPAREN ; /. case $rule_number: { - AST::NestedExpression *node = makeAstNode(driver->nodePool(), sym(2).Expression); + AST::NestedExpression *node = new (pool) AST::NestedExpression(sym(2).Expression); node->lparenToken = loc(1); node->rparenToken = loc(3); sym(1).Node = node; @@ -1268,21 +1269,21 @@ case $rule_number: { ElementList: AssignmentExpression ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), (AST::Elision *) 0, sym(1).Expression); + sym(1).Node = new (pool) AST::ElementList((AST::Elision *) 0, sym(1).Expression); } break; ./ ElementList: Elision AssignmentExpression ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Elision->finish(), sym(2).Expression); + sym(1).Node = new (pool) AST::ElementList(sym(1).Elision->finish(), sym(2).Expression); } break; ./ ElementList: ElementList T_COMMA AssignmentExpression ; /. case $rule_number: { - AST::ElementList *node = makeAstNode (driver->nodePool(), sym(1).ElementList, + AST::ElementList *node = new (pool) AST::ElementList(sym(1).ElementList, (AST::Elision *) 0, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; @@ -1292,7 +1293,7 @@ case $rule_number: { ElementList: ElementList T_COMMA Elision AssignmentExpression ; /. case $rule_number: { - AST::ElementList *node = makeAstNode (driver->nodePool(), sym(1).ElementList, sym(3).Elision->finish(), + AST::ElementList *node = new (pool) AST::ElementList(sym(1).ElementList, sym(3).Elision->finish(), sym(4).Expression); node->commaToken = loc(2); sym(1).Node = node; @@ -1302,7 +1303,7 @@ case $rule_number: { Elision: T_COMMA ; /. case $rule_number: { - AST::Elision *node = makeAstNode (driver->nodePool()); + AST::Elision *node = new (pool) AST::Elision(); node->commaToken = loc(1); sym(1).Node = node; } break; @@ -1311,7 +1312,7 @@ case $rule_number: { Elision: Elision T_COMMA ; /. case $rule_number: { - AST::Elision *node = makeAstNode (driver->nodePool(), sym(1).Elision); + AST::Elision *node = new (pool) AST::Elision(sym(1).Elision); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -1320,7 +1321,7 @@ case $rule_number: { PropertyNameAndValueList: PropertyName T_COLON AssignmentExpression ; /. case $rule_number: { - AST::PropertyNameAndValueList *node = makeAstNode (driver->nodePool(), + AST::PropertyNameAndValueList *node = new (pool) AST::PropertyNameAndValueList( sym(1).PropertyName, sym(3).Expression); node->colonToken = loc(2); sym(1).Node = node; @@ -1330,7 +1331,7 @@ case $rule_number: { PropertyNameAndValueList: PropertyNameAndValueList T_COMMA PropertyName T_COLON AssignmentExpression ; /. case $rule_number: { - AST::PropertyNameAndValueList *node = makeAstNode (driver->nodePool(), + AST::PropertyNameAndValueList *node = new (pool) AST::PropertyNameAndValueList( sym(1).PropertyNameAndValueList, sym(3).PropertyName, sym(5).Expression); node->commaToken = loc(2); node->colonToken = loc(4); @@ -1341,7 +1342,7 @@ case $rule_number: { PropertyName: T_IDENTIFIER %prec SHIFT_THERE ; /. case $rule_number: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; @@ -1353,7 +1354,7 @@ PropertyName: T_SIGNAL ; PropertyName: T_PROPERTY ; /. case $rule_number: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; @@ -1362,7 +1363,7 @@ case $rule_number: { PropertyName: T_STRING_LITERAL ; /. case $rule_number: { - AST::StringLiteralPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::StringLiteralPropertyName *node = new (pool) AST::StringLiteralPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; @@ -1371,7 +1372,7 @@ case $rule_number: { PropertyName: T_NUMERIC_LITERAL ; /. case $rule_number: { - AST::NumericLiteralPropertyName *node = makeAstNode (driver->nodePool(), sym(1).dval); + AST::NumericLiteralPropertyName *node = new (pool) AST::NumericLiteralPropertyName(sym(1).dval); node->propertyNameToken = loc(1); sym(1).Node = node; } break; @@ -1380,7 +1381,7 @@ case $rule_number: { PropertyName: ReservedIdentifier ; /. case $rule_number: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; @@ -1427,7 +1428,7 @@ MemberExpression: FunctionExpression ; MemberExpression: MemberExpression T_LBRACKET Expression T_RBRACKET ; /. case $rule_number: { - AST::ArrayMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::ArrayMemberExpression *node = new (pool) AST::ArrayMemberExpression(sym(1).Expression, sym(3).Expression); node->lbracketToken = loc(2); node->rbracketToken = loc(4); sym(1).Node = node; @@ -1437,7 +1438,7 @@ case $rule_number: { MemberExpression: MemberExpression T_DOT PropertyIdentifier ; /. case $rule_number: { - AST::FieldMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, stringRef(3)); + AST::FieldMemberExpression *node = new (pool) AST::FieldMemberExpression(sym(1).Expression, stringRef(3)); node->dotToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; @@ -1447,7 +1448,7 @@ case $rule_number: { MemberExpression: T_NEW MemberExpression T_LPAREN ArgumentListOpt T_RPAREN ; /. case $rule_number: { - AST::NewMemberExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression, sym(4).ArgumentList); + AST::NewMemberExpression *node = new (pool) AST::NewMemberExpression(sym(2).Expression, sym(4).ArgumentList); node->newToken = loc(1); node->lparenToken = loc(3); node->rparenToken = loc(5); @@ -1460,7 +1461,7 @@ NewExpression: MemberExpression ; NewExpression: T_NEW NewExpression ; /. case $rule_number: { - AST::NewExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::NewExpression *node = new (pool) AST::NewExpression(sym(2).Expression); node->newToken = loc(1); sym(1).Node = node; } break; @@ -1469,7 +1470,7 @@ case $rule_number: { CallExpression: MemberExpression T_LPAREN ArgumentListOpt T_RPAREN ; /. case $rule_number: { - AST::CallExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).ArgumentList); + AST::CallExpression *node = new (pool) AST::CallExpression(sym(1).Expression, sym(3).ArgumentList); node->lparenToken = loc(2); node->rparenToken = loc(4); sym(1).Node = node; @@ -1479,7 +1480,7 @@ case $rule_number: { CallExpression: CallExpression T_LPAREN ArgumentListOpt T_RPAREN ; /. case $rule_number: { - AST::CallExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).ArgumentList); + AST::CallExpression *node = new (pool) AST::CallExpression(sym(1).Expression, sym(3).ArgumentList); node->lparenToken = loc(2); node->rparenToken = loc(4); sym(1).Node = node; @@ -1489,7 +1490,7 @@ case $rule_number: { CallExpression: CallExpression T_LBRACKET Expression T_RBRACKET ; /. case $rule_number: { - AST::ArrayMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::ArrayMemberExpression *node = new (pool) AST::ArrayMemberExpression(sym(1).Expression, sym(3).Expression); node->lbracketToken = loc(2); node->rbracketToken = loc(4); sym(1).Node = node; @@ -1499,7 +1500,7 @@ case $rule_number: { CallExpression: CallExpression T_DOT PropertyIdentifier ; /. case $rule_number: { - AST::FieldMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, stringRef(3)); + AST::FieldMemberExpression *node = new (pool) AST::FieldMemberExpression(sym(1).Expression, stringRef(3)); node->dotToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; @@ -1523,14 +1524,14 @@ case $rule_number: { ArgumentList: AssignmentExpression ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Expression); + sym(1).Node = new (pool) AST::ArgumentList(sym(1).Expression); } break; ./ ArgumentList: ArgumentList T_COMMA AssignmentExpression ; /. case $rule_number: { - AST::ArgumentList *node = makeAstNode (driver->nodePool(), sym(1).ArgumentList, sym(3).Expression); + AST::ArgumentList *node = new (pool) AST::ArgumentList(sym(1).ArgumentList, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -1543,7 +1544,7 @@ PostfixExpression: LeftHandSideExpression ; PostfixExpression: LeftHandSideExpression T_PLUS_PLUS ; /. case $rule_number: { - AST::PostIncrementExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::PostIncrementExpression *node = new (pool) AST::PostIncrementExpression(sym(1).Expression); node->incrementToken = loc(2); sym(1).Node = node; } break; @@ -1552,7 +1553,7 @@ case $rule_number: { PostfixExpression: LeftHandSideExpression T_MINUS_MINUS ; /. case $rule_number: { - AST::PostDecrementExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::PostDecrementExpression *node = new (pool) AST::PostDecrementExpression(sym(1).Expression); node->decrementToken = loc(2); sym(1).Node = node; } break; @@ -1563,7 +1564,7 @@ UnaryExpression: PostfixExpression ; UnaryExpression: T_DELETE UnaryExpression ; /. case $rule_number: { - AST::DeleteExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::DeleteExpression *node = new (pool) AST::DeleteExpression(sym(2).Expression); node->deleteToken = loc(1); sym(1).Node = node; } break; @@ -1572,7 +1573,7 @@ case $rule_number: { UnaryExpression: T_VOID UnaryExpression ; /. case $rule_number: { - AST::VoidExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::VoidExpression *node = new (pool) AST::VoidExpression(sym(2).Expression); node->voidToken = loc(1); sym(1).Node = node; } break; @@ -1581,7 +1582,7 @@ case $rule_number: { UnaryExpression: T_TYPEOF UnaryExpression ; /. case $rule_number: { - AST::TypeOfExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::TypeOfExpression *node = new (pool) AST::TypeOfExpression(sym(2).Expression); node->typeofToken = loc(1); sym(1).Node = node; } break; @@ -1590,7 +1591,7 @@ case $rule_number: { UnaryExpression: T_PLUS_PLUS UnaryExpression ; /. case $rule_number: { - AST::PreIncrementExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::PreIncrementExpression *node = new (pool) AST::PreIncrementExpression(sym(2).Expression); node->incrementToken = loc(1); sym(1).Node = node; } break; @@ -1599,7 +1600,7 @@ case $rule_number: { UnaryExpression: T_MINUS_MINUS UnaryExpression ; /. case $rule_number: { - AST::PreDecrementExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::PreDecrementExpression *node = new (pool) AST::PreDecrementExpression(sym(2).Expression); node->decrementToken = loc(1); sym(1).Node = node; } break; @@ -1608,7 +1609,7 @@ case $rule_number: { UnaryExpression: T_PLUS UnaryExpression ; /. case $rule_number: { - AST::UnaryPlusExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::UnaryPlusExpression *node = new (pool) AST::UnaryPlusExpression(sym(2).Expression); node->plusToken = loc(1); sym(1).Node = node; } break; @@ -1617,7 +1618,7 @@ case $rule_number: { UnaryExpression: T_MINUS UnaryExpression ; /. case $rule_number: { - AST::UnaryMinusExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::UnaryMinusExpression *node = new (pool) AST::UnaryMinusExpression(sym(2).Expression); node->minusToken = loc(1); sym(1).Node = node; } break; @@ -1626,7 +1627,7 @@ case $rule_number: { UnaryExpression: T_TILDE UnaryExpression ; /. case $rule_number: { - AST::TildeExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::TildeExpression *node = new (pool) AST::TildeExpression(sym(2).Expression); node->tildeToken = loc(1); sym(1).Node = node; } break; @@ -1635,7 +1636,7 @@ case $rule_number: { UnaryExpression: T_NOT UnaryExpression ; /. case $rule_number: { - AST::NotExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::NotExpression *node = new (pool) AST::NotExpression(sym(2).Expression); node->notToken = loc(1); sym(1).Node = node; } break; @@ -1646,7 +1647,7 @@ MultiplicativeExpression: UnaryExpression ; MultiplicativeExpression: MultiplicativeExpression T_STAR UnaryExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Mul, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1656,7 +1657,7 @@ case $rule_number: { MultiplicativeExpression: MultiplicativeExpression T_DIVIDE_ UnaryExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Div, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1666,7 +1667,7 @@ case $rule_number: { MultiplicativeExpression: MultiplicativeExpression T_REMAINDER UnaryExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Mod, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1678,7 +1679,7 @@ AdditiveExpression: MultiplicativeExpression ; AdditiveExpression: AdditiveExpression T_PLUS MultiplicativeExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Add, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1688,7 +1689,7 @@ case $rule_number: { AdditiveExpression: AdditiveExpression T_MINUS MultiplicativeExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Sub, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1700,7 +1701,7 @@ ShiftExpression: AdditiveExpression ; ShiftExpression: ShiftExpression T_LT_LT AdditiveExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::LShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1710,7 +1711,7 @@ case $rule_number: { ShiftExpression: ShiftExpression T_GT_GT AdditiveExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::RShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1720,7 +1721,7 @@ case $rule_number: { ShiftExpression: ShiftExpression T_GT_GT_GT AdditiveExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::URShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1732,7 +1733,7 @@ RelationalExpression: ShiftExpression ; RelationalExpression: RelationalExpression T_LT ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Lt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1742,7 +1743,7 @@ case $rule_number: { RelationalExpression: RelationalExpression T_GT ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Gt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1752,7 +1753,7 @@ case $rule_number: { RelationalExpression: RelationalExpression T_LE ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Le, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1762,7 +1763,7 @@ case $rule_number: { RelationalExpression: RelationalExpression T_GE ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Ge, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1772,7 +1773,7 @@ case $rule_number: { RelationalExpression: RelationalExpression T_INSTANCEOF ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::InstanceOf, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1782,7 +1783,7 @@ case $rule_number: { RelationalExpression: RelationalExpression T_IN ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::In, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1794,7 +1795,7 @@ RelationalExpressionNotIn: ShiftExpression ; RelationalExpressionNotIn: RelationalExpressionNotIn T_LT ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Lt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1804,7 +1805,7 @@ case $rule_number: { RelationalExpressionNotIn: RelationalExpressionNotIn T_GT ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Gt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1814,7 +1815,7 @@ case $rule_number: { RelationalExpressionNotIn: RelationalExpressionNotIn T_LE ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Le, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1824,7 +1825,7 @@ case $rule_number: { RelationalExpressionNotIn: RelationalExpressionNotIn T_GE ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Ge, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1834,7 +1835,7 @@ case $rule_number: { RelationalExpressionNotIn: RelationalExpressionNotIn T_INSTANCEOF ShiftExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::InstanceOf, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1846,7 +1847,7 @@ EqualityExpression: RelationalExpression ; EqualityExpression: EqualityExpression T_EQ_EQ RelationalExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Equal, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1856,7 +1857,7 @@ case $rule_number: { EqualityExpression: EqualityExpression T_NOT_EQ RelationalExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::NotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1866,7 +1867,7 @@ case $rule_number: { EqualityExpression: EqualityExpression T_EQ_EQ_EQ RelationalExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1876,7 +1877,7 @@ case $rule_number: { EqualityExpression: EqualityExpression T_NOT_EQ_EQ RelationalExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictNotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1888,7 +1889,7 @@ EqualityExpressionNotIn: RelationalExpressionNotIn ; EqualityExpressionNotIn: EqualityExpressionNotIn T_EQ_EQ RelationalExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Equal, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1898,7 +1899,7 @@ case $rule_number: { EqualityExpressionNotIn: EqualityExpressionNotIn T_NOT_EQ RelationalExpressionNotIn; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::NotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1908,7 +1909,7 @@ case $rule_number: { EqualityExpressionNotIn: EqualityExpressionNotIn T_EQ_EQ_EQ RelationalExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1918,7 +1919,7 @@ case $rule_number: { EqualityExpressionNotIn: EqualityExpressionNotIn T_NOT_EQ_EQ RelationalExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictNotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1930,7 +1931,7 @@ BitwiseANDExpression: EqualityExpression ; BitwiseANDExpression: BitwiseANDExpression T_AND EqualityExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitAnd, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1942,7 +1943,7 @@ BitwiseANDExpressionNotIn: EqualityExpressionNotIn ; BitwiseANDExpressionNotIn: BitwiseANDExpressionNotIn T_AND EqualityExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitAnd, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1954,7 +1955,7 @@ BitwiseXORExpression: BitwiseANDExpression ; BitwiseXORExpression: BitwiseXORExpression T_XOR BitwiseANDExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitXor, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1966,7 +1967,7 @@ BitwiseXORExpressionNotIn: BitwiseANDExpressionNotIn ; BitwiseXORExpressionNotIn: BitwiseXORExpressionNotIn T_XOR BitwiseANDExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitXor, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1978,7 +1979,7 @@ BitwiseORExpression: BitwiseXORExpression ; BitwiseORExpression: BitwiseORExpression T_OR BitwiseXORExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitOr, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1990,7 +1991,7 @@ BitwiseORExpressionNotIn: BitwiseXORExpressionNotIn ; BitwiseORExpressionNotIn: BitwiseORExpressionNotIn T_OR BitwiseXORExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitOr, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2002,7 +2003,7 @@ LogicalANDExpression: BitwiseORExpression ; LogicalANDExpression: LogicalANDExpression T_AND_AND BitwiseORExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::And, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2014,7 +2015,7 @@ LogicalANDExpressionNotIn: BitwiseORExpressionNotIn ; LogicalANDExpressionNotIn: LogicalANDExpressionNotIn T_AND_AND BitwiseORExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::And, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2026,7 +2027,7 @@ LogicalORExpression: LogicalANDExpression ; LogicalORExpression: LogicalORExpression T_OR_OR LogicalANDExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Or, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2038,7 +2039,7 @@ LogicalORExpressionNotIn: LogicalANDExpressionNotIn ; LogicalORExpressionNotIn: LogicalORExpressionNotIn T_OR_OR LogicalANDExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Or, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2050,7 +2051,7 @@ ConditionalExpression: LogicalORExpression ; ConditionalExpression: LogicalORExpression T_QUESTION AssignmentExpression T_COLON AssignmentExpression ; /. case $rule_number: { - AST::ConditionalExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::ConditionalExpression *node = new (pool) AST::ConditionalExpression(sym(1).Expression, sym(3).Expression, sym(5).Expression); node->questionToken = loc(2); node->colonToken = loc(4); @@ -2063,7 +2064,7 @@ ConditionalExpressionNotIn: LogicalORExpressionNotIn ; ConditionalExpressionNotIn: LogicalORExpressionNotIn T_QUESTION AssignmentExpressionNotIn T_COLON AssignmentExpressionNotIn ; /. case $rule_number: { - AST::ConditionalExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::ConditionalExpression *node = new (pool) AST::ConditionalExpression(sym(1).Expression, sym(3).Expression, sym(5).Expression); node->questionToken = loc(2); node->colonToken = loc(4); @@ -2076,7 +2077,7 @@ AssignmentExpression: ConditionalExpression ; AssignmentExpression: LeftHandSideExpression AssignmentOperator AssignmentExpression ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, sym(2).ival, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2088,7 +2089,7 @@ AssignmentExpressionNotIn: ConditionalExpressionNotIn ; AssignmentExpressionNotIn: LeftHandSideExpression AssignmentOperator AssignmentExpressionNotIn ; /. case $rule_number: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, sym(2).ival, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -2184,7 +2185,7 @@ Expression: AssignmentExpression ; Expression: Expression T_COMMA AssignmentExpression ; /. case $rule_number: { - AST::Expression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::Expression *node = new (pool) AST::Expression(sym(1).Expression, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -2204,7 +2205,7 @@ ExpressionNotIn: AssignmentExpressionNotIn ; ExpressionNotIn: ExpressionNotIn T_COMMA AssignmentExpressionNotIn ; /. case $rule_number: { - AST::Expression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::Expression *node = new (pool) AST::Expression(sym(1).Expression, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -2239,7 +2240,7 @@ Statement: DebuggerStatement ; Block: T_LBRACE StatementListOpt T_RBRACE ; /. case $rule_number: { - AST::Block *node = makeAstNode (driver->nodePool(), sym(2).StatementList); + AST::Block *node = new (pool) AST::Block(sym(2).StatementList); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; @@ -2249,14 +2250,14 @@ case $rule_number: { StatementList: Statement ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Statement); + sym(1).Node = new (pool) AST::StatementList(sym(1).Statement); } break; ./ StatementList: StatementList Statement ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).StatementList, sym(2).Statement); + sym(1).Node = new (pool) AST::StatementList(sym(1).StatementList, sym(2).Statement); } break; ./ @@ -2278,7 +2279,7 @@ VariableStatement: VariableDeclarationKind VariableDeclarationList T_AUTOMATIC_S VariableStatement: VariableDeclarationKind VariableDeclarationList T_SEMICOLON ; /. case $rule_number: { - AST::VariableStatement *node = makeAstNode (driver->nodePool(), + AST::VariableStatement *node = new (pool) AST::VariableStatement( sym(2).VariableDeclarationList->finish (/*readOnly=*/sym(1).ival == T_CONST)); node->declarationKindToken = loc(1); node->semicolonToken = loc(3); @@ -2303,14 +2304,14 @@ case $rule_number: { VariableDeclarationList: VariableDeclaration ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclaration); } break; ./ VariableDeclarationList: VariableDeclarationList T_COMMA VariableDeclaration ; /. case $rule_number: { - AST::VariableDeclarationList *node = makeAstNode (driver->nodePool(), + AST::VariableDeclarationList *node = new (pool) AST::VariableDeclarationList( sym(1).VariableDeclarationList, sym(3).VariableDeclaration); node->commaToken = loc(2); sym(1).Node = node; @@ -2320,21 +2321,21 @@ case $rule_number: { VariableDeclarationListNotIn: VariableDeclarationNotIn ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclaration); } break; ./ VariableDeclarationListNotIn: VariableDeclarationListNotIn T_COMMA VariableDeclarationNotIn ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclarationList, sym(3).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclarationList, sym(3).VariableDeclaration); } break; ./ VariableDeclaration: JsIdentifier InitialiserOpt ; /. case $rule_number: { - AST::VariableDeclaration *node = makeAstNode (driver->nodePool(), stringRef(1), sym(2).Expression); + AST::VariableDeclaration *node = new (pool) AST::VariableDeclaration(stringRef(1), sym(2).Expression); node->identifierToken = loc(1); sym(1).Node = node; } break; @@ -2343,7 +2344,7 @@ case $rule_number: { VariableDeclarationNotIn: JsIdentifier InitialiserNotInOpt ; /. case $rule_number: { - AST::VariableDeclaration *node = makeAstNode (driver->nodePool(), stringRef(1), sym(2).Expression); + AST::VariableDeclaration *node = new (pool) AST::VariableDeclaration(stringRef(1), sym(2).Expression); node->identifierToken = loc(1); sym(1).Node = node; } break; @@ -2386,7 +2387,7 @@ InitialiserNotInOpt: InitialiserNotIn ; EmptyStatement: T_SEMICOLON ; /. case $rule_number: { - AST::EmptyStatement *node = makeAstNode (driver->nodePool()); + AST::EmptyStatement *node = new (pool) AST::EmptyStatement(); node->semicolonToken = loc(1); sym(1).Node = node; } break; @@ -2396,7 +2397,7 @@ ExpressionStatement: Expression T_AUTOMATIC_SEMICOLON ; -- automatic semicolon ExpressionStatement: Expression T_SEMICOLON ; /. case $rule_number: { - AST::ExpressionStatement *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::ExpressionStatement *node = new (pool) AST::ExpressionStatement(sym(1).Expression); node->semicolonToken = loc(2); sym(1).Node = node; } break; @@ -2405,7 +2406,7 @@ case $rule_number: { IfStatement: T_IF T_LPAREN Expression T_RPAREN Statement T_ELSE Statement ; /. case $rule_number: { - AST::IfStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement, sym(7).Statement); + AST::IfStatement *node = new (pool) AST::IfStatement(sym(3).Expression, sym(5).Statement, sym(7).Statement); node->ifToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -2417,7 +2418,7 @@ case $rule_number: { IfStatement: T_IF T_LPAREN Expression T_RPAREN Statement ; /. case $rule_number: { - AST::IfStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::IfStatement *node = new (pool) AST::IfStatement(sym(3).Expression, sym(5).Statement); node->ifToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -2430,7 +2431,7 @@ IterationStatement: T_DO Statement T_WHILE T_LPAREN Expression T_RPAREN T_AUTOMA IterationStatement: T_DO Statement T_WHILE T_LPAREN Expression T_RPAREN T_SEMICOLON ; /. case $rule_number: { - AST::DoWhileStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(5).Expression); + AST::DoWhileStatement *node = new (pool) AST::DoWhileStatement(sym(2).Statement, sym(5).Expression); node->doToken = loc(1); node->whileToken = loc(3); node->lparenToken = loc(4); @@ -2443,7 +2444,7 @@ case $rule_number: { IterationStatement: T_WHILE T_LPAREN Expression T_RPAREN Statement ; /. case $rule_number: { - AST::WhileStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::WhileStatement *node = new (pool) AST::WhileStatement(sym(3).Expression, sym(5).Statement); node->whileToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -2454,7 +2455,7 @@ case $rule_number: { IterationStatement: T_FOR T_LPAREN ExpressionNotInOpt T_SEMICOLON ExpressionOpt T_SEMICOLON ExpressionOpt T_RPAREN Statement ; /. case $rule_number: { - AST::ForStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, + AST::ForStatement *node = new (pool) AST::ForStatement(sym(3).Expression, sym(5).Expression, sym(7).Expression, sym(9).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -2468,7 +2469,7 @@ case $rule_number: { IterationStatement: T_FOR T_LPAREN T_VAR VariableDeclarationListNotIn T_SEMICOLON ExpressionOpt T_SEMICOLON ExpressionOpt T_RPAREN Statement ; /. case $rule_number: { - AST::LocalForStatement *node = makeAstNode (driver->nodePool(), + AST::LocalForStatement *node = new (pool) AST::LocalForStatement( sym(4).VariableDeclarationList->finish (/*readOnly=*/false), sym(6).Expression, sym(8).Expression, sym(10).Statement); node->forToken = loc(1); @@ -2484,7 +2485,7 @@ case $rule_number: { IterationStatement: T_FOR T_LPAREN LeftHandSideExpression T_IN Expression T_RPAREN Statement ; /. case $rule_number: { - AST:: ForEachStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, + AST:: ForEachStatement *node = new (pool) AST::ForEachStatement(sym(3).Expression, sym(5).Expression, sym(7).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -2497,7 +2498,7 @@ case $rule_number: { IterationStatement: T_FOR T_LPAREN T_VAR VariableDeclarationNotIn T_IN Expression T_RPAREN Statement ; /. case $rule_number: { - AST::LocalForEachStatement *node = makeAstNode (driver->nodePool(), + AST::LocalForEachStatement *node = new (pool) AST::LocalForEachStatement( sym(4).VariableDeclaration, sym(6).Expression, sym(8).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -2512,7 +2513,7 @@ ContinueStatement: T_CONTINUE T_AUTOMATIC_SEMICOLON ; -- automatic semicolon ContinueStatement: T_CONTINUE T_SEMICOLON ; /. case $rule_number: { - AST::ContinueStatement *node = makeAstNode (driver->nodePool()); + AST::ContinueStatement *node = new (pool) AST::ContinueStatement(); node->continueToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; @@ -2523,7 +2524,7 @@ ContinueStatement: T_CONTINUE JsIdentifier T_AUTOMATIC_SEMICOLON ; -- automatic ContinueStatement: T_CONTINUE JsIdentifier T_SEMICOLON ; /. case $rule_number: { - AST::ContinueStatement *node = makeAstNode (driver->nodePool(), stringRef(2)); + AST::ContinueStatement *node = new (pool) AST::ContinueStatement(stringRef(2)); node->continueToken = loc(1); node->identifierToken = loc(2); node->semicolonToken = loc(3); @@ -2535,7 +2536,7 @@ BreakStatement: T_BREAK T_AUTOMATIC_SEMICOLON ; -- automatic semicolon BreakStatement: T_BREAK T_SEMICOLON ; /. case $rule_number: { - AST::BreakStatement *node = makeAstNode (driver->nodePool(), QStringRef()); + AST::BreakStatement *node = new (pool) AST::BreakStatement(QStringRef()); node->breakToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; @@ -2546,7 +2547,7 @@ BreakStatement: T_BREAK JsIdentifier T_AUTOMATIC_SEMICOLON ; -- automatic semic BreakStatement: T_BREAK JsIdentifier T_SEMICOLON ; /. case $rule_number: { - AST::BreakStatement *node = makeAstNode (driver->nodePool(), stringRef(2)); + AST::BreakStatement *node = new (pool) AST::BreakStatement(stringRef(2)); node->breakToken = loc(1); node->identifierToken = loc(2); node->semicolonToken = loc(3); @@ -2558,7 +2559,7 @@ ReturnStatement: T_RETURN ExpressionOpt T_AUTOMATIC_SEMICOLON ; -- automatic se ReturnStatement: T_RETURN ExpressionOpt T_SEMICOLON ; /. case $rule_number: { - AST::ReturnStatement *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::ReturnStatement *node = new (pool) AST::ReturnStatement(sym(2).Expression); node->returnToken = loc(1); node->semicolonToken = loc(3); sym(1).Node = node; @@ -2568,7 +2569,7 @@ case $rule_number: { WithStatement: T_WITH T_LPAREN Expression T_RPAREN Statement ; /. case $rule_number: { - AST::WithStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::WithStatement *node = new (pool) AST::WithStatement(sym(3).Expression, sym(5).Statement); node->withToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -2579,7 +2580,7 @@ case $rule_number: { SwitchStatement: T_SWITCH T_LPAREN Expression T_RPAREN CaseBlock ; /. case $rule_number: { - AST::SwitchStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).CaseBlock); + AST::SwitchStatement *node = new (pool) AST::SwitchStatement(sym(3).Expression, sym(5).CaseBlock); node->switchToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -2590,7 +2591,7 @@ case $rule_number: { CaseBlock: T_LBRACE CaseClausesOpt T_RBRACE ; /. case $rule_number: { - AST::CaseBlock *node = makeAstNode (driver->nodePool(), sym(2).CaseClauses); + AST::CaseBlock *node = new (pool) AST::CaseBlock(sym(2).CaseClauses); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; @@ -2600,7 +2601,7 @@ case $rule_number: { CaseBlock: T_LBRACE CaseClausesOpt DefaultClause CaseClausesOpt T_RBRACE ; /. case $rule_number: { - AST::CaseBlock *node = makeAstNode (driver->nodePool(), sym(2).CaseClauses, sym(3).DefaultClause, sym(4).CaseClauses); + AST::CaseBlock *node = new (pool) AST::CaseBlock(sym(2).CaseClauses, sym(3).DefaultClause, sym(4).CaseClauses); node->lbraceToken = loc(1); node->rbraceToken = loc(5); sym(1).Node = node; @@ -2610,14 +2611,14 @@ case $rule_number: { CaseClauses: CaseClause ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).CaseClause); + sym(1).Node = new (pool) AST::CaseClauses(sym(1).CaseClause); } break; ./ CaseClauses: CaseClauses CaseClause ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).CaseClauses, sym(2).CaseClause); + sym(1).Node = new (pool) AST::CaseClauses(sym(1).CaseClauses, sym(2).CaseClause); } break; ./ @@ -2638,7 +2639,7 @@ case $rule_number: { CaseClause: T_CASE Expression T_COLON StatementListOpt ; /. case $rule_number: { - AST::CaseClause *node = makeAstNode (driver->nodePool(), sym(2).Expression, sym(4).StatementList); + AST::CaseClause *node = new (pool) AST::CaseClause(sym(2).Expression, sym(4).StatementList); node->caseToken = loc(1); node->colonToken = loc(3); sym(1).Node = node; @@ -2648,7 +2649,7 @@ case $rule_number: { DefaultClause: T_DEFAULT T_COLON StatementListOpt ; /. case $rule_number: { - AST::DefaultClause *node = makeAstNode (driver->nodePool(), sym(3).StatementList); + AST::DefaultClause *node = new (pool) AST::DefaultClause(sym(3).StatementList); node->defaultToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; @@ -2661,7 +2662,7 @@ LabelledStatement: T_SIGNAL T_COLON Statement ; LabelledStatement: T_PROPERTY T_COLON Statement ; /. case $rule_number: { - AST::LabelledStatement *node = makeAstNode (driver->nodePool(), stringRef(1), sym(3).Statement); + AST::LabelledStatement *node = new (pool) AST::LabelledStatement(stringRef(1), sym(3).Statement); node->identifierToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; @@ -2671,7 +2672,7 @@ case $rule_number: { LabelledStatement: T_IDENTIFIER T_COLON Statement ; /. case $rule_number: { - AST::LabelledStatement *node = makeAstNode (driver->nodePool(), stringRef(1), sym(3).Statement); + AST::LabelledStatement *node = new (pool) AST::LabelledStatement(stringRef(1), sym(3).Statement); node->identifierToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; @@ -2682,7 +2683,7 @@ ThrowStatement: T_THROW Expression T_AUTOMATIC_SEMICOLON ; -- automatic semicol ThrowStatement: T_THROW Expression T_SEMICOLON ; /. case $rule_number: { - AST::ThrowStatement *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::ThrowStatement *node = new (pool) AST::ThrowStatement(sym(2).Expression); node->throwToken = loc(1); node->semicolonToken = loc(3); sym(1).Node = node; @@ -2692,7 +2693,7 @@ case $rule_number: { TryStatement: T_TRY Block Catch ; /. case $rule_number: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Catch); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Catch); node->tryToken = loc(1); sym(1).Node = node; } break; @@ -2701,7 +2702,7 @@ case $rule_number: { TryStatement: T_TRY Block Finally ; /. case $rule_number: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Finally); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Finally); node->tryToken = loc(1); sym(1).Node = node; } break; @@ -2710,7 +2711,7 @@ case $rule_number: { TryStatement: T_TRY Block Catch Finally ; /. case $rule_number: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Catch, sym(4).Finally); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Catch, sym(4).Finally); node->tryToken = loc(1); sym(1).Node = node; } break; @@ -2719,7 +2720,7 @@ case $rule_number: { Catch: T_CATCH T_LPAREN JsIdentifier T_RPAREN Block ; /. case $rule_number: { - AST::Catch *node = makeAstNode (driver->nodePool(), stringRef(3), sym(5).Block); + AST::Catch *node = new (pool) AST::Catch(stringRef(3), sym(5).Block); node->catchToken = loc(1); node->lparenToken = loc(2); node->identifierToken = loc(3); @@ -2731,7 +2732,7 @@ case $rule_number: { Finally: T_FINALLY Block ; /. case $rule_number: { - AST::Finally *node = makeAstNode (driver->nodePool(), sym(2).Block); + AST::Finally *node = new (pool) AST::Finally(sym(2).Block); node->finallyToken = loc(1); sym(1).Node = node; } break; @@ -2741,7 +2742,7 @@ DebuggerStatement: T_DEBUGGER T_AUTOMATIC_SEMICOLON ; -- automatic semicolon DebuggerStatement: T_DEBUGGER T_SEMICOLON ; /. case $rule_number: { - AST::DebuggerStatement *node = makeAstNode (driver->nodePool()); + AST::DebuggerStatement *node = new (pool) AST::DebuggerStatement(); node->debuggerToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; @@ -2751,7 +2752,7 @@ case $rule_number: { FunctionDeclaration: T_FUNCTION JsIdentifier T_LPAREN FormalParameterListOpt T_RPAREN T_LBRACE FunctionBodyOpt T_RBRACE ; /. case $rule_number: { - AST::FunctionDeclaration *node = makeAstNode (driver->nodePool(), stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); + AST::FunctionDeclaration *node = new (pool) AST::FunctionDeclaration(stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); node->functionToken = loc(1); node->identifierToken = loc(2); node->lparenToken = loc(3); @@ -2765,7 +2766,7 @@ case $rule_number: { FunctionExpression: T_FUNCTION IdentifierOpt T_LPAREN FormalParameterListOpt T_RPAREN T_LBRACE FunctionBodyOpt T_RBRACE ; /. case $rule_number: { - AST::FunctionExpression *node = makeAstNode (driver->nodePool(), stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); + AST::FunctionExpression *node = new (pool) AST::FunctionExpression(stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); node->functionToken = loc(1); if (! stringRef(2).isNull()) node->identifierToken = loc(2); @@ -2780,7 +2781,7 @@ case $rule_number: { FormalParameterList: JsIdentifier ; /. case $rule_number: { - AST::FormalParameterList *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::FormalParameterList *node = new (pool) AST::FormalParameterList(stringRef(1)); node->identifierToken = loc(1); sym(1).Node = node; } break; @@ -2789,7 +2790,7 @@ case $rule_number: { FormalParameterList: FormalParameterList T_COMMA JsIdentifier ; /. case $rule_number: { - AST::FormalParameterList *node = makeAstNode (driver->nodePool(), sym(1).FormalParameterList, stringRef(3)); + AST::FormalParameterList *node = new (pool) AST::FormalParameterList(sym(1).FormalParameterList, stringRef(3)); node->commaToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; @@ -2822,42 +2823,42 @@ FunctionBodyOpt: FunctionBody ; FunctionBody: SourceElements ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements->finish ()); + sym(1).Node = new (pool) AST::FunctionBody(sym(1).SourceElements->finish ()); } break; ./ Program: SourceElements ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements->finish ()); + sym(1).Node = new (pool) AST::Program(sym(1).SourceElements->finish ()); } break; ./ SourceElements: SourceElement ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElement); + sym(1).Node = new (pool) AST::SourceElements(sym(1).SourceElement); } break; ./ SourceElements: SourceElements SourceElement ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements, sym(2).SourceElement); + sym(1).Node = new (pool) AST::SourceElements(sym(1).SourceElements, sym(2).SourceElement); } break; ./ SourceElement: Statement ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Statement); + sym(1).Node = new (pool) AST::StatementSourceElement(sym(1).Statement); } break; ./ SourceElement: FunctionDeclaration ; /. case $rule_number: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).FunctionDeclaration); + sym(1).Node = new (pool) AST::FunctionSourceElement(sym(1).FunctionDeclaration); } break; ./ diff --git a/src/declarative/qml/parser/qdeclarativejsast_p.h b/src/declarative/qml/parser/qdeclarativejsast_p.h index 9794f38..b2c441d 100644 --- a/src/declarative/qml/parser/qdeclarativejsast_p.h +++ b/src/declarative/qml/parser/qdeclarativejsast_p.h @@ -55,6 +55,7 @@ #include "qdeclarativejsastvisitor_p.h" #include "qdeclarativejsglobal_p.h" +#include "qdeclarativejsmemorypool_p.h" #include @@ -119,7 +120,7 @@ _T1 cast(_T2 *ast) return 0; } -class QML_PARSER_EXPORT Node +class QML_PARSER_EXPORT Node: public Managed { public: enum Kind { @@ -2138,11 +2139,11 @@ public: QDECLARATIVEJS_DECLARE_AST_NODE(UiImport) UiImport(const QStringRef &fileName) - : fileName(fileName), importUri(0), importId(0) + : fileName(fileName), importUri(0) { kind = K; } UiImport(UiQualifiedId *uri) - : fileName(0), importUri(uri), importId(0) + : importUri(uri) { kind = K; } virtual SourceLocation firstSourceLocation() const @@ -2342,13 +2343,13 @@ public: UiPublicMember(const QStringRef &memberType, const QStringRef &name) - : type(Property), typeModifier(0), memberType(memberType), name(name), statement(0), binding(0), isDefaultMember(false), isReadonlyMember(false), parameters(0) + : type(Property), memberType(memberType), name(name), statement(0), binding(0), isDefaultMember(false), isReadonlyMember(false), parameters(0) { kind = K; } UiPublicMember(const QStringRef &memberType, const QStringRef &name, Statement *statement) - : type(Property), typeModifier(0), memberType(memberType), name(name), statement(statement), binding(0), isDefaultMember(false), isReadonlyMember(false), parameters(0) + : type(Property), memberType(memberType), name(name), statement(statement), binding(0), isDefaultMember(false), isReadonlyMember(false), parameters(0) { kind = K; } virtual SourceLocation firstSourceLocation() const diff --git a/src/declarative/qml/parser/qdeclarativejsengine_p.cpp b/src/declarative/qml/parser/qdeclarativejsengine_p.cpp index 3db4a44..ad68080 100644 --- a/src/declarative/qml/parser/qdeclarativejsengine_p.cpp +++ b/src/declarative/qml/parser/qdeclarativejsengine_p.cpp @@ -40,9 +40,7 @@ ****************************************************************************/ #include "qdeclarativejsengine_p.h" - #include "qdeclarativejsglobal_p.h" -#include "qdeclarativejsnodepool_p.h" #include #include @@ -52,22 +50,6 @@ QT_QML_BEGIN_NAMESPACE namespace QDeclarativeJS { -NodePool::NodePool(const QString &fileName, Engine *engine) - : m_fileName(fileName), m_engine(engine) -{ - m_engine->setNodePool(this); -} - -NodePool::~NodePool() -{ -} - -Code *NodePool::createCompiledCode(AST::Node *, CompilationUnit &) -{ - Q_ASSERT(0); - return 0; -} - static int toDigit(char c) { if ((c >= '0') && (c <= '9')) @@ -140,7 +122,7 @@ double integerFromString(const QString &str, int radix) Engine::Engine() - : _lexer(0), _nodePool(0) + : _lexer(0) { } Engine::~Engine() @@ -161,11 +143,8 @@ Lexer *Engine::lexer() const void Engine::setLexer(Lexer *lexer) { _lexer = lexer; } -NodePool *Engine::nodePool() const -{ return _nodePool; } - -void Engine::setNodePool(NodePool *nodePool) -{ _nodePool = nodePool; } +MemoryPool *Engine::pool() +{ return &_pool; } QStringRef Engine::midRef(int position, int size) { return _code.midRef(position, size); } diff --git a/src/declarative/qml/parser/qdeclarativejsengine_p.h b/src/declarative/qml/parser/qdeclarativejsengine_p.h index 20abd55..d88a52b 100644 --- a/src/declarative/qml/parser/qdeclarativejsengine_p.h +++ b/src/declarative/qml/parser/qdeclarativejsengine_p.h @@ -55,6 +55,7 @@ #include "qdeclarativejsglobal_p.h" #include "qdeclarativejsastfwd_p.h" +#include "qdeclarativejsmemorypool_p.h" #include #include @@ -64,7 +65,7 @@ QT_QML_BEGIN_NAMESPACE namespace QDeclarativeJS { class Lexer; -class NodePool; +class MemoryPool; class QML_PARSER_EXPORT DiagnosticMessage { @@ -91,7 +92,7 @@ public: class QML_PARSER_EXPORT Engine { Lexer *_lexer; - NodePool *_nodePool; + MemoryPool _pool; QList _comments; QString _extraCode; QString _code; @@ -108,8 +109,7 @@ public: Lexer *lexer() const; void setLexer(Lexer *lexer); - NodePool *nodePool() const; - void setNodePool(NodePool *nodePool); + MemoryPool *pool(); QStringRef midRef(int position, int size); diff --git a/src/declarative/qml/parser/qdeclarativejslexer.cpp b/src/declarative/qml/parser/qdeclarativejslexer.cpp index 570548c..6c6338b 100644 --- a/src/declarative/qml/parser/qdeclarativejslexer.cpp +++ b/src/declarative/qml/parser/qdeclarativejslexer.cpp @@ -41,7 +41,8 @@ #include "qdeclarativejslexer_p.h" #include "qdeclarativejsengine_p.h" -#include "qdeclarativejsnodepool_p.h" +#include "qdeclarativejsmemorypool_p.h" + #include #include #include diff --git a/src/declarative/qml/parser/qdeclarativejsmemorypool_p.h b/src/declarative/qml/parser/qdeclarativejsmemorypool_p.h index 8d61dbe..e921ac6 100644 --- a/src/declarative/qml/parser/qdeclarativejsmemorypool_p.h +++ b/src/declarative/qml/parser/qdeclarativejsmemorypool_p.h @@ -93,7 +93,6 @@ public: m_storage = reinterpret_cast(qRealloc(m_storage, sizeof(char*) * (1 + m_blockIndex))); m_currentBlock = m_storage[m_blockIndex] = reinterpret_cast(qMalloc(m_currentBlockSize)); - ::memset(m_currentBlock, 0, m_currentBlockSize); m_currentIndex = (8 - quintptr(m_currentBlock)) & 7; // ensure first chunk is 64-bit aligned Q_ASSERT(m_currentIndex + bytes <= m_currentBlockSize); @@ -126,6 +125,20 @@ private: Q_DISABLE_COPY(MemoryPool) }; +class QML_PARSER_EXPORT Managed +{ + Managed(const Managed &other); + void operator = (const Managed &other); + +public: + Managed() {} + ~Managed() {} + + void *operator new(size_t size, MemoryPool *pool) { return pool->allocate(size); } + void operator delete(void *) {} + void operator delete(void *, MemoryPool *) {} +}; + } // namespace QDeclarativeJS QT_QML_END_NAMESPACE diff --git a/src/declarative/qml/parser/qdeclarativejsnodepool_p.h b/src/declarative/qml/parser/qdeclarativejsnodepool_p.h deleted file mode 100644 index 401500c..0000000 --- a/src/declarative/qml/parser/qdeclarativejsnodepool_p.h +++ /dev/null @@ -1,139 +0,0 @@ -/**************************************************************************** -** -** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies). -** All rights reserved. -** Contact: Nokia Corporation (qt-info@nokia.com) -** -** This file is part of the QtDeclarative module of the Qt Toolkit. -** -** $QT_BEGIN_LICENSE:LGPL$ -** GNU Lesser General Public License Usage -** This file may be used under the terms of the GNU Lesser General Public -** License version 2.1 as published by the Free Software Foundation and -** appearing in the file LICENSE.LGPL included in the packaging of this -** file. Please review the following information to ensure the GNU Lesser -** General Public License version 2.1 requirements will be met: -** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. -** -** In addition, as a special exception, Nokia gives you certain additional -** rights. These rights are described in the Nokia Qt LGPL Exception -** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. -** -** GNU General Public License Usage -** Alternatively, this file may be used under the terms of the GNU General -** Public License version 3.0 as published by the Free Software Foundation -** and appearing in the file LICENSE.GPL included in the packaging of this -** file. Please review the following information to ensure the GNU General -** Public License version 3.0 requirements will be met: -** http://www.gnu.org/copyleft/gpl.html. -** -** Other Usage -** Alternatively, this file may be used in accordance with the terms and -** conditions contained in a signed written agreement between you and Nokia. -** -** -** -** -** -** $QT_END_LICENSE$ -** -****************************************************************************/ - -#ifndef QDECLARATIVEJSNODEPOOL_P_H -#define QDECLARATIVEJSNODEPOOL_P_H - -// -// W A R N I N G -// ------------- -// -// This file is not part of the Qt API. It exists purely as an -// implementation detail. This header file may change from version to -// version without notice, or even be removed. -// -// We mean it. -// - -#include "qdeclarativejsglobal_p.h" -#include "qdeclarativejsmemorypool_p.h" - -#include -#include - -QT_QML_BEGIN_NAMESPACE - -namespace QDeclarativeJS { - -namespace AST { -class Node; -} // namespace AST - -class Code; -class CompilationUnit; -class Engine; - -template -inline NodeType *makeAstNode(MemoryPool *storage) -{ - NodeType *node = new (storage->allocate(sizeof(NodeType))) NodeType(); - return node; -} - -template -inline NodeType *makeAstNode(MemoryPool *storage, Arg1 arg1) -{ - NodeType *node = new (storage->allocate(sizeof(NodeType))) NodeType(arg1); - return node; -} - -template -inline NodeType *makeAstNode(MemoryPool *storage, Arg1 arg1, Arg2 arg2) -{ - NodeType *node = new (storage->allocate(sizeof(NodeType))) NodeType(arg1, arg2); - return node; -} - -template -inline NodeType *makeAstNode(MemoryPool *storage, Arg1 arg1, Arg2 arg2, Arg3 arg3) -{ - NodeType *node = new (storage->allocate(sizeof(NodeType))) NodeType(arg1, arg2, arg3); - return node; -} - -template -inline NodeType *makeAstNode(MemoryPool *storage, Arg1 arg1, Arg2 arg2, Arg3 arg3, Arg4 arg4) -{ - NodeType *node = new (storage->allocate(sizeof(NodeType))) NodeType(arg1, arg2, arg3, arg4); - return node; -} - -class QML_PARSER_EXPORT NodePool : public MemoryPool -{ -public: - NodePool(const QString &fileName, Engine *engine); - virtual ~NodePool(); - - Code *createCompiledCode(AST::Node *node, CompilationUnit &compilation); - - inline QString fileName() const { return m_fileName; } - inline Engine *engine() const { return m_engine; } -#ifndef J_SCRIPT_NO_EVENT_NOTIFY - inline qint64 id() const { return m_id; } -#endif - -private: - QHash m_codeCache; - QString m_fileName; - Engine *m_engine; -#ifndef J_SCRIPT_NO_EVENT_NOTIFY - qint64 m_id; -#endif - -private: - Q_DISABLE_COPY(NodePool) -}; - -} // namespace QDeclarativeJS - -QT_QML_END_NAMESPACE - -#endif diff --git a/src/declarative/qml/parser/qdeclarativejsparser.cpp b/src/declarative/qml/parser/qdeclarativejsparser.cpp index 309d07c..83d4010 100644 --- a/src/declarative/qml/parser/qdeclarativejsparser.cpp +++ b/src/declarative/qml/parser/qdeclarativejsparser.cpp @@ -47,7 +47,7 @@ #include "qdeclarativejsengine_p.h" #include "qdeclarativejslexer_p.h" #include "qdeclarativejsast_p.h" -#include "qdeclarativejsnodepool_p.h" +#include "qdeclarativejsmemorypool_p.h" @@ -86,6 +86,7 @@ inline static bool automatic(Engine *driver, int token) Parser::Parser(Engine *engine): driver(engine), + pool(engine->pool()), tos(0), stack_size(0), sym_stack(0), @@ -130,12 +131,12 @@ AST::UiQualifiedId *Parser::reparseAsQualifiedId(AST::ExpressionNode *expr) } if (AST::IdentifierExpression *idExpr = AST::cast(it)) { - AST::UiQualifiedId *q = makeAstNode(driver->nodePool(), idExpr->name); + AST::UiQualifiedId *q = new (pool) AST::UiQualifiedId(idExpr->name); q->identifierToken = idExpr->identifierToken; AST::UiQualifiedId *currentId = q; for (int i = nameIds.size() - 1; i != -1; --i) { - currentId = makeAstNode(driver->nodePool(), currentId, nameIds[i]); + currentId = new (pool) AST::UiQualifiedId(currentId, nameIds[i]); currentId->identifierToken = locations[i]; } @@ -231,7 +232,7 @@ case 5: { } break; case 6: { - sym(1).UiProgram = makeAstNode (driver->nodePool(), sym(1).UiImportList, + sym(1).UiProgram = new (pool) AST::UiProgram(sym(1).UiImportList, sym(2).UiObjectMemberList->finish()); } break; @@ -240,12 +241,11 @@ case 8: { } break; case 9: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiImport); + sym(1).Node = new (pool) AST::UiImportList(sym(1).UiImport); } break; case 10: { - sym(1).Node = makeAstNode (driver->nodePool(), - sym(1).UiImportList, sym(2).UiImport); + sym(1).Node = new (pool) AST::UiImportList(sym(1).UiImportList, sym(2).UiImport); } break; case 13: { @@ -276,10 +276,10 @@ case 20: { AST::UiImport *node = 0; if (AST::StringLiteral *importIdLiteral = AST::cast(sym(2).Expression)) { - node = makeAstNode(driver->nodePool(), importIdLiteral->value); + node = new (pool) AST::UiImport(importIdLiteral->value); node->fileNameToken = loc(2); } else if (AST::UiQualifiedId *qualifiedId = reparseAsQualifiedId(sym(2).Expression)) { - node = makeAstNode(driver->nodePool(), qualifiedId); + node = new (pool) AST::UiImport(qualifiedId); node->fileNameToken = loc(2); } @@ -300,52 +300,52 @@ case 21: { } break; case 22: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiObjectMemberList(sym(1).UiObjectMember); } break; case 23: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiObjectMemberList(sym(1).UiObjectMember); } break; case 24: { - AST::UiObjectMemberList *node = makeAstNode (driver->nodePool(), + AST::UiObjectMemberList *node = new (pool) AST:: UiObjectMemberList( sym(1).UiObjectMemberList, sym(2).UiObjectMember); sym(1).Node = node; } break; case 25: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).UiObjectMember); + sym(1).Node = new (pool) AST::UiArrayMemberList(sym(1).UiObjectMember); } break; case 26: { - AST::UiArrayMemberList *node = makeAstNode (driver->nodePool(), + AST::UiArrayMemberList *node = new (pool) AST::UiArrayMemberList( sym(1).UiArrayMemberList, sym(3).UiObjectMember); node->commaToken = loc(2); sym(1).Node = node; } break; case 27: { - AST::UiObjectInitializer *node = makeAstNode (driver->nodePool(), (AST::UiObjectMemberList*)0); + AST::UiObjectInitializer *node = new (pool) AST::UiObjectInitializer((AST::UiObjectMemberList*)0); node->lbraceToken = loc(1); node->rbraceToken = loc(2); sym(1).Node = node; } break; case 28: { - AST::UiObjectInitializer *node = makeAstNode (driver->nodePool(), sym(2).UiObjectMemberList->finish()); + AST::UiObjectInitializer *node = new (pool) AST::UiObjectInitializer(sym(2).UiObjectMemberList->finish()); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; } break; case 29: { - AST::UiObjectDefinition *node = makeAstNode (driver->nodePool(), sym(1).UiQualifiedId, + AST::UiObjectDefinition *node = new (pool) AST::UiObjectDefinition(sym(1).UiQualifiedId, sym(2).UiObjectInitializer); sym(1).Node = node; } break; case 31: { - AST::UiArrayBinding *node = makeAstNode (driver->nodePool(), + AST::UiArrayBinding *node = new (pool) AST::UiArrayBinding( sym(1).UiQualifiedId, sym(4).UiArrayMemberList->finish()); node->colonToken = loc(2); node->lbracketToken = loc(3); @@ -354,14 +354,14 @@ case 31: { } break; case 32: { - AST::UiObjectBinding *node = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *node = new (pool) AST::UiObjectBinding( sym(1).UiQualifiedId, sym(3).UiQualifiedId, sym(4).UiObjectInitializer); node->colonToken = loc(2); sym(1).Node = node; } break; case 33: { - AST::UiObjectBinding *node = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *node = new (pool) AST::UiObjectBinding( sym(3).UiQualifiedId, sym(1).UiQualifiedId, sym(4).UiObjectInitializer); node->colonToken = loc(2); node->hasOnToken = true; @@ -370,7 +370,7 @@ case 33: { case 38: { - AST::UiScriptBinding *node = makeAstNode (driver->nodePool(), + AST::UiScriptBinding *node = new (pool) AST::UiScriptBinding( sym(1).UiQualifiedId, sym(3).Statement); node->colonToken = loc(2); sym(1).Node = node; @@ -385,20 +385,20 @@ case 43: { } break; case 44: { - AST::UiParameterList *node = makeAstNode (driver->nodePool(), stringRef(1), stringRef(2)); + AST::UiParameterList *node = new (pool) AST::UiParameterList(stringRef(1), stringRef(2)); node->identifierToken = loc(2); sym(1).Node = node; } break; case 45: { - AST::UiParameterList *node = makeAstNode (driver->nodePool(), sym(1).UiParameterList, stringRef(3), stringRef(4)); + AST::UiParameterList *node = new (pool) AST::UiParameterList(sym(1).UiParameterList, stringRef(3), stringRef(4)); node->commaToken = loc(2); node->identifierToken = loc(4); sym(1).Node = node; } break; case 47: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), QStringRef(), stringRef(2)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(QStringRef(), stringRef(2)); node->type = AST::UiPublicMember::Signal; node->propertyToken = loc(1); node->typeToken = loc(2); @@ -409,7 +409,7 @@ case 47: { } break; case 49: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), QStringRef(), stringRef(2)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(QStringRef(), stringRef(2)); node->type = AST::UiPublicMember::Signal; node->propertyToken = loc(1); node->typeToken = loc(2); @@ -419,7 +419,7 @@ case 49: { } break; case 51: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(4), stringRef(6)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(4), stringRef(6)); node->typeModifier = stringRef(2); node->propertyToken = loc(1); node->typeModifierToken = loc(2); @@ -430,7 +430,7 @@ case 51: { } break; case 53: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3)); node->propertyToken = loc(1); node->typeToken = loc(2); node->identifierToken = loc(3); @@ -439,7 +439,7 @@ case 53: { } break; case 55: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4)); node->isDefaultMember = true; node->defaultToken = loc(1); node->propertyToken = loc(2); @@ -450,7 +450,7 @@ case 55: { } break; case 56: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3), sym(5).Statement); node->propertyToken = loc(1); node->typeToken = loc(2); @@ -460,7 +460,7 @@ case 56: { } break; case 57: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4), sym(6).Statement); node->isReadonlyMember = true; node->readonlyToken = loc(1); @@ -472,7 +472,7 @@ case 57: { } break; case 58: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(3), stringRef(4), + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(3), stringRef(4), sym(6).Statement); node->isDefaultMember = true; node->defaultToken = loc(1); @@ -484,7 +484,7 @@ case 58: { } break; case 59: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(4), stringRef(6)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(4), stringRef(6)); node->typeModifier = stringRef(2); node->propertyToken = loc(1); node->typeModifierToken = loc(2); @@ -492,11 +492,11 @@ case 59: { node->identifierToken = loc(6); node->semicolonToken = loc(7); // insert a fake ';' before ':' - AST::UiQualifiedId *propertyName = makeAstNode(driver->nodePool(), stringRef(6)); + AST::UiQualifiedId *propertyName = new (pool) AST::UiQualifiedId(stringRef(6)); propertyName->identifierToken = loc(6); propertyName->next = 0; - AST::UiArrayBinding *binding = makeAstNode (driver->nodePool(), + AST::UiArrayBinding *binding = new (pool) AST::UiArrayBinding( propertyName, sym(9).UiArrayMemberList->finish()); binding->colonToken = loc(7); binding->lbracketToken = loc(8); @@ -508,17 +508,17 @@ case 59: { } break; case 60: { - AST::UiPublicMember *node = makeAstNode (driver->nodePool(), stringRef(2), stringRef(3)); + AST::UiPublicMember *node = new (pool) AST::UiPublicMember(stringRef(2), stringRef(3)); node->propertyToken = loc(1); node->typeToken = loc(2); node->identifierToken = loc(3); node->semicolonToken = loc(4); // insert a fake ';' before ':' - AST::UiQualifiedId *propertyName = makeAstNode(driver->nodePool(), stringRef(3)); + AST::UiQualifiedId *propertyName = new (pool) AST::UiQualifiedId(stringRef(3)); propertyName->identifierToken = loc(3); propertyName->next = 0; - AST::UiObjectBinding *binding = makeAstNode (driver->nodePool(), + AST::UiObjectBinding *binding = new (pool) AST::UiObjectBinding( propertyName, sym(5).UiQualifiedId, sym(6).UiObjectInitializer); binding->colonToken = loc(4); @@ -528,51 +528,51 @@ case 60: { } break; case 61: { - sym(1).Node = makeAstNode(driver->nodePool(), sym(1).Node); + sym(1).Node = new (pool) AST::UiSourceElement(sym(1).Node); } break; case 62: { - sym(1).Node = makeAstNode(driver->nodePool(), sym(1).Node); + sym(1).Node = new (pool) AST::UiSourceElement(sym(1).Node); } break; case 68: { - AST::ThisExpression *node = makeAstNode (driver->nodePool()); + AST::ThisExpression *node = new (pool) AST::ThisExpression(); node->thisToken = loc(1); sym(1).Node = node; } break; case 69: { - AST::IdentifierExpression *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierExpression *node = new (pool) AST::IdentifierExpression(stringRef(1)); node->identifierToken = loc(1); sym(1).Node = node; } break; case 70: { - AST::NullExpression *node = makeAstNode (driver->nodePool()); + AST::NullExpression *node = new (pool) AST::NullExpression(); node->nullToken = loc(1); sym(1).Node = node; } break; case 71: { - AST::TrueLiteral *node = makeAstNode (driver->nodePool()); + AST::TrueLiteral *node = new (pool) AST::TrueLiteral(); node->trueToken = loc(1); sym(1).Node = node; } break; case 72: { - AST::FalseLiteral *node = makeAstNode (driver->nodePool()); + AST::FalseLiteral *node = new (pool) AST::FalseLiteral(); node->falseToken = loc(1); sym(1).Node = node; } break; case 73: { - AST::NumericLiteral *node = makeAstNode (driver->nodePool(), sym(1).dval); + AST::NumericLiteral *node = new (pool) AST::NumericLiteral(sym(1).dval); node->literalToken = loc(1); sym(1).Node = node; } break; case 74: case 75: { - AST::StringLiteral *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::StringLiteral *node = new (pool) AST::StringLiteral(stringRef(1)); node->literalToken = loc(1); sym(1).Node = node; } break; @@ -586,7 +586,7 @@ case 76: { loc(1).length = lexer->tokenLength(); - AST::RegExpLiteral *node = makeAstNode (driver->nodePool(), + AST::RegExpLiteral *node = new (pool) AST::RegExpLiteral( driver->newStringRef(lexer->regExpPattern()), lexer->regExpFlags()); node->literalToken = loc(1); sym(1).Node = node; @@ -601,35 +601,35 @@ case 77: { loc(1).length = lexer->tokenLength(); - AST::RegExpLiteral *node = makeAstNode (driver->nodePool(), + AST::RegExpLiteral *node = new (pool) AST::RegExpLiteral( driver->newStringRef(lexer->regExpPattern()), lexer->regExpFlags()); node->literalToken = loc(1); sym(1).Node = node; } break; case 78: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), (AST::Elision *) 0); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral((AST::Elision *) 0); node->lbracketToken = loc(1); node->rbracketToken = loc(2); sym(1).Node = node; } break; case 79: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).Elision->finish()); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).Elision->finish()); node->lbracketToken = loc(1); node->rbracketToken = loc(3); sym(1).Node = node; } break; case 80: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish ()); + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish ()); node->lbracketToken = loc(1); node->rbracketToken = loc(3); sym(1).Node = node; } break; case 81: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish (), + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish (), (AST::Elision *) 0); node->lbracketToken = loc(1); node->commaToken = loc(3); @@ -638,7 +638,7 @@ case 81: { } break; case 82: { - AST::ArrayLiteral *node = makeAstNode (driver->nodePool(), sym(2).ElementList->finish (), + AST::ArrayLiteral *node = new (pool) AST::ArrayLiteral(sym(2).ElementList->finish (), sym(4).Elision->finish()); node->lbracketToken = loc(1); node->commaToken = loc(3); @@ -649,17 +649,17 @@ case 82: { case 83: { AST::ObjectLiteral *node = 0; if (sym(2).Node) - node = makeAstNode (driver->nodePool(), + node = new (pool) AST::ObjectLiteral( sym(2).PropertyNameAndValueList->finish ()); else - node = makeAstNode (driver->nodePool()); + node = new (pool) AST::ObjectLiteral(); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; } break; case 84: { - AST::ObjectLiteral *node = makeAstNode (driver->nodePool(), + AST::ObjectLiteral *node = new (pool) AST::ObjectLiteral( sym(2).PropertyNameAndValueList->finish ()); node->lbraceToken = loc(1); node->rbraceToken = loc(4); @@ -667,7 +667,7 @@ case 84: { } break; case 85: { - AST::NestedExpression *node = makeAstNode(driver->nodePool(), sym(2).Expression); + AST::NestedExpression *node = new (pool) AST::NestedExpression(sym(2).Expression); node->lparenToken = loc(1); node->rparenToken = loc(3); sym(1).Node = node; @@ -694,48 +694,48 @@ case 86: { } break; case 87: { - sym(1).Node = makeAstNode (driver->nodePool(), (AST::Elision *) 0, sym(1).Expression); + sym(1).Node = new (pool) AST::ElementList((AST::Elision *) 0, sym(1).Expression); } break; case 88: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Elision->finish(), sym(2).Expression); + sym(1).Node = new (pool) AST::ElementList(sym(1).Elision->finish(), sym(2).Expression); } break; case 89: { - AST::ElementList *node = makeAstNode (driver->nodePool(), sym(1).ElementList, + AST::ElementList *node = new (pool) AST::ElementList(sym(1).ElementList, (AST::Elision *) 0, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; case 90: { - AST::ElementList *node = makeAstNode (driver->nodePool(), sym(1).ElementList, sym(3).Elision->finish(), + AST::ElementList *node = new (pool) AST::ElementList(sym(1).ElementList, sym(3).Elision->finish(), sym(4).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; case 91: { - AST::Elision *node = makeAstNode (driver->nodePool()); + AST::Elision *node = new (pool) AST::Elision(); node->commaToken = loc(1); sym(1).Node = node; } break; case 92: { - AST::Elision *node = makeAstNode (driver->nodePool(), sym(1).Elision); + AST::Elision *node = new (pool) AST::Elision(sym(1).Elision); node->commaToken = loc(2); sym(1).Node = node; } break; case 93: { - AST::PropertyNameAndValueList *node = makeAstNode (driver->nodePool(), + AST::PropertyNameAndValueList *node = new (pool) AST::PropertyNameAndValueList( sym(1).PropertyName, sym(3).Expression); node->colonToken = loc(2); sym(1).Node = node; } break; case 94: { - AST::PropertyNameAndValueList *node = makeAstNode (driver->nodePool(), + AST::PropertyNameAndValueList *node = new (pool) AST::PropertyNameAndValueList( sym(1).PropertyNameAndValueList, sym(3).PropertyName, sym(5).Expression); node->commaToken = loc(2); node->colonToken = loc(4); @@ -743,51 +743,51 @@ case 94: { } break; case 95: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; case 96: case 97: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; case 98: { - AST::StringLiteralPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::StringLiteralPropertyName *node = new (pool) AST::StringLiteralPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; case 99: { - AST::NumericLiteralPropertyName *node = makeAstNode (driver->nodePool(), sym(1).dval); + AST::NumericLiteralPropertyName *node = new (pool) AST::NumericLiteralPropertyName(sym(1).dval); node->propertyNameToken = loc(1); sym(1).Node = node; } break; case 100: { - AST::IdentifierPropertyName *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::IdentifierPropertyName *node = new (pool) AST::IdentifierPropertyName(stringRef(1)); node->propertyNameToken = loc(1); sym(1).Node = node; } break; case 136: { - AST::ArrayMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::ArrayMemberExpression *node = new (pool) AST::ArrayMemberExpression(sym(1).Expression, sym(3).Expression); node->lbracketToken = loc(2); node->rbracketToken = loc(4); sym(1).Node = node; } break; case 137: { - AST::FieldMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, stringRef(3)); + AST::FieldMemberExpression *node = new (pool) AST::FieldMemberExpression(sym(1).Expression, stringRef(3)); node->dotToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; } break; case 138: { - AST::NewMemberExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression, sym(4).ArgumentList); + AST::NewMemberExpression *node = new (pool) AST::NewMemberExpression(sym(2).Expression, sym(4).ArgumentList); node->newToken = loc(1); node->lparenToken = loc(3); node->rparenToken = loc(5); @@ -795,34 +795,34 @@ case 138: { } break; case 140: { - AST::NewExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::NewExpression *node = new (pool) AST::NewExpression(sym(2).Expression); node->newToken = loc(1); sym(1).Node = node; } break; case 141: { - AST::CallExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).ArgumentList); + AST::CallExpression *node = new (pool) AST::CallExpression(sym(1).Expression, sym(3).ArgumentList); node->lparenToken = loc(2); node->rparenToken = loc(4); sym(1).Node = node; } break; case 142: { - AST::CallExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).ArgumentList); + AST::CallExpression *node = new (pool) AST::CallExpression(sym(1).Expression, sym(3).ArgumentList); node->lparenToken = loc(2); node->rparenToken = loc(4); sym(1).Node = node; } break; case 143: { - AST::ArrayMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::ArrayMemberExpression *node = new (pool) AST::ArrayMemberExpression(sym(1).Expression, sym(3).Expression); node->lbracketToken = loc(2); node->rbracketToken = loc(4); sym(1).Node = node; } break; case 144: { - AST::FieldMemberExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, stringRef(3)); + AST::FieldMemberExpression *node = new (pool) AST::FieldMemberExpression(sym(1).Expression, stringRef(3)); node->dotToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; @@ -837,342 +837,342 @@ case 146: { } break; case 147: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Expression); + sym(1).Node = new (pool) AST::ArgumentList(sym(1).Expression); } break; case 148: { - AST::ArgumentList *node = makeAstNode (driver->nodePool(), sym(1).ArgumentList, sym(3).Expression); + AST::ArgumentList *node = new (pool) AST::ArgumentList(sym(1).ArgumentList, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; case 152: { - AST::PostIncrementExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::PostIncrementExpression *node = new (pool) AST::PostIncrementExpression(sym(1).Expression); node->incrementToken = loc(2); sym(1).Node = node; } break; case 153: { - AST::PostDecrementExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::PostDecrementExpression *node = new (pool) AST::PostDecrementExpression(sym(1).Expression); node->decrementToken = loc(2); sym(1).Node = node; } break; case 155: { - AST::DeleteExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::DeleteExpression *node = new (pool) AST::DeleteExpression(sym(2).Expression); node->deleteToken = loc(1); sym(1).Node = node; } break; case 156: { - AST::VoidExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::VoidExpression *node = new (pool) AST::VoidExpression(sym(2).Expression); node->voidToken = loc(1); sym(1).Node = node; } break; case 157: { - AST::TypeOfExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::TypeOfExpression *node = new (pool) AST::TypeOfExpression(sym(2).Expression); node->typeofToken = loc(1); sym(1).Node = node; } break; case 158: { - AST::PreIncrementExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::PreIncrementExpression *node = new (pool) AST::PreIncrementExpression(sym(2).Expression); node->incrementToken = loc(1); sym(1).Node = node; } break; case 159: { - AST::PreDecrementExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::PreDecrementExpression *node = new (pool) AST::PreDecrementExpression(sym(2).Expression); node->decrementToken = loc(1); sym(1).Node = node; } break; case 160: { - AST::UnaryPlusExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::UnaryPlusExpression *node = new (pool) AST::UnaryPlusExpression(sym(2).Expression); node->plusToken = loc(1); sym(1).Node = node; } break; case 161: { - AST::UnaryMinusExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::UnaryMinusExpression *node = new (pool) AST::UnaryMinusExpression(sym(2).Expression); node->minusToken = loc(1); sym(1).Node = node; } break; case 162: { - AST::TildeExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::TildeExpression *node = new (pool) AST::TildeExpression(sym(2).Expression); node->tildeToken = loc(1); sym(1).Node = node; } break; case 163: { - AST::NotExpression *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::NotExpression *node = new (pool) AST::NotExpression(sym(2).Expression); node->notToken = loc(1); sym(1).Node = node; } break; case 165: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Mul, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 166: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Div, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 167: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Mod, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 169: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Add, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 170: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Sub, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 172: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::LShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 173: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::RShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 174: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::URShift, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 176: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Lt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 177: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Gt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 178: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Le, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 179: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Ge, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 180: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::InstanceOf, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 181: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::In, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 183: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Lt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 184: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Gt, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 185: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Le, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 186: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Ge, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 187: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::InstanceOf, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 189: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Equal, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 190: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::NotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 191: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 192: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictNotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 194: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Equal, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 195: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::NotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 196: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 197: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::StrictNotEqual, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 199: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitAnd, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 201: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitAnd, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 203: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitXor, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 205: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitXor, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 207: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitOr, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 209: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::BitOr, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 211: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::And, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 213: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::And, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 215: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Or, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 217: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, QSOperator::Or, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 219: { - AST::ConditionalExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::ConditionalExpression *node = new (pool) AST::ConditionalExpression(sym(1).Expression, sym(3).Expression, sym(5).Expression); node->questionToken = loc(2); node->colonToken = loc(4); @@ -1180,7 +1180,7 @@ case 219: { } break; case 221: { - AST::ConditionalExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::ConditionalExpression *node = new (pool) AST::ConditionalExpression(sym(1).Expression, sym(3).Expression, sym(5).Expression); node->questionToken = loc(2); node->colonToken = loc(4); @@ -1188,14 +1188,14 @@ case 221: { } break; case 223: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, sym(2).ival, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; } break; case 225: { - AST::BinaryExpression *node = makeAstNode (driver->nodePool(), sym(1).Expression, + AST::BinaryExpression *node = new (pool) AST::BinaryExpression(sym(1).Expression, sym(2).ival, sym(3).Expression); node->operatorToken = loc(2); sym(1).Node = node; @@ -1250,7 +1250,7 @@ case 237: { } break; case 239: { - AST::Expression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::Expression *node = new (pool) AST::Expression(sym(1).Expression, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -1260,7 +1260,7 @@ case 240: { } break; case 243: { - AST::Expression *node = makeAstNode (driver->nodePool(), sym(1).Expression, sym(3).Expression); + AST::Expression *node = new (pool) AST::Expression(sym(1).Expression, sym(3).Expression); node->commaToken = loc(2); sym(1).Node = node; } break; @@ -1270,18 +1270,18 @@ case 244: { } break; case 261: { - AST::Block *node = makeAstNode (driver->nodePool(), sym(2).StatementList); + AST::Block *node = new (pool) AST::Block(sym(2).StatementList); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; } break; case 262: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Statement); + sym(1).Node = new (pool) AST::StatementList(sym(1).Statement); } break; case 263: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).StatementList, sym(2).Statement); + sym(1).Node = new (pool) AST::StatementList(sym(1).StatementList, sym(2).Statement); } break; case 264: { @@ -1293,7 +1293,7 @@ case 265: { } break; case 267: { - AST::VariableStatement *node = makeAstNode (driver->nodePool(), + AST::VariableStatement *node = new (pool) AST::VariableStatement( sym(2).VariableDeclarationList->finish (/*readOnly=*/sym(1).ival == T_CONST)); node->declarationKindToken = loc(1); node->semicolonToken = loc(3); @@ -1309,32 +1309,32 @@ case 269: { } break; case 270: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclaration); } break; case 271: { - AST::VariableDeclarationList *node = makeAstNode (driver->nodePool(), + AST::VariableDeclarationList *node = new (pool) AST::VariableDeclarationList( sym(1).VariableDeclarationList, sym(3).VariableDeclaration); node->commaToken = loc(2); sym(1).Node = node; } break; case 272: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclaration); } break; case 273: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).VariableDeclarationList, sym(3).VariableDeclaration); + sym(1).Node = new (pool) AST::VariableDeclarationList(sym(1).VariableDeclarationList, sym(3).VariableDeclaration); } break; case 274: { - AST::VariableDeclaration *node = makeAstNode (driver->nodePool(), stringRef(1), sym(2).Expression); + AST::VariableDeclaration *node = new (pool) AST::VariableDeclaration(stringRef(1), sym(2).Expression); node->identifierToken = loc(1); sym(1).Node = node; } break; case 275: { - AST::VariableDeclaration *node = makeAstNode (driver->nodePool(), stringRef(1), sym(2).Expression); + AST::VariableDeclaration *node = new (pool) AST::VariableDeclaration(stringRef(1), sym(2).Expression); node->identifierToken = loc(1); sym(1).Node = node; } break; @@ -1358,19 +1358,19 @@ case 280: { } break; case 282: { - AST::EmptyStatement *node = makeAstNode (driver->nodePool()); + AST::EmptyStatement *node = new (pool) AST::EmptyStatement(); node->semicolonToken = loc(1); sym(1).Node = node; } break; case 284: { - AST::ExpressionStatement *node = makeAstNode (driver->nodePool(), sym(1).Expression); + AST::ExpressionStatement *node = new (pool) AST::ExpressionStatement(sym(1).Expression); node->semicolonToken = loc(2); sym(1).Node = node; } break; case 285: { - AST::IfStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement, sym(7).Statement); + AST::IfStatement *node = new (pool) AST::IfStatement(sym(3).Expression, sym(5).Statement, sym(7).Statement); node->ifToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -1379,7 +1379,7 @@ case 285: { } break; case 286: { - AST::IfStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::IfStatement *node = new (pool) AST::IfStatement(sym(3).Expression, sym(5).Statement); node->ifToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -1387,7 +1387,7 @@ case 286: { } break; case 288: { - AST::DoWhileStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(5).Expression); + AST::DoWhileStatement *node = new (pool) AST::DoWhileStatement(sym(2).Statement, sym(5).Expression); node->doToken = loc(1); node->whileToken = loc(3); node->lparenToken = loc(4); @@ -1397,7 +1397,7 @@ case 288: { } break; case 289: { - AST::WhileStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::WhileStatement *node = new (pool) AST::WhileStatement(sym(3).Expression, sym(5).Statement); node->whileToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -1405,7 +1405,7 @@ case 289: { } break; case 290: { - AST::ForStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, + AST::ForStatement *node = new (pool) AST::ForStatement(sym(3).Expression, sym(5).Expression, sym(7).Expression, sym(9).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -1416,7 +1416,7 @@ case 290: { } break; case 291: { - AST::LocalForStatement *node = makeAstNode (driver->nodePool(), + AST::LocalForStatement *node = new (pool) AST::LocalForStatement( sym(4).VariableDeclarationList->finish (/*readOnly=*/false), sym(6).Expression, sym(8).Expression, sym(10).Statement); node->forToken = loc(1); @@ -1429,7 +1429,7 @@ case 291: { } break; case 292: { - AST:: ForEachStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, + AST:: ForEachStatement *node = new (pool) AST::ForEachStatement(sym(3).Expression, sym(5).Expression, sym(7).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -1439,7 +1439,7 @@ case 292: { } break; case 293: { - AST::LocalForEachStatement *node = makeAstNode (driver->nodePool(), + AST::LocalForEachStatement *node = new (pool) AST::LocalForEachStatement( sym(4).VariableDeclaration, sym(6).Expression, sym(8).Statement); node->forToken = loc(1); node->lparenToken = loc(2); @@ -1450,14 +1450,14 @@ case 293: { } break; case 295: { - AST::ContinueStatement *node = makeAstNode (driver->nodePool()); + AST::ContinueStatement *node = new (pool) AST::ContinueStatement(); node->continueToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; } break; case 297: { - AST::ContinueStatement *node = makeAstNode (driver->nodePool(), stringRef(2)); + AST::ContinueStatement *node = new (pool) AST::ContinueStatement(stringRef(2)); node->continueToken = loc(1); node->identifierToken = loc(2); node->semicolonToken = loc(3); @@ -1465,14 +1465,14 @@ case 297: { } break; case 299: { - AST::BreakStatement *node = makeAstNode (driver->nodePool(), QStringRef()); + AST::BreakStatement *node = new (pool) AST::BreakStatement(QStringRef()); node->breakToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; } break; case 301: { - AST::BreakStatement *node = makeAstNode (driver->nodePool(), stringRef(2)); + AST::BreakStatement *node = new (pool) AST::BreakStatement(stringRef(2)); node->breakToken = loc(1); node->identifierToken = loc(2); node->semicolonToken = loc(3); @@ -1480,14 +1480,14 @@ case 301: { } break; case 303: { - AST::ReturnStatement *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::ReturnStatement *node = new (pool) AST::ReturnStatement(sym(2).Expression); node->returnToken = loc(1); node->semicolonToken = loc(3); sym(1).Node = node; } break; case 304: { - AST::WithStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).Statement); + AST::WithStatement *node = new (pool) AST::WithStatement(sym(3).Expression, sym(5).Statement); node->withToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -1495,7 +1495,7 @@ case 304: { } break; case 305: { - AST::SwitchStatement *node = makeAstNode (driver->nodePool(), sym(3).Expression, sym(5).CaseBlock); + AST::SwitchStatement *node = new (pool) AST::SwitchStatement(sym(3).Expression, sym(5).CaseBlock); node->switchToken = loc(1); node->lparenToken = loc(2); node->rparenToken = loc(4); @@ -1503,25 +1503,25 @@ case 305: { } break; case 306: { - AST::CaseBlock *node = makeAstNode (driver->nodePool(), sym(2).CaseClauses); + AST::CaseBlock *node = new (pool) AST::CaseBlock(sym(2).CaseClauses); node->lbraceToken = loc(1); node->rbraceToken = loc(3); sym(1).Node = node; } break; case 307: { - AST::CaseBlock *node = makeAstNode (driver->nodePool(), sym(2).CaseClauses, sym(3).DefaultClause, sym(4).CaseClauses); + AST::CaseBlock *node = new (pool) AST::CaseBlock(sym(2).CaseClauses, sym(3).DefaultClause, sym(4).CaseClauses); node->lbraceToken = loc(1); node->rbraceToken = loc(5); sym(1).Node = node; } break; case 308: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).CaseClause); + sym(1).Node = new (pool) AST::CaseClauses(sym(1).CaseClause); } break; case 309: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).CaseClauses, sym(2).CaseClause); + sym(1).Node = new (pool) AST::CaseClauses(sym(1).CaseClauses, sym(2).CaseClause); } break; case 310: { @@ -1533,60 +1533,60 @@ case 311: { } break; case 312: { - AST::CaseClause *node = makeAstNode (driver->nodePool(), sym(2).Expression, sym(4).StatementList); + AST::CaseClause *node = new (pool) AST::CaseClause(sym(2).Expression, sym(4).StatementList); node->caseToken = loc(1); node->colonToken = loc(3); sym(1).Node = node; } break; case 313: { - AST::DefaultClause *node = makeAstNode (driver->nodePool(), sym(3).StatementList); + AST::DefaultClause *node = new (pool) AST::DefaultClause(sym(3).StatementList); node->defaultToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; } break; case 314: case 315: { - AST::LabelledStatement *node = makeAstNode (driver->nodePool(), stringRef(1), sym(3).Statement); + AST::LabelledStatement *node = new (pool) AST::LabelledStatement(stringRef(1), sym(3).Statement); node->identifierToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; } break; case 316: { - AST::LabelledStatement *node = makeAstNode (driver->nodePool(), stringRef(1), sym(3).Statement); + AST::LabelledStatement *node = new (pool) AST::LabelledStatement(stringRef(1), sym(3).Statement); node->identifierToken = loc(1); node->colonToken = loc(2); sym(1).Node = node; } break; case 318: { - AST::ThrowStatement *node = makeAstNode (driver->nodePool(), sym(2).Expression); + AST::ThrowStatement *node = new (pool) AST::ThrowStatement(sym(2).Expression); node->throwToken = loc(1); node->semicolonToken = loc(3); sym(1).Node = node; } break; case 319: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Catch); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Catch); node->tryToken = loc(1); sym(1).Node = node; } break; case 320: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Finally); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Finally); node->tryToken = loc(1); sym(1).Node = node; } break; case 321: { - AST::TryStatement *node = makeAstNode (driver->nodePool(), sym(2).Statement, sym(3).Catch, sym(4).Finally); + AST::TryStatement *node = new (pool) AST::TryStatement(sym(2).Statement, sym(3).Catch, sym(4).Finally); node->tryToken = loc(1); sym(1).Node = node; } break; case 322: { - AST::Catch *node = makeAstNode (driver->nodePool(), stringRef(3), sym(5).Block); + AST::Catch *node = new (pool) AST::Catch(stringRef(3), sym(5).Block); node->catchToken = loc(1); node->lparenToken = loc(2); node->identifierToken = loc(3); @@ -1595,20 +1595,20 @@ case 322: { } break; case 323: { - AST::Finally *node = makeAstNode (driver->nodePool(), sym(2).Block); + AST::Finally *node = new (pool) AST::Finally(sym(2).Block); node->finallyToken = loc(1); sym(1).Node = node; } break; case 325: { - AST::DebuggerStatement *node = makeAstNode (driver->nodePool()); + AST::DebuggerStatement *node = new (pool) AST::DebuggerStatement(); node->debuggerToken = loc(1); node->semicolonToken = loc(2); sym(1).Node = node; } break; case 326: { - AST::FunctionDeclaration *node = makeAstNode (driver->nodePool(), stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); + AST::FunctionDeclaration *node = new (pool) AST::FunctionDeclaration(stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); node->functionToken = loc(1); node->identifierToken = loc(2); node->lparenToken = loc(3); @@ -1619,7 +1619,7 @@ case 326: { } break; case 327: { - AST::FunctionExpression *node = makeAstNode (driver->nodePool(), stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); + AST::FunctionExpression *node = new (pool) AST::FunctionExpression(stringRef(2), sym(4).FormalParameterList, sym(7).FunctionBody); node->functionToken = loc(1); if (! stringRef(2).isNull()) node->identifierToken = loc(2); @@ -1631,13 +1631,13 @@ case 327: { } break; case 328: { - AST::FormalParameterList *node = makeAstNode (driver->nodePool(), stringRef(1)); + AST::FormalParameterList *node = new (pool) AST::FormalParameterList(stringRef(1)); node->identifierToken = loc(1); sym(1).Node = node; } break; case 329: { - AST::FormalParameterList *node = makeAstNode (driver->nodePool(), sym(1).FormalParameterList, stringRef(3)); + AST::FormalParameterList *node = new (pool) AST::FormalParameterList(sym(1).FormalParameterList, stringRef(3)); node->commaToken = loc(2); node->identifierToken = loc(3); sym(1).Node = node; @@ -1656,27 +1656,27 @@ case 332: { } break; case 334: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements->finish ()); + sym(1).Node = new (pool) AST::FunctionBody(sym(1).SourceElements->finish ()); } break; case 335: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements->finish ()); + sym(1).Node = new (pool) AST::Program(sym(1).SourceElements->finish ()); } break; case 336: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElement); + sym(1).Node = new (pool) AST::SourceElements(sym(1).SourceElement); } break; case 337: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).SourceElements, sym(2).SourceElement); + sym(1).Node = new (pool) AST::SourceElements(sym(1).SourceElements, sym(2).SourceElement); } break; case 338: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).Statement); + sym(1).Node = new (pool) AST::StatementSourceElement(sym(1).Statement); } break; case 339: { - sym(1).Node = makeAstNode (driver->nodePool(), sym(1).FunctionDeclaration); + sym(1).Node = new (pool) AST::FunctionSourceElement(sym(1).FunctionDeclaration); } break; case 340: { diff --git a/src/declarative/qml/parser/qdeclarativejsparser_p.h b/src/declarative/qml/parser/qdeclarativejsparser_p.h index f77d13a..d94b3df 100644 --- a/src/declarative/qml/parser/qdeclarativejsparser_p.h +++ b/src/declarative/qml/parser/qdeclarativejsparser_p.h @@ -204,6 +204,7 @@ protected: protected: Engine *driver; + MemoryPool *pool; int tos; int stack_size; Value *sym_stack; diff --git a/src/declarative/qml/qdeclarativerewrite.cpp b/src/declarative/qml/qdeclarativerewrite.cpp index 9932a8f..be399dd 100644 --- a/src/declarative/qml/qdeclarativerewrite.cpp +++ b/src/declarative/qml/qdeclarativerewrite.cpp @@ -54,7 +54,6 @@ namespace QDeclarativeRewrite { bool SharedBindingTester::isSharable(const QString &code) { Engine engine; - NodePool pool(QString(), &engine); Lexer lexer(&engine); Parser parser(&engine); lexer.setCode(code, 0); @@ -75,7 +74,6 @@ bool SharedBindingTester::isSharable(AST::Node *node) QString RewriteBinding::operator()(const QString &code, bool *ok, bool *sharable) { Engine engine; - NodePool pool(QString(), &engine); Lexer lexer(&engine); Parser parser(&engine); lexer.setCode(code, 0); diff --git a/src/declarative/qml/qdeclarativerewrite_p.h b/src/declarative/qml/qdeclarativerewrite_p.h index 9754e5e..c57e995 100644 --- a/src/declarative/qml/qdeclarativerewrite_p.h +++ b/src/declarative/qml/qdeclarativerewrite_p.h @@ -56,7 +56,7 @@ #include "rewriter/textwriter_p.h" #include "parser/qdeclarativejslexer_p.h" #include "parser/qdeclarativejsparser_p.h" -#include "parser/qdeclarativejsnodepool_p.h" +#include "parser/qdeclarativejsmemorypool_p.h" QT_BEGIN_NAMESPACE diff --git a/src/declarative/qml/qdeclarativescriptparser.cpp b/src/declarative/qml/qdeclarativescriptparser.cpp index 306a979..9e5a427 100644 --- a/src/declarative/qml/qdeclarativescriptparser.cpp +++ b/src/declarative/qml/qdeclarativescriptparser.cpp @@ -45,7 +45,7 @@ #include "parser/qdeclarativejsengine_p.h" #include "parser/qdeclarativejsparser_p.h" #include "parser/qdeclarativejslexer_p.h" -#include "parser/qdeclarativejsnodepool_p.h" +#include "parser/qdeclarativejsmemorypool_p.h" #include "parser/qdeclarativejsastvisitor_p.h" #include "parser/qdeclarativejsast_p.h" #include "private/qdeclarativerewrite_p.h" @@ -862,10 +862,10 @@ class QDeclarativeScriptParserJsASTData { public: QDeclarativeScriptParserJsASTData(const QString &filename) - : nodePool(filename, &engine) {} + : filename(filename) {} + QString filename; Engine engine; - NodePool nodePool; }; bool QDeclarativeScriptParser::parse(const QByteArray &qmldata, const QUrl &url) diff --git a/tests/benchmarks/declarative/compilation/tst_compilation.cpp b/tests/benchmarks/declarative/compilation/tst_compilation.cpp index 98008d8..cadffe7 100644 --- a/tests/benchmarks/declarative/compilation/tst_compilation.cpp +++ b/tests/benchmarks/declarative/compilation/tst_compilation.cpp @@ -44,7 +44,7 @@ #include #include #include -#include +#include #include #include #include -- 1.7.2.5