forked from nevoeitan/pole
-
Notifications
You must be signed in to change notification settings - Fork 1
/
pole.cpp
2427 lines (2121 loc) · 69.9 KB
/
pole.cpp
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
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* POLE - Portable C++ library to access OLE Storage
Copyright (C) 2002-2005 Ariya Hidayat <ariya@kde.org>
Performance optimization: Dmitry Fedorov
Copyright 2009 <www.bioimage.ucsb.edu> <www.dimin.net>
Fix for more than 236 mbat block entries : Michel Boudinot
Copyright 2010 <Michel.Boudinot@inaf.cnrs-gif.fr>
Considerable rework to allow for creation and updating of structured storage : Stephen Baum
Copyright 2013 <srbaum@gmail.com>
Added GetAllStreams, reworked datatypes
Copyright 2013 Felix Gorny from Bitplane
More datatype changes to allow for 32 and 64 bit code, some fixes involving incremental updates, flushing
Copyright 2013 <srbaum@gmail.com>
Version: 0.5.2
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the authors nor the names of its contributors may be
used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "pch.h"
#include "pole.h"
// enable to activate debugging output
// #define POLE_DEBUG
#define CACHEBUFSIZE 4096 //a presumably reasonable size for the read cache
namespace POLE
{
class Header
{
public:
unsigned char id[8]; // signature, or magic identifier
uint64 b_shift; // bbat->blockSize = 1 << b_shift
uint64 s_shift; // sbat->blockSize = 1 << s_shift
uint64 num_bat; // blocks allocated for big bat
uint64 dirent_start; // starting block for directory info
uint64 threshold; // switch from small to big file (usually 4K)
uint64 sbat_start; // starting block index to store small bat
uint64 num_sbat; // blocks allocated for small bat
uint64 mbat_start; // starting block to store meta bat
uint64 num_mbat; // blocks allocated for meta bat
uint64 bb_blocks[109];
bool dirty; // Needs to be written
Header();
bool valid();
void load(const unsigned char* buffer);
void save(unsigned char* buffer);
void debug();
};
class AllocTable
{
public:
static const uint64 Eof;
static const uint64 Avail;
static const uint64 Bat;
static const uint64 MetaBat;
uint64 blockSize;
AllocTable();
void clear();
uint64 count();
uint64 unusedCount();
void resize(uint64 newsize);
void preserve(uint64 n);
void set(uint64 index, uint64 val);
unsigned unused();
void setChain(std::vector<uint64>);
std::vector<uint64> follow(uint64 start);
uint64 operator[](uint64 index);
void load(const unsigned char* buffer, uint64 len);
void save(unsigned char* buffer);
uint64 size();
void debug();
bool isDirty();
void markAsDirty(uint64 dataIndex, int64 bigBlockSize);
void flush(std::vector<uint64> blocks, StorageIO *const io, int64 bigBlockSize);
private:
std::vector<uint64> data;
std::vector<uint64> dirtyBlocks;
bool bMaybeFragmented;
AllocTable(const AllocTable&);
AllocTable& operator=(const AllocTable&);
};
class DirEntry
{
public:
DirEntry() : valid(), name(), dir(), size(), start(), prev(), next(), child() {}
bool valid; // false if invalid (should be skipped)
std::string name; // the name, not in unicode anymore
bool dir; // true if directory
uint64 size; // size (not valid if directory)
uint64 start; // starting block
uint64 prev; // previous sibling
uint64 next; // next sibling
uint64 child; // first child
int compare(const DirEntry& de);
int compare(const std::string& name2);
};
class DirTree
{
public:
static const uint64 End;
DirTree(int64 bigBlockSize);
void clear(int64 bigBlockSize);
inline uint64 entryCount();
uint64 unusedEntryCount();
DirEntry* entry(uint64 index);
DirEntry* entry(const std::string& name, bool create = false, int64 bigBlockSize = 0, StorageIO *const io = 0, int64 streamSize = 0);
int64 indexOf(DirEntry* e);
int64 parent(uint64 index);
std::string fullName(uint64 index);
std::vector<uint64> children(uint64 index);
uint64 find_child(uint64 index, const std::string& name, uint64 &closest);
void load(unsigned char* buffer, uint64 len);
void save(unsigned char* buffer);
uint64 size();
void debug();
bool isDirty();
void markAsDirty(uint64 dataIndex, int64 bigBlockSize);
void flush(std::vector<uint64> blocks, StorageIO *const io, int64 bigBlockSize, uint64 sb_start, uint64 sb_size);
uint64 unused();
void findParentAndSib(uint64 inIdx, const std::string& inFullName, uint64 &parentIdx, uint64 &sibIdx);
uint64 findSib(uint64 inIdx, uint64 sibIdx);
void deleteEntry(DirEntry *entry, const std::string& inFullName, int64 bigBlockSize);
private:
std::vector<DirEntry> entries;
std::vector<uint64> dirtyBlocks;
DirTree(const DirTree&);
DirTree& operator=(const DirTree&);
};
class StorageIO
{
public:
Storage* storage; // owner
std::string filename; // filename
std::fstream file; // associated with above name
int64 result; // result of operation
bool opened; // true if file is opened
uint64 filesize; // size of the file
bool writeable; // true if the file can be modified
Header* header; // storage header
DirTree* dirtree; // directory tree
AllocTable* bbat; // allocation table for big blocks
AllocTable* sbat; // allocation table for small blocks
std::vector<uint64> sb_blocks; // blocks for "small" files
std::vector<uint64> mbat_blocks; // blocks for doubly indirect indices to big blocks
std::vector<uint64> mbat_data; // the additional indices to big blocks
bool mbatDirty; // If true, mbat_blocks need to be written
std::list<Stream*> streams;
StorageIO(Storage* storage, const char* filename);
StorageIO(Storage* storage, std::iostream& stream);
~StorageIO();
bool open(bool bWriteAccess = false, bool bCreate = false);
void close();
void flush();
void load(bool bWriteAccess);
void create();
void init();
bool deleteByName(const std::string& fullName);
bool deleteNode(DirEntry *entry, const std::string& fullName);
bool deleteLeaf(DirEntry *entry, const std::string& fullName);
uint64 loadBigBlocks(std::vector<uint64> blocks, unsigned char* buffer, uint64 maxlen);
uint64 loadBigBlock(uint64 block, unsigned char* buffer, uint64 maxlen);
uint64 saveBigBlocks(std::vector<uint64> blocks, uint64 offset, unsigned char* buffer, uint64 len);
uint64 saveBigBlock(uint64 block, uint64 offset, unsigned char*buffer, uint64 len);
uint64 loadSmallBlocks(std::vector<uint64> blocks, unsigned char* buffer, uint64 maxlen);
uint64 loadSmallBlock(uint64 block, unsigned char* buffer, uint64 maxlen);
uint64 saveSmallBlocks(std::vector<uint64> blocks, uint64 offset, unsigned char* buffer, uint64 len, int64 startAtBlock = 0);
uint64 saveSmallBlock(uint64 block, uint64 offset, unsigned char* buffer, uint64 len);
StreamIO* streamIO(const std::string& name, bool bCreate = false, int64 streamSize = 0);
void flushbbat();
void flushsbat();
std::vector<uint64> getbbatBlocks(bool bLoading);
uint64 ExtendFile(std::vector<uint64> *chain);
void addbbatBlock();
private:
// no copy or assign
StorageIO(const StorageIO&);
StorageIO& operator=(const StorageIO&);
};
class StreamIO
{
public:
StorageIO* io;
int64 entryIdx; //needed because a pointer to DirEntry will change whenever entries vector changes.
std::string fullName;
bool eof;
bool fail;
StreamIO(StorageIO* io, DirEntry* entry);
~StreamIO();
uint64 size();
void setSize(uint64 newSize);
void seek(uint64 pos);
uint64 tell();
int64 getch();
uint64 read(unsigned char* data, uint64 maxlen);
uint64 read(uint64 pos, unsigned char* data, uint64 maxlen);
uint64 write(unsigned char* data, uint64 len);
uint64 write(uint64 pos, unsigned char* data, uint64 len);
void flush();
private:
std::vector<uint64> blocks;
// no copy or assign
StreamIO(const StreamIO&);
StreamIO& operator=(const StreamIO&);
// pointer for read
uint64 m_pos;
// simple cache system to speed-up getch()
unsigned char* cache_data;
uint64 cache_size;
uint64 cache_pos;
void updateCache();
};
}; // namespace POLE
using namespace POLE;
#ifdef POLE_USE_UTF16_FILENAMES
std::string POLE::UTF16toUTF8(const std::wstring &utf16) {
std::wstring_convert<std::codecvt_utf8_utf16<wchar_t>, wchar_t> converter;
return converter.to_bytes(utf16);
}
std::wstring POLE::UTF8toUTF16(const std::string &utf8) {
std::wstring_convert<std::codecvt_utf8_utf16<wchar_t>, wchar_t> converter;
return converter.from_bytes(utf8);
}
#endif //POLE_USE_UTF16_FILENAMES
static void fileCheck(std::fstream &file)
{
bool bGood, bFail, bEof, bBad;
bool bNOTOK;
bGood = file.good();
bFail = file.fail();
bEof = file.eof();
bBad = file.bad();
if (bFail || bEof || bBad)
bNOTOK = true; //this doesn't really do anything, but it is a good place to set a breakpoint!
file.clear();
}
static inline uint32 readU16(const unsigned char* ptr)
{
return ptr[0] + (ptr[1] << 8);
}
static inline uint32 readU32(const unsigned char* ptr)
{
return ptr[0] + (ptr[1] << 8) + (ptr[2] << 16) + (ptr[3] << 24);
}
static inline void writeU16(unsigned char* ptr, uint32 data)
{
ptr[0] = (unsigned char)(data & 0xff);
ptr[1] = (unsigned char)((data >> 8) & 0xff);
}
static inline void writeU32(unsigned char* ptr, uint32 data)
{
ptr[0] = (unsigned char)(data & 0xff);
ptr[1] = (unsigned char)((data >> 8) & 0xff);
ptr[2] = (unsigned char)((data >> 16) & 0xff);
ptr[3] = (unsigned char)((data >> 24) & 0xff);
}
static const unsigned char pole_magic[] =
{ 0xd0, 0xcf, 0x11, 0xe0, 0xa1, 0xb1, 0x1a, 0xe1 };
// =========== Header ==========
Header::Header()
: b_shift(9), // [1EH,02] size of sectors in power-of-two; typically 9 indicating 512-byte sectors
s_shift(6), // [20H,02] size of mini-sectors in power-of-two; typically 6 indicating 64-byte mini-sectors
num_bat(0), // [2CH,04] number of SECTs in the FAT chain
dirent_start(0), // [30H,04] first SECT in the directory chain
threshold(4096), // [38H,04] maximum size for a mini stream; typically 4096 bytes
sbat_start(0), // [3CH,04] first SECT in the MiniFAT chain
num_sbat(0), // [40H,04] number of SECTs in the MiniFAT chain
mbat_start(AllocTable::Eof),// [44H,04] first SECT in the DIFAT chain
num_mbat(0), // [48H,04] number of SECTs in the DIFAT chain
dirty(true)
{
for (unsigned int i = 0; i < 8; i++)
id[i] = pole_magic[i];
for (unsigned int i = 0; i < 109; i++)
bb_blocks[i] = AllocTable::Avail;
}
bool Header::valid()
{
if (threshold != 4096) return false;
if (num_bat == 0) return false;
//if( (num_bat > 109) && (num_bat > (num_mbat * 127) + 109)) return false; // dima: incorrect check, number may be arbitrary larger
if ((num_bat < 109) && (num_mbat != 0)) return false;
if (s_shift > b_shift) return false;
if (b_shift <= 6) return false;
if (b_shift >= 31) return false;
return true;
}
void Header::load(const unsigned char* buffer) {
b_shift = readU16(buffer + 0x1e); // [1EH,02] size of sectors in power-of-two; typically 9 indicating 512-byte sectors and 12 for 4096
s_shift = readU16(buffer + 0x20); // [20H,02] size of mini-sectors in power-of-two; typically 6 indicating 64-byte mini-sectors
num_bat = readU32(buffer + 0x2c); // [2CH,04] number of SECTs in the FAT chain
dirent_start = readU32(buffer + 0x30); // [30H,04] first SECT in the directory chain
threshold = readU32(buffer + 0x38); // [38H,04] maximum size for a mini stream; typically 4096 bytes
sbat_start = readU32(buffer + 0x3c); // [3CH,04] first SECT in the MiniFAT chain
num_sbat = readU32(buffer + 0x40); // [40H,04] number of SECTs in the MiniFAT chain
mbat_start = readU32(buffer + 0x44); // [44H,04] first SECT in the DIFAT chain
num_mbat = readU32(buffer + 0x48); // [48H,04] number of SECTs in the DIFAT chain
for (unsigned int i = 0; i < 8; i++)
id[i] = buffer[i];
// [4CH,436] the SECTs of first 109 FAT sectors
for (unsigned int i = 0; i < 109; i++)
bb_blocks[i] = readU32(buffer + 0x4C + i * 4);
dirty = false;
}
void Header::save(unsigned char* buffer)
{
memset(buffer, 0, 0x4c);
memcpy(buffer, pole_magic, 8); // ole signature
writeU32(buffer + 8, 0); // unknown
writeU32(buffer + 12, 0); // unknown
writeU32(buffer + 16, 0); // unknown
writeU16(buffer + 24, 0x003e); // revision ?
writeU16(buffer + 26, 3); // version ?
writeU16(buffer + 28, 0xfffe); // unknown
writeU16(buffer + 0x1e, (uint32)b_shift);
writeU16(buffer + 0x20, (uint32)s_shift);
writeU32(buffer + 0x2c, (uint32)num_bat);
writeU32(buffer + 0x30, (uint32)dirent_start);
writeU32(buffer + 0x38, (uint32)threshold);
writeU32(buffer + 0x3c, (uint32)sbat_start);
writeU32(buffer + 0x40, (uint32)num_sbat);
writeU32(buffer + 0x44, (uint32)mbat_start);
writeU32(buffer + 0x48, (uint32)num_mbat);
for (unsigned int i = 0; i < 109; i++)
writeU32(buffer + 0x4C + i * 4, (uint32)bb_blocks[i]);
dirty = false;
}
void Header::debug()
{
std::cout << std::endl;
std::cout << "b_shift " << b_shift << std::endl;
std::cout << "s_shift " << s_shift << std::endl;
std::cout << "num_bat " << num_bat << std::endl;
std::cout << "dirent_start " << dirent_start << std::endl;
std::cout << "threshold " << threshold << std::endl;
std::cout << "sbat_start " << sbat_start << std::endl;
std::cout << "num_sbat " << num_sbat << std::endl;
std::cout << "mbat_start " << mbat_start << std::endl;
std::cout << "num_mbat " << num_mbat << std::endl;
uint64 s = (num_bat <= 109) ? num_bat : 109;
std::cout << "bat blocks: ";
for (uint64 i = 0; i < s; i++)
std::cout << bb_blocks[i] << " ";
std::cout << std::endl;
}
// =========== AllocTable ==========
const uint64 AllocTable::Avail = 0xffffffff;
const uint64 AllocTable::Eof = 0xfffffffe;
const uint64 AllocTable::Bat = 0xfffffffd;
const uint64 AllocTable::MetaBat = 0xfffffffc;
AllocTable::AllocTable()
: blockSize(4096),
data(),
dirtyBlocks(),
bMaybeFragmented(true)
{
// initial size
resize(128);
}
uint64 AllocTable::count()
{
return static_cast<uint64>(data.size());
}
uint64 AllocTable::unusedCount()
{
uint64 maxIdx = count();
uint64 nFound = 0;
for (uint64 idx = 0; idx < maxIdx; idx++)
{
if (data[idx] == Avail)
nFound++;
}
return nFound;
}
void AllocTable::resize(uint64 newsize)
{
uint64 oldsize = static_cast<uint64>(data.size());
data.resize(newsize);
if (newsize > oldsize)
for (uint64 i = oldsize; i < newsize; i++)
data[i] = Avail;
}
// make sure there're still free blocks
void AllocTable::preserve(uint64 n)
{
std::vector<uint64> pre;
for (unsigned i = 0; i < n; i++)
pre.push_back(unused());
}
uint64 AllocTable::operator[](uint64 index)
{
uint64 result;
result = data[index];
return result;
}
void AllocTable::set(uint64 index, uint64 value)
{
if (index >= count()) resize(index + 1);
data[index] = value;
if (value == Avail)
bMaybeFragmented = true;
}
void AllocTable::setChain(std::vector<uint64> chain)
{
if (chain.size())
{
for (unsigned i = 0; i < chain.size() - 1; i++)
set(chain[i], chain[i + 1]);
set(chain[chain.size() - 1], AllocTable::Eof);
}
}
// follow
std::vector<uint64> AllocTable::follow(uint64 start)
{
std::vector<uint64> chain;
size_t blocks = count();
if (start >= blocks) return chain;
uint64 p = start;
for (size_t loop_control = 0; p < blocks; ++loop_control)
{
if (loop_control >= blocks)
{
return {};
}
if (p == (uint64)Eof) break;
if (p == (uint64)Bat) break;
if (p == (uint64)MetaBat) break;
if (p >= blocks) break;
chain.push_back(p);
if (data[p] >= blocks) break;
p = data[p];
}
return chain;
}
unsigned AllocTable::unused()
{
// find first available block
unsigned int maxIdx = (unsigned int)data.size();
if (bMaybeFragmented)
{
for (unsigned i = 0; i < maxIdx; i++)
if (data[i] == Avail)
return i;
}
// completely full, so enlarge the table
unsigned int block = maxIdx;
resize(maxIdx);
bMaybeFragmented = false;
return block;
}
void AllocTable::load(const unsigned char* buffer, uint64 len)
{
resize(len / 4);
for (unsigned i = 0; i < count(); i++)
set(i, readU32(buffer + i * 4));
}
// return space required to save this dirtree
uint64 AllocTable::size()
{
return count() * 4;
}
void AllocTable::save(unsigned char* buffer)
{
for (uint64 i = 0; i < count(); i++)
writeU32(buffer + i * 4, (uint32)data[i]);
}
bool AllocTable::isDirty()
{
return (dirtyBlocks.size() > 0);
}
void AllocTable::markAsDirty(uint64 dataIndex, int64 bigBlockSize)
{
uint64 dbidx = dataIndex / (bigBlockSize / sizeof(uint32));
for (uint64 idx = 0; idx < static_cast<uint64>(dirtyBlocks.size()); idx++)
{
if (dirtyBlocks[idx] == dbidx)
return;
}
dirtyBlocks.push_back(dbidx);
}
void AllocTable::flush(std::vector<uint64> blocks, StorageIO *const io, int64 bigBlockSize)
{
unsigned char *buffer = new unsigned char[bigBlockSize * blocks.size()];
save(buffer);
for (uint64 idx = 0; idx < static_cast<uint64>(blocks.size()); idx++)
{
bool bDirty = false;
for (uint64 idx2 = 0; idx2 < static_cast<uint64>(dirtyBlocks.size()); idx2++)
{
if (dirtyBlocks[idx2] == idx)
{
bDirty = true;
break;
}
}
if (bDirty)
io->saveBigBlock(blocks[idx], 0, &buffer[bigBlockSize*idx], bigBlockSize);
}
dirtyBlocks.clear();
delete[] buffer;
}
void AllocTable::debug()
{
std::cout << "block size " << data.size() << std::endl;
for (unsigned i = 0; i < data.size(); i++)
{
if (data[i] == Avail) continue;
std::cout << i << ": ";
if (data[i] == Eof) std::cout << "[eof]";
else if (data[i] == Bat) std::cout << "[bat]";
else if (data[i] == MetaBat) std::cout << "[metabat]";
else std::cout << data[i];
std::cout << std::endl;
}
}
// =========== DirEntry ==========
// "A node with a shorter name is less than a node with a inter name"
// "For nodes with the same length names, compare the two names."
// --Windows Compound Binary File Format Specification, Section 2.5
int DirEntry::compare(const DirEntry& de)
{
return compare(de.name);
}
int DirEntry::compare(const std::string& name2)
{
if (name.length() < name2.length())
return -1;
else if (name.length() > name2.length())
return 1;
else
return name.compare(name2);
}
// =========== DirTree ==========
const uint64 DirTree::End = 0xffffffff;
DirTree::DirTree(int64 bigBlockSize)
: entries(),
dirtyBlocks()
{
clear(bigBlockSize);
}
void DirTree::clear(int64 bigBlockSize)
{
// leave only root entry
entries.resize(1);
entries[0].valid = true;
entries[0].name = "Root Entry";
entries[0].dir = true;
entries[0].size = 0;
entries[0].start = End;
entries[0].prev = End;
entries[0].next = End;
entries[0].child = End;
markAsDirty(0, bigBlockSize);
}
inline uint64 DirTree::entryCount()
{
return entries.size();
}
uint64 DirTree::unusedEntryCount()
{
uint64 nFound = 0;
for (uint64 idx = 0; idx < entryCount(); idx++)
{
if (!entries[idx].valid)
nFound++;
}
return nFound;
}
DirEntry* DirTree::entry(uint64 index)
{
if (index >= entryCount()) return (DirEntry*)0;
return &entries[index];
}
int64 DirTree::indexOf(DirEntry* e)
{
for (uint64 i = 0; i < entryCount(); i++)
if (entry(i) == e) return i;
return -1;
}
int64 DirTree::parent(uint64 index)
{
// brute-force, basically we iterate for each entries, find its children
// and check if one of the children is 'index'
for (uint64 j = 0; j < entryCount(); j++)
{
std::vector<uint64> chi = children(j);
for (unsigned i = 0; i < chi.size(); i++)
if (chi[i] == index)
return j;
}
return -1;
}
std::string DirTree::fullName(uint64 index)
{
// don't use root name ("Root Entry"), just give "/"
if (index == 0) return "/";
std::string result = entry(index)->name;
result.insert(0, "/");
uint64 p = parent(index);
DirEntry * _entry = 0;
while (p > 0)
{
_entry = entry(p);
if (_entry->dir && _entry->valid)
{
result.insert(0, _entry->name);
result.insert(0, "/");
}
--p;
index = p;
if (index <= 0) break;
}
return result;
}
// given a fullname (e.g "/ObjectPool/_1020961869"), find the entry
// if not found and create is false, return 0
// if create is true, a new entry is returned
DirEntry* DirTree::entry(const std::string& name, bool create, int64 bigBlockSize, StorageIO *const io, int64 streamSize)
{
if (!name.length()) return (DirEntry*)0;
// quick check for "/" (that's root)
if (name == "/") return entry(0);
// split the names, e.g "/ObjectPool/_1020961869" will become:
// "ObjectPool" and "_1020961869"
std::list<std::string> names;
std::string::size_type start = 0, end = 0;
if (name[0] == '/') start++;
int levelsLeft = 0;
while (start < name.length())
{
end = name.find_first_of('/', start);
if (end == std::string::npos) end = name.length();
names.push_back(name.substr(start, end - start));
levelsLeft++;
start = end + 1;
}
// start from root
int64 index = 0;
// trace one by one
std::list<std::string>::iterator it;
for (it = names.begin(); it != names.end(); ++it)
{
// find among the children of index
levelsLeft--;
uint64 child = 0;
/*
// dima: this block is really inefficient
std::vector<unsigned> chi = children( index );
for( unsigned i = 0; i < chi.size(); i++ )
{
DirEntry* ce = entry( chi[i] );
if( ce )
if( ce->valid && ( ce->name.length()>1 ) )
if( ce->name == *it ) {
child = chi[i];
break;
}
}
*/
// dima: performance optimisation of the previous
uint64 closest = End;
child = find_child(index, *it, closest);
// traverse to the child
if (child > 0) index = child;
else
{
// not found among children
if (!create || !io->writeable) return (DirEntry*)0;
// create a new entry
uint64 parent2 = index;
index = unused();
DirEntry* e = entry(index);
e->valid = true;
e->name = *it;
e->dir = (levelsLeft > 0);
if (!e->dir)
e->size = streamSize;
else
e->size = 0;
e->start = AllocTable::Eof;
e->child = End;
if (closest == End)
{
e->prev = End;
e->next = entry(parent2)->child;
entry(parent2)->child = index;
markAsDirty(parent2, bigBlockSize);
}
else
{
DirEntry* closeE = entry(closest);
if (closeE->compare(*e) < 0)
{
e->prev = closeE->next;
e->next = End;
closeE->next = index;
}
else
{
e->next = closeE->prev;
e->prev = End;
closeE->prev = index;
}
markAsDirty(closest, bigBlockSize);
}
markAsDirty(index, bigBlockSize);
uint64 bbidx = index / (bigBlockSize / 128);
std::vector <uint64> blocks = io->bbat->follow(io->header->dirent_start);
while (blocks.size() <= bbidx)
{
uint64 nblock = io->bbat->unused();
if (blocks.size() > 0)
{
io->bbat->set(blocks[static_cast<uint64>(blocks.size()) - 1], nblock);
io->bbat->markAsDirty(blocks[static_cast<uint64>(blocks.size()) - 1], bigBlockSize);
}
io->bbat->set(nblock, AllocTable::Eof);
io->bbat->markAsDirty(nblock, bigBlockSize);
blocks.push_back(nblock);
uint64 bbidx = nblock / (io->bbat->blockSize / sizeof(uint64));
while (bbidx >= io->header->num_bat)
io->addbbatBlock();
}
}
}
return entry(index);
}
// helper function: recursively find siblings of index
void dirtree_find_siblings(DirTree* dirtree, std::vector<uint64>& result,
uint64 index)
{
DirEntry* e = dirtree->entry(index);
if (!e || !e->valid) return;
if (e->prev != DirTree::End)
dirtree_find_siblings(dirtree, result, e->prev);
result.push_back(index);
if (e->next != DirTree::End)
dirtree_find_siblings(dirtree, result, e->next);
}
std::vector<uint64> DirTree::children(uint64 index)
{
std::vector<uint64> result;
DirEntry* e = entry(index);
if (e) if (e->valid && e->child < entryCount())
dirtree_find_siblings(this, result, e->child);
return result;
}
uint64 dirtree_find_sibling(DirTree* dirtree, uint64 index, const std::string& name, uint64& closest) {
uint64 count = dirtree->entryCount();
DirEntry* e = dirtree->entry(index);
if (!e || !e->valid) return 0;
int cval = e->compare(name);
if (cval == 0)
return index;
if (cval > 0)
{
if (e->prev > 0 && e->prev < count)
return dirtree_find_sibling(dirtree, e->prev, name, closest);
}
else
{
if (e->next > 0 && e->next < count)
return dirtree_find_sibling(dirtree, e->next, name, closest);
}
closest = index;
return 0;
}
uint64 DirTree::find_child(uint64 index, const std::string& name, uint64& closest) {
uint64 count = entryCount();
DirEntry* p = entry(index);
if (p && p->valid && p->child < count)
return dirtree_find_sibling(this, p->child, name, closest);
return 0;
}
void DirTree::load(unsigned char* buffer, uint64 size)
{
entries.clear();
for (uint64 i = 0; i < size / 128; i++)
{
uint64 p = i * 128;
// would be < 32 if first char in the name isn't printable
unsigned prefix = 32;
// parse name of this entry, which stored as Unicode 16-bit
std::string name;
int name_len = readU16(buffer + 0x40 + p);
if (name_len > 64) name_len = 64;
for (int j = 0; (buffer[j + p]) && (j < name_len); j += 2)
name.append(1, buffer[j + p]);
// first char isn't printable ? remove it...
if (buffer[p] < 32)
{
prefix = buffer[0];
name.erase(0, 1);
}
// 2 = file (aka stream), 1 = directory (aka storage), 5 = root
unsigned type = buffer[0x42 + p];
DirEntry e;
e.valid = (type != 0);
e.name = name;
e.start = readU32(buffer + 0x74 + p);
e.size = readU32(buffer + 0x78 + p);
e.prev = readU32(buffer + 0x44 + p);
e.next = readU32(buffer + 0x48 + p);
e.child = readU32(buffer + 0x4C + p);
e.dir = (type != 2);
// sanity checks
if ((type != 2) && (type != 1) && (type != 5)) e.valid = false;
if (name_len < 1) e.valid = false;
entries.push_back(e);
}
}
// return space required to save this dirtree
uint64 DirTree::size()
{
return entryCount() * 128;
}
void DirTree::save(unsigned char* buffer)
{
memset(buffer, 0, size());
// root is fixed as "Root Entry"
DirEntry* root = entry(0);
std::string name = "Root Entry";
for (unsigned int j = 0; j < name.length(); j++)
buffer[j * 2] = name[j];
writeU16(buffer + 0x40, static_cast<uint32>(name.length() * 2 + 2));
writeU32(buffer + 0x74, 0xffffffff);
writeU32(buffer + 0x78, 0);
writeU32(buffer + 0x44, 0xffffffff);
writeU32(buffer + 0x48, 0xffffffff);
writeU32(buffer + 0x4c, (uint32)root->child);
buffer[0x42] = 5;
//buffer[ 0x43 ] = 1;
for (unsigned int i = 1; i < entryCount(); i++)
{
DirEntry* e = entry(i);
if (!e) continue;
if (e->dir)
{