version 1.121, 2006/05/30 15:41:57
|
version 1.140, 2014/06/14 16:14:04
|
|
|
//%2006//////////////////////////////////////////////////////////////////////// |
//%LICENSE//////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
// Licensed to The Open Group (TOG) under one or more contributor license |
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with |
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
// this work for additional information regarding copyright ownership. |
// IBM Corp.; EMC Corporation, The Open Group. |
// Each contributor licenses this file to you under the OpenPegasus Open |
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
// Source License; you may not use this file except in compliance with the |
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
// License. |
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; Symantec Corporation; The Open Group. |
|
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a copy |
// Permission is hereby granted, free of charge, to any person obtaining a |
// of this software and associated documentation files (the "Software"), to |
// copy of this software and associated documentation files (the "Software"), |
// deal in the Software without restriction, including without limitation the |
// to deal in the Software without restriction, including without limitation |
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
// the rights to use, copy, modify, merge, publish, distribute, sublicense, |
// sell copies of the Software, and to permit persons to whom the Software is |
// and/or sell copies of the Software, and to permit persons to whom the |
// furnished to do so, subject to the following conditions: |
// Software is furnished to do so, subject to the following conditions: |
// | // |
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN |
// The above copyright notice and this permission notice shall be included |
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED |
// in all copies or substantial portions of the Software. |
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT |
|
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR |
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
// 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. |
|
// | // |
//============================================================================== |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
// |
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
// Author: Mike Brasher (mbrasher@austin.rr.com) |
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
|
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
|
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 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. |
// | // |
// Modified By: |
////////////////////////////////////////////////////////////////////////// |
// Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com) |
|
// Josephine Eskaline Joyce, IBM (jojustin@in.ibm.com) for Bug#3297 |
|
// David Dillard, Symantec Corp. (david_dillard@symantec.com) |
|
// Mike Brasher (mike-brasher@austin.rr.com) |
|
// | // |
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
#include <Pegasus/Common/PegasusAssert.h> | #include <Pegasus/Common/PegasusAssert.h> |
#include <cstring> | #include <cstring> |
#include "InternalException.h" | #include "InternalException.h" |
#include "CommonUTF.h" |
|
#include "MessageLoader.h" | #include "MessageLoader.h" |
#include "StringRep.h" | #include "StringRep.h" |
|
#include <Pegasus/Common/Pegasus_inl.h> |
|
#include <cstdarg> |
| |
#ifdef PEGASUS_HAS_ICU | #ifdef PEGASUS_HAS_ICU |
|
# include <unicode/ures.h> |
#include <unicode/ustring.h> | #include <unicode/ustring.h> |
#include <unicode/uchar.h> | #include <unicode/uchar.h> |
#endif | #endif |
|
|
// | // |
// Compile-time macros (undefined by default). | // Compile-time macros (undefined by default). |
// | // |
// PEGASUS_STRING_NO_THROW -- suppresses throwing of exceptions |
|
// |
|
// PEGASUS_STRING_NO_UTF8 -- don't generate slower UTF8 code. | // PEGASUS_STRING_NO_UTF8 -- don't generate slower UTF8 code. |
// | // |
//============================================================================== | //============================================================================== |
|
|
0xF8,0xF9,0xFA,0xFB,0xFC,0xFD,0xFE,0xFF, | 0xF8,0xF9,0xFA,0xFB,0xFC,0xFD,0xFE,0xFF, |
}; | }; |
| |
// Note: this table is much faster than the system tulower(). Please do not |
// Note: this table is much faster than the system tolower(). Please do not |
// change. | // change. |
| |
const Uint8 _toLowerTable[256] = | const Uint8 _toLowerTable[256] = |
|
|
// Rounds x up to the nearest power of two (or just returns 8 if x < 8). | // Rounds x up to the nearest power of two (or just returns 8 if x < 8). |
static Uint32 _roundUpToPow2(Uint32 x) | static Uint32 _roundUpToPow2(Uint32 x) |
{ | { |
#ifndef PEGASUS_STRING_NO_THROW |
|
|
|
// Check for potential overflow in x | // Check for potential overflow in x |
PEGASUS_CHECK_CAPACITY_OVERFLOW(x); | PEGASUS_CHECK_CAPACITY_OVERFLOW(x); |
| |
#endif |
|
|
|
if (x < 8) | if (x < 8) |
return 8; | return 8; |
| |
|
|
return x; | return x; |
} | } |
| |
template<class P, class Q> |
|
static void _copy(P* p, const Q* q, size_t n) |
|
{ |
|
// The following employs loop unrolling for efficiency. Please do not |
|
// eliminate. |
|
|
|
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; |
|
} |
|
|
|
while (n--) |
|
*p++ = *q++; |
|
} |
|
|
|
static Uint16* _find(const Uint16* s, size_t n, Uint16 c) | static Uint16* _find(const Uint16* s, size_t n, Uint16 c) |
{ | { |
// The following employs loop unrolling for efficiency. Please do not | // The following employs loop unrolling for efficiency. Please do not |
|
|
return 0; | return 0; |
} | } |
| |
|
#ifdef PEGASUS_STRING_NO_UTF8 |
static int _compareNoUTF8(const Uint16* s1, const char* s2) | static int _compareNoUTF8(const Uint16* s1, const char* s2) |
{ | { |
Uint16 c1; | Uint16 c1; |
|
|
| |
return c1 - c2; | return c1 - c2; |
} | } |
|
#endif |
| |
static inline void _copy(Uint16* s1, const Uint16* s2, size_t n) | static inline void _copy(Uint16* s1, const Uint16* s2, size_t n) |
{ | { |
|
|
| |
inline void _checkNullPointer(const void* ptr) | inline void _checkNullPointer(const void* ptr) |
{ | { |
#ifndef PEGASUS_STRING_NO_THROW |
|
|
|
if (!ptr) | if (!ptr) |
throw NullPointer(); | throw NullPointer(); |
|
|
#endif |
|
} | } |
| |
static void _StringThrowBadUTF8(Uint32 index) |
#define BADUTF8_MAX_CLEAR_CHAR 40 |
{ |
#define BADUTF8_MAX_CHAR_TO_HEX 10 |
MessageLoaderParms parms( |
|
"Common.String.BAD_UTF8", |
|
"The byte sequence starting at index $0 " |
|
"is not valid UTF-8 encoding.", |
|
index); |
|
throw Exception(parms); |
|
} |
|
| |
static size_t _copyFromUTF8( |
static void _formatBadUTF8Chars( |
Uint16* dest, |
char* buffer, |
const char* src, |
Uint32 index, |
size_t n, |
const char* q, |
size_t& utf8_error_index) |
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) |
char tmp[20]; |
{ |
const char* start; |
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 && ((q[0]|q[1]|q[2]|q[3]) & 0x80) == 0) |
size_t clearChar = |
{ |
(( index < BADUTF8_MAX_CLEAR_CHAR ) ? index : BADUTF8_MAX_CLEAR_CHAR ); |
p[0] = q[0]; |
size_t charToHex = |
p[1] = q[1]; |
((n-index-1) < BADUTF8_MAX_CHAR_TO_HEX ? |
p[2] = q[2]; |
(n-index-1) : BADUTF8_MAX_CHAR_TO_HEX ); |
p[3] = q[3]; |
|
p += 4; |
|
q += 4; |
|
n -= 4; |
|
} |
|
| |
switch (n) |
if (index < BADUTF8_MAX_CLEAR_CHAR) |
{ |
|
case 0: |
|
return p - dest; |
|
case 1: |
|
if (q[0] < 128) |
|
{ | { |
p[0] = q[0]; |
start = q; |
return p + 1 - dest; |
} else |
} |
|
break; |
|
case 2: |
|
if (((q[0]|q[1]) & 0x80) == 0) |
|
{ | { |
p[0] = q[0]; |
start = &(q[ index - BADUTF8_MAX_CLEAR_CHAR]); |
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; |
|
} | } |
| |
// Process remaining characters. |
// Intialize the buffer with the first character as '\0' to be able to use |
|
// strnchat() and strcat() |
while (n) |
buffer[0] = 0; |
|
// Start the buffer with the valid UTF8 chars |
|
strncat(buffer,start,clearChar); |
|
for (size_t i = clearChar, j = 0; j <= charToHex; i++,j++ ) |
{ | { |
// Optimize for 7-bit ASCII case. |
tmp[0] = 0; |
|
sprintf(&(tmp[0])," 0x%02X",(Uint8)start[i]); |
|
strncat(buffer,&(tmp[0]),5); |
|
} |
| |
if (*q < 128) |
|
{ |
|
*p++ = *q++; |
|
n--; |
|
} | } |
else |
|
{ |
|
Uint8 c = UTF_8_COUNT_TRAIL_BYTES(*q) + 1; |
|
| |
if (c > n || !isValid_U8(q, c) || |
static void _StringThrowBadUTF8(Uint32 index, const char* q, size_t n) |
UTF8toUTF16(&q, q + c, &p, p + n) != 0) |
|
{ | { |
utf8_error_index = q - (const Uint8*)src; |
char buffer[1024]; |
return size_t(-1); |
|
} |
|
| |
n -= c; |
_formatBadUTF8Chars(&(buffer[0]),index,q,n); |
} |
|
} |
MessageLoaderParms parms( |
|
"Common.String.BAD_UTF8_LONG", |
|
"The byte sequence starting at index $0 " |
|
"is not valid UTF-8 encoding: $1", |
|
index,buffer); |
| |
return p - dest; |
throw Exception(parms); |
} | } |
| |
// Note: dest must be at least three times src (plus an extra byte for | // Note: dest must be at least three times src (plus an extra byte for |
|
|
return p - (Uint8*)dest; | return p - (Uint8*)dest; |
} | } |
| |
static inline size_t _convert( |
// Function to return a formatted char* from a va_list. |
Uint16* p, const char* q, size_t n, size_t& utf8_error_index) |
// Allocates space for the returned char* and repeats the |
|
// build process until the allocated space is large enough |
|
// to hold the result. This is internal only and the core function |
|
// used by stringPrintf and stringVPrintf |
|
|
|
static char* _charVPrintf(const char* format, va_list ap) |
|
{ |
|
// Iniitial allocation size. This is a guess assuming that |
|
// most printfs are one or two lines long |
|
int allocSize = 256; |
|
|
|
int rtnSize; |
|
char *p; |
|
|
|
// initial allocate for output |
|
if ((p = (char*)malloc(allocSize)) == NULL) |
{ | { |
#ifdef PEGASUS_STRING_NO_UTF8 |
return 0; |
_copy(p, q, n); |
} |
return n; |
|
#else |
// repeat formatting with increased realloc until it works. |
return _copyFromUTF8(p, q, n, utf8_error_index); |
do |
#endif |
{ |
|
rtnSize = vsnprintf(p, allocSize, format, ap); |
|
|
|
// return if successful if not negative and |
|
// returns less than allocated size. |
|
if (rtnSize > -1 && rtnSize < allocSize) |
|
{ |
|
return p; |
|
} |
|
|
|
// increment alloc size. Assumes that positive return is |
|
// expected size and negative is error. |
|
allocSize = (rtnSize > -1)? (rtnSize + 1) : allocSize * 2; |
|
|
|
} while((p = (char*)peg_inln_realloc(p, allocSize)) != NULL); |
|
|
|
// return error code if realloc failed |
|
return 0; |
} | } |
| |
//============================================================================== | //============================================================================== |
|
|
| |
inline StringRep* StringRep::alloc(size_t cap) | inline StringRep* StringRep::alloc(size_t cap) |
{ | { |
#ifndef PEGASUS_STRING_NO_THROW |
|
|
|
// Check for potential overflow in cap | // Check for potential overflow in cap |
PEGASUS_CHECK_CAPACITY_OVERFLOW(cap); | PEGASUS_CHECK_CAPACITY_OVERFLOW(cap); |
| |
#endif |
|
|
|
StringRep* rep = (StringRep*)::operator new( | StringRep* rep = (StringRep*)::operator new( |
sizeof(StringRep) + cap * sizeof(Uint16)); | sizeof(StringRep) + cap * sizeof(Uint16)); |
rep->cap = cap; | rep->cap = cap; |
|
|
size_t utf8_error_index; | size_t utf8_error_index; |
rep->size = _convert((Uint16*)rep->data, data, size, utf8_error_index); | rep->size = _convert((Uint16*)rep->data, data, size, utf8_error_index); |
| |
#ifndef PEGASUS_STRING_NO_THROW |
|
if (rep->size == size_t(-1)) | if (rep->size == size_t(-1)) |
{ | { |
StringRep::free(rep); | StringRep::free(rep); |
_StringThrowBadUTF8(utf8_error_index); |
_StringThrowBadUTF8((Uint32)utf8_error_index, data,size); |
} | } |
#endif |
|
| |
rep->data[rep->size] = '\0'; | rep->data[rep->size] = '\0'; |
| |
|
|
while (*end++) | while (*end++) |
; | ; |
| |
return end - str - 1; |
return (Uint32)(end - str - 1); |
} | } |
| |
//============================================================================== | //============================================================================== |
|
|
size_t utf8_error_index; | size_t utf8_error_index; |
size_t tmp = _convert((Uint16*)_rep->data + n1, s2, n2, utf8_error_index); | size_t tmp = _convert((Uint16*)_rep->data + n1, s2, n2, utf8_error_index); |
| |
#ifndef PEGASUS_STRING_NO_THROW |
|
if (tmp == size_t(-1)) | if (tmp == size_t(-1)) |
{ | { |
StringRep::free(_rep); | StringRep::free(_rep); |
_rep = &StringRep::_emptyRep; | _rep = &StringRep::_emptyRep; |
_StringThrowBadUTF8(utf8_error_index); |
_StringThrowBadUTF8((Uint32)utf8_error_index,s2,n2); |
} | } |
#endif |
|
| |
_rep->size = n1 + tmp; | _rep->size = n1 + tmp; |
_rep->data[_rep->size] = '\0'; | _rep->data[_rep->size] = '\0'; |
|
|
size_t utf8_error_index; | size_t utf8_error_index; |
size_t tmp = _convert((Uint16*)_rep->data, s1, n1, utf8_error_index); | size_t tmp = _convert((Uint16*)_rep->data, s1, n1, utf8_error_index); |
| |
#ifndef PEGASUS_STRING_NO_THROW |
|
if (tmp == size_t(-1)) | if (tmp == size_t(-1)) |
{ | { |
StringRep::free(_rep); | StringRep::free(_rep); |
_rep = &StringRep::_emptyRep; | _rep = &StringRep::_emptyRep; |
_StringThrowBadUTF8(utf8_error_index); |
_StringThrowBadUTF8((Uint32)utf8_error_index,s1,n1); |
} | } |
#endif |
|
| |
_rep->size = n2 + tmp; | _rep->size = n2 + tmp; |
_copy(_rep->data + n1, s2._rep->data, n2); | _copy(_rep->data + n1, s2._rep->data, n2); |
|
|
size_t utf8_error_index; | size_t utf8_error_index; |
_rep->size = _convert(_rep->data, str, n, utf8_error_index); | _rep->size = _convert(_rep->data, str, n, utf8_error_index); |
| |
#ifndef PEGASUS_STRING_NO_THROW |
|
if (_rep->size == size_t(-1)) | if (_rep->size == size_t(-1)) |
{ | { |
StringRep::free(_rep); | StringRep::free(_rep); |
_rep = &StringRep::_emptyRep; | _rep = &StringRep::_emptyRep; |
_StringThrowBadUTF8(utf8_error_index); |
_StringThrowBadUTF8((Uint32)utf8_error_index,str,n); |
} | } |
#endif |
|
| |
_rep->data[_rep->size] = 0; | _rep->data[_rep->size] = 0; |
| |
|
|
str[_rep->size] = '\0'; | str[_rep->size] = '\0'; |
return CString(str); | return CString(str); |
#else | #else |
Uint32 n = 3 * _rep->size; |
Uint32 n = (Uint32)(3 * _rep->size); |
char* str = (char*)operator new(n + 1); | char* str = (char*)operator new(n + 1); |
size_t size = _copyToUTF8(str, _rep->data, _rep->size); | size_t size = _copyToUTF8(str, _rep->data, _rep->size); |
str[size] = '\0'; | str[size] = '\0'; |
|
|
| |
size_t oldSize = _rep->size; | size_t oldSize = _rep->size; |
size_t newSize = oldSize + n; | size_t newSize = oldSize + n; |
_reserve(_rep, newSize); |
_reserve(_rep, (Uint32)newSize); |
_copy(_rep->data + oldSize, (Uint16*)str, n); | _copy(_rep->data + oldSize, (Uint16*)str, n); |
_rep->size = newSize; | _rep->size = newSize; |
_rep->data[newSize] = '\0'; | _rep->data[newSize] = '\0'; |
|
|
| |
String& String::append(const String& str) | String& String::append(const String& str) |
{ | { |
return append((Char16*)(&(str._rep->data[0])), str._rep->size); |
return append((Char16*)(&(str._rep->data[0])), (Uint32)str._rep->size); |
} | } |
| |
String& String::append(const char* str, Uint32 size) | String& String::append(const char* str, Uint32 size) |
|
|
size_t oldSize = _rep->size; | size_t oldSize = _rep->size; |
size_t cap = oldSize + size; | size_t cap = oldSize + size; |
| |
_reserve(_rep, cap); |
_reserve(_rep, (Uint32)cap); |
size_t utf8_error_index; | size_t utf8_error_index; |
size_t tmp = _convert( | size_t tmp = _convert( |
(Uint16*)_rep->data + oldSize, str, size, utf8_error_index); | (Uint16*)_rep->data + oldSize, str, size, utf8_error_index); |
| |
#ifndef PEGASUS_STRING_NO_THROW |
|
if (tmp == size_t(-1)) | if (tmp == size_t(-1)) |
{ | { |
StringRep::free(_rep); | StringRep::free(_rep); |
_rep = &StringRep::_emptyRep; | _rep = &StringRep::_emptyRep; |
_StringThrowBadUTF8(utf8_error_index); |
_StringThrowBadUTF8((Uint32)utf8_error_index,str,size); |
} | } |
#endif |
|
| |
_rep->size += tmp; | _rep->size += tmp; |
_rep->data[_rep->size] = '\0'; | _rep->data[_rep->size] = '\0'; |
|
|
void String::remove(Uint32 index, Uint32 n) | void String::remove(Uint32 index, Uint32 n) |
{ | { |
if (n == PEG_NOT_FOUND) | if (n == PEG_NOT_FOUND) |
n = _rep->size - index; |
n = (Uint32)(_rep->size - index); |
| |
_checkBounds(index + n, _rep->size); | _checkBounds(index + n, _rep->size); |
| |
|
|
if (index < _rep->size) | if (index < _rep->size) |
{ | { |
if (n == PEG_NOT_FOUND || n > _rep->size - index) | if (n == PEG_NOT_FOUND || n > _rep->size - index) |
n = _rep->size - index; |
n = (Uint32)(_rep->size - index); |
| |
return String((Char16*)(_rep->data + index), n); | return String((Char16*)(_rep->data + index), n); |
} | } |
|
|
if (InitializeICU::initICUSuccessful()) | if (InitializeICU::initICUSuccessful()) |
{ | { |
return u_strcasecmp( | return u_strcasecmp( |
str1._rep->data, str2._rep->data, U_FOLD_CASE_DEFAULT); |
(const UChar*)str1._rep->data, |
|
(const UChar*)str2._rep->data, |
|
U_FOLD_CASE_DEFAULT |
|
); |
} | } |
| |
#endif /* PEGASUS_HAS_ICU */ | #endif /* PEGASUS_HAS_ICU */ |
|
|
| |
Boolean String::equal(const String& s1, const String& s2) | Boolean String::equal(const String& s1, const String& s2) |
{ | { |
return s1._rep->size == s2._rep->size && memcmp(s1._rep->data, |
return (s1._rep == s2._rep) || |
s2._rep->data, s1._rep->size * sizeof(Uint16)) == 0; |
((s1._rep->size == s2._rep->size) && |
|
memcmp(s1._rep->data, |
|
s2._rep->data, |
|
s1._rep->size * sizeof(Uint16)) == 0); |
|
} |
|
|
|
void String::appendPrintf(const char* format, ...) |
|
{ |
|
va_list ap; |
|
va_start(ap, format); |
|
|
|
// Format into allocated memory |
|
////char* rtnCharPtr = _charVPrintf(format, ap); |
|
|
|
// Iniitial allocation size. This is a guess assuming that |
|
// most printfs are one or two lines long |
|
int allocSize = 256; |
|
int rtnSize; |
|
char *p; |
|
|
|
// initial allocate for output |
|
if ((p = (char*)malloc(allocSize)) == NULL) |
|
{ |
|
return; |
|
} |
|
|
|
// repeat formatting with increased realloc until it works. |
|
do |
|
{ |
|
rtnSize = vsnprintf(p, allocSize, format, ap); |
|
|
|
// return if successful; i.e. if not negative and |
|
// returns less than allocated size. |
|
if (rtnSize > -1 && rtnSize < allocSize) |
|
{ |
|
break; |
|
} |
|
|
|
// increment alloc size. Positive return is |
|
// expected size and negative is error. |
|
allocSize = (rtnSize > -1)? (rtnSize + 1) : allocSize * 2; |
|
|
|
} while((p = (char*)peg_inln_realloc(p, allocSize)) != NULL); |
|
|
|
// get here only with error in malloc. |
|
|
|
va_end(ap); |
|
|
|
// Free allocated memory append printf output to current string |
|
append(p, rtnSize); |
|
free(p); |
} | } |
| |
Boolean String::equal(const String& s1, const char* s2) | Boolean String::equal(const String& s1, const char* s2) |
|
|
| |
PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& str) | PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& str) |
{ | { |
#if defined(PEGASUS_OS_OS400) |
|
|
|
CString cstr = str.getCString(); |
|
const char* utf8str = cstr; |
|
os << utf8str; |
|
return os; |
|
#else |
|
|
|
#if defined(PEGASUS_HAS_ICU) | #if defined(PEGASUS_HAS_ICU) |
| |
if (InitializeICU::initICUSuccessful()) | if (InitializeICU::initICUSuccessful()) |
|
|
} | } |
| |
return os; | return os; |
#endif // PEGASUS_OS_OS400 |
|
} | } |
| |
void StringAppendCharAux(StringRep*& _rep) | void StringAppendCharAux(StringRep*& _rep) |
|
|
_rep = tmp; | _rep = tmp; |
} | } |
| |
|
void AssignASCII(String& s, const char* str, Uint32 n) |
|
{ |
|
class StringLayout |
|
{ |
|
public: |
|
StringRep* rep; |
|
}; |
|
|
|
StringLayout* that = reinterpret_cast<StringLayout*>(&s); |
|
|
|
_checkNullPointer(str); |
|
|
|
if (n > that->rep->cap || that->rep->refs.get() != 1) |
|
{ |
|
StringRep::unref(that->rep); |
|
that->rep = StringRep::alloc(n); |
|
} |
|
|
|
_copy(that->rep->data, str, n); |
|
that->rep->size = n; |
|
that->rep->data[that->rep->size] = 0; |
|
} |
|
|
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |
| |
/* | /* |
|
|
This avoids slower UTF8 processing when not needed. | This avoids slower UTF8 processing when not needed. |
| |
================================================================================ | ================================================================================ |
|
|
TO-DO: |
|
|
|
(+) [DONE] Use PEGASUS_USE_EXPERIMENTAL_INTERFACES |
|
|
|
(+) [DONE] Submit BUG-2754 (Windows buffer limit). |
|
|
|
(+) [DONE] Eliminate char versions of find() and append(). |
|
|
|
(+) [DONE] Remove PEGASUS_MAX_PRINTABLE_CHARACTER from Config.h |
|
|
|
(+) [DONE] Change _next_pow_2() to _roundUpToPow2(). |
|
|
|
(+) [DONE] Change '99' to '2' in StringRep constructor (comment as well). |
|
|
|
(+) [DONE] Comment StringRep allocation layout. |
|
|
|
(+) [DONE] Conceal private inline functions. |
|
|
|
(+) [DONE] Shorten inclusion of StringInline.h in String.h. |
|
|
|
(+) [DONE] Change USE_INTERNAL_INLINE TO DISABLE_INTERNAL_INLINE or get |
|
rid of altogether. |
|
|
|
(+) [DONE] useCamelNotationOnAllFunctionNames. |
|
|
|
(+) [DONE] Check for overlow condition in StringRep::alloc(). |
|
|
|
(+) [DONE] Remove tabs (used vim ":set expandtab" and ":retab"). |
|
|
|
(+) [DONE] Fix throw-related memory leak. |
|
|
|
(+) [DONE] Look at PEP223 for coding security guidelines. |
|
|
|
(+) [DONE] Use old AtomicInt for now (new AtomicInt part of bug #4250). |
|
|
|
(+) [DONE] Removed appendASCII() and the ASCII form of the constructor. |
|
|
|
(+) DOC++ String.h - will open new bug? |
|
|
|
(+) Added PEGASUS_DISABLE_INTERNAL_INLINES macro (to permit suppression |
|
on certain platforms). |
|
|
|
================================================================================ |
|
*/ | */ |