1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
static sal_Int32 ImplStringCompareWithoutZero( const STRCODE* pStr1, const STRCODE* pStr2,
sal_Int32 nCount )
{
sal_Int32 nRet = 0;
while ( nCount &&
((nRet = ((sal_Int32)((STRCODEU)*pStr1))-((sal_Int32)((STRCODEU)*pStr2))) == 0) )
{
++pStr1,
++pStr2,
--nCount;
}
return nRet;
}
static STRINGDATA* ImplAllocData( sal_Int32 nLen )
{
STRINGDATA* pData = (STRINGDATA*)rtl_allocateMemory( sizeof(STRINGDATA)+(nLen*sizeof( STRCODE )) );
pData->mnRefCount = 1;
pData->mnLen = nLen;
pData->maStr[nLen] = 0;
return pData;
}
static STRINGDATA* _ImplCopyData( STRINGDATA* pData )
{
unsigned int nSize = sizeof(STRINGDATA)+(pData->mnLen*sizeof( STRCODE ));
STRINGDATA* pNewData = (STRINGDATA*)rtl_allocateMemory( nSize );
memcpy( pNewData, pData, nSize );
pNewData->mnRefCount = 1;
STRING_RELEASE((STRING_TYPE *)pData);
return pNewData;
}
inline void STRING::ImplCopyData()
{
DBG_ASSERT( (mpData->mnRefCount != 0), "String::ImplCopyData() - RefCount == 0" );
// Dereference data if this string is referenced
if ( mpData->mnRefCount != 1 )
mpData = _ImplCopyData( mpData );
}
inline STRCODE* STRING::ImplCopyStringData( STRCODE* pStr )
{
if ( mpData->mnRefCount != 1 ) {
DBG_ASSERT( (pStr >= mpData->maStr) &&
((pStr-mpData->maStr) < mpData->mnLen),
"ImplCopyStringData - pStr from other String-Instanz" );
unsigned int nIndex = (unsigned int)(pStr-mpData->maStr);
mpData = _ImplCopyData( mpData );
pStr = mpData->maStr + nIndex;
}
return pStr;
}
inline sal_Int32 ImplGetCopyLen( sal_Int32 nStrLen, sal_Int32 nCopyLen )
{
OSL_ASSERT(nStrLen <= STRING_MAXLEN && nCopyLen <= STRING_MAXLEN);
if ( nCopyLen > STRING_MAXLEN-nStrLen )
nCopyLen = STRING_MAXLEN-nStrLen;
return nCopyLen;
}
STRING::STRING()
: mpData(NULL)
{
STRING_NEW((STRING_TYPE **)&mpData);
}
STRING::STRING( const STRING& rStr )
{
// Set pointer to argument string and increase reference counter
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
mpData = rStr.mpData;
}
STRING::STRING( const STRING& rStr, xub_StrLen nPos, xub_StrLen nLen )
: mpData( NULL )
{
if ( nPos > rStr.mpData->mnLen )
nLen = 0;
else
{
// correct length if necessary
sal_Int32 nMaxLen = rStr.mpData->mnLen-nPos;
if ( nLen > nMaxLen )
nLen = static_cast< xub_StrLen >(nMaxLen);
}
if ( nLen )
{
// Increase reference counter if it suffices
if ( (nPos == 0) && (nLen == rStr.mpData->mnLen) )
{
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
mpData = rStr.mpData;
}
else
{
// otherwise, copy string
mpData = ImplAllocData( nLen );
memcpy( mpData->maStr, rStr.mpData->maStr+nPos, nLen*sizeof( STRCODE ) );
}
}
else
{
STRING_NEW((STRING_TYPE **)&mpData);
}
}
STRING::~STRING()
{
// free string data
STRING_RELEASE((STRING_TYPE *)mpData);
}
STRING& STRING::Append( const STRING& rStr )
{
// Assignment is sufficient if string is empty
sal_Int32 nLen = mpData->mnLen;
if ( !nLen )
{
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
STRING_RELEASE((STRING_TYPE *)mpData);
mpData = rStr.mpData;
}
else
{
// Detect overflow
sal_Int32 nCopyLen = ImplGetCopyLen( nLen, rStr.mpData->mnLen );
if ( nCopyLen )
{
// allocate string of new size
STRINGDATA* pNewData = ImplAllocData( nLen+nCopyLen );
// copy string
memcpy( pNewData->maStr, mpData->maStr, nLen*sizeof( STRCODE ) );
memcpy( pNewData->maStr+nLen, rStr.mpData->maStr, nCopyLen*sizeof( STRCODE ) );
// free old string
STRING_RELEASE((STRING_TYPE *)mpData);
mpData = pNewData;
}
}
return *this;
}
void STRING::SetChar( xub_StrLen nIndex, STRCODE c )
{
DBG_ASSERT( nIndex < mpData->mnLen, "String::SetChar() - nIndex > String.Len()" );
// copy data if necessary
ImplCopyData();
mpData->maStr[nIndex] = c;
}
STRING& STRING::Insert( const STRING& rStr, xub_StrLen nIndex )
{
// detect overflow
sal_Int32 nCopyLen = ImplGetCopyLen( mpData->mnLen, rStr.mpData->mnLen );
if ( !nCopyLen )
return *this;
// adjust index if necessary
if ( nIndex > mpData->mnLen )
nIndex = static_cast< xub_StrLen >(mpData->mnLen);
// allocate string of new size
STRINGDATA* pNewData = ImplAllocData( mpData->mnLen+nCopyLen );
// copy string
memcpy( pNewData->maStr, mpData->maStr, nIndex*sizeof( STRCODE ) );
memcpy( pNewData->maStr+nIndex, rStr.mpData->maStr, nCopyLen*sizeof( STRCODE ) );
memcpy( pNewData->maStr+nIndex+nCopyLen, mpData->maStr+nIndex,
(mpData->mnLen-nIndex)*sizeof( STRCODE ) );
// free old string
STRING_RELEASE((STRING_TYPE *)mpData);
mpData = pNewData;
return *this;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
