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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
/* -*- 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 .
*/
#include "buffer.hxx"
#include "sbcomp.hxx"
const static sal_uInt32 UP_LIMIT=0xFFFFFF00L;
// The SbiBuffer will be expanded in increments of at least 16 Bytes.
// This is necessary, because many classes emanate from a buffer length
// of x*16 Bytes.
SbiBuffer::SbiBuffer( SbiParser* p, short n )
{
pParser = p;
n = ( (n + 15 ) / 16 ) * 16;
if( !n ) n = 16;
pBuf = NULL;
pCur = NULL;
nInc = n;
nSize =
nOff = 0;
}
SbiBuffer::~SbiBuffer()
{
delete[] pBuf;
}
// Reach out the buffer
// This lead to the deletion of the buffer!
char* SbiBuffer::GetBuffer()
{
char* p = pBuf;
pBuf = NULL;
pCur = NULL;
return p;
}
// Test, if the buffer can contain n Bytes.
// In case of doubt it will be enlarged
bool SbiBuffer::Check( sal_Int32 n )
{
if( !n )
{
return true;
}
if( nOff + n > nSize )
{
if( nInc == 0 )
{
return false;
}
sal_Int32 nn = 0;
while( nn < n )
{
nn = nn + nInc;
}
char* p;
if( ( nSize + nn ) > UP_LIMIT )
{
p = NULL;
}
else
{
p = new char [nSize + nn];
}
if( !p )
{
pParser->Error( SbERR_PROG_TOO_LARGE );
nInc = 0;
delete[] pBuf; pBuf = NULL;
return false;
}
else
{
if( nSize ) memcpy( p, pBuf, nSize );
delete[] pBuf;
pBuf = p;
pCur = pBuf + nOff;
nSize = nSize + nn;
}
}
return true;
}
// Patch of a Location
void SbiBuffer::Patch( sal_uInt32 off, sal_uInt32 val )
{
if( ( off + sizeof( sal_uInt32 ) ) < nOff )
{
sal_uInt16 val1 = static_cast<sal_uInt16>( val & 0xFFFF );
sal_uInt16 val2 = static_cast<sal_uInt16>( val >> 16 );
sal_uInt8* p = (sal_uInt8*) pBuf + off;
*p++ = (char) ( val1 & 0xFF );
*p++ = (char) ( val1 >> 8 );
*p++ = (char) ( val2 & 0xFF );
*p = (char) ( val2 >> 8 );
}
}
// Forward References upon label und procedures
// establish a linkage. The beginning of the linkage is at the passed parameter,
// the end of the linkage is 0.
void SbiBuffer::Chain( sal_uInt32 off )
{
if( off && pBuf )
{
sal_uInt8 *ip;
sal_uInt32 i = off;
sal_uInt32 val1 = (nOff & 0xFFFF);
sal_uInt32 val2 = (nOff >> 16);
do
{
ip = (sal_uInt8*) pBuf + i;
sal_uInt8* pTmp = ip;
i = *pTmp++; i |= *pTmp++ << 8; i |= *pTmp++ << 16; i |= *pTmp++ << 24;
if( i >= nOff )
{
pParser->Error( SbERR_INTERNAL_ERROR, "BACKCHAIN" );
break;
}
*ip++ = (char) ( val1 & 0xFF );
*ip++ = (char) ( val1 >> 8 );
*ip++ = (char) ( val2 & 0xFF );
*ip = (char) ( val2 >> 8 );
} while( i );
}
}
bool SbiBuffer::operator +=( sal_Int8 n )
{
if( Check( 1 ) )
{
*pCur++ = (char) n;
nOff += 1;
return true;
}
else
{
return false;
}
}
bool SbiBuffer::operator +=( sal_uInt8 n )
{
if( Check( 1 ) )
{
*pCur++ = (char) n;
nOff += 1;
return true;
}
else
{
return false;
}
}
bool SbiBuffer::operator +=( sal_Int16 n )
{
if( Check( 2 ) )
{
*pCur++ = (char) ( n & 0xFF );
*pCur++ = (char) ( n >> 8 );
nOff += 2;
return true;
}
else
{
return false;
}
}
bool SbiBuffer::operator +=( sal_uInt16 n )
{
if( Check( 2 ) )
{
*pCur++ = (char) ( n & 0xFF );
*pCur++ = (char) ( n >> 8 );
nOff += 2;
return true;
}
else
{
return false;
}
}
bool SbiBuffer::operator +=( sal_uInt32 n )
{
if( Check( 4 ) )
{
sal_uInt16 n1 = static_cast<sal_uInt16>( n & 0xFFFF );
sal_uInt16 n2 = static_cast<sal_uInt16>( n >> 16 );
if ( operator +=( n1 ) && operator +=( n2 ) )
{
return true;
}
return true;
}
else
{
return false;
}
}
bool SbiBuffer::operator +=( sal_Int32 n )
{
return operator +=( (sal_uInt32) n );
}
bool SbiBuffer::operator +=( const OUString& n )
{
sal_uInt32 len = n.getLength() + 1;
if( Check( len ) )
{
OString aByteStr(OUStringToOString(n, osl_getThreadTextEncoding()));
memcpy( pCur, aByteStr.getStr(), len );
pCur += len;
nOff += len;
return true;
}
else
{
return false;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
