Lines Matching refs:regexp
10 #include "src/regexp/regexp-ast.h"
11 #include "src/regexp/regexp-macro-assembler.h"
25 // Whether V8 is compiled with native regexp support or not.
35 // Implements RegExp.prototype.toString, see ECMA-262 section 15.10.6.4.
39 // Parses the RegExp pattern and prepares the JSRegExp object with
50 Handle<JSRegExp> regexp, Handle<String> subject, int index,
66 static int AtomExecRaw(Handle<JSRegExp> regexp,
72 static Handle<Object> AtomExec(Handle<JSRegExp> regexp,
78 // Prepare a RegExp for being executed one or more times (using
80 // This ensures that the regexp is compiled for the subject, and that
83 // as its "registers" argument. If the regexp cannot be compiled,
85 static int IrregexpPrepare(Handle<JSRegExp> regexp,
94 static int IrregexpExecRaw(Handle<JSRegExp> regexp,
105 Handle<JSRegExp> regexp, Handle<String> subject, int index,
115 GlobalCache(Handle<JSRegExp> regexp,
121 // Fetch the next entry in the cache for global regexp match results.
156 // would like to keep track of the amount of regexp code on the heap. This
158 // total regexp code compiled including code that has subsequently been freed
1043 // regexp can match by using a Boyer-Moore-like table. This is done by
1045 // character one at a time. For example in the middle of the regexp
1047 // inserted at the start of any non-anchored regexp.
1050 // characters that can come at given distances. For example for the regexp
1060 // We also look at the first string fed to the regexp and use that to get a hint
1186 // expression. A given node in the regexp can be code-generated several times
1187 // as it can be part of several traces. For example for the regexp:
