Searched defs:alternative (Results 1 - 10 of 10) sorted by relevance
/external/kernel-headers/original/asm-x86/ |
H A D | alternative_32.h | 47 #define alternative(oldinstr, newinstr, feature) \ macro 117 * The SMP alternative tables can be kept after boot and contain both
|
/external/chromium/chrome/common/net/ |
H A D | x509_certificate_model_openssl.cc | 20 const std::string& alternative) { 21 return text.empty() ? alternative : text; 19 AlternativeWhenEmpty(const std::string& text, const std::string& alternative) argument
|
/external/webkit/Source/JavaScriptCore/yarr/ |
H A D | YarrInterpreter.h | 97 } alternative; member in union:JSC::Yarr::ByteTerm::__anon11663 238 term.alternative.next = 0; 239 term.alternative.end = 0; 240 term.alternative.onceThrough = onceThrough; 247 term.alternative.next = 0; 248 term.alternative.end = 0; 249 term.alternative.onceThrough = onceThrough; 256 term.alternative.next = 0; 257 term.alternative.end = 0; 258 term.alternative [all...] |
H A D | YarrPattern.cpp | 527 PatternAlternative* alternative = parenthesesDisjunction->addNewAlternative(); local 531 PatternDisjunction* newDisjunction = new PatternDisjunction(alternative); 533 alternative->m_terms.append(PatternTerm(PatternTerm::TypeParenthesesSubpattern, subpatternId, newDisjunction, false, false)); 537 PatternTerm& disjunctionTerm = alternative->lastTerm(); 540 alternative->m_containsBOL = m_alternative->m_containsBOL; 541 alternative->m_startsWithBOL = m_alternative->m_startsWithBOL; 579 PatternAlternative* alternative = disjunction->m_alternatives[alt]; local 580 if (!filterStartsWithBOL || !alternative->m_startsWithBOL) { 586 for (unsigned i = 0; i < alternative->m_terms.size(); ++i) 587 newAlternative->m_terms.append(copyTerm(alternative 650 setupAlternativeOffsets(PatternAlternative* alternative, unsigned currentCallFrameSize, unsigned initialInputPosition) argument 741 PatternAlternative* alternative = disjunction->m_alternatives[alt]; local 823 PatternAlternative* alternative = disjunction->m_alternatives[alt]; local 832 setupAlternativeBeginTerms(PatternAlternative* alternative, Vector<TermChain>* beginTerms, unsigned termIndex, unsigned depth) argument [all...] |
H A D | YarrPattern.h | 267 PatternAlternative* alternative = new PatternAlternative(this); local 268 m_alternatives.append(alternative); 269 return alternative;
|
H A D | YarrInterpreter.cpp | 1018 // Nope - okay backtrack looking for an alternative. 1114 int offset = currentTerm().alternative.end; 1257 int offset = currentTerm().alternative.next; 1272 if (currentTerm().alternative.onceThrough) 1273 context->term += currentTerm().alternative.next; 1282 int offset = currentTerm().alternative.next; 1289 // We should never backtrack back into an alternative of the main body of the regex. 1629 if (!m_bodyDisjunction->terms[beginTerm].alternative.next) 1632 while (m_bodyDisjunction->terms[beginTerm].alternative.next) { 1633 beginTerm += m_bodyDisjunction->terms[beginTerm].alternative 1779 PatternAlternative* alternative = disjunction->m_alternatives[alt]; local [all...] |
H A D | YarrJIT.cpp | 94 void optimizeAlternative(PatternAlternative* alternative) argument 96 if (!alternative->m_terms.size()) 99 for (unsigned i = 0; i < alternative->m_terms.size() - 1; ++i) { 100 PatternTerm& term = alternative->m_terms[i]; 101 PatternTerm& nextTerm = alternative->m_terms[i + 1]; 108 alternative->m_terms[i] = nextTerm; 109 alternative->m_terms[i + 1] = termCopy; 843 PatternAlternative* alternative() function in struct:JSC::Yarr::YarrGenerator::TermGenerationState 861 return t < alternative()->m_terms.size(); 871 return alternative() 1557 PatternAlternative* alternative = state.alternative(); local 1593 PatternAlternative* alternative = state.alternative(); local 1754 PatternAlternative* alternative = parenthesesState.alternative(); local 1941 PatternAlternative* alternative = state.alternative(); local 1957 PatternAlternative* alternative = state.alternative(); local [all...] |
/external/v8/src/ |
H A D | ast.cc | 1130 RegExpTree* alternative = alternatives->at(i); local 1131 min_match_ = Min(min_match_, alternative->min_match()); 1132 max_match_ = Max(max_match_, alternative->max_match());
|
H A D | jsregexp.cc | 617 // fails to find a match and needs to try an alternative. 1745 // Alternative 0 is the negative lookahead, alternative 1 is what comes 1757 // Alternative 0 is the negative lookahead, alternative 1 is what comes 2650 // this alternative and back to this choice node. If there are variable 2653 int ChoiceNode::GreedyLoopTextLength(GuardedAlternative* alternative) { argument 2655 RegExpNode* node = alternative->node(); 2732 // records the way the alternative is being code generated. 2861 GuardedAlternative alternative = alternatives_->at(i); local 2862 ZoneList<Guard*>* guards = alternative.guards(); 2932 GuardedAlternative alternative local 3032 EmitOutOfLineContinuation(RegExpCompiler* compiler, Trace* trace, GuardedAlternative alternative, AlternativeGeneration* alt_gen, int preload_characters, bool next_expects_preload) argument 5029 GuardedAlternative alternative = alternatives()->at(i); local [all...] |
H A D | parser.cc | 175 RegExpTree* alternative; local 177 alternative = RegExpEmpty::GetInstance(); 179 alternative = terms_.last(); 181 alternative = new(zone()) RegExpAlternative(terms_.GetList()); 183 alternatives_.Add(alternative);
|
Completed in 244 milliseconds