/external/chromium_org/v8/src/ |
parser.h | 252 void AddAtom(RegExpTree* tree); 253 void AddAssertion(RegExpTree* tree); 257 RegExpTree* ToRegExp(); 268 BufferedZoneList<RegExpTree, 2> terms_; 269 BufferedZoneList<RegExpTree, 2> text_; 270 BufferedZoneList<RegExpTree, 2> alternatives_; 292 RegExpTree* ParsePattern(); 293 RegExpTree* ParseDisjunction(); 294 RegExpTree* ParseGroup(); 295 RegExpTree* ParseCharacterClass() [all...] |
ast.cc | 793 RegExp##Name* RegExpTree::As##Name() { \ 796 bool RegExpTree::Is##Name() { return false; } 809 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) { 854 ZoneList<RegExpTree*>* nodes = this->nodes(); 856 RegExpTree* node = nodes->at(i); 865 ZoneList<RegExpTree*>* nodes = this->nodes(); 867 RegExpTree* node = nodes->at(i); 876 ZoneList<RegExpTree*>* alternatives = this->alternatives(); 886 ZoneList<RegExpTree*>* alternatives = this->alternatives(); [all...] |
ast.h | [all...] |
parser.cc | 107 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector()); 147 void RegExpBuilder::AddAtom(RegExpTree* term) { 163 void RegExpBuilder::AddAssertion(RegExpTree* assert) { 178 RegExpTree* alternative; 192 RegExpTree* RegExpBuilder::ToRegExp() { 211 RegExpTree* atom; [all...] |
jsregexp.h | 42 class RegExpTree; 445 RegExpTree* tree() const { return tree_; } 458 TextElement(TextType text_type, RegExpTree* tree) 463 RegExpTree* tree_; [all...] |
jsregexp.cc | [all...] |
/external/v8/src/ |
parser.h | 278 void AddAtom(RegExpTree* tree); 279 void AddAssertion(RegExpTree* tree); 282 RegExpTree* ToRegExp(); 293 BufferedZoneList<RegExpTree, 2> terms_; 294 BufferedZoneList<RegExpTree, 2> text_; 295 BufferedZoneList<RegExpTree, 2> alternatives_; 315 RegExpTree* ParsePattern(); 316 RegExpTree* ParseDisjunction(); 317 RegExpTree* ParseGroup(); 318 RegExpTree* ParseCharacterClass() [all...] |
ast.cc | 663 RegExp##Name* RegExpTree::As##Name() { \ 666 bool RegExpTree::Is##Name() { return false; } 679 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) { 724 ZoneList<RegExpTree*>* nodes = this->nodes(); 726 RegExpTree* node = nodes->at(i); 735 ZoneList<RegExpTree*>* nodes = this->nodes(); 737 RegExpTree* node = nodes->at(i); 746 ZoneList<RegExpTree*>* alternatives = this->alternatives(); 756 ZoneList<RegExpTree*>* alternatives = this->alternatives(); 902 if (that->max() == RegExpTree::kInfinity) [all...] |
ast.h | [all...] |
parser.cc | 104 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector()); 144 void RegExpBuilder::AddAtom(RegExpTree* term) { 160 void RegExpBuilder::AddAssertion(RegExpTree* assert) { 175 RegExpTree* alternative; 189 RegExpTree* RegExpBuilder::ToRegExp() { 209 RegExpTree* atom; [all...] |
jsregexp.h | 42 class RegExpTree; [all...] |
jsregexp.cc | 731 void RegExpTree::AppendToText(RegExpText* text) { [all...] |
/external/chromium_org/v8/test/cctest/ |
test-regexp.cc | 347 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity); 348 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity); 350 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity); 351 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity); 353 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity); 354 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity); 356 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity); 357 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity); 358 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity); 359 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity) [all...] |
/external/v8/test/cctest/ |
test-regexp.cc | 342 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity); 343 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity); 345 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity); 346 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity); 348 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity); 349 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity); 351 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity); 352 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity); 353 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity); 354 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity) [all...] |