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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _SFXITEMPOOL_HXX
#define _SFXITEMPOOL_HXX
#include "svl/svldllapi.h"
#ifndef INCLUDED_LIMITS_H
#include <limits.h>
#define INCLUDED_LIMITS_H
#endif
#include <tools/solar.h>
#include <tools/string.hxx>
#include <svl/svarray.hxx>
#include <svl/poolitem.hxx>
#include <vector>
class SvStream;
class SfxBroadcaster;
struct SfxItemPool_Impl;
#define SFX_WHICH_MAX 4999
DBG_NAMEEX(SfxItemPool)
//====================================================================
#define SFX_ITEM_POOLABLE 0x0001
#define SFX_ITEM_NOT_POOLABLE 0x0002
#define SFX_ITEM_USERFLAG0 0x0100
#define SFX_ITEM_USERFLAG1 0x0200
#define SFX_ITEM_USERFLAG2 0x0400
#define SFX_ITEM_USERFLAG3 0x0800
#define SFX_ITEM_USERFLAG4 0x1000
#define SFX_ITEM_USERFLAG5 0x2000
#define SFX_ITEM_USERFLAG6 0x4000
#define SFX_ITEM_USERFLAG7 0x8000
#define SFX_ITEM_USERFLAG8 0x0010
#define SFX_ITEM_USERFLAG9 0x0020
#define SFX_ITEM_USERFLAGA 0x0040
#define SFX_ITEM_USERFLAGB 0x0080
//====================================================================
struct SfxItemInfo
{
USHORT _nSID;
USHORT _nFlags;
};
//====================================================================
class SfxStyleSheetIterator;
struct SfxPoolItemArray_Impl;
class SfxItemPool;
class SVL_DLLPUBLIC SfxItemPoolUser
{
public:
virtual void ObjectInDestruction(const SfxItemPool& rSfxItemPool) = 0;
};
typedef ::std::vector< SfxItemPoolUser* > SfxItemPoolUserVector;
class SVL_DLLPUBLIC SfxItemPool
/* [Beschreibung]
Die von dieser Klasse abgeleiteten Klassen dienen der Bereitstellung von
Defaults von SfxPoolItems und halten konkrete (konstante) Instanzen, die
dann von mehreren Stellen (i.d.R. eines Dokuments) referenziert werden
k�nnen.
Dadurch ist jeder Wert nur einmalig gespeichert, was zu wenig Konstruktor
und Destruktor-Aufrufen f�hrt, Vergleiche zwischen Items eines Dokuments
beschleunigt und ein einfaches Laden und Speichern von Attributen
bereitstellt.
*/
{
SVL_DLLPRIVATE void readTheItems(SvStream & rStream, sal_uInt32 nCount, USHORT nVersion,
SfxPoolItem * pDefItem, SfxPoolItemArray_Impl ** pArr);
UniString aName;
USHORT nStart, nEnd;
USHORT _nFileFormatVersion;
#ifdef TF_POOLABLE
const SfxItemInfo* pItemInfos;
#else
USHORT* pSlotIds;
#endif
SfxItemPool_Impl* pImp;
SfxPoolItem** ppStaticDefaults;
SfxPoolItem** ppPoolDefaults;
SfxItemPool* pSecondary;
SfxItemPool* pMaster;
USHORT* _pPoolRanges;
FASTBOOL bPersistentRefCounts;
private:
// ObjectUser section
SfxItemPoolUserVector maSfxItemPoolUsers;
public:
void AddSfxItemPoolUser(SfxItemPoolUser& rNewUser);
void RemoveSfxItemPoolUser(SfxItemPoolUser& rOldUser);
//---------------------------------------------------------------------
#ifndef _SFXITEMS_HXX
friend class SfxPoolWhichMap;
private:
inline USHORT GetIndex_Impl(USHORT nWhich) const;
inline USHORT GetSize_Impl() const { return nEnd - nStart + 1; }
SVL_DLLPRIVATE SvStream& Load1_Impl( SvStream &rStream );
SVL_DLLPRIVATE FASTBOOL IsItemFlag_Impl( USHORT nWhich, USHORT nFlag ) const;
public:
// fuer dflt. SfxItemSet::CTOR, setze dflt. WhichRanges
void FillItemIdRanges_Impl( USHORT*& pWhichRanges ) const;
const USHORT* GetFrozenIdRanges() const
{ return _pPoolRanges; }
FASTBOOL IsVer2_Impl() const;
#endif
//---------------------------------------------------------------------
protected:
static inline void SetRefCount( SfxPoolItem& rItem, ULONG n );
static inline ULONG AddRef( const SfxPoolItem& rItem, ULONG n = 1 );
static inline ULONG ReleaseRef( const SfxPoolItem& rItem, ULONG n = 1);
public:
SfxItemPool( const SfxItemPool &rPool,
BOOL bCloneStaticDefaults = FALSE );
SfxItemPool( const UniString &rName,
USHORT nStart, USHORT nEnd,
#ifdef TF_POOLABLE
const SfxItemInfo *pItemInfos,
#endif
SfxPoolItem **pDefaults = 0,
#ifndef TF_POOLABLE
USHORT *pSlotIds = 0,
#endif
FASTBOOL bLoadRefCounts = TRUE );
protected:
virtual ~SfxItemPool();
public:
static void Free(SfxItemPool* pPool);
SfxBroadcaster& BC();
void SetPoolDefaultItem( const SfxPoolItem& );
const SfxPoolItem* GetPoolDefaultItem( USHORT nWhich ) const;
void ResetPoolDefaultItem( USHORT nWhich );
void SetDefaults( SfxPoolItem **pDefaults );
void ReleaseDefaults( BOOL bDelete = FALSE );
static void ReleaseDefaults( SfxPoolItem **pDefaults, USHORT nCount, BOOL bDelete = FALSE );
virtual SfxMapUnit GetMetric( USHORT nWhich ) const;
void SetDefaultMetric( SfxMapUnit eNewMetric );
virtual SfxItemPresentation GetPresentation( const SfxPoolItem& rItem,
SfxItemPresentation ePresentation,
SfxMapUnit ePresentationMetric,
XubString& rText,
const IntlWrapper * pIntlWrapper
= 0 ) const;
virtual SfxItemPool* Clone() const;
UniString const & GetName() const { return aName; }
virtual const SfxPoolItem& Put( const SfxPoolItem&, USHORT nWhich = 0 );
virtual void Remove( const SfxPoolItem& );
virtual const SfxPoolItem& GetDefaultItem( USHORT nWhich ) const;
const SfxPoolItem* LoadItem( SvStream &rStream,
FASTBOOL bDirect = FALSE,
const SfxItemPool *pRefPool = 0 );
FASTBOOL StoreItem( SvStream &rStream,
const SfxPoolItem &rItem,
FASTBOOL bDirect = FALSE ) const;
sal_uInt32 GetSurrogate(const SfxPoolItem *) const;
const SfxPoolItem * GetItem2(USHORT nWhich, sal_uInt32 nSurrogate) const;
sal_uInt32 GetItemCount2(USHORT nWhich) const;
const SfxPoolItem* LoadSurrogate(SvStream& rStream,
USHORT &rWhich, USHORT nSlotId,
const SfxItemPool* pRefPool = 0 );
FASTBOOL StoreSurrogate(SvStream& rStream,
const SfxPoolItem *pItem ) const;
virtual SvStream & Load(SvStream &);
virtual SvStream & Store(SvStream &) const;
int HasPersistentRefCounts() const {
return bPersistentRefCounts; }
void LoadCompleted();
USHORT GetFirstWhich() const { return nStart; }
USHORT GetLastWhich() const { return nEnd; }
FASTBOOL IsInRange( USHORT nWhich ) const {
return nWhich >= nStart &&
nWhich <= nEnd; }
FASTBOOL IsInVersionsRange( USHORT nWhich ) const;
FASTBOOL IsInStoringRange( USHORT nWhich ) const;
void SetStoringRange( USHORT nFrom, USHORT nTo );
void SetSecondaryPool( SfxItemPool *pPool );
SfxItemPool* GetSecondaryPool() const {
return pSecondary; }
SfxItemPool* GetMasterPool() const {
return pMaster; }
void FreezeIdRanges();
void Cleanup();
void Delete();
#ifdef TF_POOLABLE
FASTBOOL IsItemFlag( USHORT nWhich, USHORT nFlag ) const;
FASTBOOL IsItemFlag( const SfxPoolItem &rItem, USHORT nFlag ) const
{ return IsItemFlag( rItem.Which(), nFlag ); }
void SetItemInfos( const SfxItemInfo *pInfos )
{ pItemInfos = pInfos; }
#else
int HasMap() const { return 0 != pSlotIds; }
void SetMap( USHORT *pNewSlotIds )
{ pSlotIds = pNewSlotIds; }
#endif
USHORT GetWhich( USHORT nSlot, BOOL bDeep = TRUE ) const;
USHORT GetSlotId( USHORT nWhich, BOOL bDeep = TRUE ) const;
USHORT GetTrueWhich( USHORT nSlot, BOOL bDeep = TRUE ) const;
USHORT GetTrueSlotId( USHORT nWhich, BOOL bDeep = TRUE ) const;
void SetVersionMap( USHORT nVer,
USHORT nOldStart, USHORT nOldEnd,
USHORT *pWhichIdTab );
USHORT GetNewWhich( USHORT nOldWhich ) const;
USHORT GetVersion() const;
USHORT GetFileFormatVersion() const
{ return _nFileFormatVersion; }
void SetFileFormatVersion( USHORT nFileFormatVersion );
USHORT GetLoadingVersion() const;
FASTBOOL IsCurrentVersionLoading() const;
static int IsWhich(USHORT nId) {
return nId && nId <= SFX_WHICH_MAX; }
static int IsSlot(USHORT nId) {
return nId && nId > SFX_WHICH_MAX; }
static const SfxItemPool* GetStoringPool();
static void SetStoringPool( const SfxItemPool * );
private:
const SfxItemPool& operator=(const SfxItemPool &); // n.i.!!
};
// --------------- Inline Implementierungen ------------------------------
// nur der Pool darf den Referenz-Zaehler manipulieren !!!
inline void SfxItemPool::SetRefCount( SfxPoolItem& rItem, ULONG n )
{
rItem.SetRefCount(n);
}
// nur der Pool darf den Referenz-Zaehler manipulieren !!!
inline ULONG SfxItemPool::AddRef( const SfxPoolItem& rItem, ULONG n )
{
return rItem.AddRef(n);
}
// nur der Pool darf den Referenz-Zaehler manipulieren !!!
inline ULONG SfxItemPool::ReleaseRef( const SfxPoolItem& rItem, ULONG n )
{
return rItem.ReleaseRef(n);
}
#endif
|
