gettext-tools/libgrep/dfa.c

31 #include <string.h>
35 /* We can handle multibyte string.  */
298 static char const *lexstart;	/* Pointer to beginning of input string. */
325                                   in the input string.  A element's value
332 				   string in dfaexec().
334 				   the length of input string(char array).
766 	    return lasttok = BEGLINE;	/* FIXME: should be beginning of string */
771 	    return lasttok = ENDLINE;	/* FIXME: should be end of string */
935 	      /* In multibyte environment period must match with a single
1220 	 matched.  Treat this approximately like "(.\1)" -- i.e. match
1335 /* Main entry point for the parser.  S is a string to be parsed, len is the
1336    length of the string, so s can include NUL characters.  D is a pointer to
1527    contains a symbol that matches the empty string in some context, replace
1600    match the empty string.
1609    that could correspond to the first character of a string matching the
1620    correspond to the last character of a string matching the regexp at
1632    a string matching the regexp.  At this point we consider special symbols
1633    that match the empty string in some context to be just normal characters.
1923   charclass leftovers;		/* Stuff in the label that didn't match. */
1964 	  /* ANYCHAR and MBCSET must match with a single character, so we
1966 	     which can match with a single character not a byte.  */
2028 	      int match = matches[k], label = labels[j][k];
2030 	      (leftovers[k] = ~match & label) ? (leftoversf = 1) : 0;
2031 	      (matches[k] = match & ~label) ? (matchesf = 1) : 0;
2396 /* Check whether period can match or not in the current context.  If it can,
2397    return the amount of the bytes with which period can match, otherwise
2436 /* Check whether bracket expression can match or not in the current context.
2437    If it can, return the amount of the bytes with which expression can match,
2445   int match;		/* Flag which represent that matching succeed.  */
2447 			   with which this operator match.  */
2482   match = !work_mbc->invert;
2485   /* match with a character class?  */
2495   /* match with an equivalent class?  */
2508   /* match with a collating element?  */
2525   /* match with a range?  */
2536   /* match with a character?  */
2543   match = !match;
2546   return match ? match_len : 0;
2549 /* Check each of `d->states[s].mbps.elem' can match or not. Then return the
2552    match.
2635    buffer.  This function is for some operator which can match with a multi-
2653        We check whether each of them can match or not.  */
2659 	/* Search the operator which match the longest string,
2668     /* This state has no multibyte operator which can match.
2683   /* This state has some operators which can match a multibyte character.  */
2722 /* Search through a buffer looking for a match to the given struct dfa.
2723    Find the first occurrence of a string matching the regexp in the buffer,
2725    character after the match, or (size_t) -1 if none is found.  BEGIN points to
2729    match needs to be verified by a backtracking matcher.  Otherwise
2818 		/* Can match with a multibyte character( and multi character
2883 		    /* Can match with a multibyte character( and multi
2937 /* Parse and analyze a single string of the given length. */
3050 	sequences that must appear at the left of the match ("left")
3051 	sequences that must appear at the right of the match ("right")
3052 	lists of sequences that must appear somewhere in the match ("in")
3053 	sequences that must constitute the match ("is")
3104 					(Yes, we now find "epsi" as a "string
3146 icpyalloc (char *string)
3148   return icatalloc((char *) NULL, string);
3218   /* Add the new string. */