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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: BlockManager.cxx,v $
*
* $Revision: 1.6 $
*
* last change: $Author: obo $ $Date: 2006-09-17 01:14:53 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_xmlhelp.hxx"
#ifndef _XMLSEARCH_DB_BLOCKMANAGER_HXX_
#include <db/BlockManager.hxx>
#endif
#ifndef _XMLEARCH_UTIL_RANDOMACCESSSTREAM_HXX_
#include <util/RandomAccessStream.hxx>
#endif
using namespace ::xmlsearch;
using namespace ::xmlsearch::excep;
using namespace ::xmlsearch::db;
BlockManager::BlockManager( DBEnv* dbenv ) throw( IOException )
: dbenv_( dbenv ),
oldest_( 0 ),
newest_( 0 ),
blockused_( 0 ),
blockTable_( dbenv_ ? dbenv_->getBlockCount() : 0 ) // Hardcoded headerlen?
{
if( blockTable_.size() )
mapStorage2Memory( 0 );
else
{
delete dbenv_;
throw IOException( rtl::OUString::createFromAscii( "BlockManager::BlockManager -> no blockcount" ) );
}
}
BlockManager::~BlockManager()
{
delete dbenv_;
}
void BlockManager::lock( sal_Int32 blNum ) throw( excep::IllegalIndexException )
{
if( blNum < 0 || blockTable_.size() <= sal_uInt32( blNum ) )
throw excep::IllegalIndexException( rtl::OUString::createFromAscii( "BlockManager::lock ->" ) );
blockTable_[ blNum ].lock();
}
void BlockManager::unlock( sal_Int32 blNum ) throw( excep::IllegalIndexException )
{
if( blNum < 0 || blockTable_.size() <= sal_uInt32( blNum ) )
throw excep::IllegalIndexException( rtl::OUString::createFromAscii( "BlockManager::unlock ->" ) );
blockTable_[ blNum ].unlock();
}
bool BlockManager::isLocked( sal_Int32 blNum ) throw( excep::IllegalIndexException )
{
if( blNum < 0 || blockTable_.size() <= sal_uInt32( blNum ) )
throw excep::IllegalIndexException( rtl::OUString::createFromAscii( "BlockManager::isLocked ->" ) );
return blockTable_[ blNum ].isLocked();
}
void BlockManager::modf( sal_Int32 blNum ) throw( excep::IllegalIndexException )
{
if( blNum < 0 || blockTable_.size() <= sal_uInt32( blNum ) )
throw excep::IllegalIndexException( rtl::OUString::createFromAscii( "BlockManager::modf ->" ) );
blockTable_[ blNum ].modf();
}
void BlockManager::close() throw( excep::IOException )
{
if( ! dbenv_ )
throw excep::IOException( rtl::OUString::createFromAscii( "BlockManager::save -> no environment" ) );
for( sal_uInt32 i = 0; i < blockTable_.size(); ++i )
if( blockTable_[i].isModf() )
blockTable_[i].write( dbenv_,i );
}
const Block* BlockManager::accessBlock( sal_Int32 blNum ) throw( excep::NoSuchBlock )
{
if( blNum < 0 || blockTable_.size() <= sal_uInt32( blNum ) )
throw excep::IllegalIndexException(
rtl::OUString::createFromAscii(
"BlockManager:accessBlock -> index out of range" ) );
if( blockTable_[ blNum ].is() )
moveToFront( blNum );
else if( blockused_ < dbenv_->getMaximumBlockCount() )
mapStorage2Memory( blNum );
else
remap( blNum );
return blockTable_[ blNum ].getBlock( );
}
void BlockManager::moveToFront( sal_Int32 blNum )
{
if( blNum == oldest_ )
{
oldest_ = blockTable_[blNum].next();
blockTable_[blNum].prev( newest_ );
blockTable_[newest_].next( blNum );
newest_ = blNum;
}
else if( blNum != newest_ )
{
blockTable_[blockTable_[blNum].next()].prev( blockTable_[blNum].prev() );
blockTable_[blockTable_[blNum].prev()].next( blockTable_[blNum].next() );
blockTable_[blNum].prev( newest_ );
blockTable_[newest_].next( blNum );
newest_ = blNum;
}
}
// maps file into buffer
void BlockManager::mapStorage2Memory( sal_Int32 blNum ) throw( excep::IOException )
{
add( blNum );
blockTable_[blNum].read( dbenv_,blNum );
}
void BlockManager::remap( sal_Int32 blNum ) throw( excep::XmlSearchException )
{
sal_Int32 idx = oldest_;
while( blockTable_[ idx ].isLocked() && idx != newest_ )
idx = blockTable_[ idx ].next();
if( blockTable_[ idx ].isLocked() )
throw excep::XmlSearchException(
rtl::OUString::createFromAscii( "everything locked" ) );
if( blockTable_[ idx].isModf() )
blockTable_[ idx ].write( dbenv_,idx );
// delete from double-linked list
if( idx == oldest_ )
oldest_ = blockTable_[ idx ].next();
else if( idx == newest_ )
newest_ = blockTable_[ idx ].prev();
else
{
blockTable_[ blockTable_[ idx ].next() ].prev( blockTable_[ idx ].prev() );
blockTable_[ blockTable_[ idx ].prev() ].next( blockTable_[ idx ].next() );
}
add( blNum );
blockTable_[blNum].add( blockTable_[ idx ].reset() );
}
void BlockManager::add( sal_Int32 blNum )
{
blockTable_[ blNum ].prev( newest_ );
blockTable_[ newest_ ].next( blNum );
newest_ = blNum;
}
void BlockManager::mapBlocks( const BlockProcessor& blProc )
{
sal_Int32 nBlocks = dbenv_->getBlockCount();
Block* block = 0;
for (int i = 0; i < nBlocks; i++)
{
dbenv_->read( i,block );
blProc.process( block );
}
}
|
