a5231252b5
* src/common/hbffind.c
* src/common/hbwin.c
* src/common/hbstr.c
* src/common/expropt1.c
* src/common/expropt2.c
* src/common/hbmem.c
* src/common/strwild.c
* src/common/hbhash.c
* include/hbhash.h
* src/rtl/substr.c
* src/rtl/hbzlibgz.c
* src/rtl/hbtoken.c
* src/rtl/hbstrfmt.c
* src/rtl/transfrm.c
* src/rtl/hbadler.c
* src/rtl/hbcomhb.c
* src/rtl/hbmd5.c
* src/rtl/hbascii.c
* src/rtl/hbregexc.c
* src/rtl/hbprocfn.c
* src/rtl/hbsocket.c
* src/rtl/hbinet.c
* src/rtl/gtapi.c
* src/rtl/filesys.c
* src/rtl/hbregex.c
* src/rtl/hbbffnc.c
* src/rtl/hbgtcore.c
* src/rtl/hbi18n1.c
* src/rtl/gtclip.c
* src/rtl/itemseri.c
* src/rtl/hbsockhb.c
* src/rtl/hardcr.c
* src/rtl/hbzlib.c
* src/rtl/hbhex.c
* src/rtl/gete.c
* src/rtl/hbproces.c
* src/rtl/cdpapihb.c
* src/rtl/ati.c
* src/rtl/memofile.c
* src/rtl/hbstrsh.c
* Renamed HB_SIZE variables to have 'n' prefix.
(verified to generate the same objects as before)
286 lines
8.7 KiB
C
286 lines
8.7 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* wildcards / file match functions
|
|
*
|
|
* Copyright 2009 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
|
|
* www - http://harbour-project.org
|
|
*
|
|
* 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, 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 software; see the file COPYING. If not, write to
|
|
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/).
|
|
*
|
|
* As a special exception, the Harbour Project gives permission for
|
|
* additional uses of the text contained in its release of Harbour.
|
|
*
|
|
* The exception is that, if you link the Harbour libraries with other
|
|
* files to produce an executable, this does not by itself cause the
|
|
* resulting executable to be covered by the GNU General Public License.
|
|
* Your use of that executable is in no way restricted on account of
|
|
* linking the Harbour library code into it.
|
|
*
|
|
* This exception does not however invalidate any other reasons why
|
|
* the executable file might be covered by the GNU General Public License.
|
|
*
|
|
* This exception applies only to the code released by the Harbour
|
|
* Project under the name Harbour. If you copy code from other
|
|
* Harbour Project or Free Software Foundation releases into a copy of
|
|
* Harbour, as the General Public License permits, the exception does
|
|
* not apply to the code that you add in this way. To avoid misleading
|
|
* anyone as to the status of such modified files, you must delete
|
|
* this exception notice from them.
|
|
*
|
|
* If you write modifications of your own for Harbour, it is your choice
|
|
* whether to permit this exception to apply to your modifications.
|
|
* If you do not wish that, delete this exception notice.
|
|
*
|
|
*/
|
|
|
|
#include "hbapi.h"
|
|
|
|
#if defined( HB_OS_UNIX ) && !defined( HB_NO_FNMATCH )
|
|
# include <fnmatch.h>
|
|
#endif
|
|
|
|
#define HB_MAX_WILDPATTERN 256
|
|
|
|
HB_BOOL hb_strMatchWild( const char *szString, const char *szPattern )
|
|
{
|
|
HB_BOOL fMatch = HB_TRUE, fAny = HB_FALSE;
|
|
HB_SIZE pnBufPosP[ HB_MAX_WILDPATTERN ], pnBufPosV[ HB_MAX_WILDPATTERN ],
|
|
nBufSize = HB_MAX_WILDPATTERN;
|
|
HB_SIZE * nAnyPosP = pnBufPosP, * nAnyPosV = pnBufPosV,
|
|
nSize, nLen, nAny, i, j;
|
|
|
|
i = j = nAny = 0;
|
|
nLen = strlen( szString );
|
|
nSize = strlen( szPattern );
|
|
while( i < nSize )
|
|
{
|
|
if( szPattern[i] == '*' )
|
|
{
|
|
fAny = HB_TRUE;
|
|
i++;
|
|
}
|
|
else if( j < nLen && ( szPattern[i] == '?' || szPattern[i] == szString[j] ) )
|
|
{
|
|
if( fAny )
|
|
{
|
|
if( nAny >= nBufSize )
|
|
{
|
|
if( ( nBufSize <<= 1 ) == ( HB_MAX_WILDPATTERN << 1 ) )
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosP, pnBufPosP, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosV, pnBufPosV, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
}
|
|
else
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xrealloc( nAnyPosP, nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xrealloc( nAnyPosV, nBufSize * sizeof( HB_SIZE ) );
|
|
}
|
|
}
|
|
nAnyPosP[ nAny ] = i;
|
|
nAnyPosV[ nAny ] = j;
|
|
nAny++;
|
|
fAny = HB_FALSE;
|
|
}
|
|
j++;
|
|
i++;
|
|
}
|
|
else if( fAny && j < nLen )
|
|
{
|
|
j++;
|
|
}
|
|
else if( nAny > 0 )
|
|
{
|
|
nAny--;
|
|
i = nAnyPosP[ nAny ];
|
|
j = nAnyPosV[ nAny ] + 1;
|
|
fAny = HB_TRUE;
|
|
}
|
|
else
|
|
{
|
|
fMatch = HB_FALSE;
|
|
break;
|
|
}
|
|
}
|
|
if( nBufSize > HB_MAX_WILDPATTERN )
|
|
{
|
|
hb_xfree( nAnyPosP );
|
|
hb_xfree( nAnyPosV );
|
|
}
|
|
return fMatch;
|
|
}
|
|
|
|
HB_BOOL hb_strMatchWildExact( const char *szString, const char *szPattern )
|
|
{
|
|
HB_BOOL fMatch = HB_TRUE, fAny = HB_FALSE;
|
|
HB_SIZE pnBufPosP[ HB_MAX_WILDPATTERN ], pnBufPosV[ HB_MAX_WILDPATTERN ],
|
|
nBufSize = HB_MAX_WILDPATTERN;
|
|
HB_SIZE * nAnyPosP = pnBufPosP, * nAnyPosV = pnBufPosV,
|
|
nSize, nLen, nAny, i, j;
|
|
|
|
i = j = nAny = 0;
|
|
nLen = strlen( szString );
|
|
nSize = strlen( szPattern );
|
|
while( i < nSize || ( j < nLen && !fAny ) )
|
|
{
|
|
if( i < nSize && szPattern[i] == '*' )
|
|
{
|
|
fAny = HB_TRUE;
|
|
i++;
|
|
}
|
|
else if( j < nLen && i < nSize &&
|
|
( szPattern[i] == '?' || szPattern[i] == szString[j] ) )
|
|
{
|
|
if( fAny )
|
|
{
|
|
if( nAny >= nBufSize )
|
|
{
|
|
if( ( nBufSize <<= 1 ) == ( HB_MAX_WILDPATTERN << 1 ) )
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosP, pnBufPosP, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosV, pnBufPosV, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
}
|
|
else
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xrealloc( nAnyPosP, nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xrealloc( nAnyPosV, nBufSize * sizeof( HB_SIZE ) );
|
|
}
|
|
}
|
|
nAnyPosP[ nAny ] = i;
|
|
nAnyPosV[ nAny ] = j;
|
|
nAny++;
|
|
fAny = HB_FALSE;
|
|
}
|
|
j++;
|
|
i++;
|
|
}
|
|
else if( fAny && j < nLen )
|
|
{
|
|
j++;
|
|
}
|
|
else if( nAny > 0 )
|
|
{
|
|
nAny--;
|
|
i = nAnyPosP[ nAny ];
|
|
j = nAnyPosV[ nAny ] + 1;
|
|
fAny = HB_TRUE;
|
|
}
|
|
else
|
|
{
|
|
fMatch = HB_FALSE;
|
|
break;
|
|
}
|
|
}
|
|
if( nBufSize > HB_MAX_WILDPATTERN )
|
|
{
|
|
hb_xfree( nAnyPosP );
|
|
hb_xfree( nAnyPosV );
|
|
}
|
|
return fMatch;
|
|
}
|
|
|
|
HB_BOOL hb_strMatchCaseWildExact( const char *szString, const char *szPattern )
|
|
{
|
|
HB_BOOL fMatch = HB_TRUE, fAny = HB_FALSE;
|
|
HB_SIZE pnBufPosP[ HB_MAX_WILDPATTERN ], pnBufPosV[ HB_MAX_WILDPATTERN ],
|
|
nBufSize = HB_MAX_WILDPATTERN;
|
|
HB_SIZE * nAnyPosP = pnBufPosP, * nAnyPosV = pnBufPosV,
|
|
nSize, nLen, nAny, i, j;
|
|
|
|
i = j = nAny = 0;
|
|
nLen = strlen( szString );
|
|
nSize = strlen( szPattern );
|
|
while ( i < nSize || ( j < nLen && !fAny ) )
|
|
{
|
|
if( i < nSize && szPattern[i] == '*' )
|
|
{
|
|
fAny = HB_TRUE;
|
|
i++;
|
|
}
|
|
else if( j < nLen && i < nSize &&
|
|
( szPattern[i] == '?' ||
|
|
hb_charUpper( szPattern[i] ) == hb_charUpper( szString[j] ) ) )
|
|
{
|
|
if( fAny )
|
|
{
|
|
if( nAny >= nBufSize )
|
|
{
|
|
if( ( nBufSize <<= 1 ) == ( HB_MAX_WILDPATTERN << 1 ) )
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xgrab( nBufSize * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosP, pnBufPosP, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
memcpy( nAnyPosV, pnBufPosV, HB_MAX_WILDPATTERN * sizeof( HB_SIZE ) );
|
|
}
|
|
else
|
|
{
|
|
nAnyPosP = ( HB_SIZE * ) hb_xrealloc( nAnyPosP, nBufSize * sizeof( HB_SIZE ) );
|
|
nAnyPosV = ( HB_SIZE * ) hb_xrealloc( nAnyPosV, nBufSize * sizeof( HB_SIZE ) );
|
|
}
|
|
}
|
|
nAnyPosP[ nAny ] = i;
|
|
nAnyPosV[ nAny ] = j;
|
|
nAny++;
|
|
fAny = HB_FALSE;
|
|
}
|
|
j++;
|
|
i++;
|
|
}
|
|
else if( fAny && j < nLen )
|
|
{
|
|
j++;
|
|
}
|
|
else if( nAny > 0 )
|
|
{
|
|
nAny--;
|
|
i = nAnyPosP[ nAny ];
|
|
j = nAnyPosV[ nAny ] + 1;
|
|
fAny = HB_TRUE;
|
|
}
|
|
else
|
|
{
|
|
fMatch = HB_FALSE;
|
|
break;
|
|
}
|
|
}
|
|
if( nBufSize > HB_MAX_WILDPATTERN )
|
|
{
|
|
hb_xfree( nAnyPosP );
|
|
hb_xfree( nAnyPosV );
|
|
}
|
|
return fMatch;
|
|
}
|
|
|
|
HB_BOOL hb_strMatchFile( const char * szString, const char * szPattern )
|
|
{
|
|
#if defined( HB_OS_UNIX )
|
|
# if defined( HB_NO_FNMATCH )
|
|
return hb_strMatchWildExact( szString, szPattern );
|
|
# else
|
|
return fnmatch( szPattern, szString, FNM_PERIOD | FNM_PATHNAME ) == 0;
|
|
# endif
|
|
#else
|
|
return hb_strMatchCaseWildExact( szString, szPattern );
|
|
#endif
|
|
}
|