1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
8 #include "src/allocation.h"
10 #include "src/compiler.h" // For CachedDataMode
11 #include "src/preparse-data.h"
12 #include "src/preparse-data-format.h"
13 #include "src/preparser.h"
14 #include "src/scopes.h"
21 class CompilationInfo;
26 template <typename T> class ZoneListWrapper;
29 class FunctionEntry BASE_EMBEDDED {
40 explicit FunctionEntry(Vector<unsigned> backing)
41 : backing_(backing) { }
43 FunctionEntry() : backing_() { }
45 int start_pos() { return backing_[kStartPositionIndex]; }
46 int end_pos() { return backing_[kEndPositionIndex]; }
47 int literal_count() { return backing_[kLiteralCountIndex]; }
48 int property_count() { return backing_[kPropertyCountIndex]; }
49 StrictMode strict_mode() {
50 DCHECK(backing_[kStrictModeIndex] == SLOPPY ||
51 backing_[kStrictModeIndex] == STRICT);
52 return static_cast<StrictMode>(backing_[kStrictModeIndex]);
55 bool is_valid() { return !backing_.is_empty(); }
58 Vector<unsigned> backing_;
62 // Wrapper around ScriptData to provide parser-specific functionality.
65 explicit ParseData(ScriptData* script_data) : script_data_(script_data) {
66 CHECK(IsAligned(script_data->length(), sizeof(unsigned)));
70 FunctionEntry GetFunctionEntry(int start);
75 unsigned* Data() { // Writable data as unsigned int array.
76 return reinterpret_cast<unsigned*>(const_cast<byte*>(script_data_->data()));
85 // Script data length is already checked to be a multiple of unsigned size.
86 return script_data_->length() / sizeof(unsigned);
89 ScriptData* script_data_;
92 DISALLOW_COPY_AND_ASSIGN(ParseData);
95 // ----------------------------------------------------------------------------
98 // A BufferedZoneList is an automatically growing list, just like (and backed
99 // by) a ZoneList, that is optimized for the case of adding and removing
100 // a single element. The last element added is stored outside the backing list,
101 // and if no more than one element is ever added, the ZoneList isn't even
103 // Elements must not be NULL pointers.
104 template <typename T, int initial_size>
105 class BufferedZoneList {
107 BufferedZoneList() : list_(NULL), last_(NULL) {}
109 // Adds element at end of list. This element is buffered and can
110 // be read using last() or removed using RemoveLast until a new Add or until
111 // RemoveLast or GetList has been called.
112 void Add(T* value, Zone* zone) {
115 list_ = new(zone) ZoneList<T*>(initial_size, zone);
117 list_->Add(last_, zone);
123 DCHECK(last_ != NULL);
128 DCHECK(last_ != NULL);
130 if ((list_ != NULL) && (list_->length() > 0))
131 last_ = list_->RemoveLast();
138 DCHECK((0 <= i) && (i < length()));
143 if (i == list_->length()) {
144 DCHECK(last_ != NULL);
158 int length = (list_ == NULL) ? 0 : list_->length();
159 return length + ((last_ == NULL) ? 0 : 1);
162 ZoneList<T*>* GetList(Zone* zone) {
164 list_ = new(zone) ZoneList<T*>(initial_size, zone);
167 list_->Add(last_, zone);
179 // Accumulates RegExp atoms and assertions into lists of terms and alternatives.
180 class RegExpBuilder: public ZoneObject {
182 explicit RegExpBuilder(Zone* zone);
183 void AddCharacter(uc16 character);
184 // "Adds" an empty expression. Does nothing except consume a
185 // following quantifier
187 void AddAtom(RegExpTree* tree);
188 void AddAssertion(RegExpTree* tree);
189 void NewAlternative(); // '|'
190 void AddQuantifierToAtom(
191 int min, int max, RegExpQuantifier::QuantifierType type);
192 RegExpTree* ToRegExp();
195 void FlushCharacters();
198 Zone* zone() const { return zone_; }
202 ZoneList<uc16>* characters_;
203 BufferedZoneList<RegExpTree, 2> terms_;
204 BufferedZoneList<RegExpTree, 2> text_;
205 BufferedZoneList<RegExpTree, 2> alternatives_;
207 enum {ADD_NONE, ADD_CHAR, ADD_TERM, ADD_ASSERT, ADD_ATOM} last_added_;
208 #define LAST(x) last_added_ = x;
215 class RegExpParser BASE_EMBEDDED {
217 RegExpParser(FlatStringReader* in,
218 Handle<String>* error,
222 static bool ParseRegExp(FlatStringReader* input,
224 RegExpCompileData* result,
227 RegExpTree* ParsePattern();
228 RegExpTree* ParseDisjunction();
229 RegExpTree* ParseGroup();
230 RegExpTree* ParseCharacterClass();
232 // Parses a {...,...} quantifier and stores the range in the given
234 bool ParseIntervalQuantifier(int* min_out, int* max_out);
236 // Parses and returns a single escaped character. The character
237 // must not be 'b' or 'B' since they are usually handle specially.
238 uc32 ParseClassCharacterEscape();
240 // Checks whether the following is a length-digit hexadecimal number,
241 // and sets the value if it is.
242 bool ParseHexEscape(int length, uc32* value);
244 uc32 ParseOctalLiteral();
246 // Tries to parse the input as a back reference. If successful it
247 // stores the result in the output parameter and returns true. If
248 // it fails it will push back the characters read so the same characters
250 bool ParseBackReferenceIndex(int* index_out);
252 CharacterRange ParseClassAtom(uc16* char_class);
253 RegExpTree* ReportError(Vector<const char> message);
255 void Advance(int dist);
258 // Reports whether the pattern might be used as a literal search string.
259 // Only use if the result of the parse is a single atom node.
261 bool contains_anchor() { return contains_anchor_; }
262 void set_contains_anchor() { contains_anchor_ = true; }
263 int captures_started() { return captures_ == NULL ? 0 : captures_->length(); }
264 int position() { return next_pos_ - 1; }
265 bool failed() { return failed_; }
267 static const int kMaxCaptures = 1 << 16;
268 static const uc32 kEndMarker = (1 << 21);
271 enum SubexpressionType {
273 CAPTURE, // All positive values represent captures.
279 class RegExpParserState : public ZoneObject {
281 RegExpParserState(RegExpParserState* previous_state,
282 SubexpressionType group_type,
283 int disjunction_capture_index,
285 : previous_state_(previous_state),
286 builder_(new(zone) RegExpBuilder(zone)),
287 group_type_(group_type),
288 disjunction_capture_index_(disjunction_capture_index) {}
289 // Parser state of containing expression, if any.
290 RegExpParserState* previous_state() { return previous_state_; }
291 bool IsSubexpression() { return previous_state_ != NULL; }
292 // RegExpBuilder building this regexp's AST.
293 RegExpBuilder* builder() { return builder_; }
294 // Type of regexp being parsed (parenthesized group or entire regexp).
295 SubexpressionType group_type() { return group_type_; }
296 // Index in captures array of first capture in this sub-expression, if any.
297 // Also the capture index of this sub-expression itself, if group_type
299 int capture_index() { return disjunction_capture_index_; }
302 // Linked list implementation of stack of states.
303 RegExpParserState* previous_state_;
304 // Builder for the stored disjunction.
305 RegExpBuilder* builder_;
306 // Stored disjunction type (capture, look-ahead or grouping), if any.
307 SubexpressionType group_type_;
308 // Stored disjunction's capture index (if any).
309 int disjunction_capture_index_;
312 Isolate* isolate() { return isolate_; }
313 Zone* zone() const { return zone_; }
315 uc32 current() { return current_; }
316 bool has_more() { return has_more_; }
317 bool has_next() { return next_pos_ < in()->length(); }
319 FlatStringReader* in() { return in_; }
320 void ScanForCaptures();
324 Handle<String>* error_;
325 ZoneList<RegExpCapture*>* captures_;
326 FlatStringReader* in_;
329 // The capture count is only valid after we have scanned for captures.
334 bool contains_anchor_;
335 bool is_scanned_for_captures_;
339 // ----------------------------------------------------------------------------
340 // JAVASCRIPT PARSING
343 class SingletonLogger;
348 // TODO(marja): To be removed. The Traits object should contain all the data
350 typedef v8::internal::Parser* Parser;
352 // Used by FunctionState and BlockState.
353 typedef v8::internal::Scope Scope;
354 typedef v8::internal::Scope* ScopePtr;
355 typedef Variable GeneratorVariable;
356 typedef v8::internal::Zone Zone;
358 typedef v8::internal::AstProperties AstProperties;
359 typedef Vector<VariableProxy*> ParameterIdentifierVector;
361 // Return types for traversing functions.
362 typedef const AstRawString* Identifier;
363 typedef v8::internal::Expression* Expression;
364 typedef Yield* YieldExpression;
365 typedef v8::internal::FunctionLiteral* FunctionLiteral;
366 typedef v8::internal::ClassLiteral* ClassLiteral;
367 typedef v8::internal::Literal* Literal;
368 typedef ObjectLiteral::Property* ObjectLiteralProperty;
369 typedef ZoneList<v8::internal::Expression*>* ExpressionList;
370 typedef ZoneList<ObjectLiteral::Property*>* PropertyList;
371 typedef ZoneList<v8::internal::Statement*>* StatementList;
373 // For constructing objects returned by the traversing functions.
374 typedef AstNodeFactory<AstConstructionVisitor> Factory;
379 explicit ParserTraits(Parser* parser) : parser_(parser) {}
381 // Custom operations executed when FunctionStates are created and destructed.
382 template <typename FunctionState>
383 static void SetUpFunctionState(FunctionState* function_state) {
384 function_state->saved_id_gen_ = *function_state->ast_node_id_gen_;
385 *function_state->ast_node_id_gen_ =
386 AstNode::IdGen(BailoutId::FirstUsable().ToInt());
389 template <typename FunctionState>
390 static void TearDownFunctionState(FunctionState* function_state) {
391 if (function_state->outer_function_state_ != NULL) {
392 *function_state->ast_node_id_gen_ = function_state->saved_id_gen_;
396 // Helper functions for recursive descent.
397 bool IsEvalOrArguments(const AstRawString* identifier) const;
398 V8_INLINE bool IsFutureStrictReserved(const AstRawString* identifier) const;
400 // Returns true if the expression is of type "this.foo".
401 static bool IsThisProperty(Expression* expression);
403 static bool IsIdentifier(Expression* expression);
405 bool IsPrototype(const AstRawString* identifier) const;
407 bool IsConstructor(const AstRawString* identifier) const;
409 static const AstRawString* AsIdentifier(Expression* expression) {
410 DCHECK(IsIdentifier(expression));
411 return expression->AsVariableProxy()->raw_name();
414 static bool IsBoilerplateProperty(ObjectLiteral::Property* property) {
415 return ObjectLiteral::IsBoilerplateProperty(property);
418 static bool IsArrayIndex(const AstRawString* string, uint32_t* index) {
419 return string->AsArrayIndex(index);
422 // Functions for encapsulating the differences between parsing and preparsing;
423 // operations interleaved with the recursive descent.
424 static void PushLiteralName(FuncNameInferrer* fni, const AstRawString* id) {
425 fni->PushLiteralName(id);
427 void PushPropertyName(FuncNameInferrer* fni, Expression* expression);
428 static void InferFunctionName(FuncNameInferrer* fni,
429 FunctionLiteral* func_to_infer) {
430 fni->AddFunction(func_to_infer);
433 static void CheckFunctionLiteralInsideTopLevelObjectLiteral(
434 Scope* scope, ObjectLiteralProperty* property, bool* has_function) {
435 Expression* value = property->value();
436 if (scope->DeclarationScope()->is_global_scope() &&
437 value->AsFunctionLiteral() != NULL) {
438 *has_function = true;
439 value->AsFunctionLiteral()->set_pretenure();
443 // If we assign a function literal to a property we pretenure the
444 // literal so it can be added as a constant function property.
445 static void CheckAssigningFunctionLiteralToProperty(Expression* left,
448 // Keep track of eval() calls since they disable all local variable
449 // optimizations. This checks if expression is an eval call, and if yes,
450 // forwards the information to scope.
451 void CheckPossibleEvalCall(Expression* expression, Scope* scope);
453 // Determine if the expression is a variable proxy and mark it as being used
454 // in an assignment or with a increment/decrement operator.
455 static Expression* MarkExpressionAsAssigned(Expression* expression);
457 // Returns true if we have a binary expression between two numeric
458 // literals. In that case, *x will be changed to an expression which is the
460 bool ShortcutNumericLiteralBinaryExpression(
461 Expression** x, Expression* y, Token::Value op, int pos,
462 AstNodeFactory<AstConstructionVisitor>* factory);
464 // Rewrites the following types of unary expressions:
465 // not <literal> -> true / false
466 // + <numeric literal> -> <numeric literal>
467 // - <numeric literal> -> <numeric literal with value negated>
468 // ! <literal> -> true / false
469 // The following rewriting rules enable the collection of type feedback
470 // without any special stub and the multiplication is removed later in
471 // Crankshaft's canonicalization pass.
473 // - foo -> foo * (-1)
474 // ~ foo -> foo ^(~0)
475 Expression* BuildUnaryExpression(
476 Expression* expression, Token::Value op, int pos,
477 AstNodeFactory<AstConstructionVisitor>* factory);
479 // Generate AST node that throws a ReferenceError with the given type.
480 Expression* NewThrowReferenceError(const char* type, int pos);
482 // Generate AST node that throws a SyntaxError with the given
483 // type. The first argument may be null (in the handle sense) in
484 // which case no arguments are passed to the constructor.
485 Expression* NewThrowSyntaxError(
486 const char* type, const AstRawString* arg, int pos);
488 // Generate AST node that throws a TypeError with the given
489 // type. Both arguments must be non-null (in the handle sense).
490 Expression* NewThrowTypeError(const char* type, const AstRawString* arg,
493 // Generic AST generator for throwing errors from compiled code.
494 Expression* NewThrowError(
495 const AstRawString* constructor, const char* type,
496 const AstRawString* arg, int pos);
499 void ReportMessageAt(Scanner::Location source_location,
501 const char* arg = NULL,
502 bool is_reference_error = false);
503 void ReportMessage(const char* message,
504 const char* arg = NULL,
505 bool is_reference_error = false);
506 void ReportMessage(const char* message,
507 const AstRawString* arg,
508 bool is_reference_error = false);
509 void ReportMessageAt(Scanner::Location source_location,
511 const AstRawString* arg,
512 bool is_reference_error = false);
514 // "null" return type creators.
515 static const AstRawString* EmptyIdentifier() {
518 static Expression* EmptyExpression() {
521 static Expression* EmptyArrowParamList() { return NULL; }
522 static Literal* EmptyLiteral() {
525 static ObjectLiteralProperty* EmptyObjectLiteralProperty() { return NULL; }
526 static FunctionLiteral* EmptyFunctionLiteral() { return NULL; }
528 // Used in error return values.
529 static ZoneList<Expression*>* NullExpressionList() {
533 // Non-NULL empty string.
534 V8_INLINE const AstRawString* EmptyIdentifierString();
536 // Odd-ball literal creators.
537 Literal* GetLiteralTheHole(int position,
538 AstNodeFactory<AstConstructionVisitor>* factory);
540 // Producing data during the recursive descent.
541 const AstRawString* GetSymbol(Scanner* scanner);
542 const AstRawString* GetNextSymbol(Scanner* scanner);
543 const AstRawString* GetNumberAsSymbol(Scanner* scanner);
545 Expression* ThisExpression(Scope* scope,
546 AstNodeFactory<AstConstructionVisitor>* factory,
547 int pos = RelocInfo::kNoPosition);
548 Expression* SuperReference(Scope* scope,
549 AstNodeFactory<AstConstructionVisitor>* factory,
550 int pos = RelocInfo::kNoPosition);
551 Expression* ClassLiteral(const AstRawString* name, Expression* extends,
552 Expression* constructor,
553 ZoneList<ObjectLiteral::Property*>* properties,
555 AstNodeFactory<AstConstructionVisitor>* factory);
557 Literal* ExpressionFromLiteral(
558 Token::Value token, int pos, Scanner* scanner,
559 AstNodeFactory<AstConstructionVisitor>* factory);
560 Expression* ExpressionFromIdentifier(
561 const AstRawString* name, int pos, Scope* scope,
562 AstNodeFactory<AstConstructionVisitor>* factory);
563 Expression* ExpressionFromString(
564 int pos, Scanner* scanner,
565 AstNodeFactory<AstConstructionVisitor>* factory);
566 Expression* GetIterator(Expression* iterable,
567 AstNodeFactory<AstConstructionVisitor>* factory);
568 ZoneList<v8::internal::Expression*>* NewExpressionList(int size, Zone* zone) {
569 return new(zone) ZoneList<v8::internal::Expression*>(size, zone);
571 ZoneList<ObjectLiteral::Property*>* NewPropertyList(int size, Zone* zone) {
572 return new(zone) ZoneList<ObjectLiteral::Property*>(size, zone);
574 ZoneList<v8::internal::Statement*>* NewStatementList(int size, Zone* zone) {
575 return new(zone) ZoneList<v8::internal::Statement*>(size, zone);
577 V8_INLINE Scope* NewScope(Scope* parent_scope, ScopeType scope_type);
580 int DeclareArrowParametersFromExpression(Expression* expression, Scope* scope,
581 Scanner::Location* dupe_loc,
583 V8_INLINE AstValueFactory* ast_value_factory();
585 // Temporary glue; these functions will move to ParserBase.
586 Expression* ParseV8Intrinsic(bool* ok);
587 FunctionLiteral* ParseFunctionLiteral(
588 const AstRawString* name, Scanner::Location function_name_location,
589 bool name_is_strict_reserved, FunctionKind kind,
590 int function_token_position, FunctionLiteral::FunctionType type,
591 FunctionLiteral::ArityRestriction arity_restriction, bool* ok);
592 V8_INLINE void SkipLazyFunctionBody(const AstRawString* name,
593 int* materialized_literal_count,
594 int* expected_property_count, bool* ok);
595 V8_INLINE ZoneList<Statement*>* ParseEagerFunctionBody(
596 const AstRawString* name, int pos, Variable* fvar,
597 Token::Value fvar_init_op, bool is_generator, bool* ok);
598 V8_INLINE void CheckConflictingVarDeclarations(v8::internal::Scope* scope,
606 class Parser : public ParserBase<ParserTraits> {
608 // Note that the hash seed in ParseInfo must be the hash seed from the
609 // Isolate's heap, otherwise the heap will be in an inconsistent state once
610 // the strings created by the Parser are internalized.
612 uintptr_t stack_limit;
614 UnicodeCache* unicode_cache;
617 Parser(CompilationInfo* info, ParseInfo* parse_info);
619 delete reusable_preparser_;
620 reusable_preparser_ = NULL;
621 delete cached_parse_data_;
622 cached_parse_data_ = NULL;
625 // Parses the source code represented by the compilation info and sets its
626 // function literal. Returns false (and deallocates any allocated AST
627 // nodes) if parsing failed.
628 static bool Parse(CompilationInfo* info,
629 bool allow_lazy = false) {
630 ParseInfo parse_info = {info->isolate()->stack_guard()->real_climit(),
631 info->isolate()->heap()->HashSeed(),
632 info->isolate()->unicode_cache()};
633 Parser parser(info, &parse_info);
634 parser.set_allow_lazy(allow_lazy);
635 if (parser.Parse()) {
636 info->SetStrictMode(info->function()->strict_mode());
642 void ParseOnBackground();
644 // Handle errors detected during parsing, move statistics to Isolate,
645 // internalize strings (move them to the heap).
649 friend class ParserTraits;
651 // Limit the allowed number of local variables in a function. The hard limit
652 // is that offsets computed by FullCodeGenerator::StackOperand and similar
653 // functions are ints, and they should not overflow. In addition, accessing
654 // local variables creates user-controlled constants in the generated code,
655 // and we don't want too much user-controlled memory inside the code (this was
656 // the reason why this limit was introduced in the first place; see
657 // https://codereview.chromium.org/7003030/ ).
658 static const int kMaxNumFunctionLocals = 4194303; // 2^22-1
660 enum VariableDeclarationContext {
667 // If a list of variable declarations includes any initializers.
668 enum VariableDeclarationProperties {
673 // Returns NULL if parsing failed.
674 FunctionLiteral* ParseProgram();
676 FunctionLiteral* ParseLazy();
677 FunctionLiteral* ParseLazy(Utf16CharacterStream* source);
679 Isolate* isolate() { return info_->isolate(); }
680 CompilationInfo* info() const { return info_; }
681 Handle<Script> script() const { return info_->script(); }
682 AstValueFactory* ast_value_factory() const {
683 return info_->ast_value_factory();
686 // Called by ParseProgram after setting up the scanner.
687 FunctionLiteral* DoParseProgram(CompilationInfo* info, Scope** scope,
688 Scope** ad_hoc_eval_scope);
690 void SetCachedData();
692 bool inside_with() const { return scope_->inside_with(); }
693 ScriptCompiler::CompileOptions compile_options() const {
694 return info_->compile_options();
696 Scope* DeclarationScope(VariableMode mode) {
697 return IsLexicalVariableMode(mode)
698 ? scope_ : scope_->DeclarationScope();
701 // All ParseXXX functions take as the last argument an *ok parameter
702 // which is set to false if parsing failed; it is unchanged otherwise.
703 // By making the 'exception handling' explicit, we are forced to check
704 // for failure at the call sites.
705 void* ParseSourceElements(ZoneList<Statement*>* processor, int end_token,
706 bool is_eval, bool is_global,
707 Scope** ad_hoc_eval_scope, bool* ok);
708 Statement* ParseModuleElement(ZoneList<const AstRawString*>* labels,
710 Statement* ParseModuleDeclaration(ZoneList<const AstRawString*>* names,
712 Module* ParseModule(bool* ok);
713 Module* ParseModuleLiteral(bool* ok);
714 Module* ParseModulePath(bool* ok);
715 Module* ParseModuleVariable(bool* ok);
716 Module* ParseModuleUrl(bool* ok);
717 Module* ParseModuleSpecifier(bool* ok);
718 Block* ParseImportDeclaration(bool* ok);
719 Statement* ParseExportDeclaration(bool* ok);
720 Statement* ParseBlockElement(ZoneList<const AstRawString*>* labels, bool* ok);
721 Statement* ParseStatement(ZoneList<const AstRawString*>* labels, bool* ok);
722 Statement* ParseFunctionDeclaration(ZoneList<const AstRawString*>* names,
724 Statement* ParseClassDeclaration(ZoneList<const AstRawString*>* names,
726 Statement* ParseNativeDeclaration(bool* ok);
727 Block* ParseBlock(ZoneList<const AstRawString*>* labels, bool* ok);
728 Block* ParseVariableStatement(VariableDeclarationContext var_context,
729 ZoneList<const AstRawString*>* names,
731 Block* ParseVariableDeclarations(VariableDeclarationContext var_context,
732 VariableDeclarationProperties* decl_props,
733 ZoneList<const AstRawString*>* names,
734 const AstRawString** out,
736 Statement* ParseExpressionOrLabelledStatement(
737 ZoneList<const AstRawString*>* labels, bool* ok);
738 IfStatement* ParseIfStatement(ZoneList<const AstRawString*>* labels,
740 Statement* ParseContinueStatement(bool* ok);
741 Statement* ParseBreakStatement(ZoneList<const AstRawString*>* labels,
743 Statement* ParseReturnStatement(bool* ok);
744 Statement* ParseWithStatement(ZoneList<const AstRawString*>* labels,
746 CaseClause* ParseCaseClause(bool* default_seen_ptr, bool* ok);
747 SwitchStatement* ParseSwitchStatement(ZoneList<const AstRawString*>* labels,
749 DoWhileStatement* ParseDoWhileStatement(ZoneList<const AstRawString*>* labels,
751 WhileStatement* ParseWhileStatement(ZoneList<const AstRawString*>* labels,
753 Statement* ParseForStatement(ZoneList<const AstRawString*>* labels, bool* ok);
754 Statement* ParseThrowStatement(bool* ok);
755 Expression* MakeCatchContext(Handle<String> id, VariableProxy* value);
756 TryStatement* ParseTryStatement(bool* ok);
757 DebuggerStatement* ParseDebuggerStatement(bool* ok);
759 // Support for hamony block scoped bindings.
760 Block* ParseScopedBlock(ZoneList<const AstRawString*>* labels, bool* ok);
762 // Initialize the components of a for-in / for-of statement.
763 void InitializeForEachStatement(ForEachStatement* stmt,
767 Statement* DesugarLetBindingsInForStatement(
768 Scope* inner_scope, ZoneList<const AstRawString*>* names,
769 ForStatement* loop, Statement* init, Expression* cond, Statement* next,
770 Statement* body, bool* ok);
772 FunctionLiteral* ParseFunctionLiteral(
773 const AstRawString* name, Scanner::Location function_name_location,
774 bool name_is_strict_reserved, FunctionKind kind,
775 int function_token_position, FunctionLiteral::FunctionType type,
776 FunctionLiteral::ArityRestriction arity_restriction, bool* ok);
778 // Magical syntax support.
779 Expression* ParseV8Intrinsic(bool* ok);
781 bool CheckInOrOf(bool accept_OF, ForEachStatement::VisitMode* visit_mode);
783 // Get odd-ball literals.
784 Literal* GetLiteralUndefined(int position);
786 // For harmony block scoping mode: Check if the scope has conflicting var/let
787 // declarations from different scopes. It covers for example
789 // function f() { { { var x; } let x; } }
790 // function g() { { var x; let x; } }
792 // The var declarations are hoisted to the function scope, but originate from
793 // a scope where the name has also been let bound or the var declaration is
794 // hoisted over such a scope.
795 void CheckConflictingVarDeclarations(Scope* scope, bool* ok);
798 VariableProxy* NewUnresolved(const AstRawString* name,
800 Interface* interface);
801 void Declare(Declaration* declaration, bool resolve, bool* ok);
803 bool TargetStackContainsLabel(const AstRawString* label);
804 BreakableStatement* LookupBreakTarget(const AstRawString* label, bool* ok);
805 IterationStatement* LookupContinueTarget(const AstRawString* label, bool* ok);
807 void RegisterTargetUse(Label* target, Target* stop);
811 Scope* NewScope(Scope* parent, ScopeType type);
813 // Skip over a lazy function, either using cached data if we have it, or
814 // by parsing the function with PreParser. Consumes the ending }.
815 void SkipLazyFunctionBody(const AstRawString* function_name,
816 int* materialized_literal_count,
817 int* expected_property_count,
820 PreParser::PreParseResult ParseLazyFunctionBodyWithPreParser(
821 SingletonLogger* logger);
823 // Consumes the ending }.
824 ZoneList<Statement*>* ParseEagerFunctionBody(
825 const AstRawString* function_name, int pos, Variable* fvar,
826 Token::Value fvar_init_op, bool is_generator, bool* ok);
828 void HandleSourceURLComments();
830 void ThrowPendingError();
833 PreParser* reusable_preparser_;
834 Scope* original_scope_; // for ES5 function declarations in sloppy eval
835 Target* target_stack_; // for break, continue statements
836 ParseData* cached_parse_data_;
838 CompilationInfo* info_;
841 bool has_pending_error_;
842 Scanner::Location pending_error_location_;
843 const char* pending_error_message_;
844 const AstRawString* pending_error_arg_;
845 const char* pending_error_char_arg_;
846 bool pending_error_is_reference_error_;
848 // Other information which will be stored in Parser and moved to Isolate after
850 int use_counts_[v8::Isolate::kUseCounterFeatureCount];
851 int total_preparse_skipped_;
852 HistogramTimer* pre_parse_timer_;
856 bool ParserTraits::IsFutureStrictReserved(
857 const AstRawString* identifier) const {
858 return identifier->IsOneByteEqualTo("yield") ||
859 parser_->scanner()->IdentifierIsFutureStrictReserved(identifier);
863 Scope* ParserTraits::NewScope(Scope* parent_scope, ScopeType scope_type) {
864 return parser_->NewScope(parent_scope, scope_type);
868 const AstRawString* ParserTraits::EmptyIdentifierString() {
869 return parser_->ast_value_factory()->empty_string();
873 void ParserTraits::SkipLazyFunctionBody(const AstRawString* function_name,
874 int* materialized_literal_count,
875 int* expected_property_count,
877 return parser_->SkipLazyFunctionBody(
878 function_name, materialized_literal_count, expected_property_count, ok);
882 ZoneList<Statement*>* ParserTraits::ParseEagerFunctionBody(
883 const AstRawString* name, int pos, Variable* fvar,
884 Token::Value fvar_init_op, bool is_generator, bool* ok) {
885 return parser_->ParseEagerFunctionBody(name, pos, fvar, fvar_init_op,
889 void ParserTraits::CheckConflictingVarDeclarations(v8::internal::Scope* scope,
891 parser_->CheckConflictingVarDeclarations(scope, ok);
895 AstValueFactory* ParserTraits::ast_value_factory() {
896 return parser_->ast_value_factory();
900 // Support for handling complex values (array and object literals) that
901 // can be fully handled at compile time.
902 class CompileTimeValue: public AllStatic {
905 OBJECT_LITERAL_FAST_ELEMENTS,
906 OBJECT_LITERAL_SLOW_ELEMENTS,
910 static bool IsCompileTimeValue(Expression* expression);
912 // Get the value as a compile time value.
913 static Handle<FixedArray> GetValue(Isolate* isolate, Expression* expression);
915 // Get the type of a compile time value returned by GetValue().
916 static LiteralType GetLiteralType(Handle<FixedArray> value);
918 // Get the elements array of a compile time value returned by GetValue().
919 static Handle<FixedArray> GetElements(Handle<FixedArray> value);
922 static const int kLiteralTypeSlot = 0;
923 static const int kElementsSlot = 1;
925 DISALLOW_IMPLICIT_CONSTRUCTORS(CompileTimeValue);
928 } } // namespace v8::internal
930 #endif // V8_PARSER_H_