dist/lib/regexec.c

39 					 const char *string, Idx length,
50 				const char *string, Idx length, Idx start,
187    string STRING.
195    REG_NOTBOL is set, then ^ does not match at the beginning of the
196    string; if REG_NOTEOL is set, then $ does not match at the end.
198    We return 0 if we find a match and REG_NOMATCH if not.  */
201 regexec (const regex_t *__restrict preg, const char *__restrict string,
221       length = strlen (string);
226     err = re_search_internal (preg, string, length, start, length,
229     err = re_search_internal (preg, string, length, start, length,
245 		  const char *__restrict string, size_t nmatch,
248   return regexec (preg, string, nmatch, pmatch,
263    re_match() matches the compiled pattern in BUFP against the string,
266    re_search() first tries matching at index START, then it tries to match
271    The parameter STOP of re_{match,search}_2 specifies that no match exceeding
275    If REGS is not NULL, and BUFP->re_no_sub is not set, the offsets of the match
280    On success, re_match* functions return the length of the match, re_search*
281    return the position of the start of the match.  Return value -1 means no
282    match was found and -2 indicates an internal error.  */
285 re_match (struct re_pattern_buffer *bufp, const char *string,
288   return re_search_stub (bufp, string, length, start, 0, length, regs, true);
295 re_search (struct re_pattern_buffer *bufp, const char *string,
298   return re_search_stub (bufp, string, length, start, range, length, regs,
372    If RET_LEN is true the length of the match is returned (re_match style);
373    otherwise the position of the match is returned.  */
378 		const char *string, Idx length,
457   result = re_search_internal (bufp, string, length, start, last_start, stop,
462   /* I hope we needn't fill ther regs with -1's when no match was found.  */
555    Unless this function is called, the first search or match using
599 /* Searches for a compiled pattern PREG in the string STRING, whose
603    Return REG_NOERROR if we find a match, and REG_NOMATCH if not,
611 		    const char *string, Idx length,
672   err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,
705   /* Check incrementally whether of not the input string match.  */
723       /* Advance as rapidly as possible through the string, until we
735 	  /* Fastmap with single-byte translation, match forward.  */
737 		 && !fastmap[t[(unsigned char) string[match_first]]])
742 	  /* Fastmap without translation, match forward.  */
744 		 && !fastmap[(unsigned char) string[match_first]])
751 		       ? 0 : (unsigned char) string[match_first];
759 	  /* Fastmap without multi-byte translation, match backwards.  */
763 		       ? 0 : (unsigned char) string[match_first];
813      /* Don't consider this char as a possible match start if it part,
851 		break; /* We found a match.  */
1055 /* Check whether the regular expression match input string INPUT or not,
1057    there is no match, and return REG_ERROR in case of an error.
1059    If P_MATCH_FIRST is not NULL, and the match fails, it is set to the
1071   Idx match = 0;
1109   /* If the RE accepts NULL string.  */
1120 	      match = 1;
1150 	     already found a valid (even if not the longest) match.  */
1155 	      || (match && !fl_longest_match)
1178 	      match = 1;
1180 	      /* We found a match, do not modify match_first below.  */
1194 /* Check NODE match the current context.  */
1211 /* Check the halt state STATE match the current context.
1212    Return 0 if not match, if the node, STATE has, is a halt node and
1213    match the context, return the node.  */
1541 	      /* This is a non-empty match or we are not inside an optional
1549 		/* We transited through an empty match for an optional
1551 		   first match.  Copy back the old content of the registers
1573 	string `s' and transit to `b':
2380    multi-byte match, then look in the log for a state
2664 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2710 	  /* The matched string by the sub expression match with the substring
2716 		  /* Not enough chars for a successful match.  */
2756 	  /* The matched string by the sub expression match with the substring
2762 		  /* If we are at the end of the input, we cannot match.  */
3586 	 match it the context.  */
3715    STR_IDX is the current index of the input string.
3814       /* match with multibyte character?  */
3821       /* match with character_class?  */
3844 	  /* match with collating_symbol?  */
3877 	  /* match with range expression?  */
3886 	  /* match with equivalence_class?  */
3923 	  /* match with range expression?  */
4156    of the input, or changes the input string.  */