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
|
/* -*- 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 "db.hxx"
#include <cstring>
#include <utility>
#include <com/sun/star/io/XSeekable.hpp>
#include <tools/inetmime.hxx>
using namespace com::sun::star::uno;
using namespace com::sun::star::io;
namespace {
//TODO: Replace with C++17 std::from_chars once available:
std::pair<sal_Int32, char const *> readInt32(char const * begin, char const * end) {
sal_Int32 n = 0;
for (; begin != end; ++begin) {
auto const w = INetMIME::getHexWeight(static_cast<unsigned char>(*begin));
if (w == -1) {
break;
}
n = 16 * n + w;
}
return {n, begin};
}
}
namespace helpdatafileproxy {
void HDFData::copyToBuffer( const char* pSrcData, int nSize )
{
m_nSize = nSize;
m_pBuffer.reset( new char[m_nSize+1] );
memcpy( m_pBuffer.get(), pSrcData, m_nSize );
m_pBuffer[m_nSize] = 0;
}
// Hdf
bool Hdf::implReadLenAndData( const char* pData, char const * end, int& riPos, HDFData& rValue )
{
bool bSuccess = false;
// Read key len
const char* pStartPtr = pData + riPos;
auto [nKeyLen, pEndPtr] = readInt32(pStartPtr, end);
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 Hdf::createHashMap( bool bOptimizeForPerformance )
{
releaseHashMap();
if( bOptimizeForPerformance )
{
if( m_pStringToDataMap != nullptr )
return;
m_pStringToDataMap.reset(new StringToDataMap);
}
else
{
if( m_pStringToValPosMap != nullptr )
return;
m_pStringToValPosMap.reset(new StringToValPosMap);
}
Reference< XInputStream > xIn = m_xSFA->openFileRead( m_aFileURL );
if( !xIn.is() )
return;
Sequence< sal_Int8 > aData;
sal_Int32 nSize = m_xSFA->getSize( m_aFileURL );
sal_Int32 nRead = xIn->readBytes( aData, nSize );
const char* pData = reinterpret_cast<const char*>(aData.getConstArray());
auto const end = pData + nRead;
int iPos = 0;
while( iPos < nRead )
{
HDFData aDBKey;
if( !implReadLenAndData( pData, end, iPos, aDBKey ) )
break;
OString aOKeyStr = aDBKey.getData();
// Read val len
const char* pStartPtr = pData + iPos;
auto [nValLen, pEndPtr] = readInt32(pStartPtr, end);
if( pEndPtr == pStartPtr )
break;
iPos += (pEndPtr - pStartPtr) + 1;
if( bOptimizeForPerformance )
{
const char* pValSrc = pData + iPos;
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 Hdf::releaseHashMap()
{
m_pStringToDataMap.reset();
m_pStringToValPosMap.reset();
}
Hdf::~Hdf()
{
}
bool Hdf::getValueForKey( const OString& rKey, HDFData& rValue )
{
bool bSuccess = false;
if( !m_xSFA.is() )
return bSuccess;
try
{
if( m_pStringToDataMap == nullptr && m_pStringToValPosMap == nullptr )
{
createHashMap( false/*bOptimizeForPerformance*/ );
}
if( m_pStringToValPosMap != nullptr )
{
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_aFileURL );
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 = reinterpret_cast<const char*>(aData.getConstArray());
rValue.copyToBuffer( pData, nValueLen );
bSuccess = true;
}
}
xIn->closeInput();
}
}
}
else if( m_pStringToDataMap != nullptr )
{
StringToDataMap::const_iterator it = m_pStringToDataMap->find( rKey );
if( it != m_pStringToDataMap->end() )
{
const 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 Hdf::startIteration()
{
bool bSuccess = false;
sal_Int32 nSize = m_xSFA->getSize( m_aFileURL );
Reference< XInputStream > xIn = m_xSFA->openFileRead( m_aFileURL );
if( xIn.is() )
{
m_nItRead = xIn->readBytes( m_aItData, nSize );
if( m_nItRead == nSize )
{
bSuccess = true;
m_iItPos = 0;
}
else
{
stopIteration();
}
}
return bSuccess;
}
bool Hdf::getNextKeyAndValue( HDFData& rKey, HDFData& rValue )
{
bool bSuccess = false;
if( m_iItPos < m_nItRead )
{
auto const p = reinterpret_cast<const char*>(m_aItData.getConstArray());
if( implReadLenAndData( p, p + m_aItData.size(), m_iItPos, rKey ) )
{
if( implReadLenAndData( p, p + m_aItData.size(), m_iItPos, rValue ) )
bSuccess = true;
}
}
return bSuccess;
}
void Hdf::stopIteration()
{
m_aItData = Sequence<sal_Int8>();
m_nItRead = -1;
m_iItPos = -1;
}
} // end of namespace helpdatafileproxy
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
