Name Description Size
AbstractScopePtr.cpp 1732
AbstractScopePtr.h 3136
align_stack_comment.py Usage: align_stack_comment.py FILE This script aligns the stack transition comment in BytecodeEmitter and its helper classes. The stack transition comment looks like the following: // [stack] VAL1 VAL2 VAL3 3154
AsyncEmitter.cpp 5095
AsyncEmitter.h namespace frontend 4982
BCEParserHandle.h 898
BytecodeCompilation.h 4568
BytecodeCompiler.cpp 44051
BytecodeCompiler.h Structure of all of the support classes. Parser: described in Parser.h. BytecodeCompiler.cpp: BytecodeCompiler.h *and* BytecodeCompilation.h. This is the "driver", the high-level operations like "compile this source to bytecode". It calls the parser, bytecode emitter, etc. ParseContext.h and SharedContext.h: Both have similar purposes. They're split because ParseContext contains information used only by the parser, and SharedContext contains information used by both the parser and BytecodeEmitter. SharedContext.h: class Directives: this contains boolean flags for tracking if we're in asm.js or "use strict" code. The "use strict" bit is stored in SharedContext, and additionally, the full Directives class is stored in ParseContext - if a direcive is encountered while parsing, this is updated, and checked in GeneralParser::functionDefinition, and if it changed, the whole function is re-parsed with the new flags. SharedContext.h: abstract class SharedContext: This class contains two different groups of flags: Parse context information. This is information conceptually "passed down" into parsing sub-nodes. This is like "are we parsing strict code?", and so the parser can make decisions of how to parse based off that. Gathered-while-parsing information. This is information conceptually "returned up" from parsing sub-nodes. This is like "did we see a use strict directive"? Additionally, subclasses (GlobalSharedContext, ModuleSharedContext, EvalSharedContext, and FunctionBox) contain binding information, scope information, and other such bits of data. ParseContext.h: class UsedNameTracker: Track which bindings are used in which scopes. This helps determine which bindings are closed-over, which affects how they're stored; and whether special bindings like `this` and `arguments` can be optimized away. ParseContext.h: class ParseContext: Extremely complex class that serves a lot of purposes, but it's a single class - essentially no derived classes - so it's a little easier to comprehend all at once. (SourceParseContext does derive from ParseContext, but they does nothing except adjust the constructor's arguments). Note it uses a thing called Nestable, which implements a stack of objects: you can push (and pop) instances to a stack (linked list) as you parse further into the parse tree. You may push to this stack via calling the constructor with a GeneralParser as an argument (usually `this`), which pushes itself onto `this->pc` (so it does get assigned/pushed, even though no assignment ever appears directly in the parser) ParseContext contains a pointer to a SharedContext. There's a decent chunk of flags/data collection in here too, some "pass-down" data and some "return-up" data. ParseContext also contains a significant number of *sub*-Nestables as fields of itself (nestables inside nestables). Note you also push/pop to these via passing `Parser->pc`, which the constructor of the sub-nestable knows which ParseContext field to push to. The sub-nestables are: ParseContext::Statement: stack of statements. `if (x) { while (true) { try { ..stack of [if, while, try].. } ... } }` ParseContext::LabelStatement: interspersed in Statement stack, for labeled statements, for e.g. `label: while (true) { break label; }` ParseContext::ClassStatement: interspersed in Statement stack, for classes the parser is currently inside of. ParseContext::Scope: Set of variables in each scope (stack of sets): `{ let a; let b; { let c; } }` (this gets complicated with `var`, etc., check the class for docs) 9492
BytecodeControlStructures.cpp 3538
BytecodeControlStructures.h namespace frontend 4740
BytecodeEmitter.cpp JS bytecode generation. 347909
BytecodeEmitter.h JS bytecode generation. 45172
BytecodeOffset.h namespace frontend 4160
BytecodeSection.cpp 6221
BytecodeSection.h 13269
CallOrNewEmitter.cpp 7776
CallOrNewEmitter.h 11874
CForEmitter.cpp 4915
CForEmitter.h 5556
CompilationStencil.h 40097
DefaultEmitter.cpp 1742
DefaultEmitter.h namespace frontend 1678
DestructuringFlavor.h namespace frontend 690
DoWhileEmitter.cpp 1752
DoWhileEmitter.h namespace frontend 2099
EitherParser.h A variant-like class abstracting operations on a Parser with a given ParseHandler but unspecified character type. 4894
ElemOpEmitter.cpp 6528
ElemOpEmitter.h 8151
EmitterScope.cpp static 36790
EmitterScope.h 8285
ErrorReporter.h 11677
ExpressionStatementEmitter.cpp 1559
ExpressionStatementEmitter.h frontend_ExpressionStatementEmitter_h 2131
FoldConstants.cpp 51505
FoldConstants.h namespace frontend 1729
ForInEmitter.cpp 4397
ForInEmitter.h namespace frontend 3711
ForOfEmitter.cpp 6580
ForOfEmitter.h namespace frontend 3469
ForOfLoopControl.cpp = CompletionKind::Normal 7444
ForOfLoopControl.h namespace frontend 3490
Frontend2.cpp 23367
Frontend2.h frontend_Frontend2_h 1878
FullParseHandler.h If this is a full parse to construct the bytecode for a function that was previously lazily parsed, we still don't want to full parse the inner functions. These members are used for this functionality: - lazyOuterFunction_ holds the lazyScript for this current parse - lazyInnerFunctionIndex is used as we skip over inner functions (see skipLazyInnerFunction), TODO-Stencil: We probably need to snapshot the atoms from the lazyOuterFunction here. 39977
FunctionEmitter.cpp 23693
FunctionEmitter.h 15848
FunctionSyntaxKind.h namespace frontend 1055
GenerateReservedWords.py 6066
IfEmitter.cpp = ConditionKind::Positive 7263
IfEmitter.h 9620
IteratorKind.h namespace js::frontend 523
JumpList.cpp 1489
JumpList.h namespace frontend 2721
LabelEmitter.cpp 997
LabelEmitter.h namespace frontend 1847
LexicalScopeEmitter.cpp 1399
LexicalScopeEmitter.h namespace frontend 2872
ModuleSharedContext.h frontend_ModuleSharedContext_h 1503
moz.build 2182
NameAnalysisTypes.h 12456
NameCollections.h 13851
NameFunctions.cpp Test whether a ParseNode represents a function invocation 16773
NameFunctions.h namespace frontend 710
NameOpEmitter.cpp 12576
NameOpEmitter.h namespace frontend 5036
ObjectEmitter.cpp = Kind::Prototype 24500
ObjectEmitter.h 28759
ObjLiteral.cpp 11829
ObjLiteral.h 22822
OptionalEmitter.cpp = Kind::Other 4420
OptionalEmitter.h 7513
ParseContext-inl.h 6143
ParseContext.cpp 23569
ParseContext.h The struct ParseContext stores information about the current parsing context, which is part of the parser state (see the field Parser::pc). The current parsing context is either the global context, or the function currently being parsed. When the parser encounters a function definition, it creates a new ParseContext, makes it the new current context. 21058
ParseNode.cpp Allocate a ParseNode from parser's node freelist or, failing that, from cx's temporary arena. 12733
ParseNode.h 84662
ParseNodeVerify.cpp 1483
ParseNodeVerify.h namespace frontend 1470
ParseNodeVisitor.h Utility class for walking a JS AST. Simple usage: class HowTrueVisitor : public ParseNodeVisitor<HowTrueVisitor> { public: bool visitTrueExpr(BooleanLiteral* pn) { std::cout << "How true.\n"; return true; } bool visitClassDecl(ClassNode* pn) { // The base-class implementation of each visit method // simply visits the node's children. So the subclass // gets to decide whether to descend into a subtree // and can do things either before or after: std::cout << "How classy.\n"; return ParseNodeVisitor::visitClassDecl(pn); } }; HowTrueVisitor v; v.visit(programRootNode); // walks the entire tree A ParseNodeVisitor can modify nodes, but it can't replace the current node with a different one; for that, use a RewritingParseNodeVisitor. Note that the Curiously Recurring Template Pattern is used for performance, as it eliminates the need for virtual method calls. Some rough testing shows about a 12% speedup in the FoldConstants.cpp pass. https://en.wikipedia.org/wiki/Curiously_recurring_template_pattern 4424
Parser.cpp JS parser. This is a recursive-descent parser for the JavaScript language specified by "The ECMAScript Language Specification" (Standard ECMA-262). It uses lexical and semantic feedback to disambiguate non-LL(1) structures. It generates trees of nodes induced by the recursive parsing (not precise syntax trees, see Parser.h). After tree construction, it rewrites trees to fold constants and evaluate compile-time expressions. This parser attempts no error recovery. 379432
Parser.h JS parser. 74424
ParserAtom.cpp static 31957
ParserAtom.h 26294
PrivateOpEmitter.cpp 8790
PrivateOpEmitter.h 7225
PropOpEmitter.cpp 6417
PropOpEmitter.h 7673
ReservedWords.h A higher-order macro for enumerating reserved word tokens. 4111
ScriptIndex.h namespace frontend 625
SharedContext-inl.h 725
SharedContext.cpp 14279
SharedContext.h The struct SharedContext is part of the current parser context (see ParseContext). It stores information that is reused between the parser and the bytecode emitter. 25337
smoosh 5
SourceNotes.cpp 548
SourceNotes.h Source notes generated along with bytecode for decompiling and debugging. A source note is a uint8_t with 4 bits of type and 4 of offset from the pc of the previous note. If 4 bits of offset aren't enough, extended delta notes (XDelta) consisting of 1 set high order bit followed by 7 offset bits are emitted before the next note. Some notes have operand offsets encoded immediately after them, in note bytes or byte-triples. Source Note Extended Delta +7-6-5-4+3-2-1-0+ +7+6-5-4-3-2-1-0+ | type | delta | |1| ext-delta | +-------+-------+ +-+-------------+ At most one "gettable" note (i.e., a note of type other than NewLine, ColSpan, SetLine, and XDelta) applies to a given bytecode. NB: the js::SrcNote::specs_ array is indexed by this enum, so its initializers need to match the order here. 13553
Stencil.cpp 120665
Stencil.h 36231
StencilXdr.cpp static 23238
StencilXdr.h namespace frontend 3530
SwitchEmitter.cpp 10657
SwitchEmitter.h 13846
SyntaxParseHandler.h 26485
TaggedParserAtomIndexHasher.h 1293
TDZCheckCache.cpp 2004
TDZCheckCache.h namespace frontend 2297
Token.h Token-affiliated data structures except for TokenKind (defined in its own header). 7373
TokenKind.h List of token kinds and their ranges. The format for each line is: MACRO(<TOKEN_KIND_NAME>, <DESCRIPTION>) or RANGE(<TOKEN_RANGE_NAME>, <TOKEN_KIND_NAME>) where ; <TOKEN_KIND_NAME> is a legal C identifier of the token, that will be used in the JS engine source. <DESCRIPTION> is a string that describe about the token, and will be used in error message. <TOKEN_RANGE_NAME> is a legal C identifier of the range that will be used to JS engine source. It should end with `First` or `Last`. This is used to check TokenKind by range-testing: BinOpFirst <= tt && tt <= BinOpLast Second argument of `RANGE` is the actual value of the <TOKEN_RANGE_NAME>, should be same as one of <TOKEN_KIND_NAME> in other `MACRO`s. To use this macro, define two macros for `MACRO` and `RANGE`, and pass them as arguments. #define EMIT_TOKEN(name, desc) ... #define EMIT_RANGE(name, value) ... FOR_EACH_TOKEN_KIND_WITH_RANGE(EMIT_TOKEN, EMIT_RANGE) #undef EMIT_TOKEN #undef EMIT_RANGE If you don't need range data, use FOR_EACH_TOKEN_KIND instead. #define EMIT_TOKEN(name, desc) ... FOR_EACH_TOKEN_KIND(EMIT_TOKEN) #undef EMIT_TOKEN Note that this list does not contain ERROR and LIMIT. 18090
TokenStream.cpp 124407
TokenStream.h Streaming access to the raw tokens of JavaScript source. Because JS tokenization is context-sensitive -- a '/' could be either a regular expression *or* a division operator depending on context -- the various token stream classes are mostly not useful outside of the Parser where they reside. We should probably eventually merge the two concepts. 109134
TryEmitter.cpp = Nothing() 6863
TryEmitter.h 6881
TypedIndex.h 1213
UsedNameTracker.h 9106
ValueUsage.h namespace frontend 983
WhileEmitter.cpp 2469
WhileEmitter.h namespace frontend 2510