Lines Matching full:pcre2_match
202 int pcre2_match(const pcre2_code *code, PCRE2_SPTR subject,
473 The functions pcre2_compile(), and pcre2_match() are used for compiling
492 JIT matching is automatically used by pcre2_match() if it is available,
509 string that has been matched by pcre2_match(). They are:
575 section on pcre2_match() options below.
619 Use pointer in pcre2_match()
752 by the two interpreted matching functions, pcre2_match() and
785 preted matching functions, pcre2_match() and pcre2_dfa_match().
822 of pcre2_match(), pcre2_dfa_match(), or pcre2_jit_match().
852 pcre2_match() and pcre2_dfa_match() functions return
857 argument of pcre2_match() or pcre2_dfa_match() is greater than the off-
881 Internally, pcre2_match() uses a function called match(), which it
889 When pcre2_match() is called with a pattern that was successfully pro-
898 cases. If the limit is exceeded, pcre2_match() returns
905 unless ddd is less than the limit set by the caller of pcre2_match()
925 If the limit is exceeded, pcre2_match() returns PCRE2_ERROR_RECURSION-
932 unless ddd is less than the limit set by the caller of pcre2_match()
941 for use by pcre2_match() when PCRE2 is compiled to use the heap for
949 greater use of memory management, pcre2_match() runs more slowly. Func-
953 retained by pcre2_match() until it is about to exit so that they can be
1025 number of internal matching function calls in a pcre2_match() execu-
1026 tion. Further details are given with pcre2_match() below.
1057 pcre2_match() execution. Further details are given with pcre2_match()
1063 sion when running pcre2_match() is implemented by recursive function
1479 that this option can also be passed to pcre2_match() and
1525 are the same as given by pcre2_match() and pcre2_dfa_match(), and are
1552 tern into machine code that executes much faster than the pcre2_match()
1612 pcre2_match() and pcre_dfa_match(). Thus, for any single pattern, com-
1839 pointers in the output vector (described with pcre2_match() below). To
1968 Before calling pcre2_match(), pcre2_dfa_match(), or pcre2_jit_match()
1997 When a call of pcre2_match() fails, valid data is available in the
2016 int pcre2_match(const pcre2_code *code, PCRE2_SPTR subject,
2021 The function pcre2_match() is called to match a subject string against
2023 pcre2_match() with the same code argument as many times as you like, in
2032 Here is an example of a simple call to pcre2_match():
2035 int rc = pcre2_match(
2049 The string to be matched by pcre2_match()
2051 The subject string is passed to pcre2_match() as a pointer in subject,
2058 If startoffset is greater than the length of the subject, pcre2_match()
2068 in the same subject by calling pcre2_match() again after a previous
2077 When applied to the string "Mississipi" the first call to pcre2_match()
2078 finds the first occurrence. If pcre2_match() is called again with just
2081 to be a word boundary. However, if pcre2_match() is passed the entire
2102 Option bits for pcre2_match()
2104 The unused bits of the options argument for pcre2_match() must be zero.
2112 normal interpretive code in pcre2_match() is run. Apart from
2118 The PCRE2_ANCHORED option limits pcre2_match() to matching at the first
2152 match is not valid, so pcre2_match() searches further into the string
2166 pcre2_jit_compile(), JIT is automatically used when pcre2_match() is
2173 UTF string is checked by default when pcre2_match() is subsequently
2193 option when calling pcre2_match(). You might want to do this for the
2194 second and subsequent calls to pcre2_match() if you are making repeated
2215 case, if a partial match is found, pcre2_match() immediately returns
2261 HOW PCRE2_MATCH() RETURNS A STRING AND CAPTURED SUBSTRINGS
2302 value returned by pcre2_match() is one more than the highest numbered
2319 zero. If captured substrings are not of interest, pcre2_match() may be
2345 pcre2_match(). The other elements retain whatever values they previ-
2395 ERROR RETURNS FROM pcre2_match()
2397 If pcre2_match() fails, it returns a negative number. This can be con-
2405 returned by pcre2_match():
2445 This error is never generated by pcre2_match() itself. It is provided
2446 for use by callout functions that want to cause pcre2_match() or
2488 This error is returned when pcre2_match() detects a recursion loop
2709 This function calls pcre2_match() and then makes a copy of the subject
2717 pcre2_match(), except that the partial matching options are not permit-
2764 As well as the usual options for pcre2_match(), a number of additional
2868 pcre2_match() are passed straight back.
2949 rent matched substring. Then return 1, which forces pcre2_match() to
2951 matches, pcre2_match() will yield PCRE2_ERROR_NOMATCH.
2973 pcre2_match(), plus two extras. The ovector within the match data block
2975 mon arguments are used in the same way as for pcre2_match(), so their
3006 these are exactly the same as for pcre2_match(), so their description
3012 These have the same general effect as they do for pcre2_match(), but
3066 the same way as for pcre2_match(), but the numbers bear no relation to
3102 Many of the errors are the same as for pcre2_match(), as described
3380 When matching with the pcre2_match() function, PCRE2 implements back-
3398 the pcre2_match() function; it is not relevant for pcre2_dfa_match().
3405 pcre2_match() function. By controlling the maximum number of times this
3407 be placed on the resources used by a single call to pcre2_match(). The
3890 data block. When pcre2_match() is used, the contents can be inspected
3908 When the pcre2_match() is used, the capture_top field contains one more
3935 In callouts from pcre2_match() the mark field contains a pointer to the
4275 TIAL_HARD or PCRE2_PARTIAL_SOFT options of pcre2_match(), you should
4279 pcre2_match() is called, the appropriate code is run if it is avail-
4299 There are some pcre2_match() options that are not supported by JIT, and
4321 The pcre2_match() options that are supported for JIT matching are
4326 If the PCRE2_NO_JIT option is passed to pcre2_match() it disables the
4337 same as those given by the interpretive pcre2_match() code, with the
4399 is not obeyed when pcre2_match() is called with options that are incom-
4466 used by pcre2_match(), (that is, it is assigned to a match context that
4475 pcre2_match() again. When you assign the stack to a match context, only
4478 time. Just do not call pcre2_match() with a match context pointing to
4480 a stack currently used by pcre2_match() in another thread). You can
4485 pcre2_match()?
4541 rc = pcre2_match(re, subject, length, 0, 0, match_data, mcontext);
4555 pcre2_match() does have a performance impact. Programs that are written
4558 matching directly instead of calling pcre2_match() (obviously only for
4562 exactly the same arguments as pcre2_match(). The return values are also
4568 When you call pcre2_match(), as well as testing for invalid options, a
4575 Bypassing the sanity checks and the pcre2_match() wrapping can give
4688 pcre2_match() function. This works in the same as as Perl's matching
4952 PARTIAL MATCHING USING pcre2_match()
4954 A partial match occurs during a call to pcre2_match() when the end of
4982 PCRE2_PARTIAL_SOFT WITH pcre2_match()
4984 If PCRE2_PARTIAL_SOFT is set when pcre2_match() identifies a partial
5008 PCRE2_PARTIAL_HARD WITH pcre2_match()
5010 If PCRE2_PARTIAL_HARD is set for pcre2_match(), PCRE2_ERROR_PARTIAL is
5160 MULTI-SEGMENT MATCHING WITH pcre2_match()
5163 match with a new segment of data when using pcre2_match(). Instead, new
5197 matching process. When using pcre2_match(), sufficient characters must
5360 its main matching function, pcre2_match(), is used. PCRE2 also has an
5449 The caller of pcre2_match() can set a limit on the number of times the
5455 reached, pcre2_match() gives an error return. The limits can also be
5463 pcre2_match() for it to have any effect. In other words, the pattern
6197 acters. However, if the startoffset argument of pcre2_match() is non-
6205 of pcre2_match(). It differs from \A when the value of startoffset is
6206 non-zero. By calling pcre2_match() multiple times with appropriate
6234 ment of pcre2_match() is non-zero, or if PCRE2_NOTBOL is set, circum-
6273 pcre2_match() is non-zero. The PCRE2_DOLLAR_ENDONLY option is ignored
7897 context to pcre2_match() or pcre2_dfa_match(). If no match context is
8128 has been passed pcre2_match() is committed to finding a match at the
8441 When pcre2_match() is used for matching, certain kinds of pattern can
8470 pcre2_match(); the performance loss is less with a DFA matching func-
9099 When you call pcre2_match(), it makes use of an internal function
9122 The above comments apply when pcre2_match() is run in its normal inter-
9125 passed to pcre2_match() were not incompatible, the matching process
9131 pcre2_match(), and uses recursion only when there is a regular expres-
9142 relevant only for pcre2_match() without the JIT optimization.
9144 Reducing pcre2_match()'s stack usage
9174 Compiling PCRE2 to use heap instead of stack for pcre2_match()
9178 up points when pcre2_match() is running. This makes it run more slowly,
9188 and re-used if possible while pcre2_match() is running. They are all
9191 Limiting pcre2_match()'s stack usage
9195 pcre2_match() returns an error code. Setting suitable limits should
9198 PCRE2 is built, and they can also be set when pcre2_match() is called.
9209 that allow a a pattern to match. This is done by calling pcre2_match()
9232 must do this before calling pcre2_match().
9550 the limits set by the caller of pcre2_match(), not increase them. The
9754 pcre2_match() is called, the matching will be carried out by the normal
9797 case of pcre2_match() and pcre2_dfa_match() calls with a non-zero
9831 pcre2_match() or pcre2_dfa_match().
