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 | /* -*- 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 "propread.hxx"
#include <rtl/tencinfo.h>
#include <rtl/textenc.h>
#include <sal/log.hxx>
#include <o3tl/sorted_vector.hxx>
#include <osl/diagnose.h>
#include <memory>
PropEntry::PropEntry( sal_uInt32 nId, const sal_uInt8* pBuf, sal_uInt32 nBufSize ) :
mnId ( nId ),
mnSize ( nBufSize ),
mpBuf ( new sal_uInt8[ nBufSize ] )
{
memcpy( mpBuf.get(), pBuf, nBufSize );
};
PropEntry::PropEntry( const PropEntry& rProp ) :
mnId ( rProp.mnId ),
mnSize ( rProp.mnSize ),
mpBuf ( new sal_uInt8[ mnSize ] )
{
memcpy( mpBuf.get(), rProp.mpBuf.get(), mnSize );
};
PropEntry& PropEntry::operator=(const PropEntry& rPropEntry)
{
if ( this != &rPropEntry )
{
mnId = rPropEntry.mnId;
mnSize = rPropEntry.mnSize;
mpBuf.reset( new sal_uInt8[ mnSize ] );
memcpy( mpBuf.get(), rPropEntry.mpBuf.get(), mnSize );
}
return *this;
}
void PropItem::Clear()
{
Seek( STREAM_SEEK_TO_BEGIN );
delete[] static_cast<sal_uInt8*>(SwitchBuffer());
}
static sal_Int32 lcl_getMaxSafeStrLen(sal_uInt32 nSize)
{
nSize -= 1; //Drop NULL terminator
//If it won't fit in a string, clip it to the max size that does
if (nSize > SAL_MAX_INT32)
nSize = SAL_MAX_INT32;
return static_cast< sal_Int32 >( nSize );
}
bool PropItem::Read( OUString& rString, sal_uInt32 nStringType, bool bAlign )
{
sal_uInt32 nType, nItemPos;
bool bRetValue = false;
nItemPos = Tell();
if ( nStringType == VT_EMPTY )
{
nType = VT_NULL; // Initialize in case stream fails.
ReadUInt32( nType );
}
else
nType = nStringType & VT_TYPEMASK;
sal_uInt32 nItemSize(0); // Initialize in case stream fails.
ReadUInt32(nItemSize);
switch( nType )
{
case VT_LPSTR :
{
if (nItemSize)
{
auto nMaxSizePossible = remainingSize();
if (nItemSize > nMaxSizePossible)
{
SAL_WARN("sd.filter", "String of Len " << nItemSize << " claimed, only " << nMaxSizePossible << " possible");
nItemSize = nMaxSizePossible;
}
}
if (nItemSize)
{
try
{
std::unique_ptr<char[]> pString( new char[ nItemSize ] );
if ( mnTextEnc == RTL_TEXTENCODING_UCS2 )
{
nItemSize >>= 1;
if ( nItemSize > 1 )
{
sal_Unicode* pWString = reinterpret_cast<sal_Unicode*>(pString.get());
for (sal_uInt32 i = 0; i < nItemSize; ++i)
ReadUtf16( pWString[ i ] );
rString = OUString(pWString, lcl_getMaxSafeStrLen(nItemSize));
}
else
rString.clear();
bRetValue = true;
}
else
{
SvMemoryStream::ReadBytes(pString.get(), nItemSize);
if ( pString[ nItemSize - 1 ] == 0 )
{
if ( nItemSize > 1 )
rString = OUString(pString.get(), rtl_str_getLength(pString.get()), mnTextEnc);
else
rString.clear();
bRetValue = true;
}
}
}
catch( const std::bad_alloc& )
{
OSL_FAIL( "sd PropItem::Read bad alloc" );
}
}
if ( bAlign )
SeekRel( ( 4 - ( nItemSize & 3 ) ) & 3 ); // dword align
}
break;
case VT_LPWSTR :
{
if (nItemSize)
{
auto nMaxSizePossible = remainingSize() / sizeof(sal_Unicode);
if (nItemSize > nMaxSizePossible)
{
SAL_WARN("sd.filter", "String of Len " << nItemSize << " claimed, only " << nMaxSizePossible << " possible");
nItemSize = nMaxSizePossible;
}
}
if (nItemSize)
{
try
{
std::unique_ptr<sal_Unicode[]> pString( new sal_Unicode[ nItemSize ] );
for (sal_uInt32 i = 0; i < nItemSize; ++i)
ReadUtf16( pString[ i ] );
if ( pString[ nItemSize - 1 ] == 0 )
{
if ( static_cast<sal_uInt16>(nItemSize) > 1 )
rString = OUString(pString.get(), lcl_getMaxSafeStrLen(nItemSize));
else
rString.clear();
bRetValue = true;
}
}
catch( const std::bad_alloc& )
{
OSL_FAIL( "sd PropItem::Read bad alloc" );
}
}
if ( bAlign && ( nItemSize & 1 ) )
SeekRel( 2 ); // dword align
}
break;
}
if ( !bRetValue )
Seek( nItemPos );
return bRetValue;
}
PropItem& PropItem::operator=( PropItem& rPropItem )
{
if ( this != &rPropItem )
{
Seek( STREAM_SEEK_TO_BEGIN );
delete[] static_cast<sal_uInt8*>(SwitchBuffer());
mnTextEnc = rPropItem.mnTextEnc;
SvMemoryStream::WriteBytes(rPropItem.GetData(), rPropItem.TellEnd());
}
return *this;
}
Section::Section( const Section& rSection )
: mnTextEnc(rSection.mnTextEnc)
{
for ( int i = 0; i < 16; i++ )
aFMTID[ i ] = rSection.aFMTID[ i ];
for(const std::unique_ptr<PropEntry>& rEntry : rSection.maEntries)
maEntries.push_back(std::make_unique<PropEntry>(*rEntry));<--- Consider using std::transform algorithm instead of a raw loop.
}
Section::Section( const sal_uInt8* pFMTID ) : mnTextEnc(RTL_TEXTENCODING_MS_1252)
{
for ( int i = 0; i < 16; i++ )
aFMTID[ i ] = pFMTID[ i ];
}
bool Section::GetProperty( sal_uInt32 nId, PropItem& rPropItem )
{
if ( nId )
{
auto iter = std::find_if(maEntries.begin(), maEntries.end(),
[nId](const std::unique_ptr<PropEntry>& rxEntry) { return rxEntry->mnId == nId; });
if (iter != maEntries.end())
{
rPropItem.Clear();
rPropItem.SetTextEncoding( mnTextEnc );
rPropItem.WriteBytes( (*iter)->mpBuf.get(), (*iter)->mnSize );
rPropItem.Seek( STREAM_SEEK_TO_BEGIN );
return true;
}
}
return false;
}
void Section::AddProperty( sal_uInt32 nId, const sal_uInt8* pBuf, sal_uInt32 nBufSize )
{
// just a simple id check
if ( !nId )
return;
if ( nId == 0xffffffff )
nId = 0;
// do not allow same PropId's, sort
auto iter = std::find_if(maEntries.begin(), maEntries.end(),
[nId](const std::unique_ptr<PropEntry>& rxEntry) { return rxEntry->mnId >= nId; });
if (iter != maEntries.end())
{
if ( (*iter)->mnId == nId )
(*iter).reset(new PropEntry( nId, pBuf, nBufSize ));
else
maEntries.insert( iter, std::make_unique<PropEntry>( nId, pBuf, nBufSize ));
}
else
{
maEntries.push_back( std::make_unique<PropEntry>( nId, pBuf, nBufSize ) );
}
}
void Section::GetDictionary(Dictionary& rDict)
{
auto iter = std::find_if(maEntries.begin(), maEntries.end(),
[](const std::unique_ptr<PropEntry>& rxEntry) { return rxEntry->mnId == 0; });
if (iter == maEntries.end())
return;
SvMemoryStream aStream( (*iter)->mpBuf.get(), (*iter)->mnSize, StreamMode::READ );
aStream.Seek( STREAM_SEEK_TO_BEGIN );
sal_uInt32 nDictCount(0);
aStream.ReadUInt32( nDictCount );
for (sal_uInt32 i = 0; i < nDictCount; ++i)
{
sal_uInt32 nId(0), nSize(0);
aStream.ReadUInt32(nId).ReadUInt32(nSize);
if (!aStream.good() || nSize > aStream.remainingSize())
break;
if (mnTextEnc == RTL_TEXTENCODING_UCS2)
nSize >>= 1;
if (!nSize)
continue;
OUString aString;
try
{
if ( mnTextEnc == RTL_TEXTENCODING_UCS2 )
{
std::unique_ptr<sal_Unicode[]> pWString( new sal_Unicode[nSize] );
for (sal_uInt32 j = 0; j < nSize; ++j)
aStream.ReadUtf16(pWString[j]);
aString = OUString(pWString.get(), lcl_getMaxSafeStrLen(nSize));
}
else
{
std::unique_ptr<char[]> pString( new char[nSize] );
aStream.ReadBytes(pString.get(), nSize);
aString = OUString(pString.get(), lcl_getMaxSafeStrLen(nSize), mnTextEnc);
}
}
catch( const std::bad_alloc& )
{
OSL_FAIL( "sd Section::GetDictionary bad alloc" );
}
if (aString.isEmpty())
break;
rDict.insert( std::make_pair(aString,nId) );
}
}
void Section::Read( SotStorageStream *pStrm )
{
sal_uInt32 nSecOfs = pStrm->Tell();
sal_uInt32 nStrmSize = pStrm->remainingSize();
mnTextEnc = RTL_TEXTENCODING_MS_1252;
sal_uInt32 nSecSize(0), nPropCount(0);
pStrm->ReadUInt32(nSecSize).ReadUInt32(nPropCount);
if (nSecSize > nStrmSize)
{
SAL_WARN("sd.filter", "Section Len " << nSecSize << " claimed, only " << nStrmSize << " possible");
nSecSize = nStrmSize;
}
while (nPropCount--)
{
sal_uInt32 nPropId(0), nPropOfs(0);
pStrm->ReadUInt32(nPropId).ReadUInt32(nPropOfs);
if (!pStrm->good())
break;
auto nCurrent = pStrm->Tell();
sal_uInt64 nOffset = nPropOfs + nSecOfs;
if (!checkSeek(*pStrm, nOffset))
break;
if ( nPropId ) // do not read dictionary
{
sal_uInt32 nPropType(0), nVectorCount(0);
pStrm->ReadUInt32(nPropType);
sal_uInt32 nPropSize = 4;
if ( nPropType & VT_VECTOR )
{
pStrm->ReadUInt32( nVectorCount );
nPropType &=~VT_VECTOR;
nPropSize += 4;
}
else
nVectorCount = 1;
bool bVariant = ( nPropType == VT_VARIANT );
o3tl::sorted_vector<sal_uInt64> aVisitedOffsets;
for (sal_uInt32 i = 0; nPropSize && i < nVectorCount && pStrm->good(); ++i)
{
if ( bVariant )
{
pStrm->ReadUInt32( nPropType );
nPropSize += 4;
}
sal_uInt32 nTemp(0);
switch( nPropType )
{
case VT_UI1 :
nPropSize++;
break;
case VT_I2 :
case VT_UI2 :
case VT_BOOL :
nPropSize += 2;
break;
case VT_I4 :
case VT_R4 :
case VT_UI4 :
case VT_ERROR :
nPropSize += 4;
break;
case VT_I8 :
case VT_R8 :
case VT_CY :
case VT_UI8 :
case VT_DATE :
case VT_FILETIME :
nPropSize += 8;
break;
case VT_BSTR :
pStrm->ReadUInt32( nTemp );
nPropSize += ( nTemp + 4 );
break;
case VT_LPSTR :
pStrm->ReadUInt32( nTemp );
nPropSize += ( nTemp + 4 );
break;
case VT_LPWSTR :
{
pStrm->ReadUInt32( nTemp );
// looks like these are aligned to 4 bytes
sal_uInt32 nLength = nPropOfs + nSecOfs + nPropSize + ( nTemp << 1 ) + 4;
nPropSize += ( nTemp << 1 ) + 4 + (nLength % 4);
}
break;
case VT_BLOB_OBJECT :
case VT_BLOB :
case VT_CF :
pStrm->ReadUInt32( nTemp );
nPropSize += ( nTemp + 4 );
break;
case VT_CLSID :
case VT_STREAM :
case VT_STORAGE :
case VT_STREAMED_OBJECT :
case VT_STORED_OBJECT :
case VT_VARIANT :
case VT_VECTOR :
default :
nPropSize = 0;
}
if ( nPropSize )
{
if ( ( nVectorCount - i ) > 1 )
{
nOffset = nPropOfs + nSecOfs + nPropSize;
if (!checkSeek(*pStrm, nOffset))
break;
// inserts returns false if an equivalent element already existed
if (!aVisitedOffsets.insert(nOffset).second)
{
SAL_WARN("sd.filter", "loop in Section::Read property list");
break;
}
}
}
else
break;
}
if ( nPropSize )
{
if ( nPropSize > nStrmSize )
{
break;
}
pStrm->Seek( nPropOfs + nSecOfs );
// make sure we don't overflow the section size
if( nPropSize > nSecSize - nSecOfs )
nPropSize = nSecSize - nSecOfs;
std::unique_ptr<sal_uInt8[]> pBuf( new sal_uInt8[ nPropSize ] );
nPropSize = pStrm->ReadBytes(pBuf.get(), nPropSize);
AddProperty( nPropId, pBuf.get(), nPropSize );
}
if ( nPropId == 1 )
{
PropItem aPropItem;
if ( GetProperty( 1, aPropItem ) )
{
aPropItem.ReadUInt32( nPropType );
if ( nPropType == VT_I2 )
{
sal_uInt16 nCodePage(0);
aPropItem.ReadUInt16(nCodePage);
if ( nCodePage == 1200 )
{
mnTextEnc = RTL_TEXTENCODING_UCS2;
}
else
{
mnTextEnc = rtl_getTextEncodingFromWindowsCodePage( nCodePage );
if ( mnTextEnc == RTL_TEXTENCODING_DONTKNOW )
mnTextEnc = RTL_TEXTENCODING_MS_1252;
}
}
else
{
mnTextEnc = RTL_TEXTENCODING_MS_1252;
}
}
}
}
else
{
sal_uInt32 nDictCount(0);
pStrm->ReadUInt32(nDictCount);
auto nMaxRecordsPossible = pStrm->remainingSize() / (sizeof(sal_uInt32)*2);
if (nDictCount > nMaxRecordsPossible)
{
SAL_WARN("sd.filter", "Dictionary count of " << nDictCount << " claimed, only " << nMaxRecordsPossible << " possible");
nDictCount = nMaxRecordsPossible;
}
for (sal_uInt32 i = 0; i < nDictCount; ++i)
{
sal_uInt32 nSize(0);
pStrm->ReadUInt32( nSize ).ReadUInt32( nSize );
if (!pStrm->good())
break;
sal_uInt64 nPos = pStrm->Tell() + nSize;
if (!checkSeek(*pStrm, nPos))
break;
}
sal_uInt32 nSize = pStrm->Tell();
pStrm->Seek( nPropOfs + nSecOfs );
nSize -= pStrm->Tell();
if ( nSize > nStrmSize )
{
break;
}
std::unique_ptr<sal_uInt8[]> pBuf( new sal_uInt8[ nSize ] );
nSize = pStrm->ReadBytes(pBuf.get(), nSize);
AddProperty( 0xffffffff, pBuf.get(), nSize );
}
pStrm->Seek(nCurrent);
}
pStrm->Seek(nSecOfs + nSecSize);
}
Section& Section::operator=( const Section& rSection )
{
if ( this != &rSection )
{
memcpy( static_cast<void*>(aFMTID), static_cast<void const *>(rSection.aFMTID), 16 );
for(const std::unique_ptr<PropEntry>& rEntry : rSection.maEntries)
maEntries.push_back(std::make_unique<PropEntry>(*rEntry));<--- Consider using std::transform algorithm instead of a raw loop.
}
return *this;
}
PropRead::PropRead( SotStorage& rStorage, const OUString& rName ) :
mbStatus ( false ),
mnByteOrder ( 0xfffe )
{
if ( rStorage.IsStream( rName ) )
{
mpSvStream = rStorage.OpenSotStream( rName, StreamMode::STD_READ );
if ( mpSvStream.is() )
{
mpSvStream->SetEndian( SvStreamEndian::LITTLE );
memset( mApplicationCLSID, 0, 16 );
mbStatus = true;
}
}
}
const Section* PropRead::GetSection( const sal_uInt8* pFMTID )
{
auto it = std::find_if(maSections.begin(), maSections.end(),
[&pFMTID](const std::unique_ptr<Section>& rxSection) { return memcmp( rxSection->GetFMTID(), pFMTID, 16 ) == 0; });
if (it != maSections.end())
return it->get();
return nullptr;
}
void PropRead::Read()
{
maSections.clear();
if ( !mbStatus )
return;
sal_uInt16 mnVersionLo;
sal_uInt16 mnVersionHi;
sal_uInt16 mnFormat;
mpSvStream->ReadUInt16( mnByteOrder ).ReadUInt16( mnFormat ).ReadUInt16( mnVersionLo ).ReadUInt16( mnVersionHi );
if ( mnByteOrder != 0xfffe )
return;
std::vector<sal_uInt8> aSectCLSID(16);
mpSvStream->ReadBytes(mApplicationCLSID, 16);
sal_uInt32 nSections(0);
mpSvStream->ReadUInt32(nSections);
if ( nSections > 2 ) // sj: PowerPoint documents are containing max 2 sections
{
mbStatus = false;
}
else for ( sal_uInt32 i = 0; i < nSections; i++ )
{
mpSvStream->ReadBytes(aSectCLSID.data(), aSectCLSID.size());
sal_uInt32 nSectionOfs(0);
mpSvStream->ReadUInt32( nSectionOfs );
sal_uInt32 nCurrent = mpSvStream->Tell();
if (checkSeek(*mpSvStream, nSectionOfs))
{
Section aSection(aSectCLSID.data());
aSection.Read(mpSvStream.get());
maSections.push_back(std::make_unique<Section>(aSection));
}
mpSvStream->Seek( nCurrent );
}
}
PropRead& PropRead::operator=( const PropRead& rPropRead )
{
if ( this != &rPropRead )
{
mbStatus = rPropRead.mbStatus;
mpSvStream = rPropRead.mpSvStream;
mnByteOrder = rPropRead.mnByteOrder;
memcpy( mApplicationCLSID, rPropRead.mApplicationCLSID, 16 );
for(const std::unique_ptr<Section>& rSection : rPropRead.maSections)
maSections.push_back(std::make_unique<Section>(*rSection));<--- Consider using std::transform algorithm instead of a raw loop.
}
return *this;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|