gambas-source-code/main/share/gb_common_string_temp.h
Benoît Minisini 7b01d12f31 [INTERPRETER]
* OPT: Optimizations in string comparison operators.
* OPT: Optimizations in string allocations.
* OPT: Optimizations in Left$(), Mid$(), Right$() and Len().
* OPT: Optimizations of calls to native methods when the number of 
  arguments is fixed, and when no argument conversion is needed.
* OPT: Optimizations of INPUT and LINE INPUT, by using an internal buffer
  instead of reading the stream one byte at a time.
* BUG: Fixed the new error management.
* BUG: Fixed a possible spurious error when reading a file from an archive.

[GB.EVAL]
* BUG: Use the same new error management than the interpreter.

[GB.QT]
* BUG: The DrawingArea control now should draw its border correctly without
  erasing its contents.


git-svn-id: svn://localhost/gambas/trunk@1041 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2008-01-27 14:00:04 +00:00

139 lines
3.3 KiB
C

/***************************************************************************
gb_common_string_temp.h
common useful routines template
Datatype management routines. Conversions between each Gambas datatype,
and conversions between Gambas datatypes and native datatypes.
(c) 2000-2007 Benoit Minisini <gambas@users.sourceforge.net>
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 1, 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; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
***************************************************************************/
#include "gb_common_case.h"
#if 0
bool STRING_equal(const char *str1, int len1, const char *str2, int len2)
{
static const void *jump[4] = { &&__LEN_0, &&__LEN_1, &&__LEN_2, &&__LEN_3 };
if (len1 != len2)
return FALSE;
while (len1 >= 4)
{
len1 -= 4;
if (*((int *)&str1[len1]) != *((int *)&str2[len1]))
return FALSE;
}
goto *jump[len1];
__LEN_3:
if (str1[2] != str2[2])
return FALSE;
__LEN_2:
if (str1[1] != str2[1])
return FALSE;
__LEN_1:
if (str1[0] != str2[0])
return FALSE;
__LEN_0:
return TRUE;
}
#endif
bool STRING_equal_same(const char *str1, const char *str2, int len)
{
static const void *jump[8] = { &&__LEN_0, &&__LEN_1, &&__LEN_2, &&__LEN_3, &&__LEN_4, &&__LEN_5, &&__LEN_6, &&__LEN_7 };
if (len < 8)
goto *jump[len];
while (len)
{
len--;
if (str1[len] != str2[len])
return FALSE;
}
return TRUE;
__LEN_7: if (str1[6] != str2[6]) return FALSE;
__LEN_6: if (str1[5] != str2[5]) return FALSE;
__LEN_5: if (str1[4] != str2[4]) return FALSE;
__LEN_4: if (str1[3] != str2[3]) return FALSE;
__LEN_3: if (str1[2] != str2[2]) return FALSE;
__LEN_2: if (str1[1] != str2[1]) return FALSE;
__LEN_1: if (str1[0] != str2[0]) return FALSE;
__LEN_0: return TRUE;
}
bool STRING_equal_ignore_case(const char *str1, int len1, const char *str2, int len2)
{
if (len1 != len2)
return FALSE;
while (len1)
{
len1--;
if (toupper(str1[len1]) != toupper(str2[len1]))
return FALSE;
}
return TRUE;
}
int STRING_compare(const char *str1, int len1, const char *str2, int len2)
{
uint i;
int len = len1 < len2 ? len1 : len2;
int diff;
register unsigned char c1, c2;
for (i = 0; i < len; i++)
{
c1 = str1[i];
c2 = str2[i];
if (c1 > c2) return 1;
if (c1 < c2) return -1;
}
diff = len1 - len2;
return (diff < 0) ? (-1) : (diff > 0) ? 1 : 0;
}
int STRING_compare_ignore_case(const char *str1, int len1, const char *str2, int len2)
{
uint i;
int len = len1 < len2 ? len1 : len2;
int diff;
register unsigned char c1, c2;
for (i = 0; i < len; i++)
{
c1 = tolower(str1[i]);
c2 = tolower(str2[i]);
if (c1 > c2) return 1;
if (c1 < c2) return -1;
}
diff = len1 - len2;
return (diff < 0) ? (-1) : (diff > 0) ? 1 : 0;
}