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
197
198
199
200
201
202
203
204
205
|
/*
* Asterisk -- An open source telephony toolkit.
*
* Copyright (C) 2008, Eliel C. Sardanons (LU1ALY) <eliels@gmail.com>
*
* See http://www.asterisk.org for more information about
* the Asterisk project. Please do not directly contact
* any of the maintainers of this project for assistance;
* the project provides a web site, mailing lists and IRC
* channels for your use.
*
* This program is free software, distributed under the terms of
* the GNU General Public License Version 2. See the LICENSE file
* at the top of the source tree.
*/
/*! \file
*
* \brief XML abstraction layer
*
* \author Eliel C. Sardanons (LU1ALY) <eliels@gmail.com>
*/
#include "asterisk.h"
#include "asterisk/xml.h"
ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
#if defined(HAVE_LIBXML2)
#ifndef _POSIX_C_SOURCE /* Needed on Mac OS X */
#define _POSIX_C_SOURCE 200112L
#endif
#include <libxml/parser.h>
#include <libxml/tree.h>
#include <libxml/xinclude.h>
/* libxml2 ast_xml implementation. */
int ast_xml_init(void)
{
LIBXML_TEST_VERSION
return 0;
}
int ast_xml_finish(void)
{
xmlCleanupParser();
return 0;
}
struct ast_xml_doc *ast_xml_open(char *filename)
{
xmlDoc *doc;
if (!filename) {
return NULL;
}
doc = xmlReadFile(filename, NULL, XML_PARSE_RECOVER);
if (doc) {
/* process xinclude elements. */
if (xmlXIncludeProcess(doc) < 0) {
xmlFreeDoc(doc);
return NULL;
}
}
return (struct ast_xml_doc *) doc;
}
void ast_xml_close(struct ast_xml_doc *doc)
{
if (!doc) {
return;
}
xmlFreeDoc((xmlDoc *) doc);
doc = NULL;
}
struct ast_xml_node *ast_xml_get_root(struct ast_xml_doc *doc)
{
xmlNode *root_node;
if (!doc) {
return NULL;
}
root_node = xmlDocGetRootElement((xmlDoc *) doc);
return (struct ast_xml_node *) root_node;
}
void ast_xml_free_node(struct ast_xml_node *node)
{
if (!node) {
return;
}
xmlFreeNode((xmlNode *) node);
node = NULL;
}
void ast_xml_free_attr(const char *attribute)
{
if (attribute) {
xmlFree((char *) attribute);
}
}
void ast_xml_free_text(const char *text)
{
if (text) {
xmlFree((char *) text);
}
}
const char *ast_xml_get_attribute(struct ast_xml_node *node, const char *attrname)
{
xmlChar *attrvalue;
if (!node) {
return NULL;
}
if (!attrname) {
return NULL;
}
attrvalue = xmlGetProp((xmlNode *) node, (xmlChar *) attrname);
return (const char *) attrvalue;
}
struct ast_xml_node *ast_xml_find_element(struct ast_xml_node *root_node, const char *name, const char *attrname, const char *attrvalue)
{
struct ast_xml_node *cur;
const char *attr;
if (!root_node) {
return NULL;
}
for (cur = root_node; cur; cur = ast_xml_node_get_next(cur)) {
/* Check if the name matchs */
if (strcmp(ast_xml_node_get_name(cur), name)) {
continue;
}
/* We need to check for a specific attribute name? */
if (!attrname || !attrvalue) {
return cur;
}
/* Get the attribute, we need to compare it. */
if ((attr = ast_xml_get_attribute(cur, attrname))) {
/* does attribute name/value matches? */
if (!strcmp(attr, attrvalue)) {
ast_xml_free_attr(attr);
return cur;
}
ast_xml_free_attr(attr);
}
}
return NULL;
}
const char *ast_xml_get_text(struct ast_xml_node *node)
{
if (!node) {
return NULL;
}
return (const char *) xmlNodeGetContent((xmlNode *) node);
}
const char *ast_xml_node_get_name(struct ast_xml_node *node)
{
return (const char *) ((xmlNode *) node)->name;
}
struct ast_xml_node *ast_xml_node_get_children(struct ast_xml_node *node)
{
return (struct ast_xml_node *) ((xmlNode *) node)->children;
}
struct ast_xml_node *ast_xml_node_get_next(struct ast_xml_node *node)
{
return (struct ast_xml_node *) ((xmlNode *) node)->next;
}
struct ast_xml_node *ast_xml_node_get_prev(struct ast_xml_node *node)
{
return (struct ast_xml_node *) ((xmlNode *) node)->prev;
}
struct ast_xml_node *ast_xml_node_get_parent(struct ast_xml_node *node)
{
return (struct ast_xml_node *) ((xmlNode *) node)->parent;
}
#endif /* defined(HAVE_LIBXML2) */
|
