| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 1053 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1064 bool not_at_start); | 1064 bool not_at_start); |
| 1065 virtual ChoiceNode* Clone() { return new ChoiceNode(*this); } | 1065 virtual ChoiceNode* Clone() { return new ChoiceNode(*this); } |
| 1066 | 1066 |
| 1067 bool being_calculated() { return being_calculated_; } | 1067 bool being_calculated() { return being_calculated_; } |
| 1068 bool not_at_start() { return not_at_start_; } | 1068 bool not_at_start() { return not_at_start_; } |
| 1069 void set_not_at_start() { not_at_start_ = true; } | 1069 void set_not_at_start() { not_at_start_ = true; } |
| 1070 void set_being_calculated(bool b) { being_calculated_ = b; } | 1070 void set_being_calculated(bool b) { being_calculated_ = b; } |
| 1071 virtual bool try_to_emit_quick_check_for_alternative(int i) { return true; } | 1071 virtual bool try_to_emit_quick_check_for_alternative(int i) { return true; } |
| 1072 | 1072 |
| 1073 protected: | 1073 protected: |
| 1074 int GreedyLoopTextLength(GuardedAlternative* alternative); | 1074 int GreedyLoopTextLengthForAlternative(GuardedAlternative* alternative); |
| 1075 ZoneList<GuardedAlternative>* alternatives_; | 1075 ZoneList<GuardedAlternative>* alternatives_; |
| 1076 | 1076 |
| 1077 private: | 1077 private: |
| 1078 friend class DispatchTableConstructor; | 1078 friend class DispatchTableConstructor; |
| 1079 friend class Analysis; | 1079 friend class Analysis; |
| 1080 void GenerateGuard(RegExpMacroAssembler* macro_assembler, | 1080 void GenerateGuard(RegExpMacroAssembler* macro_assembler, |
| 1081 Guard* guard, | 1081 Guard* guard, |
| 1082 Trace* trace); | 1082 Trace* trace); |
| 1083 int CalculatePreloadCharacters(RegExpCompiler* compiler, bool not_at_start); | 1083 int CalculatePreloadCharacters(RegExpCompiler* compiler, bool not_at_start); |
| 1084 void EmitOutOfLineContinuation(RegExpCompiler* compiler, | 1084 void EmitOutOfLineContinuation(RegExpCompiler* compiler, |
| (...skipping 397 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1482 int* vector_; | 1482 int* vector_; |
| 1483 int offsets_vector_length_; | 1483 int offsets_vector_length_; |
| 1484 | 1484 |
| 1485 friend class ExternalReference; | 1485 friend class ExternalReference; |
| 1486 }; | 1486 }; |
| 1487 | 1487 |
| 1488 | 1488 |
| 1489 } } // namespace v8::internal | 1489 } } // namespace v8::internal |
| 1490 | 1490 |
| 1491 #endif // V8_JSREGEXP_H_ | 1491 #endif // V8_JSREGEXP_H_ |
| OLD | NEW |