mirror of
https://github.com/reactos/reactos.git
synced 2024-11-05 14:19:25 +00:00
f9b5ca3c79
CORE-9198 #resolve svn path=/trunk/; revision=66372
1041 lines
22 KiB
C++
1041 lines
22 KiB
C++
|
|
//
|
|
// XML storage C++ classes version 1.3
|
|
//
|
|
// Copyright (c) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Martin Fuchs <martin-fuchs@gmx.net>
|
|
//
|
|
|
|
/// \file xmlstorage.cpp
|
|
/// XMLStorage implementation file
|
|
|
|
|
|
/*
|
|
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* 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.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS 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 COPYRIGHT OWNER OR 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.
|
|
|
|
*/
|
|
|
|
#include <precomp.h>
|
|
|
|
#ifndef XS_NO_COMMENT
|
|
#define XS_NO_COMMENT // no #pragma comment(lib, ...) statements in .lib files to enable static linking
|
|
#endif
|
|
|
|
//#include "xmlstorage.h"
|
|
|
|
|
|
namespace XMLStorage {
|
|
|
|
|
|
// work around GCC's wide string constant bug
|
|
#ifdef __GNUC__
|
|
const LPCXSSTR XS_EMPTY = XS_EMPTY_STR;
|
|
const LPCXSSTR XS_TRUE = XS_TRUE_STR;
|
|
const LPCXSSTR XS_FALSE = XS_FALSE_STR;
|
|
const LPCXSSTR XS_INTFMT = XS_INTFMT_STR;
|
|
const LPCXSSTR XS_FLOATFMT = XS_FLOATFMT_STR;
|
|
#endif
|
|
|
|
const XS_String XS_KEY = XS_KEY_STR;
|
|
const XS_String XS_VALUE = XS_VALUE_STR;
|
|
const XS_String XS_PROPERTY = XS_PROPERTY_STR;
|
|
|
|
|
|
/// remove escape characters from zero terminated string
|
|
static std::string unescape(const char* s, char b, char e)
|
|
{
|
|
const char* end = s + strlen(s);
|
|
|
|
// if (*s == b)
|
|
// ++s;
|
|
//
|
|
// if (end>s && end[-1]==e)
|
|
// --end;
|
|
|
|
if (*s == b)
|
|
if (end>s && end[-1]==e)
|
|
++s, --end;
|
|
|
|
return std::string(s, end-s);
|
|
}
|
|
|
|
inline std::string unescape(const char* s)
|
|
{
|
|
return unescape(s, '"', '"');
|
|
}
|
|
|
|
/// remove escape characters from string with specified length
|
|
static std::string unescape(const char* s, size_t l, char b, char e)
|
|
{
|
|
const char* end = s + l;
|
|
|
|
// if (*s == b)
|
|
// ++s;
|
|
//
|
|
// if (end>s && end[-1]==e)
|
|
// --end;
|
|
|
|
if (*s == b)
|
|
if (end>s && end[-1]==e)
|
|
++s, --end;
|
|
|
|
return std::string(s, end-s);
|
|
}
|
|
|
|
inline std::string unescape(const char* s, size_t l)
|
|
{
|
|
return unescape(s, l, '"', '"');
|
|
}
|
|
|
|
|
|
/// move to the position defined by xpath in XML tree
|
|
bool XMLPos::go(const XPath& xpath)
|
|
{
|
|
XMLNode* node = xpath._absolute? _root: _cur;
|
|
|
|
node = node->find_relative(xpath);
|
|
|
|
if (node) {
|
|
go_to(node);
|
|
return true;
|
|
} else
|
|
return false;
|
|
}
|
|
|
|
/// move to the position defined by xpath in XML tree
|
|
bool const_XMLPos::go(const XPath& xpath)
|
|
{
|
|
const XMLNode* node = xpath._absolute? _root: _cur;
|
|
|
|
node = node->find_relative(xpath);
|
|
|
|
if (node) {
|
|
go_to(node);
|
|
return true;
|
|
} else
|
|
return false;
|
|
}
|
|
|
|
|
|
const char* XPathElement::parse(const char* path)
|
|
{
|
|
const char* slash = strchr(path, '/');
|
|
if (slash == path)
|
|
return NULL;
|
|
|
|
size_t l = slash? slash-path: strlen(path);
|
|
std::string comp(path, l);
|
|
path += l;
|
|
|
|
// look for [n] and [@attr_name="attr_value"] expressions in path components
|
|
const char* bracket = strchr(comp.c_str(), '[');
|
|
l = bracket? bracket-comp.c_str(): comp.length();
|
|
_child_name.assign(comp.c_str(), l);
|
|
|
|
int n = 0;
|
|
if (bracket) {
|
|
std::string expr = unescape(bracket, '[', ']');
|
|
const char* p = expr.c_str();
|
|
|
|
n = atoi(p); // read index number
|
|
|
|
if (n)
|
|
_child_idx = n - 1; // convert into zero based index
|
|
|
|
const char* at = strchr(p, '@');
|
|
|
|
if (at) {
|
|
p = at + 1;
|
|
const char* equal = strchr(p, '=');
|
|
|
|
// read attribute name and value
|
|
if (equal) {
|
|
_attr_name = unescape(p, equal-p);
|
|
_attr_value = unescape(equal+1);
|
|
}
|
|
}
|
|
}
|
|
|
|
return path;
|
|
}
|
|
|
|
XMLNode* XPathElement::find(XMLNode* node) const
|
|
{
|
|
int n = 0;
|
|
|
|
for(XMLNode::Children::const_iterator it=node->_children.begin(); it!=node->_children.end(); ++it)
|
|
if (matches(**it, n))
|
|
return *it;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
const XMLNode* XPathElement::const_find(const XMLNode* node) const
|
|
{
|
|
int n = 0;
|
|
|
|
for(XMLNode::Children::const_iterator it=node->_children.begin(); it!=node->_children.end(); ++it)
|
|
if (matches(**it, n))
|
|
return *it;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
bool XPathElement::matches(const XMLNode& node, int& n) const
|
|
{
|
|
if (node != _child_name)
|
|
if (_child_name != XS_TEXT("*")) // use asterisk as wildcard
|
|
return false;
|
|
|
|
if (!_attr_name.empty())
|
|
if (node.get(_attr_name) != _attr_value)
|
|
return false;
|
|
|
|
if (_child_idx == -1)
|
|
return true;
|
|
else if (n++ == _child_idx)
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
|
|
void XPath::init(const char* path)
|
|
{
|
|
// Is this an absolute path?
|
|
if (*path == '/') {
|
|
_absolute = true;
|
|
++path;
|
|
} else
|
|
_absolute = false;
|
|
|
|
// parse path
|
|
while(*path) {
|
|
XPathElement elem;
|
|
|
|
path = elem.parse(path);
|
|
|
|
if (!path)
|
|
break;
|
|
|
|
if (*path == '/')
|
|
++path;
|
|
|
|
push_back(elem);
|
|
}
|
|
}
|
|
|
|
|
|
const XMLNode* XMLNode::find_relative(const XPath& xpath) const
|
|
{
|
|
const XMLNode* node = this;
|
|
|
|
for(XPath::const_iterator it=xpath.begin(); it!=xpath.end(); ++it) {
|
|
node = it->const_find(node);
|
|
|
|
if (!node)
|
|
return NULL;
|
|
}
|
|
|
|
return node;
|
|
}
|
|
|
|
XMLNode* XMLNode::find_relative(const XPath& xpath)
|
|
{
|
|
XMLNode* node = this;
|
|
|
|
for(XPath::const_iterator it=xpath.begin(); it!=xpath.end(); ++it) {
|
|
node = it->find(node);
|
|
|
|
if (!node)
|
|
return NULL;
|
|
}
|
|
|
|
return node;
|
|
}
|
|
|
|
XMLNode* XMLNode::create_relative(const XPath& xpath)
|
|
{
|
|
XMLNode* node = this;
|
|
|
|
for(XPath::const_iterator it=xpath.begin(); it!=xpath.end(); ++it) {
|
|
XMLNode* child = it->find(node);
|
|
|
|
if (!child) {
|
|
child = new XMLNode(it->_child_name);
|
|
node->add_child(child);
|
|
|
|
if (!it->_attr_name.empty())
|
|
(*this)[it->_attr_name] = it->_attr_value;
|
|
}
|
|
|
|
node = child;
|
|
}
|
|
|
|
return node;
|
|
}
|
|
|
|
/// count the nodes matching the given relative XPath expression
|
|
int XMLNode::count(XPath::const_iterator from, const XPath::const_iterator& to) const
|
|
{
|
|
const XPathElement& elem = *from++;
|
|
int cnt = 0;
|
|
int n = 0;
|
|
|
|
for(XMLNode::Children::const_iterator it=_children.begin(); it!=_children.end(); ++it)
|
|
if (elem.matches(**it, n)) {
|
|
if (from != to)
|
|
// iterate deeper
|
|
cnt += (*it)->count(from, to);
|
|
else
|
|
// increment match counter
|
|
++cnt;
|
|
}
|
|
|
|
return cnt;
|
|
}
|
|
|
|
/// copy matching tree nodes using the given XPath filter expression
|
|
bool XMLNode::filter(const XPath& xpath, XMLNode& target) const
|
|
{
|
|
XMLNode* ret = filter(xpath.begin(), xpath.end());
|
|
|
|
if (ret) {
|
|
// move returned nodes to target node
|
|
target._children.move(ret->_children);
|
|
target._attributes = ret->_attributes;
|
|
|
|
delete ret;
|
|
|
|
return true;
|
|
} else
|
|
return false;
|
|
}
|
|
|
|
/// create a new node tree using the given XPath filter expression
|
|
XMLNode* XMLNode::filter(XPath::const_iterator from, const XPath::const_iterator& to) const
|
|
{
|
|
XMLNode* copy = NULL;
|
|
|
|
const XPathElement& elem = *from++;
|
|
int cnt = 0;
|
|
int n = 0;
|
|
|
|
for(XMLNode::Children::const_iterator it=_children.begin(); it!=_children.end(); ++it)
|
|
if (elem.matches(**it, n)) {
|
|
if (!copy)
|
|
copy = new XMLNode(*this, XMLNode::COPY_NOCHILDREN);
|
|
|
|
if (from != to) {
|
|
XMLNode* ret = (*it)->filter(from, to);
|
|
|
|
if (ret) {
|
|
copy->add_child(ret);
|
|
++cnt;
|
|
}
|
|
} else {
|
|
copy->add_child(new XMLNode(**it, XMLNode::COPY_NOCHILDREN));
|
|
++cnt;
|
|
}
|
|
}
|
|
|
|
if (cnt > 0) {
|
|
return copy;
|
|
} else {
|
|
delete copy;
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
|
|
/// encode XML string literals
|
|
std::string EncodeXMLString(const XS_String& str, bool cdata)
|
|
{
|
|
LPCXSSTR s = str.c_str();
|
|
size_t l = XS_len(s);
|
|
|
|
if (cdata) {
|
|
// encode the whole string in a CDATA section
|
|
std::string ret = CDATA_START;
|
|
|
|
#ifdef XS_STRING_UTF8
|
|
ret += str;
|
|
#else
|
|
ret += get_utf8(str);
|
|
#endif
|
|
|
|
ret += CDATA_END;
|
|
|
|
return ret;
|
|
} else if (l <= BUFFER_LEN) {
|
|
LPXSSTR buffer = (LPXSSTR)alloca(6*sizeof(XS_CHAR)*XS_len(s)); // worst case """ / "'"
|
|
LPXSSTR o = buffer;
|
|
|
|
for(LPCXSSTR p=s; *p; ++p)
|
|
switch(*p) {
|
|
case '&':
|
|
*o++ = '&'; *o++ = 'a'; *o++ = 'm'; *o++ = 'p'; *o++ = ';'; // "&"
|
|
break;
|
|
|
|
case '<':
|
|
*o++ = '&'; *o++ = 'l'; *o++ = 't'; *o++ = ';'; // "<"
|
|
break;
|
|
|
|
case '>':
|
|
*o++ = '&'; *o++ = 'g'; *o++ = 't'; *o++ = ';'; // ">"
|
|
break;
|
|
|
|
case '"':
|
|
*o++ = '&'; *o++ = 'q'; *o++ = 'u'; *o++ = 'o'; *o++ = 't'; *o++ = ';'; // """
|
|
break;
|
|
|
|
case '\'':
|
|
*o++ = '&'; *o++ = 'a'; *o++ = 'p'; *o++ = 'o'; *o++ = 's'; *o++ = ';'; // "'"
|
|
break;
|
|
|
|
default:
|
|
if ((unsigned)*p<0x20 && *p!='\t' && *p!='\r' && *p!='\n') {
|
|
char b[16];
|
|
sprintf(b, "&#%d;", (unsigned)*p);
|
|
for(const char*q=b; *q; )
|
|
*o++ = *q++;
|
|
} else
|
|
*o++ = *p;
|
|
}
|
|
|
|
#ifdef XS_STRING_UTF8
|
|
return XS_String(buffer, o-buffer);
|
|
#else
|
|
return get_utf8(buffer, o-buffer);
|
|
#endif
|
|
} else { // l > BUFFER_LEN
|
|
// alternative code for larger strings using ostringstream
|
|
// and avoiding to use alloca() for preallocated memory
|
|
fast_ostringstream out;
|
|
|
|
LPCXSSTR s = str.c_str();
|
|
|
|
for(LPCXSSTR p=s; *p; ++p)
|
|
switch(*p) {
|
|
case '&':
|
|
out << "&";
|
|
break;
|
|
|
|
case '<':
|
|
out << "<";
|
|
break;
|
|
|
|
case '>':
|
|
out << ">";
|
|
break;
|
|
|
|
case '"':
|
|
out << """;
|
|
break;
|
|
|
|
case '\'':
|
|
out << "'";
|
|
break;
|
|
|
|
default:
|
|
if ((unsigned)*p<0x20 && *p!='\t' && *p!='\r' && *p!='\n')
|
|
out << "&#" << (unsigned)*p << ";";
|
|
else
|
|
out << *p;
|
|
}
|
|
|
|
#ifdef XS_STRING_UTF8
|
|
return XS_String(out.str());
|
|
#else
|
|
return get_utf8(out.str());
|
|
#endif
|
|
}
|
|
}
|
|
|
|
/// decode XML string literals
|
|
XS_String DecodeXMLString(const std::string& str)
|
|
{
|
|
#ifdef XS_STRING_UTF8
|
|
const XS_String& str_utf8 = str;
|
|
#else
|
|
XS_String str_utf8;
|
|
assign_utf8(str_utf8, str.c_str(), str.length());
|
|
#endif
|
|
|
|
LPCXSSTR s = str_utf8.c_str();
|
|
LPXSSTR buffer = (LPXSSTR)alloca(sizeof(XS_CHAR)*XS_len(s));
|
|
LPXSSTR o = buffer;
|
|
|
|
for(LPCXSSTR p=s; *p; ++p)
|
|
if (*p == '&') {
|
|
if (!XS_nicmp(p+1, XS_TEXT("lt;"), 3)) {
|
|
*o++ = '<';
|
|
p += 3;
|
|
} else if (!XS_nicmp(p+1, XS_TEXT("gt;"), 3)) {
|
|
*o++ = '>';
|
|
p += 3;
|
|
} else if (!XS_nicmp(p+1, XS_TEXT("amp;"), 4)) {
|
|
*o++ = '&';
|
|
p += 4;
|
|
} else if (!XS_nicmp(p+1, XS_TEXT("quot;"), 5)) {
|
|
*o++ = '"';
|
|
p += 5;
|
|
} else if (!XS_nicmp(p+1, XS_TEXT("apos;"), 5)) {
|
|
*o++ = '\'';
|
|
p += 5;
|
|
} else //@@ maybe decode "&#xx;" special characters
|
|
*o++ = *p;
|
|
} else if (*p=='<' && !XS_nicmp(p+1,XS_TEXT("![CDATA["),8)) {
|
|
LPCXSSTR e = XS_strstr(p+9, XS_TEXT(CDATA_END));
|
|
if (e) {
|
|
p += 9;
|
|
size_t l = e - p;
|
|
memcpy(o, p, l);
|
|
o += l;
|
|
p = e + 2;
|
|
} else
|
|
*o++ = *p;
|
|
} else
|
|
*o++ = *p;
|
|
|
|
return XS_String(buffer, o-buffer);
|
|
}
|
|
|
|
|
|
/// write node with children tree to output stream using original white space
|
|
void XMLNode::original_write_worker(std::ostream& out) const
|
|
{
|
|
out << _leading << '<' << EncodeXMLString(*this);
|
|
|
|
for(AttributeMap::const_iterator it=_attributes.begin(); it!=_attributes.end(); ++it)
|
|
out << ' ' << EncodeXMLString(it->first) << "=\"" << EncodeXMLString(it->second) << "\"";
|
|
|
|
if (!_children.empty() || !_content.empty()) {
|
|
out << '>';
|
|
|
|
if (_cdata_content)
|
|
out << CDATA_START << _content << CDATA_END;
|
|
else
|
|
out << _content;
|
|
|
|
for(Children::const_iterator it=_children.begin(); it!=_children.end(); ++it)
|
|
(*it)->original_write_worker(out);
|
|
|
|
out << _end_leading << "</" << EncodeXMLString(*this) << '>';
|
|
} else
|
|
out << "/>";
|
|
|
|
out << _trailing;
|
|
}
|
|
|
|
|
|
/// print node without any white space
|
|
void XMLNode::plain_write_worker(std::ostream& out) const
|
|
{
|
|
out << '<' << EncodeXMLString(*this);
|
|
|
|
for(AttributeMap::const_iterator it=_attributes.begin(); it!=_attributes.end(); ++it)
|
|
out << ' ' << EncodeXMLString(it->first) << "=\"" << EncodeXMLString(it->second) << "\"";
|
|
|
|
// strip leading white space from content
|
|
const char* content = _content.c_str();
|
|
while(isspace((unsigned char)*content)) ++content;
|
|
|
|
if (!_children.empty() || *content) {
|
|
out << ">" << content;
|
|
|
|
for(Children::const_iterator it=_children.begin(); it!=_children.end(); ++it)
|
|
(*it)->plain_write_worker(out);
|
|
|
|
out << "</" << EncodeXMLString(*this) << ">";
|
|
} else
|
|
out << "/>";
|
|
}
|
|
|
|
|
|
/// pretty print node with children tree to output stream
|
|
void XMLNode::pretty_write_worker(std::ostream& out, const XMLFormat& format, int indent) const
|
|
{
|
|
for(int i=indent; i--; )
|
|
out << XML_INDENT_SPACE;
|
|
|
|
out << '<' << EncodeXMLString(*this);
|
|
|
|
for(AttributeMap::const_iterator it=_attributes.begin(); it!=_attributes.end(); ++it)
|
|
out << ' ' << EncodeXMLString(it->first) << "=\"" << EncodeXMLString(it->second) << "\"";
|
|
|
|
// strip leading white space from content
|
|
const char* content = _content.c_str();
|
|
while(isspace((unsigned char)*content)) ++content;
|
|
|
|
if (!_children.empty() || *content) {
|
|
out << '>' << content;
|
|
|
|
if (!_children.empty())
|
|
out << format._endl;
|
|
|
|
for(Children::const_iterator it=_children.begin(); it!=_children.end(); ++it)
|
|
(*it)->pretty_write_worker(out, format, indent+1);
|
|
|
|
for(int i=indent; i--; )
|
|
out << XML_INDENT_SPACE;
|
|
|
|
out << "</" << EncodeXMLString(*this) << '>' << format._endl;
|
|
} else
|
|
out << "/>" << format._endl;
|
|
}
|
|
|
|
|
|
/// write node with children tree to output stream using smart formating
|
|
void XMLNode::smart_write_worker(std::ostream& out, const XMLFormat& format, int indent) const
|
|
{
|
|
// strip the first line feed from _leading
|
|
const char* leading = _leading.c_str();
|
|
if (*leading == '\n') ++leading;
|
|
|
|
if (!*leading)
|
|
for(int i=indent; i--; )
|
|
out << XML_INDENT_SPACE;
|
|
else
|
|
out << leading;
|
|
|
|
out << '<' << EncodeXMLString(*this);
|
|
|
|
for(AttributeMap::const_iterator it=_attributes.begin(); it!=_attributes.end(); ++it)
|
|
out << ' ' << EncodeXMLString(it->first) << "=\"" << EncodeXMLString(it->second) << "\"";
|
|
|
|
// strip leading white space from content
|
|
const char* content = _content.c_str();
|
|
while(isspace((unsigned char)*content)) ++content;
|
|
|
|
if (_children.empty() && !*content)
|
|
out << "/>";
|
|
else {
|
|
out << '>';
|
|
|
|
if (_cdata_content)
|
|
out << CDATA_START << _content << CDATA_END;
|
|
else if (!*content)
|
|
out << format._endl;
|
|
else
|
|
out << content;
|
|
|
|
Children::const_iterator it = _children.begin();
|
|
|
|
if (it != _children.end()) {
|
|
for(; it!=_children.end(); ++it)
|
|
(*it)->smart_write_worker(out, format, indent+1);
|
|
|
|
// strip the first line feed from _end_leading
|
|
const char* end_leading = _end_leading.c_str();
|
|
if (*end_leading == '\n') ++end_leading;
|
|
|
|
if (!*end_leading)
|
|
for(int i=indent; i--; )
|
|
out << XML_INDENT_SPACE;
|
|
else
|
|
out << end_leading;
|
|
} else
|
|
out << _end_leading;
|
|
|
|
out << "</" << EncodeXMLString(*this) << '>';
|
|
}
|
|
|
|
if (_trailing.empty())
|
|
out << format._endl;
|
|
else
|
|
out << _trailing;
|
|
}
|
|
|
|
|
|
std::ostream& operator<<(std::ostream& out, const XMLError& err)
|
|
{
|
|
out << err._systemId << "(" << err._line << ") [column " << err._column << "] : "
|
|
<< err._message;
|
|
|
|
return out;
|
|
}
|
|
|
|
|
|
const char* get_xmlsym_end_utf8(const char* p)
|
|
{
|
|
for(; *p; ++p) {
|
|
char c = *p;
|
|
|
|
// NameChar ::= Letter | Digit | '.' | '-' | '_' | ':' | CombiningChar | Extender
|
|
if (c == '\xC3') // UTF-8 escape character
|
|
++p; //TODO only continue on umlaut characters
|
|
else if (!isalnum(c) && c!='.' && c!='-' && c!='_' && c!=':')
|
|
break;
|
|
}
|
|
|
|
return p;
|
|
}
|
|
|
|
|
|
void DocType::parse(const char* p)
|
|
{
|
|
while(isspace((unsigned char)*p)) ++p;
|
|
|
|
const char* start = p;
|
|
p = get_xmlsym_end_utf8(p);
|
|
_name.assign(start, p-start);
|
|
|
|
while(isspace((unsigned char)*p)) ++p;
|
|
|
|
start = p;
|
|
p = get_xmlsym_end_utf8(p);
|
|
std::string keyword(p, p-start); // "PUBLIC" or "SYSTEM"
|
|
|
|
while(isspace((unsigned char)*p)) ++p;
|
|
|
|
if (*p=='"' || *p=='\'') {
|
|
char delim = *p;
|
|
|
|
start = ++p;
|
|
while(*p && *p!=delim) ++p;
|
|
|
|
if (*p == delim)
|
|
_public.assign(start, p++-start);
|
|
} else
|
|
_public.erase();
|
|
|
|
while(isspace((unsigned char)*p)) ++p;
|
|
|
|
if (*p=='"' || *p=='\'') {
|
|
char delim = *p;
|
|
|
|
start = ++p;
|
|
while(*p && *p!=delim) ++p;
|
|
|
|
if (*p == delim)
|
|
_system.assign(start, p++-start);
|
|
} else
|
|
_system.erase();
|
|
}
|
|
|
|
|
|
void XMLFormat::print_header(std::ostream& out, bool lf) const
|
|
{
|
|
out << "<?xml version=\"" << _version << "\" encoding=\"" << _encoding << "\"";
|
|
|
|
if (_standalone != -1)
|
|
out << " standalone=\"yes\"";
|
|
|
|
out << "?>";
|
|
|
|
if (lf)
|
|
out << _endl;
|
|
|
|
if (!_doctype.empty()) {
|
|
out << "<!DOCTYPE " << _doctype._name;
|
|
|
|
if (!_doctype._public.empty()) {
|
|
out << " PUBLIC \"" << _doctype._public << '"';
|
|
|
|
if (lf)
|
|
out << _endl;
|
|
|
|
out << " \"" << _doctype._system << '"';
|
|
} else if (!_doctype._system.empty())
|
|
out << " SYSTEM \"" << _doctype._system << '"';
|
|
|
|
out << "?>";
|
|
|
|
if (lf)
|
|
out << _endl;
|
|
}
|
|
|
|
for(StyleSheetList::const_iterator it=_stylesheets.begin(); it!=_stylesheets.end(); ++it) {
|
|
it->print(out);
|
|
|
|
if (lf)
|
|
out << _endl;
|
|
}
|
|
|
|
/* if (!_additional.empty()) {
|
|
out << _additional;
|
|
|
|
if (lf)
|
|
out << _endl;
|
|
} */
|
|
}
|
|
|
|
void StyleSheet::print(std::ostream& out) const
|
|
{
|
|
out << "<?xml-stylesheet"
|
|
" href=\"" << _href << "\""
|
|
" type=\"" << _type << "\"";
|
|
|
|
if (!_title.empty())
|
|
out << " title=\"" << _title << "\"";
|
|
|
|
if (!_media.empty())
|
|
out << " media=\"" << _media << "\"";
|
|
|
|
if (!_charset.empty())
|
|
out << " charset=\"" << _charset << "\"";
|
|
|
|
if (_alternate)
|
|
out << " alternate=\"yes\"";
|
|
|
|
out << "?>";
|
|
}
|
|
|
|
|
|
/// return formated error message
|
|
std::string XMLError::str() const
|
|
{
|
|
std::ostringstream out;
|
|
|
|
out << *this;
|
|
|
|
return out.str();
|
|
}
|
|
|
|
|
|
/// return merged error strings
|
|
XS_String XMLErrorList::str() const
|
|
{
|
|
std::ostringstream out;
|
|
|
|
for(const_iterator it=begin(); it!=end(); ++it)
|
|
out << *it << std::endl;
|
|
|
|
return out.str();
|
|
}
|
|
|
|
|
|
void XMLReaderBase::finish_read()
|
|
{
|
|
if (_pos->_children.empty())
|
|
_pos->_trailing.append(_content);
|
|
else
|
|
_pos->_children.back()->_trailing.append(_content);
|
|
|
|
_content.erase();
|
|
}
|
|
|
|
|
|
/// store XML version and encoding into XML reader
|
|
void XMLReaderBase::XmlDeclHandler(const char* version, const char* encoding, int standalone)
|
|
{
|
|
if (version)
|
|
_format._version = version;
|
|
|
|
if (encoding)
|
|
_format._encoding = encoding;
|
|
|
|
_format._standalone = standalone;
|
|
}
|
|
|
|
|
|
/// notifications about XML start tag
|
|
void XMLReaderBase::StartElementHandler(const XS_String& name, const XMLNode::AttributeMap& attributes)
|
|
{
|
|
const char* s = _content.c_str();
|
|
const char* e = s + _content.length();
|
|
const char* p = s;
|
|
|
|
// search for content end leaving only white space for leading
|
|
for(p=e; p>s; --p)
|
|
if (!isspace((unsigned char)p[-1]))
|
|
break;
|
|
|
|
if (p != s) {
|
|
if (_pos->_children.empty()) { // no children in last node?
|
|
if (_last_tag == TAG_START)
|
|
_pos->_content.append(s, p-s);
|
|
else if (_last_tag == TAG_END)
|
|
_pos->_trailing.append(s, p-s);
|
|
else // TAG_NONE at root node
|
|
p = s;
|
|
} else
|
|
_pos->_children.back()->_trailing.append(s, p-s);
|
|
}
|
|
|
|
std::string leading;
|
|
|
|
if (p != e)
|
|
leading.assign(p, e-p);
|
|
|
|
XMLNode* node = new XMLNode(name, leading);
|
|
|
|
_pos.add_down(node);
|
|
|
|
#ifdef XMLNODE_LOCATION
|
|
node->_location = get_location();
|
|
#endif
|
|
|
|
node->_attributes = attributes;
|
|
|
|
_last_tag = TAG_START;
|
|
_content.erase();
|
|
}
|
|
|
|
/// notifications about XML end tag
|
|
void XMLReaderBase::EndElementHandler()
|
|
{
|
|
const char* s = _content.c_str();
|
|
const char* e = s + _content.length();
|
|
const char* p;
|
|
|
|
if (!strncmp(s,CDATA_START,9) && !strncmp(e-3,CDATA_END,3)) {
|
|
s += 9;
|
|
p = (e-=3);
|
|
|
|
_pos->_cdata_content = true;
|
|
} else {
|
|
// search for content end leaving only white space for _end_leading
|
|
for(p=e; p>s; --p)
|
|
if (!isspace((unsigned char)p[-1]))
|
|
break;
|
|
|
|
_pos->_cdata_content = false;
|
|
}
|
|
|
|
if (p != s) {
|
|
if (_pos->_children.empty()) // no children in current node?
|
|
_pos->_content.append(s, p-s);
|
|
else if (_last_tag == TAG_START)
|
|
_pos->_content.append(s, p-s);
|
|
else
|
|
_pos->_children.back()->_trailing.append(s, p-s);
|
|
}
|
|
|
|
if (p != e)
|
|
_pos->_end_leading.assign(p, e-p);
|
|
|
|
_pos.back();
|
|
|
|
_last_tag = TAG_END;
|
|
_content.erase();
|
|
}
|
|
|
|
#if defined(XS_USE_XERCES) || defined(XS_USE_EXPAT)
|
|
/// store content, white space and comments
|
|
void XMLReaderBase::DefaultHandler(const XML_Char* s, int len)
|
|
{
|
|
#if defined(XML_UNICODE) || defined(XS_USE_XERCES)
|
|
_content.append(String_from_XML_Char(s, len));
|
|
#else
|
|
_content.append(s, len);
|
|
#endif
|
|
}
|
|
#endif
|
|
|
|
|
|
XS_String XMLWriter::s_empty_attr;
|
|
|
|
void XMLWriter::create(const XS_String& name)
|
|
{
|
|
if (!_stack.empty()) {
|
|
StackEntry& last = _stack.top();
|
|
|
|
if (last._state < PRE_CLOSED) {
|
|
write_attributes(last);
|
|
close_pre(last);
|
|
}
|
|
|
|
++last._children;
|
|
}
|
|
|
|
StackEntry entry;
|
|
entry._node_name = name;
|
|
_stack.push(entry);
|
|
|
|
write_pre(entry);
|
|
}
|
|
|
|
bool XMLWriter::back()
|
|
{
|
|
if (!_stack.empty()) {
|
|
write_post(_stack.top());
|
|
|
|
_stack.pop();
|
|
return true;
|
|
} else
|
|
return false;
|
|
}
|
|
|
|
void XMLWriter::close_pre(StackEntry& entry)
|
|
{
|
|
_out << '>';
|
|
|
|
entry._state = PRE_CLOSED;
|
|
}
|
|
|
|
void XMLWriter::write_pre(StackEntry& entry)
|
|
{
|
|
if (_format._pretty >= PRETTY_LINEFEED)
|
|
_out << _format._endl;
|
|
|
|
if (_format._pretty == PRETTY_INDENT) {
|
|
for(size_t i=_stack.size(); --i>0; )
|
|
_out << XML_INDENT_SPACE;
|
|
}
|
|
|
|
_out << '<' << EncodeXMLString(entry._node_name);
|
|
//entry._state = PRE;
|
|
}
|
|
|
|
void XMLWriter::write_attributes(StackEntry& entry)
|
|
{
|
|
for(AttrMap::const_iterator it=entry._attributes.begin(); it!=entry._attributes.end(); ++it)
|
|
_out << ' ' << EncodeXMLString(it->first) << "=\"" << EncodeXMLString(it->second) << "\"";
|
|
|
|
entry._state = ATTRIBUTES;
|
|
}
|
|
|
|
void XMLWriter::write_post(StackEntry& entry)
|
|
{
|
|
if (entry._state < ATTRIBUTES)
|
|
write_attributes(entry);
|
|
|
|
if (entry._children || !entry._content.empty()) {
|
|
if (entry._state < PRE_CLOSED)
|
|
close_pre(entry);
|
|
|
|
_out << entry._content;
|
|
//entry._state = CONTENT;
|
|
|
|
if (_format._pretty>=PRETTY_LINEFEED && entry._content.empty())
|
|
_out << _format._endl;
|
|
|
|
if (_format._pretty==PRETTY_INDENT && entry._content.empty()) {
|
|
for(size_t i=_stack.size(); --i>0; )
|
|
_out << XML_INDENT_SPACE;
|
|
}
|
|
|
|
_out << "</" << EncodeXMLString(entry._node_name) << ">";
|
|
} else {
|
|
_out << "/>";
|
|
}
|
|
|
|
entry._state = POST;
|
|
}
|
|
|
|
|
|
} // namespace XMLStorage
|