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
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
|
/*
* Copyright (C) 2007-2010 Xagasoft, All rights reserved.
*
* This file is part of the libbu++ library and is released under the
* terms of the license contained in the file LICENSE.
*/
#include "bu/myriad.h"
#include "bu/stream.h"
#include "bu/myriadstream.h"
#include <stdio.h>
#include "bu/sio.h"
using Bu::sio;
using Bu::Fmt;
#define Myriad_MAGIC_CODE ((unsigned char *)"\xFF\xC3\x99\xBD")
namespace Bu
{
subExceptionDef( MyriadException )
template<typename t> t blkDiv( t total, t block ) {
return (total/block)+((total%block==0)?(0):(1));
}
}
Bu::Myriad::Myriad( Bu::Stream &sStore, int iBlockSize, int iPreallocate ) :
sStore( sStore ),
iBlockSize( iBlockSize ),
iBlocks( 0 ),
iUsed( 0 ),
bHeaderChanged( false )
{
try
{
initialize();
}
catch( Bu::MyriadException &e )
{
if( e.getErrorCode() == MyriadException::emptyStream )
{
initialize( iBlockSize, iPreallocate );
}
else
{
throw;
}
}
}
Bu::Myriad::~Myriad()
{
if( !hActiveBlocks.isEmpty() )
{
sio << "Bu::Myriad::~Myriad(): Error: There are "
<< hActiveBlocks.getSize() << " unsynced blocks!" << sio.nl;
}
sync();
for( StreamArray::iterator i = aStreams.begin(); i; i++ )
{
delete *i;
}
}
void Bu::Myriad::sync()
{
updateHeader();
for( BlockHash::iterator i = hActiveBlocks.begin(); i; i++ )
{
if( (*i)->bChanged )
{
syncBlock( *i );
}
}
}
void Bu::Myriad::initialize()
{
sStore.setPosEnd( 0 );
int iSize = sStore.tell();
sStore.setPos( 0 );
unsigned char buf[4];
if( sStore.read( buf, 4 ) < 4 )
throw MyriadException( MyriadException::emptyStream,
"Input stream appears to be empty.");
if( memcmp( buf, Myriad_MAGIC_CODE, 4 ) )
{
throw MyriadException( MyriadException::invalidFormat,
"Stream does not appear to be a valid Myriad format.");
}
sStore.read( buf, 2 );
if( buf[0] != 1 )
throw MyriadException( MyriadException::badVersion,
"We can only handle version 1 for now.");
if( buf[1] != 32 )
throw MyriadException( MyriadException::invalidWordSize,
"We can only handle 32-bit words at the moment.");
sStore.read( &iBlockSize, 4 );
int iStreams;
sStore.read( &iStreams, 4 );
iBlocks = iSize/iBlockSize;
//sio << "Myriad: iSize=" << iSize << ", iBlockSize=" << iBlockSize
// << ", iBlocks=" << iBlocks << ", iStreams=" << iStreams << sio.nl;
int iHeaderSize = 14 + 8 + 4;
int iHeaderBlocks = 0; //blkDiv( iHeaderSize+4, iBlockSize );
while( iHeaderSize > iHeaderBlocks*iBlockSize )
{
iHeaderBlocks = blkDiv( iHeaderSize+4, iBlockSize );
iHeaderSize = 14 + 8 + 4*iHeaderBlocks;
}
//sio << "Myriad: iHeaderSize=" << iHeaderSize
// << ", iHeaderBlocks=" << iHeaderBlocks << sio.nl;
Stream *pFakeHdr = new Stream;
pFakeHdr->iId = 0;
pFakeHdr->iSize = iHeaderSize;
for( int j = 0; j < iHeaderBlocks; j++ )
{
pFakeHdr->aBlocks.append( j );
}
bsBlockUsed.setSize( iBlocks, true );
bool bCanSkip = false; // Can skip around, post initial header stream i/o
MyriadStream *pIn = new MyriadStream( *this, pFakeHdr );
pIn->setPos( sStore.tell() );
for( int j = 0; j < iStreams; j++ )
{
aStreams.append( new Stream() );
Stream &s = *aStreams[j];
pIn->read( &s.iId, 4 );
pIn->read( &s.iSize, 4 );
int iSBlocks = blkDiv(s.iSize, iBlockSize);
// sio << "Myriad: - Stream::iId=" << s.iId
// << ", Stream::iSize=" << s.iSize
// << ", Stream::aBlocks=" << iSBlocks
// << ", pIn->tell()=" << pIn->tell() << sio.nl;
for( int k = 0; k < iSBlocks; k++ )
{
int iBId;
pIn->read( &iBId, 4 );
// sio << "Myriad: - iBId=" << iBId
// << ", iStartPos=" << iBId*iBlockSize
// << ", pIn->tell()=" << pIn->tell() << sio.nl;
s.aBlocks.append( iBId );
bsBlockUsed.setBit( iBId );
if( (j == 0 && k == iHeaderBlocks-1) )
{
// sio << "Myriad: - End of prepartition, unlocking skipping."
// << sio.nl;
bCanSkip = true;
MyriadStream *pTmp = new MyriadStream( *this, aStreams[0] );
// sio << "Myriad - Position = " << pIn->tell() << sio.nl;
pTmp->setPos( pIn->tell() );
delete pIn;
delete pFakeHdr;
pIn = pTmp;
}
}
}
delete pIn;
//sio << "Myriad: Blocks used: " << bsBlockUsed.toString() << sio.nl;
}
void Bu::Myriad::initialize( int iBlockSize, int iPreAllocate )
{
int iHeaderSize = 14 + 8 + 4;
int iHeaderBlocks = 0; //blkDiv( iHeaderSize+4, iBlockSize );
char cBuf = 1;
int iBuf = 0;
Stream *pStr = new Stream;
pStr->iId = 0;
while( iHeaderSize > iHeaderBlocks*iBlockSize )
{
iHeaderBlocks = blkDiv( iHeaderSize+4, iBlockSize );
iHeaderSize = 14 + 8 + 4*iHeaderBlocks;
}
iPreAllocate += iHeaderBlocks;
//sio << "Myriad: iHeaderSize=" << iHeaderSize << ", iBlockSize="
// << iBlockSize << ", iHeaderBlocks=" << iHeaderBlocks << sio.nl;
bsBlockUsed.setSize( iPreAllocate, true );
char *pBlock = new char[iBlockSize];
memset( pBlock, 0, iBlockSize );
for( int j = 0; j < iPreAllocate; j++ )
{
sStore.write( pBlock, iBlockSize );
}
delete[] (char *)pBlock;
sStore.setPos( 0 );
// Magic number
sStore.write( Myriad_MAGIC_CODE, 4 );
// Version (0)
sStore.write( &cBuf, 1 );
// Bits per int
cBuf = 32;
sStore.write( &cBuf, 1 );
// The size of each block
sStore.write( &iBlockSize, 4 );
iBuf = 1;
// The number of streams
sStore.write( &iBuf, 4 );
// Stream header
iBuf = 0;
sStore.write( &iBuf, 4 );
sStore.write( &iHeaderSize, 4 );
for( iBuf = 0; iBuf < iHeaderBlocks; iBuf++ )
{
sStore.write( &iBuf, 4 );
}
this->iBlockSize = iBlockSize;
this->iBlocks = iPreAllocate;
pStr->iSize = sStore.tell();
// sio << "Myriad: Actual end of header stream = " << pStr->iSize << sio.nl;
pStr->iSize = iHeaderSize;
for( int j = 0; j < iHeaderBlocks; j++ )
{
pStr->aBlocks.append( j );
bsBlockUsed.setBit( j );
}
aStreams.append( pStr );
//sio << bsBlockUsed.toString() << " - " << pStr->aBlocks << sio.nl;
bHeaderChanged = true;
//hStreams.insert( 0, BlockArray( 0 ) );
}
void Bu::Myriad::updateHeader()
{
if( bHeaderChanged == false )
return;
if( !sStore.canWrite() )
return;
char cBuf;
int iBuf;
//for( StreamArray::iterator i = aStreams.begin(); i; i++ )
//{
// sio << "Myriad: Stream " << Fmt(4) << (*i)->iId << ": " << (*i)->aBlocks << sio.nl;
//}
// Compute the new size of the header.
int iHeaderSize = 14 + 8*aStreams.getSize();
// sio << "Myriad: updateHeader: aStreams.getSize() = " << aStreams.getSize()
// << sio.nl;
for( StreamArray::iterator i = aStreams.begin(); i; i++ )
{
iHeaderSize += 4*(*i)->aBlocks.getSize();
// sio << "Myriad: updateHeader: (*i)->aBlocks.getSize() = "
// << (*i)->aBlocks.getSize() << sio.nl;
}
int iNewBlocks = blkDiv( iHeaderSize, iBlockSize );
while( iNewBlocks > aStreams[0]->aBlocks.getSize() )
{
int iBlock = findEmptyBlock();
// sio << "Myriad: updateHeader: Appending block " << iBlock
// << " to header." << sio.nl;
aStreams[0]->aBlocks.append( iBlock );
bsBlockUsed.setBit( iBlock );
iHeaderSize += 4;
iNewBlocks = blkDiv( iHeaderSize, iBlockSize );
}
aStreams[0]->iSize = iHeaderSize;
// sio << "Myriad: updateHeader: iHeaderSize=" << iHeaderSize
// << ", iNewBlocks=" << iNewBlocks << ", curBlocks="
// << aStreams[0]->aBlocks.getSize() << sio.nl;
MyriadStream sHdr( *this, aStreams[0] );
sHdr.write( Myriad_MAGIC_CODE, 4 );
// Version (1)
cBuf = 1;
sHdr.write( &cBuf, 1 );
// Bits per int
cBuf = 32;
sHdr.write( &cBuf, 1 );
// The size of each block
sHdr.write( &iBlockSize, 4 );
iBuf = aStreams.getSize();
// The number of streams
sHdr.write( &iBuf, 4 );
for( StreamArray::iterator i = aStreams.begin(); i; i++ )
{
sHdr.write( &(*i)->iId, 4 );
sHdr.write( &(*i)->iSize, 4 );
int iUsedBlocks = blkDiv( (*i)->iSize, iBlockSize );
// for( BlockArray::iterator j = (*i)->aBlocks.begin(); j; j++ )
for( int j = 0; j < iUsedBlocks; j++ )
{
sHdr.write( &(*i)->aBlocks[j], 4 );
}
}
bHeaderChanged = false;
}
int Bu::Myriad::createStream( int iPreAllocate )
{
Stream *pStr = new Stream();
pStr->iId = aStreams.last()->iId+1;
//sio << "Myriad: New stream id=" << pStr->iId << ", iPreAllocate="
// << iPreAllocate << sio.nl;
pStr->iSize = 0;
aStreams.append( pStr );
for( int j = 0; j < iPreAllocate; j++ )
{
int iFreeBlock = findEmptyBlock();
// sio << "Myriad: Adding block " << iFreeBlock << sio.nl;
pStr->aBlocks.append( iFreeBlock );
bsBlockUsed.setBit( iFreeBlock );
}
bHeaderChanged = true;
return pStr->iId;
}
int Bu::Myriad::findEmptyBlock()
{
bHeaderChanged = true;
for( int j = 0; j < bsBlockUsed.getSize(); j++ )
{
if( bsBlockUsed.getBit( j ) == false )
return j;
}
// sio << "Myriad: findEmptyBlock(): No empty blocks, adding new one." << sio.nl;
bsBlockUsed.setSize( bsBlockUsed.getSize()+1, false );
/*
sStore.setPos( iBlockSize*iBlocks );
char *pBlock = new char[iBlockSize];
memset( pBlock, 0, iBlockSize );
sStore.write( pBlock, iBlockSize );
delete[] pBlock;
*/
sStore.setSize( (iBlocks+1)*iBlockSize );
return iBlocks++;
}
void Bu::Myriad::deleteStream( int iId )
{
for( StreamArray::iterator i = aStreams.begin(); i; i++ )
{
if( (*i)->iId == iId )
{
Stream *pStream = *i;
for( BlockArray::iterator j = pStream->aBlocks.begin(); j; j++ )
{
bsBlockUsed.setBit( *j, false );
}
aStreams.erase( i );
bHeaderChanged = true;
delete pStream;
return;
}
}
}
Bu::MyriadStream Bu::Myriad::openStream( int iId )
{
//sio << "Myriad: Request to open stream: " << iId << sio.nl;
return MyriadStream( *this, findStream( iId ) );
}
int Bu::Myriad::getBlockSize()
{
return iBlockSize;
}
int Bu::Myriad::getNumBlocks()
{
return iBlocks;
}
int Bu::Myriad::getNumUsedBlocks()
{
return iUsed;
}
Bu::Myriad::Stream *Bu::Myriad::findStream( int iId )
{
for( StreamArray::iterator i = aStreams.begin(); i; i++ )
{
if( (*i)->iId == iId )
return *i;
}
throw MyriadException( MyriadException::noSuchStream,
"The requested stream doesn't exist and cannot be opened." );
return NULL;
}
Bu::Myriad::Block *Bu::Myriad::getBlock( int iBlock )
{
// sio << "Myriad: Reading block " << iBlock << ", bytes "
// << iBlockSize*iBlock << "-" << iBlockSize*(iBlock+1) << sio.nl;
Block *pBlock = new Block;
pBlock->pData = new char[iBlockSize];
sStore.setPos( iBlockSize * iBlock );
sStore.read( pBlock->pData, iBlockSize );
pBlock->bChanged = false;
pBlock->iBlockIndex = iBlock;
hActiveBlocks.insert( iBlock, pBlock );
return pBlock;
}
void Bu::Myriad::releaseBlock( Bu::Myriad::Block *pBlock )
{
if( pBlock == NULL )
return;
// sio << "Myriad: Releasing block " << pBlock->iBlockIndex << sio.nl;
syncBlock( pBlock );
hActiveBlocks.erase( pBlock->iBlockIndex );
delete[] pBlock->pData;
delete pBlock;
}
void Bu::Myriad::syncBlock( Block *pBlock )
{
if( pBlock->bChanged )
{
// sio << "Myriad: - Block changed, writing back to stream." << sio.nl;
sStore.setPos( iBlockSize * pBlock->iBlockIndex );
sStore.write( pBlock->pData, iBlockSize );
pBlock->bChanged = false;
}
}
int Bu::Myriad::streamAddBlock( Stream *pStream )
{
int iBlock = findEmptyBlock();
pStream->aBlocks.append( iBlock );
bsBlockUsed.setBit( iBlock );
return iBlock;
}
void Bu::Myriad::setStreamSize( Stream *pStream, long iSize )
{
if( pStream->iSize == iSize )
{
return;
}
else if( pStream->iSize > iSize )
{
// Shrink
for( int iNewSize = pStream->aBlocks.getSize()*iBlockSize;
iNewSize-64 > iSize; iNewSize -= iBlockSize )
{
bsBlockUsed.setBit( pStream->aBlocks.last(), false );
pStream->aBlocks.eraseLast();
}
pStream->iSize = iSize;
bHeaderChanged = true;
}
else
{
// Grow
for( int iNewSize = pStream->aBlocks.getSize()*iBlockSize;
iNewSize < iSize; iNewSize += iBlockSize )
{
streamAddBlock( pStream );
}
pStream->iSize = iSize;
bHeaderChanged = true;
}
}
bool Bu::Myriad::isMyriad( Bu::Stream &sStore )
{
sStore.setPos( 0 );
unsigned char buf[4];
if( sStore.read( buf, 4 ) < 4 )
throw MyriadException( MyriadException::emptyStream,
"Input stream appears to be empty.");
sStore.setPos( 0 );
if( memcmp( buf, Myriad_MAGIC_CODE, 4 ) )
{
return false;
}
return true;
}
|