Lines Matching refs:pcre2_match
213 int pcre2_match(const pcre2_code *code, PCRE2_SPTR subject,
532 The functions pcre2_compile() and pcre2_match() are used for compiling
558 JIT matching is automatically used by pcre2_match() if it is available,
576 string that has been matched by pcre2_match(). They are:
645 section on pcre2_match() options below.
689 Use pointer in pcre2_match()
826 by the two interpreted matching functions, pcre2_match() and
874 and by the two interpreted matching functions, pcre2_match() and
915 pcre2_match(), pcre2_dfa_match(), or pcre2_jit_match().
945 pcre2_match() and pcre2_dfa_match() functions return
952 can never be found if the startoffset argument of pcre2_match(),
974 the maximum amount of heap memory that pcre2_match() may use to hold
991 unless ddd is less than the limit set by the caller of pcre2_match()
994 The pcre2_match() function starts out using a 20KiB vector on the sys-
1017 There is an internal counter in pcre2_match() that is incremented each
1019 limit, pcre2_match() returns the negative value PCRE2_ERROR_MATCHLIMIT.
1025 When pcre2_match() is called with a pattern that was successfully pro-
1040 unless ddd is less than the limit set by the caller of pcre2_match() or
1047 pcre2_match(). Each time a nested backtracking point is passed, a new
1076 the match limit. If the limit is exceeded, pcre2_match() or
1084 unless ddd is less than the limit set by the caller of pcre2_match() or
1129 depth of nested backtracking in pcre2_match() or the depth of nested
1136 limit for the amount of heap memory used by pcre2_match() or
1175 pcre2_match(). Further details are given with pcre2_set_match_limit()
1324 same as given by pcre2_match() and pcre2_dfa_match(), and are described
1738 Note that this option can also be passed to pcre2_match() and
1880 tern into machine code that executes much faster than the pcre2_match()
1940 pcre2_match() and pcre_dfa_match(). Thus, for any single pattern, com-
2090 backtracking positions when the pattern is processed by pcre2_match()
2201 pointers in the output vector (described with pcre2_match() below). To
2330 Before calling pcre2_match(), pcre2_dfa_match(), or pcre2_jit_match()
2359 When a call of pcre2_match() fails, valid data is available in the
2379 int pcre2_match(const pcre2_code *code, PCRE2_SPTR subject,
2384 The function pcre2_match() is called to match a subject string against
2386 pcre2_match() with the same code argument as many times as you like, in
2395 Here is an example of a simple call to pcre2_match():
2398 int rc = pcre2_match(
2412 The string to be matched by pcre2_match()
2414 The subject string is passed to pcre2_match() as a pointer in subject,
2421 If startoffset is greater than the length of the subject, pcre2_match()
2431 in the same subject by calling pcre2_match() again after a previous
2440 When applied to the string "Mississipi" the first call to pcre2_match()
2441 finds the first occurrence. If pcre2_match() is called again with just
2444 to be a word boundary. However, if pcre2_match() is passed the entire
2467 Option bits for pcre2_match()
2469 The unused bits of the options argument for pcre2_match() must be zero.
2477 is disabled and the interpretive code in pcre2_match() is run. Apart
2483 The PCRE2_ANCHORED option limits pcre2_match() to matching at the first
2491 If the PCRE2_ENDANCHORED option is set, any string that pcre2_match()
2523 match is not valid, so pcre2_match() searches further into the string
2537 pcre2_jit_compile(), JIT is automatically used when pcre2_match() is
2544 UTF string is checked by default when pcre2_match() is subsequently
2564 option when calling pcre2_match(). You might want to do this for the
2565 second and subsequent calls to pcre2_match() if you are making repeated
2586 case, if a partial match is found, pcre2_match() immediately returns
2674 on. The value returned by pcre2_match() is one more than the highest
2691 zero. If captured substrings are not of interest, pcre2_match() may be
2713 pcre2_match(). The other elements retain whatever values they previ-
2777 ERROR RETURNS FROM pcre2_match()
2779 If pcre2_match() fails, it returns a negative number. This can be con-
2787 returned by pcre2_match():
2828 This error is never generated by pcre2_match() itself. It is provided
2829 for use by callout functions that want to cause pcre2_match() or
2871 This error is returned when pcre2_match() detects a recursion loop
3089 This function calls pcre2_match() and then makes a copy of the subject
3100 pcre2_match(), except that the partial matching options are not permit-
3107 are those set by the final call to pcre2_match(), which will have ended
3158 As well as the usual options for pcre2_match(), a number of additional
3277 pcre2_match() are passed straight back.
3359 rent matched substring. Then return 1, which forces pcre2_match() to
3361 matches, pcre2_match() will yield PCRE2_ERROR_NOMATCH.
3383 pcre2_match(), plus two extras. The ovector within the match data block
3385 mon arguments are used in the same way as for pcre2_match(), so their
3416 the last four of these are exactly the same as for pcre2_match(), so
3422 These have the same general effect as they do for pcre2_match(), but
3476 the same way as for pcre2_match(), but the numbers bear no relation to
3501 Many of the errors are the same as for pcre2_match(), as described
3797 The pcre2_match() function increments a counter each time it goes round
3799 computing resource used by a single call to pcre2_match(). The limit
3810 The pcre2_match() function starts out using a 20KiB vector on the sys-
3822 interpretive matching in pcre2_match() and pcre2_dfa_match(), which may
3828 pcre2_match() interpreter. This limit defaults to the value that is set
3842 As well as applying to pcre2_match(), the depth limit also controls the
4083 backtracking in the pcre2_match() function. The default was to use the
4363 For calls to pcre2_match(), the offset_vector field is not (since
4429 In callouts from pcre2_match() the mark field contains a pointer to the
4437 pcre2_dfa_match() or when JIT is being used. When pcre2_match() without
4449 from a pcre2_match() run.
4817 TIAL_HARD or PCRE2_PARTIAL_SOFT options of pcre2_match(), you should
4821 pcre2_match() is called, the appropriate code is run if it is avail-
4841 There are some pcre2_match() options that are not supported by JIT, and
4863 The pcre2_match() options that are supported for JIT matching are
4868 If the PCRE2_NO_JIT option is passed to pcre2_match() it disables the
4879 same as those given by the interpretive pcre2_match() code, with the
4941 is not obeyed when pcre2_match() is called with options that are incom-
5008 used by pcre2_match(), (that is, it is assigned to a match context that
5017 pcre2_match() again. When you assign the stack to a match context, only
5020 time. Just do not call pcre2_match() with a match context pointing to
5022 a stack currently used by pcre2_match() in another thread). You can
5027 pcre2_match()?
5083 rc = pcre2_match(re, subject, length, 0, 0, match_data, mcontext);
5097 pcre2_match() does have a performance impact. Programs that are written
5100 matching directly instead of calling pcre2_match() (obviously only for
5104 exactly the same arguments as pcre2_match(). The return values are also
5110 When you call pcre2_match(), as well as testing for invalid options, a
5117 Bypassing the sanity checks and the pcre2_match() wrapping can give
5223 pcre2_match() function. This works in the same as as Perl's matching
5487 PARTIAL MATCHING USING pcre2_match()
5489 A partial match occurs during a call to pcre2_match() when the end of
5517 PCRE2_PARTIAL_SOFT WITH pcre2_match()
5519 If PCRE2_PARTIAL_SOFT is set when pcre2_match() identifies a partial
5543 PCRE2_PARTIAL_HARD WITH pcre2_match()
5545 If PCRE2_PARTIAL_HARD is set for pcre2_match(), PCRE2_ERROR_PARTIAL is
5695 MULTI-SEGMENT MATCHING WITH pcre2_match()
5698 match with a new segment of data when using pcre2_match(). Instead, new
5732 matching process. When using pcre2_match(), sufficient characters must
5895 its main matching function, pcre2_match(), is used. PCRE2 also has an
5984 The pcre2_match() function contains a counter that is incremented every
5985 time it goes round its main loop. The caller of pcre2_match() can set a
5995 not match). When one of these limits is reached, pcre2_match() gives an
6005 pcre2_match() for it to have any effect. In other words, the pattern
6014 The heap limit applies only when the pcre2_match() or pcre2_dfa_match()
6768 If the subject is "foobar", a call to pcre2_match() with a starting
6809 acters. However, if the startoffset argument of pcre2_match() is non-
6817 set argument of pcre2_match(). It differs from \A when the value of
6818 startoffset is non-zero. By calling pcre2_match() multiple times with
6847 ment of pcre2_match() is non-zero, or if PCRE2_NOTBOL is set, circum-
6886 pcre2_match() is non-zero. The PCRE2_DOLLAR_ENDONLY option is ignored
8581 context to pcre2_match() or pcre2_dfa_match(). If no match context is
8824 verb that is encountered, once it has been passed pcre2_match() is com-
9185 From release 10.30, the interpretive (non-JIT) version of pcre2_match()
9197 In contrast to pcre2_match(), pcre2_dfa_match() does use recursive
9234 pcre2_match(); the performance loss is less with a DFA matching func-
9330 pcre2_match() or pcre2_dfa_match() is called. For details of these
10253 value of the limits set by the caller of pcre2_match() or
10477 pcre2_match() is called, the matching will be carried out by the normal
10526 case of pcre2_match() and pcre2_dfa_match() calls with a non-zero
10560 pcre2_match() or pcre2_dfa_match().