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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_xmlhelp.hxx"
#include "db.hxx"
#include <rtl/alloc.h>
#include <cstring>
#include "com/sun/star/io/XSeekable.hpp"
using namespace com::sun::star;
using namespace com::sun::star::uno;
using namespace com::sun::star::io;
namespace berkeleydbproxy {
//----------------------------------------------------------------------------
namespace db_internal
{
static inline int check_error(int dberr, const char * where)
{
(void)where;
return dberr;
}
}
void DBData::copyToBuffer( const char* pSrcData, int nSize )
{
m_nSize = nSize;
delete [] m_pBuffer;
m_pBuffer = new char[m_nSize+1];
memcpy( m_pBuffer, pSrcData, m_nSize );
m_pBuffer[m_nSize] = 0;
}
// DBHelp
bool DBHelp::implReadLenAndData( const char* pData, int& riPos, DBData& rValue )
{
bool bSuccess = false;
// Read key len
const char* pStartPtr = pData + riPos;
char* pEndPtr;
sal_Int32 nKeyLen = strtol( pStartPtr, &pEndPtr, 16 );
if( pEndPtr == pStartPtr )
return bSuccess;
riPos += (pEndPtr - pStartPtr) + 1;
const char* pKeySrc = pData + riPos;
rValue.copyToBuffer( pKeySrc, nKeyLen );
riPos += nKeyLen + 1;
bSuccess = true;
return bSuccess;
}
void DBHelp::createHashMap( bool bOptimizeForPerformance )
{
releaseHashMap();
if( bOptimizeForPerformance )
{
if( m_pStringToDataMap != NULL )
return;
m_pStringToDataMap = new StringToDataMap();
}
else
{
if( m_pStringToValPosMap != NULL )
return;
m_pStringToValPosMap = new StringToValPosMap();
}
Reference< XInputStream > xIn = m_xSFA->openFileRead( m_aFileName );
if( xIn.is() )
{
Sequence< sal_Int8 > aData;
sal_Int32 nSize = m_xSFA->getSize( m_aFileName );
sal_Int32 nRead = xIn->readBytes( aData, nSize );
const char* pData = (const char*)aData.getConstArray();
int iPos = 0;
while( iPos < nRead )
{
DBData aDBKey;
if( !implReadLenAndData( pData, iPos, aDBKey ) )
break;
rtl::OString aOKeyStr = aDBKey.getData();
// Read val len
const char* pStartPtr = pData + iPos;
char* pEndPtr;
sal_Int32 nValLen = strtol( pStartPtr, &pEndPtr, 16 );
if( pEndPtr == pStartPtr )
break;
iPos += (pEndPtr - pStartPtr) + 1;
if( bOptimizeForPerformance )
{
const char* pValSrc = pData + iPos;
rtl::OString aValStr( pValSrc, nValLen );
(*m_pStringToDataMap)[aOKeyStr] = aValStr;
}
else
{
// store value start position
(*m_pStringToValPosMap)[aOKeyStr] = std::pair<int,int>( iPos, nValLen );
}
iPos += nValLen + 1;
}
xIn->closeInput();
}
}
void DBHelp::releaseHashMap( void )
{
if( m_pStringToDataMap != NULL )
{
delete m_pStringToDataMap;
m_pStringToDataMap = NULL;
}
if( m_pStringToValPosMap != NULL )
{
delete m_pStringToValPosMap;
m_pStringToValPosMap = NULL;
}
}
bool DBHelp::getValueForKey( const rtl::OString& rKey, DBData& rValue )
{
bool bSuccess = false;
if( !m_xSFA.is() )
return bSuccess;
try
{
if( m_pStringToDataMap == NULL && m_pStringToValPosMap == NULL )
{
bool bOptimizeForPerformance = false;
createHashMap( bOptimizeForPerformance );
}
if( m_pStringToValPosMap != NULL )
{
StringToValPosMap::const_iterator it = m_pStringToValPosMap->find( rKey );
if( it != m_pStringToValPosMap->end() )
{
const std::pair<int,int>& rValPair = it->second;
int iValuePos = rValPair.first;
int nValueLen = rValPair.second;
Reference< XInputStream > xIn = m_xSFA->openFileRead( m_aFileName );
if( xIn.is() )
{
Reference< XSeekable > xXSeekable( xIn, UNO_QUERY );
if( xXSeekable.is() )
{
xXSeekable->seek( iValuePos );
Sequence< sal_Int8 > aData;
sal_Int32 nRead = xIn->readBytes( aData, nValueLen );
if( nRead == nValueLen )
{
const char* pData = (const sal_Char*)aData.getConstArray();
rValue.copyToBuffer( pData, nValueLen );
bSuccess = true;
}
}
xIn->closeInput();
}
}
}
else if( m_pStringToDataMap != NULL )
{
StringToDataMap::const_iterator it = m_pStringToDataMap->find( rKey );
if( it != m_pStringToDataMap->end() )
{
const rtl::OString& rValueStr = it->second;
int nValueLen = rValueStr.getLength();
const char* pData = rValueStr.getStr();
rValue.copyToBuffer( pData, nValueLen );
bSuccess = true;
}
}
}
catch( Exception & )
{
bSuccess = false;
}
return bSuccess;
}
bool DBHelp::startIteration( void )
{
bool bSuccess = false;
sal_Int32 nSize = m_xSFA->getSize( m_aFileName );
Reference< XInputStream > xIn = m_xSFA->openFileRead( m_aFileName );
if( xIn.is() )
{
m_nItRead = xIn->readBytes( m_aItData, nSize );
if( m_nItRead == nSize )
{
bSuccess = true;
m_pItData = (const char*)m_aItData.getConstArray();
m_iItPos = 0;
}
else
{
stopIteration();
}
}
return bSuccess;
}
bool DBHelp::getNextKeyAndValue( DBData& rKey, DBData& rValue )
{
bool bSuccess = false;
if( m_iItPos < m_nItRead )
{
if( implReadLenAndData( m_pItData, m_iItPos, rKey ) )
{
if( implReadLenAndData( m_pItData, m_iItPos, rValue ) )
bSuccess = true;
}
}
return bSuccess;
}
void DBHelp::stopIteration( void )
{
m_aItData = Sequence<sal_Int8>();
m_pItData = NULL;
m_nItRead = -1;
m_iItPos = -1;
}
Db::Db()
{
db_internal::check_error( db_create(&m_pDBP,0,0),"Db::Db" );
m_pDBHelp = NULL;
}
Db::~Db()
{
if (m_pDBP)
{
// should not happen
// TODO: add assert
}
delete m_pDBHelp;
}
int Db::close(u_int32_t flags)
{
int error = m_pDBP->close(m_pDBP,flags);
m_pDBP = 0;
return db_internal::check_error(error,"Db::close");
}
int Db::open(DB_TXN *txnid,
const char *file,
const char *database,
DBTYPE type,
u_int32_t flags,
int mode)
{
int err = m_pDBP->open(m_pDBP,txnid,file,database,type,flags,mode);
return db_internal::check_error( err,"Db::open" );
}
int Db::get(DB_TXN *txnid, Dbt *key, Dbt *data, u_int32_t flags)
{
int err = m_pDBP->get(m_pDBP,txnid,key,data,flags);
// these are non-exceptional outcomes
if (err != DB_NOTFOUND && err != DB_KEYEMPTY)
db_internal::check_error( err,"Db::get" );
return err;
}
int Db::cursor(DB_TXN *txnid, Dbc **cursorp, u_int32_t flags)
{
DBC * dbc = 0;
int error = m_pDBP->cursor(m_pDBP,txnid,&dbc,flags);
if (!db_internal::check_error(error,"Db::cursor"))
*cursorp = new Dbc(dbc);
return error;
}
//----------------------------------------------------------------------------
Dbc::Dbc(DBC * dbc)
: m_pDBC(dbc)
{
}
Dbc::~Dbc()
{
}
int Dbc::close()
{
int err = m_pDBC->c_close(m_pDBC);
delete this;
return db_internal::check_error( err,"Dbcursor::close" );
}
int Dbc::get(Dbt *key, Dbt *data, u_int32_t flags)
{
int err = m_pDBC->c_get(m_pDBC,key,data,flags);
// these are non-exceptional outcomes
if (err != DB_NOTFOUND && err != DB_KEYEMPTY)
db_internal::check_error( err, "Dbcursor::get" );
return err;
}
//----------------------------------------------------------------------------
Dbt::Dbt()
{
using namespace std;
DBT * thispod = this;
memset(thispod, 0, sizeof *thispod);
}
Dbt::Dbt(void *data_arg, u_int32_t size_arg)
{
using namespace std;
DBT * thispod = this;
memset(thispod, 0, sizeof *thispod);
this->set_data(data_arg);
this->set_size(size_arg);
}
Dbt::~Dbt()
{
}
void * Dbt::get_data() const
{
return this->data;
}
void Dbt::set_data(void *value)
{
this->data = value;
}
u_int32_t Dbt::get_size() const
{
return this->size;
}
void Dbt::set_size(u_int32_t value)
{
this->size = value;
}
void Dbt::set_flags(u_int32_t value)
{
this->flags = value;
}
} // namespace ecomp
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|