/usr/include/KF5/kjs/nodes.h is in libkf5kjs-dev 5.18.0-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 | /*
* This file is part of the KDE libraries
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
* Copyright (C) 2003, 2004, 2005, 2006, 2007 Apple Inc. All rights reserved.
* Copyright (C) 2007, 2008 Maksim Orlovich (maksim@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef NODES_H_
#define NODES_H_
#include "Parser.h"
#include "internal.h"
#include "CompileState.h"
#include "operations.h"
#include "SymbolTable.h"
#include "opcodes.h"
#include "bytecode/opargs.h"
#include <wtf/ListRefPtr.h>
#include <wtf/Vector.h>
namespace KJS
{
class ProgramNode;
class PropertyNameNode;
class PropertyListNode;
class RegExp;
class SourceElementsNode;
class SourceStream;
class PackageObject;
class FuncDeclNode;
class FunctionBodyNode;
class Node;
class VarDeclVisitor;
class FuncDeclVisitor;
class CompileState;
struct CompileReference;
class NodeVisitor
{
public:
virtual ~NodeVisitor() {}
/**
This method should be overridden by subclasses to process nodes, and
perhaps return pointers for replacement nodes. If the node should not be
changed, return 0. Otherwise, return the replacement node.
The default implementation asks the node to visit its kids, and do
replacements on them if needed, but does not change anything for this node
*/
virtual Node *visit(Node *node);
};
class Node
{
public:
enum NodeType {
UnknownNodeType,
NullNodeType,
BooleanNodeType,
NumberNodeType,
StringNodeType,
RegExpNodeType,
TryNodeType,
GroupNodeType,
LabelNodeType
};
Node();
virtual ~Node();
virtual NodeType type() const
{
return UnknownNodeType;
}
UString toString() const;
// This updates line numbers to the pretty-printed version, and
// returns it out.
UString reindent(int baseLine = 0) const;
virtual void streamTo(SourceStream &) const = 0;
int lineNo() const
{
return m_line;
}
void ref();
void deref();
unsigned refcount();
static void clearNewNodes();
virtual Node *nodeInsideAllParens();
virtual bool isLocation() const
{
return false;
}
virtual bool isVarAccessNode() const
{
return false;
}
bool isNumber() const
{
return type() == NumberNodeType;
}
bool isString() const
{
return type() == StringNodeType;
}
bool isGroupNode() const
{
return type() == GroupNodeType;
}
bool isTryNode() const
{
return type() == TryNodeType;
}
bool isLabelNode() const
{
return type() == LabelNodeType;
}
virtual bool scanForDeclarations() const
{
return true;
}
virtual bool isIterationStatement() const
{
return false;
}
virtual void breakCycle() { }
// Processes all function and variable declarations below this node,
// adding them to symbol table or the current object depending on the
// execution context..
void processDecls(ExecState *);
/*
Implementations of this method should call visitor->visit on all the
children nodes, and if they return value is non-0, update the link to the child.
The recurseVisitLink helper takes care of this
*/
virtual void recurseVisit(NodeVisitor * /*visitor*/) {}
template<typename T>
static void recurseVisitLink(NodeVisitor *visitor, RefPtr<T> &link)
{
if (!link) {
return;
}
T *newLink = static_cast<T *>(visitor->visit(link.get()));
if (newLink) {
link = newLink;
}
}
template<typename T>
static void recurseVisitLink(NodeVisitor *visitor, ListRefPtr<T> &link)
{
if (!link) {
return;
}
T *newLink = static_cast<T *>(visitor->visit(link.get()));
if (newLink) {
link = newLink;
}
}
JSValue *throwError(ExecState *, ErrorType, const UString &msg);
JSValue *throwError(ExecState *, ErrorType, const UString &msg, const Identifier &);
JSValue *throwUndefinedVariableError(ExecState *, const Identifier &);
virtual OpValue generateEvalCode(CompileState *comp);
protected:
mutable int m_line;
private:
virtual void processVarDecl(ExecState *state);
virtual void processFuncDecl(ExecState *state);
friend class VarDeclVisitor;
friend class FuncDeclVisitor;
// disallow assignment
Node &operator=(const Node &);
Node(const Node &other);
};
class LocationNode : public Node
{
public:
virtual bool isLocation() const
{
return true;
}
// For assignments, we need to conceptually evaluate the LHS to a reference before looking at the RHS
// generateRefBind corresponds to that action. It never issues an error. The returned
// reference should be passed to generateRefWrite when needed
virtual CompileReference *generateRefBind(CompileState *) = 0;
// When we are doing a read-modify-write style op, or just plain read, we want to do a read
// right after the binding. This does that, and returns a reference for use of follow up
// writes.
virtual CompileReference *generateRefRead(CompileState *, OpValue *out) = 0;
// Writes to a bound reference.
virtual void generateRefWrite(CompileState *,
CompileReference *ref, OpValue &valToStore) = 0;
// The location nodes also handle deletes themselves. Note that this is called
// w/o generateRefBegin
virtual OpValue generateRefDelete(CompileState *) = 0;
// For function calls, we also do a specialized lookup, getting both the valie and the
// scope/this, also making sure it's not an activation.
virtual void generateRefFunc(CompileState *comp, OpValue *funOut, OpValue *thisOut) = 0;
};
class StatementNode : public Node
{
public:
StatementNode();
void setLoc(int line0, int line1) const;
int firstLine() const
{
return lineNo();
}
int lastLine() const
{
return m_lastLine;
}
void hitStatement(ExecState *);
void generateDebugInfoIfNeeded(CompileState *comp);
virtual void generateExecCode(CompileState *);
private:
void generateDebugInfo(CompileState *comp);
mutable int m_lastLine;
};
inline void StatementNode::generateDebugInfoIfNeeded(CompileState *comp)
{
if (comp->compileType() == Debug) {
generateDebugInfo(comp);
}
}
class NullNode : public Node
{
public:
NullNode() {}
virtual NodeType type() const
{
return NullNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
};
class BooleanNode : public Node
{
public:
BooleanNode(bool v) : val(v) {}
bool value() const
{
return val;
}
virtual NodeType type() const
{
return BooleanNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
private:
bool val;
};
class NumberNode : public Node
{
public:
NumberNode(double v) : val(v) {}
double value() const
{
return val;
}
void setValue(double v)
{
val = v;
}
virtual NodeType type() const
{
return NumberNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
private:
double val;
};
class StringNode : public Node
{
public:
StringNode(const UString *v) : val(*v), interned(0) { }
~StringNode(); // in nodes2bytecode.cpp
UString value() const
{
return val;
}
void setValue(const UString &v)
{
val = v;
}
virtual NodeType type() const
{
return StringNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
private:
UString val;
StringImp *interned;
};
class RegExpNode : public Node
{
public:
RegExpNode(const UString &p, const UString &f)
: pattern(p), flags(f) { }
virtual NodeType type() const
{
return RegExpNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
private:
UString pattern, flags;
};
class ThisNode : public Node
{
public:
ThisNode() {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
};
class VarAccessNode : public LocationNode
{
public:
VarAccessNode(const Identifier &s) : ident(s) {}
virtual bool isVarAccessNode() const
{
return true;
}
virtual void streamTo(SourceStream &) const;
virtual OpValue generateEvalCode(CompileState *comp);
virtual CompileReference *generateRefBind(CompileState *);
virtual CompileReference *generateRefRead(CompileState *, OpValue *out);
virtual void generateRefWrite(CompileState *,
CompileReference *ref, OpValue &valToStore);
virtual OpValue generateRefDelete(CompileState *);
virtual void generateRefFunc(CompileState *comp, OpValue *funOut, OpValue *thisOut);
// This one never fails..
OpValue valueForTypeOf(CompileState *comp);
// Returns the ID this variable should be accessed as, or
// missingSymbolMarker(), along with the variable's classification
enum Classification {
Local, // local variable accessed by register #
NonLocal, // one scope above, unless local injected
Dynamic, // need to do a full lookup
Global // in the global object, if anywhere.
};
size_t classifyVariable(CompileState *, Classification &classify);
protected:
Identifier ident;
};
class GroupNode : public Node
{
public:
GroupNode(Node *g) : group(g) { }
virtual NodeType type() const
{
return GroupNodeType;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual Node *nodeInsideAllParens();
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> group;
};
class ElementNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the ArrayNode ctor
ElementNode(int e, Node *n) : next(this), elision(e), node(n)
{
Parser::noteNodeCycle(this);
}
ElementNode(ElementNode *l, int e, Node *n)
: next(l->next), elision(e), node(n)
{
l->next = this;
}
virtual void streamTo(SourceStream &) const;
PassRefPtr<ElementNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class ArrayNode;
ListRefPtr<ElementNode> next;
int elision;
RefPtr<Node> node;
};
class ArrayNode : public Node
{
public:
ArrayNode(int e) : elision(e), opt(true) { }
ArrayNode(ElementNode *ele)
: element(ele->next.release()), elision(0), opt(false)
{
Parser::removeNodeCycle(element.get());
}
ArrayNode(int eli, ElementNode *ele)
: element(ele->next.release()), elision(eli), opt(true)
{
Parser::removeNodeCycle(element.get());
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool scanForDeclarations() const
{
return false;
}
private:
RefPtr<ElementNode> element;
int elision;
bool opt;
};
class PropertyNameNode : public Node
{
public:
PropertyNameNode(const Identifier &s) : str(s) { }
virtual void streamTo(SourceStream &) const;
private:
friend class ObjectLiteralNode;
Identifier str;
};
class PropertyNode : public Node
{
public:
enum Type { Constant, Getter, Setter };
PropertyNode(PropertyNameNode *n, Node *a, Type t)
: name(n), assign(a), type(t) { }
virtual void streamTo(SourceStream &) const;
friend class PropertyListNode;
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class ObjectLiteralNode;
RefPtr<PropertyNameNode> name;
RefPtr<Node> assign;
Type type;
};
class PropertyListNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the ObjectLiteralNode ctor
PropertyListNode(PropertyNode *n)
: node(n), next(this)
{
Parser::noteNodeCycle(this);
}
PropertyListNode(PropertyNode *n, PropertyListNode *l)
: node(n), next(l->next)
{
l->next = this;
}
virtual void streamTo(SourceStream &) const;
PassRefPtr<PropertyListNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class ObjectLiteralNode;
RefPtr<PropertyNode> node;
ListRefPtr<PropertyListNode> next;
};
class ObjectLiteralNode : public Node
{
public:
ObjectLiteralNode() { }
ObjectLiteralNode(PropertyListNode *l) : list(l->next.release())
{
Parser::removeNodeCycle(list.get());
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool scanForDeclarations() const
{
return false;
}
private:
RefPtr<PropertyListNode> list;
};
class BracketAccessorNode : public LocationNode
{
public:
BracketAccessorNode(Node *e1, Node *e2) : expr1(e1), expr2(e2) {}
virtual void streamTo(SourceStream &) const;
virtual OpValue generateEvalCode(CompileState *comp);
virtual CompileReference *generateRefBind(CompileState *);
virtual CompileReference *generateRefRead(CompileState *, OpValue *out);
virtual void generateRefWrite(CompileState *,
CompileReference *ref, OpValue &valToStore);
virtual OpValue generateRefDelete(CompileState *);
virtual void generateRefFunc(CompileState *comp, OpValue *funOut, OpValue *thisOut);
Node *base()
{
return expr1.get();
}
Node *subscript()
{
return expr2.get();
}
virtual void recurseVisit(NodeVisitor *visitor);
protected:
RefPtr<Node> expr1;
RefPtr<Node> expr2;
};
class DotAccessorNode : public LocationNode
{
public:
DotAccessorNode(Node *e, const Identifier &s) : expr(e), ident(s) { }
virtual void streamTo(SourceStream &) const;
virtual OpValue generateEvalCode(CompileState *comp);
virtual CompileReference *generateRefBind(CompileState *);
virtual CompileReference *generateRefRead(CompileState *, OpValue *out);
virtual void generateRefWrite(CompileState *,
CompileReference *ref, OpValue &valToStore);
virtual OpValue generateRefDelete(CompileState *);
virtual void generateRefFunc(CompileState *comp, OpValue *funOut, OpValue *thisOut);
Node *base() const
{
return expr.get();
}
const Identifier &identifier() const
{
return ident;
}
virtual void recurseVisit(NodeVisitor *visitor);
protected:
RefPtr<Node> expr;
Identifier ident;
};
class ArgumentListNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the ArgumentsNode ctor
ArgumentListNode(Node *e) : next(this), expr(e)
{
Parser::noteNodeCycle(this);
}
ArgumentListNode(ArgumentListNode *l, Node *e)
: next(l->next), expr(e)
{
l->next = this;
}
virtual void streamTo(SourceStream &) const;
PassRefPtr<ArgumentListNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class ArgumentsNode;
ListRefPtr<ArgumentListNode> next;
RefPtr<Node> expr;
};
class ArgumentsNode : public Node
{
public:
ArgumentsNode() { }
ArgumentsNode(ArgumentListNode *l)
: list(l->next.release())
{
Parser::removeNodeCycle(list.get());
}
void generateEvalArguments(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<ArgumentListNode> list;
};
class NewExprNode : public Node
{
public:
NewExprNode(Node *e) : expr(e) {}
NewExprNode(Node *e, ArgumentsNode *a) : expr(e), args(a) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
RefPtr<ArgumentsNode> args;
};
class FunctionCallValueNode : public Node
{
public:
FunctionCallValueNode(Node *e, ArgumentsNode *a) : expr(e), args(a) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
RefPtr<ArgumentsNode> args;
};
class FunctionCallReferenceNode : public Node
{
public:
FunctionCallReferenceNode(Node *e, ArgumentsNode *a) : expr(e), args(a) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
RefPtr<ArgumentsNode> args;
};
class PostfixNode : public Node
{
public:
PostfixNode(Node *l, Operator o) : m_loc(l), m_oper(o) {}
void streamTo(SourceStream &) const;
void recurseVisit(NodeVisitor *visitor);
virtual OpValue generateEvalCode(CompileState *comp);
protected:
RefPtr<Node> m_loc;
Operator m_oper;
};
class DeleteReferenceNode : public Node
{
public:
DeleteReferenceNode(LocationNode *l) : loc(l) {}
void streamTo(SourceStream &) const;
void recurseVisit(NodeVisitor *visitor);
virtual OpValue generateEvalCode(CompileState *comp);
private:
RefPtr<LocationNode> loc;
};
class DeleteValueNode : public Node
{
public:
DeleteValueNode(Node *e) : m_expr(e) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual OpValue generateEvalCode(CompileState *comp);
private:
RefPtr<Node> m_expr;
};
class VoidNode : public Node
{
public:
VoidNode(Node *e) : expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class TypeOfVarNode : public Node
{
public:
TypeOfVarNode(VarAccessNode *l) : loc(l) {}
virtual OpValue generateEvalCode(CompileState *comp);
void streamTo(SourceStream &) const;
void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<VarAccessNode> loc;
};
class TypeOfValueNode : public Node
{
public:
TypeOfValueNode(Node *e) : m_expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> m_expr;
};
class PrefixNode : public Node
{
public:
PrefixNode(Node *l, Operator o) : m_loc(l), m_oper(o) {}
virtual OpValue generateEvalCode(CompileState *comp);
void streamTo(SourceStream &) const;
void recurseVisit(NodeVisitor *visitor);
protected:
RefPtr<Node> m_loc;
Operator m_oper;
};
class UnaryPlusNode : public Node
{
public:
UnaryPlusNode(Node *e) : expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class NegateNode : public Node
{
public:
NegateNode(Node *e) : expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class BitwiseNotNode : public Node
{
public:
BitwiseNotNode(Node *e) : expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class LogicalNotNode : public Node
{
public:
LogicalNotNode(Node *e) : expr(e) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class BinaryOperatorNode : public Node
{
public:
BinaryOperatorNode(Node *e1, Node *e2, Operator op)
: expr1(e1), expr2(e2), oper(op) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr1;
RefPtr<Node> expr2;
Operator oper;
};
/**
* expr1 && expr2, expr1 || expr2
*/
class BinaryLogicalNode : public Node
{
public:
BinaryLogicalNode(Node *e1, Operator o, Node *e2) :
expr1(e1), expr2(e2), oper(o) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr1;
RefPtr<Node> expr2;
Operator oper;
};
/**
* The ternary operator, "logical ? expr1 : expr2"
*/
class ConditionalNode : public Node
{
public:
ConditionalNode(Node *l, Node *e1, Node *e2) :
logical(l), expr1(e1), expr2(e2) {}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> logical;
RefPtr<Node> expr1;
RefPtr<Node> expr2;
};
class AssignNode : public Node
{
public:
AssignNode(Node *loc, Operator oper, Node *right)
: m_loc(loc), m_oper(oper), m_right(right) {}
void streamTo(SourceStream &) const;
virtual OpValue generateEvalCode(CompileState *comp);
void recurseVisit(NodeVisitor *visitor);
protected:
RefPtr<Node> m_loc;
Operator m_oper;
RefPtr<Node> m_right;
};
class CommaNode : public Node
{
public:
CommaNode(Node *e1, Node *e2) : expr1(e1), expr2(e2) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual OpValue generateEvalCode(CompileState *comp);
private:
RefPtr<Node> expr1;
RefPtr<Node> expr2;
};
class AssignExprNode : public Node
{
public:
AssignExprNode(Node *e) : expr(e) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual OpValue generateEvalCode(CompileState *comp);
Node *getExpr()
{
return expr.get();
}
private:
RefPtr<Node> expr;
};
class VarDeclNode : public Node
{
public:
enum Type { Variable, Constant };
VarDeclNode(const Identifier &id, AssignExprNode *in, Type t);
void generateCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void processVarDecl(ExecState *);
private:
friend class VarStatementNode;
friend class VarDeclListNode;
Type varType;
Identifier ident;
RefPtr<AssignExprNode> init;
};
class VarDeclListNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the ForNode/VarStatementNode ctor
VarDeclListNode(VarDeclNode *v) : next(this), var(v)
{
Parser::noteNodeCycle(this);
}
VarDeclListNode(VarDeclListNode *l, VarDeclNode *v)
: next(l->next), var(v)
{
l->next = this;
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
PassRefPtr<VarDeclListNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class ForNode;
friend class VarStatementNode;
ListRefPtr<VarDeclListNode> next;
RefPtr<VarDeclNode> var;
};
class VarStatementNode : public StatementNode
{
public:
VarStatementNode(VarDeclListNode *l) : next(l->next.release())
{
Parser::removeNodeCycle(next.get());
}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
private:
RefPtr<VarDeclListNode> next;
};
class BlockNode : public StatementNode
{
public:
BlockNode(SourceElementsNode *s);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
protected:
RefPtr<SourceElementsNode> source;
};
class EmptyStatementNode : public StatementNode
{
public:
EmptyStatementNode() { } // debug
virtual void streamTo(SourceStream &) const;
virtual void generateExecCode(CompileState *);
};
class ExprStatementNode : public StatementNode
{
public:
ExprStatementNode(Node *e) : expr(e) { }
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
private:
RefPtr<Node> expr;
};
class IfNode : public StatementNode
{
public:
IfNode(Node *e, StatementNode *s1, StatementNode *s2)
: expr(e), statement1(s1), statement2(s2) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
private:
RefPtr<Node> expr;
RefPtr<StatementNode> statement1;
RefPtr<StatementNode> statement2;
};
class DoWhileNode : public StatementNode
{
public:
DoWhileNode(StatementNode *s, Node *e) : statement(s), expr(e) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
virtual bool isIterationStatement() const
{
return true;
}
private:
RefPtr<StatementNode> statement;
RefPtr<Node> expr;
};
class WhileNode : public StatementNode
{
public:
WhileNode(Node *e, StatementNode *s) : expr(e), statement(s) {}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
virtual bool isIterationStatement() const
{
return true;
}
private:
RefPtr<Node> expr;
RefPtr<StatementNode> statement;
};
class ForNode : public StatementNode
{
public:
ForNode(Node *e1, Node *e2, Node *e3, StatementNode *s) :
expr1(e1), expr2(e2), expr3(e3), statement(s) {}
ForNode(VarDeclListNode *e1, Node *e2, Node *e3, StatementNode *s) :
expr1(e1->next.release()), expr2(e2), expr3(e3), statement(s)
{
Parser::removeNodeCycle(expr1.get());
}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool isIterationStatement() const
{
return true;
}
private:
RefPtr<Node> expr1;
RefPtr<Node> expr2;
RefPtr<Node> expr3;
RefPtr<StatementNode> statement;
};
class ForInNode : public StatementNode
{
public:
ForInNode(Node *l, Node *e, StatementNode *s);
ForInNode(const Identifier &i, AssignExprNode *in, Node *e, StatementNode *s);
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool isIterationStatement() const
{
return true;
}
private:
Identifier ident;
RefPtr<AssignExprNode> init;
RefPtr<Node> lexpr;
RefPtr<Node> expr;
RefPtr<VarDeclNode> varDecl;
RefPtr<StatementNode> statement;
};
class ContinueNode : public StatementNode
{
public:
ContinueNode() : target(0) { }
ContinueNode(const Identifier &i) : ident(i), target(0) { }
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
private:
Identifier ident;
const Node *target;
};
class BreakNode : public StatementNode
{
public:
BreakNode() : target(0) { }
BreakNode(const Identifier &i) : ident(i), target(0) { }
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
private:
Identifier ident;
const Node *target;
};
class ReturnNode : public StatementNode
{
public:
ReturnNode(Node *v) : value(v) {}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> value;
};
class WithNode : public StatementNode
{
public:
WithNode(Node *e, StatementNode *s) : expr(e), statement(s) {}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
RefPtr<StatementNode> statement;
};
class LabelNode : public StatementNode
{
public:
LabelNode(const Identifier &l, StatementNode *s) : label(l), statement(s) { }
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *);
virtual NodeType type() const
{
return LabelNodeType;
}
private:
Identifier label;
RefPtr<StatementNode> statement;
};
class ThrowNode : public StatementNode
{
public:
ThrowNode(Node *e) : expr(e) {}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<Node> expr;
};
class TryNode : public StatementNode
{
public:
TryNode(StatementNode *b, const Identifier &e, StatementNode *c, StatementNode *f)
: tryBlock(b), exceptionIdent(e), catchBlock(c), finallyBlock(f) { }
virtual NodeType type() const
{
return TryNodeType;
}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
RefPtr<StatementNode> tryBlock;
Identifier exceptionIdent;
RefPtr<StatementNode> catchBlock;
RefPtr<StatementNode> finallyBlock;
};
class ParameterNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the FuncDeclNode/FuncExprNode ctor
ParameterNode(const Identifier &i) : id(i), next(this)
{
Parser::noteNodeCycle(this);
}
ParameterNode(ParameterNode *next, const Identifier &i)
: id(i), next(next->next)
{
next->next = this;
}
const Identifier &ident() const
{
return id;
}
ParameterNode *nextParam() const
{
return next.get();
}
virtual void streamTo(SourceStream &) const;
PassRefPtr<ParameterNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class FuncDeclNode;
friend class FuncExprNode;
Identifier id;
ListRefPtr<ParameterNode> next;
};
// Flags about function bodies we care about for codegen
enum FunctionBodyFlags {
// note: neither of the two below is set for things created via
// top-level, eval, or function ctor
FuncFl_Decl = 1,
FuncFl_Expr = 2,
FuncFl_HasEvalOp = 4
};
/**
This AST node corresponds to the function body or top-level code in the AST, but is used to
keep track of much of the information relevant to the whole function,
such as parameter names and symbol tables. This is because there are both function
declarations and expressions, so there is no natural single place to put this stuff
above the body
inherited by ProgramNode
*/
class FunctionBodyNode : public BlockNode
{
public:
struct SymbolInfo {
SymbolInfo(int _attr, FuncDeclNode *_funcDecl) : funcDecl(_funcDecl), attr(_attr) {}
SymbolInfo() {}
FuncDeclNode *funcDecl;
int attr;
};
FunctionBodyNode(SourceElementsNode *);
int sourceId()
{
return m_sourceId;
}
const UString &sourceURL()
{
return m_sourceURL;
}
bool isCompiled() const
{
return m_compType != NotCompiled;
}
void compileIfNeeded(CodeType ctype, CompileType compType);
void compile(CodeType ctype, CompileType compType);
CompileType compileState() const
{
return m_compType;
}
virtual void generateExecCode(CompileState *);
// Reserves a register for private use, making sure that id is in the right spot..
void reserveSlot(size_t id, bool shouldMark);
// Symbol table functions
SymbolTable &symbolTable()
{
return m_symbolTable;
}
size_t lookupSymbolID(const Identifier &id) const
{
return m_symbolTable.get(id.ustring().rep());
}
int numLocalsAndRegisters() const
{
return m_symbolList.size();
}
SymbolInfo *getLocalInfo()
{
return m_symbolList.data();
}
size_t numFunctionLocals() const
{
return m_functionLocals.size();
}
size_t *getFunctionLocalInfo()
{
return m_functionLocals.data();
}
// Parameter stuff. We only collect the names during the parsing/
// while FunctionImp is responsible for managing the IDs.
void addParam(const Identifier &ident);
size_t numParams() const
{
return m_paramList.size();
}
const Identifier ¶mName(size_t pos) const
{
return m_paramList[pos];
}
void addVarDecl(const Identifier &ident, int attr, ExecState *exec);
void addFunDecl(const Identifier &ident, int attr, FuncDeclNode *funcDecl);
// Adds a new symbol, killing any previous ID.
void addSymbolOverwriteID(size_t id, const Identifier &ident, int attr);
// Runs the code, compiling if needed. This should only be used for non-function ExecStates
Completion execute(ExecState *exec);
bool tearOffAtEnd() const
{
return m_tearOffAtEnd;
}
const CodeBlock &code() const
{
return m_compiledCode;
}
CodeBlock &code()
{
return m_compiledCode;
}
// Collection of FuncFl_* flags describing information collected about this function
// during the parsing.
unsigned flags() const
{
return m_flags;
}
private:
size_t addSymbol(const Identifier &ident, int attr, FuncDeclNode *funcDecl = 0);
UString m_sourceURL;
int m_sourceId : 31;
bool m_tearOffAtEnd : 1;
CompileType m_compType;
// Flags
unsigned m_flags;
// This maps id -> attributes and function decl info
WTF::Vector<SymbolInfo> m_symbolList;
// This contains the list of locals which contains function declarations
WTF::Vector<size_t> m_functionLocals;
// This maps name -> id
SymbolTable m_symbolTable;
// The list of parameter names
WTF::Vector<Identifier> m_paramList;
CodeBlock m_compiledCode;
};
inline void FunctionBodyNode::compileIfNeeded(CodeType ctype, CompileType compType)
{
if (m_compType != compType) {
compile(ctype, compType);
}
}
class FuncExprNode : public Node
{
public:
FuncExprNode(const Identifier &i, FunctionBodyNode *b, ParameterNode *p = 0)
: ident(i), param(p ? p->next.release() : PassRefPtr<ParameterNode>(0)), body(b)
{
if (p) {
Parser::removeNodeCycle(param.get());
} addParams();
}
virtual OpValue generateEvalCode(CompileState *comp);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool scanForDeclarations() const
{
return false;
}
private:
void addParams();
// Used for streamTo
friend class PropertyNode;
Identifier ident;
RefPtr<ParameterNode> param;
RefPtr<FunctionBodyNode> body;
};
class FuncDeclNode : public StatementNode
{
public:
FuncDeclNode(const Identifier &i, FunctionBodyNode *b)
: ident(i), body(b)
{
addParams();
}
FuncDeclNode(const Identifier &i, ParameterNode *p, FunctionBodyNode *b)
: ident(i), param(p->next.release()), body(b)
{
Parser::removeNodeCycle(param.get());
addParams();
}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual bool scanForDeclarations() const
{
return false;
}
virtual void processFuncDecl(ExecState *);
FunctionImp *makeFunctionObject(ExecState *);
private:
void addParams();
Identifier ident;
RefPtr<ParameterNode> param;
RefPtr<FunctionBodyNode> body;
};
// A linked list of source element nodes
class SourceElementsNode : public StatementNode
{
public:
// list pointer is tail of a circular list, cracked in the BlockNode (or subclass) ctor
SourceElementsNode(StatementNode *);
SourceElementsNode(SourceElementsNode *s1, StatementNode *s2);
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
PassRefPtr<SourceElementsNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class BlockNode;
friend class CaseClauseNode;
RefPtr<StatementNode> node;
ListRefPtr<SourceElementsNode> next;
};
class CaseClauseNode : public Node
{
public:
CaseClauseNode(Node *e) : expr(e) { }
CaseClauseNode(Node *e, SourceElementsNode *s)
: expr(e), source(s->next.release())
{
Parser::removeNodeCycle(source.get());
}
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class SwitchNode;
RefPtr<Node> expr;
RefPtr<SourceElementsNode> source;
};
class ClauseListNode : public Node
{
public:
// list pointer is tail of a circular list, cracked in the CaseBlockNode ctor
ClauseListNode(CaseClauseNode *c) : clause(c), next(this)
{
Parser::noteNodeCycle(this);
}
ClauseListNode(ClauseListNode *n, CaseClauseNode *c)
: clause(c), next(n->next)
{
n->next = this;
}
CaseClauseNode *getClause() const
{
return clause.get();
}
ClauseListNode *getNext() const
{
return next.get();
}
virtual void streamTo(SourceStream &) const;
PassRefPtr<ClauseListNode> releaseNext()
{
return next.release();
}
virtual void breakCycle();
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class SwitchNode;
friend class CaseBlockNode;
RefPtr<CaseClauseNode> clause;
ListRefPtr<ClauseListNode> next;
};
class CaseBlockNode : public Node
{
public:
CaseBlockNode(ClauseListNode *l1, CaseClauseNode *d, ClauseListNode *l2);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
friend class SwitchNode;
RefPtr<ClauseListNode> list1;
RefPtr<CaseClauseNode> def;
RefPtr<ClauseListNode> list2;
};
class SwitchNode : public StatementNode
{
public:
SwitchNode(Node *e, CaseBlockNode *b) : expr(e), block(b) { }
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
virtual void generateExecCode(CompileState *comp);
private:
RefPtr<Node> expr;
RefPtr<CaseBlockNode> block;
};
// important: these are also built when compiling things via the Function constructor
// (see FunctionObjectImp::construct() and Parser::parseFunctionBody, so the existence
// of this class rather than the bare FunctionBodyNode does not care much information.
class ProgramNode : public FunctionBodyNode
{
public:
ProgramNode(SourceElementsNode *s);
virtual void streamTo(SourceStream &) const;
};
class PackageNameNode : public Node
{
public:
PackageNameNode(const Identifier &i) : names(0), id(i) { }
PackageNameNode(PackageNameNode *n,
const Identifier &i) : names(n), id(i) { }
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
Completion loadSymbol(ExecState *exec, bool wildcard);
PackageObject *resolvePackage(ExecState *exec);
private:
PackageObject *resolvePackage(ExecState *exec,
JSObject *baseObject, Package *basePackage);
RefPtr<PackageNameNode> names;
Identifier id;
};
class ImportStatement : public StatementNode
{
public:
ImportStatement(PackageNameNode *n) : name(n), wld(false) {}
void enableWildcard()
{
wld = true;
}
void setAlias(const Identifier &a)
{
al = a;
}
virtual void generateExecCode(CompileState *);
virtual void streamTo(SourceStream &) const;
virtual void recurseVisit(NodeVisitor *visitor);
private:
virtual void processVarDecl(ExecState *state);
RefPtr<PackageNameNode> name;
Identifier al;
bool wld;
};
} // namespace
#endif
|