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
|
/* -*- 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.
*
************************************************************************/
#include <comphelper/seqstream.hxx>
#include <memory.h> // for memcpy
namespace comphelper
{
using namespace ::com::sun::star::lang;
using namespace ::com::sun::star::io;
using namespace ::com::sun::star::uno;
using namespace ::osl;
//---------------------------------------------------------------------------------------------
// class SequenceInputStream
//---------------------------------------------------------------------------------------------
//------------------------------------------------------------------
SequenceInputStream::SequenceInputStream(const ByteSequence& rData)
: m_aData(rData)
, m_nPos(0)
{
}
// checks if closed, returns available size, not mutex-protected
//------------------------------------------------------------------
inline sal_Int32 SequenceInputStream::avail()
{
if (m_nPos == -1)
throw NotConnectedException(::rtl::OUString(), *this);
return m_aData.getLength() - m_nPos;
}
// com::sun::star::io::XInputStream
//------------------------------------------------------------------
sal_Int32 SAL_CALL SequenceInputStream::readBytes( Sequence<sal_Int8>& aData, sal_Int32 nBytesToRead )
throw(NotConnectedException, BufferSizeExceededException,
IOException, RuntimeException)
{
::osl::MutexGuard aGuard( m_aMutex );
sal_Int32 nAvail = avail();
if (nBytesToRead < 0)
throw BufferSizeExceededException(::rtl::OUString(),*this);
if (nAvail < nBytesToRead)
nBytesToRead = nAvail;
aData.realloc(nBytesToRead);
memcpy(aData.getArray(), m_aData.getConstArray() + m_nPos, nBytesToRead);
m_nPos += nBytesToRead;
return nBytesToRead;
}
//------------------------------------------------------------------
sal_Int32 SAL_CALL SequenceInputStream::readSomeBytes( Sequence<sal_Int8>& aData, sal_Int32 nMaxBytesToRead )
throw(NotConnectedException, BufferSizeExceededException,
IOException, RuntimeException)
{
// all data is available at once
return readBytes(aData, nMaxBytesToRead);
}
//------------------------------------------------------------------
void SAL_CALL SequenceInputStream::skipBytes( sal_Int32 nBytesToSkip )
throw(NotConnectedException, BufferSizeExceededException,
IOException, RuntimeException)
{
::osl::MutexGuard aGuard( m_aMutex );
sal_Int32 nAvail = avail();
if (nBytesToSkip < 0)
throw BufferSizeExceededException(::rtl::OUString(),*this);
if (nAvail < nBytesToSkip)
nBytesToSkip = nAvail;
m_nPos += nBytesToSkip;
}
//------------------------------------------------------------------
sal_Int32 SAL_CALL SequenceInputStream::available( )
throw(NotConnectedException, IOException, RuntimeException)
{
::osl::MutexGuard aGuard( m_aMutex );
return avail();
}
//------------------------------------------------------------------
void SAL_CALL SequenceInputStream::closeInput( )
throw(NotConnectedException, IOException, RuntimeException)
{
if (m_nPos == -1)
throw NotConnectedException(::rtl::OUString(), *this);
m_nPos = -1;
}
void SAL_CALL SequenceInputStream::seek( sal_Int64 location ) throw (IllegalArgumentException, IOException, RuntimeException)
{
if ( location > m_aData.getLength() || location < 0 || location > SAL_MAX_INT32 )
throw IllegalArgumentException();
m_nPos = (sal_Int32) location;
}
sal_Int64 SAL_CALL SequenceInputStream::getPosition() throw (IOException, RuntimeException)
{
return m_nPos;
}
sal_Int64 SAL_CALL SequenceInputStream::getLength( ) throw (IOException, RuntimeException)
{
return m_aData.getLength();
}
//--------------------------------------------------------------------------
OSequenceOutputStream::OSequenceOutputStream(Sequence< sal_Int8 >& _rSeq, double _nResizeFactor, sal_Int32 _nMinimumResize, sal_Int32 _nMaximumResize)
:m_rSequence(_rSeq)
,m_nResizeFactor(_nResizeFactor)
,m_nMinimumResize(_nMinimumResize)
,m_nMaximumResize(_nMaximumResize)
,m_nSize(0) // starting at position 0
,m_bConnected(sal_True)
{
OSL_ENSURE(m_nResizeFactor > 1, "OSequenceOutputStream::OSequenceOutputStream : invalid resize factor !");
OSL_ENSURE((m_nMaximumResize < 0) || (m_nMaximumResize > m_nMinimumResize),
"OSequenceOutputStream::OSequenceOutputStream : these limits don't make any sense !");
if (m_nResizeFactor <= 1)
m_nResizeFactor = 1.3;
if ((m_nMaximumResize >= 0) && (m_nMaximumResize <= m_nMinimumResize))
m_nMaximumResize = m_nMinimumResize * 2;
// this heuristic is as good as any other ... supply better parameters if you don't like it :)
}
//--------------------------------------------------------------------------
void SAL_CALL OSequenceOutputStream::writeBytes( const Sequence< sal_Int8 >& _rData ) throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)
{
MutexGuard aGuard(m_aMutex);
if (!m_bConnected)
throw NotConnectedException();
// ensure the sequence has enoungh space left
if (m_nSize + _rData.getLength() > m_rSequence.getLength())
{
sal_Int32 nCurrentLength = m_rSequence.getLength();
sal_Int32 nNewLength = static_cast< sal_Int32 >(
nCurrentLength * m_nResizeFactor);
if (m_nMinimumResize > nNewLength - nCurrentLength)
// we have a minimum so it's not too inefficient for small sequences and small write requests
nNewLength = nCurrentLength + m_nMinimumResize;
if ((m_nMaximumResize > 0) && (nNewLength - nCurrentLength > m_nMaximumResize))
// such a large step is not allowed
nNewLength = nCurrentLength + m_nMaximumResize;
if (nNewLength < m_nSize + _rData.getLength())
{ // it's not enough .... the data would not fit
// let's take the double amount of the length of the data to be written, as the next write
// request could be as large as this one
sal_Int32 nNewGrowth = _rData.getLength() * 2;
if ((m_nMaximumResize > 0) && (nNewGrowth > m_nMaximumResize))
{ // we came to the limit, again ...
nNewGrowth = m_nMaximumResize;
if (nNewGrowth + nCurrentLength < m_nSize + _rData.getLength())
// but it would not fit if we respect the limit
nNewGrowth = m_nSize + _rData.getLength() - nCurrentLength;
}
nNewLength = nCurrentLength + nNewGrowth;
}
// round it off to the next multiple of 4 ...
nNewLength = (nNewLength + 3) / 4 * 4;
m_rSequence.realloc(nNewLength);
}
OSL_ENSURE(m_rSequence.getLength() >= m_nSize + _rData.getLength(),
"ooops ... the realloc algorithm seems to be wrong :( !");
memcpy(m_rSequence.getArray() + m_nSize, _rData.getConstArray(), _rData.getLength());
m_nSize += _rData.getLength();
}
//--------------------------------------------------------------------------
void SAL_CALL OSequenceOutputStream::flush( ) throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)
{
MutexGuard aGuard(m_aMutex);
if (!m_bConnected)
throw NotConnectedException();
// cut the sequence to the real size
m_rSequence.realloc(m_nSize);
}
//--------------------------------------------------------------------------
void SAL_CALL OSequenceOutputStream::closeOutput( ) throw(NotConnectedException, BufferSizeExceededException, IOException, RuntimeException)
{
MutexGuard aGuard(m_aMutex);
if (!m_bConnected)
throw NotConnectedException();
// cut the sequence to the real size
m_rSequence.realloc(m_nSize);
// and don't allow any further accesses
m_bConnected = sal_False;
}
} // namespace comphelper
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
