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.
387 lines
11 KiB
C
387 lines
11 KiB
C
/*
|
|
* TabExpand(), TabPack() CT3 string functions
|
|
*
|
|
* Copyright 2002 IntTec GmbH, Neunlindenstr 32, 79106 Freiburg, Germany
|
|
* Author: Martin Vogel <vogel@inttec.de>
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#include "ct.h"
|
|
|
|
HB_FUNC( TABEXPAND )
|
|
{
|
|
if( HB_ISCHAR( 1 ) )
|
|
{
|
|
const char * pcString = hb_parc( 1 );
|
|
HB_SIZE sStrLen = hb_parclen( 1 );
|
|
char * pcRet;
|
|
HB_SIZE sRetLen;
|
|
HB_SIZE sTabWidth = 0;
|
|
char cFill, cTab, cCR;
|
|
const char * pcNewLine;
|
|
HB_SIZE sNewLineLen;
|
|
int iIgnore141;
|
|
HB_SIZE sIndex, sLineIndex;
|
|
HB_SIZE sTabCnt = 0;
|
|
|
|
if( HB_ISNUM( 2 ) )
|
|
sTabWidth = hb_parns( 2 );
|
|
if( ( HB_ISIZ ) sTabWidth <= 0 )
|
|
sTabWidth = 8;
|
|
|
|
if( HB_ISNUM( 3 ) )
|
|
cFill = ( char ) ( hb_parnl( 3 ) % 256 );
|
|
else if( hb_parclen( 3 ) > 0 )
|
|
cFill = hb_parc( 3 )[ 0 ];
|
|
else
|
|
cFill = 0x20;
|
|
|
|
if( HB_ISCHAR( 4 ) && hb_parclen( 4 ) > 0 )
|
|
{
|
|
pcNewLine = hb_parc( 4 );
|
|
sNewLineLen = hb_parclen( 4 );
|
|
}
|
|
else
|
|
{
|
|
pcNewLine = hb_conNewLine();
|
|
sNewLineLen = 0;
|
|
while( *( pcNewLine + sNewLineLen ) != 0x00 )
|
|
sNewLineLen++;
|
|
}
|
|
if( sNewLineLen > 0 )
|
|
cCR = *( pcNewLine );
|
|
else
|
|
cCR = 13;
|
|
|
|
if( HB_ISNUM( 5 ) )
|
|
cTab = ( char ) ( hb_parnl( 5 ) % 256 );
|
|
else if( hb_parclen( 5 ) > 0 )
|
|
cTab = hb_parc( 5 )[ 0 ];
|
|
else
|
|
cTab = 0x09;
|
|
|
|
iIgnore141 = hb_parldef( 6, 0 );
|
|
|
|
/* estimate maximum return length by assuming that EVERY tab char
|
|
can be replaced by at most <nTabWidth> characters */
|
|
for( sIndex = 0; sIndex < sStrLen; sIndex++ )
|
|
{
|
|
if( *( pcString + sIndex ) == cTab )
|
|
sTabCnt++;
|
|
}
|
|
if( sTabCnt == 0 )
|
|
{
|
|
hb_retclen( pcString, sStrLen );
|
|
return;
|
|
}
|
|
pcRet = ( char * ) hb_xgrab( sStrLen + ( sTabCnt * ( sTabWidth - 1 ) ) );
|
|
|
|
/* now copy the string */
|
|
sIndex = 0;
|
|
sRetLen = 0;
|
|
sLineIndex = 0;
|
|
while( sTabCnt > 0 )
|
|
{
|
|
char cChar = ( char ) *( pcString + sIndex );
|
|
|
|
if( cChar == cTab )
|
|
{
|
|
/* tab character */
|
|
HB_SIZE sFillIndex;
|
|
|
|
for( sFillIndex = sTabWidth - ( sLineIndex % sTabWidth ); sFillIndex > 0; sFillIndex-- )
|
|
{
|
|
*( pcRet + sRetLen ) = cFill;
|
|
sRetLen++;
|
|
sLineIndex++;
|
|
}
|
|
sTabCnt--;
|
|
sIndex++;
|
|
}
|
|
else if( cChar == HB_CHAR_SOFT1 )
|
|
{
|
|
/* soft carriage return */
|
|
*( pcRet + sRetLen ) = HB_CHAR_SOFT1;
|
|
sRetLen++;
|
|
sIndex++;
|
|
if( iIgnore141 )
|
|
sLineIndex++;
|
|
else
|
|
sLineIndex = 0;
|
|
}
|
|
else if( cChar == cCR )
|
|
{
|
|
/* newline string ? */
|
|
if( sNewLineLen > 0 &&
|
|
sIndex + sNewLineLen <= sStrLen &&
|
|
ct_at_exact_forward( pcString + sIndex, sNewLineLen, pcNewLine,
|
|
sNewLineLen, NULL ) == pcString + sIndex )
|
|
{
|
|
hb_xmemcpy( pcRet + sRetLen, pcString + sIndex, sNewLineLen );
|
|
sRetLen += sNewLineLen;
|
|
sIndex += sNewLineLen;
|
|
sLineIndex = 0;
|
|
}
|
|
else
|
|
{
|
|
*( pcRet + sRetLen ) = cCR;
|
|
sRetLen++;
|
|
sIndex++;
|
|
sLineIndex++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
*( pcRet + sRetLen ) = *( pcString + sIndex );
|
|
sRetLen++;
|
|
sIndex++;
|
|
sLineIndex++;
|
|
}
|
|
}
|
|
/* copy rest */
|
|
hb_xmemcpy( pcRet + sRetLen, pcString + sIndex, sStrLen - sIndex );
|
|
sRetLen += sStrLen - sIndex;
|
|
hb_retclen( pcRet, sRetLen );
|
|
hb_xfree( pcRet );
|
|
}
|
|
else
|
|
{
|
|
PHB_ITEM pSubst = NULL;
|
|
int iArgErrorMode = ct_getargerrormode();
|
|
|
|
if( iArgErrorMode != CT_ARGERR_IGNORE )
|
|
pSubst = ct_error_subst( ( HB_USHORT ) iArgErrorMode, EG_ARG,
|
|
CT_ERROR_TABEXPAND, NULL, HB_ERR_FUNCNAME, 0,
|
|
EF_CANSUBSTITUTE, HB_ERR_ARGS_BASEPARAMS );
|
|
|
|
if( pSubst != NULL )
|
|
hb_itemReturnRelease( pSubst );
|
|
else
|
|
hb_retc_null();
|
|
}
|
|
}
|
|
|
|
HB_FUNC( TABPACK )
|
|
{
|
|
if( HB_ISCHAR( 1 ) )
|
|
{
|
|
const char * pcString = hb_parc( 1 );
|
|
HB_SIZE sStrLen = hb_parclen( 1 );
|
|
char * pcRet;
|
|
HB_SIZE sRetLen;
|
|
HB_SIZE sTabWidth = 0;
|
|
char cFill, cTab, cCR;
|
|
const char * pcNewLine;
|
|
HB_SIZE sNewLineLen;
|
|
int iIgnore141;
|
|
HB_SIZE sIndex, sTabIndex, sFillCount;
|
|
|
|
if( HB_ISNUM( 2 ) )
|
|
sTabWidth = hb_parns( 2 );
|
|
if( ( HB_ISIZ ) sTabWidth <= 0 )
|
|
sTabWidth = 8;
|
|
|
|
if( HB_ISNUM( 3 ) )
|
|
cFill = ( char ) ( hb_parnl( 3 ) % 256 );
|
|
else if( hb_parclen( 3 ) > 0 )
|
|
cFill = hb_parc( 3 )[ 0 ];
|
|
else
|
|
cFill = 0x20;
|
|
|
|
sNewLineLen = hb_parclen( 4 );
|
|
if( sNewLineLen > 0 )
|
|
pcNewLine = hb_parc( 4 );
|
|
else
|
|
{
|
|
pcNewLine = hb_conNewLine();
|
|
sNewLineLen = strlen( pcNewLine );
|
|
}
|
|
if( sNewLineLen > 0 )
|
|
cCR = *( pcNewLine );
|
|
else
|
|
cCR = 13;
|
|
|
|
if( HB_ISNUM( 5 ) )
|
|
cTab = ( char ) ( hb_parnl( 5 ) % 256 );
|
|
else if( hb_parclen( 5 ) > 0 )
|
|
cTab = hb_parc( 5 )[ 0 ];
|
|
else
|
|
cTab = 0x09;
|
|
|
|
iIgnore141 = hb_parldef( 6, 0 );
|
|
|
|
if( sStrLen == 0 )
|
|
{
|
|
hb_retc_null();
|
|
return;
|
|
}
|
|
/* estimate maximum return length by assuming that there's
|
|
nothing to pack */
|
|
pcRet = ( char * ) hb_xgrab( sStrLen );
|
|
|
|
/* now copy the string */
|
|
sIndex = 0;
|
|
sRetLen = 0;
|
|
sTabIndex = 0;
|
|
sFillCount = 0;
|
|
|
|
while( sIndex < sStrLen )
|
|
{
|
|
char cChar = ( char ) *( pcString + sIndex );
|
|
|
|
if( cChar == cFill )
|
|
{
|
|
if( sTabIndex == sTabWidth - 1 )
|
|
{
|
|
/* we have just found the last character of a tabstop */
|
|
*( pcRet + sRetLen ) = cTab;
|
|
sRetLen++;
|
|
sFillCount = 0;
|
|
sTabIndex = 0;
|
|
sIndex++;
|
|
}
|
|
else
|
|
{
|
|
sFillCount++;
|
|
sTabIndex++;
|
|
sIndex++;
|
|
}
|
|
}
|
|
else if( cChar == cTab )
|
|
{
|
|
*( pcRet + sRetLen ) = cTab;
|
|
sRetLen++;
|
|
/* discard any fill characters before the tabstop */
|
|
sFillCount = 0;
|
|
sTabIndex = 0;
|
|
sIndex++;
|
|
}
|
|
else if( cChar == HB_CHAR_SOFT1 && ! iIgnore141 )
|
|
{
|
|
/* soft carriage return */
|
|
|
|
/* eventually not enough fill chars to fill a tab,
|
|
so copy them verbatim */
|
|
for( ; sFillCount > 0; sFillCount-- )
|
|
{
|
|
*( pcRet + sRetLen ) = cFill;
|
|
sRetLen++;
|
|
}
|
|
*( pcRet + sRetLen ) = HB_CHAR_SOFT1;
|
|
sRetLen++;
|
|
sTabIndex = 0;
|
|
sIndex++;
|
|
}
|
|
else if( cChar == cCR )
|
|
{
|
|
/* newline string ? */
|
|
if( sNewLineLen > 0 &&
|
|
sIndex + sNewLineLen <= sStrLen &&
|
|
ct_at_exact_forward( pcString + sIndex, sNewLineLen, pcNewLine,
|
|
sNewLineLen, NULL ) == pcString + sIndex )
|
|
{
|
|
/* eventually not enough fill chars to fill a tab,
|
|
so copy them verbatim */
|
|
for( ; sFillCount > 0; sFillCount-- )
|
|
{
|
|
*( pcRet + sRetLen ) = cFill;
|
|
sRetLen++;
|
|
}
|
|
hb_xmemcpy( pcRet + sRetLen, pcString + sIndex, sNewLineLen );
|
|
sRetLen += sNewLineLen;
|
|
sIndex += sNewLineLen;
|
|
sTabIndex = 0;
|
|
}
|
|
else
|
|
{
|
|
*( pcRet + sRetLen ) = cCR;
|
|
sRetLen++;
|
|
sIndex++;
|
|
sTabIndex = 0;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* eventually not enough fill chars to fill a tab,
|
|
so copy them verbatim */
|
|
for( ; sFillCount > 0; sFillCount-- )
|
|
{
|
|
*( pcRet + sRetLen ) = cFill;
|
|
sRetLen++;
|
|
sTabIndex++;
|
|
if( sTabIndex == sTabWidth - 1 )
|
|
sTabIndex = 0;
|
|
}
|
|
*( pcRet + sRetLen ) = *( pcString + sIndex );
|
|
sRetLen++;
|
|
sIndex++;
|
|
sTabIndex++;
|
|
if( sTabIndex == sTabWidth - 1 )
|
|
sTabIndex = 0;
|
|
}
|
|
}
|
|
/* copy rest */
|
|
for( ; sFillCount > 0; sFillCount-- )
|
|
{
|
|
*( pcRet + sRetLen ) = cFill;
|
|
sRetLen++;
|
|
}
|
|
hb_retclen( pcRet, sRetLen );
|
|
hb_xfree( pcRet );
|
|
}
|
|
else
|
|
{
|
|
PHB_ITEM pSubst = NULL;
|
|
int iArgErrorMode = ct_getargerrormode();
|
|
|
|
if( iArgErrorMode != CT_ARGERR_IGNORE )
|
|
pSubst = ct_error_subst( ( HB_USHORT ) iArgErrorMode, EG_ARG,
|
|
CT_ERROR_TABPACK, NULL, HB_ERR_FUNCNAME, 0,
|
|
EF_CANSUBSTITUTE, HB_ERR_ARGS_BASEPARAMS );
|
|
|
|
if( pSubst != NULL )
|
|
hb_itemReturnRelease( pSubst );
|
|
else
|
|
hb_retc_null();
|
|
}
|
|
}
|