2 * ngIRCd -- The Next Generation IRC Daemon
3 * Copyright (c)2001,2002 by Alexander Barton (alex@barton.de)
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 * Please read the file COPYING, README and AUTHORS for more information.
11 * Wildcard pattern matching
17 static char UNUSED id[] = "$Id: match.c,v 1.5 2006/10/06 21:23:47 fw Exp $";
30 * Die Pattern-Matching-Funkionen [Matche(), Matche_After_Star()] basieren
31 * auf Versionen von J. Kercheval. Die Version 1.1 wurde am 12.03.1991 als
32 * "public domain" freigegeben:
33 * <http://www.snippets.org/snippets/portable/MATCH+C.php3>
37 static int Matche PARAMS(( const char *p, const char *t ));
38 static int Matche_After_Star PARAMS(( const char *p, const char *t ));
41 #define MATCH_PATTERN 6 /* bad pattern */
42 #define MATCH_LITERAL 5 /* match failure on literal match */
43 #define MATCH_RANGE 4 /* match failure on [..] construct */
44 #define MATCH_ABORT 3 /* premature end of text string */
45 #define MATCH_END 2 /* premature end of pattern string */
46 #define MATCH_VALID 1 /* valid match */
50 Match( const char *Pattern, const char *String )
52 /* Pattern mit String vergleichen */
53 if( Matche( Pattern, String ) == MATCH_VALID ) return true;
59 MatchCaseInsensitive(const char *pattern, const char *searchme)
61 char haystack[COMMAND_LEN];
63 strlcpy(haystack, searchme, sizeof(haystack));
65 ngt_LowerStr(haystack);
67 return Match(pattern, haystack);
68 } /* MatchCaseInsensitive */
72 Matche( const char *p, const char *t )
74 register char range_start, range_end;
81 /* if this is the end of the text then this is the end of the match */
84 return ( *p == '*' && *++p == '\0' ) ? MATCH_VALID : MATCH_ABORT;
87 /* determine and react to pattern type */
90 case '?': /* single any character match */
93 case '*': /* multiple any character match */
94 return Matche_After_Star( p, t );
96 case '[': /* [..] construct, single member/exclusion character match */
97 /* move to beginning of range */
100 /* check if this is a member match or exclusion match */
102 if( *p == '!' || *p == '^' )
108 /* if closing bracket here or at range start then we have a malformed pattern */
109 if ( *p == ']' ) return MATCH_PATTERN;
111 member_match = false;
116 /* if end of construct then loop is done */
123 /* matching a '!', '^', '-', '\' or a ']' */
124 if( *p == '\\' ) range_start = range_end = *++p;
125 else range_start = range_end = *p;
127 /* if end of pattern then bad pattern (Missing ']') */
128 if( ! *p ) return MATCH_PATTERN;
130 /* check for range bar */
133 /* get the range end */
136 /* if end of pattern or construct then bad pattern */
137 if( range_end == '\0' || range_end == ']' ) return MATCH_PATTERN;
139 /* special character range end */
140 if( range_end == '\\' )
144 /* if end of text then we have a bad pattern */
145 if ( ! range_end ) return MATCH_PATTERN;
148 /* move just beyond this range */
152 /* if the text character is in range then match found. make sure the range
153 * letters have the proper relationship to one another before comparison */
154 if( range_start < range_end )
156 if( *t >= range_start && *t <= range_end )
164 if( *t >= range_end && *t <= range_start )
172 /* if there was a match in an exclusion set then no match */
173 /* if there was no match in a member set then no match */
174 if(( invert && member_match ) || ! ( invert || member_match )) return MATCH_RANGE;
176 /* if this is not an exclusion then skip the rest of the [...]
177 * construct that already matched. */
182 /* bad pattern (Missing ']') */
183 if( ! *p ) return MATCH_PATTERN;
185 /* skip exact match */
190 /* if end of text then we have a bad pattern */
191 if( ! *p ) return MATCH_PATTERN;
194 /* move to next pattern char */
199 case '\\': /* next character is quoted and must match exactly */
200 /* move pattern pointer to quoted char and fall through */
203 /* if end of text then we have a bad pattern */
204 if( ! *p ) return MATCH_PATTERN;
206 /* must match this character exactly */
208 if( *p != *t ) return MATCH_LITERAL;
211 /* if end of text not reached then the pattern fails */
213 if( *t ) return MATCH_END;
214 else return MATCH_VALID;
219 Matche_After_Star( const char *p, const char *t )
221 register int nextp, match = 0;
223 /* pass over existing ? and * in pattern */
224 while( *p == '?' || *p == '*' )
226 /* take one char for each ? and + */
229 /* if end of text then no match */
230 if( ! *t++ ) return MATCH_ABORT;
233 /* move to next char in pattern */
237 /* if end of pattern we have matched regardless of text left */
238 if( ! *p ) return MATCH_VALID;
240 /* get the next character to match which must be a literal or '[' */
246 /* if end of text then we have a bad pattern */
247 if( ! nextp ) return MATCH_PATTERN;
250 /* Continue until we run out of text or definite result seen */
253 /* a precondition for matching is that the next character
254 * in the pattern match the next character in the text or that
255 * the next pattern char is the beginning of a range. Increment
256 * text pointer as we go here */
257 if( nextp == *t || nextp == '[' ) match = Matche( p, t );
259 /* if the end of text is reached then no match */
260 if( ! *t++ ) match = MATCH_ABORT;
261 } while( match != MATCH_VALID && match != MATCH_ABORT && match != MATCH_PATTERN );
265 } /* Matche_After_Star */