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
|
/*
* Baltisot
* Copyright (C) 1999-2008 Nicolas "Pixel" Noble
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "tinyxml.h"
#include <Handle.h>
#include <Buffer.h>
#include <BLua.h>
class LuaXML : public Base {
public:
static void ParseNode (lua_State *L,TiXmlNode* pNode) {
if (!pNode) return;
// resize stack if neccessary
luaL_checkstack(L, 5, "LuaXML_ParseNode : recursion too deep");
TiXmlElement* pElem = pNode->ToElement();
if (pElem) {
// element name
lua_pushstring(L,"name");
lua_pushstring(L,pElem->Value());
lua_settable(L,-3);
// parse attributes
TiXmlAttribute* pAttr = pElem->FirstAttribute();
if (pAttr) {
lua_pushstring(L,"attr");
lua_newtable(L);
for (;pAttr;pAttr = pAttr->Next()) {
lua_pushstring(L,pAttr->Name());
lua_pushstring(L,pAttr->Value());
lua_settable(L,-3);
}
lua_settable(L,-3);
}
}
// children
TiXmlNode *pChild = pNode->FirstChild();
if (pChild) {
int iChildCount = 0;
for(;pChild;pChild = pChild->NextSibling()) {
switch (pChild->Type()) {
case TiXmlNode::DOCUMENT: break;
case TiXmlNode::ELEMENT:
// normal element, parse recursive
lua_newtable(L);
ParseNode(L,pChild);
lua_rawseti(L,-2,++iChildCount);
break;
case TiXmlNode::COMMENT: break;
case TiXmlNode::TEXT:
// plaintext, push raw
lua_pushstring(L,pChild->Value());
lua_rawseti(L,-2,++iChildCount);
break;
case TiXmlNode::DECLARATION: break;
case TiXmlNode::UNKNOWN: break;
};
}
lua_pushstring(L,"n");
lua_pushnumber(L,iChildCount);
lua_settable(L,-3);
}
}
static int ParseFile (lua_State *L) {
const char* sFileName = luaL_checkstring(L,1);
TiXmlDocument doc(sFileName);
doc.LoadFile();
lua_newtable(L);
ParseNode(L,&doc);
return 1;
}
static int ParseString(lua_State *L) {
const char * xml_string = luaL_checkstring(L, 1);
TiXmlDocument doc;
doc.Parse(xml_string);
lua_newtable(L);
ParseNode(L, &doc);
return 1;
}
static int ParseHandle(lua_State *__L) {
Lua * L = Lua::find(__L);
Handle * h = L->recast<Handle>(1);
TiXmlDocument doc;
Buffer b(true);
b.copyfrom(h);
doc.Parse(reinterpret_cast<const char *>(b.GetBuffer()));
lua_newtable(__L);
ParseNode(__L, &doc);
return 1;
}
};
static const luaL_reg xmllib[] = {
{ "LoadString", LuaXML::ParseString },
{ "LoadHandle", LuaXML::ParseHandle },
{ NULL, NULL }
};
int luaopen_xml(Lua *L) {
L->openlib("xml", xmllib, 0);
return 1;
}
|
