1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
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
102
103
104
105
106
107
108
109
110
111
112
113
114
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
142
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/*
* libjingle
* Copyright 2004--2005, Google Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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 "talk/base/stl_decl.h"
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include "talk/xmllite/xmlelement.h"
#include "talk/xmllite/xmlprinter.h"
#include "talk/xmllite/xmlnsstack.h"
#include "talk/xmllite/xmlconstants.h"
namespace buzz {
class XmlPrinterImpl {
public:
XmlPrinterImpl(std::ostream * pout,
const std::string * const xmlns, int xmlnsCount);
void PrintElement(const XmlElement * element);
void PrintQuotedValue(const std::string & text);
void PrintBodyText(const std::string & text);
private:
std::ostream *pout_;
XmlnsStack xmlnsStack_;
};
void
XmlPrinter::PrintXml(std::ostream * pout, const XmlElement * element) {
PrintXml(pout, element, NULL, 0);
}
void
XmlPrinter::PrintXml(std::ostream * pout, const XmlElement * element,
const std::string * const xmlns, int xmlnsCount) {
XmlPrinterImpl printer(pout, xmlns, xmlnsCount);
printer.PrintElement(element);
}
XmlPrinterImpl::XmlPrinterImpl(std::ostream * pout,
const std::string * const xmlns, int xmlnsCount) :
pout_(pout),
xmlnsStack_() {
int i;
for (i = 0; i < xmlnsCount; i += 2) {
xmlnsStack_.AddXmlns(xmlns[i], xmlns[i + 1]);
}
}
void
XmlPrinterImpl::PrintElement(const XmlElement * element) {
xmlnsStack_.PushFrame();
// first go through attrs of pel to add xmlns definitions
const XmlAttr * pattr;
for (pattr = element->FirstAttr(); pattr; pattr = pattr->NextAttr()) {
if (pattr->Name() == TQN_XMLNS)
xmlnsStack_.AddXmlns(STR_EMPTY, pattr->Value());
else if (pattr->Name().Namespace() == NS_XMLNS)
xmlnsStack_.AddXmlns(pattr->Name().LocalPart(),
pattr->Value());
}
// then go through qnames to make sure needed xmlns definitons are added
std::vector<std::string> newXmlns;
std::pair<std::string, bool> prefix;
prefix = xmlnsStack_.AddNewPrefix(element->Name().Namespace(), false);
if (prefix.second) {
newXmlns.push_back(prefix.first);
newXmlns.push_back(element->Name().Namespace());
}
for (pattr = element->FirstAttr(); pattr; pattr = pattr->NextAttr()) {
prefix = xmlnsStack_.AddNewPrefix(pattr->Name().Namespace(), true);
if (prefix.second) {
newXmlns.push_back(prefix.first);
newXmlns.push_back(element->Name().Namespace());
}
}
// print the element name
*pout_ << '<' << xmlnsStack_.FormatTQName(element->Name(), false);
// and the attributes
for (pattr = element->FirstAttr(); pattr; pattr = pattr->NextAttr()) {
*pout_ << ' ' << xmlnsStack_.FormatTQName(pattr->Name(), true) << "=\"";
PrintQuotedValue(pattr->Value());
*pout_ << '"';
}
// and the extra xmlns declarations
std::vector<std::string>::iterator i(newXmlns.begin());
while (i < newXmlns.end()) {
if (*i == STR_EMPTY)
*pout_ << " xmlns=\"" << *(i + 1) << '"';
else
*pout_ << " xmlns:" << *i << "=\"" << *(i + 1) << '"';
i += 2;
}
// now the children
const XmlChild * pchild = element->FirstChild();
if (pchild == NULL)
*pout_ << "/>";
else {
*pout_ << '>';
while (pchild) {
if (pchild->IsText())
PrintBodyText(pchild->AsText()->Text());
else
PrintElement(pchild->AsElement());
pchild = pchild->NextChild();
}
*pout_ << "</" << xmlnsStack_.FormatTQName(element->Name(), false) << '>';
}
xmlnsStack_.PopFrame();
}
void
XmlPrinterImpl::PrintQuotedValue(const std::string & text) {
size_t safe = 0;
for (;;) {
size_t unsafe = text.find_first_of("<>&\"", safe);
if (unsafe == std::string::npos)
unsafe = text.length();
*pout_ << text.substr(safe, unsafe - safe);
if (unsafe == text.length())
return;
switch (text[unsafe]) {
case '<': *pout_ << "<"; break;
case '>': *pout_ << ">"; break;
case '&': *pout_ << "&"; break;
case '"': *pout_ << """; break;
}
safe = unsafe + 1;
if (safe == text.length())
return;
}
}
void
XmlPrinterImpl::PrintBodyText(const std::string & text) {
size_t safe = 0;
for (;;) {
size_t unsafe = text.find_first_of("<>&", safe);
if (unsafe == std::string::npos)
unsafe = text.length();
*pout_ << text.substr(safe, unsafe - safe);
if (unsafe == text.length())
return;
switch (text[unsafe]) {
case '<': *pout_ << "<"; break;
case '>': *pout_ << ">"; break;
case '&': *pout_ << "&"; break;
}
safe = unsafe + 1;
if (safe == text.length())
return;
}
}
}
|
