4498             << choice()->alternatives()->at(i).node() << ";\n";  in Call()
4597     for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
4598       GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
4602   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
4603     GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
5224   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in SortConsecutiveAtoms()  local
5225   int length = alternatives->length();  in SortConsecutiveAtoms()
5229       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
5238       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
5248     DCHECK_LT(first_atom, alternatives->length());  in SortConsecutiveAtoms()
5249     DCHECK_LE(i, alternatives->length());  in SortConsecutiveAtoms()
5258       alternatives->StableSort(compare_closure, first_atom, i - first_atom);  in SortConsecutiveAtoms()
5260       alternatives->StableSort(CompareFirstChar, first_atom, i - first_atom);  in SortConsecutiveAtoms()
5271   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in RationalizeConsecutiveAtoms()  local
5272   int length = alternatives->length();  in RationalizeConsecutiveAtoms()
5277     RegExpTree* alternative = alternatives->at(i);  in RationalizeConsecutiveAtoms()
5279       alternatives->at(write_posn++) = alternatives->at(i);  in RationalizeConsecutiveAtoms()
5289       alternative = alternatives->at(i);  in RationalizeConsecutiveAtoms()
5311       atom = alternatives->at(first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
5314             alternatives->at(j + first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
5330             alternatives->at(j + first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
5341       alternatives->at(write_posn++) = new (zone) RegExpAlternative(pair);  in RationalizeConsecutiveAtoms()
5345         alternatives->at(write_posn++) = alternatives->at(j);  in RationalizeConsecutiveAtoms()
5349   alternatives->Rewind(write_posn);  // Trim end of array.  in RationalizeConsecutiveAtoms()
5357   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in FixSingleCharacterDisjunctions()  local
5358   int length = alternatives->length();  in FixSingleCharacterDisjunctions()
5363     RegExpTree* alternative = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5365       alternatives->at(write_posn++) = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5371       alternatives->at(write_posn++) = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5378       alternative = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5390         RegExpAtom* old_atom = alternatives->at(j + first_in_run)->AsAtom();  in FixSingleCharacterDisjunctions()
5394       alternatives->at(write_posn++) =  in FixSingleCharacterDisjunctions()
5399         alternatives->at(write_posn++) = alternatives->at(j);  in FixSingleCharacterDisjunctions()
5403   alternatives->Rewind(write_posn);  // Trim end of array.  in FixSingleCharacterDisjunctions()
5409   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in ToNode()  local
5411   if (alternatives->length() > 2) {  in ToNode()
5415     if (alternatives->length() == 1) {  in ToNode()
5416       return alternatives->at(0)->ToNode(compiler, on_success);  in ToNode()
5420   int length = alternatives->length();  in ToNode()
5425     GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,  in ToNode()
6339   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
6340     RegExpNode* node = that->alternatives()->at(i).node();  in VisitChoice()
6352   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitLoopChoice()
6353     RegExpNode* node = that->alternatives()->at(i).node();  in VisitLoopChoice()
6395   ZoneList<GuardedAlternative>* alts = alternatives();  in FillInBMInfo()
6479   ZoneList<GuardedAlternative>* alternatives = node->alternatives();  in BuildTable()  local
6480   for (int i = 0; i < alternatives->length(); i++) {  in BuildTable()
6482     alternatives->at(i).node()->Accept(this);  in BuildTable()