Lines Matching full:pass
1282 // We do not need to do anything since the ASCII pass already handled this.
1286 // We handle the length > 1 case in a later pass.
2255 // We call this repeatedly to generate code for each pass over the text node.
2259 // we will check the '%' in the first pass, the case independent 'a' in the
2260 // second pass and the character class in the last pass.
2271 // 'preloaded' argument indicates that we are doing such a 'pass'. If such a
2272 // pass has been performed then subsequent passes will have true in
2285 TextEmitPassType pass,
2304 switch (pass) {
2336 if (pass == CHARACTER_CLASS_MATCH) {
2366 TextEmitPassType pass = static_cast<TextEmitPassType>(int_pass);
2368 return pass == SIMPLE_CHARACTER_MATCH;
2370 return pass == NON_LETTER_CHARACTER_MATCH || pass == CASE_CHARACTER_MATCH;
2378 // pass from left to right. Instead we pass over the text node several times,
2403 for (int pass = kFirstRealPass; pass <= kLastPass; pass++) {
2404 if (!SkipPass(pass, compiler->ignore_case())) {
2406 static_cast<TextEmitPassType>(pass),
2416 for (int pass = kFirstRealPass; pass <= kLastPass; pass++) {
2417 if (!SkipPass(pass, compiler->ignore_case())) {
2419 static_cast<TextEmitPassType>(pass),
4791 // has to be interested too so it can pass the information on.
4804 // this node also, so it can pass it on.
