Searched refs:still_to_find (Results 1 - 2 of 2) sorted by relevance
/external/chromium_org/v8/src/ |
H A D | jsregexp.h | 582 // succeed. If we have found at least 'still_to_find' characters that 588 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 777 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 844 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 909 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 944 virtual int EatsAtLeast(int still_to_find, 971 virtual int EatsAtLeast(int still_to_find, argument 1067 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 1068 int EatsAtLeastHelper(int still_to_find, 1140 virtual int EatsAtLeast(int still_to_find, in [all...] |
H A D | jsregexp.cc | 2273 int ActionNode::EatsAtLeast(int still_to_find, argument 2278 return on_success()->EatsAtLeast(still_to_find, 2297 int AssertionNode::EatsAtLeast(int still_to_find, argument 2303 // implies false. So lets just return the max answer (still_to_find) since 2306 if (assertion_type() == AT_START && not_at_start) return still_to_find; 2307 return on_success()->EatsAtLeast(still_to_find, 2324 int BackReferenceNode::EatsAtLeast(int still_to_find, argument 2328 return on_success()->EatsAtLeast(still_to_find, 2334 int TextNode::EatsAtLeast(int still_to_find, argument 2338 if (answer >= still_to_find) retur 2347 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2370 EatsAtLeastHelper(int still_to_find, int budget, RegExpNode* ignore_this_node, bool not_at_start) argument 2390 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2400 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument [all...] |
Completed in 285 milliseconds