Lines Matching defs:length
51 const int* special_class, int length) {
52 length--; // Remove final marker.
54 DCHECK_EQ(kRangeEndMarker, special_class[length]);
55 DCHECK_NE(0, ranges->length());
56 DCHECK_NE(0, length);
59 if (ranges->length() != (length >> 1) + 1) return false;
64 for (int i = 0; i < length; i += 2) {
78 int length) {
79 length--; // Remove final marker.
81 DCHECK_EQ(kRangeEndMarker, special_class[length]);
82 if (ranges->length() * 2 != length) return false;
84 for (int i = 0; i < length; i += 2) {
143 for (int i = 0; i < base->length(); i++) AddRange(base->at(i));
271 for (int i = 0; i < non_bmp->length(); i++) {
432 if (ranges->length() == 1 && ranges->at(0).IsEverything(kNonBmpEnd)) return;
436 for (int i = 0; i < ranges->length(); i++) {
479 if (ranges->length() == 0) {
503 if (ranges->length() > kMaxRangesToInline) result->SetDoNotInline();
553 int length = canonicalize->get(c, '\0', chars);
554 DCHECK_LE(length, 1);
556 if (length == 1) canonical = chars[0];
606 int length = alternatives->length();
608 for (int i = 0; i < length; i++) {
609 while (i < length) {
614 // i is length or it is the index of an atom.
615 if (i == length) break;
618 while (i < length) {
629 DCHECK_LT(first_atom, alternatives->length());
630 DCHECK_LE(i, alternatives->length());
657 int length = alternatives->length();
662 while (i < length) {
681 int prefix_length = atom->length();
683 while (i < length) {
694 prefix_length = std::min(prefix_length, alt_atom->length());
729 int len = old_atom->length();
734 old_atom->data().SubVector(prefix_length, old_atom->length()));
755 int length = alternatives->length();
759 while (i < length) {
767 if (atom->length() != 1) {
781 while (i < length) {
785 if (alt_atom->length() != 1) break;
799 DCHECK_EQ(old_atom->length(), 1);
824 if (alternatives->length() > 2) {
828 if (alternatives->length() == 1) {
833 int length = alternatives->length();
836 compiler->zone()->New<ChoiceNode>(length, compiler->zone());
837 for (int i = 0; i < length; i++) {
1057 for (int i = 0; i < terms->length(); i++) {
1068 if (from != kNoIndex && terms->length() - from > 1) {
1069 rewriter.Rewrite(from, terms->length());
1141 for (int i = 0; i < children->length(); i++) {
1145 for (int i = children->length() - 1; i >= 0; i--) {
1248 int range_count = ranges->length();
1308 int length = isolate->jsregexp_uncanonicalize()->get(bottom, '\0', chars);
1309 for (int i = 0; i < length; i++) {
1335 int length =
1338 if (length == 0) {
1341 DCHECK_EQ(1, length);
1345 length = isolate->jsregexp_uncanonicalize()->get(block_end, '\0',
1347 for (int i = 0; i < length; i++) {
1364 int n = ranges->length();
1468 if (character_ranges->length() <= 1) return;
1471 int n = character_ranges->length();
1507 DCHECK_EQ(0, negated_ranges->length());
1508 int range_count = ranges->length();
1535 int n = ranges->length();
1608 // If we know that we cannot match zero length then things are a little
1609 // simpler since we don't need to make the special zero length match check