Lines Matching defs:check
405 // Count pushes performed to force a stack limit check occasionally.
533 // through a quick check that was already performed.
817 bool check, bool preloaded) {
821 assembler->LoadCurrentCharacter(cp_offset, on_failure, check);
832 bool check, bool preloaded) {
851 macro_assembler->LoadCurrentCharacter(cp_offset, on_failure, check);
852 checked = check;
892 bool check, bool preloaded) {
898 // We may not need to check against the end of the input string
901 macro_assembler->LoadCurrentCharacter(cp_offset, on_failure, check);
1266 // Note the flipped logic below (we check InRange if negated, NotInRange if
1525 // The bounds check is performed using the minimum number of characters
1526 // any choice would eat, so if the bounds check fails, then none of the
1529 // less than the number used for the bounds check.
1583 // generating a quick check.
1588 // Do not collect any quick check details if the text node reads backward,
1632 // it can only be an approximate check.
1665 // A quick check uses multi-character mask and compare. There is no
1759 // they had already been used in a check and they won't be used again because
1850 // We need to check for the following characters: 0x39C 0x3BC 0x178.
2004 // we don't need to check it.
2024 // to check the continue case.
2114 // Emit the code to check for a ^ in multiline mode (1-character lookbehind
2308 // we will check the '%' in the first pass, the case independent 'a' in the
2314 // bounds check most of the time. In the example we only need to check for
2327 // object we can see details of any quick check that was already passed in
2328 // order to get to the code we are now generating. The quick check can involve
2330 // up to the limit the quick check already checked. In addition the quick
2331 // check can have involved a mask and compare operation which may simplify
2484 // check that now.
2515 // Adjust the offsets of the quick check performed information. This
2834 DCHECK(union_bitset[j]); // Sanity check.
2884 DCHECK(bitset[j]); // Sanity check.
2967 * choice. If the quick check succeeds then it jumps to the continuation to
2968 * do slow checks and check subsequent nodes. If it fails (the common case)
2973 * 3 doesn't have a quick check so we have to call the slow check.
3117 // the quick check was inlined. We can recognize these because the associated
3147 // and check it against the pushed value. This avoids pushing backtrack
3265 // Quick check was generated for this choice.
3268 // If we generated the quick check to fall through on possible success,
3269 // we now need to generate the full check inline.
3283 // No quick check was generated. Put the full code here.
3286 // insist that they preload characters since the slow check we are about
3332 // Reload the current character, since the next quick check expects that.
3333 // We don't need to check bounds here because we only get into this
3334 // code through a quick check which already did the checked load.
3419 // If we have a minimum number of repetitions we check the current
3420 // number first and skip the empty check if it's not enough.
3517 // has to check if it succeeds a word or non-word. In this case the
3523 // | word? | | check word |
3608 // when computing eats-at-least and quick check information.
3678 StackLimitCheck check(isolate());
3679 if (check.HasOverflowed()) {