844 void RegExpTree::AppendToText(RegExpText* text, Zone* zone) {  in AppendToText()
4830 int CompareFirstChar(RegExpTree* const* a, RegExpTree* const* b) {  in CompareFirstChar()
4855     RegExpTree* const* a, RegExpTree* const* b) {  in CompareFirstCharCaseIndependent()
4873   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in SortConsecutiveAtoms()
4878       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
4887       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
4904           [canonicalize](RegExpTree* const* a, RegExpTree* const* b) {  in SortConsecutiveAtoms()
4920   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in RationalizeConsecutiveAtoms()
4926     RegExpTree* alternative = alternatives->at(i);  in RationalizeConsecutiveAtoms()
4973       ZoneList<RegExpTree*>* pair = new (zone) ZoneList<RegExpTree*>(2, zone);  in RationalizeConsecutiveAtoms()
4975       ZoneList<RegExpTree*>* suffixes =  in RationalizeConsecutiveAtoms()
4976           new (zone) ZoneList<RegExpTree*>(run_length, zone);  in RationalizeConsecutiveAtoms()
4984           RegExpTree* suffix = new (zone) RegExpAtom(  in RationalizeConsecutiveAtoms()
5006   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in FixSingleCharacterDisjunctions()
5012     RegExpTree* alternative = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5058   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in ToNode()
5134                                      RegExpTree* body,  in ToNode()
5217   bool has_max = max < RegExpTree::kInfinity;  in ToNode()
5395 RegExpNode* RegExpCapture::ToNode(RegExpTree* body,  in ToNode()
5411   ZoneList<RegExpTree*>* children = nodes();  in ToNode()
6297         0, RegExpTree::kInfinity, false, new (zone) RegExpCharacterClass('*'),  in Compile()