2 * Asterisk -- An open source telephony toolkit.
4 * Copyright (C) 2008, Eliel C. Sardanons (LU1ALY) <eliels@gmail.com>
6 * See http://www.asterisk.org for more information about
7 * the Asterisk project. Please do not directly contact
8 * any of the maintainers of this project for assistance;
9 * the project provides a web site, mailing lists and IRC
10 * channels for your use.
12 * This program is free software, distributed under the terms of
13 * the GNU General Public License Version 2. See the LICENSE file
14 * at the top of the source tree.
19 * \brief XML abstraction layer
21 * \author Eliel C. Sardanons (LU1ALY) <eliels@gmail.com>
25 #include "asterisk/xml.h"
26 #include "asterisk/logger.h"
28 ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
30 #if defined(HAVE_LIBXML2)
31 #include <libxml/parser.h>
32 #include <libxml/tree.h>
33 #include <libxml/xinclude.h>
34 /* libxml2 ast_xml implementation. */
37 int ast_xml_init(void)
44 int ast_xml_finish(void)
51 struct ast_xml_doc *ast_xml_open(char *filename)
59 doc = xmlReadFile(filename, NULL, XML_PARSE_RECOVER);
61 /* process xinclude elements. */
62 if (xmlXIncludeProcess(doc) < 0) {
68 return (struct ast_xml_doc *) doc;
71 struct ast_xml_doc *ast_xml_new(void)
75 doc = xmlNewDoc((const xmlChar *) "1.0");
76 return (struct ast_xml_doc *) doc;
79 struct ast_xml_node *ast_xml_new_node(const char *name)
86 node = xmlNewNode(NULL, (const xmlChar *) name);
88 return (struct ast_xml_node *) node;
91 struct ast_xml_node *ast_xml_new_child(struct ast_xml_node *parent, const char *child_name)
95 if (!parent || !child_name) {
99 child = xmlNewChild((xmlNode *) parent, NULL, (const xmlChar *) child_name, NULL);
100 return (struct ast_xml_node *) child;
103 struct ast_xml_node *ast_xml_add_child(struct ast_xml_node *parent, struct ast_xml_node *child)
105 if (!parent || !child) {
108 return (struct ast_xml_node *) xmlAddChild((xmlNode *) parent, (xmlNode *) child);
111 struct ast_xml_doc *ast_xml_read_memory(char *buffer, size_t size)
119 if (!(doc = xmlParseMemory(buffer, (int) size))) {
120 /* process xinclude elements. */
121 if (xmlXIncludeProcess(doc) < 0) {
127 return (struct ast_xml_doc *) doc;
130 void ast_xml_close(struct ast_xml_doc *doc)
136 xmlFreeDoc((xmlDoc *) doc);
140 void ast_xml_set_root(struct ast_xml_doc *doc, struct ast_xml_node *node)
146 xmlDocSetRootElement((xmlDoc *) doc, (xmlNode *) node);
149 struct ast_xml_node *ast_xml_get_root(struct ast_xml_doc *doc)
157 root_node = xmlDocGetRootElement((xmlDoc *) doc);
159 return (struct ast_xml_node *) root_node;
162 void ast_xml_free_node(struct ast_xml_node *node)
168 xmlFreeNode((xmlNode *) node);
172 void ast_xml_free_attr(const char *attribute)
175 xmlFree((char *) attribute);
179 void ast_xml_free_text(const char *text)
182 xmlFree((char *) text);
186 const char *ast_xml_get_attribute(struct ast_xml_node *node, const char *attrname)
198 attrvalue = xmlGetProp((xmlNode *) node, (xmlChar *) attrname);
200 return (const char *) attrvalue;
203 int ast_xml_set_attribute(struct ast_xml_node *node, const char *name, const char *value)
205 if (!name || !value) {
209 if (!xmlSetProp((xmlNode *) node, (xmlChar *) name, (xmlChar *) value)) {
216 struct ast_xml_node *ast_xml_find_element(struct ast_xml_node *root_node, const char *name, const char *attrname, const char *attrvalue)
218 struct ast_xml_node *cur;
225 for (cur = root_node; cur; cur = ast_xml_node_get_next(cur)) {
226 /* Check if the name matchs */
227 if (strcmp(ast_xml_node_get_name(cur), name)) {
230 /* We need to check for a specific attribute name? */
231 if (!attrname || !attrvalue) {
234 /* Get the attribute, we need to compare it. */
235 if ((attr = ast_xml_get_attribute(cur, attrname))) {
236 /* does attribute name/value matches? */
237 if (!strcmp(attr, attrvalue)) {
238 ast_xml_free_attr(attr);
241 ast_xml_free_attr(attr);
248 struct ast_xml_doc *ast_xml_get_doc(struct ast_xml_node *node)
254 return (struct ast_xml_doc *) ((xmlNode *)node)->doc;
257 struct ast_xml_ns *ast_xml_find_namespace(struct ast_xml_doc *doc, struct ast_xml_node *node, const char *ns_name) {
258 xmlNsPtr ns = xmlSearchNs((xmlDocPtr) doc, (xmlNodePtr) node, (xmlChar *) ns_name);
259 return (struct ast_xml_ns *) ns;
262 const char *ast_xml_get_ns_href(struct ast_xml_ns *ns)
264 return (const char *) ((xmlNsPtr) ns)->href;
267 const char *ast_xml_get_text(struct ast_xml_node *node)
273 return (const char *) xmlNodeGetContent((xmlNode *) node);
276 void ast_xml_set_text(struct ast_xml_node *node, const char *content)
278 if (!node || !content) {
282 xmlNodeSetContent((xmlNode *) node, (const xmlChar *) content);
285 int ast_xml_doc_dump_file(FILE *output, struct ast_xml_doc *doc)
287 return xmlDocDump(output, (xmlDocPtr)doc);
290 const char *ast_xml_node_get_name(struct ast_xml_node *node)
292 return (const char *) ((xmlNode *) node)->name;
295 struct ast_xml_node *ast_xml_node_get_children(struct ast_xml_node *node)
297 return (struct ast_xml_node *) ((xmlNode *) node)->children;
300 struct ast_xml_node *ast_xml_node_get_next(struct ast_xml_node *node)
302 return (struct ast_xml_node *) ((xmlNode *) node)->next;
305 struct ast_xml_node *ast_xml_node_get_prev(struct ast_xml_node *node)
307 return (struct ast_xml_node *) ((xmlNode *) node)->prev;
310 struct ast_xml_node *ast_xml_node_get_parent(struct ast_xml_node *node)
312 return (struct ast_xml_node *) ((xmlNode *) node)->parent;
315 #endif /* defined(HAVE_LIBXML2) */