2 * ngIRCd -- The Next Generation IRC Daemon
3 * Copyright (c)2001-2012 Alexander Barton (alex@barton.de) and Contributors.
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.
16 * Wildcard pattern matching
30 * The pattern matching functions [Matche(), Matche_After_Star()] are based
31 * on code of J. Kercheval. Version 1.1 has been released on 1991-03-12 as
32 * "public domain": <http://c.snippets.org/snip_lister.php?fname=match.c>
36 static int Matche PARAMS(( const char *p, const char *t ));
37 static int Matche_After_Star PARAMS(( const char *p, const char *t ));
40 #define MATCH_PATTERN 6 /**< bad pattern */
41 #define MATCH_LITERAL 5 /**< match failure on literal match */
42 #define MATCH_RANGE 4 /**< match failure on [..] construct */
43 #define MATCH_ABORT 3 /**< premature end of text string */
44 #define MATCH_END 2 /**< premature end of pattern string */
45 #define MATCH_VALID 1 /**< valid match */
49 * Match string with pattern.
51 * @param Pattern Pattern to match with
52 * @param String Input string
53 * @return true if pattern matches
56 Match( const char *Pattern, const char *String )
58 if( Matche( Pattern, String ) == MATCH_VALID ) return true;
64 * Match string with pattern case-insensitive.
66 * @param Pattern Pattern to match with
67 * @param String Input string, at most COMMAND_LEN-1 characters long
68 * @return true if pattern matches
71 MatchCaseInsensitive(const char *Pattern, const char *String)
73 char haystack[COMMAND_LEN];
75 strlcpy(haystack, String, sizeof(haystack));
76 return Match(Pattern, ngt_LowerStr(haystack));
77 } /* MatchCaseInsensitive */
81 * Match string with pattern case-insensitive.
83 * @param pattern Pattern to match with
84 * @param String Input string, at most COMMAND_LEN-1 characters long
85 * @param Separator Character separating the individual patterns in the list
86 * @return true if pattern matches
89 MatchCaseInsensitiveList(const char *Pattern, const char *String,
90 const char *Separator)
92 char tmp_pattern[COMMAND_LEN], haystack[COMMAND_LEN], *ptr;
94 strlcpy(tmp_pattern, Pattern, sizeof(tmp_pattern));
95 strlcpy(haystack, String, sizeof(haystack));
96 ngt_LowerStr(haystack);
98 ptr = strtok(tmp_pattern, Separator);
101 if (Match(ptr, haystack))
103 ptr = strtok(NULL, Separator);
106 } /* MatchCaseInsensitive */
110 Matche( const char *p, const char *t )
112 register char range_start, range_end;
117 for( ; *p; p++, t++ )
119 /* if this is the end of the text then this is the end of the match */
122 return ( *p == '*' && *++p == '\0' ) ? MATCH_VALID : MATCH_ABORT;
125 /* determine and react to pattern type */
128 case '?': /* single any character match */
131 case '*': /* multiple any character match */
132 return Matche_After_Star( p, t );
134 case '[': /* [..] construct, single member/exclusion character match */
135 /* move to beginning of range */
138 /* check if this is a member match or exclusion match */
140 if( *p == '!' || *p == '^' )
146 /* if closing bracket here or at range start then we have a malformed pattern */
147 if ( *p == ']' ) return MATCH_PATTERN;
149 member_match = false;
154 /* if end of construct then loop is done */
161 /* matching a '!', '^', '-', '\' or a ']' */
162 if( *p == '\\' ) range_start = range_end = *++p;
163 else range_start = range_end = *p;
165 /* if end of pattern then bad pattern (Missing ']') */
166 if( ! *p ) return MATCH_PATTERN;
168 /* check for range bar */
171 /* get the range end */
174 /* if end of pattern or construct then bad pattern */
175 if( range_end == '\0' || range_end == ']' ) return MATCH_PATTERN;
177 /* special character range end */
178 if( range_end == '\\' )
182 /* if end of text then we have a bad pattern */
183 if ( ! range_end ) return MATCH_PATTERN;
186 /* move just beyond this range */
190 /* if the text character is in range then match found. make sure the range
191 * letters have the proper relationship to one another before comparison */
192 if( range_start < range_end )
194 if( *t >= range_start && *t <= range_end )
202 if( *t >= range_end && *t <= range_start )
210 /* if there was a match in an exclusion set then no match */
211 /* if there was no match in a member set then no match */
212 if(( invert && member_match ) || ! ( invert || member_match )) return MATCH_RANGE;
214 /* if this is not an exclusion then skip the rest of the [...]
215 * construct that already matched. */
220 /* bad pattern (Missing ']') */
221 if( ! *p ) return MATCH_PATTERN;
223 /* skip exact match */
228 /* if end of text then we have a bad pattern */
229 if( ! *p ) return MATCH_PATTERN;
232 /* move to next pattern char */
237 case '\\': /* next character is quoted and must match exactly */
238 /* move pattern pointer to quoted char and fall through */
241 /* if end of text then we have a bad pattern */
242 if( ! *p ) return MATCH_PATTERN;
244 /* must match this character exactly */
246 if( *p != *t ) return MATCH_LITERAL;
249 /* if end of text not reached then the pattern fails */
251 if( *t ) return MATCH_END;
252 else return MATCH_VALID;
257 Matche_After_Star( const char *p, const char *t )
259 register int nextp, match = 0;
261 /* pass over existing ? and * in pattern */
262 while( *p == '?' || *p == '*' )
264 /* take one char for each ? and + */
267 /* if end of text then no match */
268 if( ! *t++ ) return MATCH_ABORT;
271 /* move to next char in pattern */
275 /* if end of pattern we have matched regardless of text left */
276 if( ! *p ) return MATCH_VALID;
278 /* get the next character to match which must be a literal or '[' */
284 /* if end of text then we have a bad pattern */
285 if( ! nextp ) return MATCH_PATTERN;
288 /* Continue until we run out of text or definite result seen */
291 /* a precondition for matching is that the next character
292 * in the pattern match the next character in the text or that
293 * the next pattern char is the beginning of a range. Increment
294 * text pointer as we go here */
295 if( nextp == *t || nextp == '[' ) match = Matche( p, t );
297 /* if the end of text is reached then no match */
298 if( ! *t++ ) match = MATCH_ABORT;
299 } while( match != MATCH_VALID && match != MATCH_ABORT && match != MATCH_PATTERN );
303 } /* Matche_After_Star */