#ifndef TINYXML2_INCLUDED #define TINYXML2_INCLUDED /* TODO - const and non-const versions of API X memory pool the class construction - attribute accessors - node navigation - handles - visit pattern - change streamer? - make constructors protected - hide copy constructor - hide = operator X UTF8 support: isAlpha, etc. */ #include #include #include #include #if defined( _DEBUG ) || defined( DEBUG ) || defined (__DEBUG__) #ifndef DEBUG #define DEBUG #endif #endif #if defined(DEBUG) #if defined(_MSC_VER) #define TIXMLASSERT( x ) if ( !(x)) { _asm { int 3 } } //if ( !(x)) WinDebugBreak() #elif defined (ANDROID_NDK) #include #define TIXMLASSERT( x ) if ( !(x)) { __android_log_assert( "assert", "grinliz", "ASSERT in '%s' at %d.", __FILE__, __LINE__ ); } #else #include #define TIXMLASSERT assert #endif #else #define TIXMLASSERT( x ) {} #endif namespace tinyxml2 { class XMLDocument; class XMLElement; class XMLAttribute; class XMLComment; class XMLNode; class XMLText; class XMLStreamer; class StrPair { public: enum { NEEDS_ENTITY_PROCESSING = 0x01, NEEDS_NEWLINE_NORMALIZATION = 0x02, TEXT_ELEMENT = NEEDS_ENTITY_PROCESSING | NEEDS_NEWLINE_NORMALIZATION, ATTRIBUTE_NAME = 0, ATTRIBUTE_VALUE = NEEDS_ENTITY_PROCESSING | NEEDS_NEWLINE_NORMALIZATION, COMMENT = NEEDS_NEWLINE_NORMALIZATION, }; StrPair() : flags( 0 ), start( 0 ), end( 0 ) {} void Set( char* start, char* end, int flags ) { this->start = start; this->end = end; this->flags = flags | NEEDS_FLUSH; } const char* GetStr(); bool Empty() const { return start == end; } void SetInternedStr( const char* str ) { this->start = (char*) str; this->end = 0; this->flags = 0; } char* ParseText( char* in, const char* endTag, int strFlags ); char* ParseName( char* in ); private: enum { NEEDS_FLUSH = 0x100 }; // After parsing, if *end != 0, it can be set to zero. int flags; char* start; char* end; }; template class DynArray { public: DynArray< T, INIT >() { mem = pool; allocated = INIT; size = 0; } ~DynArray() { if ( mem != pool ) { delete mem; } } void Push( T t ) { EnsureCapacity( size+1 ); mem[size++] = t; } T* PushArr( int count ) { EnsureCapacity( size+count ); T* ret = &mem[size]; size += count; return ret; } T Pop() { return mem[--size]; } void PopArr( int count ) { TIXMLASSERT( size >= count ); size -= count; } bool Empty() const { return size == 0; } T& operator[](int i) { TIXMLASSERT( i>= 0 && i < size ); return mem[i]; } const T& operator[](int i) const { TIXMLASSERT( i>= 0 && i < size ); return mem[i]; } int Size() const { return size; } const T* Mem() const { return mem; } T* Mem() { return mem; } private: void EnsureCapacity( int cap ) { if ( cap > allocated ) { int newAllocated = cap * 2; T* newMem = new T[newAllocated]; memcpy( newMem, mem, sizeof(T)*size ); // warning: not using constructors, only works for PODs if ( mem != pool ) delete [] mem; mem = newMem; allocated = newAllocated; } } T* mem; T pool[INIT]; int allocated; // objects allocated int size; // number objects in use }; class MemPool { public: MemPool() {} virtual ~MemPool() {} virtual int ItemSize() const = 0; virtual void* Alloc() = 0; virtual void Free( void* ) = 0; }; template< int SIZE > class MemPoolT : public MemPool { public: MemPoolT() : root(0), currentAllocs(0), nAllocs(0), maxAllocs(0) {} ~MemPoolT() { // Delete the blocks. for( int i=0; ichunk[i].next = &block->chunk[i+1]; } block->chunk[COUNT-1].next = 0; root = block->chunk; } void* result = root; root = root->next; ++currentAllocs; if ( currentAllocs > maxAllocs ) maxAllocs = currentAllocs; nAllocs++; return result; } virtual void Free( void* mem ) { if ( !mem ) return; --currentAllocs; Chunk* chunk = (Chunk*)mem; memset( chunk, 0xfe, sizeof(Chunk) ); chunk->next = root; root = chunk; } void Trace( const char* name ) { printf( "Mempool %s watermark=%d [%dk] current=%d size=%d nAlloc=%d blocks=%d\n", name, maxAllocs, maxAllocs*SIZE/1024, currentAllocs, SIZE, nAllocs, blockPtrs.Size() ); } private: enum { COUNT = 1024/SIZE }; union Chunk { Chunk* next; char mem[SIZE]; }; struct Block { Chunk chunk[COUNT]; }; DynArray< Block*, 10 > blockPtrs; Chunk* root; int currentAllocs; int nAllocs; int maxAllocs; }; /* class StringStack { public: StringStack(); virtual ~StringStack(); void Push( const char* str ); const char* Pop(); int NumPositive() const { return nPositive; } private: DynArray< char, 50 > mem; int nPositive; // number of strings with len > 0 }; */ /* class StringPool { public: enum { INIT_SIZE=20 }; StringPool() : size( 0 ) { const char** mem = pool.PushArr( INIT_SIZE ); memset( (void*)mem, 0, sizeof(char)*INIT_SIZE ); } ~StringPool() {} const char* Intern( const char* str ); private: // FNV hash int Hash( const char* s ) { #define FNV_32_PRIME ((int)0x01000193) int hval = 0; while (*s) { hval *= FNV_32_PRIME; hval ^= (int)*s++; } return hval; } int size; DynArray< const char*, INIT_SIZE > pool; // the hash table StringStack store; // memory for the interned strings }; */ /** Implements the interface to the "Visitor pattern" (see the Accept() method.) If you call the Accept() method, it requires being passed a XMLVisitor class to handle callbacks. For nodes that contain other nodes (Document, Element) you will get called with a VisitEnter/VisitExit pair. Nodes that are always leaves are simply called with Visit(). If you return 'true' from a Visit method, recursive parsing will continue. If you return false, no children of this node or its sibilings will be Visited. All flavors of Visit methods have a default implementation that returns 'true' (continue visiting). You need to only override methods that are interesting to you. Generally Accept() is called on the TiXmlDocument, although all nodes suppert Visiting. You should never change the document from a callback. @sa XMLNode::Accept() */ class XMLVisitor { public: virtual ~XMLVisitor() {} /// Visit a document. virtual bool VisitEnter( const XMLDocument& /*doc*/ ) { return true; } /// Visit a document. virtual bool VisitExit( const XMLDocument& /*doc*/ ) { return true; } /// Visit an element. virtual bool VisitEnter( const XMLElement& /*element*/, const XMLAttribute* /*firstAttribute*/ ) { return true; } /// Visit an element. virtual bool VisitExit( const XMLElement& /*element*/ ) { return true; } /// Visit a declaration //virtual bool Visit( const TiXmlDeclaration& /*declaration*/ ) { return true; } /// Visit a text node virtual bool Visit( const XMLText& /*text*/ ) { return true; } /// Visit a comment node virtual bool Visit( const XMLComment& /*comment*/ ) { return true; } /// Visit an unknown node //virtual bool Visit( const TiXmlUnknown& /*unknown*/ ) { return true; } }; class XMLUtil { public: // Anything in the high order range of UTF-8 is assumed to not be whitespace. This isn't // correct, but simple, and usually works. static const char* SkipWhiteSpace( const char* p ) { while( IsUTF8Continuation(*p) || isspace( *p ) ) { ++p; } return p; } static char* SkipWhiteSpace( char* p ) { while( IsUTF8Continuation(*p) || isspace( *p ) ) { ++p; } return p; } inline static bool StringEqual( const char* p, const char* q, int nChar=INT_MAX ) { int n = 0; if ( p == q ) { return true; } while( *p && *q && *p == *q && n(const_cast(this)->FirstChildElement( value )); } const XMLNode* LastChild() const { return lastChild; } XMLNode* LastChild() { return const_cast(const_cast(this)->LastChild() ); } const XMLElement* LastChildElement( const char* value=0 ) const; XMLElement* LastChildElement( const char* value=0 ) { return const_cast(const_cast(this)->LastChildElement(value) ); } const XMLNode* PreviousSibling() const { return prev; } XMLNode* PreviousSibling() { return prev; } const XMLNode* PreviousSiblingElement( const char* value=0 ) const ; XMLNode* PreviousSiblingElement( const char* value=0 ) { return const_cast(const_cast(this)->PreviousSiblingElement( value ) ); } const XMLNode* NextSibling() const { return next; } XMLNode* NextSibling() { return next; } const XMLNode* NextSiblingElement( const char* value=0 ) const; XMLNode* NextSiblingElement( const char* value=0 ) { return const_cast(const_cast(this)->NextSiblingElement( value ) ); } XMLNode* InsertEndChild( XMLNode* addThis ); XMLNode* InsertFirstChild( XMLNode* addThis ); XMLNode* InsertAfterChild( XMLNode* afterThis, XMLNode* addThis ); void ClearChildren(); void DeleteChild( XMLNode* node ); virtual bool Accept( XMLVisitor* visitor ) const = 0; virtual void Print( XMLStreamer* streamer ); virtual char* ParseDeep( char* ); void SetTextParent() { isTextParent = true; } bool IsTextParent() const { return isTextParent; } virtual bool IsClosingElement() const { return false; } protected: XMLNode( XMLDocument* ); virtual ~XMLNode(); XMLDocument* document; XMLNode* parent; bool isTextParent; mutable StrPair value; XMLNode* firstChild; XMLNode* lastChild; XMLNode* prev; XMLNode* next; private: MemPool* memPool; void Unlink( XMLNode* child ); }; class XMLText : public XMLNode { friend class XMLBase; friend class XMLDocument; public: virtual void Print( XMLStreamer* streamer ); const char* Value() { return value.GetStr(); } void SetValue( const char* ); virtual bool Accept( XMLVisitor* visitor ) const; virtual XMLText* ToText() { return this; } char* ParseDeep( char* ); protected: XMLText( XMLDocument* doc ) : XMLNode( doc ) {} virtual ~XMLText() {} private: }; class XMLComment : public XMLNode { friend class XMLBase; friend class XMLDocument; public: virtual void Print( XMLStreamer* ); virtual XMLComment* ToComment() { return this; } const char* Value() { return value.GetStr(); } virtual bool Accept( XMLVisitor* visitor ) const; char* ParseDeep( char* ); protected: XMLComment( XMLDocument* doc ); virtual ~XMLComment(); private: }; class XMLAttribute { friend class XMLElement; public: virtual void Print( XMLStreamer* streamer ); private: XMLAttribute( XMLElement* element ) : next( 0 ) {} virtual ~XMLAttribute() {} char* ParseDeep( char* p ); StrPair name; StrPair value; XMLAttribute* next; MemPool* memPool; }; class XMLElement : public XMLNode { friend class XMLBase; friend class XMLDocument; public: const char* Name() const { return Value(); } void SetName( const char* str ) { SetValue( str ); } virtual void Print( XMLStreamer* ); virtual XMLElement* ToElement() { return this; } virtual bool Accept( XMLVisitor* visitor ) const; // internal: virtual bool IsClosingElement() const { return closing; } char* ParseDeep( char* p ); protected: XMLElement( XMLDocument* doc ); virtual ~XMLElement(); private: char* ParseAttributes( char* p, bool *closedElement ); bool closing; XMLAttribute* rootAttribute; XMLAttribute* lastAttribute; }; class XMLDocument : public XMLNode { friend class XMLElement; public: XMLDocument(); ~XMLDocument(); virtual XMLDocument* ToDocument() { return this; } int Parse( const char* ); int Load( const char* ); int Load( FILE* ); void Print( XMLStreamer* streamer=0 ); virtual bool Accept( XMLVisitor* visitor ) const; XMLElement* NewElement( const char* name ); enum { NO_ERROR = 0, ERROR_ELEMENT_MISMATCH, ERROR_PARSING_ELEMENT, ERROR_PARSING_ATTRIBUTE }; void SetError( int error, const char* str1, const char* str2 ); bool Error() const { return errorID != NO_ERROR; } int GetErrorID() const { return errorID; } const char* GetErrorStr1() const { return errorStr1; } const char* GetErrorStr2() const { return errorStr2; } char* Identify( char* p, XMLNode** node ); private: XMLDocument( const XMLDocument& ); // intentionally not implemented void InitDocument(); int errorID; const char* errorStr1; const char* errorStr2; char* charBuffer; //StringStack stringPool; MemPoolT< sizeof(XMLElement) > elementPool; MemPoolT< sizeof(XMLAttribute) > attributePool; MemPoolT< sizeof(XMLText) > textPool; MemPoolT< sizeof(XMLComment) > commentPool; }; class XMLStreamer { public: XMLStreamer( FILE* file ); ~XMLStreamer() {} void OpenElement( const char* name ); void PushAttribute( const char* name, const char* value ); void CloseElement(); void PushText( const char* text ); void PushComment( const char* comment ); private: void SealElement(); void PrintSpace( int depth ); void PrintString( const char* ); // prints out, after detecting entities. /* bool TextOnStack() const { for( int i=0; i stack; //DynArray< char, 10 > text; }; }; // tinyxml2 #endif // TINYXML2_INCLUDED