2 * ngIRCd -- The Next Generation IRC Daemon
3 * Copyright (c)2001-2014 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
28 * The pattern matching functions [Matche(), Matche_After_Star()] are based
29 * on code of J. Kercheval. Version 1.1 has been released on 1991-03-12 as
30 * "public domain": <http://c.snippets.org/snip_lister.php?fname=match.c>
33 static int Matche PARAMS(( const char *p, const char *t ));
34 static int Matche_After_Star PARAMS(( const char *p, const char *t ));
36 #define MATCH_PATTERN 6 /**< bad pattern */
37 #define MATCH_LITERAL 5 /**< match failure on literal match */
38 #define MATCH_RANGE 4 /**< match failure on [..] construct */
39 #define MATCH_ABORT 3 /**< premature end of text string */
40 #define MATCH_END 2 /**< premature end of pattern string */
41 #define MATCH_VALID 1 /**< valid match */
44 * Match string with pattern.
46 * @param Pattern Pattern to match with
47 * @param String Input string
48 * @return true if pattern matches
51 Match( const char *Pattern, const char *String )
53 if( Matche( Pattern, String ) == MATCH_VALID ) return true;
58 * Match string with pattern case-insensitive.
60 * @param Pattern Pattern to match with
61 * @param String Input string, at most COMMAND_LEN-1 characters long
62 * @return true if pattern matches
65 MatchCaseInsensitive(const char *Pattern, const char *String)
67 char haystack[COMMAND_LEN];
69 strlcpy(haystack, String, sizeof(haystack));
70 return Match(Pattern, ngt_LowerStr(haystack));
71 } /* MatchCaseInsensitive */
74 * Match string with pattern case-insensitive.
76 * @param pattern Pattern to match with
77 * @param String Input string, at most COMMAND_LEN-1 characters long
78 * @param Separator Character separating the individual patterns in the list
79 * @return true if pattern matches
82 MatchCaseInsensitiveList(const char *Pattern, const char *String,
83 const char *Separator)
85 char tmp_pattern[COMMAND_LEN], haystack[COMMAND_LEN], *ptr;
87 strlcpy(tmp_pattern, Pattern, sizeof(tmp_pattern));
88 strlcpy(haystack, String, sizeof(haystack));
89 ngt_LowerStr(haystack);
91 ptr = strtok(tmp_pattern, Separator);
94 if (Match(ptr, haystack))
96 ptr = strtok(NULL, Separator);
99 } /* MatchCaseInsensitive */
102 Matche( const char *p, const char *t )
104 for( ; *p; p++, t++ )
106 /* if this is the end of the text then this is the end of the match */
109 return ( *p == '*' && *++p == '\0' ) ? MATCH_VALID : MATCH_ABORT;
112 /* determine and react to pattern type */
115 case '?': /* single any character match */
118 case '*': /* multiple any character match */
119 return Matche_After_Star( p, t );
121 default: /* must match this character exactly */
122 if( *p != *t ) return MATCH_LITERAL;
125 /* if end of text not reached then the pattern fails */
127 if( *t ) return MATCH_END;
128 else return MATCH_VALID;
132 Matche_After_Star( const char *p, const char *t )
134 register int nextp, match = 0;
136 /* pass over existing ? and * in pattern */
137 while( *p == '?' || *p == '*' )
139 /* take one char for each ? and + */
142 /* if end of text then no match */
143 if( ! *t++ ) return MATCH_ABORT;
146 /* move to next char in pattern */
150 /* if end of pattern we have matched regardless of text left */
151 if( ! *p ) return MATCH_VALID;
153 /* get the next character to match which must be a literal or '[' */
159 /* if end of text then we have a bad pattern */
160 if( ! nextp ) return MATCH_PATTERN;
163 /* Continue until we run out of text or definite result seen */
166 /* a precondition for matching is that the next character
167 * in the pattern match the next character in the text or that
168 * the next pattern char is the beginning of a range. Increment
169 * text pointer as we go here */
170 if( nextp == *t || nextp == '[' ) match = Matche( p, t );
172 /* if the end of text is reached then no match */
173 if( ! *t++ ) match = MATCH_ABORT;
174 } while( match != MATCH_VALID && match != MATCH_ABORT && match != MATCH_PATTERN );
178 } /* Matche_After_Star */