DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Untracked file

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
 *
 * ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is the JavaScript 2 Prototype.
 *
 * The Initial Developer of the Original Code is
 * Netscape Communications Corporation.
 * Portions created by the Initial Developer are Copyright (C) 1998
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU General Public License Version 2 or later (the "GPL"), or
 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */

#ifndef nodefactory_h___
#define nodefactory_h___

#include "utilities.h"
#include <vector>

namespace JavaScript {

    class NodeFactory {

    private:
        NodeFactory(Arena& arena) : arena(arena) {}

        static NodeFactory *state;
        Arena &arena;

    public:
        static void
        Init(Arena& arena) {
            state = new NodeFactory(arena);
        }
        static Arena &
        getArena() {
            return NodeFactory::state->arena;
        }
        static IdentifierExprNode *
        Identifier(const Token &t) {
            return new(getArena()) IdentifierExprNode(t);
        }
#if 0
        static QualifiedIdentifierNode
        QualifiedIdentifier(Node qualifier, IdentifierNode identifier ) {
            return new QualifiedIdentifierNode(qualifier,identifier);
        }
        static LiteralNullNode
        LiteralNull() {
            return new LiteralNullNode();
        }
        static LiteralBooleanNode
        LiteralBoolean(boolean value) {
            return new LiteralBooleanNode(value);
        }
        static LiteralArrayNode
        LiteralArray(Node elementlist) {
            return new LiteralArrayNode(elementlist);
        }
#endif
        static ExprPairList *
        LiteralField(ExprNode *name = 0, ExprNode *value = 0) {
            return new(getArena()) ExprPairList(name,value);
        }
        static NumberExprNode *
        LiteralNumber(const Token &t) {
            return new(getArena()) NumberExprNode(t);
        }
#if 0
        static LiteralObjectNode
        LiteralObject(Node fieldlist) {
            return new LiteralObjectNode(fieldlist);
        }
        static LiteralRegExpNode
        LiteralRegExp(String value) {
            return new LiteralRegExpNode(value);
        }
#endif
        static StringExprNode *
        LiteralString(uint32 pos, ExprNode::Kind kind, String &str) {
            return new(getArena()) StringExprNode(pos,kind,str);
        }
#if 0
        static LiteralTypeNode
        LiteralType(Type type) {
            return new LiteralTypeNode(type);
        }
        static LiteralUndefinedNode
        LiteralUndefined() {
            return new LiteralUndefinedNode();
        }
        static FunctionExpressionNode
        FunctionExpression(Node name, Node signature, Node body ) {
            return new FunctionExpressionNode(name,signature,body);
        }
        static AnnotatedDefinitionNode
        AnnotatedDefinition(Node attributes, Node definition) {
            return new AnnotatedDefinitionNode(attributes,definition);
        }
        static AttributeDefinitionNode
        AttributeDefinition(Node name, int kind, Node value) {
            return new AttributeDefinitionNode(name,kind,value);
        }
        static AttributeListNode
        AttributeList(Node item, Node list) {
            return new AttributeListNode(item,list);
        }
        static UnitExpressionNode
        UnitExpression(Node value, Node type) {
            return new UnitExpressionNode(value,type);
        }
        static ThisExpressionNode
        ThisExpression() {
            return new ThisExpressionNode();
        }
        static SuperExpressionNode
        SuperExpression() {
            return new SuperExpressionNode();
        }
        static EvalExpressionNode
        EvalExpression(Node expr) {
            return new EvalExpressionNode(expr);
        }
        static ListNode
        List(Node list, Node item) {
            return new ListNode(list,item);
        }
        static PostfixExpressionNode
        PostfixExpression(int op, Node expr) {
            return new PostfixExpressionNode(op,expr);
        }
        static NewExpressionNode
        NewExpression(Node member) {
            return new NewExpressionNode(member);
        }
        static CallExpressionNode
        CallExpression(Node member, Node args) {
            return new CallExpressionNode(member,args);
        }
        static IndexedMemberExpressionNode
        IndexedMemberExpression(Node base, Node member) {
            return new IndexedMemberExpressionNode(base,member);
        }
        static MemberExpressionNode
        MemberExpression(Node base, Node name) {
            return new MemberExpressionNode(base,name);
        }
        static CoersionExpressionNode
        CoersionExpression(Node expr, Node type) {
            return new CoersionExpressionNode(expr,type);
        }
        static UnaryExpressionNode
        UnaryExpression(int op, Node expr) {
            return new UnaryExpressionNode(op,expr);
        }
        static BinaryExpressionNode
        BinaryExpression(int op, Node lhs, Node rhs) {
            return new BinaryExpressionNode(op,lhs,rhs);
        }
        static ConditionalExpressionNode
        ConditionalExpression(Node cond, Node thenexpr, Node elseexpr) {
            return new ConditionalExpressionNode(cond,thenexpr,elseexpr);
        }
        static AssignmentExpressionNode
        AssignmentExpression(Node lhs, int op, Node rhs) {
            return new AssignmentExpressionNode(lhs,op,rhs);
        }
        static StatementListNode
        StatementList (StatementListNode list, Node item ) {
            return new StatementListNode(list,item);
        }
        static EmptyStatementNode
        EmptyStatement() {
            return new EmptyStatementNode();
        }
        static ExpressionStatementNode
        ExpressionStatement(Node expr) {
            return new ExpressionStatementNode(expr);
        }
        static AnnotatedBlockNode
        AnnotatedBlock(Node attributes, Node definition) {
            return new AnnotatedBlockNode(attributes,definition);
        }
        static LabeledStatementNode
        LabeledStatement(Node label, Node statement) {
            return new LabeledStatementNode(label,statement);
        }
        static IfStatementNode
        IfStatement(Node test, Node tblock, Node eblock) {
            return new IfStatementNode(test,tblock,eblock);
        }
        static SwitchStatementNode
        SwitchStatement(Node expr, Node statements) {
            return new SwitchStatementNode(expr,statements);
        }
        static DefaultStatementNode
        DefaultStatement() {
            return new DefaultStatementNode();
        }
        static DoStatementNode
        DoStatement(Node block, Node expr) {
            return new DoStatementNode(block,expr);
        }
        static WhileStatementNode
        WhileStatement(Node expr, Node statement) {
            return new WhileStatementNode(expr,statement);
        }
        static ForInStatementNode
        ForInStatement(Node expr1, Node expr2, Node statement) {
            return new ForInStatementNode(expr1,expr2,statement);
        }
        static ForStatementNode
        ForStatement(Node expr1, Node expr2, Node expr3, Node statement) {
            return new ForStatementNode(expr1,expr2,expr3,statement);
        }
        static WithStatementNode
        WithStatement(Node expr, Node statement) {
            return new WithStatementNode(expr,statement);
        }
        static ContinueStatementNode
        ContinueStatement(Node expr) {
            return new ContinueStatementNode(expr);
        }
        static BreakStatementNode
        BreakStatement(Node expr) {
            return new BreakStatementNode(expr);
        }
        static ReturnStatementNode
        ReturnStatement(Node expr) {
            return new ReturnStatementNode(expr);
        }
        static ThrowStatementNode
        ThrowStatement(Node list) {
            return new ThrowStatementNode(list);
        }
        static TryStatementNode
        TryStatement(Node tryblock, Node catchlist, Node finallyblock) {
            return new TryStatementNode(tryblock,catchlist,finallyblock);
        }
        static CatchClauseNode
        CatchClause(Node parameter, Node block) {
            return new CatchClauseNode(parameter,block);
        }
        static FinallyClauseNode
        FinallyClause(Node block) {
            return new FinallyClauseNode(block);
        }
        static IncludeStatementNode
        IncludeStatement(Node list) {
            return new IncludeStatementNode(list);
        }
        static UseStatementNode
        UseStatement(Node expr) {
            return new UseStatementNode(expr);
        }
        static ImportDefinitionNode
        ImportDefinition(Node item, Node list) {
            return new ImportDefinitionNode(item,list);
        }
        static ImportBindingNode
        ImportBinding(Node identifer, Node item) {
            return new ImportBindingNode(identifer,item);
        }
        static ExportDefinitionNode
        ExportDefinition(Node list) {
            return new ExportDefinitionNode(list);
        }
        static ExportBindingNode
        ExportBinding(Node name, Node value) {
            return new ExportBindingNode(name,value);
        }
        static VariableDefinitionNode
        VariableDefinition(int kind, Node list) {
            return new VariableDefinitionNode(kind,list);
        }
        static VariableBindingNode
        VariableBinding(Node identifier, Node initializer) {
            return new VariableBindingNode(identifier,initializer);
        }
        static TypedVariableNode
        TypedVariable(Node identifier, Node type) {
            return new TypedVariableNode(identifier,type);
        }
        static FunctionDefinitionNode
        FunctionDefinition(Node decl, Node body) {
            return new FunctionDefinitionNode(decl,body);
        }
        static FunctionDeclarationNode
        FunctionDeclaration(Node name, Node signature) {
            return new FunctionDeclarationNode(name,signature);
        }
        static FunctionNameNode
        FunctionName(int kind, Node name) {
            return new FunctionNameNode(kind,name);
        }
        static RestParameterNode
        RestParameter(Node expr) {
            return new RestParameterNode(expr);
        }
        static ParameterNode
        Parameter(Node identifer, Node type) {
            return new ParameterNode(identifer,type);
        }
#endif
        static VariableBinding *
        Parameter(ExprNode *name, ExprNode *type, bool constant) {
            return new(getArena()) VariableBinding(0, name, type, 0, constant);
        }
#if 0
        static VariableBinding *
        NamedParameter(StringExprNode *name, ParseNode *parameter) {
            return new(Arena()) NamedParameterNode(name, parameter);
        }
        static ClassDeclarationNode
        ClassDeclaration(Node name) {
            return new ClassDeclarationNode(name);
        }
        static ClassDefinitionNode
        ClassDefinition(Node name, Node interfaces, Node statements) {
            return new ClassDefinitionNode(name,interfaces,statements);
        }
        static InheritanceNode
        Inheritance(Node baseclass, Node interfaces) {
        return new InheritanceNode(baseclass,interfaces);
        }
        static InterfaceDeclarationNode
        InterfaceDeclaration(Node name) {
            return new InterfaceDeclarationNode(name);
        }
        static InterfaceDefinitionNode
        InterfaceDefinition(Node name, Node interfaces, Node statements) {
            return new InterfaceDefinitionNode(name,interfaces,statements);
        }
        static NamespaceDefinitionNode
        NamespaceDefinition(Node identifier, Node list) {
            return new NamespaceDefinitionNode(identifier,list);
        }
        static LanguageDeclarationNode
        LanguageDeclaration(Node list) {
            return new LanguageDeclarationNode(list);
        }
        static PackageDefinitionNode
        PackageDefinition(Node name, Node block) {
            return new PackageDefinitionNode(name,block);
        }
        static ProgramNode
        Program(Node statements) {
            return new ProgramNode(statements);
        }
#endif
    };
}
#endif // nodefactory_h