Searched refs:alternatives (Results 1 - 5 of 5) sorted by relevance

/external/v8/src/
H A Dast.cc232 return ListCaptureRegisters(alternatives());
269 ZoneList<RegExpTree*>* alternatives = this->alternatives(); local
270 for (int i = 0; i < alternatives->length(); i++) {
271 if (!alternatives->at(i)->IsAnchored())
314 for (int i = 0; i < that->alternatives()->length(); i++) {
316 that->alternatives()->at(i)->Accept(this, data);
459 RegExpDisjunction::RegExpDisjunction(ZoneList<RegExpTree*>* alternatives) argument
460 : alternatives_(alternatives) {
461 ASSERT(alternatives
[all...]
H A Djsregexp.cc2569 // This class is used when generating the alternatives in a choice node. It
2667 * unwind code that steps back in the greedy loop). The following alternatives
2846 // At this point we need to generate slow checks for the alternatives where
3131 choice()->alternatives()->at(i).node());
3229 for (int i = 0; i < that->alternatives()->length(); i++) {
3230 GuardedAlternative alt = that->alternatives()->at(i);
3234 for (int i = 0; i < that->alternatives()->length(); i++) {
3235 GuardedAlternative alt = that->alternatives()->at(i);
3543 ZoneList<RegExpTree*>* alternatives = this->alternatives(); local
5045 ZoneList<GuardedAlternative>* alternatives = node->alternatives(); local
[all...]
H A Djsregexp.h1004 void AddAlternative(GuardedAlternative node) { alternatives()->Add(node); }
1005 ZoneList<GuardedAlternative>* alternatives() { return alternatives_; } function in class:v8::internal::ChoiceNode
1095 // AddAlternative is made private for loop nodes because alternatives
1286 // Node visitor used to add the start set of the alternatives to the
H A Dast.h1505 explicit RegExpDisjunction(ZoneList<RegExpTree*>* alternatives);
1515 ZoneList<RegExpTree*>* alternatives() { return alternatives_; } function in class:v8::internal::RegExpDisjunction
/external/dropbear/libtomcrypt/
H A Dcrypt.tex2895 the fact that faster alternatives exist.

Completed in 73 milliseconds