5a2a287752
* *
* partial sync with the 3.4 fork codebase. These are the things
synces for the most part:
- copyright headers
- grammar/typos in comments and some readmes
- comment/whitespace/decorations
- variable scoping in C files
- DO CASE/SWITCH and some other alternate syntax usage
- minimal amount of human readable text in strings
- minor code updates
- HB_TRACE() void * casts for pointers and few other changes to
avoid C compiler warnings
- various other, minor code cleanups
- only Harbour/C code/headers were touched in src, utils, contrib,
include. No 3rd party code, no make files, and with just a few
exceptions, no 'tests' code was touched.
- certain components were not touched were 3.4 diverged too much
already, like f.e. hbmk2, hbssl, hbcurl, hbexpat
- the goal was that no actual program logic should be altered by
these changes. Except some possible minor exceptions, any such
change is probably a bug in this patch.
It's a massive patch, if you find anything broken after it, please
open an Issue with the details. Build test was done on macOS.
The goal is make it easier to see what actual code/logic was changed
in 3.4 compared to 3.2 and to make patches easier to apply in both
ways.
578 lines
19 KiB
C
578 lines
19 KiB
C
/*
|
|
* Regex functions
|
|
*
|
|
* Copyright 2007 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
|
|
*
|
|
* 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 program; see the file LICENSE.txt. If not, write to
|
|
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
* Boston, MA 02110-1301 USA (or visit https://www.gnu.org/licenses/).
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#define _HB_REGEX_INTERNAL_
|
|
#include "hbregex.h"
|
|
#include "hbapicdp.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapierr.h"
|
|
#include "hbinit.h"
|
|
|
|
#if defined( HB_HAS_PCRE )
|
|
static int s_iUTF8Enabled;
|
|
#endif
|
|
|
|
static void hb_regfree( PHB_REGEX pRegEx )
|
|
{
|
|
#if defined( HB_HAS_PCRE )
|
|
( pcre_free )( pRegEx->re_pcre );
|
|
#elif defined( HB_POSIX_REGEX )
|
|
regfree( &pRegEx->reg );
|
|
#else
|
|
HB_SYMBOL_UNUSED( pRegEx );
|
|
#endif
|
|
}
|
|
|
|
static int hb_regcomp( PHB_REGEX pRegEx, const char * szRegEx )
|
|
{
|
|
#if defined( HB_HAS_PCRE )
|
|
const unsigned char * pCharTable = NULL;
|
|
const char * szError = NULL;
|
|
int iErrOffset = 0;
|
|
int iCFlags = ( ( pRegEx->iFlags & HBREG_ICASE ) ? PCRE_CASELESS : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_NEWLINE ) ? PCRE_MULTILINE : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_DOTALL ) ? PCRE_DOTALL : 0 );
|
|
|
|
pRegEx->iEFlags = ( ( pRegEx->iFlags & HBREG_NOTBOL ) ? PCRE_NOTBOL : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_NOTEOL ) ? PCRE_NOTEOL : 0 );
|
|
|
|
/* use UTF8 in pcre when available and HVM CP is also UTF8. */
|
|
if( s_iUTF8Enabled && hb_cdpIsUTF8( NULL ) )
|
|
iCFlags |= PCRE_UTF8;
|
|
|
|
pRegEx->re_pcre = pcre_compile( szRegEx, iCFlags, &szError,
|
|
&iErrOffset, pCharTable );
|
|
return pRegEx->re_pcre ? 0 : -1;
|
|
#elif defined( HB_POSIX_REGEX )
|
|
int iCFlags = REG_EXTENDED |
|
|
( ( pRegEx->iFlags & HBREG_ICASE ) ? REG_ICASE : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_NEWLINE ) ? REG_NEWLINE : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_NOSUB ) ? REG_NOSUB : 0 );
|
|
pRegEx->iEFlags = ( ( pRegEx->iFlags & HBREG_NOTBOL ) ? REG_NOTBOL : 0 ) |
|
|
( ( pRegEx->iFlags & HBREG_NOTEOL ) ? REG_NOTEOL : 0 );
|
|
return regcomp( &pRegEx->reg, szRegEx, iCFlags );
|
|
#else
|
|
HB_SYMBOL_UNUSED( pRegEx );
|
|
HB_SYMBOL_UNUSED( szRegEx );
|
|
return -1;
|
|
#endif
|
|
}
|
|
|
|
static int hb_regexec( PHB_REGEX pRegEx, const char * szString, HB_SIZE nLen,
|
|
int iMatches, HB_REGMATCH * aMatches )
|
|
{
|
|
#if defined( HB_HAS_PCRE )
|
|
int iResult, i;
|
|
|
|
iResult = pcre_exec( pRegEx->re_pcre, NULL /* pcre_extra */,
|
|
szString, ( int ) nLen, 0 /* startoffset */,
|
|
pRegEx->iEFlags, aMatches, HB_REGMATCH_SIZE( iMatches ) );
|
|
if( iResult == 0 )
|
|
{
|
|
for( i = 0; i < iMatches; i++ )
|
|
{
|
|
if( HB_REGMATCH_EO( aMatches, i ) != HB_REGMATCH_UNSET )
|
|
iResult = i + 1;
|
|
}
|
|
}
|
|
return iResult;
|
|
#elif defined( HB_POSIX_REGEX )
|
|
char * szBuffer = NULL;
|
|
int iResult, i;
|
|
|
|
if( szString[ nLen ] != 0 )
|
|
{
|
|
szBuffer = hb_strndup( szString, nLen );
|
|
szString = szBuffer;
|
|
}
|
|
for( i = 0; i < iMatches; i++ )
|
|
HB_REGMATCH_EO( aMatches, i ) = HB_REGMATCH_UNSET;
|
|
iResult = regexec( &pRegEx->reg, szString, iMatches, aMatches, pRegEx->iEFlags );
|
|
if( iResult == 0 )
|
|
{
|
|
for( i = 0; i < iMatches; i++ )
|
|
{
|
|
if( HB_REGMATCH_EO( aMatches, i ) != HB_REGMATCH_UNSET )
|
|
iResult = i + 1;
|
|
}
|
|
}
|
|
else
|
|
iResult = -1;
|
|
if( szBuffer )
|
|
hb_xfree( szBuffer );
|
|
return iResult;
|
|
#else
|
|
HB_SYMBOL_UNUSED( pRegEx );
|
|
HB_SYMBOL_UNUSED( szString );
|
|
HB_SYMBOL_UNUSED( nLen );
|
|
HB_SYMBOL_UNUSED( iMatches );
|
|
HB_SYMBOL_UNUSED( aMatches );
|
|
return -1;
|
|
#endif
|
|
}
|
|
|
|
|
|
HB_FUNC( HB_REGEXCOMP )
|
|
{
|
|
HB_SIZE nLen = hb_parclen( 1 );
|
|
|
|
if( nLen == 0 )
|
|
hb_errRT_BASE_SubstR( EG_ARG, 3012, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
|
|
else
|
|
{
|
|
int iFlags = HBREG_EXTENDED;
|
|
PHB_REGEX pRegEx;
|
|
|
|
if( ! hb_parldef( 2, HB_TRUE ) )
|
|
iFlags |= HBREG_ICASE;
|
|
if( hb_parl( 3 ) )
|
|
iFlags |= HBREG_NEWLINE;
|
|
|
|
pRegEx = hb_regexCompile( hb_parc( 1 ), nLen, iFlags );
|
|
if( pRegEx )
|
|
{
|
|
pRegEx->fFree = HB_FALSE;
|
|
hb_retptrGC( pRegEx );
|
|
}
|
|
}
|
|
}
|
|
|
|
HB_FUNC( HB_ISREGEX )
|
|
{
|
|
hb_retl( hb_regexIs( hb_param( 1, HB_IT_ANY ) ) );
|
|
}
|
|
|
|
HB_FUNC( HB_ATX )
|
|
{
|
|
PHB_ITEM pString = hb_param( 2, HB_IT_STRING );
|
|
|
|
if( pString )
|
|
{
|
|
PHB_REGEX pRegEx = hb_regexGet( hb_param( 1, HB_IT_ANY ),
|
|
! hb_parldef( 3, HB_TRUE ) ? HBREG_ICASE : 0 );
|
|
|
|
if( pRegEx )
|
|
{
|
|
HB_SIZE nLen = hb_itemGetCLen( pString );
|
|
HB_SIZE nStart = hb_parns( 4 );
|
|
HB_SIZE nEnd = hb_parnsdef( 5, nLen );
|
|
|
|
if( nLen && nStart <= nLen && nStart <= nEnd )
|
|
{
|
|
const char * pszString = hb_itemGetCPtr( pString );
|
|
HB_REGMATCH aMatches[ HB_REGMATCH_SIZE( 1 ) ];
|
|
|
|
if( nEnd < nLen )
|
|
nLen = nEnd;
|
|
if( nStart )
|
|
{
|
|
--nStart;
|
|
nLen -= nStart;
|
|
}
|
|
|
|
if( hb_regexec( pRegEx, pszString + nStart, nLen, 1, aMatches ) > 0 )
|
|
{
|
|
nStart += HB_REGMATCH_SO( aMatches, 0 ) + 1;
|
|
nLen = HB_REGMATCH_EO( aMatches, 0 ) - HB_REGMATCH_SO( aMatches, 0 );
|
|
hb_retclen( pszString + nStart - 1, nLen );
|
|
}
|
|
else
|
|
nStart = nLen = 0;
|
|
}
|
|
else
|
|
nStart = nLen = 0;
|
|
|
|
hb_regexFree( pRegEx );
|
|
|
|
hb_storns( nStart, 4 );
|
|
hb_storns( nLen, 5 );
|
|
}
|
|
else
|
|
{
|
|
hb_storns( 0, 4 );
|
|
hb_storns( 0, 5 );
|
|
}
|
|
}
|
|
else
|
|
hb_errRT_BASE_SubstR( EG_ARG, 3013, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
|
|
}
|
|
|
|
static HB_BOOL hb_regex( int iRequest )
|
|
{
|
|
HB_REGMATCH aMatches[ HB_REGMATCH_SIZE( REGEX_MAX_GROUPS ) ];
|
|
PHB_ITEM pRetArray, pMatch, pString;
|
|
int i, iMatches, iMaxMatch;
|
|
HB_BOOL fResult = HB_FALSE;
|
|
PHB_REGEX pRegEx;
|
|
const char * pszString;
|
|
HB_SIZE nLen;
|
|
|
|
pString = hb_param( 2, HB_IT_STRING );
|
|
if( ! pString )
|
|
{
|
|
hb_errRT_BASE_SubstR( EG_ARG, 3014, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
|
|
return HB_FALSE;
|
|
}
|
|
pRegEx = hb_regexGet( hb_param( 1, HB_IT_ANY ),
|
|
( ! hb_parldef( 3, HB_TRUE ) ? HBREG_ICASE : 0 ) |
|
|
( hb_parl( 4 ) ? HBREG_NEWLINE : 0 ) );
|
|
if( ! pRegEx )
|
|
return HB_FALSE;
|
|
|
|
pszString = hb_itemGetCPtr( pString );
|
|
nLen = hb_itemGetCLen( pString );
|
|
iMaxMatch = iRequest == 0 || iRequest == 4 || iRequest == 5 ?
|
|
REGEX_MAX_GROUPS : 1;
|
|
iMatches = hb_regexec( pRegEx, pszString, nLen, iMaxMatch, aMatches );
|
|
if( iMatches > 0 )
|
|
{
|
|
switch( iRequest )
|
|
{
|
|
case 0:
|
|
pRetArray = hb_itemArrayNew( iMatches );
|
|
for( i = 0; i < iMatches; i++ )
|
|
{
|
|
if( HB_REGMATCH_EO( aMatches, i ) > -1 )
|
|
hb_arraySetCL( pRetArray, i + 1,
|
|
pszString + HB_REGMATCH_SO( aMatches, i ),
|
|
HB_REGMATCH_EO( aMatches, i ) -
|
|
HB_REGMATCH_SO( aMatches, i ) );
|
|
else
|
|
hb_arraySetCL( pRetArray, i + 1, NULL, 0 );
|
|
}
|
|
hb_itemReturnRelease( pRetArray );
|
|
fResult = HB_TRUE;
|
|
break;
|
|
|
|
case 1: /* LIKE */
|
|
fResult = HB_REGMATCH_SO( aMatches, 0 ) == 0 &&
|
|
( HB_SIZE ) HB_REGMATCH_EO( aMatches, 0 ) == nLen;
|
|
break;
|
|
|
|
case 2: /* MATCH ( HAS ) */
|
|
fResult = HB_TRUE;
|
|
break;
|
|
|
|
case 3: /* SPLIT */
|
|
iMaxMatch = hb_parni( 5 );
|
|
pRetArray = hb_itemArrayNew( 0 );
|
|
pMatch = hb_itemNew( NULL );
|
|
iMatches = 0;
|
|
do
|
|
{
|
|
hb_itemPutCL( pMatch, pszString, HB_REGMATCH_SO( aMatches, 0 ) );
|
|
hb_arrayAddForward( pRetArray, pMatch );
|
|
nLen -= HB_REGMATCH_EO( aMatches, 0 );
|
|
pszString += HB_REGMATCH_EO( aMatches, 0 );
|
|
iMatches++;
|
|
}
|
|
while( HB_REGMATCH_EO( aMatches, 0 ) > 0 && nLen &&
|
|
( iMaxMatch == 0 || iMatches < iMaxMatch ) &&
|
|
hb_regexec( pRegEx, pszString, nLen, 1, aMatches ) > 0 );
|
|
|
|
/* last match must be done also in case that pszString is empty;
|
|
this would mean an empty split field at the end of the string */
|
|
/* if( nLen ) */
|
|
{
|
|
hb_itemPutCL( pMatch, pszString, nLen );
|
|
hb_arrayAddForward( pRetArray, pMatch );
|
|
}
|
|
hb_itemRelease( pMatch );
|
|
|
|
hb_itemReturnRelease( pRetArray );
|
|
fResult = HB_TRUE;
|
|
break;
|
|
|
|
case 4: /* results AND positions */
|
|
pRetArray = hb_itemArrayNew( iMatches );
|
|
|
|
for( i = 0; i < iMatches; i++ )
|
|
{
|
|
int iSO = HB_REGMATCH_SO( aMatches, i ),
|
|
iEO = HB_REGMATCH_EO( aMatches, i );
|
|
pMatch = hb_arrayGetItemPtr( pRetArray, i + 1 );
|
|
hb_arrayNew( pMatch, 3 );
|
|
if( iEO != -1 )
|
|
{
|
|
/* matched string */
|
|
hb_arraySetCL( pMatch, 1, pszString + iSO, iEO - iSO );
|
|
/* begin of match */
|
|
hb_arraySetNS( pMatch, 2, iSO + 1 );
|
|
/* End of match */
|
|
hb_arraySetNS( pMatch, 3, iEO );
|
|
}
|
|
else
|
|
{
|
|
hb_arraySetCL( pMatch, 1, NULL, 0 );
|
|
hb_arraySetNS( pMatch, 2, 0 );
|
|
hb_arraySetNS( pMatch, 3, 0 );
|
|
}
|
|
}
|
|
hb_itemReturnRelease( pRetArray );
|
|
fResult = HB_TRUE;
|
|
break;
|
|
|
|
case 5: /* _ALL_ results AND positions */
|
|
{
|
|
PHB_ITEM pAtxArray;
|
|
int iMax = hb_parni( 5 ); /* max nuber of matches I want, 0 = unlimited */
|
|
int iGetMatch = hb_parni( 6 ); /* Gets if want only one single match or a sub-match */
|
|
HB_BOOL fOnlyMatch = hb_parldef( 7, HB_TRUE ); /* if HB_TRUE returns only matches and sub-matches, not positions */
|
|
HB_SIZE nOffset = 0;
|
|
int iCount = 0;
|
|
int iSO, iEO;
|
|
|
|
/* Set new array */
|
|
pRetArray = hb_itemArrayNew( 0 );
|
|
do
|
|
{
|
|
/* If I want all matches */
|
|
if( iGetMatch == 0 || /* Check boundaries */
|
|
( iGetMatch < 0 || iGetMatch > iMatches ) )
|
|
{
|
|
pAtxArray = hb_itemArrayNew( iMatches );
|
|
for( i = 0; i < iMatches; i++ )
|
|
{
|
|
iSO = HB_REGMATCH_SO( aMatches, i );
|
|
iEO = HB_REGMATCH_EO( aMatches, i );
|
|
pMatch = hb_arrayGetItemPtr( pAtxArray, i + 1 );
|
|
if( ! fOnlyMatch )
|
|
{
|
|
hb_arrayNew( pMatch, 3 );
|
|
if( iEO != -1 )
|
|
{
|
|
/* matched string */
|
|
hb_arraySetCL( pMatch, 1, pszString + iSO, iEO - iSO );
|
|
/* begin of match */
|
|
hb_arraySetNS( pMatch, 2, nOffset + iSO + 1 );
|
|
/* End of match */
|
|
hb_arraySetNS( pMatch, 3, nOffset + iEO );
|
|
}
|
|
else
|
|
{
|
|
hb_arraySetCL( pMatch, 1, NULL, 0 );
|
|
hb_arraySetNS( pMatch, 2, 0 );
|
|
hb_arraySetNS( pMatch, 3, 0 );
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if( iEO != -1 )
|
|
/* matched string */
|
|
hb_itemPutCL( pMatch, pszString + iSO, iEO - iSO );
|
|
else
|
|
hb_itemPutC( pMatch, NULL );
|
|
}
|
|
}
|
|
hb_arrayAddForward( pRetArray, pAtxArray );
|
|
hb_itemRelease( pAtxArray );
|
|
}
|
|
else /* Here I get only single matches */
|
|
{
|
|
i = iGetMatch - 1;
|
|
iSO = HB_REGMATCH_SO( aMatches, i );
|
|
iEO = HB_REGMATCH_EO( aMatches, i );
|
|
pMatch = hb_itemNew( NULL );
|
|
if( ! fOnlyMatch )
|
|
{
|
|
hb_arrayNew( pMatch, 3 );
|
|
if( iEO != -1 )
|
|
{
|
|
/* matched string */
|
|
hb_arraySetCL( pMatch, 1, pszString + iSO, iEO - iSO );
|
|
/* begin of match */
|
|
hb_arraySetNS( pMatch, 2, nOffset + iSO + 1 );
|
|
/* End of match */
|
|
hb_arraySetNS( pMatch, 3, nOffset + iEO );
|
|
}
|
|
else
|
|
{
|
|
hb_arraySetCL( pMatch, 1, NULL, 0 );
|
|
hb_arraySetNS( pMatch, 2, 0 );
|
|
hb_arraySetNS( pMatch, 3, 0 );
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if( iEO != -1 )
|
|
/* matched string */
|
|
hb_itemPutCL( pMatch, pszString + iSO, iEO - iSO );
|
|
else
|
|
hb_itemPutC( pMatch, NULL );
|
|
}
|
|
hb_arrayAddForward( pRetArray, pMatch );
|
|
hb_itemRelease( pMatch );
|
|
}
|
|
|
|
iEO = HB_REGMATCH_EO( aMatches, 0 );
|
|
if( iEO == -1 )
|
|
break;
|
|
nLen -= iEO;
|
|
pszString += iEO;
|
|
nOffset += iEO;
|
|
iCount++;
|
|
}
|
|
while( iEO && nLen && ( iMax == 0 || iCount < iMax ) &&
|
|
( iMatches = hb_regexec( pRegEx, pszString, nLen, iMaxMatch, aMatches ) ) > 0 );
|
|
hb_itemReturnRelease( pRetArray );
|
|
fResult = HB_TRUE;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
else if( iRequest == 3 )
|
|
{
|
|
pRetArray = hb_itemArrayNew( 1 );
|
|
hb_arraySet( pRetArray, 1, pString );
|
|
hb_itemReturnRelease( pRetArray );
|
|
fResult = HB_TRUE;
|
|
}
|
|
|
|
hb_regexFree( pRegEx );
|
|
return fResult;
|
|
}
|
|
|
|
/* Returns array of Match + Sub-Matches. */
|
|
HB_FUNC( HB_REGEX )
|
|
{
|
|
if( ! hb_regex( 0 ) )
|
|
hb_reta( 0 );
|
|
}
|
|
|
|
/* Returns just .T. if match found or .F. otherwise. */
|
|
/* NOTE: Deprecated compatibility function.
|
|
Please use hb_regexLike() and hb_regexHas() instead. */
|
|
|
|
#if defined( HB_LEGACY_LEVEL4 )
|
|
|
|
HB_FUNC( HB_REGEXMATCH )
|
|
{
|
|
hb_retl( hb_regex( hb_parl( 5 ) ? 1 /* LIKE */ : 2 /* HAS */ ) );
|
|
}
|
|
|
|
#endif
|
|
|
|
HB_FUNC( HB_REGEXLIKE )
|
|
{
|
|
hb_retl( hb_regex( 1 ) );
|
|
}
|
|
|
|
HB_FUNC( HB_REGEXHAS )
|
|
{
|
|
hb_retl( hb_regex( 2 ) );
|
|
}
|
|
|
|
/* Splits the string in an array of matched expressions */
|
|
HB_FUNC( HB_REGEXSPLIT )
|
|
{
|
|
if( ! hb_regex( 3 ) )
|
|
hb_reta( 0 );
|
|
}
|
|
|
|
/* Returns array of { Match, start, end }, { Sub-Matches, start, end } */
|
|
HB_FUNC( HB_REGEXATX )
|
|
{
|
|
if( ! hb_regex( 4 ) )
|
|
hb_reta( 0 );
|
|
}
|
|
|
|
/* 2005-12-16 - Francesco Saverio Giudice
|
|
hb_regexAll( cRegex, cString, lCaseSensitive, lNewLine, nMaxMatches, nGetMatch, lOnlyMatch ) -> aAllRegexMatches
|
|
|
|
This function return all matches from a Regex search.
|
|
It is a mix from hb_regex() and hb_regexAtX()
|
|
|
|
PARAMETERS:
|
|
cRegex - Regex pattern string or precompiled Regex
|
|
cString - The string you want to search
|
|
lCaseSensitive - default = FALSE
|
|
lNewLine - default = FALSE
|
|
nMaxMatches - default = unlimited, this limit number of matches that have to return
|
|
nGetMatch - default = unlimited, this returns only one from Match + Sub-Matches
|
|
lOnlyMatch - default = TRUE, if TRUE returns Matches, otherwise it returns also start and end positions
|
|
*/
|
|
|
|
HB_FUNC( HB_REGEXALL )
|
|
{
|
|
if( ! hb_regex( 5 ) )
|
|
hb_reta( 0 );
|
|
}
|
|
|
|
#if defined( HB_HAS_PCRE )
|
|
static void * hb_pcre_grab( size_t size )
|
|
{
|
|
return hb_xgrab( size );
|
|
}
|
|
static void hb_pcre_free( void * ptr )
|
|
{
|
|
hb_xfree( ptr );
|
|
}
|
|
#endif
|
|
|
|
HB_CALL_ON_STARTUP_BEGIN( _hb_regex_init_ )
|
|
#if defined( HB_HAS_PCRE )
|
|
/* detect UTF-8 support.
|
|
* In BCC builds this code also forces linking newer PCRE versions
|
|
* then the one included in BCC RTL.
|
|
*/
|
|
if( pcre_config( PCRE_CONFIG_UTF8, &s_iUTF8Enabled ) != 0 )
|
|
s_iUTF8Enabled = 0;
|
|
|
|
pcre_malloc = hb_pcre_grab;
|
|
pcre_free = hb_pcre_free;
|
|
pcre_stack_malloc = hb_pcre_grab;
|
|
pcre_stack_free = hb_pcre_free;
|
|
#endif
|
|
hb_regexInit( hb_regfree, hb_regcomp, hb_regexec );
|
|
HB_CALL_ON_STARTUP_END( _hb_regex_init_ )
|
|
|
|
#if defined( HB_PRAGMA_STARTUP )
|
|
#pragma startup _hb_regex_init_
|
|
#elif defined( HB_DATASEG_STARTUP )
|
|
#define HB_DATASEG_BODY HB_DATASEG_FUNC( _hb_regex_init_ )
|
|
#include "hbiniseg.h"
|
|
#endif
|