Lines Matching defs:alternatives
2899 // alternatives list.
3535 // This class is used when generating the alternatives in a choice node. It
3837 * fallthrough. Alternatives 1 and 2 have quick checks. Alternative
3881 * unwind code that steps back in the greedy loop). The following alternatives
4107 // At this point we need to generate slow checks for the alternatives where
4392 choice()->alternatives()->at(i).node());
4491 for (int i = 0; i < that->alternatives()->length(); i++) {
4492 GuardedAlternative alt = that->alternatives()->at(i);
4496 for (int i = 0; i < that->alternatives()->length(); i++) {
4497 GuardedAlternative alt = that->alternatives()->at(i);
4790 ZoneList<RegExpTree*>* alternatives = this->alternatives();
4791 int length = alternatives->length();
4795 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,
5032 // Add the two alternatives to the ChoiceNode.
5727 for (int i = 0; i < that->alternatives()->length(); i++) {
5728 RegExpNode* node = that->alternatives()->at(i).node();
5740 for (int i = 0; i < that->alternatives()->length(); i++) {
5741 RegExpNode* node = that->alternatives()->at(i).node();
5786 ZoneList<GuardedAlternative>* alts = alternatives();
5876 ZoneList<GuardedAlternative>* alternatives = node->alternatives();
5877 for (int i = 0; i < alternatives->length(); i++) {
5879 alternatives->at(i).node()->Accept(this);
