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 487 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
498 bool at_end: 1; | 498 bool at_end: 1; |
499 | 499 |
500 // These bits are set if the node can make assumptions about what | 500 // These bits are set if the node can make assumptions about what |
501 // the previous character was. | 501 // the previous character was. |
502 PrecedingInfo follows_word: 2; | 502 PrecedingInfo follows_word: 2; |
503 PrecedingInfo follows_newline: 2; | 503 PrecedingInfo follows_newline: 2; |
504 PrecedingInfo follows_start: 2; | 504 PrecedingInfo follows_start: 2; |
505 }; | 505 }; |
506 | 506 |
507 | 507 |
508 STATIC_CHECK(sizeof(NodeInfo) <= sizeof(int)); // NOLINT | |
509 | |
510 | |
511 class SiblingList { | 508 class SiblingList { |
512 public: | 509 public: |
513 SiblingList() : list_(NULL) { } | 510 SiblingList() : list_(NULL) { } |
514 int length() { | 511 int length() { |
515 return list_ == NULL ? 0 : list_->length(); | 512 return list_ == NULL ? 0 : list_->length(); |
516 } | 513 } |
517 void Ensure(RegExpNode* parent) { | 514 void Ensure(RegExpNode* parent) { |
518 if (list_ == NULL) { | 515 if (list_ == NULL) { |
519 list_ = new ZoneList<RegExpNode*>(2); | 516 list_ = new ZoneList<RegExpNode*>(2); |
520 list_->Add(parent); | 517 list_->Add(parent); |
(...skipping 286 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
807 RegExpNode** node_return, | 804 RegExpNode** node_return, |
808 bool ignore_case, | 805 bool ignore_case, |
809 bool multiline); | 806 bool multiline); |
810 static void DotPrint(const char* label, RegExpNode* node); | 807 static void DotPrint(const char* label, RegExpNode* node); |
811 }; | 808 }; |
812 | 809 |
813 | 810 |
814 } } // namespace v8::internal | 811 } } // namespace v8::internal |
815 | 812 |
816 #endif // V8_JSREGEXP_H_ | 813 #endif // V8_JSREGEXP_H_ |
OLD | NEW |