Lines Matching defs:to
40 // the implementation wants to store in the data field.
144 // Pointer to the last set of captures.
169 // Used to access the lastMatchInfo array.
174 static void SetLastCaptureCount(FixedArray* array, int to) {
175 array->set(kLastCaptureCount, Smi::FromInt(to));
178 static void SetLastSubject(FixedArray* array, String* to) {
179 array->set(kLastSubject, to);
182 static void SetLastInput(FixedArray* array, String* to) {
183 array->set(kLastInput, to);
186 static void SetCapture(FixedArray* array, int index, int to) {
187 array->set(index + kFirstCapture, Smi::FromInt(to));
202 // Limit the space regexps take up on the heap. In order to limit this we
203 // would like to keep track of the amount of regexp code on the heap. This
220 // Represents the location of one element relative to the intersection of
221 // two sets. Corresponds to the four areas of a Venn diagram.
241 // to use Extend instead to ensure that only one instance exists
259 // A mapping from integers, specified as ranges, to a set of integers.
260 // Used for mapping character ranges to choices.
268 Entry(uc16 from, uc16 to, OutSet* out_set)
269 : from_(from), to_(to), out_set_(out_set) { }
271 uc16 to() { return to_; }
367 // Sets the interests of this node to include the interests of the
383 // These bits are set of this node has to know what the preceding
441 // If set to true, there is no way this quick check can match at all.
442 // E.g., if it requires to be at the start of the input, and isn't.
458 // Generates a goto to this node or actually generates the code at this point.
460 // How many characters must this node consume at a minimum in order to
462 // must be consumed there is no need to ask any following nodes whether
463 // they are sure to eat any more characters. The not_at_start argument is
464 // used to indicate that we know we are not at the start of the input. In
469 // Falls through on certain failure, jumps to
498 // EatsAtLeast, GetQuickCheckDetails. The budget argument is used to limit
499 // the number of nodes we are willing to look at in order to create this data.
524 // We want to avoid recalculating the lookahead info, so we store it on the
527 // relative to this node.
535 // on how often we allow that to happen before we insist on starting a new
971 // Allows a new trace to start with at_start() set to false.
998 // alternative that is expected to fail. This is because quick check code
1036 // should not be added freely, we need to keep track of which node
1037 // goes back to the node itself.
1056 // When we have found such a loop we look ahead in the nodes to find the set of
1061 // our example this is from index 1 to 2 (0 is not constrained). We can now
1067 // We also look at the first string fed to the regexp and use that to get a hint
1073 // to determine whether a match is possible at this point.
1153 if (interval.to() > max_char_) {
1171 // many characters left in the sample string then the match is bound to fail.
1172 // Therefore it is OK to read a character this far ahead of the current match
1183 bool FindWorthwhileInterval(int* from, int* to);
1185 int max_number_of_chars, int old_biggest_points, int* from, int* to);
1189 // There are many ways to generate code for a node. This class encapsulates
1195 // /foo(bar|ip)baz/ the code to match baz will be generated twice, once as part
1197 // to match foo is generated only once (the traces have a common prefix). The
1198 // code to store the capture is deferred and generated (twice) after the places
1202 // A value for a property that is either known to be true, know to be false,
1276 // done we can start a new trace or go to one that has already been
1284 // generate code that, on a failure to match, gets the backtrack location
1287 // are created as we emit code for nodes or add to the list of deferred
1290 // generated to that code.
1310 // Returns true if a deferred position store exists to the specified
1325 void set_bound_checked_up_to(int to) { bound_checked_up_to_ = to; }
1326 void set_flush_budget(int to) { flush_budget_ = to; }
1394 // Node visitor used to add the start set of the alternatives to the
1430 // \b to the affected nodes. For instance, in /.\b./ information must
1431 // be propagated to the first '.' that whatever follows needs to know
1432 // if it matched a word or a non-word, and to the second '.' that it
1433 // has to check if it succeeds a word or non-word. In this case the
1524 // Attempt to retrieve a cached result. On failure, 0 is returned as a Smi.
1525 // On success, the returned result is guaranteed to be a COW-array.
1528 // Attempt to add value_array to the cache specified by type. On success,
