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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
|
/* -*- 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 <string.h>
#include <sal/log.hxx>
#include <tools/solar.h>
#include <svl/itempool.hxx>
#include "whassert.hxx"
#include <svl/SfxBroadcaster.hxx>
#include <svl/filerec.hxx>
#include "poolio.hxx"
#include <algorithm>
#include <memory>
/// clear array of PoolItem variants
/// after all PoolItems are deleted
/// or all ref counts are decreased
void SfxPoolItemArray_Impl::clear()
{
maPoolItemVector.clear();
maFree.clear();
maPtrToIndex.clear();
}
/// Re-build our free list and pointer hash.
void SfxPoolItemArray_Impl::ReHash()
{
maFree.clear();
maPtrToIndex.clear();
for (size_t nIdx = 0; nIdx < size(); ++nIdx)
{
SfxPoolItem *pItem = (*this)[nIdx];
if (!pItem)
maFree.push_back(nIdx);
else
{
maPtrToIndex.insert(std::make_pair(pItem,nIdx));
assert(maPtrToIndex.find(pItem) != maPtrToIndex.end());
}
}
}
/**
* Returns the <SfxItemPool> that is being saved.
* This should only be used in very exceptional cases e.g.
* when guaranteeing file format compatibility:
* When overriding a <SfxPoolItem::Store()> getting additional data from the Pool
*/
const SfxItemPool* SfxItemPool::GetStoringPool()
{
return pStoringPool_;
}
static sal_uInt16 convertSfxItemKindToUInt16(SfxItemKind eKind)
{
switch (eKind)
{
case SfxItemKind::NONE:
return 0;
case SfxItemKind::DeleteOnIdle:
return 0xfffd;
case SfxItemKind::StaticDefault:
return 0xfffe;
case SfxItemKind::PoolDefault:
return 0xffff;
default:
assert("unknown SfxItemKind");
return 0;
}
}
static SfxItemKind convertUInt16ToSfxItemKind(sal_uInt16 nRefCnt)
{
switch (nRefCnt)
{
case 0:
return SfxItemKind::NONE;
case 0xfffd:
return SfxItemKind::DeleteOnIdle;
case 0xfffe:
return SfxItemKind::StaticDefault;
case 0xffff:
return SfxItemKind::PoolDefault;
default:
assert(false);
abort();
}
}
/**
* The SfxItemPool is saved to the specified Stream (together with all its
* secondary Pools) using its Pool Defaults and pooled Items.
* The static defaults are not saved.
* [Fileformat]
*
* ;First, a compatibility header section
* Start: 0x1111 SFX_ITEMPOOL_TAG_STARTPOOLS(_4/_5)
* sal_uInt8 MAJOR_VER ;SfxItemPool version
* sal_uInt8 MINOR_VER ;"
* 0xFFFF SFX_ITEMPOOL_TAG_TRICK4OLD ;ex. GetVersion()
* sal_uInt16 0x0000 ;Pseudo StyleSheetPool
* sal_uInt16 0x0000 ;Pseudo StyleSheetPool
*
* ;The whole Pool into a record
* record SfxMiniRecod(SFX_ITEMPOOL_REC)
*
* ;Start with a Header for each
* Header: record SfxMiniRecord(SFX_ITEMPOOL_REC_HEADER)
* sal_uInt16 GetVersion() ;Which-Ranges etc.
* String GetName() ;Pool name
*
* ;The version map: in order to be able to map WhichIds of new file version
* Versions: record SfxMultiRecord(SFX_ITEMPOOL_REC_VERSIONS, 0)
* sal_uInt16 OldVersion
* sal_uInt16 OldStartWhich
* sal_uInt16 OldEndWhich
* sal_uInt16[] NewWhich (OldEndWhich-OldStartWhich+1)
*
* ;Now the pooled Items (first the non-SfxSetItems)
* Items: record SfxMultiRecord(SFX_ITEMPOOL_REC_WHICHIDS, 0)
* content SlotId, 0
* sal_uInt16 WhichId
* sal_uInt16 pItem->GetVersion()
* sal_uInt16 Array-Size
* record SfxMultiRecord(SFX_, 0)
* content Surrogate
* sal_uInt16 RefCount
* unknown pItem->Store()
*
* ;Now the set Pool defaults
* Defaults: record SfxMultiRecord(SFX_ITEMPOOL_REC_DEFAULTS, 0)
* content SlotId, 0
* sal_uInt16 WhichId
* sal_uInt16 pPoolDef->GetVersion()
* unknown pPoolDef->Store();
*
* ;Hereafter the secondary follows (if present) without compatibility header section
*/
SvStream &SfxItemPool::Store(SvStream &rStream) const
{
// Find StoreMaster
SfxItemPool *pStoreMaster = pImpl->mpMaster != this ? pImpl->mpMaster : nullptr;
while ( pStoreMaster && !pStoreMaster->pImpl->bStreaming )
pStoreMaster = pStoreMaster->pImpl->mpSecondary;
// Old header (version of the Pool and content version is 0xffff by default)
pImpl->bStreaming = true;
if ( !pStoreMaster )
{
rStream.WriteUInt16( rStream.GetVersion() >= SOFFICE_FILEFORMAT_50
? SFX_ITEMPOOL_TAG_STARTPOOL_5
: SFX_ITEMPOOL_TAG_STARTPOOL_4 );
rStream.WriteUInt8( SFX_ITEMPOOL_VER_MAJOR ).WriteUInt8( SFX_ITEMPOOL_VER_MINOR );
rStream.WriteUInt16( SFX_ITEMPOOL_TAG_TRICK4OLD );
// Work around SfxStyleSheet bug
rStream.WriteUInt16( 0 ); // Version
rStream.WriteUInt16( 0 ); // Count (or else 2nd loop breaks)
}
// Every Pool as a whole is a record
SfxMiniRecordWriter aPoolRec( &rStream, SFX_ITEMPOOL_REC );
pStoringPool_ = this;
// Single header (content version and name)
{
SfxMiniRecordWriter aPoolHeaderRec( &rStream, SFX_ITEMPOOL_REC_HEADER);
rStream.WriteUInt16( pImpl->nVersion );
writeByteString(rStream, pImpl->aName);
}
// VersionMaps
{
SfxMultiVarRecordWriter aVerRec( &rStream, SFX_ITEMPOOL_REC_VERSIONMAP );
for (std::shared_ptr<SfxPoolVersion_Impl>& pVer : pImpl->aVersions)
{
aVerRec.NewContent();
rStream.WriteUInt16( pVer->_nVer ).WriteUInt16( pVer->_nStart ).WriteUInt16( pVer->_nEnd );
sal_uInt16 nCount = pVer->_nEnd - pVer->_nStart + 1;
sal_uInt16 nNewWhich = 0;
for ( sal_uInt16 n = 0; n < nCount; ++n )
{
nNewWhich = pVer->_pMap[n];
rStream.WriteUInt16( nNewWhich );
}
// Workaround for bug in SetVersionMap 312
if ( SOFFICE_FILEFORMAT_31 == pImpl->mnFileFormatVersion )
rStream.WriteUInt16( nNewWhich+1 );
}
}
// Pooled Items
{
SfxMultiMixRecordWriter aWhichIdsRec( &rStream, SFX_ITEMPOOL_REC_WHICHIDS );
// First write the atomic Items and then write the Sets (important when loading)
for (int ft = 0 ; ft < 2 && !rStream.GetError(); ft++)
{
pImpl->bInSetItem = ft != 0;
std::vector<SfxPoolItemArray_Impl*>::const_iterator itrArr = pImpl->maPoolItems.begin();
SfxPoolItem **ppDefItem = pImpl->ppStaticDefaults;
const sal_uInt16 nSize = GetSize_Impl();
for ( size_t i = 0; i < nSize && !rStream.GetError(); ++i, ++itrArr, ++ppDefItem )
{
// Get version of the Item
sal_uInt16 nItemVersion = (*ppDefItem)->GetVersion( pImpl->mnFileFormatVersion );
if ( USHRT_MAX == nItemVersion )
// => Was not present in the version that was supposed to be exported
continue;
// ! Poolable is not even saved in the Pool
// And itemsets/plain-items depending on the round
if ( *itrArr && IsItemPoolable(**ppDefItem) &&
pImpl->bInSetItem == (dynamic_cast< const SfxSetItem* >(*ppDefItem) != nullptr) )
{
// Own signature, global WhichId and ItemVersion
sal_uInt16 nSlotId = GetSlotId( (*ppDefItem)->Which(), false );
aWhichIdsRec.NewContent(nSlotId, 0);
rStream.WriteUInt16( (*ppDefItem)->Which() );
rStream.WriteUInt16( nItemVersion );
const sal_uInt32 nCount = ::std::min<size_t>( (*itrArr)->size(), SAL_MAX_UINT32 );
DBG_ASSERT(nCount, "ItemArr is empty");
rStream.WriteUInt32( nCount );
// Write Items
SfxMultiMixRecordWriter aItemsRec( &rStream, SFX_ITEMPOOL_REC_ITEMS );
for ( size_t j = 0; j < nCount; ++j )
{
// Get Item
const SfxPoolItem *pItem = (*itrArr)->operator[](j);
if ( pItem && pItem->GetRefCount() ) //! See other MI-REF
{
aItemsRec.NewContent((sal_uInt16)j, 'X' );
if ( pItem->GetRefCount() == SFX_ITEMS_SPECIAL )
rStream.WriteUInt16( convertSfxItemKindToUInt16(pItem->GetKind()) );
else
{
if( pItem->GetRefCount() > SFX_ITEMS_OLD_MAXREF )
{
assert(!"refcount does not fit into 16-bits");
rStream.SetError( ERRCODE_IO_NOTSTORABLEINBINARYFORMAT );
}
else
rStream.WriteUInt16( pItem->GetRefCount() );
}
if ( !rStream.GetError() )
pItem->Store(rStream, nItemVersion);
else
break;
#ifdef DBG_UTIL_MI
if ( dynamic_cast<const SfxSetItem*>( pItem ) == nullptr )
{
sal_uLong nMark = rStream.Tell();
rStream.Seek( nItemStartPos + sizeof(sal_uInt16) );
std::unique_ptr<SfxPoolItem> pClone(pItem->Create(rStream, nItemVersion ));
sal_uInt16 nWh = pItem->Which();
SFX_ASSERT( rStream.Tell() == nMark, nWh,"asymmetric store/create" );
SFX_ASSERT( *pClone == *pItem, nWh, "unequal after store/create" );
}
#endif
}
}
}
}
}
pImpl->bInSetItem = false;
}
// Save the set Defaults (PoolDefaults)
if ( !rStream.GetError() )
{
SfxMultiMixRecordWriter aDefsRec( &rStream, SFX_ITEMPOOL_REC_DEFAULTS );
for (const SfxPoolItem* pDefaultItem : pImpl->maPoolDefaults)
{
if ( pDefaultItem )
{
// Get version
sal_uInt16 nItemVersion = pDefaultItem->GetVersion( pImpl->mnFileFormatVersion );
if ( USHRT_MAX == nItemVersion )
// => Was not present in the version yet
continue;
// Own signature, global signature, version
sal_uInt16 nSlotId = GetSlotId( pDefaultItem->Which(), false );
aDefsRec.NewContent( nSlotId, 0 );
rStream.WriteUInt16( pDefaultItem->Which() );
rStream.WriteUInt16( nItemVersion );
// Item
pDefaultItem->Store( rStream, nItemVersion );
}
}
}
// Write out additional Pools
pStoringPool_ = nullptr;
aPoolRec.Close();
if ( !rStream.GetError() && pImpl->mpSecondary )
pImpl->mpSecondary->Store( rStream );
pImpl->bStreaming = false;
return rStream;
}
/**
* If the SfxItemPool was loaded with 'bRefCounts' == sal_False, we need
* to finish the loading of the document contents with a call of this method.
* In any other case calling this function has no meaning.
*
* When loading without RefCounts, they are actually set to 1 so that
* SfxPoolItems that are needed during and after loading are not deleted.
* This method resets the RefCount and also removes all items that are not
* needed anymore.
*
* @see SfxItemPool::Load()
*/
void SfxItemPool::LoadCompleted()
{
// Did we load without RefCounts?
if ( pImpl->nInitRefCount > 1 )
{
// Iterate over all Which values
for (auto& rPoolItemArrayPtr : pImpl->maPoolItems)
{
// Is there an item with the Which value present at all?
if (rPoolItemArrayPtr)
{
// Iterate over all items with this WhichId
for (auto& rItemPtr : *rPoolItemArrayPtr)
{
if (rItemPtr)
{
if (!ReleaseRef(*rItemPtr))
DELETEZ(rItemPtr);
}
}
// don't clear array, fill free list and clear pointer map
rPoolItemArrayPtr->ReHash();
}
}
// from now on normal initial ref count
pImpl->nInitRefCount = 1;
}
// notify secondary pool
if ( pImpl->mpSecondary )
pImpl->mpSecondary->LoadCompleted();
}
sal_uInt16 SfxItemPool::GetFirstWhich() const
{
return pImpl->mnStart;
}
sal_uInt16 SfxItemPool::GetLastWhich() const
{
return pImpl->mnEnd;
}
bool SfxItemPool::IsInRange( sal_uInt16 nWhich ) const
{
return nWhich >= pImpl->mnStart && nWhich <= pImpl->mnEnd;
}
// This had to be moved to a method of its own to keep Solaris GCC happy:
void SfxItemPool_Impl::readTheItems (
SvStream & rStream, sal_uInt32 nItemCount, sal_uInt16 nVer,
SfxPoolItem * pDefItem, SfxPoolItemArray_Impl ** ppArr)
{
SfxMultiRecordReader aItemsRec( &rStream, SFX_ITEMPOOL_REC_ITEMS );
SfxPoolItemArray_Impl *pNewArr = new SfxPoolItemArray_Impl();
SfxPoolItem *pItem = nullptr;
sal_uLong n, nLastSurrogate = sal_uLong(-1);
while (aItemsRec.GetContent())
{
// Get next surrogate
sal_uInt16 nSurrogate = aItemsRec.GetContentTag();
DBG_ASSERT( aItemsRec.GetContentVersion() == 'X',
"not an item content" );
// Fill up missing ones
// coverity[tainted_data] - ignore this, though we should finally kill off this format
for ( pItem = nullptr, n = nLastSurrogate+1; n < nSurrogate; ++n )
pNewArr->push_back( pItem );
nLastSurrogate = nSurrogate;
// Load RefCount and Item
sal_uInt16 nRef(0);
rStream.ReadUInt16( nRef );
pItem = pDefItem->Create(rStream, nVer);
pNewArr->push_back( pItem );
if ( !mbPersistentRefCounts )
// Hold onto it until SfxItemPool::LoadCompleted()
SfxItemPool::AddRef(*pItem);
else
{
if ( nRef > SFX_ITEMS_OLD_MAXREF )
SfxItemPool::SetKind(*pItem, convertUInt16ToSfxItemKind(nRef));
else
SfxItemPool::AddRef(*pItem, nRef);
}
}
// Fill up missing ones
for ( pItem = nullptr, n = nLastSurrogate+1; n < nItemCount; ++n )
pNewArr->push_back( pItem );
SfxPoolItemArray_Impl *pOldArr = *ppArr;
*ppArr = pNewArr;
// Remember items that are already in the pool
bool bEmpty = true;
if ( nullptr != pOldArr )
for ( n = 0; bEmpty && n < pOldArr->size(); ++n )
bEmpty = pOldArr->operator[](n) == nullptr;
SAL_WARN_IF( !bEmpty, "svl", "loading non-empty pool" );
if ( !bEmpty )
{
// See if there's a new one for all old ones
for ( size_t nOld = 0; nOld < pOldArr->size(); ++nOld )
{
SfxPoolItem *pOldItem = (*pOldArr)[nOld];
if ( pOldItem )
{
sal_uInt32 nFree = SAL_MAX_UINT32;
bool bFound = false;
for ( size_t nNew = (*ppArr)->size(); nNew--; )
{
// Loaded Item
SfxPoolItem *&rpNewItem =
(*ppArr)->operator[](nNew);
// Unused surrogate?
if ( !rpNewItem )
nFree = nNew;
// Found it?
else if ( *rpNewItem == *pOldItem )
{
// Reuse
SfxItemPool::AddRef( *pOldItem, rpNewItem->GetRefCount() );
SfxItemPool::SetRefCount( *rpNewItem, 0 );
delete rpNewItem;
rpNewItem = pOldItem;
bFound = true;
break;
}
}
// Take over the ones that were previously present, but had not been loaded
if ( !bFound )
{
if ( nFree != SAL_MAX_UINT32 )
(*ppArr)->operator[](nFree) = pOldItem;
else
(*ppArr)->push_back( pOldItem );
}
}
}
}
delete pOldArr;
(*ppArr)->ReHash(); // paranoid
}
SvStream &SfxItemPool::Load(SvStream &rStream)
{
DBG_ASSERT(pImpl->ppStaticDefaults, "No DefaultArray");
// Protect items by increasing ref count
if ( !pImpl->mbPersistentRefCounts )
{
// Iterate over all Which values
for(auto const& rArrayPtr : pImpl->maPoolItems)
{
// Is there an Item with that Which value present at all?
if (rArrayPtr)
{
for (auto const& rItemPtr : *rArrayPtr)
if (rItemPtr)
{
SAL_INFO( "svl", "loading non-empty ItemPool" );
AddRef(*rItemPtr);
}
}
}
// During loading (until LoadCompleted()) protect all items
pImpl->nInitRefCount = 2;
}
// Find LoadMaster
SfxItemPool *pLoadMaster = pImpl->mpMaster != this ? pImpl->mpMaster : nullptr;
while ( pLoadMaster && !pLoadMaster->pImpl->bStreaming )
pLoadMaster = pLoadMaster->pImpl->mpSecondary;
// Read whole Header
pImpl->bStreaming = true;
if ( !pLoadMaster )
{
// Load format version
sal_uInt16 nFileTag;
rStream.ReadUInt16( nFileTag );
if ( SFX_ITEMPOOL_TAG_STARTPOOL_5 != nFileTag && SFX_ITEMPOOL_TAG_STARTPOOL_4 != nFileTag )
{
OSL_FAIL( "SFX_ITEMPOOL_TAG_STARTPOOL_5" ); /*! s.u. */
/*! Set error code and evaluate! */
(rStream).SetError(SVSTREAM_FILEFORMAT_ERROR);
pImpl->bStreaming = false;
return rStream;
}
rStream.ReadUChar( pImpl->nMajorVer ).ReadUChar( pImpl->nMinorVer );
// Take over format version to MasterPool
pImpl->mpMaster->pImpl->nMajorVer = pImpl->nMajorVer;
pImpl->mpMaster->pImpl->nMinorVer = pImpl->nMinorVer;
// Unknown Format
if (pImpl->nMajorVer < 2 || pImpl->nMajorVer > SFX_ITEMPOOL_VER_MAJOR)
{
rStream.SetError(SVSTREAM_FILEFORMAT_ERROR);
pImpl->bStreaming = false;
return rStream;
}
// Trick for version 1.2: skip data
sal_uInt16 nFileTag2;
rStream.ReadUInt16( nFileTag2 );
if ( SFX_ITEMPOOL_TAG_TRICK4OLD != nFileTag2 )
{
OSL_FAIL( "SFX_ITEMPOOL_TAG_TRICK4OLD" ); /*! s.u. */
/*! Set error code and evaluate! */
(rStream).SetError(SVSTREAM_FILEFORMAT_ERROR);
pImpl->bStreaming = false;
return rStream;
}
rStream.SeekRel( 4 ); // Hack: Skip data due to SfxStyleSheetPool bug
}
// New record-oriented format
SfxMiniRecordReader aPoolRec( &rStream, SFX_ITEMPOOL_REC );
if ( rStream.GetError() )
{
pImpl->bStreaming = false;
return rStream;
}
// Single header
OUString aExternName;
{
// Find HeaderRecord
SfxMiniRecordReader aPoolHeaderRec( &rStream, SFX_ITEMPOOL_REC_HEADER );
if ( rStream.GetError() )
{
pImpl->bStreaming = false;
return rStream;
}
// Read Header
rStream.ReadUInt16( pImpl->nLoadingVersion );
aExternName = readByteString(rStream);
bool bOwnPool = aExternName == pImpl->aName;
//! As long as we cannot read foreign Pools
if ( !bOwnPool )
{
rStream.SetError(SVSTREAM_FILEFORMAT_ERROR);
aPoolRec.Skip();
pImpl->bStreaming = false;
return rStream;
}
}
// Version maps
{
SfxMultiRecordReader aVerRec( &rStream, SFX_ITEMPOOL_REC_VERSIONMAP );
if ( rStream.GetError() )
{
pImpl->bStreaming = false;
return rStream;
}
// Version maps einlesen
sal_uInt16 nOwnVersion = pImpl->nVersion;
for ( sal_uInt16 nVerNo = 0; aVerRec.GetContent(); ++nVerNo )
{
// Read header for single versions
sal_uInt16 nVersion(0), nHStart(0), nHEnd(0);
rStream.ReadUInt16( nVersion ).ReadUInt16( nHStart ).ReadUInt16( nHEnd );
sal_uInt16 nCount = nHEnd - nHStart + 1;
// Is new version is known?
if ( nVerNo >= pImpl->aVersions.size() )
{
// Add new Version
const size_t nMaxRecords = rStream.remainingSize() / sizeof(sal_uInt16);
if (nCount > nMaxRecords)
{
SAL_WARN("svl", "Parsing error: " << nMaxRecords <<
" max possible entries, but " << nCount << " claimed, truncating");
nCount = nMaxRecords;
}
sal_uInt16 *pMap = new sal_uInt16[nCount]{};
for ( sal_uInt16 n = 0; n < nCount; ++n )
rStream.ReadUInt16( pMap[n] );
SetVersionMap( nVersion, nHStart, nHEnd, pMap );
}
}
pImpl->nVersion = nOwnVersion;
}
// Load Items
bool bSecondaryLoaded = false;
long nSecondaryEnd = 0;
{
SfxMultiRecordReader aWhichIdsRec( &rStream, SFX_ITEMPOOL_REC_WHICHIDS);
while ( aWhichIdsRec.GetContent() )
{
// Get SlotId, WhichId and Item version
sal_uInt32 nCount(0);
sal_uInt16 nVersion(0), nWhich(0);
//!sal_uInt16 nSlotId = aWhichIdsRec.GetContentTag();
rStream.ReadUInt16( nWhich );
if ( pImpl->nLoadingVersion != pImpl->nVersion )
// Move WhichId from file version to Pool version
nWhich = GetNewWhich( nWhich );
// Unknown Item from newer version
if ( !IsInRange(nWhich) )
continue;
rStream.ReadUInt16( nVersion );
rStream.ReadUInt32( nCount );
//!SFX_ASSERTWARNING( !nSlotId || !HasMap() ||
//! ( nSlotId == GetSlotId( nWhich, sal_False ) ) ||
//! !GetSlotId( nWhich, sal_False ),
//! nWhich, "Slot/Which mismatch" );
sal_uInt16 nIndex = GetIndex_Impl(nWhich);
SfxPoolItemArray_Impl **ppArr = &pImpl->maPoolItems[0] + nIndex;
// SfxSetItems could contain Items from secondary Pools
SfxPoolItem *pDefItem = *(pImpl->ppStaticDefaults + nIndex);
pImpl->bInSetItem = dynamic_cast<const SfxSetItem*>( pDefItem ) != nullptr;
if ( !bSecondaryLoaded && pImpl->mpSecondary && pImpl->bInSetItem )
{
// Seek to end of own Pool
sal_uLong nLastPos = rStream.Tell();
aPoolRec.Skip();
// Read secondary Pool
pImpl->mpSecondary->Load( rStream );
bSecondaryLoaded = true;
nSecondaryEnd = rStream.Tell();
// Back to our own Items
rStream.Seek(nLastPos);
}
// Read Items
pImpl->readTheItems(rStream, nCount, nVersion, pDefItem, ppArr);
pImpl->bInSetItem = false;
}
}
// Read Pool defaults
{
SfxMultiRecordReader aDefsRec( &rStream, SFX_ITEMPOOL_REC_DEFAULTS );
while ( aDefsRec.GetContent() )
{
// Get SlotId, WhichId and Item versions
sal_uInt16 nVersion(0), nWhich(0);
//!sal_uInt16 nSlotId = aDefsRec.GetContentTag();
rStream.ReadUInt16( nWhich );
if ( pImpl->nLoadingVersion != pImpl->nVersion )
// Move WhichId from file version to Pool version
nWhich = GetNewWhich( nWhich );
// Unknown Item from newer version
if ( !IsInRange(nWhich) )
continue;
rStream.ReadUInt16( nVersion );
//!SFX_ASSERTWARNING( !HasMap() || ( nSlotId == GetSlotId( nWhich, sal_False ) ),
//! nWhich, "Slot/Which mismatch" );
// Load PoolDefaultItem
SfxPoolItem *pItem =
( *( pImpl->ppStaticDefaults + GetIndex_Impl(nWhich) ) )
->Create( rStream, nVersion );
pItem->SetKind( SfxItemKind::PoolDefault );
pImpl->maPoolDefaults[GetIndex_Impl(nWhich)] = pItem;
}
}
// Load secondary Pool if needed
aPoolRec.Skip();
if ( pImpl->mpSecondary )
{
if ( !bSecondaryLoaded )
pImpl->mpSecondary->Load( rStream );
else
rStream.Seek( nSecondaryEnd );
}
// If not own Pool, then no name
if ( aExternName != pImpl->aName )
(pImpl->aName).clear();
pImpl->bStreaming = false;
return rStream;
};
sal_uInt16 SfxItemPool::GetIndex_Impl(sal_uInt16 nWhich) const
{
if (nWhich < pImpl->mnStart || nWhich > pImpl->mnEnd)
{
assert(false && "missing bounds check before use");
return 0;
}
return nWhich - pImpl->mnStart;
}
sal_uInt16 SfxItemPool::GetSize_Impl() const
{
return pImpl->mnEnd - pImpl->mnStart + 1;
}
/**
* Loads surrogate from 'rStream' and returns the corresponding SfxPoolItem
* from the rRefPool.
* If the surrogate contained within the stream == SFX_ITEMS_DIRECT
* (!poolable), we return 0 and the Item is to be loaded directly
* from the stream.
* We also return 0 for 0xfffffff0 (SFX_ITEMS_NULL) and rWhich is set to 0,
* making the Items unavailable.
*
* Apart from that we also take into account whether the Pool is loaded without
* RefCounts, if we reload from a new Pool (&rRefPool != this) or if we're
* building from a differently constructed Pool.
*
* If we load from a differently constructed Pool and the 'nSlotId' cannot be
* mapped to a WhichId of this Pool, we also return 0.
*
* Preconditions: - Pool must be loaded
* - LoadCompleted must not have been called yet
* - 'rStream' is at the position at which a surrogate
* for an Item with the SlotId 'nSlotId', the WhichId
* 'rWhichId' was saved with StoreSurrogate
*
* Postconditions: - 'rStream' is at the same position as after StoreSurrogate
* had finished saving
* - If we were able to load an Item, it's now in this
* SfxItemPool
* - 'rWhichId' now contains the mapped WhichId
*
* Runtime: Depth of the traget secondary Pool * 10 + 10
*
* @see SfxItemPool::StoreSurrogate(SvStream&,const SfxPoolItem &)const
*/
const SfxPoolItem* SfxItemPool::LoadSurrogate
(
SvStream& rStream, // Stream before a surrogate
sal_uInt16& rWhich, // WhichId of the SfxPoolItem that is to be loaded
sal_uInt16 nSlotId, // SlotId of the SfxPoolItem that is to be loaded
const SfxItemPool* pRefPool // SfxItemPool in which the surrogate is valid
)
{
// Read the first surrogate
sal_uInt32 nSurrogat(0);
rStream.ReadUInt32( nSurrogat );
// Is item stored directly?
if ( SFX_ITEMS_DIRECT == nSurrogat )
return nullptr;
// Item does not exist?
if ( SFX_ITEMS_NULL == nSurrogat )
{
rWhich = 0;
return nullptr;
}
// If the Pool in the stream has the same structure, the surrogate
// can be resolved in any case
if ( !pRefPool )
pRefPool = this;
bool bResolvable = !pRefPool->GetName().isEmpty();
if ( !bResolvable )
{
// If the pool in the stream has a different structure, the SlotId
// from the stream must be mapable to a WhichId
sal_uInt16 nMappedWhich = nSlotId ? GetWhich(nSlotId) : 0;
if ( IsWhich(nMappedWhich) )
{
// Mapped SlotId can be taken over
rWhich = nMappedWhich;
bResolvable = true;
}
}
// Can the surrogate be resolved?
if ( bResolvable )
{
const SfxPoolItem *pItem = nullptr;
for ( SfxItemPool *pTarget = this; pTarget; pTarget = pTarget->pImpl->mpSecondary )
{
// Found the right (Range-)Pool?
if ( pTarget->IsInRange(rWhich) )
{
// Default attribute?
if ( SFX_ITEMS_DEFAULT == nSurrogat )
return *(pTarget->pImpl->ppStaticDefaults +
pTarget->GetIndex_Impl(rWhich));
SfxPoolItemArray_Impl* pItemArr =
pTarget->pImpl->maPoolItems[pTarget->GetIndex_Impl(rWhich)];
pItem = pItemArr && nSurrogat < pItemArr->size()
? (*pItemArr)[nSurrogat]
: nullptr;
if ( !pItem )
{
OSL_FAIL( "can't resolve surrogate" );
rWhich = 0; // Just to be sure; for the right StreamPos
return nullptr;
}
// Reload from RefPool?
if ( pRefPool != pImpl->mpMaster )
return &pTarget->Put( *pItem );
// References have NOT been loaded together with the pool?
if ( !pTarget->pImpl->mbPersistentRefCounts )
AddRef( *pItem );
else
return pItem;
return pItem;
}
}
SFX_ASSERT( false, rWhich, "can't resolve Which-Id in LoadSurrogate" );
}
return nullptr;
}
/**
* Saves a surrogate for '*pItem' in 'rStream'
*
* @returns sal_True: a real surrogates has been saved
* SFX_ITEMS_NULL for 'pItem==0', SfxItemKind::StaticDefault
* and SfxItemKind::PoolDefault are 'real' surrogates
*
* @returns sal_False: a dummy surrogate (SFX_ITEMS_DIRECT) has been saved;
* the actual Item needs to be saved right after it on
* its own
*/
bool SfxItemPool::StoreSurrogate ( SvStream& rStream, const SfxPoolItem* pItem) const
{
if ( pItem )
{
bool bRealSurrogate = IsItemPoolable(*pItem);
rStream.WriteUInt32( bRealSurrogate
? GetSurrogate( pItem )
: SFX_ITEMS_DIRECT );
return bRealSurrogate;
}
rStream.WriteUInt32( SFX_ITEMS_NULL );
return true;
}
sal_uInt32 SfxItemPool::GetSurrogate(const SfxPoolItem *pItem) const
{
DBG_ASSERT( pItem, "no 0-Pointer Surrogate" );
DBG_ASSERT( !IsInvalidItem(pItem), "no Invalid-Item Surrogate" );
DBG_ASSERT( !IsPoolDefaultItem(pItem), "no Pool-Default-Item Surrogate" );
if ( !IsInRange(pItem->Which()) )
{
if ( pImpl->mpSecondary )
return pImpl->mpSecondary->GetSurrogate( pItem );
SFX_ASSERT( false, pItem->Which(), "unknown Which-Id - don't ask me for surrogates" );
}
// Pointer on static or pool-default attribute?
if( IsStaticDefaultItem(pItem) || IsPoolDefaultItem(pItem) )
return SFX_ITEMS_DEFAULT;
SfxPoolItemArray_Impl* pItemArr = pImpl->maPoolItems[GetIndex_Impl(pItem->Which())];
DBG_ASSERT(pItemArr, "ItemArr is not available");
for ( size_t i = 0; i < pItemArr->size(); ++i )
{
const SfxPoolItem *p = (*pItemArr)[i];
if ( p == pItem )
return i;
}
SFX_ASSERT( false, pItem->Which(), "Item not in the pool");
return SFX_ITEMS_NULL;
}
bool SfxItemPool::IsInStoringRange( sal_uInt16 nWhich ) const
{
return nWhich >= pImpl->nStoringStart &&
nWhich <= pImpl->nStoringEnd;
}
/**
* This method allows for restricting the WhichRange, which is saved
* by ItemSets of this Pool (and the Pool itself).
* The method must be called before SfxItemPool::Store() and the values
* must also be still set when the actual document (the ItemSets) is
* being saved.
*
* Resetting it is not necessary, if this range is set correctly before
* _every_ save, because its only accounted for when saving.
*
* We need to do this for the 3.1 format, because there's a bug in the
* Pool loading method.
*/
void SfxItemPool::SetStoringRange( sal_uInt16 nFrom, sal_uInt16 nTo )
{
pImpl->nStoringStart = nFrom;
pImpl->nStoringEnd = nTo;
}
/**
* This method allows for the creation of new and incompatible WhichId
* Ranges or distributions. Pools that were saved with old versions
* are mapped using the provided conversion table until the current
* version has been reached. Newer pools can be loaded, but will lose
* newer attributes, because the map is saved in conjunction with the pool.
*
* Precondition: Pool must not be loaded yet
* Postcondition: WhichIds from older versions can be mapped to version 'nVer'
* Runtime: 1.5 * new + 10
*
* For newer WhichRanges (nStart,nEnd) it must hold that older WhichRanges
* (nOldStart,nOldEnd) are completely contained in the newer WhichRange.
* It is valid to extend the WhichRange to both sides; also by inserting
* WhichIds. Moving WhichIds is not permitted.
* This method should only be called in or right after the ctor.
*
* The array must be static, because it's not copied and reused in the
* copy-ctor of the SfxItemPool
*
* Example usage:
* Originally (version 0) the pool had the following WhichIds:
*
* 1:A, 2:B, 3:C, 4:D
*
* A newer version (version 1) is now supposed to contain two new Ids
* X and Y between B and C, looking like this:
*
* 1:A, 2:B, 3:X, 4:Y, 5:C, 6:D
*
* We see that the Ids 3 and 4 have changed. For the new version, we
* would need to set the following in the new Pool:
*
* static sal_uInt16 nVersion1Map = { 1, 2, 5, 6 };
* pPool->SetVersionMap( 1, 1, 4, &nVersion1Map );
*
* @see SfxItemPool::IsLoadingVersionCurrent() const
* @see SfxItemPool::GetNewWhich(sal_uInt16)
* @see SfxItemPool::GetVersion() const
*/
void SfxItemPool::SetVersionMap
(
sal_uInt16 nVer, // New version number
sal_uInt16 nOldStart, // Old first WhichId
sal_uInt16 nOldEnd, // Old last WhichId
const sal_uInt16* pOldWhichIdTab /* Array containing the structure of the WhichIds
of the previous version, in which the new
corresponding new WhichId is located */
)
{
// Create new map entry to insert
const SfxPoolVersion_ImplPtr pVerMap = std::make_shared<SfxPoolVersion_Impl>(
nVer, nOldStart, nOldEnd, pOldWhichIdTab );
pImpl->aVersions.push_back( pVerMap );
DBG_ASSERT( nVer > pImpl->nVersion, "Versions not sorted" );
pImpl->nVersion = nVer;
// Adapt version range
for ( sal_uInt16 n = 0; n < nOldEnd-nOldStart+1; ++n )
{
sal_uInt16 nWhich = pOldWhichIdTab[n];
if ( nWhich < pImpl->nVerStart )
{
if ( !nWhich )
nWhich = 0;
pImpl->nVerStart = nWhich;
}
else if ( nWhich > pImpl->nVerEnd )
pImpl->nVerEnd = nWhich;
}
}
/**
* This method converts WhichIds from a file format to the version of the
* current pool.
* If the file format is older, the conversion tables (set by the pool developer
* using SetVersion()) are used. If the file format is newer the conversion tables
* loaded from the file format are used. In this case, not every WhichId can be
* mapped in which case we return 0.
*
* The calculation is only defined for WhichIds supported by the corresponding
* file version, which is guarded by an assertion.
*
* Precondition: Pool must be loaded
* Postcondition: Unchanged
* Runtime: linear(Count of the secondary pools) +
* linear(Difference of the old and newer version)
*
* @see SfxItemPool::IsLoadingVersionCurrent() const
* @see SfxItemPool::SetVersionMap(sal_uInt16,sal_uInt16,sal_uInt16,sal_uInt16*)
* @see SfxItemPool::GetVersion() const
*/
sal_uInt16 SfxItemPool::GetNewWhich
(
sal_uInt16 nFileWhich // The WhichId loaded from the stream
) const
{
// Determine (secondary) Pool
if ( !IsInVersionsRange(nFileWhich) )
{
if ( pImpl->mpSecondary )
return pImpl->mpSecondary->GetNewWhich( nFileWhich );
SFX_ASSERT( false, nFileWhich, "unknown which in GetNewWhich()" );
}
// Newer/the same/older version?
short nDiff = (short)pImpl->nLoadingVersion - (short)pImpl->nVersion;
// WhichId of a newer version?
if ( nDiff > 0 )
{
// Map step by step from the top version down to the file version
for ( size_t nMap = pImpl->aVersions.size(); nMap > 0; --nMap )
{
SfxPoolVersion_ImplPtr pVerInfo = pImpl->aVersions[nMap-1];
if ( pVerInfo->_nVer > pImpl->nVersion )
{ sal_uInt16 nOfs;
sal_uInt16 nCount = pVerInfo->_nEnd - pVerInfo->_nStart + 1;
for ( nOfs = 0;
nOfs <= nCount &&
pVerInfo->_pMap[nOfs] != nFileWhich;
++nOfs )
continue;
if ( pVerInfo->_pMap[nOfs] == nFileWhich )
nFileWhich = pVerInfo->_nStart + nOfs;
else
return 0;
}
else
break;
}
}
// WhichId of a newer version?
else if ( nDiff < 0 )
{
// Map step by step from the top version down to the file version
for (std::shared_ptr<SfxPoolVersion_Impl>& pVerInfo : pImpl->aVersions)
{
if ( pVerInfo->_nVer > pImpl->nLoadingVersion )
{
if (nFileWhich >= pVerInfo->_nStart &&
nFileWhich <= pVerInfo->_nEnd)
{
nFileWhich = pVerInfo->_pMap[nFileWhich - pVerInfo->_nStart];
}
else
{
SAL_WARN("svl.items", "which-id unknown in version");
}
}
}
}
// Return original (nDiff==0) or mapped (nDiff!=0) Id
return nFileWhich;
}
bool SfxItemPool::IsInVersionsRange( sal_uInt16 nWhich ) const
{
return nWhich >= pImpl->nVerStart && nWhich <= pImpl->nVerEnd;
}
/**
* This method determines whether the loaded Pool version corresponds to the
* currently loaded Pool structure.
*
* Precondition: Pool is loaded
* Postcondition: Unchanged
* Runtime: linear(Count of secondary pools)
*
* @see SfxItemPool::SetVersionMap(sal_uInt16,sal_uInt16,sal_uInt16,sal_uInt16*)
* @see SfxItemPool::GetNewWhich(sal_uInt16) const
* @see SfxItemPool::GetVersion() const
*/
bool SfxItemPool::IsCurrentVersionLoading() const
{
return ( pImpl->nVersion == pImpl->nLoadingVersion ) &&
( !pImpl->mpSecondary || pImpl->mpSecondary->IsCurrentVersionLoading() );
}
/**
* Saves the SfxPoolItem 'rItem' to the SvStream 'rStream':
* either as a surrogate ('bDirect == false') or directly with
* 'rItem.Store()'.
* Non-poolable Items are always saved directly. Items without WhichId and
* SID-Items as well as Items that were not yet present in the file format
* version (return false) are not saved.
*
* The Item is saved to the Stream in the following manner:
* sal_uInt16 rItem.Which()
* sal_uInt16 GetSlotId( rItem.Which() ) or 0 if not available
* sal_uInt16 GetSurrogate( &rItem ) or SFX_ITEM_DIRECT for '!SFX_ITEM_POOLABLE'
*
* Optionally (if 'bDirect == true' or '!rItem.IsPoolable()':
* sal_uInt16 rItem.GetVersion()
* sal_uLong Size
* Size rItem.Store()
*
* @see SfxItemPool::LoadItem(SvStream&,bool) const
*/
bool SfxItemPool::StoreItem( SvStream &rStream, const SfxPoolItem &rItem,
bool bDirect ) const
{
DBG_ASSERT( !IsInvalidItem(&rItem), "cannot store invalid items" );
if ( IsSlot( rItem.Which() ) )
return false;
const SfxItemPool *pPool = this;
while ( !pPool->IsInStoringRange(rItem.Which()) )
if ( nullptr == ( pPool = pPool->pImpl->mpSecondary ) )
return false;
DBG_ASSERT( !pImpl->bInSetItem || dynamic_cast<const SfxSetItem*>( &rItem ) == nullptr,
"SetItem contains ItemSet with SetItem" );
sal_uInt16 nSlotId = pPool->GetSlotId( rItem.Which() );
sal_uInt16 nItemVersion = rItem.GetVersion(pImpl->mnFileFormatVersion);
if ( USHRT_MAX == nItemVersion )
return false;
rStream.WriteUInt16( rItem.Which() ).WriteUInt16( nSlotId );
if ( bDirect || !pPool->StoreSurrogate( rStream, &rItem ) )
{
rStream.WriteUInt16( nItemVersion );
rStream.WriteUInt32( 0L ); // Room for length in bytes
sal_uLong nIStart = rStream.Tell();
rItem.Store(rStream, nItemVersion);
sal_uLong nIEnd = rStream.Tell();
rStream.Seek( nIStart-4 );
rStream.WriteInt32( nIEnd-nIStart );
rStream.Seek( nIEnd );
}
return true;
}
/**
* If pRefPool==-1 => do not put!
*/
const SfxPoolItem* SfxItemPool::LoadItem( SvStream &rStream,
const SfxItemPool *pRefPool )
{
sal_uInt16 nWhich(0), nSlot(0); // nSurrogate;
rStream.ReadUInt16( nWhich ).ReadUInt16( nSlot );
bool bDontPut = reinterpret_cast<SfxItemPool*>(-1) == pRefPool;
if ( bDontPut || !pRefPool )
pRefPool = this;
// Find right secondary Pool
while ( !pRefPool->IsInVersionsRange(nWhich) )
{
if ( pRefPool->pImpl->mpSecondary )
pRefPool = pRefPool->pImpl->mpSecondary;
else
{
// WID not present in this version => skip
sal_uInt32 nSurro(0);
sal_uInt16 nVersion(0), nLen(0);
rStream.ReadUInt32( nSurro );
if ( SFX_ITEMS_DIRECT == nSurro )
{
rStream.ReadUInt16( nVersion ).ReadUInt16( nLen );
rStream.SeekRel( nLen );
}
return nullptr;
}
}
// Are we loading a different version?
bool bCurVersion = pRefPool->IsCurrentVersionLoading();
if ( !bCurVersion )
nWhich = pRefPool->GetNewWhich( nWhich ); // Map WhichId to new version
DBG_ASSERT( !nWhich || !pImpl->bInSetItem ||
dynamic_cast<const SfxSetItem*>( pRefPool->pImpl->ppStaticDefaults[pRefPool->GetIndex_Impl(nWhich)] ) == nullptr,
"loading SetItem in ItemSet of SetItem" );
// Are we loading via surrogate?
const SfxPoolItem *pItem = nullptr;
// WhichId known in this version?
if ( nWhich )
// Load surrogate and react if none present
pItem = LoadSurrogate( rStream, nWhich, nSlot, pRefPool );
else
// Else skip it
rStream.SeekRel( sizeof(sal_uInt16) );
// Is loaded directly (not via surrogate)?
if ( nWhich && !pItem )
{
// bDirekt or not IsPoolable() => Load Item directly
sal_uInt16 nVersion(0);
sal_uInt32 nLen(0);
rStream.ReadUInt16( nVersion ).ReadUInt32( nLen );
sal_uLong nIStart = rStream.Tell();
// Load Item directly
SfxPoolItem *pNewItem =
pRefPool->GetDefaultItem(nWhich).Create(rStream, nVersion);
if ( bDontPut )
pItem = pNewItem;
else
if ( pNewItem )
{
pItem = &Put(*pNewItem);
delete pNewItem;
}
else
pItem = nullptr;
sal_uLong nIEnd = rStream.Tell();
DBG_ASSERT( nIEnd <= (nIStart+nLen), "read past end of item" );
if ( (nIStart+nLen) != nIEnd )
rStream.Seek( nIStart+nLen );
}
return pItem;
}
OUString readByteString(SvStream& rStream)
{
return rStream.ReadUniOrByteString(rStream.GetStreamCharSet());
}
void writeByteString(SvStream & rStream, const OUString& rString)
{
rStream.WriteUniOrByteString(rString, rStream.GetStreamCharSet());
}
OUString readUnicodeString(SvStream & rStream, bool bUnicode)
{
return rStream.ReadUniOrByteString(bUnicode ? RTL_TEXTENCODING_UCS2 :
rStream.GetStreamCharSet());
}
void writeUnicodeString(SvStream & rStream, const OUString& rString)
{
rStream.WriteUniOrByteString(rString, RTL_TEXTENCODING_UCS2);
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|