Newer
Older
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
/*
* The Apache Software License, Version 1.1
*
* Copyright (c) 1999-2003 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. 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.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Xerces" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache\@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 APACHE SOFTWARE FOUNDATION OR
* ITS 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.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation, and was
* originally based on software copyright (c) 1999, International
* Business Machines, Inc., http://www.ibm.com . For more information
* on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*/
/*
* $Log$
* Revision 1.9 2003/11/05 18:20:20 peiyongz
* cleanup deserialized grammars if exception thrown during loading
*
* Revision 1.8 2003/10/29 16:16:08 peiyongz
* GrammarPool' serialization/deserialization support
*
Neil Graham
committed
* Revision 1.7 2003/10/10 18:36:41 neilg
* update XMLGrammarPool default implementation to reflect recent modifications to the base interface.
*
Neil Graham
committed
* Revision 1.6 2003/10/09 13:54:25 neilg
* modify grammar pool implementation to that, once locked, a thread-safe StringPool is used
*
Neil Graham
committed
* Revision 1.5 2003/09/16 18:30:54 neilg
* make Grammar pool be responsible for creating and owning URI string pools. This is one more step towards having grammars be independent of the parsers involved in their creation
*
* Revision 1.4 2003/09/02 08:59:02 gareth
* Added API to get enumerator of grammars.
*
* Revision 1.3 2003/07/31 17:05:03 peiyongz
* Grammar embed Grammar Description
* using getGrammar(URI)
* update GrammarDescription info
*
* Revision 1.2 2003/06/20 22:19:30 peiyongz
* Stateless Grammar Pool :: Part I
*
* Revision 1.1 2003/06/20 18:38:39 peiyongz
* Stateless Grammar Pool :: Part I
*
* $Id$
*
*/
// ---------------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------------
#include <xercesc/internal/XMLGrammarPoolImpl.hpp>
#include <xercesc/internal/XSerializeEngine.hpp>
#include <xercesc/internal/XTemplateSerializer.hpp>
#include <xercesc/validators/DTD/DTDGrammar.hpp>
#include <xercesc/validators/DTD/XMLDTDDescriptionImpl.hpp>
#include <xercesc/validators/schema/SchemaGrammar.hpp>
#include <xercesc/validators/schema/XMLSchemaDescriptionImpl.hpp>
#include <xercesc/util/SynchronizedStringPool.hpp>
XERCES_CPP_NAMESPACE_BEGIN
// ---------------------------------------------------------------------------
// XMLGrammarPoolImpl: constructor and destructor
// ---------------------------------------------------------------------------
XMLGrammarPoolImpl::~XMLGrammarPoolImpl()
{
delete fGrammarRegistry;
Neil Graham
committed
delete fStringPool;
Neil Graham
committed
if(fSynchronizedStringPool)
delete fSynchronizedStringPool;
}
XMLGrammarPoolImpl::XMLGrammarPoolImpl(MemoryManager* const memMgr)
:XMLGrammarPool(memMgr)
,fGrammarRegistry(0)
Neil Graham
committed
,fStringPool(0)
Neil Graham
committed
,fSynchronizedStringPool(0)
,fLocked(false)
fGrammarRegistry = new (memMgr) RefHashTableOf<Grammar>(29, true, memMgr);
Neil Graham
committed
fStringPool = new (memMgr) XMLStringPool(109, memMgr);
}
// -----------------------------------------------------------------------
// Implementation of Grammar Pool Interface
// -----------------------------------------------------------------------
void XMLGrammarPoolImpl::cacheGrammar(Grammar* const gramToCache )
const XMLCh* grammarKey = gramToCache->getGrammarDescription()->getGrammarKey();
if (fGrammarRegistry->containsKey(grammarKey))
{
ThrowXML(RuntimeException, XMLExcepts::GC_ExistingGrammar);
}
fGrammarRegistry->put((void*) grammarKey, gramToCache);
}
Grammar* XMLGrammarPoolImpl::retrieveGrammar(XMLGrammarDescription* const gramDesc)
{
if (!gramDesc)
return 0;
/***
* This implementation simply use GrammarKey
*/
return fGrammarRegistry->get(gramDesc->getGrammarKey());
Grammar* XMLGrammarPoolImpl::orphanGrammar(const XMLCh* const nameSpaceKey)
return fGrammarRegistry->orphanKey(nameSpaceKey);
RefHashTableOfEnumerator<Grammar>
XMLGrammarPoolImpl::getGrammarEnumerator() const
{
return RefHashTableOfEnumerator<Grammar>(fGrammarRegistry);
}
void XMLGrammarPoolImpl::clear()
{
fGrammarRegistry->removeAll();
}
void XMLGrammarPoolImpl::lockPool()
{
Neil Graham
committed
fLocked = true;
if(!fSynchronizedStringPool)
{
MemoryManager *memMgr = getMemoryManager();
fSynchronizedStringPool = new (memMgr) XMLSynchronizedStringPool(fStringPool, 109, memMgr);
}
}
void XMLGrammarPoolImpl::unlockPool()
{
Neil Graham
committed
fLocked = false;
if(fSynchronizedStringPool)
fSynchronizedStringPool->flushAll();
}
// -----------------------------------------------------------------------
// Implementation of Factory Interface
// -----------------------------------------------------------------------
DTDGrammar* XMLGrammarPoolImpl::createDTDGrammar()
{
return new (getMemoryManager()) DTDGrammar(getMemoryManager());
}
SchemaGrammar* XMLGrammarPoolImpl::createSchemaGrammar()
{
return new (getMemoryManager()) SchemaGrammar(getMemoryManager());
}
XMLDTDDescription* XMLGrammarPoolImpl::createDTDDescription(const XMLCh* const rootName)
{
return new (getMemoryManager()) XMLDTDDescriptionImpl(rootName, getMemoryManager());
}
XMLSchemaDescription* XMLGrammarPoolImpl::createSchemaDescription(const XMLCh* const targetNamespace)
{
return new (getMemoryManager()) XMLSchemaDescriptionImpl(targetNamespace, getMemoryManager());
}
Neil Graham
committed
inline XSModel *XMLGrammarPoolImpl::getXSModel() const
{
if(!fLocked)
return 0;
// REVISIT: implement along with XSModel implementation
return 0;
}
Neil Graham
committed
inline XMLStringPool *XMLGrammarPoolImpl::getURIStringPool()
{
Neil Graham
committed
if(fLocked)
return fSynchronizedStringPool;
Neil Graham
committed
return fStringPool;
}
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
// -----------------------------------------------------------------------
// serialization and deserialization support
// -----------------------------------------------------------------------
/***
*
* don't serialize
*
* XMLSynchronizedStringPool* fSynchronizedStringPool;
* bool fLocked;
*/
/***
* .not locked
* .non-empty gramamrRegistry
***/
void XMLGrammarPoolImpl::serializeGrammars(BinOutputStream* const binOut)
{
if (fLocked)
{
ThrowXML(XSerializationException, XMLExcepts::XSer_GrammarPool_Locked);
}
fLocked = true;
RefHashTableOfEnumerator<Grammar> grammarEnum(fGrammarRegistry);
if (!(grammarEnum.hasMoreElements()))
{
fLocked = false;
ThrowXML(XSerializationException, XMLExcepts::XSer_GrammarPool_Empty);
}
try
{
XSerializeEngine serEng(binOut, getMemoryManager());
//version information
serEng<<gXercesMajVersion;
serEng<<gXercesMinVersion;
serEng<<gXercesRevision;
//StringPool, don't use <<
fStringPool->serialize(serEng);
/***
* Serialize RefHashTableOf<Grammar>* fGrammarRegistry;
***/
XTemplateSerializer::storeObject(fGrammarRegistry, serEng);
}
catch(...)
{
fLocked = false;
throw;
}
fLocked = false;
}
/***
* .not locked
* .empty stringPool
* .empty gramamrRegistry
***/
void XMLGrammarPoolImpl::deserializeGrammars(BinInputStream* const binIn)
{
if (fLocked)
{
ThrowXML(XSerializationException, XMLExcepts::XSer_GrammarPool_Locked);
}
fLocked = true;
unsigned int stringCount = fStringPool->getStringCount();
if (stringCount)
{
/***
* it contains only the four predefined one, that is ok
* but we need to reset the string before deserialize it
*
***/
if ( stringCount <= 4 )
{
fStringPool->flushAll();
}
else
{
fLocked = false;
ThrowXML(XSerializationException, XMLExcepts::XSer_StringPool_NotEmpty);
}
}
RefHashTableOfEnumerator<Grammar> grammarEnum(fGrammarRegistry);
if (grammarEnum.hasMoreElements())
{
fLocked = false;
ThrowXML(XSerializationException, XMLExcepts::XSer_GrammarPool_NotEmpty);
}
try
{
XSerializeEngine serEng(binIn, getMemoryManager());
//version information
unsigned int MajVer;
unsigned int MinVer;
unsigned int Revision;
serEng>>MajVer;
serEng>>MinVer;
serEng>>Revision;
//we may change the logic once we have more
//versions
if ((MajVer != gXercesMajVersion) ||
(MinVer != gXercesMinVersion) ||
(Revision != gXercesRevision) )
{
fLocked = false;
XMLCh MajVerChar[4];
XMLCh MinVerChar[4];
XMLCh RevisionChar[4];
XMLString::binToText(MajVer, MajVerChar, 4, 10);
XMLString::binToText(MinVer, MinVerChar, 4, 10);
XMLString::binToText(Revision, RevisionChar, 4, 10);
ThrowXML3(XSerializationException
, XMLExcepts::XSer_BinaryData_Version_NotSupported
, MajVerChar
, MinVerChar
, RevisionChar);
}
//StringPool, don't use >>
fStringPool->serialize(serEng);
/***
* Deserialize RefHashTableOf<Grammar>* fGrammarRegistry;
***/
XTemplateSerializer::loadObject(&fGrammarRegistry, 29, true, serEng);
}
catch(...)
{
clear(); //clear all deserialized grammars
fLocked = false;
throw;
}
fLocked = false;
}