version 1.1, 2007/01/10 21:44:31
|
version 1.1.4.2, 2007/03/23 21:53:45
|
|
|
|
/* |
|
//%2006//////////////////////////////////////////////////////////////////////// |
|
// |
|
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
|
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; Symantec Corporation; The Open Group. |
|
// |
|
// Permission is hereby granted, free of charge, to any person obtaining a copy |
|
// of this software and associated documentation files (the "Software"), to |
|
// deal in the Software without restriction, including without limitation the |
|
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|
// sell copies of the Software, and to permit persons to whom the Software is |
|
// furnished to do so, subject to the following conditions: |
|
// |
|
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN |
|
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED |
|
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT |
|
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR |
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
|
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
// |
|
//%///////////////////////////////////////////////////////////////////////////// |
|
*/ |
|
|
|
#include "Match.h" |
|
#include "Log.h" |
|
|
|
/* |
|
**============================================================================== |
|
** |
|
** Match() |
|
** |
|
** Attempt to match *str* to the *pattern*. Return 0 if there is a match. |
|
** The only special character in the string is the '*' character. |
|
** |
|
**============================================================================== |
|
*/ |
|
|
|
int Match(const char* pattern, const char* str) |
|
{ |
|
const char* p; |
|
const char* q; |
|
|
|
/* Now match expression to str. */ |
|
|
|
for (p = pattern, q = str; *p && *q; ) |
|
{ |
|
if (*p == '*') |
|
{ |
|
const char* r; |
|
|
|
p++; |
|
|
|
/* Recursively call to find the shortest match. */ |
|
|
|
for (r = q; *r; r++) |
|
{ |
|
if (Match(p, r) == 0) |
|
break; |
|
} |
|
|
|
q = r; |
|
|
|
} |
|
else if (*p == *q) |
|
{ |
|
p++; |
|
q++; |
|
} |
|
else |
|
return -1; |
|
} |
|
|
|
/* If src was exhausted but pattern has a single '*' remaining charcters, |
|
* then match the result. |
|
*/ |
|
|
|
if (p[0] == '*' && p[1] == '\0') |
|
return 0; |
|
|
|
/* If anything left over, then they do not match. */ |
|
|
|
if (*p || *q) |
|
return -1; |
|
|
|
return 0; |
|
} |