Lines Matching defs:characters
751 // Returns the number of characters in the equivalence class, omitting those
793 // Unibrow returns 0 or 1 for characters where case independence is
876 // If the characters differ by 2^n but don't differ by one bit then
1065 // case characters on some Unicode pages).
1137 // It is faster to test for individual characters, so we look for those
1370 // all characters from this position onwards.
1511 if (details->characters() == 0) return false;
1516 DCHECK(details->characters() == 1 ||
1523 if (trace->characters_preloaded() != details->characters()) {
1525 // The bounds check is performed using the minimum number of characters
1528 // than go to the next choice. The number of characters preloaded may be
1532 DCHECK_GE(eats_at_least, details->characters());
1535 !preload_has_checked_bounds, details->characters(), eats_at_least);
1540 if (details->characters() == 1) {
1541 // If number of characters preloaded is 1 then we used a byte or 16 bit
1551 if (details->characters() == 2 && compiler->one_byte()) {
1553 } else if (details->characters() == 1 && !compiler->one_byte()) {
1592 DCHECK(characters_filled_in < details->characters());
1593 int characters = details->characters();
1599 for (int i = 0; i < characters && i < quarks.length(); i++) {
1654 DCHECK(characters_filled_in <= details->characters());
1655 if (characters_filled_in == details->characters()) {
1721 DCHECK(characters_filled_in <= details->characters());
1722 if (characters_filled_in == details->characters()) return;
1725 DCHECK(characters_filled_in != details->characters());
1850 // We need to check for the following characters: 0x39C 0x3BC 0x178.
2020 // Loop body is guaranteed to execute at least once, and consume characters
2080 QuickCheckDetails new_details(details->characters());
2292 if (offset >= quick_check->characters()) return false;
2329 // loading characters, which means we do not need to recheck the bounds
2513 // we preloaded any characters into it.
2517 // characters by means of mask and compare.
2643 // We can't preload 3 characters because there is no machine instruction
2792 // characters that can occur at a given position. Since we are optimizing two
2796 // If more than 32 characters out of 128 can occur it is unlikely that we can
2812 // probability-of-finding-one-of-the-characters, where the probability is
2837 // characters have a frequency of zero. This means the frequency
2865 // Take all the characters that will not prevent a successful match if they
2868 // character at max_lookahead offset is not one of these characters, then we
2869 // can safely skip forwards by the number of characters in the range.
3196 // loop. That also implies that there are no preloaded characters, which is
3198 // overwriting those characters with new load instructions.
3206 // a pattern of the form ...abc... where we can look 6 characters ahead
3286 // insist that they preload characters since the slow check we are about
3651 // characters will you match if you succeed?" then we can answer anything
3654 // characters for the other branches in the node graph.
3802 // Working out the set of characters that a backreference can match is too