Lines Matching defs:pass
839 // character. We do not need to do anything since the one-byte pass
844 // We handle the length > 1 case in a later pass.
2304 // We call this repeatedly to generate code for each pass over the text node.
2308 // we will check the '%' in the first pass, the case independent 'a' in the
2309 // second pass and the character class in the last pass.
2320 // 'preloaded' argument indicates that we are doing such a 'pass'. If such a
2321 // pass has been performed then subsequent passes will have true in
2333 void TextNode::TextEmitPass(RegExpCompiler* compiler, TextEmitPassType pass,
2347 if (SkipPass(pass, IsIgnoreCase(compiler->flags()))) continue;
2362 switch (pass) {
2392 if (pass == CHARACTER_CLASS_MATCH) {
2411 bool TextNode::SkipPass(TextEmitPassType pass, bool ignore_case) {
2413 return pass == SIMPLE_CHARACTER_MATCH;
2415 return pass == NON_LETTER_CHARACTER_MATCH || pass == CASE_CHARACTER_MATCH;
2461 // pass from left to right. Instead we pass over the text node several times,
2486 for (int pass = kFirstRealPass; pass <= kLastPass; pass++) {
2487 TextEmitPass(compiler, static_cast<TextEmitPassType>(pass), true, trace,
2493 for (int pass = kFirstRealPass; pass <= kLastPass; pass++) {
2494 TextEmitPass(compiler, static_cast<TextEmitPassType>(pass), false, trace,
3531 // has to be interested too so it can pass the information on.
3537 // this node also, so it can pass it on.