Lines Matching refs:pattern
13 The match() routine recursively compares a string to a "pattern" (regular
18 pattern to lowercase if indicated by the global var pInfo->lcflag (which
22 GRR: reversed order of text, pattern in matche() (now same as match());
43 Match the pattern (wildcard) against the string (fixed):
45 match(string, pattern, ignore_case, sepc);
47 returns TRUE if string matches pattern, FALSE otherwise. In the pattern:
56 characters allowed in the [..] pattern construct. Other characters are
113 int recmatch OF((ZCONST uch *pattern, ZCONST uch *string,
117 static int recmatch OF((ZCONST uch *pattern, ZCONST uch *string,
125 int match(string, pattern, ignore_case __WDL)
126 ZCONST char *string, *pattern;
132 int j = strlen(pattern);
145 strcpy(dospattern, pattern);
162 return recmatch((uch *)pattern, (uch *)string, ignore_case __WDL) == 1;
168 ZCONST uch *p; /* sh pattern to match */
172 /* Recursively compare the sh pattern p with the string s and return 1 if
174 * pattern. This routine recurses on itself no more deeply than the number
175 * of characters in the pattern. */
177 unsigned int c; /* pattern char or start of range in [-] loop */
179 /* Get first character, the pattern for new recmatch calls follows */
182 /* If that was the end of the pattern, match if string empty too */
216 /* end of pattern: matched if at end of string, else continue */
219 /* continue to match if at sepc in pattern, else give up */
231 /* Optimization for rest of pattern being a literal string:
233 * of the pattern behind the multi-char wildcard, then just
240 /* remaining literal string from pattern is longer than rest
245 /* compare the remaining literal pattern string with the last
279 /* pattern contains more wildcards, continue with recursion... */
430 put("String (return for new pattern): ");