trunk/src/match.c

/*
 *  ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
 *
 *  Copyright (c) 1997-2014 ircd-hybrid development team
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
 *  USA
 */

/*! \file match.c
 * \brief Functions to match/compare strings.
 * \version $Id$
 */

#include <stdarg.h>
#include <string.h>

#include "match.h"

#define ToLower(c) (ToLowerTab[(unsigned char)(c)])

static const unsigned char ToLowerTab[] =
{
  0, 0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8, 0x9, 0xa,
  0xb, 0xc, 0xd, 0xe, 0xf, 0x10, 0x11, 0x12, 0x13, 0x14,
  0x15, 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d,
  0x1e, 0x1f,
  ' ', '!', '"', '#', '$', '%', '&', 0x27, '(', ')',
  '*', '+', ',', '-', '.', '/',
  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
  ':', ';', '<', '=', '>', '?',
  '@', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
  't', 'u', 'v', 'w', 'x', 'y', 'z', '{', '|', '}', '~',
  '_',
  '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
  't', 'u', 'v', 'w', 'x', 'y', 'z', '{', '|', '}', '~',
  0x7f,
  0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89,
  0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
  0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
  0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f,
  0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, 0xa8, 0xa9,
  0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
  0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9,
  0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf,
  0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9,
  0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf,
  0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9,
  0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf,
  0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9,
  0xea, 0xeb, 0xec, 0xed, 0xee, 0xef,
  0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9,
  0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff
};

/*! \brief Check a string against a mask.
 * This test checks using traditional IRC wildcards only: '*' means
 * match zero or more characters of any type; '?' means match exactly
 * one character of any type.  A backslash escapes the next character
 * so that a wildcard may be matched exactly.
 * param mask Wildcard-containing mask.
 * param name String to check against \a mask.
 * return Zero if \a mask matches \a name, non-zero if no match.
 */
int
match(const char *mask, const char *name)
{
  const char *m = mask, *n = name;
  const char *m_tmp = mask, *n_tmp = name;
  unsigned int star = 0;

  while (1)
  {
    switch (*m)
    {
      case '\0':
        if (*n == '\0')
          return 0;
  backtrack:
        if (m_tmp == mask)
          return 1;

        m = m_tmp;
        n = ++n_tmp;

        if (*n == '\0')
          return 1;
        break;
      case '\\':
        ++m;

        /* allow escaping to force capitalization */
        if (*m++ != *n++)
          goto backtrack;
        break;
      case '*':
      case '?':
        for (star = 0; ; ++m)
        {
          if (*m == '*')
            star = 1;
          else if (*m == '?')
          {
            if (*n++ == '\0')
              goto backtrack;
          }
          else
            break;
        }

        if (star)
        {
          if (*m == '\0')
            return 0;
          else if (*m == '\\')
          {
            m_tmp = ++m;

            if (*m == '\0')
              return 1;
            for (n_tmp = n; *n && *n != *m; ++n)
              ;
          }
          else
          {
            m_tmp = m;
            for (n_tmp = n; *n && (ToLower(*n) != ToLower(*m)); ++n)
              ;
          }
        }
        /* and fall through */
      default:
        if (*n == '\0')
          return *m != '\0';
        if (ToLower(*m) != ToLower(*n))
          goto backtrack;
        ++m;
        ++n;
        break;
    }
  }

  return 1;
}

/*
 * collapse()
 * Collapse a pattern string into minimal components.
 * This particular version is "in place", so that it changes the pattern
 * which is to be reduced to a "minimal" size.
 *
 * (C) Carlo Wood - 6 Oct 1998
 * Speedup rewrite by Andrea Cocito, December 1998.
 * Note that this new optimized algorithm can *only* work in place.
 */

/*! \brief Collapse a mask string to remove redundancies.
 * Specifically, it replaces a sequence of '*' followed by additional
 * '*' or '?' with the same number of '?'s as the input, followed by
 * one '*'.  This minimizes useless backtracking when matching later.
 * \param mask Mask string to collapse.
 * \return Pointer to the start of the string.
 */
char *
collapse(char *mask)
{
  unsigned int star = 0;
  char *m = mask;
  char *b = NULL;

  if (m)
  {
    do
    {
      if ((*m == '*') && (*(m + 1) == '*' || *(m + 1) == '?'))
      {
        b = m;

        do
        {
          if (*m == '*')
            star = 1;
          else
          {
            if (star && (*m != '?'))
            {
              *b++ = '*';
              star = 0;
            }

            *b++ = *m;

            if ((*m == '\\') && (*(m + 1) == '*' || *(m + 1) == '?'))
              *b++ = *++m;
          }
        } while (*m++);

        break;
      }
      else
      {
        if ((*m == '\\') && (*(m + 1) == '*' || *(m + 1) == '?'))
          ++m;
      }
    } while (*m++);
  }

  return mask;
}
Revision:	5134
Committed:	Thu Dec 25 18:50:02 2014 UTC (11 years, 7 months ago) by michael
Content type:	text/x-csrc
File size:	6024 byte(s)
Log Message:	- propset svn:keywords "Id"
#	User	Rev	Content
1	michael	5052	/*
2	michael	5076	* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
3	michael	5052	*
4	michael	5076	* Copyright (c) 1997-2014 ircd-hybrid development team
5	michael	5052	*
6	michael	5076	* This program is free software; you can redistribute it and/or modify
7			* it under the terms of the GNU General Public License as published by
8			* the Free Software Foundation; either version 2 of the License, or
9			* (at your option) any later version.
10	michael	5052	*
11	michael	5076	* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15	michael	5052	*
16	michael	5076	* You should have received a copy of the GNU General Public License
17			* along with this program; if not, write to the Free Software
18			* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
19			* USA
20	michael	5052	*/
21
22	michael	5076	/*! \file match.c
23			* \brief Functions to match/compare strings.
24	michael	5134	* \version $Id$
25	michael	5076	*/
26	michael	5052
27	michael	5076	#include <stdarg.h>
28			#include <string.h>
29	michael	5052
30	michael	5076	#include "match.h"
31	michael	5052
32	michael	5076	#define ToLower(c) (ToLowerTab[(unsigned char)(c)])
33	michael	5052
34	michael	5076	static const unsigned char ToLowerTab[] =
35			{
36			0, 0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8, 0x9, 0xa,
37			0xb, 0xc, 0xd, 0xe, 0xf, 0x10, 0x11, 0x12, 0x13, 0x14,
38			0x15, 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d,
39			0x1e, 0x1f,
40			' ', '!', '"', '#', '$', '%', '&', 0x27, '(', ')',
41			'*', '+', ',', '-', '.', '/',
42			'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
43			':', ';', '<', '=', '>', '?',
44			'@', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
45			'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
46			't', 'u', 'v', 'w', 'x', 'y', 'z', '{', '\|', '}', '~',
47			'_',
48			'`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
49			'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
50			't', 'u', 'v', 'w', 'x', 'y', 'z', '{', '\|', '}', '~',
51			0x7f,
52			0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89,
53			0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
54			0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
55			0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f,
56			0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, 0xa8, 0xa9,
57			0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
58			0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9,
59			0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf,
60			0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9,
61			0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf,
62			0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9,
63			0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf,
64			0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9,
65			0xea, 0xeb, 0xec, 0xed, 0xee, 0xef,
66			0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9,
67			0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff
68			};
69	michael	5052
70	michael	5076	/*! \brief Check a string against a mask.
71			* This test checks using traditional IRC wildcards only: '*' means
72			* match zero or more characters of any type; '?' means match exactly
73			* one character of any type. A backslash escapes the next character
74			* so that a wildcard may be matched exactly.
75			* param mask Wildcard-containing mask.
76			* param name String to check against \a mask.
77			* return Zero if \a mask matches \a name, non-zero if no match.
78			*/
79			int
80			match(const char mask, const char name)
81			{
82			const char m = mask, n = name;
83			const char m_tmp = mask, n_tmp = name;
84			unsigned int star = 0;
85	michael	5052
86	michael	5076	while (1)
87			{
88			switch (*m)
89			{
90			case '\0':
91			if (*n == '\0')
92			return 0;
93			backtrack:
94			if (m_tmp == mask)
95			return 1;
96	michael	5052
97	michael	5076	m = m_tmp;
98			n = ++n_tmp;
99	michael	5052
100	michael	5076	if (*n == '\0')
101			return 1;
102			break;
103			case '\\':
104			++m;
105	michael	5052
106	michael	5076	/* allow escaping to force capitalization */
107			if (m++ != n++)
108			goto backtrack;
109			break;
110			case '*':
111			case '?':
112			for (star = 0; ; ++m)
113			{
114			if (m == '')
115			star = 1;
116			else if (*m == '?')
117			{
118			if (*n++ == '\0')
119			goto backtrack;
120			}
121			else
122			break;
123			}
124	michael	5052
125	michael	5076	if (star)
126			{
127			if (*m == '\0')
128	michael	5052	return 0;
129	michael	5076	else if (*m == '\\')
130			{
131			m_tmp = ++m;
132	michael	5052
133	michael	5076	if (*m == '\0')
134			return 1;
135			for (n_tmp = n; n && n != *m; ++n)
136			;
137			}
138			else
139			{
140			m_tmp = m;
141			for (n_tmp = n; n && (ToLower(n) != ToLower(*m)); ++n)
142			;
143			}
144			}
145			/* and fall through */
146			default:
147			if (*n == '\0')
148			return *m != '\0';
149			if (ToLower(m) != ToLower(n))
150			goto backtrack;
151			++m;
152			++n;
153			break;
154			}
155			}
156	michael	5052
157	michael	5076	return 1;
158	michael	5052	}
159
160			/*
161	michael	5076	* collapse()
162			* Collapse a pattern string into minimal components.
163	michael	5052	* This particular version is "in place", so that it changes the pattern
164			* which is to be reduced to a "minimal" size.
165			*
166	michael	5076	* (C) Carlo Wood - 6 Oct 1998
167			* Speedup rewrite by Andrea Cocito, December 1998.
168			* Note that this new optimized algorithm can only work in place.
169	michael	5052	*/
170	michael	5076
171			/*! \brief Collapse a mask string to remove redundancies.
172			* Specifically, it replaces a sequence of '*' followed by additional
173			* '*' or '?' with the same number of '?'s as the input, followed by
174			* one '*'. This minimizes useless backtracking when matching later.
175			* \param mask Mask string to collapse.
176			* \return Pointer to the start of the string.
177			*/
178			char *
179			collapse(char *mask)
180	michael	5052	{
181	michael	5076	unsigned int star = 0;
182			char *m = mask;
183			char *b = NULL;
184	michael	5052
185	michael	5076	if (m)
186			{
187			do
188			{
189			if ((m == '') && ((m + 1) == '' \|\| *(m + 1) == '?'))
190	michael	5052	{
191	michael	5076	b = m;
192	michael	5052
193	michael	5076	do
194			{
195			if (m == '')
196			star = 1;
197			else
198			{
199			if (star && (*m != '?'))
200	michael	5052	{
201	michael	5076	b++ = '';
202			star = 0;
203	michael	5052	}
204	michael	5076
205			b++ = m;
206
207			if ((m == '\\') && ((m + 1) == '' \|\| (m + 1) == '?'))
208			b++ = ++m;
209			}
210			} while (*m++);
211
212			break;
213	michael	5052	}
214	michael	5076	else
215			{
216			if ((m == '\\') && ((m + 1) == '' \|\| (m + 1) == '?'))
217			++m;
218			}
219			} while (*m++);
220			}
221
222			return mask;
223	michael	5052	}