3313                       choice()->alternatives()->at(i).node());  in Call()
3412     for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
3413       GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
3417   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
3418     GuardedAlternative alt = that->alternatives()->at(i);  in VisitChoice()
3724   ZoneList<RegExpTree*>* alternatives = this->alternatives();  in ToNode()  local
3725   int length = alternatives->length();  in ToNode()
3728     GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,  in ToNode()
4894   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitChoice()
4895     RegExpNode* node = that->alternatives()->at(i).node();  in VisitChoice()
4907   for (int i = 0; i < that->alternatives()->length(); i++) {  in VisitLoopChoice()
4908     RegExpNode* node = that->alternatives()->at(i).node();  in VisitLoopChoice()
4989       GuardedAlternative alternative = alternatives()->at(i);  in ComputeFirstCharacterSet()
5029     GuardedAlternative successor = this->alternatives()->at(1);  in ComputeFirstCharacterSet()
5149   ZoneList<GuardedAlternative>* alternatives = node->alternatives();  in BuildTable()  local
5150   for (int i = 0; i < alternatives->length(); i++) {  in BuildTable()
5152     alternatives->at(i).node()->Accept(this);  in BuildTable()