Lines Matching defs:false
249 reg_exp_too_big_(false),
250 limiting_recursion_(false),
252 read_backward_(false),
277 node->set_on_work_list(false);
309 return false;
321 return false;
325 return false;
336 return false;
418 bool absolute = false;
419 bool clear = false;
745 if (chars[i] > String::kMaxUtf16CodeUnit) return false;
819 bool bound_checked = false;
841 return false; // Bounds not checked.
843 bool checked = false;
848 return false; // Bounds not checked.
885 return false;
897 if (length <= 1) return false;
1420 bool found_useful_op = false;
1479 loop_node_->EatsAtLeast(false) - continue_node_->EatsAtLeast(true));
1498 continue_node_->EatsAtLeast(false);
1511 if (details->characters() == 0) return false;
1514 if (details->cannot_match()) return false;
1515 if (!details->Rationalize(compiler->one_byte())) return false;
1544 if ((mask & char_mask) == char_mask) need_mask = false;
1552 if ((mask & kTwoByteMask) == kTwoByteMask) need_mask = false;
1554 if ((mask & kTwoByteMask) == kTwoByteMask) need_mask = false;
1556 if (mask == kFourByteMask) need_mask = false;
1611 pos->determines_perfectly = false;
1646 pos->determines_perfectly = false;
1680 pos->determines_perfectly = false;
1705 // so the chances of a false positive rise. A character class
1708 pos->determines_perfectly = false;
1736 positions_[i].determines_perfectly = false;
1755 positions_[i].determines_perfectly = false;
1779 pos->determines_perfectly = false;
1796 ~VisitMarker() { info_->visited = false; }
1811 node_->traversed_loop_initialization_node_ = false;
1864 return false;
2187 EmitWordCheck(assembler, &before_word, &before_non_word, false);
2291 if (quick_check == nullptr) return false;
2292 if (offset >= quick_check->characters()) return false;
2361 bool bounds_checked = false;
2476 TextEmitPass(compiler, NON_LATIN1_MATCH, false, trace, false, &dummy);
2479 bool first_elt_done = false;
2488 false, &bound_checked_to);
2494 TextEmitPass(compiler, static_cast<TextEmitPassType>(pass), false, trace,
2662 expects_preload(false),
2709 bool inside = false;
2804 if (biggest_points == 0) return false;
2905 bool found_single_character = false;
2912 found_single_character = false;
3130 i == choice_count - 1 ? false : alt_gens.at(i + 1)->expects_preload;
3210 BoyerMooreLookahead* bm = bm_info(false);
3212 eats_at_least = std::min(kMaxLookaheadForBoyerMoore, EatsAtLeast(false));
3216 alt0.node()->FillInBMInfo(isolate, 0, kRecursionBudget, bm, false);
3258 bool generate_full_check_inline = false;
3289 alt_gen->expects_preload = false;
3302 preload->preload_is_current_ = false;
3335 macro_assembler->LoadCurrentCharacter(trace->cp_offset(), nullptr, false,
3652 // since false implies false. So let's just set the max answer
3689 that->info()->being_analyzed = false;
3712 } while (false)
3793 DCHECK_EQ(node->info()->been_analyzed, false);
3901 zone(), trail_surrogates, false, builder.on_match_success());
3921 0, RegExpTree::kInfinity, false,
3932 false, loop_node)));