4434             << choice()->alternatives()->at(i).node() << ";\n";  in Call()
4533     for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
4534       GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
4538   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
4539     GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
4873   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in SortConsecutiveAtoms()  local
4874   int length = alternatives->length();  in SortConsecutiveAtoms()
4878       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
4887       RegExpTree* alternative = alternatives->at(i);  in SortConsecutiveAtoms()
4897     DCHECK_LT(first_atom, alternatives->length());  in SortConsecutiveAtoms()
4898     DCHECK_LE(i, alternatives->length());  in SortConsecutiveAtoms()
4907       alternatives->StableSort(compare_closure, first_atom, i - first_atom);  in SortConsecutiveAtoms()
4909       alternatives->StableSort(CompareFirstChar, first_atom, i - first_atom);  in SortConsecutiveAtoms()
4920   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in RationalizeConsecutiveAtoms()  local
4921   int length = alternatives->length();  in RationalizeConsecutiveAtoms()
4926     RegExpTree* alternative = alternatives->at(i);  in RationalizeConsecutiveAtoms()
4928       alternatives->at(write_posn++) = alternatives->at(i);  in RationalizeConsecutiveAtoms()
4938       alternative = alternatives->at(i);  in RationalizeConsecutiveAtoms()
4960       atom = alternatives->at(first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
4963             alternatives->at(j + first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
4979             alternatives->at(j + first_with_prefix)->AsAtom();  in RationalizeConsecutiveAtoms()
4990       alternatives->at(write_posn++) = new (zone) RegExpAlternative(pair);  in RationalizeConsecutiveAtoms()
4994         alternatives->at(write_posn++) = alternatives->at(j);  in RationalizeConsecutiveAtoms()
4998   alternatives->Rewind(write_posn);  // Trim end of array.  in RationalizeConsecutiveAtoms()
5006   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in FixSingleCharacterDisjunctions()  local
5007   int length = alternatives->length();  in FixSingleCharacterDisjunctions()
5012     RegExpTree* alternative = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5014       alternatives->at(write_posn++) = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5020       alternatives->at(write_posn++) = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5027       alternative = alternatives->at(i);  in FixSingleCharacterDisjunctions()
5039         RegExpAtom* old_atom = alternatives->at(j + first_in_run)->AsAtom();  in FixSingleCharacterDisjunctions()
5043       alternatives->at(write_posn++) =  in FixSingleCharacterDisjunctions()
5048         alternatives->at(write_posn++) = alternatives->at(j);  in FixSingleCharacterDisjunctions()
5052   alternatives->Rewind(write_posn);  // Trim end of array.  in FixSingleCharacterDisjunctions()
5058   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in ToNode()  local
5060   if (alternatives->length() > 2) {  in ToNode()
5064     if (alternatives->length() == 1) {  in ToNode()
5065       return alternatives->at(0)->ToNode(compiler, on_success);  in ToNode()
5069   int length = alternatives->length();  in ToNode()
5074     GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,  in ToNode()
6016   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
6017     RegExpNode* node = that->alternatives()->at(i).node();  in VisitChoice()
6029   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitLoopChoice()
6030     RegExpNode* node = that->alternatives()->at(i).node();  in VisitLoopChoice()
6072   ZoneList<GuardedAlternative>* alts = alternatives();  in FillInBMInfo()
6156   ZoneList<GuardedAlternative>* alternatives = node->alternatives();  in BuildTable()  local
6157   for (int i = 0; i < alternatives->length(); i++) {  in BuildTable()
6159     alternatives->at(i).node()->Accept(this);  in BuildTable()