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
27 * The pattern matching functions [Matche(), Matche_After_Star()] are based
28 * on code of J. Kercheval. Version 1.1 has been released on 1991-03-12 as
29 * "public domain": <http://c.snippets.org/snip_lister.php?fname=match.c>
32 static int Matche PARAMS(( const char *p, const char *t ));
33 static int Matche_After_Star PARAMS(( const char *p, const char *t ));
35 #define MATCH_PATTERN 6 /**< bad pattern */
36 #define MATCH_LITERAL 5 /**< match failure on literal match */
37 #define MATCH_RANGE 4 /**< match failure on [..] construct */
38 #define MATCH_ABORT 3 /**< premature end of text string */
39 #define MATCH_END 2 /**< premature end of pattern string */
40 #define MATCH_VALID 1 /**< valid match */
43 * Match string with pattern.
45 * @param Pattern Pattern to match with
46 * @param String Input string
47 * @return true if pattern matches
50 Match( const char *Pattern, const char *String )
52 if( Matche( Pattern, String ) == MATCH_VALID ) return true;
57 * Match string with pattern case-insensitive.
59 * @param Pattern Pattern to match with
60 * @param String Input string, at most COMMAND_LEN-1 characters long
61 * @return true if pattern matches
64 MatchCaseInsensitive(const char *Pattern, const char *String)
66 char haystack[COMMAND_LEN];
68 strlcpy(haystack, String, sizeof(haystack));
69 return Match(Pattern, ngt_LowerStr(haystack));
70 } /* MatchCaseInsensitive */
73 * Match string with pattern case-insensitive.
75 * @param pattern Pattern to match with
76 * @param String Input string, at most COMMAND_LEN-1 characters long
77 * @param Separator Character separating the individual patterns in the list
78 * @return true if pattern matches
81 MatchCaseInsensitiveList(const char *Pattern, const char *String,
82 const char *Separator)
84 char tmp_pattern[COMMAND_LEN], haystack[COMMAND_LEN], *ptr;
86 strlcpy(tmp_pattern, Pattern, sizeof(tmp_pattern));
87 strlcpy(haystack, String, sizeof(haystack));
88 ngt_LowerStr(haystack);
90 ptr = strtok(tmp_pattern, Separator);
93 if (Match(ptr, haystack))
95 ptr = strtok(NULL, Separator);
98 } /* MatchCaseInsensitive */
101 Matche( const char *p, const char *t )
103 for( ; *p; p++, t++ )
105 /* if this is the end of the text then this is the end of the match */
108 return ( *p == '*' && *++p == '\0' ) ? MATCH_VALID : MATCH_ABORT;
111 /* determine and react to pattern type */
114 case '?': /* single any character match */
117 case '*': /* multiple any character match */
118 return Matche_After_Star( p, t );
120 default: /* must match this character exactly */
121 if( *p != *t ) return MATCH_LITERAL;
124 /* if end of text not reached then the pattern fails */
126 if( *t ) return MATCH_END;
127 else return MATCH_VALID;
131 Matche_After_Star( const char *p, const char *t )
133 register int nextp, match = 0;
135 /* pass over existing ? and * in pattern */
136 while( *p == '?' || *p == '*' )
138 /* take one char for each ? and + */
141 /* if end of text then no match */
142 if( ! *t++ ) return MATCH_ABORT;
145 /* move to next char in pattern */
149 /* if end of pattern we have matched regardless of text left */
150 if( ! *p ) return MATCH_VALID;
152 /* get the next character to match which must be a literal or '[' */
158 /* if end of text then we have a bad pattern */
159 if( ! nextp ) return MATCH_PATTERN;
162 /* Continue until we run out of text or definite result seen */
165 /* a precondition for matching is that the next character
166 * in the pattern match the next character in the text or that
167 * the next pattern char is the beginning of a range. Increment
168 * text pointer as we go here */
169 if( nextp == *t || nextp == '[' ) match = Matche( p, t );
171 /* if the end of text is reached then no match */
172 if( ! *t++ ) match = MATCH_ABORT;
173 } while( match != MATCH_VALID && match != MATCH_ABORT && match != MATCH_PATTERN );
177 } /* Matche_After_Star */