pegasus/src/Pegasus/Common/String.cpp - diff

Return to String.cpp CVS log

Up to [Pegasus] / pegasus / src / Pegasus / Common

Diff for /pegasus/src/Pegasus/Common/String.cpp between version 1.11 and 1.111.6.2

version 1.11, 2001/04/14 07:35:05

version 1.111.6.2, 2005/10/08 01:59:52

Line 1

//BEGIN_LICENSE

//%2005////////////////////////////////////////////////////////////////////////

// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems.

// IBM Corp.; EMC Corporation, The Open Group.

// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group.

// EMC Corporation; VERITAS Software Corporation; The Open Group.

// Permission is hereby granted, free of charge, to any person obtaining a

// Permission is hereby granted, free of charge, to any person obtaining a copy

// copy of this software and associated documentation files (the "Software"),

// of this software and associated documentation files (the "Software"), to

// to deal in the Software without restriction, including without limitation

// deal in the Software without restriction, including without limitation the

// the rights to use, copy, modify, merge, publish, distribute, sublicense,

// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or

// and/or sell copies of the Software, and to permit persons to whom the

// sell copies of the Software, and to permit persons to whom the Software is

// Software is furnished to do so, subject to the following conditions:

// furnished to do so, subject to the following conditions:

// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN

// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED

// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL

// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT

// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR

// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING

// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT

// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER

// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN

// DEALINGS IN THE SOFTWARE.

// 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.

//END_LICENSE

//==============================================================================

//BEGIN_HISTORY

// Author:

// Author: Mike Brasher (mbrasher@bmc.com)

// $Log$

// Modified By:

// Revision 1.11 2001/04/14 07:35:05 mike

// Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com)

// Added config file loading to OptionManager

// Josephine Eskaline Joyce, IBM (jojustin@in.ibm.com) for Bug#3297

// David Dillard, VERITAS Software Corp. (david.dillard@veritas.com)

// Mike Brasher (mike-brasher@austin.rr.com)

// Revision 1.10 2001/04/11 19:53:22 mike

//%/////////////////////////////////////////////////////////////////////////////

// More porting

#include <cassert>

// Revision 1.9 2001/04/11 07:03:02 mike

#include "InternalException.h"

// Port to Unix

#include "CommonUTF.h"

#include "MessageLoader.h"

// Revision 1.7 2001/04/10 22:42:55 karl

#include "StringRep.h"

// Correct error in String find

#ifdef PEGASUS_HAS_ICU

// Revision 1.6 2001/04/09 20:18:47 karl

#include <unicode/ustring.h>

// add find substring function

#include <unicode/uchar.h>

#endif

PEGASUS_NAMESPACE_BEGIN

//==============================================================================

// Revision 1.5 2001/03/09 19:49:32 karl

// Compile-time macros (undefined by default).

// long lines

// Revision 1.4 2001/02/26 04:33:28 mike

// PEGASUS_STRING_NO_THROW -- suppresses throwing of exceptions

// Fixed many places where cim names compared with operator==(String,String).

// Changed all of these to use CIMName::equal()

// Revision 1.3 2001/02/11 17:19:30 mike

// PEGASUS_STRING_NO_UTF8 -- don't generate slower UTF8 code.

// added reverseFind() method

// Revision 1.2 2001/02/11 05:42:33 mike

// PEGASUS_USE_INTERNAL_INLINES -- enables internal inlining feature.

// new

// Revision 1.1.1.1 2001/01/14 19:53:14 mike

//==============================================================================

// Pegasus import

//==============================================================================

// File-scope definitions:

//END_HISTORY

//==============================================================================

const Uint8 _to_upper_tbl[256] =

{

0x00,0x01,0x02,0x03,0x04,0x05,0x06,0x07,

0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,0x0F,

0x10,0x11,0x12,0x13,0x14,0x15,0x16,0x17,

0x18,0x19,0x1A,0x1B,0x1C,0x1D,0x1E,0x1F,

0x20,0x21,0x22,0x23,0x24,0x25,0x26,0x27,

0x28,0x29,0x2A,0x2B,0x2C,0x2D,0x2E,0x2F,

0x30,0x31,0x32,0x33,0x34,0x35,0x36,0x37,

0x38,0x39,0x3A,0x3B,0x3C,0x3D,0x3E,0x3F,

0x40,0x41,0x42,0x43,0x44,0x45,0x46,0x47,

0x48,0x49,0x4A,0x4B,0x4C,0x4D,0x4E,0x4F,

0x50,0x51,0x52,0x53,0x54,0x55,0x56,0x57,

0x58,0x59,0x5A,0x5B,0x5C,0x5D,0x5E,0x5F,

0x60,0x41,0x42,0x43,0x44,0x45,0x46,0x47,

0x48,0x49,0x4A,0x4B,0x4C,0x4D,0x4E,0x4F,

0x50,0x51,0x52,0x53,0x54,0x55,0x56,0x57,

0x58,0x59,0x5A,0x7B,0x7C,0x7D,0x7E,0x7F,

0x80,0x81,0x82,0x83,0x84,0x85,0x86,0x87,

0x88,0x89,0x8A,0x8B,0x8C,0x8D,0x8E,0x8F,

0x90,0x91,0x92,0x93,0x94,0x95,0x96,0x97,

0x98,0x99,0x9A,0x9B,0x9C,0x9D,0x9E,0x9F,

0xA0,0xA1,0xA2,0xA3,0xA4,0xA5,0xA6,0xA7,

0xA8,0xA9,0xAA,0xAB,0xAC,0xAD,0xAE,0xAF,

0xB0,0xB1,0xB2,0xB3,0xB4,0xB5,0xB6,0xB7,

0xB8,0xB9,0xBA,0xBB,0xBC,0xBD,0xBE,0xBF,

0xC0,0xC1,0xC2,0xC3,0xC4,0xC5,0xC6,0xC7,

0xC8,0xC9,0xCA,0xCB,0xCC,0xCD,0xCE,0xCF,

0xD0,0xD1,0xD2,0xD3,0xD4,0xD5,0xD6,0xD7,

0xD8,0xD9,0xDA,0xDB,0xDC,0xDD,0xDE,0xDF,

0xE0,0xE1,0xE2,0xE3,0xE4,0xE5,0xE6,0xE7,

0xE8,0xE9,0xEA,0xEB,0xEC,0xED,0xEE,0xEF,

0xF0,0xF1,0xF2,0xF3,0xF4,0xF5,0xF6,0xF7,

0xF8,0xF9,0xFA,0xFB,0xFC,0xFD,0xFE,0xFF,

};

const Uint8 _to_lower_tbl[256] =

{

0x00,0x01,0x02,0x03,0x04,0x05,0x06,0x07,

0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,0x0F,

0x10,0x11,0x12,0x13,0x14,0x15,0x16,0x17,

0x18,0x19,0x1A,0x1B,0x1C,0x1D,0x1E,0x1F,

0x20,0x21,0x22,0x23,0x24,0x25,0x26,0x27,

0x28,0x29,0x2A,0x2B,0x2C,0x2D,0x2E,0x2F,

0x30,0x31,0x32,0x33,0x34,0x35,0x36,0x37,

0x38,0x39,0x3A,0x3B,0x3C,0x3D,0x3E,0x3F,

0x40,0x61,0x62,0x63,0x64,0x65,0x66,0x67,

0x68,0x69,0x6A,0x6B,0x6C,0x6D,0x6E,0x6F,

0x70,0x71,0x72,0x73,0x74,0x75,0x76,0x77,

0x78,0x79,0x7A,0x5B,0x5C,0x5D,0x5E,0x5F,

0x60,0x61,0x62,0x63,0x64,0x65,0x66,0x67,

0x68,0x69,0x6A,0x6B,0x6C,0x6D,0x6E,0x6F,

0x70,0x71,0x72,0x73,0x74,0x75,0x76,0x77,

0x78,0x79,0x7A,0x7B,0x7C,0x7D,0x7E,0x7F,

0x80,0x81,0x82,0x83,0x84,0x85,0x86,0x87,

0x88,0x89,0x8A,0x8B,0x8C,0x8D,0x8E,0x8F,

0x90,0x91,0x92,0x93,0x94,0x95,0x96,0x97,

0x98,0x99,0x9A,0x9B,0x9C,0x9D,0x9E,0x9F,

0xA0,0xA1,0xA2,0xA3,0xA4,0xA5,0xA6,0xA7,

0xA8,0xA9,0xAA,0xAB,0xAC,0xAD,0xAE,0xAF,

0xB0,0xB1,0xB2,0xB3,0xB4,0xB5,0xB6,0xB7,

0xB8,0xB9,0xBA,0xBB,0xBC,0xBD,0xBE,0xBF,

0xC0,0xC1,0xC2,0xC3,0xC4,0xC5,0xC6,0xC7,

0xC8,0xC9,0xCA,0xCB,0xCC,0xCD,0xCE,0xCF,

0xD0,0xD1,0xD2,0xD3,0xD4,0xD5,0xD6,0xD7,

0xD8,0xD9,0xDA,0xDB,0xDC,0xDD,0xDE,0xDF,

0xE0,0xE1,0xE2,0xE3,0xE4,0xE5,0xE6,0xE7,

0xE8,0xE9,0xEA,0xEB,0xEC,0xED,0xEE,0xEF,

0xF0,0xF1,0xF2,0xF3,0xF4,0xF5,0xF6,0xF7,

0xF8,0xF9,0xFA,0xFB,0xFC,0xFD,0xFE,0xFF,

};

// Converts 16-bit characters to upper case.

inline Uint16 _to_upper(Uint16 x)

{

return (x & 0xFF00) ? x : _to_upper_tbl[x];

}

// Converts 16-bit characters to lower case.

inline Uint16 _to_lower(Uint16 x)

{

return (x & 0xFF00) ? x : _to_lower_tbl[x];

}

// Rounds x to the next power of two (or just returns 8 if x < 8).

static Uint32 _next_pow_2(Uint32 x)

{

if (x < 8)

return 8;

x--;

x |= (x >> 1);

x |= (x >> 2);

x |= (x >> 4);

x |= (x >> 8);

x |= (x >> 16);

x++;

return x;

}

template<class P, class Q>

static void _copy(P* p, const Q* q, size_t n)

{

// Use loop unrolling.

while (n >= 8)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

p[3] = q[3];

p[4] = q[4];

p[5] = q[5];

p[6] = q[6];

p[7] = q[7];

p += 8;

q += 8;

n -= 8;

}

while (n >= 4)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

p[3] = q[3];

p += 4;

q += 4;

n -= 4;

}

#include <cctype>

while (n--)

#include "String.h"

*p++ = *q++;

#include "Exception.h"

}

#include "String.h"

// For debugging

static Uint16* _find(const Uint16* s, size_t n, Uint16 c)

#include <iostream>

{

using namespace std;

while (n >= 4)

{

if (s[0] == c)

return (Uint16*)s;

if (s[1] == c)

return (Uint16*)&s[1];

if (s[2] == c)

return (Uint16*)&s[2];

if (s[3] == c)

return (Uint16*)&s[3];

n -= 4;

s += 4;

}

PEGASUS_NAMESPACE_BEGIN

if (n)

{

if (*s == c)

return (Uint16*)s;

s++;

n--;

}

const String String::EMPTY;

if (n)

{

if (*s == c)

return (Uint16*)s;

s++;

n--;

}

if (n && *s == c)

return (Uint16*)s;

// Not found!

return 0;

}

inline Uint32 StrLen(const char* str)

static int _compare(const Uint16* s1, const Uint16* s2)

{

if (!str)

while (*s1 && *s2)

throw NullPointer();

{

int r = *s1++ - *s2++;

return strlen(str);

if (r)

return r;

}

inline Uint32 StrLen(const Char16* str)

if (*s2)

return -1;

else if (*s1)

return 1;

return 0;

}

static int _compare_no_utf8(const Uint16* s1, const char* s2)

{

if (!str)

Uint16 c1;

throw NullPointer();

Uint16 c2;

Uint32 n = 0;

{

c1 = *s1++;

c2 = *s2++;

while (*str++)

if (c1 == 0)

n++;

return c1 - c2;

}

while (c1 == c2);

return n;

return c1 - c2;

}

String::String()

static int _compare(const Uint16* s1, const Uint16* s2, size_t n)

{

_rep.append('\0');

// This should only be called when s1 and s2 have the same length.

while (n-- && (*s1++ - *s2++) == 0)

;

return s1[-1] - s2[-1];

}

String::String(const String& x) : _rep(x._rep)

static inline void _copy(Uint16* s1, const Uint16* s2, size_t n)

{

memcpy(s1, s2, n * sizeof(Uint16));

}

void String_throw_out_of_bounds()

{

throw IndexOutOfBoundsException();

}

String::String(const String& x, Uint32 n)

#ifdef PEGASUS_STRING_NO_THROW

# define _check_null_pointer(ARG) /* empty */

#else

template<class T>

inline void _check_null_pointer(const T* ptr)

{

_rep.append('\0');

if (!ptr)

append(x.getData(), n);

throw NullPointer();

}

#endif

String::String(const Char16* x) : _rep(x, StrLen(x) + 1)

static size_t _copy_from_utf8(Uint16* dest, const char* src, size_t n)

{

Uint16* p = dest;

const Uint8* q = (const Uint8*)src;

// Process leading 7-bit ASCII characters (to avoid UTF8 overhead later).

// Use loop-unrolling.

while (n >=8 && ((q[0]|q[1]|q[2]|q[3]|q[4]|q[5]|q[6]|q[7]) & 0x80) == 0)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

p[3] = q[3];

p[4] = q[4];

p[5] = q[5];

p[6] = q[6];

p[7] = q[7];

p += 8;

q += 8;

n -= 8;

}

String::String(const Char16* x, Uint32 n)

while (n >=4 && ((q[0]|q[1]|q[2]|q[3]) & 0x80) == 0)

{

assign(x, n);

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

p[3] = q[3];

p += 4;

q += 4;

n -= 4;

}

String::String(const char* str)

switch (n)

{

case 0:

return p - dest;

case 1:

if (q[0] < 128)

{

p[0] = q[0];

return p + 1 - dest;

}

break;

case 2:

if (((q[0]|q[1]) & 0x80) == 0)

{

Uint32 n = ::strlen(str) + 1;

p[0] = q[0];

reserve(n);

p[1] = q[1];

return p + 2 - dest;

}

break;

case 3:

if (((q[0]|q[1]|q[2]) & 0x80) == 0)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

return p + 3 - dest;

}

break;

}

while (n--)

// Process remaining characters.

_rep.append(*str++);

while (n)

{

// Optimize for 7-bit ASCII case.

if (*q < 128)

{

*p++ = *q++;

n--;

}

else

{

Uint8 c = UTF_8_COUNT_TRAIL_BYTES(*q) + 1;

String::String(const char* str, Uint32 n_)

if (c > n || !isValid_U8(q, c) ||

UTF8toUTF16(&q, q + c, &p, p + n) != 0)

{

Uint32 n = _min(strlen(str), n_);

MessageLoaderParms parms("Common.String.BAD_UTF8",

reserve(n + 1);

"The byte sequence starting at index $0 "

"is not valid UTF-8 encoding.",

q - (const Uint8*)src);

throw Exception(parms);

}

while (n--)

n -= c;

_rep.append(*str++);

}

_rep.append('\0');

return p - dest;

}

String& String::assign(const Char16* x)

// Note: dest must be at least three times src (plus an extra byte for

// terminator).

static inline size_t _copy_to_utf8(char* dest, const Uint16* src, size_t n)

{

_rep.clear();

const Uint16* q = src;

_rep.append(x, StrLen(x) + 1);

Uint8* p = (Uint8*)dest;

return *this;

while (n >= 4 && q[0] < 128 && q[1] < 128 && q[2] < 128 && q[3] < 128)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

p[3] = q[3];

p += 4;

q += 4;

n -= 4;

}

String& String::assign(const Char16* str, Uint32 n)

switch (n)

{

_rep.clear();

case 0:

Uint32 m = _min(StrLen(str), n);

return p - (Uint8*)dest;

_rep.append(str, m);

case 1:

_rep.append('\0');

if (q[0] < 128)

return *this;

{

p[0] = q[0];

return p + 1 - (Uint8*)dest;

}

break;

case 2:

if (q[0] < 128 && q[1] < 128)

{

p[0] = q[0];

p[1] = q[1];

return p + 2 - (Uint8*)dest;

}

break;

case 3:

if (q[0] < 128 && q[1] < 128 && q[2] < 128)

{

p[0] = q[0];

p[1] = q[1];

p[2] = q[2];

return p + 3 - (Uint8*)dest;

}

break;

}

String& String::assign(const char* x)

// If this line was reached, there must be characters greater than 128.

UTF16toUTF8(&q, q + n, &p, p + 3 * n);

return p - (Uint8*)dest;

}

static inline size_t _convert(Uint16* p, const char* q, size_t n)

{

_rep.clear();

#ifdef PEGASUS_STRING_NO_UTF8

Uint32 n = strlen(x);

_copy(p, q, n);

_rep.reserve(n + 1);

return n;

#else

return _copy_from_utf8(p, q, n);

#endif

}

while (n--)

//==============================================================================

_rep.append(*x++);

// class CString

//==============================================================================

CString::CString(const CString& cstr) : _rep(0)

{

if (cstr._rep)

{

size_t n = strlen(cstr._rep) + 1;

_rep = (char*)operator new(n);

memcpy(_rep, cstr._rep, n);

}

_rep.append('\0');

CString& CString::operator=(const CString& cstr)

{

if (&cstr != this)

{

if (_rep)

{

operator delete(_rep);

_rep = 0;

}

if (cstr._rep)

{

size_t n = strlen(cstr._rep) + 1;

_rep = (char*)operator new(n);

memcpy(_rep, cstr._rep, n);

}

return *this;

}

String& String::assign(const char* x, Uint32 n_)

//==============================================================================

// class StringRep

//==============================================================================

StringRep StringRep::_empty_rep;

inline StringRep* StringRep::alloc(size_t cap)

{

_rep.clear();

StringRep* rep = (StringRep*)::operator new(

sizeof(StringRep) + cap * sizeof(Uint16));

rep->cap = cap;

Atomic_create(&rep->refs, 1);

Uint32 n = _min(strlen(x), n_);

return rep;

_rep.reserve(n + 1);

}

while (n--)

static inline void _reserve(StringRep*& rep, Uint32 cap)

_rep.append(*x++);

{

if (cap > rep->cap || Atomic_get(&rep->refs) != 1)

{

size_t n = _next_pow_2(cap);

StringRep* new_rep = StringRep::alloc(n);

new_rep->size = rep->size;

_copy(new_rep->data, rep->data, rep->size + 1);

StringRep::unref(rep);

rep = new_rep;

}

StringRep* StringRep::create(const Uint16* data, size_t size)

{

StringRep* rep = StringRep::alloc(size);

rep->size = size;

_copy(rep->data, data, size);

rep->data[size] = '\0';

return rep;

}

_rep.append('\0');

StringRep* StringRep::copy_on_write(StringRep* rep)

{

// Return a new copy of rep. Release rep.

return *this;

StringRep* new_rep = StringRep::alloc(rep->size);

new_rep->size = rep->size;

_copy(new_rep->data, rep->data, rep->size);

new_rep->data[new_rep->size] = '\0';

StringRep::unref(rep);

return new_rep;

}

char* String::allocateCString(Uint32 extraBytes, Boolean noThrow) const

StringRep* StringRep::create(const char* data, size_t size)

{

Uint32 n = getLength() + 1;

StringRep* rep = StringRep::alloc(size);

char* str = new char[n + extraBytes];

rep->size = _convert((Uint16*)rep->data, data, size);

char* p = str;

rep->data[rep->size] = '\0';

const Char16* q = getData();

for (Uint32 i = 0; i < n; i++)

return rep;

}

StringRep* StringRep::createASCII7(const char* data, size_t size)

{

Uint16 c = *q++;

StringRep* rep = StringRep::alloc(size);

*p++ = char(c);

_copy((Uint16*)rep->data, data, size);

rep->data[rep->size = size] = '\0';

return rep;

}

Uint32 StringRep::length(const Uint16* str)

{

// Note: We could unroll this but it is rarely called.

const Uint16* end = (Uint16*)str;

while (*end++)

;

if ((c & 0xff00) && !noThrow)

return end - str - 1;

throw TruncatedCharacter();

}

return str;

//==============================================================================

// class String

//==============================================================================

const String String::EMPTY;

String::String(const String& str, Uint32 n)

{

_check_bounds(n, str._rep->size);

_rep = StringRep::create(str._rep->data, n);

}

void String::appendToCString(

String::String(const Char16* str)

char* str,

Uint32 length,

Boolean noThrow) const

{

if (!str)

_check_null_pointer(str);

throw NullPointer();

_rep = StringRep::create((Uint16*)str, StringRep::length((Uint16*)str));

}

String::String(const Char16* str, Uint32 n)

{

_check_null_pointer(str);

_rep = StringRep::create((Uint16*)str, n);

}

Uint32 n = _min(getLength(), length);

String::String(const char* str)

{

_check_null_pointer(str);

_rep = StringRep::create(str, strlen(str));

}

char* p = str + strlen(str);

String::String(const char* str, String::ASCII7Tag tag)

const Char16* q = getData();

{

_check_null_pointer(str);

_rep = StringRep::createASCII7(str, strlen(str));

}

for (Uint32 i = 0; i < n; i++)

String::String(const char* str, Uint32 n)

{

Uint16 c = *q++;

_check_null_pointer(str);

*p++ = char(c);

_rep = StringRep::create(str, n);

}

if ((c & 0xff00) && !noThrow)

String::String(const char* str, size_t n, String::ASCII7Tag tag)

throw TruncatedCharacter();

{

_check_null_pointer(str);

_rep = StringRep::createASCII7(str, n);

}

*p = '\0';

String::String(const String& s1, const String& s2)

{

size_t n1 = s1._rep->size;

size_t n2 = s2._rep->size;

size_t n = n1 + n2;

_rep = StringRep::alloc(n);

_copy(_rep->data, s1._rep->data, n1);

_copy(_rep->data + n1, s2._rep->data, n2);

_rep->size = n;

_rep->data[n] = '\0';

}

Char16& String::operator[](Uint32 i)

String::String(const String& s1, const char* s2)

{

if (i > getLength())

_check_null_pointer(s2);

ThrowOutOfBounds();

size_t n1 = s1._rep->size;

size_t n2 = strlen(s2);

_rep = StringRep::alloc(n1 + n2);

_copy(_rep->data, s1._rep->data, n1);

_rep->size = n1 + _convert((Uint16*)_rep->data + n1, s2, n2);

_rep->data[_rep->size] = '\0';

}

return _rep[i];

String::String(const char* s1, const String& s2)

{

_check_null_pointer(s1);

size_t n1 = strlen(s1);

size_t n2 = s2._rep->size;

_rep = StringRep::alloc(n1 + n2);

_rep->size = n2 + _convert((Uint16*)_rep->data, s1, n1);

_copy(_rep->data + n1, s2._rep->data, n2);

_rep->data[_rep->size] = '\0';

}

const Char16 String::operator[](Uint32 i) const

String& String::assign(const String& str)

{

if (_rep != str._rep)

{

if (i > getLength())

StringRep::unref(_rep);

ThrowOutOfBounds();

StringRep::ref(_rep = str._rep);

}

return _rep[i];

return *this;

}

String& String::append(const Char16* str, Uint32 n)

String& String::assign(const Char16* str, Uint32 n)

{

_check_null_pointer(str);

if (n > _rep->cap || Atomic_get(&_rep->refs) != 1)

{

Uint32 m = _min(StrLen(str), n);

StringRep::unref(_rep);

_rep.reserve(_rep.getSize() + m);

_rep = StringRep::alloc(n);

_rep.remove(_rep.getSize() - 1);

}

_rep.append(str, m);

_rep.append('\0');

_rep->size = n;

_copy(_rep->data, (Uint16*)str, n);

_rep->data[n] = '\0';

return *this;

}

void String::remove(Uint32 pos, Uint32 size)

String& String::assign(const char* str, Uint32 n)

{

if (size == Uint32(-1))

_check_null_pointer(str);

size = getLength() - pos;

if (pos + size > getLength())

if (n > _rep->cap || Atomic_get(&_rep->refs) != 1)

ThrowOutOfBounds();

{

StringRep::unref(_rep);

_rep = StringRep::alloc(n);

}

_rep->size = _convert(_rep->data, str, n);

_rep->data[_rep->size] = 0;

if (size)

return *this;

_rep.remove(pos, size);

}

int String::compare(const Char16* s1, const Char16* s2, Uint32 n)

String& String::assignASCII7(const char* str, Uint32 n)

{

while (n--)

_check_null_pointer(str);

if (n > _rep->cap || Atomic_get(&_rep->refs) != 1)

{

int r = *s1++ - *s2++;

StringRep::unref(_rep);

_rep = StringRep::alloc(n);

}

if (r)

_copy(_rep->data, str, n);

return r;

_rep->data[_rep->size = n] = 0;

return *this;

}

return 0;

void String::clear()

{

if (_rep->size)

{

if (Atomic_get(&_rep->refs) == 1)

_rep->size = 0;

else

{

StringRep::unref(_rep);

_rep = &StringRep::_empty_rep;

}

Boolean String::equal(const String& x, const String& y)

void String::reserveCapacity(Uint32 cap)

{

if (x.getLength() != y.getLength())

_reserve(_rep, cap);

return false;

}

return String::compare(x.getData(), y.getData(), x.getLength()) == 0;

CString String::getCString() const

{

#ifdef PEGASUS_STRING_NO_UTF8

char* str = (char*)operator new(_rep->size + 1);

_copy(str, _rep->data, _rep->size);

str[_rep->size] = '\0';

return CString(str);

#else

Uint32 n = 3 * _rep->size;

char* str = (char*)operator new(n + 1);

size_t size = _copy_to_utf8(str, _rep->data, _rep->size);

str[size] = '\0';

return CString(str);

#endif

}

Boolean String::equal(const String& x, const Char16* y)

String& String::append(const Char16* str, Uint32 n)

{

if (x.getLength() != StrLen(y))

_check_null_pointer(str);

return false;

size_t old_size = _rep->size;

size_t new_size = old_size + n;

_reserve(_rep, new_size);

_copy(_rep->data + old_size, (Uint16*)str, n);

_rep->size = new_size;

_rep->data[new_size] = '\0';

return String::compare(x.getData(), y, x.getLength()) == 0;

return *this;

}

Boolean String::equal(const Char16* x, const String& y)

String& String::append(const String& str)

{

return equal(y, x);

return append((Char16*)str._rep->data, str._rep->size);

}

Boolean String::equal(const String& x, const char* y)

String& String::append(const char* str, Uint32 size)

{

return equal(x, String(y));

_check_null_pointer(str);

size_t old_size = _rep->size;

size_t cap = old_size + size;

_reserve(_rep, cap);

_rep->size += _convert((Uint16*)_rep->data + old_size, str, size);

_rep->data[_rep->size] = '\0';

return *this;

}

Boolean String::equal(const char* x, const String& y)

void String::remove(Uint32 index, Uint32 n)

{

return equal(String(x), y);

if (n == PEG_NOT_FOUND)

}

n = _rep->size - index;

_check_bounds(index + n, _rep->size);

if (Atomic_get(&_rep->refs) != 1)

_rep = StringRep::copy_on_write(_rep);

assert(index + n <= _rep->size);

size_t rem = _rep->size - (index + n);

Uint16* data = _rep->data;

if (rem)

memmove(data + index, data + index + n, rem * sizeof(Uint16));

_rep->size -= n;

data[_rep->size] = '\0';

}

String String::subString(Uint32 pos, Uint32 length) const

String String::subString(Uint32 index, Uint32 n) const

{

if (pos < getLength())

// Note: this implementation is very permissive but used for

// backwards compatibility.

if (index < _rep->size)

{

if (length == Uint32(-1))

if (n == PEG_NOT_FOUND || n > _rep->size - index)

length = getLength() - pos;

n = _rep->size - index;

return String(getData() + pos, length);

return String((Char16*)_rep->data + index, n);

}

else

return String();

}

Uint32 String::find(Char16 c) const

{

const Char16* first = getData();

Uint16* p = (Uint16*)_find(_rep->data, _rep->size, c);

for (const Char16* p = first; *p; p++)

if (p)

{

return p - _rep->data;

if (*p == c)

return p - first;

}

return Uint32(-1);

return PEG_NOT_FOUND;

}

Uint32 String::find(const String& s) const

Uint32 String::find(Uint32 index, Char16 c) const

{

const Char16* pSubStr = s.getData();

_check_bounds(index, _rep->size);

const Char16* pStr = getData();

Uint32 subStrLen = s.getLength();

if (index >= _rep->size)

Uint32 strLen = getLength();

return PEG_NOT_FOUND;

Uint16* p = (Uint16*)_find(_rep->data + index, _rep->size - index, c);

// loop to find first char match

if (p)

Uint32 loc = 0;

return p - _rep->data;

for( ; loc <= (strLen-subStrLen); loc++)

return PEG_NOT_FOUND;

}

Uint32 String::_find_aux(const Char16* s, Uint32 n) const

{

if (*pStr++ == *pSubStr) // match first char

_check_null_pointer(s);

const Uint16* data = _rep->data;

size_t rem = _rep->size;

while (n <= rem)

{

// point to substr 2nd char

Uint16* p = (Uint16*)_find(data, rem, s[0]);

const Char16* p = pSubStr + 1;

// Test remaining chars for equal

if (!p)

Uint32 i = 1;

break;

for (; i < subStrLen; i++)

if (*pStr++ != *p++ )

if (memcmp(p, s, n * sizeof(Uint16)) == 0)

{pStr--; break;} // break from loop

return p - _rep->data;

if (i == subStrLen)

return loc;

p++;

}

rem -= p - data;

data = p;

}

return Uint32(-1);

return PEG_NOT_FOUND;

}

// ATTN:KS 5 apr 2000 Need to add the Char16* version.

Uint32 String::find(const char* s) const

{

_check_null_pointer(s);

// Note: could optimize away creation of temporary, but this is rarely

// called.

return find(String(s));

}

Uint32 String::reverseFind(Char16 c) const

{

const Char16* first = getData();

Uint16 x = c;

const Char16* last = getData() + getLength();

Uint16* p = _rep->data;

Uint16* q = _rep->data + _rep->size;

while (q != p)

{

if (*--q == x)

return q - p;

}

return PEG_NOT_FOUND;

}

void String::toLower()

{

#ifdef PEGASUS_HAS_ICU

if (InitializeICU::initICUSuccessful())

{

if (Atomic_get(&_rep->refs) != 1)

_rep = StringRep::copy_on_write(_rep);

// This will do a locale-insensitive, but context-sensitive convert.

// Since context-sensitive casing looks at adjacent chars, this

// prevents optimizations where the us-ascii is converted before

// calling ICU.

// The string may shrink or expand after the convert.

//// First calculate size of resulting string. u_strToLower() returns

//// only the size when zero is passed as the destination size argument.

UErrorCode err = U_ZERO_ERROR;

int32_t new_size = u_strToLower(

NULL, 0, (UChar*)_rep->data, _rep->size, NULL, &err);

err = U_ZERO_ERROR;

//// Reserve enough space for the result.

if ((Uint32)new_size > _rep->cap)

_reserve(_rep, new_size);

//// Perform the conversion (overlapping buffers are allowed).

u_strToLower((UChar*)_rep->data, new_size,

(UChar*)_rep->data, _rep->size, NULL, &err);

_rep->size = new_size;

return;

}

#endif /* PEGASUS_HAS_ICU */

if (Atomic_get(&_rep->refs) != 1)

_rep = StringRep::copy_on_write(_rep);

Uint16* p = _rep->data;

size_t n = _rep->size;

for (; n--; p++)

{

if (!(*p & 0xFF00))

*p = _to_lower(*p);

}

void String::toUpper()

{

#ifdef PEGASUS_HAS_ICU

if (InitializeICU::initICUSuccessful())

{

if (Atomic_get(&_rep->refs) != 1)

_rep = StringRep::copy_on_write(_rep);

// This will do a locale-insensitive, but context-sensitive convert.

// Since context-sensitive casing looks at adjacent chars, this

// prevents optimizations where the us-ascii is converted before

// calling ICU.

// The string may shrink or expand after the convert.

//// First calculate size of resulting string. u_strToUpper() returns

//// only the size when zero is passed as the destination size argument.

UErrorCode err = U_ZERO_ERROR;

int32_t new_size = u_strToUpper(

NULL, 0, (UChar*)_rep->data, _rep->size, NULL, &err);

err = U_ZERO_ERROR;

//// Reserve enough space for the result.

if ((Uint32)new_size > _rep->cap)

_reserve(_rep, new_size);

//// Perform the conversion (overlapping buffers are allowed).

u_strToUpper((UChar*)_rep->data, new_size,

(UChar*)_rep->data, _rep->size, NULL, &err);

_rep->size = new_size;

return;

}

#endif /* PEGASUS_HAS_ICU */

if (Atomic_get(&_rep->refs) != 1)

_rep = StringRep::copy_on_write(_rep);

Uint16* p = _rep->data;

size_t n = _rep->size;

for (; n--; p++)

*p = _to_upper(*p);

}

int String::compare(const String& s1, const String& s2, Uint32 n)

{

assert(n <= s1._rep->size);

assert(n <= s2._rep->size);

// Ignoring error in which n is greater than s1.size() or s2.size()

return _compare(s1._rep->data, s2._rep->data, n);

}

while (last != first)

int String::compare(const String& s1, const String& s2)

{

if (*--last == c)

return _compare(s1._rep->data, s2._rep->data);

return last - first;

}

return Uint32(-1);

int String::compare(const String& s1, const char* s2)

{

_check_null_pointer(s2);

#ifdef PEGASUS_STRING_NO_UTF8

return _compare_no_utf8(s1._rep->data, s2);

#else

// ATTN: optimize this!

return String::compare(s1, String(s2));

#endif

}

int String::compare(const Char16* s1, const Char16* s2)

int String::compareNoCase(const String& str1, const String& str2)

{

#ifdef PEGASUS_HAS_ICU

if (InitializeICU::initICUSuccessful())

{

return u_strcasecmp(

str1._rep->data, str2._rep->data, U_FOLD_CASE_DEFAULT);

}

#endif /* PEGASUS_HAS_ICU */

const Uint16* s1 = str1._rep->data;

const Uint16* s2 = str2._rep->data;

while (*s1 && *s2)

{

int r = *s1++ - *s2++;

int r = _to_lower(*s1++) - _to_lower(*s2++);

if (r)

return r;

Line 403

Line 1079

return 0;

}

std::ostream& operator<<(std::ostream& os, const String& x)

Boolean String::equalNoCase_aux(const String& s1, const String& s2)

{

for (Uint32 i = 0, n = x.getLength(); i < n; i++)

#ifdef PEGASUS_HAS_ICU

os << x[i];

return os;

return String::compareNoCase(s1, s2) == 0;

#else /* PEGASUS_HAS_ICU */

Uint16* p = (Uint16*)s1._rep->data;

Uint16* q = (Uint16*)s2._rep->data;

Uint32 n = s2._rep->size;

while (n >= 8)

{

if (((p[0] - q[0]) && (_to_upper(p[0]) - _to_upper(q[0]))) ||

((p[1] - q[1]) && (_to_upper(p[1]) - _to_upper(q[1]))) ||

((p[2] - q[2]) && (_to_upper(p[2]) - _to_upper(q[2]))) ||

((p[3] - q[3]) && (_to_upper(p[3]) - _to_upper(q[3]))) ||

((p[4] - q[4]) && (_to_upper(p[4]) - _to_upper(q[4]))) ||

((p[5] - q[5]) && (_to_upper(p[5]) - _to_upper(q[5]))) ||

((p[6] - q[6]) && (_to_upper(p[6]) - _to_upper(q[6]))) ||

((p[7] - q[7]) && (_to_upper(p[7]) - _to_upper(q[7]))))

{

return false;

}

n -= 8;

p += 8;

q += 8;

}

void String::toLower(char* str)

while (n >= 4)

{

while (*str)

if (((p[0] - q[0]) && (_to_upper(p[0]) - _to_upper(q[0]))) ||

tolower(*str++);

((p[1] - q[1]) && (_to_upper(p[1]) - _to_upper(q[1]))) ||

((p[2] - q[2]) && (_to_upper(p[2]) - _to_upper(q[2]))) ||

((p[3] - q[3]) && (_to_upper(p[3]) - _to_upper(q[3]))))

{

return false;

}

n -= 4;

p += 4;

q += 4;

}

String ToLower(const String& str)

while (n--)

{

String tmp(str);

if (((p[0] - q[0]) && (_to_upper(p[0]) - _to_upper(q[0]))))

return false;

for (Uint32 i = 0, n = tmp.getLength(); i < n; i++)

p++;

q++;

}

return true;

#endif /* PEGASUS_HAS_ICU */

}

Boolean String::equalNoCase(const String& s1, const char* s2)

{

Char16 c = tmp[i];

_check_null_pointer(s2);

#if defined(PEGASUS_HAS_ICU)

if (c <= 127)

return String::equalNoCase(s1, String(s2));

tmp[i] = tolower(c);

#elif defined(PEGASUS_STRING_NO_UTF8)

const Uint16* p1 = (Uint16*)s1._rep->data;

const char* p2 = s2;

size_t n = s1._rep->size;

while (n--)

{

if (!*p2)

return false;

if (_to_upper(*p1++) != _to_upper_tbl[int(*p2++)])

return false;

}

return tmp;

if (*p2)

return false;

return true;

#else /* PEGASUS_HAS_ICU */

// ATTN: optimize this!

return String::equalNoCase(s1, String(s2));

#endif /* PEGASUS_HAS_ICU */

}

int CompareIgnoreCase(const char* s1, const char* s2)

Boolean String::equal(const String& s1, const String& s2)

{

while (*s1 && *s2)

return s1._rep->size == s2._rep->size && memcmp(s1._rep->data,

s2._rep->data, s1._rep->size * sizeof(Uint16)) == 0;

}

Boolean String::equal(const String& s1, const char* s2)

{

int r = tolower(*s1++) - tolower(*s2++);

#ifdef PEGASUS_STRING_NO_UTF8

if (r)

_check_null_pointer(s2);

return r;

const Uint16* p = (Uint16*)s1._rep->data;

const char* q = s2;

while (*p && *q)

{

if (*p++ != Uint16(*q++))

return false;

}

if (*s2)

return !(*p || *q);

return -1;

else if (*s1)

return 1;

return 0;

#else /* PEGASUS_STRING_NO_UTF8 */

return String::equal(s1, String(s2));

#endif /* PEGASUS_STRING_NO_UTF8 */

}

Boolean GetLine(istream& is, String& line)

PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& str)

{

line.clear();

#if defined(PEGASUS_OS_OS400)

Boolean gotChar = false;

CString cstr = str.getCString();

char c;

const char* utf8str = cstr;

os << utf8str;

return os;

#else

#if defined(PEGASUS_HAS_ICU)

while (is.get(c))

if (InitializeICU::initICUSuccessful())

{

gotChar = true;

char *buf = NULL;

const int size = str.size() * 6;

UnicodeString UniStr(

(const UChar *)str.getChar16Data(), (int32_t)str.size());

Uint32 bufsize = UniStr.extract(0,size,buf);

buf = new char[bufsize+1];

UniStr.extract(0,bufsize,buf);

os << buf;

os.flush();

delete [] buf;

return os;

}

if (c == '\n')

#endif // PEGASUS_HAS_ICU

break;

for (Uint32 i = 0, n = str.size(); i < n; i++)

{

Uint16 code = str[i];

line.append(c);

if (code > 0 && !(code & 0xFF00))

os << char(code);

else

{

// Print in hex format:

char buffer[8];

sprintf(buffer, "\\x%04X", code);

os << buffer;

}

return os;

#endif // PEGASUS_OS_OS400

}

void String::_append_char_aux()

{

StringRep* tmp;

if (_rep->cap)

{

tmp = StringRep::alloc(2 * _rep->cap);

tmp->size = _rep->size;

_copy(tmp->data, _rep->data, _rep->size);

}

else

{

tmp = StringRep::alloc(8);

tmp->size = 0;

}

return gotChar;

StringRep::unref(_rep);

_rep = tmp;

}

PEGASUS_NAMESPACE_END

================================================================================

String optimizations:

1. Added mechanism allowing certain functions to be inlined only when

used by internal Pegasus modules. External modules (i.e., providers)

link to a non-inline version, which allows for binary compatibility.

2. Implemented copy-on-write with atomic increment/decrement. This

yieled a 10% improvement for the 'gc' benchmark and a 11% improvment

for the 'ni1000' benchmark.

3. Employed loop unrolling in several places. For example, see:

static Uint16* _find(const Uint16* s, size_t n, Uint16 c);

4. Used the "empty-rep" optimization (described in whitepaper from the

GCC Developers Summit). This reduced default construction to a simple

pointer assignment.

inline String::String() : _rep(&_empty_rep) { }

5. Implemented Uint16 versions of toupper() and tolower() using tables.

For example:

static const char _upper[] =

{

0,1,2,...255

};

inline Uint16 _to_upper(Uint16 x)

{

return (x & 0xFF00) ? x : _upper[x];

}

This outperforms the system implementation by avoiding an anding

operation.

6. Implemented char* version of the following member functions to

eliminate unecessary creation of anonymous string objects

(temporaries).

String(const String& s1, const char* s2);

String(const char* s1, const String& s2);

String& String::operator=(const char* str);

Uint32 String::find(const char* s) const;

bool String::equal(const String& s1, const char* s2);

static int String::compare(const String& s1, const char* s2);

String& String::append(const char* str);

String& String::append(const char* str, Uint32 size);

static bool String::equalNoCase(const String& s1, const char* s2);

String& operator=(const char* str)

String& String::assign(const char* str)

String& String::append(const char* str)

Boolean operator==(const String& s1, const char* s2)

Boolean operator==(const char* s1, const String& s2)

Boolean operator!=(const String& s1, const char* s2)

Boolean operator!=(const char* s1, const String& s2)

Boolean operator<(const String& s1, const char* s2)

Boolean operator<(const char* s1, const String& s2)

Boolean operator>(const String& s1, const char* s2)

Boolean operator>(const char* s1, const String& s2)

Boolean operator<=(const String& s1, const char* s2)

Boolean operator<=(const char* s1, const String& s2)

Boolean operator>=(const String& s1, const char* s2)

Boolean operator>=(const char* s1, const String& s2)

String operator+(const String& s1, const char* s2)

String operator+(const char* s1, const String& s2)

7. Optimized _next_pow_2(), used in rounding the capacity to the next

power of two (algorithm from the book "Hacker's Delight").

static Uint32 _next_pow_2(Uint32 x)

{

if (x < 8)

return 8;

x--;

x |= (x >> 1);

x |= (x >> 2);

x |= (x >> 4);

x |= (x >> 8);

x |= (x >> 16);

x++;

return x;

}

8. Implemented "concatenating constructors" to eliminate temporaries

created by operator+(). This scheme employs the "return-value

optimization" described by Stan Lippman.

inline String operator+(const String& s1, const String& s2)

{

return String(s1, s2, 0);

}

9. Experimented to find the optimial initial size for a short string.

Eight seems to offer the best tradeoff between space and time.

10. Inlined all members of the Char16 class.

11. Used Uint16 internally in the String class. This showed no improvememnt

since Char16 was already fully inlined and was essentially reduced to

Uint16 in any case.

12. Implemented conditional logic (#if) allowing error checking logic to

be excluded to better performance. Examples include bounds checking

and null-pointer checking.

13. Used memcpy() and memcmp() where possible. These are implemented using

the rep family of intructions under Intel and are much faster.

14. Used loop unrolling, jump-tables, and short-circuiting to reduce UTF8

copy routine overhead.

15. Added ASCII7 form of the constructor and assign().

String s("hello world", String::ASCII7);

s.assignASCII7("hello world");

This avoids slower UTF8 processing when not needed.

BUG-4200 Review actions:

1. Use PEGASUS_USE_EXPERIMENTAL_INTERFACES instead of

PEGASUS_STRING_EXTENSIONS.

Status: done

2. Doc++ String.h

Status: pending

3. Look at PEP223 for security coding guidelines for strings.

Status: pending

4. Increasing the number of objects may break Windows 2000 build

(limit of 2048 bytes for command line). See BUG-2754

Status: looking into the use auto-generated linker files.

5. Concerns about whether generating inlines and non-inline versions

of functions will work with all compilers.

Status: confident it will work on platforms except maybe Windows.

================================================================================

Legend:

Removed from v.1.11
changed lines
	Added in v.1.111.6.2

No CVS admin address has been configured