Lines Matching defs:first
77 // which will be presented first. The actual code generated is a more
411 // The chronologically first deferred action in the trace
423 // historical order (newest first).
941 void EmitDoubleBoundaryTest(RegExpMacroAssembler* masm, int first, int last,
945 if (first == last) {
946 masm->CheckNotCharacter(first, out_of_range);
948 masm->CheckCharacterNotInRange(first, last, out_of_range);
951 if (first == last) {
952 masm->CheckCharacter(first, in_range);
954 masm->CheckCharacterInRange(first, last, in_range);
1046 base::uc32 first = ranges->at(start_index);
1055 // new_start_index is the index of the first edge that is beyond the
1067 // The first test ensures that we get to the code that handles the Latin1
1073 last - first > kSize * 2 && binary_chop_index > *new_start_index &&
1074 ranges->at(binary_chop_index) >= first + 2 * kSize) {
1114 base::uc32 first = ranges->at(start_index);
1117 DCHECK_LT(min_char, first);
1122 EmitBoundaryTest(masm, first, fall_through, even_label, odd_label);
1129 EmitDoubleBoundaryTest(masm, first, last, fall_through, even_label,
1138 // first, then try arbitrary ranges in the second round.
1166 if ((min_char >> kBits) != first >> kBits) {
1167 masm->CheckCharacterLT(first, odd_label);
1168 GenerateBranches(masm, ranges, start_index + 1, end_index, first, max_char,
1894 // Now they are in order so we only need to look at the first.
2306 // of the first passes will fail in which case we are saved the work of the
2308 // we will check the '%' in the first pass, the case independent 'a' in the
2312 // we will first test for an 'r' with offset 2, then an 'a' with offset 1
2317 // A slight complication involves the fact that the first character may already
2319 // do the test for that character first. We do this in separate passes. The
3284 // If this is not the first choice then there could be slow checks from
3420 // number first and skip the empty check if it's not enough.
3515 // be propagated to the first '.' that whatever follows needs to know