Lines Matching refs:back
397 this. The final byte order is passed back at the end of processing.
482 passed back by pcre16_compile() or pcre16_compile2() is still an 8-bit
728 this. The final byte order is passed back at the end of processing.
810 passed back by pcre32_compile() or pcre32_compile2() is still an 8-bit
1435 This provides support for capturing parentheses and back references.
1505 3. Because no substrings are captured, back references within the pat-
1559 2. Capturing parentheses and back references are not supported.
2082 in these cases, the offset passed back is the length of the pattern.
2243 (2) At run time, a back reference to an unset subpattern group matches
2555 those that cannot be handled, matching automatically falls back to the
2729 Return the number of the highest back reference in the pattern. The
2731 there are no back references.
2981 .* if PCRE_DOTALL is set and there are no back
3222 set to point to a suitable variable. If the pattern contains any back-
3224 with a name to pass back, a pointer to the name string (zero termi-
3228 If there is no name to pass back, the variable pointed to by the mark
3522 The first two-thirds of the vector is used to pass back captured sub-
3525 turing subpatterns, and is not available for passing back information.
3556 tern contains back references and the ovector is not big enough to
3639 If a pattern contains back references, but the ovector that is passed
4227 tern that it does not support, for instance, the use of \C or a back
4233 that uses a back reference for the condition, or a test for recursion
4367 into a+ and therefore the callouts that would be taken for the back-
4476 function specifically so that it can be passed back in callouts. It is
4963 that it stands for itself. In particular, if you want to match a back-
5014 \ddd character with octal code ddd, or back reference
5060 numbers and back references to be unambiguously specified.
5064 ter numbers, and \g{} to specify back references. The following para-
5072 in the expression, the entire sequence is taken as a back reference. A
5086 \7 is always a back reference
5087 \11 might be a back reference, or another way of
5091 \113 might be a back reference, otherwise the
5093 \377 might be a back reference, otherwise
5095 \81 is either a back reference, or the two
5156 Absolute and relative back references
5159 ally enclosed in braces, is an absolute or relative back reference. A
5160 named back reference can be coded as \g{name}. Back references are dis-
5169 \g<...> (Oniguruma syntax) are not synonymous. The former is a back
6055 string that matched the subpattern is passed back to the caller via the
6120 A back reference to a numbered subpattern uses the most recent value
6154 to capturing parentheses from other parts of the pattern, such as back
6190 If you make a back reference to a non-unique named subpattern from
6232 a back reference (see next section)
6350 When .* is inside capturing parentheses that are the subject of a back
6490 0 (and possibly further digits) is a back reference to a capturing sub-
6495 it is always taken as a back reference, and causes an error only if
6498 to the left of the reference for numbers less than 10. A "forward back
6503 It is not possible to have a numerical "forward back reference" to a
6508 such problem when named parentheses are used. A back reference to any
6534 A back reference matches whatever actually matched the capturing sub-
6543 time of the back reference, the case of letters is relevant. For exam-
6551 There are several different ways of writing back references to named
6554 unified back reference syntax, in which \g can be used for both numeric
6566 There may be more than one back reference to the same subpattern. If a
6567 subpattern has not actually been used in a particular match, any back
6573 the PCRE_JAVASCRIPT_COMPAT option is set at compile time, a back refer-
6577 its following a backslash are taken as part of a potential back refer-
6579 delimiter must be used to terminate the back reference. If the
6583 Recursive back references
6585 A back reference that occurs inside the parentheses to which it refers
6593 ation of the subpattern, the back reference matches the character
6596 to match the back reference. This can be done using alternation, as in
6707 to temporarily move the current position back by the fixed length and
7139 Once again, it cannot jump back into the recursion to try other alter-
7152 match "b", then in the second group, when the back reference \1 fails
7218 synonymous. The former is a back reference; the latter is a subroutine
7367 (*PRUNE:NAME), or (*THEN:NAME) on the matching path is passed back to
7387 true, the name is recorded and passed back if it is the last-encoun-
7416 ing can "jump back" to the left of the entire atomic group or asser-
7420 These verbs differ in exactly what kind of failure occurs when back-
7428 to fail outright if there is a later matching failure that causes back-
7439 most recently passed (*MARK) in the path is passed back when (*COMMIT)
7483 remembered for passing back to the caller. However, (*SKIP:NAME)
7518 This verb causes a skip to the next innermost alternative when back-
7529 quently BAZ fails, there are no more alternatives, so there is a back-
7535 remembered for passing back to the caller. However, (*SKIP:NAME)
8041 (*MARK:NAME) set name to be passed back; synonym (*:NAME)
8043 The following act only when a subsequent match failure causes a back-
8166 and pcre_dfa_exec() also pass back this information, as well as a more
8197 pcre16_exec() and pcre16_dfa_exec() also pass back this information, as
8220 pcre32_exec() and pcre32_dfa_exec() also pass back this information, as
8356 The normal API is implemented in a way that falls back to the interpre-
8427 back to the interpretive code. If you want to know whether JIT was
8467 thirds of the ovector argument is used for passing back captured sub-
8545 if you do not specify a JIT stack, or if you assign or pass back NULL
8547 machine stack. However, if you assign or pass back a non-NULL JIT
8670 Because the API described above falls back to interpreted execution
10282 back up and try a different alternative if the first one fails. As
10291 result of the recursive call would immediately be passed back as the
10353 compile PCRE to use heap memory instead of stack for remembering back-
