| /external/pcre/dist2/doc/ |
| pcre2matching.3 | |
| pcre2syntax.3 | 431 limits set by the caller of pcre2_match(), not increase them. The application
|
| pcre2pattern.3 | [all...] |
| /external/pcre/dist2/src/ |
| pcre2_xclass.c | 42 class. It is used by pcre2_auto_possessify() and by both pcre2_match() and
|
| pcre2_substitute.c | 170 pcre2_match(). Either string length may be PCRE2_ZERO_TERMINATED.
300 rc = pcre2_match(code, subject, length, start_offset, options|goptions,
|
| config.h.generic | 154 pcre2_match(). There is a runtime interface for setting a different limit.
|
| config.h.in | 149 pcre2_match(). There is a runtime interface for setting a different limit.
|
| pcre2posix.c | 330 rc = pcre2_match((const pcre2_code *)preg->re_pcre2_code,
|
| pcre2grep.c | 989 if (pcre2_match(ep->compiled, (PCRE2_SPTR)path, plen, 0, 0, match_data, NULL) >= 0)
997 if (pcre2_match(ip->compiled, (PCRE2_SPTR)path, plen, 0, 0, match_data, NULL) >= 0)
[all...] |
| pcre2_internal.h | 133 with a custom type. This makes it possible, for example, to allow pcre2_match()
136 pcre2_match() because of the way it backtracks. */
555 enum { PCRE2_MATCHEDBY_INTERPRETER, /* pcre2_match() */
[all...] |
| pcre2test.c | [all...] |
| pcre2_intmodedep.h | 765 pcre2_match(). */
773 doing traditional NFA matching (pcre2_match() and friends). */
[all...] |
| /external/pcre/dist2/ |
| HACKING | 126 The "traditional", and original, matching function is called pcre2_match(), and
132 is run instead of the normal pcre2_match() code, but the result is the same.
142 compiled pattern data as pcre2_match(); however, not all the facilities are
|
| README | 242 pcre2_match() can supply their own value. There is more discussion on the
265 pcre2_match() does not call itself recursively. Instead, it uses memory
273 the normal execution of the pcre2_match() function; if JIT support is being
[all...] |
| NON-AUTOTOOLS-BUILD | 103 pcre2_match.c
|
| /external/pcre/dist2/doc/html/ |
| README.txt | 242 pcre2_match() can supply their own value. There is more discussion on the
265 pcre2_match() does not call itself recursively. Instead, it uses memory
273 the normal execution of the pcre2_match() function; if JIT support is being
[all...] |
| pcre2matching.html | 29 string. The "standard" algorithm is the one provided by the <b>pcre2_match()</b>
|
| pcre2pattern.html | 66 matching function, <b>pcre2_match()</b>, is used. PCRE2 also has an alternative
176 The caller of <b>pcre2_match()</b> can set a limit on the number of times the
181 by too much recursion. When one of these limits is reached, <b>pcre2_match()</b>
189 be less than the value set (or defaulted) by the caller of <b>pcre2_match()</b>
[all...] |
| NON-AUTOTOOLS-BUILD.txt | 103 pcre2_match.c
|
| pcre2syntax.html | 454 limits set by the caller of pcre2_match(), not increase them. The application
|
| /external/pcre/dist2/testdata/ |
| grepoutput | 387 pcre2grep: pcre2_match() gave error -47 while matching this text:
391 pcre2grep: pcre2_match() gave error -47 while matching this text:
513 pcre2grep: pcre2_match() gave error -47 while matching text that starts:
523 pcre2grep: pcre2_match() gave error -53 while matching text that starts:
|
| /external/pcre/include_internal/ |
| config.h | 151 pcre2_match(). There is a runtime interface for setting a different limit.
|
| /external/selinux/libselinux/src/ |
| regex.c | 217 rc = pcre2_match(
|
| /system/sepolicy/tools/ |
| check_seapp.c | 326 int ret = pcre2_match(assert->regex.compiled, (PCRE2_SPTR) tomatch,
330 /* ret > 0 from pcre2_match means matched */
|
| /external/pcre/pcrecpp/ |
| pcrecpp.cc | 346 int rc = pcre2_match(
|
