Newer
Older
* Copyright 1999-2001,2004 The Apache Software Foundation.
*
* Licensed 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
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* Revision 1.11 2004/09/08 13:56:13 peiyongz
* Apache License Version 2.0
*
* Revision 1.10 2004/06/02 19:58:10 neilg
* Fix bug where scanners would accept malformed tags of the form
* <p:a xmlns:p="b" xmlns:q="b"></q:a> when namespace processing was
* enabled. This also opened the way for some end-tag scanning
* performance improvements.
*
* Revision 1.9 2004/04/27 19:17:52 peiyongz
* XML1.0-3rd VC: element content(children) dont allow white space from
* EntityRef/CharRef
*
* Revision 1.8 2004/04/23 21:20:40 peiyongz
* fCommentOrPISeen to keep track if any comment or PI seen for the current
* element
*
* Revision 1.7 2003/10/22 20:22:30 knoaman
* Prepare for annotation support.
*
Khaled Noaman
committed
* Revision 1.6 2003/05/16 21:36:57 knoaman
* Memory manager implementation: Modify constructors to pass in the memory manager.
*
* Revision 1.5 2003/05/15 18:26:29 knoaman
* Partial implementation of the configurable memory manager.
*
* Revision 1.4 2003/03/07 18:08:58 tng
* Return a reference instead of void for operator=
*
* Revision 1.3 2002/12/04 02:23:50 knoaman
* Scanner re-organization.
*
* Revision 1.2 2002/11/04 14:58:18 tng
* C++ Namespace Support.
*
* Revision 1.1.1.1 2002/02/01 22:21:58 peiyongz
* sane_include
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
*
* Revision 1.11 2001/12/12 14:29:50 tng
* Remove obsolete code in ElemStack which can help performance.
*
* Revision 1.10 2001/08/07 13:47:47 tng
* Schema: Fix unmatched end tag for qualified/unqualifed start tag.
*
* Revision 1.9 2001/05/28 20:55:19 tng
* Schema: Store Grammar in ElemStack as well.
*
* Revision 1.8 2001/05/11 13:26:16 tng
* Copyright update.
*
* Revision 1.7 2001/05/03 20:34:28 tng
* Schema: SchemaValidator update
*
* Revision 1.6 2001/04/19 18:16:58 tng
* Schema: SchemaValidator update, and use QName in Content Model
*
* Revision 1.5 2000/04/18 23:54:29 roddey
* Got rid of some foward references to no longer used classes.
*
* Revision 1.4 2000/03/02 19:54:28 roddey
* This checkin includes many changes done while waiting for the
* 1.1.0 code to be finished. I can't list them all here, but a list is
* available elsewhere.
*
* Revision 1.3 2000/02/24 20:18:07 abagchi
* Swat for removing Log from API docs
*
* Revision 1.2 2000/02/06 07:47:52 rahulj
* Year 2K copyright swat.
*
* Revision 1.1.1.1 1999/11/09 01:08:06 twl
* Initial checkin
*
* Revision 1.2 1999/11/08 20:44:42 rahul
* Swat for adding in Product name and CVS comment log variable.
*
*/
#if !defined(ELEMSTACK_HPP)
#define ELEMSTACK_HPP
#include <xercesc/util/StringPool.hpp>
#include <xercesc/util/QName.hpp>
#include <xercesc/util/ValueVectorOf.hpp>
struct PrefMapElem : public XMemory
{
unsigned int fPrefId;
unsigned int fURIId;
};
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
//
// During the scan of content, we have to keep up with the nesting of
// elements (for validation and wellformedness purposes) and we have to
// have places to remember namespace (prefix to URI) mappings.
//
// We only have to keep a stack of the current path down through the tree
// that we are currently scanning, and keep track of any children of any
// elements along that path.
//
// So, this data structure is a stack, which represents the current path
// through the tree that we've worked our way down to. For each node in
// the stack, there is an array of element ids that represent the ids of
// the child elements scanned so far. Upon exit from that element, its
// array of child elements is validated.
//
// Since we have the actual XMLElementDecl in the stack nodes, when its time
// to validate, we just extract the content model from that element decl
// and validate. All the required data falls easily to hand. Note that we
// actually have some derivative of XMLElementDecl, which is specific to
// the validator used, but the abstract API is sufficient for the needs of
// the scanner.
//
// Since the namespace support also requires the storage of information on
// a nested element basis, this structure also holds the namespace info. For
// each level, the prefixes defined at that level (and the namespaces that
// they map to) are stored.
//
class XMLPARSER_EXPORT ElemStack : public XMemory
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
{
public :
// -----------------------------------------------------------------------
// Class specific data types
//
// These really should be private, but some of the compilers we have to
// support are too dumb to deal with that.
//
// PrefMapElem
// fURIId is the id of the URI from the validator's URI map. The
// fPrefId is the id of the prefix from our own prefix pool. The
// namespace stack consists of these elements.
//
// StackElem
// fThisElement is the basic element decl for the current element.
// The fRowCapacity is how large fChildIds has grown so far.
// fChildCount is how many of them are valid right now.
//
// The fMapCapacity is how large fMap has grown so far. fMapCount
// is how many of them are valid right now.
//
// Note that we store the reader number we were in when we found the
// start tag. We'll use this at the end tag to test for unbalanced
// markup in entities.
//
// MapModes
// When a prefix is mapped to a namespace id, it matters whether the
// QName being mapped is an attribute or name. Attributes are not
// affected by an sibling xmlns attributes, whereas elements are
// affected by its own xmlns attributes.
// -----------------------------------------------------------------------
struct StackElem : public XMemory
{
XMLElementDecl* fThisElement;
unsigned int fReaderNum;
unsigned int fChildCapacity;
unsigned int fChildCount;
QName** fChildren;
PrefMapElem* fMap;
unsigned int fMapCapacity;
unsigned int fMapCount;
bool fValidationFlag;
bool fCommentOrPISeen;
bool fReferenceEscaped;
int fCurrentScope;
Grammar* fCurrentGrammar;
unsigned int fCurrentURI;
XMLCh * fSchemaElemName;
unsigned int fSchemaElemNameMaxLen;
};
enum MapModes
{
Mode_Attribute
, Mode_Element
};
// -----------------------------------------------------------------------
// Constructors and Destructor
// -----------------------------------------------------------------------
Khaled Noaman
committed
ElemStack(MemoryManager* const manager = XMLPlatformUtils::fgMemoryManager);
~ElemStack();
// -----------------------------------------------------------------------
// Stack access
// -----------------------------------------------------------------------
unsigned int addLevel();
unsigned int addLevel(XMLElementDecl* const toSet, const unsigned int readerNum);
const StackElem* popTop();
// -----------------------------------------------------------------------
// Stack top access
// -----------------------------------------------------------------------
unsigned int addChild(QName* const child, const bool toParent);
const StackElem* topElement() const;
void setElement(XMLElementDecl* const toSet, const unsigned int readerNum);
void setValidationFlag(bool validationFlag);
bool getValidationFlag();
inline void setCommentOrPISeen();
inline bool getCommentOrPISeen() const;
inline void setReferenceEscaped();
inline bool getReferenceEscaped() const;
void setCurrentScope(int currentScope);
int getCurrentScope();
void setCurrentGrammar(Grammar* currentGrammar);
Grammar* getCurrentGrammar();
void setCurrentURI(unsigned int uri);
unsigned int getCurrentURI();
inline void setCurrentSchemaElemName(const XMLCh * const schemaElemName);
inline XMLCh *getCurrentSchemaElemName();
// -----------------------------------------------------------------------
// Prefix map methods
// -----------------------------------------------------------------------
void addPrefix
(
const XMLCh* const prefixToAdd
, const unsigned int uriId
);
unsigned int mapPrefixToURI
(
const XMLCh* const prefixToMap
, const MapModes mode
, bool& unknown
) const;
ValueVectorOf<PrefMapElem*>* getNamespaceMap() const;
unsigned int getPrefixId(const XMLCh* const prefix) const;
const XMLCh* getPrefixForId(unsigned int prefId) const;
// -----------------------------------------------------------------------
// Miscellaneous methods
// -----------------------------------------------------------------------
bool isEmpty() const;
void reset
(
const unsigned int emptyId
, const unsigned int unknownId
, const unsigned int xmlId
, const unsigned int xmlNSId
);
private :
// -----------------------------------------------------------------------
// Unimplemented constructors and operators
// -----------------------------------------------------------------------
ElemStack(const ElemStack&);
ElemStack& operator=(const ElemStack&);
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
// -----------------------------------------------------------------------
// Private helper methods
// -----------------------------------------------------------------------
void expandMap(StackElem* const toExpand);
void expandStack();
// -----------------------------------------------------------------------
// Data members
//
// fEmptyNamespaceId
// This is the special URI id for the "" namespace, which is magic
// because of the xmlns="" operation.
//
// fGlobalPoolId
// This is a special URI id that is returned when the namespace
// prefix is "" and no one has explicitly mapped that prefix to an
// explicit URI (or when they explicitly clear any such mapping,
// which they can also do.) And also its prefix pool id, which is
// stored here for fast access.
//
// fPrefixPool
// This is the prefix pool where prefixes are hashed and given unique
// ids. These ids are used to track prefixes in the element stack.
//
// fStack
// fStackCapacity
// fStackTop
// This the stack array. Its an array of pointers to StackElem
// structures. The capacity is the current high water mark of the
// stack. The top is the current top of stack (i.e. the part of it
// being used.)
//
// fUnknownNamespaceId
// This is the URI id for the special URI that is assigned to any
// prefix which has not been mapped. This lets us keep going after
// issuing the error.
//
// fXMLNamespaceId
// fXMLPoolId
// fXMLNSNamespaceId
// fXMLNSPoolId
// These are the URI ids for the special URIs that are assigned to
// the 'xml' and 'xmlns' namespaces. And also its prefix pool id,
// which is stored here for fast access.
// -----------------------------------------------------------------------
unsigned int fEmptyNamespaceId;
unsigned int fGlobalPoolId;
XMLStringPool fPrefixPool;
StackElem** fStack;
unsigned int fStackCapacity;
unsigned int fStackTop;
unsigned int fUnknownNamespaceId;
unsigned int fXMLNamespaceId;
unsigned int fXMLPoolId;
unsigned int fXMLNSNamespaceId;
unsigned int fXMLNSPoolId;
ValueVectorOf<PrefMapElem*>* fNamespaceMap;
MemoryManager* fMemoryManager;
class XMLPARSER_EXPORT WFElemStack : public XMemory
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
{
public :
// -----------------------------------------------------------------------
// Class specific data types
//
// These really should be private, but some of the compilers we have to
// support are too dumb to deal with that.
//
// PrefMapElem
// fURIId is the id of the URI from the validator's URI map. The
// fPrefId is the id of the prefix from our own prefix pool. The
// namespace stack consists of these elements.
//
// StackElem
// fThisElement is the basic element decl for the current element.
// The fRowCapacity is how large fChildIds has grown so far.
// fChildCount is how many of them are valid right now.
//
// The fMapCapacity is how large fMap has grown so far. fMapCount
// is how many of them are valid right now.
//
// Note that we store the reader number we were in when we found the
// start tag. We'll use this at the end tag to test for unbalanced
// markup in entities.
//
// MapModes
// When a prefix is mapped to a namespace id, it matters whether the
// QName being mapped is an attribute or name. Attributes are not
// affected by an sibling xmlns attributes, whereas elements are
// affected by its own xmlns attributes.
// -----------------------------------------------------------------------
struct StackElem : public XMemory
{
int fTopPrefix;
unsigned int fCurrentURI;
unsigned int fReaderNum;
unsigned int fElemMaxLength;
XMLCh* fThisElement;
};
enum MapModes
{
Mode_Attribute
, Mode_Element
};
// -----------------------------------------------------------------------
// Constructors and Destructor
// -----------------------------------------------------------------------
Khaled Noaman
committed
WFElemStack(MemoryManager* const manager = XMLPlatformUtils::fgMemoryManager);
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
~WFElemStack();
// -----------------------------------------------------------------------
// Stack access
// -----------------------------------------------------------------------
unsigned int addLevel();
unsigned int addLevel(const XMLCh* const toSet, const unsigned int toSetLen,
const unsigned int readerNum);
const StackElem* popTop();
// -----------------------------------------------------------------------
// Stack top access
// -----------------------------------------------------------------------
const StackElem* topElement() const;
void setElement(const XMLCh* const toSet, const unsigned int toSetLen,
const unsigned int readerNum);
void setCurrentURI(unsigned int uri);
unsigned int getCurrentURI();
// -----------------------------------------------------------------------
// Prefix map methods
// -----------------------------------------------------------------------
void addPrefix
(
const XMLCh* const prefixToAdd
, const unsigned int uriId
);
unsigned int mapPrefixToURI
(
const XMLCh* const prefixToMap
, const MapModes mode
, bool& unknown
) const;
// -----------------------------------------------------------------------
// Miscellaneous methods
// -----------------------------------------------------------------------
bool isEmpty() const;
void reset
(
const unsigned int emptyId
, const unsigned int unknownId
, const unsigned int xmlId
, const unsigned int xmlNSId
);
private :
// -----------------------------------------------------------------------
// Unimplemented constructors and operators
// -----------------------------------------------------------------------
WFElemStack(const WFElemStack&);
WFElemStack& operator=(const WFElemStack&);
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
// -----------------------------------------------------------------------
// Private helper methods
// -----------------------------------------------------------------------
void expandMap();
void expandStack();
// -----------------------------------------------------------------------
// Data members
//
// fEmptyNamespaceId
// This is the special URI id for the "" namespace, which is magic
// because of the xmlns="" operation.
//
// fGlobalPoolId
// This is a special URI id that is returned when the namespace
// prefix is "" and no one has explicitly mapped that prefix to an
// explicit URI (or when they explicitly clear any such mapping,
// which they can also do.) And also its prefix pool id, which is
// stored here for fast access.
//
// fPrefixPool
// This is the prefix pool where prefixes are hashed and given unique
// ids. These ids are used to track prefixes in the element stack.
//
// fStack
// fStackCapacity
// fStackTop
// This the stack array. Its an array of pointers to StackElem
// structures. The capacity is the current high water mark of the
// stack. The top is the current top of stack (i.e. the part of it
// being used.)
//
// fUnknownNamespaceId
// This is the URI id for the special URI that is assigned to any
// prefix which has not been mapped. This lets us keep going after
// issuing the error.
//
// fXMLNamespaceId
// fXMLPoolId
// fXMLNSNamespaceId
// fXMLNSPoolId
// These are the URI ids for the special URIs that are assigned to
// the 'xml' and 'xmlns' namespaces. And also its prefix pool id,
// which is stored here for fast access.
// -----------------------------------------------------------------------
unsigned int fEmptyNamespaceId;
unsigned int fGlobalPoolId;
unsigned int fStackCapacity;
unsigned int fStackTop;
unsigned int fUnknownNamespaceId;
unsigned int fXMLNamespaceId;
unsigned int fXMLPoolId;
unsigned int fXMLNSNamespaceId;
unsigned int fXMLNSPoolId;
unsigned int fMapCapacity;
PrefMapElem* fMap;
StackElem** fStack;
XMLStringPool fPrefixPool;
MemoryManager* fMemoryManager;
// ---------------------------------------------------------------------------
// ElemStack: Miscellaneous methods
// ---------------------------------------------------------------------------
inline bool ElemStack::isEmpty() const
{
return (fStackTop == 0);
}
inline bool ElemStack::getValidationFlag()
{
return fStack[fStackTop-1]->fValidationFlag;
}
inline void ElemStack::setValidationFlag(bool validationFlag)
{
fStack[fStackTop-1]->fValidationFlag = validationFlag;
return;
}
inline bool ElemStack::getCommentOrPISeen() const
{
return fStack[fStackTop-1]->fCommentOrPISeen;
}
inline void ElemStack::setCommentOrPISeen()
{
fStack[fStackTop-1]->fCommentOrPISeen = true;
return;
}
inline bool ElemStack::getReferenceEscaped() const
{
return fStack[fStackTop-1]->fReferenceEscaped;
}
inline void ElemStack::setReferenceEscaped()
{
fStack[fStackTop-1]->fReferenceEscaped = true;
return;
}
inline void ElemStack::setCurrentSchemaElemName(const XMLCh * const schemaElemName)
{
unsigned int schemaElemNameLen = XMLString::stringLen(schemaElemName);
unsigned int stackPos = fStackTop-1;
if(fStack[stackPos]->fSchemaElemNameMaxLen <= schemaElemNameLen)
{
XMLCh *tempStr = fStack[stackPos]->fSchemaElemName;
fStack[stackPos]->fSchemaElemNameMaxLen = schemaElemNameLen << 1;
fStack[stackPos]->fSchemaElemName = (XMLCh *)fMemoryManager->allocate((fStack[stackPos]->fSchemaElemNameMaxLen)*sizeof(XMLCh));
fMemoryManager->deallocate(tempStr);
}
XMLString::copyString(fStack[stackPos]->fSchemaElemName, schemaElemName);
}
inline XMLCh *ElemStack::getCurrentSchemaElemName()
{
return fStack[fStackTop-1]->fSchemaElemName;
}
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
inline int ElemStack::getCurrentScope()
{
return fStack[fStackTop-1]->fCurrentScope;
}
inline void ElemStack::setCurrentScope(int currentScope)
{
fStack[fStackTop-1]->fCurrentScope = currentScope;
return;
}
inline Grammar* ElemStack::getCurrentGrammar()
{
return fStack[fStackTop-1]->fCurrentGrammar;
}
inline void ElemStack::setCurrentGrammar(Grammar* currentGrammar)
{
fStack[fStackTop-1]->fCurrentGrammar = currentGrammar;
return;
}
inline unsigned int ElemStack::getCurrentURI()
{
return fStack[fStackTop-1]->fCurrentURI;
}
inline void ElemStack::setCurrentURI(unsigned int uri)
{
fStack[fStackTop-1]->fCurrentURI = uri;
return;
}
inline unsigned int ElemStack::getPrefixId(const XMLCh* const prefix) const
{
return fPrefixPool.getId(prefix);
}
inline const XMLCh* ElemStack::getPrefixForId(unsigned int prefId) const
{
return fPrefixPool.getValueForId(prefId);
}
// ---------------------------------------------------------------------------
// WFElemStack: Miscellaneous methods
// ---------------------------------------------------------------------------
inline bool WFElemStack::isEmpty() const
{
return (fStackTop == 0);
}
inline unsigned int WFElemStack::getCurrentURI()
{
return fStack[fStackTop-1]->fCurrentURI;
}
inline void WFElemStack::setCurrentURI(unsigned int uri)
{
fStack[fStackTop-1]->fCurrentURI = uri;
return;
}