grep/src/dfa.c

40 #include <string.h>
50 /* We can handle multibyte string.  */
324 static char const *lexstart;	/* Pointer to beginning of input string. */
352                                   in the input string.  A element's value
359 				   string in dfaexec().
361 				   the length of input string(char array).
792 	    return lasttok = BEGLINE;	/* FIXME: should be beginning of string */
797 	    return lasttok = ENDLINE;	/* FIXME: should be end of string */
961 	      /* In multibyte environment period must match with a single
1241 	 matched.  Treat this approximately like "(.\1)" -- i.e. match
1356 /* Main entry point for the parser.  S is a string to be parsed, len is the
1357    length of the string, so s can include NUL characters.  D is a pointer to
1548    contains a symbol that matches the empty string in some context, replace
1621    match the empty string.
1630    that could correspond to the first character of a string matching the
1641    correspond to the last character of a string matching the regexp at
1653    a string matching the regexp.  At this point we consider special symbols
1654    that match the empty string in some context to be just normal characters.
1944   charclass leftovers;		/* Stuff in the label that didn't match. */
1985 	  /* ANYCHAR and MBCSET must match with a single character, so we
1987 	     which can match with a single character not a byte.  */
2049 	      int match = matches[k], label = labels[j][k];
2051 	      (leftovers[k] = ~match & label) ? (leftoversf = 1) : 0;
2052 	      (matches[k] = match & ~label) ? (matchesf = 1) : 0;
2417 /* Check whether period can match or not in the current context.  If it can,
2418    return the amount of the bytes with which period can match, otherwise
2457 /* Check whether bracket expression can match or not in the current context.
2458    If it can, return the amount of the bytes with which expression can match,
2466   int match;		/* Flag which represent that matching succeed.  */
2468 			   with which this operator match.  */
2503   match = !work_mbc->invert;
2506   /* match with a character class?  */
2516   /* match with an equivalent class?  */
2529   /* match with a collating element?  */
2546   /* match with a range?  */
2557   /* match with a character?  */
2564   match = !match;
2567   return match ? match_len : 0;
2570 /* Check each of `d->states[s].mbps.elem' can match or not. Then return the
2573    match.
2656    buffer.  This function is for some operator which can match with a multi-
2674        We check whether each of them can match or not.  */
2680 	/* Search the operator which match the longest string,
2689     /* This state has no multibyte operator which can match.
2704   /* This state has some operators which can match a multibyte character.  */
2743 /* Search through a buffer looking for a match to the given struct dfa.
2744    Find the first occurrence of a string matching the regexp in the buffer,
2746    character after the match, or (size_t) -1 if none is found.  BEGIN points to
2750    match needs to be verified by a backtracking matcher.  Otherwise
2833 		/* Can match with a multibyte character( and multi character
2894 		    /* Can match with a multibyte character( and multi
2948 /* Parse and analyze a single string of the given length. */
3061 	sequences that must appear at the left of the match ("left")
3062 	sequences that must appear at the right of the match ("right")
3063 	lists of sequences that must appear somewhere in the match ("in")
3064 	sequences that must constitute the match ("is")
3115 					(Yes, we now find "epsi" as a "string
3157 icpyalloc (char *string)
3159   return icatalloc((char *) NULL, string);
3229   /* Add the new string. */