Lines Matching defs:from
109 // Consider the range from last to ranges[i].
111 if (ranges[i] <= new_range.from()) continue;
114 if (last <= new_range.from() && new_range.to() < ranges[i]) {
259 int from,
265 RegExpImpl::SetCapture(array, 0, from);
349 // from the source pattern.
515 // when we set the last match info from last successful match.
548 // untouched and contains the capture results from the previous successful
569 // must restart from scratch.
751 // 2) From the AST a node network is created. The nodes are all
755 // 3) From the nodes we generate either byte codes or native code
813 // <pop backtrack location from stack and go to it>
820 // <pop backtrack location from stack and go to it>
875 // location from the stack and jump there.
960 // Does not measure in percent, but rather per-128 (the table size from the
1190 for (int i = range.from(); i <= range.to(); i++)
1506 result->data_.u_clear_captures.range_from = range.from();
1693 // subtract the difference from the found character, then do the or
1958 // character is in the range between an even and an odd boundary (counting from
1985 // different from the end intervals.
2136 if (range.from() <= max_char) {
2198 if (range.from() == 0) {
2202 range_boundaries->Add(range.from(), zone);
2304 // that won't prevent us from preloading a lot of characters for the other
2549 // If we expect a non-Latin1 character from an one-byte string,
2618 while (ranges->at(first_range).from() > char_mask) {
2627 uc16 from = range.from();
2632 uint32_t differing_bits = (from ^ to);
2636 from + differing_bits == to) {
2640 uint32_t bits = (from & common_bits);
2643 uc16 from = range.from();
2645 if (from > char_mask) continue;
2653 uint32_t new_common_bits = (from ^ to);
2657 uint32_t differing_bits = (from & common_bits) ^ bits;
2823 ranges->at(0).from() == 0 &&
2831 ranges->at(0).from() > String::kMaxOneByteCharCode) {
3203 // The passes are done from right to left, so for example to test for /bar/
3312 // pass from left to right. Instead we pass over the text node several times,
3442 // Finds the fixed match length of a sequence of nodes that goes from
3574 // The '2' variant is has inclusive from and exclusive to.
3606 if (interval.to() - interval.from() >= kMapSize - 1) {
3613 for (int i = interval.from(); i <= interval.to(); i++) {
3652 bool BoyerMooreLookahead::FindWorthwhileInterval(int* from, int* to) {
3661 FindBestInterval(max_number_of_chars, biggest_points, from, to);
3675 int max_number_of_chars, int old_biggest_points, int* from, int* to) {
3713 *from = remembered_from;
3724 // max_lookahead (inclusive) measured from the current position. If the
4167 // If this is not the first choice then there could be slow checks from
4394 void PrintAttributes(RegExpNode* from);
4395 void PrintOnFailure(RegExpNode* from, RegExpNode* to);
4434 void DotPrinter::PrintOnFailure(RegExpNode* from, RegExpNode* on_failure) {
4435 os_ << " n" << from << " -> n" << on_failure << " [style=dotted];\n";
4445 void Call(uc16 from, DispatchTable::Entry entry) {
4449 os_ << " n" << choice() << ":s" << from << "o" << i << " -> n"
4466 void Call(uc16 from, DispatchTable::Entry entry) {
4472 os_ << "{\\" << AsUC16(from) << "-\\" << AsUC16(entry.to()) << "|{";
4478 os_ << "<s" << from << "o" << i << "> " << priority;
4581 os_ << AsUC16(range.from()) << "-" << AsUC16(range.to());
4758 if (range.from() != 0) {
4766 if (special_class[i+1] != range.from()) {
4787 if (range.from() != special_class[i] ||
4932 // from step 2.1. If the min and max are small we can unroll a little in
4957 // Unroll the forced matches from 0 to min. This can cause chains of
5294 void Call(uc16 from, DispatchTable::Entry entry);
5306 void CharacterRangeSplitter::Call(uc16 from, DispatchTable::Entry entry) {
5312 (*target)->Add(CharacterRange(entry.from(), entry.to()), zone_);
5338 uc16 bottom = from();
5362 // each entry in the result is incremented by the distance from the first
5407 if (next_range.from() <= max + 1) return false;
5426 int from,
5430 if (from < to) {
5432 list->at(to + i) = list->at(from + i);
5436 list->at(to + i) = list->at(from + i);
5446 // by from value and non-overlapping and non-adjacent, using at most
5450 uc16 from = insert.from();
5456 if (current.from() > to + 1) {
5458 } else if (current.to() + 1 < from) {
5468 // if start_pos < end_pos, the entire range from start_pos to end_pos
5482 int new_from = Min(to_replace.from(), from);
5487 // Replace a number of existing ranges from start_pos to end_pos - 1.
5490 int new_from = Min(list->at(start_pos).from(), from);
5517 if (current.from() <= max + 1) {
5551 uc16 from = 0;
5553 if (range_count > 0 && ranges->at(0).from() == 0) {
5554 from = ranges->at(0).to();
5559 negated_ranges->Add(CharacterRange(from + 1, range.from() - 1), zone);
5560 from = range.to();
5563 if (from < String::kMaxUtf16CodeUnit) {
5564 negated_ranges->Add(CharacterRange(from + 1, String::kMaxUtf16CodeUnit),
5625 DCHECK_RESULT(tree()->Insert(current.from(), &loc));
5626 loc.set_value(Entry(current.from(), current.to(),
5633 if (tree()->FindGreatestLessThan(current.from(), &loc)) {
5639 if (entry->from() < current.from() && entry->to() >= current.from()) {
5642 CharacterRange left(entry->from(), current.from() - 1);
5643 CharacterRange right(current.from(), entry->to());
5651 DCHECK_RESULT(tree()->Insert(right.from(), &loc));
5652 loc.set_value(Entry(right.from(),
5658 if (tree()->FindLeastGreaterThan(current.from(), &loc) &&
5659 (loc.value().from() <= current.to()) &&
5660 (loc.value().to() >= current.from())) {
5665 if (current.from() < entry->from()) {
5667 DCHECK_RESULT(tree()->Insert(current.from(), &ins));
5668 ins.set_value(Entry(current.from(),
5669 entry->from() - 1,
5671 current.set_from(entry->from());
5673 DCHECK_EQ(current.from(), entry->from());
5693 DCHECK(entry->to() + 1 > current.from());
5698 DCHECK_RESULT(tree()->Insert(current.from(), &ins));
5699 ins.set_value(Entry(current.from(),
5899 if (range.from() > max_char) continue;
5901 bm->SetInterval(offset, Interval(range.from(), to));
5943 void Call(uc32 from, DispatchTable::Entry entry);
5949 void AddDispatchRange::Call(uc32 from, DispatchTable::Entry entry) {
5950 CharacterRange range(from, entry.to());
5979 return Compare<uc16>(a->from(), b->from());
5988 if (last < range.from())
5989 AddRange(CharacterRange(last, range.from() - 1));
6043 // Sample some characters from the middle of the string.
