File: xml_tree.cpp

package info (click to toggle)
scummvm 2.9.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 450,580 kB
  • sloc: cpp: 4,299,825; asm: 28,322; python: 12,901; sh: 11,302; java: 9,289; xml: 7,895; perl: 2,639; ansic: 2,465; yacc: 1,670; javascript: 1,020; makefile: 933; lex: 578; awk: 275; objc: 82; sed: 11; php: 1
file content (196 lines) | stat: -rw-r--r-- 4,652 bytes parent folder | download | duplicates (2)
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
191
192
193
194
195
196
/* ScummVM - Graphic Adventure Engine
 *
 * ScummVM is the legal property of its developers, whose names
 * are too numerous to list here. Please refer to the COPYRIGHT
 * file distributed with this source distribution.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

#include "ultima/shared/conf/xml_tree.h"
#include "ultima/shared/conf/xml_node.h"
#include "common/algorithm.h"
#include "common/file.h"

namespace Ultima {
namespace Shared {

XMLTree::XMLTree() : _tree(nullptr), _isFile(false),
		_readOnly(false) {
}

XMLTree::XMLTree(const Common::Path &fname) : _tree(nullptr), _isFile(true),
	  _readOnly(false) {
	readConfigFile(fname);
}

XMLTree::XMLTree(Common::SeekableReadStream *stream)
		: _tree(nullptr), _isFile(true), _readOnly(false) {
	readConfigStream(stream);
}

XMLTree::~XMLTree() {
	delete _tree;
}

void XMLTree::clear() {
	delete _tree;
	_tree = nullptr;
	_isFile = false;
	_readOnly = false;
}

bool XMLTree::readConfigFile(const Common::Path &fname) {
	Common::File f;
	_filename = fname;

	if (!f.open(fname)) {
		warning("Error opening config file");
		return false;
	}

	bool result = readConfigStream(&f);

	f.close();

	_filename = fname;
	return result;
}

bool XMLTree::readConfigStream(Common::SeekableReadStream *stream) {
	// Read in the stream contents
	char *buf = new char[stream->size() + 1];
	stream->read(buf, stream->size());
	buf[stream->size()] = '\0';
	Common::String text(buf, buf + stream->size());

	if (!readConfigString(buf))
		return false;

	delete[] buf;
	_isFile = true;		// readConfigString sets _isFile = false
	return true;
}

bool XMLTree::readConfigString(const Common::String &s) {
	_tree = _tree->xmlParseDoc(this, s);

	_isFile = false;
	_filename.clear();

	return _tree != nullptr;
}

Common::String XMLTree::dump() {
	return _tree->dump();
}

void XMLTree::write() {
	if (!_isFile || _readOnly)
		return;

	Common::DumpFile df;

	if (df.open(_filename)) {
		Common::String content = dump();
		df.write(content.c_str(), content.size());
		df.close();
	}
}

const XMLNode *XMLTree::getNode(const Common::String &key) const {
	return _tree->subtree(key);
}

bool XMLTree::hasNode(const Common::String &key) const {
	const XMLNode *sub = _tree->subtree(key);
	if (sub)
		return true;
	else
		return false;
}

bool XMLTree::checkRoot(const Common::String &key) const {
	Common::String k = key.substr(0, key.find('/'));
	return _tree && k == _tree->id();
}

void XMLTree::value(const Common::String &key, Common::String &ret,
					const char *defaultvalue) const {
	const XMLNode *sub = _tree->subtree(key);
	if (sub) { 
		ret = sub->text();
		if (ret.empty())
			if (sub->firstChild())
				ret = sub->firstChild()->text();
	}	
	else
		ret = defaultvalue;
}

void XMLTree::value(const Common::String &key, int &ret,
					int defaultvalue) const {
	const XMLNode *sub = _tree->subtree(key);
	if (sub)
		ret = strtol(sub->text().c_str(), 0, 0);
	else
		ret = defaultvalue;
}

void XMLTree::value(const Common::String &key, bool &ret,
					bool defaultvalue) const {
	const XMLNode *sub = _tree->subtree(key);
	if (sub)
		ret = sub->text().equalsIgnoreCase("YES");
	else
		ret = defaultvalue;
}

void XMLTree::set(const Common::String &key, const Common::String &value) {
	_tree->xmlAssign(key, value);
}

void XMLTree::set(const Common::String &key, const char *value) {
	_tree->xmlAssign(key, value);
}

void XMLTree::set(const Common::String &key, int value) {
	char buf[32];
	snprintf(buf, 32, "%d", value);
	set(key, buf);
}

void XMLTree::set(const Common::String &key, bool value) {
	if (value)
		set(key, "yes");
	else
		set(key, "no");
}

Common::Array<Common::String> XMLTree::listKeys(const Common::String &key, bool longformat) {
	Common::Array<Common::String> keys;
	const XMLNode *sub = _tree->subtree(key);
	if (sub)
		sub->listKeys(key, keys, longformat);

	return keys;
}

void XMLTree::getSubkeys(KeyTypeList &ktl, const Common::String &basekey) {
	_tree->searchPairs(ktl, basekey, Common::String(), 0);
}

} // End of namespace Shared
} // End of namespace Ultima