ngircd-tor/src/ngircd/match.c

183 lines
4.7 KiB
C
Raw Normal View History

2002-06-26 17:42:58 +02:00
/*
* ngIRCd -- The Next Generation IRC Daemon
* Copyright (c)2001-2014 Alexander Barton (alex@barton.de) and Contributors.
2002-06-26 17:42:58 +02:00
*
* 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.
* Please read the file COPYING, README and AUTHORS for more information.
2002-06-26 17:42:58 +02:00
*/
#include "portab.h"
/**
* @file
* Wildcard pattern matching
*/
2002-06-26 17:42:58 +02:00
#include <assert.h>
#include <string.h>
2008-06-13 06:54:05 +02:00
#include "defines.h"
#include "tool.h"
2002-06-26 17:42:58 +02:00
#include "match.h"
2002-06-26 17:42:58 +02:00
/*
* The pattern matching functions [Matche(), Matche_After_Star()] are based
* on code of J. Kercheval. Version 1.1 has been released on 1991-03-12 as
* "public domain": <http://c.snippets.org/snip_lister.php?fname=match.c>
2002-06-26 17:42:58 +02:00
*/
static int Matche PARAMS(( const char *p, const char *t ));
static int Matche_After_Star PARAMS(( const char *p, const char *t ));
2002-06-26 17:42:58 +02:00
#define MATCH_PATTERN 6 /**< bad pattern */
#define MATCH_LITERAL 5 /**< match failure on literal match */
#define MATCH_RANGE 4 /**< match failure on [..] construct */
#define MATCH_ABORT 3 /**< premature end of text string */
#define MATCH_END 2 /**< premature end of pattern string */
#define MATCH_VALID 1 /**< valid match */
2002-06-26 17:42:58 +02:00
/**
* Match string with pattern.
*
* @param Pattern Pattern to match with
* @param String Input string
* @return true if pattern matches
*/
GLOBAL bool
Match( const char *Pattern, const char *String )
2002-06-26 17:42:58 +02:00
{
if (Matche(Pattern, String) == MATCH_VALID)
return true;
else
return false;
2002-06-26 17:42:58 +02:00
} /* Match */
/**
* Match string with pattern case-insensitive.
*
* @param Pattern Pattern to match with
* @param String Input string, at most COMMAND_LEN-1 characters long
* @return true if pattern matches
*/
2008-06-13 06:54:05 +02:00
GLOBAL bool
MatchCaseInsensitive(const char *Pattern, const char *String)
2008-06-13 06:54:05 +02:00
{
char needle[COMMAND_LEN], haystack[COMMAND_LEN];
2008-06-13 06:54:05 +02:00
strlcpy(needle, Pattern, sizeof(needle));
strlcpy(haystack, String, sizeof(haystack));
return Match(ngt_LowerStr(needle), ngt_LowerStr(haystack));
} /* MatchCaseInsensitive */
/**
* Match string with pattern case-insensitive.
*
* @param pattern Pattern to match with
* @param String Input string, at most COMMAND_LEN-1 characters long
* @param Separator Character separating the individual patterns in the list
* @return true if pattern matches
*/
GLOBAL bool
MatchCaseInsensitiveList(const char *Pattern, const char *String,
const char *Separator)
{
char tmp_pattern[COMMAND_LEN], *ptr;
strlcpy(tmp_pattern, Pattern, sizeof(tmp_pattern));
ptr = strtok(tmp_pattern, Separator);
while (ptr) {
ngt_TrimStr(ptr);
if (MatchCaseInsensitive(ptr, String))
return true;
ptr = strtok(NULL, Separator);
}
return false;
2008-06-13 06:54:05 +02:00
} /* MatchCaseInsensitive */
static int
Matche( const char *p, const char *t )
2002-06-26 17:42:58 +02:00
{
for( ; *p; p++, t++ )
{
/* if this is the end of the text then this is the end of the match */
if( ! *t )
{
return ( *p == '*' && *++p == '\0' ) ? MATCH_VALID : MATCH_ABORT;
}
/* determine and react to pattern type */
switch( *p )
{
case '?': /* single any character match */
break;
case '*': /* multiple any character match */
return Matche_After_Star( p, t );
default: /* must match this character exactly */
2002-06-26 17:42:58 +02:00
if( *p != *t ) return MATCH_LITERAL;
}
}
/* if end of text not reached then the pattern fails */
if( *t ) return MATCH_END;
else return MATCH_VALID;
} /* Matche */
static int
Matche_After_Star( const char *p, const char *t )
2002-06-26 17:42:58 +02:00
{
register int nextp, match = 0;
2002-06-26 17:42:58 +02:00
/* pass over existing ? and * in pattern */
while( *p == '?' || *p == '*' )
{
/* take one char for each ? and + */
if (*p == '?')
{
/* if end of text then no match */
if( ! *t++ ) return MATCH_ABORT;
}
/* move to next char in pattern */
p++;
}
/* if end of pattern we have matched regardless of text left */
if( ! *p ) return MATCH_VALID;
/* get the next character to match which must be a literal or '[' */
nextp = *p;
if( nextp == '\\' )
{
nextp = p[1];
/* if end of text then we have a bad pattern */
if( ! nextp ) return MATCH_PATTERN;
}
/* Continue until we run out of text or definite result seen */
do
{
/* a precondition for matching is that the next character
* in the pattern match the next character in the text or that
* the next pattern char is the beginning of a range. Increment
* text pointer as we go here */
if( nextp == *t || nextp == '[' ) match = Matche( p, t );
/* if the end of text is reached then no match */
if( ! *t++ ) match = MATCH_ABORT;
} while( match != MATCH_VALID && match != MATCH_ABORT && match != MATCH_PATTERN );
/* return result */
return match;
} /* Matche_After_Star */
/* -eof- */