1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997, 1999 Peter Mattis, Red Hat, Inc.
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
27 #include "gmessages.h"
33 /* keep enum and structure of gpattern.c and patterntest.c in sync */
36 G_MATCH_ALL, /* "*A?A*" */
37 G_MATCH_ALL_TAIL, /* "*A?AA" */
38 G_MATCH_HEAD, /* "AAAA*" */
39 G_MATCH_TAIL, /* "*AAAA" */
40 G_MATCH_EXACT, /* "AAAAA" */
46 GMatchType match_type;
54 /* --- functions --- */
56 static inline gboolean
57 g_pattern_ph_match (const gchar *match_pattern,
58 const gchar *match_string)
60 register const gchar *pattern, *string;
63 pattern = match_pattern;
64 string = match_string;
75 string = g_utf8_next_char (string);
87 string = g_utf8_next_char (string);
90 while (ch == '*' || ch == '?');
99 string = g_utf8_next_char (string);
102 if (g_pattern_ph_match (pattern, string))
124 g_pattern_match (GPatternSpec *pspec,
127 const gchar *string_reversed)
129 g_return_val_if_fail (pspec != NULL, FALSE);
130 g_return_val_if_fail (string != NULL, FALSE);
132 if (string_length < pspec->min_length ||
133 string_length > pspec->max_length)
136 switch (pspec->match_type)
139 return g_pattern_ph_match (pspec->pattern, string);
140 case G_MATCH_ALL_TAIL:
142 return g_pattern_ph_match (pspec->pattern, string_reversed);
147 tmp = g_utf8_strreverse (string, string_length);
148 result = g_pattern_ph_match (pspec->pattern, tmp);
153 if (pspec->pattern_length == string_length)
154 return strcmp (pspec->pattern, string) == 0;
155 else if (pspec->pattern_length)
156 return strncmp (pspec->pattern, string, pspec->pattern_length) == 0;
160 if (pspec->pattern_length)
161 return strcmp (pspec->pattern, string + (string_length - pspec->pattern_length)) == 0;
165 if (pspec->pattern_length != string_length)
168 return strcmp (pspec->pattern, string) == 0;
170 g_return_val_if_fail (pspec->match_type < G_MATCH_LAST, FALSE);
176 g_pattern_spec_new (const gchar *pattern)
179 gboolean seen_joker = FALSE, seen_wildcard = FALSE, more_wildcards = FALSE;
180 gint hw_pos = -1, tw_pos = -1, hj_pos = -1, tj_pos = -1;
181 gboolean follows_wildcard = FALSE;
182 guint pending_jokers = 0;
187 g_return_val_if_fail (pattern != NULL, NULL);
189 /* canonicalize pattern and collect necessary stats */
190 pspec = g_new (GPatternSpec, 1);
191 pspec->pattern_length = strlen (pattern);
192 pspec->min_length = 0;
193 pspec->max_length = 0;
194 pspec->pattern = g_new (gchar, pspec->pattern_length + 1);
196 for (i = 0, s = pattern; *s != 0; s++)
201 if (follows_wildcard) /* compress multiple wildcards */
203 pspec->pattern_length--;
206 follows_wildcard = TRUE;
214 pspec->max_length += 4; /* maximum UTF-8 character length */
217 for (; pending_jokers; pending_jokers--, i++) {
223 follows_wildcard = FALSE;
231 for (; pending_jokers; pending_jokers--) {
238 seen_joker = hj_pos >= 0;
239 seen_wildcard = hw_pos >= 0;
240 more_wildcards = seen_wildcard && hw_pos != tw_pos;
242 pspec->max_length = G_MAXUINT;
244 /* special case sole head/tail wildcard or exact matches */
245 if (!seen_joker && !more_wildcards)
247 if (pspec->pattern[0] == '*')
249 pspec->match_type = G_MATCH_TAIL;
250 memmove (pspec->pattern, pspec->pattern + 1, --pspec->pattern_length);
251 pspec->pattern[pspec->pattern_length] = 0;
254 if (pspec->pattern_length > 0 &&
255 pspec->pattern[pspec->pattern_length - 1] == '*')
257 pspec->match_type = G_MATCH_HEAD;
258 pspec->pattern[--pspec->pattern_length] = 0;
263 pspec->match_type = G_MATCH_EXACT;
268 /* now just need to distinguish between head or tail match start */
269 tw_pos = pspec->pattern_length - 1 - tw_pos; /* last pos to tail distance */
270 tj_pos = pspec->pattern_length - 1 - tj_pos; /* last pos to tail distance */
272 pspec->match_type = tw_pos > hw_pos ? G_MATCH_ALL_TAIL : G_MATCH_ALL;
273 else /* seen_joker */
274 pspec->match_type = tj_pos > hj_pos ? G_MATCH_ALL_TAIL : G_MATCH_ALL;
275 if (pspec->match_type == G_MATCH_ALL_TAIL) {
276 gchar *tmp = pspec->pattern;
277 pspec->pattern = g_utf8_strreverse (pspec->pattern, pspec->pattern_length);
284 g_pattern_spec_free (GPatternSpec *pspec)
286 g_return_if_fail (pspec != NULL);
288 g_free (pspec->pattern);
293 g_pattern_spec_equal (GPatternSpec *pspec1,
294 GPatternSpec *pspec2)
296 g_return_val_if_fail (pspec1 != NULL, FALSE);
297 g_return_val_if_fail (pspec2 != NULL, FALSE);
299 return (pspec1->pattern_length == pspec2->pattern_length &&
300 pspec1->match_type == pspec2->match_type &&
301 strcmp (pspec1->pattern, pspec2->pattern) == 0);
305 g_pattern_match_string (GPatternSpec *pspec,
308 g_return_val_if_fail (pspec != NULL, FALSE);
309 g_return_val_if_fail (string != NULL, FALSE);
311 return g_pattern_match (pspec, strlen (string), string, NULL);
315 g_pattern_match_simple (const gchar *pattern,
321 g_return_val_if_fail (pattern != NULL, FALSE);
322 g_return_val_if_fail (string != NULL, FALSE);
324 pspec = g_pattern_spec_new (pattern);
325 ergo = g_pattern_match (pspec, strlen (string), string, NULL);
326 g_pattern_spec_free (pspec);
331 #define __G_PATTERN_C__
332 #include "galiasdef.c"