• Home
  • Raw
  • Download

Lines Matching refs:alternatives

4424             << choice()->alternatives()->at(i).node() << ";\n";  in Call()
4523 for (int i = 0; i < that->alternatives()->length(); i++) { in VisitChoice()
4524 GuardedAlternative alt = that->alternatives()->at(i); in VisitChoice()
4528 for (int i = 0; i < that->alternatives()->length(); i++) { in VisitChoice()
4529 GuardedAlternative alt = that->alternatives()->at(i); in VisitChoice()
5157 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in SortConsecutiveAtoms() local
5158 int length = alternatives->length(); in SortConsecutiveAtoms()
5162 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
5169 JSRegExp::Flags flags = alternatives->at(i)->AsAtom()->flags(); in SortConsecutiveAtoms()
5172 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
5183 DCHECK_LT(first_atom, alternatives->length()); in SortConsecutiveAtoms()
5184 DCHECK_LE(i, alternatives->length()); in SortConsecutiveAtoms()
5193 alternatives->StableSort(compare_closure, first_atom, i - first_atom); in SortConsecutiveAtoms()
5195 alternatives->StableSort(CompareFirstChar, first_atom, i - first_atom); in SortConsecutiveAtoms()
5206 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in RationalizeConsecutiveAtoms() local
5207 int length = alternatives->length(); in RationalizeConsecutiveAtoms()
5212 RegExpTree* alternative = alternatives->at(i); in RationalizeConsecutiveAtoms()
5214 alternatives->at(write_posn++) = alternatives->at(i); in RationalizeConsecutiveAtoms()
5225 alternative = alternatives->at(i); in RationalizeConsecutiveAtoms()
5248 RegExpAtom* const atom = alternatives->at(first_with_prefix)->AsAtom(); in RationalizeConsecutiveAtoms()
5251 alternatives->at(j + first_with_prefix)->AsAtom(); in RationalizeConsecutiveAtoms()
5267 alternatives->at(j + first_with_prefix)->AsAtom(); in RationalizeConsecutiveAtoms()
5279 alternatives->at(write_posn++) = new (zone) RegExpAlternative(pair); in RationalizeConsecutiveAtoms()
5283 alternatives->at(write_posn++) = alternatives->at(j); in RationalizeConsecutiveAtoms()
5287 alternatives->Rewind(write_posn); // Trim end of array. in RationalizeConsecutiveAtoms()
5295 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in FixSingleCharacterDisjunctions() local
5296 int length = alternatives->length(); in FixSingleCharacterDisjunctions()
5301 RegExpTree* alternative = alternatives->at(i); in FixSingleCharacterDisjunctions()
5303 alternatives->at(write_posn++) = alternatives->at(i); in FixSingleCharacterDisjunctions()
5309 alternatives->at(write_posn++) = alternatives->at(i); in FixSingleCharacterDisjunctions()
5323 alternative = alternatives->at(i); in FixSingleCharacterDisjunctions()
5340 RegExpAtom* old_atom = alternatives->at(j + first_in_run)->AsAtom(); in FixSingleCharacterDisjunctions()
5348 alternatives->at(write_posn++) = new (zone) in FixSingleCharacterDisjunctions()
5353 alternatives->at(write_posn++) = alternatives->at(j); in FixSingleCharacterDisjunctions()
5357 alternatives->Rewind(write_posn); // Trim end of array. in FixSingleCharacterDisjunctions()
5363 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in ToNode() local
5365 if (alternatives->length() > 2) { in ToNode()
5369 if (alternatives->length() == 1) { in ToNode()
5370 return alternatives->at(0)->ToNode(compiler, on_success); in ToNode()
5374 int length = alternatives->length(); in ToNode()
5379 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler, in ToNode()
6357 for (int i = 0; i < that->alternatives()->length(); i++) { in VisitChoice()
6358 RegExpNode* node = that->alternatives()->at(i).node(); in VisitChoice()
6370 for (int i = 0; i < that->alternatives()->length(); i++) { in VisitLoopChoice()
6371 RegExpNode* node = that->alternatives()->at(i).node(); in VisitLoopChoice()
6413 ZoneList<GuardedAlternative>* alts = alternatives(); in FillInBMInfo()
6497 ZoneList<GuardedAlternative>* alternatives = node->alternatives(); in BuildTable() local
6498 for (int i = 0; i < alternatives->length(); i++) { in BuildTable()
6500 alternatives->at(i).node()->Accept(this); in BuildTable()