mirror of https://github.com/AxioDL/tinyxml2.git
1817 lines
38 KiB
C++
1817 lines
38 KiB
C++
/*
|
|
Original code by Lee Thomason (www.grinninglizard.com)
|
|
|
|
This software is provided 'as-is', without any express or implied
|
|
warranty. In no event will the authors be held liable for any
|
|
damages arising from the use of this software.
|
|
|
|
Permission is granted to anyone to use this software for any
|
|
purpose, including commercial applications, and to alter it and
|
|
redistribute it freely, subject to the following restrictions:
|
|
|
|
1. The origin of this software must not be misrepresented; you must
|
|
not claim that you wrote the original software. If you use this
|
|
software in a product, an acknowledgment in the product documentation
|
|
would be appreciated but is not required.
|
|
|
|
2. Altered source versions must be plainly marked as such, and
|
|
must not be misrepresented as being the original software.
|
|
|
|
3. This notice may not be removed or altered from any source
|
|
distribution.
|
|
*/
|
|
|
|
#include "tinyxml2.h"
|
|
|
|
#if 1
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <new>
|
|
#else
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <ctype.h>
|
|
#include <new>
|
|
#include <stdarg.h>
|
|
#endif
|
|
|
|
using namespace tinyxml2;
|
|
|
|
static const char LINE_FEED = (char)0x0a; // all line endings are normalized to LF
|
|
static const char LF = LINE_FEED;
|
|
static const char CARRIAGE_RETURN = (char)0x0d; // CR gets filtered out
|
|
static const char CR = CARRIAGE_RETURN;
|
|
static const char SINGLE_QUOTE = '\'';
|
|
static const char DOUBLE_QUOTE = '\"';
|
|
|
|
// Bunch of unicode info at:
|
|
// http://www.unicode.org/faq/utf_bom.html
|
|
// ef bb bf (Microsoft "lead bytes") - designates UTF-8
|
|
|
|
static const unsigned char TIXML_UTF_LEAD_0 = 0xefU;
|
|
static const unsigned char TIXML_UTF_LEAD_1 = 0xbbU;
|
|
static const unsigned char TIXML_UTF_LEAD_2 = 0xbfU;
|
|
|
|
|
|
#define DELETE_NODE( node ) { \
|
|
if ( node ) { \
|
|
MemPool* pool = node->memPool; \
|
|
node->~XMLNode(); \
|
|
pool->Free( node ); \
|
|
} \
|
|
}
|
|
#define DELETE_ATTRIBUTE( attrib ) { \
|
|
if ( attrib ) { \
|
|
MemPool* pool = attrib->memPool; \
|
|
attrib->~XMLAttribute(); \
|
|
pool->Free( attrib ); \
|
|
} \
|
|
}
|
|
|
|
struct Entity {
|
|
const char* pattern;
|
|
int length;
|
|
char value;
|
|
};
|
|
|
|
static const int NUM_ENTITIES = 5;
|
|
static const Entity entities[NUM_ENTITIES] =
|
|
{
|
|
{ "quot", 4, DOUBLE_QUOTE },
|
|
{ "amp", 3, '&' },
|
|
{ "apos", 4, SINGLE_QUOTE },
|
|
{ "lt", 2, '<' },
|
|
{ "gt", 2, '>' }
|
|
};
|
|
|
|
|
|
StrPair::~StrPair()
|
|
{
|
|
Reset();
|
|
}
|
|
|
|
|
|
void StrPair::Reset()
|
|
{
|
|
if ( flags & NEEDS_DELETE ) {
|
|
delete [] start;
|
|
}
|
|
flags = 0;
|
|
start = 0;
|
|
end = 0;
|
|
}
|
|
|
|
|
|
void StrPair::SetStr( const char* str, int flags )
|
|
{
|
|
Reset();
|
|
size_t len = strlen( str );
|
|
start = new char[ len+1 ];
|
|
memcpy( start, str, len+1 );
|
|
end = start + len;
|
|
this->flags = flags | NEEDS_DELETE;
|
|
}
|
|
|
|
|
|
char* StrPair::ParseText( char* p, const char* endTag, int strFlags )
|
|
{
|
|
TIXMLASSERT( endTag && *endTag );
|
|
|
|
char* start = p; // fixme: hides a member
|
|
char endChar = *endTag;
|
|
int length = strlen( endTag );
|
|
|
|
// Inner loop of text parsing.
|
|
while ( *p ) {
|
|
if ( *p == endChar && strncmp( p, endTag, length ) == 0 ) {
|
|
Set( start, p, strFlags );
|
|
return p + length;
|
|
}
|
|
++p;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
char* StrPair::ParseName( char* p )
|
|
{
|
|
char* start = p;
|
|
|
|
if ( !start || !(*start) ) {
|
|
return 0;
|
|
}
|
|
|
|
if ( !XMLUtil::IsAlpha( *p ) ) {
|
|
return 0;
|
|
}
|
|
|
|
while( *p && (
|
|
XMLUtil::IsAlphaNum( (unsigned char) *p )
|
|
|| *p == '_'
|
|
|| *p == '-'
|
|
|| *p == '.'
|
|
|| *p == ':' ))
|
|
{
|
|
++p;
|
|
}
|
|
|
|
if ( p > start ) {
|
|
Set( start, p, 0 );
|
|
return p;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
const char* StrPair::GetStr()
|
|
{
|
|
if ( flags & NEEDS_FLUSH ) {
|
|
*end = 0;
|
|
flags ^= NEEDS_FLUSH;
|
|
|
|
if ( flags ) {
|
|
char* p = start; // the read pointer
|
|
char* q = start; // the write pointer
|
|
|
|
while( p < end ) {
|
|
if ( (flags & NEEDS_NEWLINE_NORMALIZATION) && *p == CR ) {
|
|
// CR-LF pair becomes LF
|
|
// CR alone becomes LF
|
|
// LF-CR becomes LF
|
|
if ( *(p+1) == LF ) {
|
|
p += 2;
|
|
}
|
|
else {
|
|
++p;
|
|
}
|
|
*q++ = LF;
|
|
}
|
|
else if ( (flags & NEEDS_NEWLINE_NORMALIZATION) && *p == LF ) {
|
|
if ( *(p+1) == CR ) {
|
|
p += 2;
|
|
}
|
|
else {
|
|
++p;
|
|
}
|
|
*q++ = LF;
|
|
}
|
|
else if ( (flags & NEEDS_ENTITY_PROCESSING) && *p == '&' ) {
|
|
int i=0;
|
|
|
|
// Entities handled by tinyXML2:
|
|
// - special entities in the entity table [in/out]
|
|
// - numeric character reference [in]
|
|
// 中 or 中
|
|
|
|
if ( *(p+1) == '#' ) {
|
|
char buf[10] = { 0 };
|
|
int len;
|
|
p = const_cast<char*>( XMLUtil::GetCharacterRef( p, buf, &len ) );
|
|
for( int i=0; i<len; ++i ) {
|
|
*q++ = buf[i];
|
|
}
|
|
TIXMLASSERT( q <= p );
|
|
}
|
|
else {
|
|
for( i=0; i<NUM_ENTITIES; ++i ) {
|
|
if ( strncmp( p+1, entities[i].pattern, entities[i].length ) == 0
|
|
&& *(p+entities[i].length+1) == ';' )
|
|
{
|
|
// Found an entity convert;
|
|
*q = entities[i].value;
|
|
++q;
|
|
p += entities[i].length + 2;
|
|
break;
|
|
}
|
|
}
|
|
if ( i == NUM_ENTITIES ) {
|
|
// fixme: treat as error?
|
|
++p;
|
|
++q;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
*q = *p;
|
|
++p;
|
|
++q;
|
|
}
|
|
}
|
|
*q = 0;
|
|
}
|
|
flags = (flags & NEEDS_DELETE);
|
|
}
|
|
return start;
|
|
}
|
|
|
|
|
|
|
|
|
|
// --------- XMLUtil ----------- //
|
|
|
|
const char* XMLUtil::ReadBOM( const char* p, bool* bom )
|
|
{
|
|
*bom = false;
|
|
const unsigned char* pu = reinterpret_cast<const unsigned char*>(p);
|
|
// Check for BOM:
|
|
if ( *(pu+0) == TIXML_UTF_LEAD_0
|
|
&& *(pu+1) == TIXML_UTF_LEAD_1
|
|
&& *(pu+2) == TIXML_UTF_LEAD_2 )
|
|
{
|
|
*bom = true;
|
|
p += 3;
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
void XMLUtil::ConvertUTF32ToUTF8( unsigned long input, char* output, int* length )
|
|
{
|
|
const unsigned long BYTE_MASK = 0xBF;
|
|
const unsigned long BYTE_MARK = 0x80;
|
|
const unsigned long FIRST_BYTE_MARK[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };
|
|
|
|
if (input < 0x80)
|
|
*length = 1;
|
|
else if ( input < 0x800 )
|
|
*length = 2;
|
|
else if ( input < 0x10000 )
|
|
*length = 3;
|
|
else if ( input < 0x200000 )
|
|
*length = 4;
|
|
else
|
|
{ *length = 0; return; } // This code won't covert this correctly anyway.
|
|
|
|
output += *length;
|
|
|
|
// Scary scary fall throughs.
|
|
switch (*length)
|
|
{
|
|
case 4:
|
|
--output;
|
|
*output = (char)((input | BYTE_MARK) & BYTE_MASK);
|
|
input >>= 6;
|
|
case 3:
|
|
--output;
|
|
*output = (char)((input | BYTE_MARK) & BYTE_MASK);
|
|
input >>= 6;
|
|
case 2:
|
|
--output;
|
|
*output = (char)((input | BYTE_MARK) & BYTE_MASK);
|
|
input >>= 6;
|
|
case 1:
|
|
--output;
|
|
*output = (char)(input | FIRST_BYTE_MARK[*length]);
|
|
}
|
|
}
|
|
|
|
|
|
const char* XMLUtil::GetCharacterRef( const char* p, char* value, int* length )
|
|
{
|
|
// Presume an entity, and pull it out.
|
|
*length = 0;
|
|
|
|
if ( *(p+1) == '#' && *(p+2) )
|
|
{
|
|
unsigned long ucs = 0;
|
|
int delta = 0;
|
|
unsigned mult = 1;
|
|
|
|
if ( *(p+2) == 'x' )
|
|
{
|
|
// Hexadecimal.
|
|
if ( !*(p+3) ) return 0;
|
|
|
|
const char* q = p+3;
|
|
q = strchr( q, ';' );
|
|
|
|
if ( !q || !*q ) return 0;
|
|
|
|
delta = (q-p);
|
|
--q;
|
|
|
|
while ( *q != 'x' )
|
|
{
|
|
if ( *q >= '0' && *q <= '9' )
|
|
ucs += mult * (*q - '0');
|
|
else if ( *q >= 'a' && *q <= 'f' )
|
|
ucs += mult * (*q - 'a' + 10);
|
|
else if ( *q >= 'A' && *q <= 'F' )
|
|
ucs += mult * (*q - 'A' + 10 );
|
|
else
|
|
return 0;
|
|
mult *= 16;
|
|
--q;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// Decimal.
|
|
if ( !*(p+2) ) return 0;
|
|
|
|
const char* q = p+2;
|
|
q = strchr( q, ';' );
|
|
|
|
if ( !q || !*q ) return 0;
|
|
|
|
delta = q-p;
|
|
--q;
|
|
|
|
while ( *q != '#' )
|
|
{
|
|
if ( *q >= '0' && *q <= '9' )
|
|
ucs += mult * (*q - '0');
|
|
else
|
|
return 0;
|
|
mult *= 10;
|
|
--q;
|
|
}
|
|
}
|
|
// convert the UCS to UTF-8
|
|
ConvertUTF32ToUTF8( ucs, value, length );
|
|
return p + delta + 1;
|
|
}
|
|
return p+1;
|
|
}
|
|
|
|
|
|
char* XMLDocument::Identify( char* p, XMLNode** node )
|
|
{
|
|
XMLNode* returnNode = 0;
|
|
char* start = p;
|
|
p = XMLUtil::SkipWhiteSpace( p );
|
|
if( !p || !*p )
|
|
{
|
|
return p;
|
|
}
|
|
|
|
// What is this thing?
|
|
// - Elements start with a letter or underscore, but xml is reserved.
|
|
// - Comments: <!--
|
|
// - Decleration: <?
|
|
// - Everthing else is unknown to tinyxml.
|
|
//
|
|
|
|
static const char* xmlHeader = { "<?" };
|
|
static const char* commentHeader = { "<!--" };
|
|
static const char* dtdHeader = { "<!" };
|
|
static const char* cdataHeader = { "<![CDATA[" };
|
|
static const char* elementHeader = { "<" }; // and a header for everything else; check last.
|
|
|
|
static const int xmlHeaderLen = 2;
|
|
static const int commentHeaderLen = 4;
|
|
static const int dtdHeaderLen = 2;
|
|
static const int cdataHeaderLen = 9;
|
|
static const int elementHeaderLen = 1;
|
|
|
|
#if defined(_MSC_VER)
|
|
#pragma warning ( push )
|
|
#pragma warning ( disable : 4127 )
|
|
#endif
|
|
TIXMLASSERT( sizeof( XMLComment ) == sizeof( XMLUnknown ) ); // use same memory pool
|
|
TIXMLASSERT( sizeof( XMLComment ) == sizeof( XMLDeclaration ) ); // use same memory pool
|
|
#if defined(_MSC_VER)
|
|
#pragma warning (pop)
|
|
#endif
|
|
if ( XMLUtil::StringEqual( p, xmlHeader, xmlHeaderLen ) ) {
|
|
returnNode = new (commentPool.Alloc()) XMLDeclaration( this );
|
|
returnNode->memPool = &commentPool;
|
|
p += xmlHeaderLen;
|
|
}
|
|
else if ( XMLUtil::StringEqual( p, commentHeader, commentHeaderLen ) ) {
|
|
returnNode = new (commentPool.Alloc()) XMLComment( this );
|
|
returnNode->memPool = &commentPool;
|
|
p += commentHeaderLen;
|
|
}
|
|
else if ( XMLUtil::StringEqual( p, cdataHeader, cdataHeaderLen ) ) {
|
|
XMLText* text = new (textPool.Alloc()) XMLText( this );
|
|
returnNode = text;
|
|
returnNode->memPool = &textPool;
|
|
p += cdataHeaderLen;
|
|
text->SetCData( true );
|
|
}
|
|
else if ( XMLUtil::StringEqual( p, dtdHeader, dtdHeaderLen ) ) {
|
|
returnNode = new (commentPool.Alloc()) XMLUnknown( this );
|
|
returnNode->memPool = &commentPool;
|
|
p += dtdHeaderLen;
|
|
}
|
|
else if ( XMLUtil::StringEqual( p, elementHeader, elementHeaderLen ) ) {
|
|
returnNode = new (elementPool.Alloc()) XMLElement( this );
|
|
returnNode->memPool = &elementPool;
|
|
p += elementHeaderLen;
|
|
}
|
|
else {
|
|
returnNode = new (textPool.Alloc()) XMLText( this );
|
|
returnNode->memPool = &textPool;
|
|
p = start; // Back it up, all the text counts.
|
|
}
|
|
|
|
*node = returnNode;
|
|
return p;
|
|
}
|
|
|
|
|
|
bool XMLDocument::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
if ( visitor->VisitEnter( *this ) )
|
|
{
|
|
for ( const XMLNode* node=FirstChild(); node; node=node->NextSibling() )
|
|
{
|
|
if ( !node->Accept( visitor ) )
|
|
break;
|
|
}
|
|
}
|
|
return visitor->VisitExit( *this );
|
|
}
|
|
|
|
|
|
// --------- XMLNode ----------- //
|
|
|
|
XMLNode::XMLNode( XMLDocument* doc ) :
|
|
document( doc ),
|
|
parent( 0 ),
|
|
firstChild( 0 ), lastChild( 0 ),
|
|
prev( 0 ), next( 0 )
|
|
{
|
|
}
|
|
|
|
|
|
XMLNode::~XMLNode()
|
|
{
|
|
DeleteChildren();
|
|
if ( parent ) {
|
|
parent->Unlink( this );
|
|
}
|
|
}
|
|
|
|
|
|
void XMLNode::SetValue( const char* str, bool staticMem )
|
|
{
|
|
if ( staticMem )
|
|
value.SetInternedStr( str );
|
|
else
|
|
value.SetStr( str );
|
|
}
|
|
|
|
|
|
void XMLNode::DeleteChildren()
|
|
{
|
|
while( firstChild ) {
|
|
XMLNode* node = firstChild;
|
|
Unlink( node );
|
|
|
|
DELETE_NODE( node );
|
|
}
|
|
firstChild = lastChild = 0;
|
|
}
|
|
|
|
|
|
void XMLNode::Unlink( XMLNode* child )
|
|
{
|
|
TIXMLASSERT( child->parent == this );
|
|
if ( child == firstChild )
|
|
firstChild = firstChild->next;
|
|
if ( child == lastChild )
|
|
lastChild = lastChild->prev;
|
|
|
|
if ( child->prev ) {
|
|
child->prev->next = child->next;
|
|
}
|
|
if ( child->next ) {
|
|
child->next->prev = child->prev;
|
|
}
|
|
child->parent = 0;
|
|
}
|
|
|
|
|
|
void XMLNode::DeleteChild( XMLNode* node )
|
|
{
|
|
TIXMLASSERT( node->parent == this );
|
|
DELETE_NODE( node );
|
|
}
|
|
|
|
|
|
XMLNode* XMLNode::InsertEndChild( XMLNode* addThis )
|
|
{
|
|
if ( lastChild ) {
|
|
TIXMLASSERT( firstChild );
|
|
TIXMLASSERT( lastChild->next == 0 );
|
|
lastChild->next = addThis;
|
|
addThis->prev = lastChild;
|
|
lastChild = addThis;
|
|
|
|
addThis->next = 0;
|
|
}
|
|
else {
|
|
TIXMLASSERT( firstChild == 0 );
|
|
firstChild = lastChild = addThis;
|
|
|
|
addThis->prev = 0;
|
|
addThis->next = 0;
|
|
}
|
|
addThis->parent = this;
|
|
return addThis;
|
|
}
|
|
|
|
|
|
XMLNode* XMLNode::InsertFirstChild( XMLNode* addThis )
|
|
{
|
|
if ( firstChild ) {
|
|
TIXMLASSERT( lastChild );
|
|
TIXMLASSERT( firstChild->prev == 0 );
|
|
|
|
firstChild->prev = addThis;
|
|
addThis->next = firstChild;
|
|
firstChild = addThis;
|
|
|
|
addThis->prev = 0;
|
|
}
|
|
else {
|
|
TIXMLASSERT( lastChild == 0 );
|
|
firstChild = lastChild = addThis;
|
|
|
|
addThis->prev = 0;
|
|
addThis->next = 0;
|
|
}
|
|
addThis->parent = this;
|
|
return addThis;
|
|
}
|
|
|
|
|
|
XMLNode* XMLNode::InsertAfterChild( XMLNode* afterThis, XMLNode* addThis )
|
|
{
|
|
TIXMLASSERT( afterThis->parent == this );
|
|
if ( afterThis->parent != this )
|
|
return 0;
|
|
|
|
if ( afterThis->next == 0 ) {
|
|
// The last node or the only node.
|
|
return InsertEndChild( addThis );
|
|
}
|
|
addThis->prev = afterThis;
|
|
addThis->next = afterThis->next;
|
|
afterThis->next->prev = addThis;
|
|
afterThis->next = addThis;
|
|
addThis->parent = this;
|
|
return addThis;
|
|
}
|
|
|
|
|
|
|
|
|
|
const XMLElement* XMLNode::FirstChildElement( const char* value ) const
|
|
{
|
|
for( XMLNode* node=firstChild; node; node=node->next ) {
|
|
XMLElement* element = node->ToElement();
|
|
if ( element ) {
|
|
if ( !value || XMLUtil::StringEqual( element->Name(), value ) ) {
|
|
return element;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
const XMLElement* XMLNode::LastChildElement( const char* value ) const
|
|
{
|
|
for( XMLNode* node=lastChild; node; node=node->prev ) {
|
|
XMLElement* element = node->ToElement();
|
|
if ( element ) {
|
|
if ( !value || XMLUtil::StringEqual( element->Name(), value ) ) {
|
|
return element;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
const XMLElement* XMLNode::NextSiblingElement( const char* value ) const
|
|
{
|
|
for( XMLNode* element=this->next; element; element = element->next ) {
|
|
if ( element->ToElement()
|
|
&& (!value || XMLUtil::StringEqual( value, element->Value() )))
|
|
{
|
|
return element->ToElement();
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
const XMLElement* XMLNode::PreviousSiblingElement( const char* value ) const
|
|
{
|
|
for( XMLNode* element=this->prev; element; element = element->prev ) {
|
|
if ( element->ToElement()
|
|
&& (!value || XMLUtil::StringEqual( value, element->Value() )))
|
|
{
|
|
return element->ToElement();
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
char* XMLNode::ParseDeep( char* p, StrPair* parentEnd )
|
|
{
|
|
// This is a recursive method, but thinking about it "at the current level"
|
|
// it is a pretty simple flat list:
|
|
// <foo/>
|
|
// <!-- comment -->
|
|
//
|
|
// With a special case:
|
|
// <foo>
|
|
// </foo>
|
|
// <!-- comment -->
|
|
//
|
|
// Where the closing element (/foo) *must* be the next thing after the opening
|
|
// element, and the names must match. BUT the tricky bit is that the closing
|
|
// element will be read by the child.
|
|
//
|
|
// 'endTag' is the end tag for this node, it is returned by a call to a child.
|
|
// 'parentEnd' is the end tag for the parent, which is filled in and returned.
|
|
|
|
while( p && *p ) {
|
|
XMLNode* node = 0;
|
|
|
|
p = document->Identify( p, &node );
|
|
if ( p == 0 || node == 0 ) {
|
|
break;
|
|
}
|
|
|
|
StrPair endTag;
|
|
p = node->ParseDeep( p, &endTag );
|
|
if ( !p ) {
|
|
DELETE_NODE( node );
|
|
node = 0;
|
|
if ( !document->Error() ) {
|
|
document->SetError( XML_ERROR_PARSING, 0, 0 );
|
|
}
|
|
break;
|
|
}
|
|
|
|
// We read the end tag. Return it to the parent.
|
|
if ( node->ToElement() && node->ToElement()->ClosingType() == XMLElement::CLOSING ) {
|
|
if ( parentEnd ) {
|
|
*parentEnd = ((XMLElement*)node)->value;
|
|
}
|
|
DELETE_NODE( node );
|
|
return p;
|
|
}
|
|
|
|
// Handle an end tag returned to this level.
|
|
// And handle a bunch of annoying errors.
|
|
XMLElement* ele = node->ToElement();
|
|
if ( ele ) {
|
|
if ( endTag.Empty() && ele->ClosingType() == XMLElement::OPEN ) {
|
|
document->SetError( XML_ERROR_MISMATCHED_ELEMENT, node->Value(), 0 );
|
|
p = 0;
|
|
}
|
|
else if ( !endTag.Empty() && ele->ClosingType() != XMLElement::OPEN ) {
|
|
document->SetError( XML_ERROR_MISMATCHED_ELEMENT, node->Value(), 0 );
|
|
p = 0;
|
|
}
|
|
else if ( !endTag.Empty() ) {
|
|
if ( !XMLUtil::StringEqual( endTag.GetStr(), node->Value() )) {
|
|
document->SetError( XML_ERROR_MISMATCHED_ELEMENT, node->Value(), 0 );
|
|
p = 0;
|
|
}
|
|
}
|
|
}
|
|
if ( p == 0 ) {
|
|
DELETE_NODE( node );
|
|
node = 0;
|
|
}
|
|
if ( node ) {
|
|
this->InsertEndChild( node );
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
// --------- XMLText ---------- //
|
|
char* XMLText::ParseDeep( char* p, StrPair* )
|
|
{
|
|
const char* start = p;
|
|
if ( this->CData() ) {
|
|
p = value.ParseText( p, "]]>", StrPair::NEEDS_NEWLINE_NORMALIZATION );
|
|
if ( !p ) {
|
|
document->SetError( XML_ERROR_PARSING_CDATA, start, 0 );
|
|
}
|
|
return p;
|
|
}
|
|
else {
|
|
p = value.ParseText( p, "<", document->ProcessEntities() ? StrPair::TEXT_ELEMENT : StrPair::TEXT_ELEMENT_LEAVE_ENTITIES );
|
|
if ( !p ) {
|
|
document->SetError( XML_ERROR_PARSING_TEXT, start, 0 );
|
|
}
|
|
if ( p && *p ) {
|
|
return p-1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
XMLNode* XMLText::ShallowClone( XMLDocument* doc ) const
|
|
{
|
|
if ( !doc ) {
|
|
doc = document;
|
|
}
|
|
XMLText* text = doc->NewText( Value() ); // fixme: this will always allocate memory. Intern?
|
|
text->SetCData( this->CData() );
|
|
return text;
|
|
}
|
|
|
|
|
|
bool XMLText::ShallowEqual( const XMLNode* compare ) const
|
|
{
|
|
return ( compare->ToText() && XMLUtil::StringEqual( compare->ToText()->Value(), Value() ));
|
|
}
|
|
|
|
|
|
bool XMLText::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
return visitor->Visit( *this );
|
|
}
|
|
|
|
|
|
// --------- XMLComment ---------- //
|
|
|
|
XMLComment::XMLComment( XMLDocument* doc ) : XMLNode( doc )
|
|
{
|
|
}
|
|
|
|
|
|
XMLComment::~XMLComment()
|
|
{
|
|
//printf( "~XMLComment\n" );
|
|
}
|
|
|
|
|
|
char* XMLComment::ParseDeep( char* p, StrPair* )
|
|
{
|
|
// Comment parses as text.
|
|
const char* start = p;
|
|
p = value.ParseText( p, "-->", StrPair::COMMENT );
|
|
if ( p == 0 ) {
|
|
document->SetError( XML_ERROR_PARSING_COMMENT, start, 0 );
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
XMLNode* XMLComment::ShallowClone( XMLDocument* doc ) const
|
|
{
|
|
if ( !doc ) {
|
|
doc = document;
|
|
}
|
|
XMLComment* comment = doc->NewComment( Value() ); // fixme: this will always allocate memory. Intern?
|
|
return comment;
|
|
}
|
|
|
|
|
|
bool XMLComment::ShallowEqual( const XMLNode* compare ) const
|
|
{
|
|
return ( compare->ToComment() && XMLUtil::StringEqual( compare->ToComment()->Value(), Value() ));
|
|
}
|
|
|
|
|
|
bool XMLComment::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
return visitor->Visit( *this );
|
|
}
|
|
|
|
|
|
// --------- XMLDeclaration ---------- //
|
|
|
|
XMLDeclaration::XMLDeclaration( XMLDocument* doc ) : XMLNode( doc )
|
|
{
|
|
}
|
|
|
|
|
|
XMLDeclaration::~XMLDeclaration()
|
|
{
|
|
//printf( "~XMLDeclaration\n" );
|
|
}
|
|
|
|
|
|
char* XMLDeclaration::ParseDeep( char* p, StrPair* )
|
|
{
|
|
// Declaration parses as text.
|
|
const char* start = p;
|
|
p = value.ParseText( p, "?>", StrPair::NEEDS_NEWLINE_NORMALIZATION );
|
|
if ( p == 0 ) {
|
|
document->SetError( XML_ERROR_PARSING_DECLARATION, start, 0 );
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
XMLNode* XMLDeclaration::ShallowClone( XMLDocument* doc ) const
|
|
{
|
|
if ( !doc ) {
|
|
doc = document;
|
|
}
|
|
XMLDeclaration* dec = doc->NewDeclaration( Value() ); // fixme: this will always allocate memory. Intern?
|
|
return dec;
|
|
}
|
|
|
|
|
|
bool XMLDeclaration::ShallowEqual( const XMLNode* compare ) const
|
|
{
|
|
return ( compare->ToDeclaration() && XMLUtil::StringEqual( compare->ToDeclaration()->Value(), Value() ));
|
|
}
|
|
|
|
|
|
|
|
bool XMLDeclaration::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
return visitor->Visit( *this );
|
|
}
|
|
|
|
// --------- XMLUnknown ---------- //
|
|
|
|
XMLUnknown::XMLUnknown( XMLDocument* doc ) : XMLNode( doc )
|
|
{
|
|
}
|
|
|
|
|
|
XMLUnknown::~XMLUnknown()
|
|
{
|
|
}
|
|
|
|
|
|
char* XMLUnknown::ParseDeep( char* p, StrPair* )
|
|
{
|
|
// Unknown parses as text.
|
|
const char* start = p;
|
|
|
|
p = value.ParseText( p, ">", StrPair::NEEDS_NEWLINE_NORMALIZATION );
|
|
if ( !p ) {
|
|
document->SetError( XML_ERROR_PARSING_UNKNOWN, start, 0 );
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
XMLNode* XMLUnknown::ShallowClone( XMLDocument* doc ) const
|
|
{
|
|
if ( !doc ) {
|
|
doc = document;
|
|
}
|
|
XMLUnknown* text = doc->NewUnknown( Value() ); // fixme: this will always allocate memory. Intern?
|
|
return text;
|
|
}
|
|
|
|
|
|
bool XMLUnknown::ShallowEqual( const XMLNode* compare ) const
|
|
{
|
|
return ( compare->ToUnknown() && XMLUtil::StringEqual( compare->ToUnknown()->Value(), Value() ));
|
|
}
|
|
|
|
|
|
bool XMLUnknown::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
return visitor->Visit( *this );
|
|
}
|
|
|
|
// --------- XMLAttribute ---------- //
|
|
char* XMLAttribute::ParseDeep( char* p, bool processEntities )
|
|
{
|
|
p = name.ParseText( p, "=", StrPair::ATTRIBUTE_NAME );
|
|
if ( !p || !*p ) return 0;
|
|
|
|
char endTag[2] = { *p, 0 };
|
|
++p;
|
|
p = value.ParseText( p, endTag, processEntities ? StrPair::ATTRIBUTE_VALUE : StrPair::ATTRIBUTE_VALUE_LEAVE_ENTITIES );
|
|
//if ( value.Empty() ) return 0;
|
|
return p;
|
|
}
|
|
|
|
|
|
void XMLAttribute::SetName( const char* n )
|
|
{
|
|
name.SetStr( n );
|
|
}
|
|
|
|
|
|
int XMLAttribute::QueryIntValue( int* value ) const
|
|
{
|
|
if ( TIXML_SSCANF( Value(), "%d", value ) == 1 )
|
|
return XML_NO_ERROR;
|
|
return XML_WRONG_ATTRIBUTE_TYPE;
|
|
}
|
|
|
|
|
|
int XMLAttribute::QueryUnsignedValue( unsigned int* value ) const
|
|
{
|
|
if ( TIXML_SSCANF( Value(), "%u", value ) == 1 )
|
|
return XML_NO_ERROR;
|
|
return XML_WRONG_ATTRIBUTE_TYPE;
|
|
}
|
|
|
|
|
|
int XMLAttribute::QueryBoolValue( bool* value ) const
|
|
{
|
|
int ival = -1;
|
|
QueryIntValue( &ival );
|
|
|
|
if ( ival > 0 || XMLUtil::StringEqual( Value(), "true" ) ) {
|
|
*value = true;
|
|
return XML_NO_ERROR;
|
|
}
|
|
else if ( ival == 0 || XMLUtil::StringEqual( Value(), "false" ) ) {
|
|
*value = false;
|
|
return XML_NO_ERROR;
|
|
}
|
|
return XML_WRONG_ATTRIBUTE_TYPE;
|
|
}
|
|
|
|
|
|
int XMLAttribute::QueryDoubleValue( double* value ) const
|
|
{
|
|
if ( TIXML_SSCANF( Value(), "%lf", value ) == 1 )
|
|
return XML_NO_ERROR;
|
|
return XML_WRONG_ATTRIBUTE_TYPE;
|
|
}
|
|
|
|
|
|
int XMLAttribute::QueryFloatValue( float* value ) const
|
|
{
|
|
if ( TIXML_SSCANF( Value(), "%f", value ) == 1 )
|
|
return XML_NO_ERROR;
|
|
return XML_WRONG_ATTRIBUTE_TYPE;
|
|
}
|
|
|
|
|
|
void XMLAttribute::SetAttribute( const char* v )
|
|
{
|
|
value.SetStr( v );
|
|
}
|
|
|
|
|
|
void XMLAttribute::SetAttribute( int v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%d", v );
|
|
value.SetStr( buf );
|
|
}
|
|
|
|
|
|
void XMLAttribute::SetAttribute( unsigned v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%u", v );
|
|
value.SetStr( buf );
|
|
}
|
|
|
|
|
|
void XMLAttribute::SetAttribute( bool v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%d", v ? 1 : 0 );
|
|
value.SetStr( buf );
|
|
}
|
|
|
|
void XMLAttribute::SetAttribute( double v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%f", v );
|
|
value.SetStr( buf );
|
|
}
|
|
|
|
void XMLAttribute::SetAttribute( float v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%f", v );
|
|
value.SetStr( buf );
|
|
}
|
|
|
|
|
|
// --------- XMLElement ---------- //
|
|
XMLElement::XMLElement( XMLDocument* doc ) : XMLNode( doc ),
|
|
closingType( 0 ),
|
|
rootAttribute( 0 )
|
|
{
|
|
}
|
|
|
|
|
|
XMLElement::~XMLElement()
|
|
{
|
|
while( rootAttribute ) {
|
|
XMLAttribute* next = rootAttribute->next;
|
|
DELETE_ATTRIBUTE( rootAttribute );
|
|
rootAttribute = next;
|
|
}
|
|
}
|
|
|
|
|
|
XMLAttribute* XMLElement::FindAttribute( const char* name )
|
|
{
|
|
XMLAttribute* a = 0;
|
|
for( a=rootAttribute; a; a = a->next ) {
|
|
if ( XMLUtil::StringEqual( a->Name(), name ) )
|
|
return a;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
const XMLAttribute* XMLElement::FindAttribute( const char* name ) const
|
|
{
|
|
XMLAttribute* a = 0;
|
|
for( a=rootAttribute; a; a = a->next ) {
|
|
if ( XMLUtil::StringEqual( a->Name(), name ) )
|
|
return a;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
const char* XMLElement::Attribute( const char* name, const char* value ) const
|
|
{
|
|
const XMLAttribute* a = FindAttribute( name );
|
|
if ( !a )
|
|
return 0;
|
|
if ( !value || XMLUtil::StringEqual( a->Value(), value ))
|
|
return a->Value();
|
|
return 0;
|
|
}
|
|
|
|
|
|
const char* XMLElement::GetText() const
|
|
{
|
|
if ( FirstChild() && FirstChild()->ToText() ) {
|
|
return FirstChild()->ToText()->Value();
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
XMLAttribute* XMLElement::FindOrCreateAttribute( const char* name )
|
|
{
|
|
XMLAttribute* attrib = FindAttribute( name );
|
|
if ( !attrib ) {
|
|
attrib = new (document->attributePool.Alloc() ) XMLAttribute();
|
|
attrib->memPool = &document->attributePool;
|
|
LinkAttribute( attrib );
|
|
attrib->SetName( name );
|
|
}
|
|
return attrib;
|
|
}
|
|
|
|
|
|
void XMLElement::LinkAttribute( XMLAttribute* attrib )
|
|
{
|
|
if ( rootAttribute ) {
|
|
XMLAttribute* end = rootAttribute;
|
|
while ( end->next )
|
|
end = end->next;
|
|
end->next = attrib;
|
|
}
|
|
else {
|
|
rootAttribute = attrib;
|
|
}
|
|
}
|
|
|
|
|
|
void XMLElement::DeleteAttribute( const char* name )
|
|
{
|
|
XMLAttribute* prev = 0;
|
|
for( XMLAttribute* a=rootAttribute; a; a=a->next ) {
|
|
if ( XMLUtil::StringEqual( name, a->Name() ) ) {
|
|
if ( prev ) {
|
|
prev->next = a->next;
|
|
}
|
|
else {
|
|
rootAttribute = a->next;
|
|
}
|
|
DELETE_ATTRIBUTE( a );
|
|
break;
|
|
}
|
|
prev = a;
|
|
}
|
|
}
|
|
|
|
|
|
char* XMLElement::ParseAttributes( char* p )
|
|
{
|
|
const char* start = p;
|
|
|
|
// Read the attributes.
|
|
while( p ) {
|
|
p = XMLUtil::SkipWhiteSpace( p );
|
|
if ( !p || !(*p) ) {
|
|
document->SetError( XML_ERROR_PARSING_ELEMENT, start, Name() );
|
|
return 0;
|
|
}
|
|
|
|
// attribute.
|
|
if ( XMLUtil::IsAlpha( *p ) ) {
|
|
XMLAttribute* attrib = new (document->attributePool.Alloc() ) XMLAttribute();
|
|
attrib->memPool = &document->attributePool;
|
|
|
|
p = attrib->ParseDeep( p, document->ProcessEntities() );
|
|
if ( !p || Attribute( attrib->Name() ) ) {
|
|
DELETE_ATTRIBUTE( attrib );
|
|
document->SetError( XML_ERROR_PARSING_ATTRIBUTE, start, p );
|
|
return 0;
|
|
}
|
|
LinkAttribute( attrib );
|
|
}
|
|
// end of the tag
|
|
else if ( *p == '/' && *(p+1) == '>' ) {
|
|
closingType = CLOSED;
|
|
return p+2; // done; sealed element.
|
|
}
|
|
// end of the tag
|
|
else if ( *p == '>' ) {
|
|
++p;
|
|
break;
|
|
}
|
|
else {
|
|
document->SetError( XML_ERROR_PARSING_ELEMENT, start, p );
|
|
return 0;
|
|
}
|
|
}
|
|
return p;
|
|
}
|
|
|
|
|
|
//
|
|
// <ele></ele>
|
|
// <ele>foo<b>bar</b></ele>
|
|
//
|
|
char* XMLElement::ParseDeep( char* p, StrPair* strPair )
|
|
{
|
|
// Read the element name.
|
|
p = XMLUtil::SkipWhiteSpace( p );
|
|
if ( !p ) return 0;
|
|
|
|
// The closing element is the </element> form. It is
|
|
// parsed just like a regular element then deleted from
|
|
// the DOM.
|
|
if ( *p == '/' ) {
|
|
closingType = CLOSING;
|
|
++p;
|
|
}
|
|
|
|
p = value.ParseName( p );
|
|
if ( value.Empty() ) return 0;
|
|
|
|
p = ParseAttributes( p );
|
|
if ( !p || !*p || closingType )
|
|
return p;
|
|
|
|
p = XMLNode::ParseDeep( p, strPair );
|
|
return p;
|
|
}
|
|
|
|
|
|
|
|
XMLNode* XMLElement::ShallowClone( XMLDocument* doc ) const
|
|
{
|
|
if ( !doc ) {
|
|
doc = document;
|
|
}
|
|
XMLElement* element = doc->NewElement( Value() ); // fixme: this will always allocate memory. Intern?
|
|
for( const XMLAttribute* a=FirstAttribute(); a; a=a->Next() ) {
|
|
element->SetAttribute( a->Name(), a->Value() ); // fixme: this will always allocate memory. Intern?
|
|
}
|
|
return element;
|
|
}
|
|
|
|
|
|
bool XMLElement::ShallowEqual( const XMLNode* compare ) const
|
|
{
|
|
const XMLElement* other = compare->ToElement();
|
|
if ( other && XMLUtil::StringEqual( other->Value(), Value() )) {
|
|
|
|
const XMLAttribute* a=FirstAttribute();
|
|
const XMLAttribute* b=other->FirstAttribute();
|
|
|
|
while ( a && b ) {
|
|
if ( !XMLUtil::StringEqual( a->Value(), b->Value() ) ) {
|
|
return false;
|
|
}
|
|
}
|
|
if ( a || b ) {
|
|
// different count
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
|
|
bool XMLElement::Accept( XMLVisitor* visitor ) const
|
|
{
|
|
if ( visitor->VisitEnter( *this, rootAttribute ) )
|
|
{
|
|
for ( const XMLNode* node=FirstChild(); node; node=node->NextSibling() )
|
|
{
|
|
if ( !node->Accept( visitor ) )
|
|
break;
|
|
}
|
|
}
|
|
return visitor->VisitExit( *this );
|
|
}
|
|
|
|
|
|
// --------- XMLDocument ----------- //
|
|
XMLDocument::XMLDocument( bool _processEntities ) :
|
|
XMLNode( 0 ),
|
|
writeBOM( false ),
|
|
processEntities( _processEntities ),
|
|
errorID( 0 ),
|
|
errorStr1( 0 ),
|
|
errorStr2( 0 ),
|
|
charBuffer( 0 )
|
|
{
|
|
document = this; // avoid warning about 'this' in initializer list
|
|
}
|
|
|
|
|
|
XMLDocument::~XMLDocument()
|
|
{
|
|
DeleteChildren();
|
|
delete [] charBuffer;
|
|
|
|
#if 0
|
|
textPool.Trace( "text" );
|
|
elementPool.Trace( "element" );
|
|
commentPool.Trace( "comment" );
|
|
attributePool.Trace( "attribute" );
|
|
#endif
|
|
|
|
TIXMLASSERT( textPool.CurrentAllocs() == 0 );
|
|
TIXMLASSERT( elementPool.CurrentAllocs() == 0 );
|
|
TIXMLASSERT( commentPool.CurrentAllocs() == 0 );
|
|
TIXMLASSERT( attributePool.CurrentAllocs() == 0 );
|
|
}
|
|
|
|
|
|
void XMLDocument::InitDocument()
|
|
{
|
|
errorID = XML_NO_ERROR;
|
|
errorStr1 = 0;
|
|
errorStr2 = 0;
|
|
|
|
delete [] charBuffer;
|
|
charBuffer = 0;
|
|
|
|
}
|
|
|
|
|
|
XMLElement* XMLDocument::NewElement( const char* name )
|
|
{
|
|
XMLElement* ele = new (elementPool.Alloc()) XMLElement( this );
|
|
ele->memPool = &elementPool;
|
|
ele->SetName( name );
|
|
return ele;
|
|
}
|
|
|
|
|
|
XMLComment* XMLDocument::NewComment( const char* str )
|
|
{
|
|
XMLComment* comment = new (commentPool.Alloc()) XMLComment( this );
|
|
comment->memPool = &commentPool;
|
|
comment->SetValue( str );
|
|
return comment;
|
|
}
|
|
|
|
|
|
XMLText* XMLDocument::NewText( const char* str )
|
|
{
|
|
XMLText* text = new (textPool.Alloc()) XMLText( this );
|
|
text->memPool = &textPool;
|
|
text->SetValue( str );
|
|
return text;
|
|
}
|
|
|
|
|
|
XMLDeclaration* XMLDocument::NewDeclaration( const char* str )
|
|
{
|
|
XMLDeclaration* dec = new (commentPool.Alloc()) XMLDeclaration( this );
|
|
dec->memPool = &commentPool;
|
|
dec->SetValue( str );
|
|
return dec;
|
|
}
|
|
|
|
|
|
XMLUnknown* XMLDocument::NewUnknown( const char* str )
|
|
{
|
|
XMLUnknown* unk = new (commentPool.Alloc()) XMLUnknown( this );
|
|
unk->memPool = &commentPool;
|
|
unk->SetValue( str );
|
|
return unk;
|
|
}
|
|
|
|
|
|
int XMLDocument::LoadFile( const char* filename )
|
|
{
|
|
DeleteChildren();
|
|
InitDocument();
|
|
|
|
#if defined(_MSC_VER)
|
|
#pragma warning ( push )
|
|
#pragma warning ( disable : 4996 ) // Fail to see a compelling reason why this should be deprecated.
|
|
#endif
|
|
FILE* fp = fopen( filename, "rb" );
|
|
#if defined(_MSC_VER)
|
|
#pragma warning ( pop )
|
|
#endif
|
|
if ( !fp ) {
|
|
SetError( XML_ERROR_FILE_NOT_FOUND, filename, 0 );
|
|
return errorID;
|
|
}
|
|
LoadFile( fp );
|
|
fclose( fp );
|
|
return errorID;
|
|
}
|
|
|
|
|
|
int XMLDocument::LoadFile( FILE* fp )
|
|
{
|
|
DeleteChildren();
|
|
InitDocument();
|
|
|
|
fseek( fp, 0, SEEK_END );
|
|
unsigned size = ftell( fp );
|
|
fseek( fp, 0, SEEK_SET );
|
|
|
|
if ( size == 0 ) {
|
|
return errorID;
|
|
}
|
|
|
|
charBuffer = new char[size+1];
|
|
fread( charBuffer, size, 1, fp );
|
|
charBuffer[size] = 0;
|
|
|
|
const char* p = charBuffer;
|
|
p = XMLUtil::SkipWhiteSpace( p );
|
|
p = XMLUtil::ReadBOM( p, &writeBOM );
|
|
if ( !p || !*p ) {
|
|
SetError( XML_ERROR_EMPTY_DOCUMENT, 0, 0 );
|
|
return errorID;
|
|
}
|
|
|
|
ParseDeep( charBuffer + (p-charBuffer), 0 );
|
|
return errorID;
|
|
}
|
|
|
|
|
|
void XMLDocument::SaveFile( const char* filename )
|
|
{
|
|
#if defined(_MSC_VER)
|
|
#pragma warning ( push )
|
|
#pragma warning ( disable : 4996 ) // Fail to see a compelling reason why this should be deprecated.
|
|
#endif
|
|
FILE* fp = fopen( filename, "w" );
|
|
#if defined(_MSC_VER)
|
|
#pragma warning ( pop )
|
|
#endif
|
|
if ( fp ) {
|
|
XMLPrinter stream( fp );
|
|
Print( &stream );
|
|
fclose( fp );
|
|
}
|
|
else {
|
|
SetError( XML_ERROR_FILE_COULD_NOT_BE_OPENED, filename, 0 );
|
|
}
|
|
}
|
|
|
|
|
|
int XMLDocument::Parse( const char* p )
|
|
{
|
|
DeleteChildren();
|
|
InitDocument();
|
|
|
|
if ( !p || !*p ) {
|
|
SetError( XML_ERROR_EMPTY_DOCUMENT, 0, 0 );
|
|
return errorID;
|
|
}
|
|
p = XMLUtil::SkipWhiteSpace( p );
|
|
p = XMLUtil::ReadBOM( p, &writeBOM );
|
|
if ( !p || !*p ) {
|
|
SetError( XML_ERROR_EMPTY_DOCUMENT, 0, 0 );
|
|
return errorID;
|
|
}
|
|
|
|
size_t len = strlen( p );
|
|
charBuffer = new char[ len+1 ];
|
|
memcpy( charBuffer, p, len+1 );
|
|
|
|
|
|
ParseDeep( charBuffer, 0 );
|
|
return errorID;
|
|
}
|
|
|
|
|
|
void XMLDocument::Print( XMLPrinter* streamer )
|
|
{
|
|
XMLPrinter stdStreamer( stdout );
|
|
if ( !streamer )
|
|
streamer = &stdStreamer;
|
|
Accept( streamer );
|
|
}
|
|
|
|
|
|
void XMLDocument::SetError( int error, const char* str1, const char* str2 )
|
|
{
|
|
errorID = error;
|
|
errorStr1 = str1;
|
|
errorStr2 = str2;
|
|
}
|
|
|
|
|
|
void XMLDocument::PrintError() const
|
|
{
|
|
if ( errorID ) {
|
|
static const int LEN = 20;
|
|
char buf1[LEN] = { 0 };
|
|
char buf2[LEN] = { 0 };
|
|
|
|
if ( errorStr1 ) {
|
|
TIXML_SNPRINTF( buf1, LEN, "%s", errorStr1 );
|
|
}
|
|
if ( errorStr2 ) {
|
|
TIXML_SNPRINTF( buf2, LEN, "%s", errorStr2 );
|
|
}
|
|
|
|
printf( "XMLDocument error id=%d str1=%s str2=%s\n",
|
|
errorID, buf1, buf2 );
|
|
}
|
|
}
|
|
|
|
|
|
XMLPrinter::XMLPrinter( FILE* file ) :
|
|
elementJustOpened( false ),
|
|
firstElement( true ),
|
|
fp( file ),
|
|
depth( 0 ),
|
|
textDepth( -1 ),
|
|
processEntities( true )
|
|
{
|
|
for( int i=0; i<ENTITY_RANGE; ++i ) {
|
|
entityFlag[i] = false;
|
|
restrictedEntityFlag[i] = false;
|
|
}
|
|
for( int i=0; i<NUM_ENTITIES; ++i ) {
|
|
TIXMLASSERT( entities[i].value < ENTITY_RANGE );
|
|
if ( entities[i].value < ENTITY_RANGE ) {
|
|
entityFlag[ (int)entities[i].value ] = true;
|
|
}
|
|
}
|
|
restrictedEntityFlag[(int)'&'] = true;
|
|
restrictedEntityFlag[(int)'<'] = true;
|
|
restrictedEntityFlag[(int)'>'] = true; // not required, but consistency is nice
|
|
buffer.Push( 0 );
|
|
}
|
|
|
|
|
|
void XMLPrinter::Print( const char* format, ... )
|
|
{
|
|
va_list va;
|
|
va_start( va, format );
|
|
|
|
if ( fp ) {
|
|
vfprintf( fp, format, va );
|
|
}
|
|
else {
|
|
// This seems brutally complex. Haven't figured out a better
|
|
// way on windows.
|
|
#ifdef _MSC_VER
|
|
int len = -1;
|
|
int expand = 1000;
|
|
while ( len < 0 ) {
|
|
len = vsnprintf_s( accumulator.Mem(), accumulator.Capacity(), _TRUNCATE, format, va );
|
|
if ( len < 0 ) {
|
|
expand *= 3/2;
|
|
accumulator.PushArr( expand );
|
|
}
|
|
}
|
|
char* p = buffer.PushArr( len ) - 1;
|
|
memcpy( p, accumulator.Mem(), len+1 );
|
|
#else
|
|
int len = vsnprintf( 0, 0, format, va );
|
|
// Close out and re-start the va-args
|
|
va_end( va );
|
|
va_start( va, format );
|
|
char* p = buffer.PushArr( len ) - 1;
|
|
vsnprintf( p, len+1, format, va );
|
|
#endif
|
|
}
|
|
va_end( va );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PrintSpace( int depth )
|
|
{
|
|
for( int i=0; i<depth; ++i ) {
|
|
Print( " " );
|
|
}
|
|
}
|
|
|
|
|
|
void XMLPrinter::PrintString( const char* p, bool restricted )
|
|
{
|
|
// Look for runs of bytes between entities to print.
|
|
const char* q = p;
|
|
const bool* flag = restricted ? restrictedEntityFlag : entityFlag;
|
|
|
|
if ( processEntities ) {
|
|
while ( *q ) {
|
|
// Remember, char is sometimes signed. (How many times has that bitten me?)
|
|
if ( *q > 0 && *q < ENTITY_RANGE ) {
|
|
// Check for entities. If one is found, flush
|
|
// the stream up until the entity, write the
|
|
// entity, and keep looking.
|
|
if ( flag[(unsigned)(*q)] ) {
|
|
while ( p < q ) {
|
|
Print( "%c", *p );
|
|
++p;
|
|
}
|
|
for( int i=0; i<NUM_ENTITIES; ++i ) {
|
|
if ( entities[i].value == *q ) {
|
|
Print( "&%s;", entities[i].pattern );
|
|
break;
|
|
}
|
|
}
|
|
++p;
|
|
}
|
|
}
|
|
++q;
|
|
}
|
|
}
|
|
// Flush the remaining string. This will be the entire
|
|
// string if an entity wasn't found.
|
|
if ( !processEntities || (q-p > 0) ) {
|
|
Print( "%s", p );
|
|
}
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushHeader( bool writeBOM, bool writeDec )
|
|
{
|
|
static const unsigned char bom[] = { TIXML_UTF_LEAD_0, TIXML_UTF_LEAD_1, TIXML_UTF_LEAD_2, 0 };
|
|
if ( writeBOM ) {
|
|
Print( "%s", bom );
|
|
}
|
|
if ( writeDec ) {
|
|
PushDeclaration( "xml version=\"1.0\"" );
|
|
}
|
|
}
|
|
|
|
|
|
void XMLPrinter::OpenElement( const char* name )
|
|
{
|
|
if ( elementJustOpened ) {
|
|
SealElement();
|
|
}
|
|
stack.Push( name );
|
|
|
|
if ( textDepth < 0 && !firstElement ) {
|
|
Print( "\n" );
|
|
PrintSpace( depth );
|
|
}
|
|
|
|
Print( "<%s", name );
|
|
elementJustOpened = true;
|
|
firstElement = false;
|
|
++depth;
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushAttribute( const char* name, const char* value )
|
|
{
|
|
TIXMLASSERT( elementJustOpened );
|
|
Print( " %s=\"", name );
|
|
PrintString( value, false );
|
|
Print( "\"" );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushAttribute( const char* name, int v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%d", v );
|
|
PushAttribute( name, buf );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushAttribute( const char* name, unsigned v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%u", v );
|
|
PushAttribute( name, buf );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushAttribute( const char* name, bool v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%d", v ? 1 : 0 );
|
|
PushAttribute( name, buf );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushAttribute( const char* name, double v )
|
|
{
|
|
char buf[BUF_SIZE];
|
|
TIXML_SNPRINTF( buf, BUF_SIZE, "%f", v );
|
|
PushAttribute( name, buf );
|
|
}
|
|
|
|
|
|
void XMLPrinter::CloseElement()
|
|
{
|
|
--depth;
|
|
const char* name = stack.Pop();
|
|
|
|
if ( elementJustOpened ) {
|
|
Print( "/>" );
|
|
}
|
|
else {
|
|
if ( textDepth < 0 ) {
|
|
Print( "\n" );
|
|
PrintSpace( depth );
|
|
}
|
|
Print( "</%s>", name );
|
|
}
|
|
|
|
if ( textDepth == depth )
|
|
textDepth = -1;
|
|
if ( depth == 0 )
|
|
Print( "\n" );
|
|
elementJustOpened = false;
|
|
}
|
|
|
|
|
|
void XMLPrinter::SealElement()
|
|
{
|
|
elementJustOpened = false;
|
|
Print( ">" );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushText( const char* text, bool cdata )
|
|
{
|
|
textDepth = depth-1;
|
|
|
|
if ( elementJustOpened ) {
|
|
SealElement();
|
|
}
|
|
if ( cdata ) {
|
|
Print( "<![CDATA[" );
|
|
Print( "%s", text );
|
|
Print( "]]>" );
|
|
}
|
|
else {
|
|
PrintString( text, true );
|
|
}
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushComment( const char* comment )
|
|
{
|
|
if ( elementJustOpened ) {
|
|
SealElement();
|
|
}
|
|
if ( textDepth < 0 && !firstElement ) {
|
|
Print( "\n" );
|
|
PrintSpace( depth );
|
|
}
|
|
firstElement = false;
|
|
Print( "<!--%s-->", comment );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushDeclaration( const char* value )
|
|
{
|
|
if ( elementJustOpened ) {
|
|
SealElement();
|
|
}
|
|
if ( textDepth < 0 && !firstElement) {
|
|
Print( "\n" );
|
|
PrintSpace( depth );
|
|
}
|
|
firstElement = false;
|
|
Print( "<?%s?>", value );
|
|
}
|
|
|
|
|
|
void XMLPrinter::PushUnknown( const char* value )
|
|
{
|
|
if ( elementJustOpened ) {
|
|
SealElement();
|
|
}
|
|
if ( textDepth < 0 && !firstElement ) {
|
|
Print( "\n" );
|
|
PrintSpace( depth );
|
|
}
|
|
firstElement = false;
|
|
Print( "<!%s>", value );
|
|
}
|
|
|
|
|
|
bool XMLPrinter::VisitEnter( const XMLDocument& doc )
|
|
{
|
|
processEntities = doc.ProcessEntities();
|
|
if ( doc.HasBOM() ) {
|
|
PushHeader( true, false );
|
|
}
|
|
return true;
|
|
}
|
|
|
|
|
|
bool XMLPrinter::VisitEnter( const XMLElement& element, const XMLAttribute* attribute )
|
|
{
|
|
OpenElement( element.Name() );
|
|
while ( attribute ) {
|
|
PushAttribute( attribute->Name(), attribute->Value() );
|
|
attribute = attribute->Next();
|
|
}
|
|
return true;
|
|
}
|
|
|
|
|
|
bool XMLPrinter::VisitExit( const XMLElement& )
|
|
{
|
|
CloseElement();
|
|
return true;
|
|
}
|
|
|
|
|
|
bool XMLPrinter::Visit( const XMLText& text )
|
|
{
|
|
PushText( text.Value(), text.CData() );
|
|
return true;
|
|
}
|
|
|
|
|
|
bool XMLPrinter::Visit( const XMLComment& comment )
|
|
{
|
|
PushComment( comment.Value() );
|
|
return true;
|
|
}
|
|
|
|
bool XMLPrinter::Visit( const XMLDeclaration& declaration )
|
|
{
|
|
PushDeclaration( declaration.Value() );
|
|
return true;
|
|
}
|
|
|
|
|
|
bool XMLPrinter::Visit( const XMLUnknown& unknown )
|
|
{
|
|
PushUnknown( unknown.Value() );
|
|
return true;
|
|
}
|