OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #ifndef V8_PREPARSER_H | 28 #ifndef V8_PREPARSER_H |
29 #define V8_PREPARSER_H | 29 #define V8_PREPARSER_H |
30 | 30 |
31 namespace v8 { | 31 namespace v8 { |
32 namespace preparser { | 32 namespace preparser { |
33 | 33 |
34 typedef uint8_t byte; | |
35 | |
36 // Preparsing checks a JavaScript program and emits preparse-data that helps | 34 // Preparsing checks a JavaScript program and emits preparse-data that helps |
37 // a later parsing to be faster. | 35 // a later parsing to be faster. |
38 // See preparse-data-format.h for the data format. | 36 // See preparse-data-format.h for the data format. |
39 | 37 |
40 // The PreParser checks that the syntax follows the grammar for JavaScript, | 38 // The PreParser checks that the syntax follows the grammar for JavaScript, |
41 // and collects some information about the program along the way. | 39 // and collects some information about the program along the way. |
42 // The grammar check is only performed in order to understand the program | 40 // The grammar check is only performed in order to understand the program |
43 // sufficiently to deduce some information about it, that can be used | 41 // sufficiently to deduce some information about it, that can be used |
44 // to speed up later parsing. Finding errors is not the goal of pre-parsing, | 42 // to speed up later parsing. Finding errors is not the goal of pre-parsing, |
45 // rather it is to speed up properly written and correct programs. | 43 // rather it is to speed up properly written and correct programs. |
46 // That means that contextual checks (like a label being declared where | 44 // That means that contextual checks (like a label being declared where |
47 // it is used) are generally omitted. | 45 // it is used) are generally omitted. |
48 | 46 |
49 namespace i = v8::internal; | 47 namespace i = v8::internal; |
50 | 48 |
51 class DuplicateFinder { | |
52 public: | |
53 DuplicateFinder() | |
54 : backing_store_(16), | |
55 map_(new i::HashMap(&Match)) { } | |
56 ~DuplicateFinder() { | |
57 delete map_; | |
58 } | |
59 | |
60 int AddAsciiSymbol(i::Vector<const char> key, int value); | |
61 int AddUC16Symbol(i::Vector<const uint16_t> key, int value); | |
62 // Add a a number literal by converting it (if necessary) | |
63 // to the string that ToString(ToNumber(literal)) would generate. | |
64 // and then adding that string with AddAsciiSymbol. | |
65 // This string is the actual value used as key in an object literal, | |
66 // and the one that must be different from the other keys. | |
67 int AddNumber(i::Vector<const char> key, int value); | |
68 | |
69 private: | |
70 int AddSymbol(i::Vector<const byte> key, bool is_ascii, int value); | |
71 // Backs up the key and its length in the backing store. | |
72 // The backup is stored with a base 127 encoding of the | |
73 // length (plus a bit saying whether the string is ASCII), | |
74 // followed by the bytes of the key. | |
75 byte* BackupKey(i::Vector<const byte> key, bool is_ascii); | |
76 | |
77 // Compare two encoded keys (both pointing into the backing store) | |
78 // for having the same base-127 encoded lengths and ASCII-ness, | |
79 // and then having the same 'length' bytes following. | |
80 static bool Match(void* first, void* second); | |
81 // Creates a hash from a sequence of bytes. | |
82 static uint32_t Hash(i::Vector<const byte> key, bool is_ascii); | |
83 // Checks whether a string containing a JS number is its canonical | |
84 // form. | |
85 static bool IsNumberCanonical(i::Vector<const char> key); | |
86 | |
87 static const int kBufferSize = 100; | |
88 // Buffer used for string->number->canonical string conversions. | |
89 char number_buffer_[kBufferSize]; | |
90 // Backing store used to store strings used as hashmap keys. | |
91 i::SequenceCollector<unsigned char> backing_store_; | |
92 i::HashMap* map_; | |
93 }; | |
94 | |
95 | |
96 class PreParser { | 49 class PreParser { |
97 public: | 50 public: |
98 enum PreParseResult { | 51 enum PreParseResult { |
99 kPreParseStackOverflow, | 52 kPreParseStackOverflow, |
100 kPreParseSuccess | 53 kPreParseSuccess |
101 }; | 54 }; |
102 | 55 |
103 ~PreParser() { } | 56 ~PreParser() { } |
104 | 57 |
105 // Pre-parse the program from the character stream; returns true on | 58 // Pre-parse the program from the character stream; returns true on |
106 // success (even if parsing failed, the pre-parse data successfully | 59 // success (even if parsing failed, the pre-parse data successfully |
107 // captured the syntax error), and false if a stack-overflow happened | 60 // captured the syntax error), and false if a stack-overflow happened |
108 // during parsing. | 61 // during parsing. |
109 static PreParseResult PreParseProgram(i::JavaScriptScanner* scanner, | 62 static PreParseResult PreParseProgram(i::JavaScriptScanner* scanner, |
110 i::ParserRecorder* log, | 63 i::ParserRecorder* log, |
111 bool allow_lazy, | 64 bool allow_lazy, |
112 uintptr_t stack_limit) { | 65 uintptr_t stack_limit) { |
113 return PreParser(scanner, log, stack_limit, allow_lazy).PreParse(); | 66 return PreParser(scanner, log, stack_limit, allow_lazy).PreParse(); |
114 } | 67 } |
115 | 68 |
116 private: | 69 private: |
117 // Used to detect duplicates in object literals. | |
118 enum PropertyType { | |
119 kNone = 0, | |
120 // Bit patterns representing different object literal property types. | |
121 kGetterProperty = 1, | |
122 kSetterProperty = 2, | |
123 kValueProperty = 7, | |
124 // Helper constants. | |
125 kValueFlag = 4 | |
126 }; | |
127 | |
128 void CheckDuplicate(DuplicateFinder* finder, | |
129 i::Token::Value property, | |
130 int type, | |
131 bool* ok); | |
132 | |
133 // These types form an algebra over syntactic categories that is just | 70 // These types form an algebra over syntactic categories that is just |
134 // rich enough to let us recognize and propagate the constructs that | 71 // rich enough to let us recognize and propagate the constructs that |
135 // are either being counted in the preparser data, or is important | 72 // are either being counted in the preparser data, or is important |
136 // to throw the correct syntax error exceptions. | 73 // to throw the correct syntax error exceptions. |
137 | 74 |
138 enum ScopeType { | 75 enum ScopeType { |
139 kTopLevelScope, | 76 kTopLevelScope, |
140 kFunctionScope | 77 kFunctionScope |
141 }; | 78 }; |
142 | 79 |
(...skipping 277 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
420 if (!ok) { | 357 if (!ok) { |
421 ReportUnexpectedToken(scanner_->current_token()); | 358 ReportUnexpectedToken(scanner_->current_token()); |
422 } else if (scope_->is_strict()) { | 359 } else if (scope_->is_strict()) { |
423 CheckOctalLiteral(start_position, scanner_->location().end_pos, &ok); | 360 CheckOctalLiteral(start_position, scanner_->location().end_pos, &ok); |
424 } | 361 } |
425 return kPreParseSuccess; | 362 return kPreParseSuccess; |
426 } | 363 } |
427 | 364 |
428 // Report syntax error | 365 // Report syntax error |
429 void ReportUnexpectedToken(i::Token::Value token); | 366 void ReportUnexpectedToken(i::Token::Value token); |
430 void ReportMessageAt(i::Scanner::Location location, | |
431 const char* type, | |
432 const char* name_opt) { | |
433 log_->LogMessage(location.beg_pos, location.end_pos, type, name_opt); | |
434 } | |
435 void ReportMessageAt(int start_pos, | 367 void ReportMessageAt(int start_pos, |
436 int end_pos, | 368 int end_pos, |
437 const char* type, | 369 const char* type, |
438 const char* name_opt) { | 370 const char* name_opt) { |
439 log_->LogMessage(start_pos, end_pos, type, name_opt); | 371 log_->LogMessage(start_pos, end_pos, type, name_opt); |
440 } | 372 } |
441 | 373 |
442 void CheckOctalLiteral(int beg_pos, int end_pos, bool* ok); | 374 void CheckOctalLiteral(int beg_pos, int end_pos, bool* ok); |
443 | 375 |
444 // All ParseXXX functions take as the last argument an *ok parameter | 376 // All ParseXXX functions take as the last argument an *ok parameter |
(...skipping 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
561 uintptr_t stack_limit_; | 493 uintptr_t stack_limit_; |
562 i::Scanner::Location strict_mode_violation_location_; | 494 i::Scanner::Location strict_mode_violation_location_; |
563 const char* strict_mode_violation_type_; | 495 const char* strict_mode_violation_type_; |
564 bool stack_overflow_; | 496 bool stack_overflow_; |
565 bool allow_lazy_; | 497 bool allow_lazy_; |
566 bool parenthesized_function_; | 498 bool parenthesized_function_; |
567 }; | 499 }; |
568 } } // v8::preparser | 500 } } // v8::preparser |
569 | 501 |
570 #endif // V8_PREPARSER_H | 502 #endif // V8_PREPARSER_H |
OLD | NEW |