1 /* Licensed under GPL - see LICENSE file for details */
\r
12 #define XML_LETTER 1
\r
13 #define XML_NUMBER 2
\r
17 #define XML_EQUALS 32
\r
18 #define XML_CLOSE 64
\r
19 #define XML_QUOTE 128
\r
20 #define XML_OTHER 256
\r
22 #define XML_ALL 0xFFFFFFFF
\r
25 typedef struct XMLBUF
\r
35 /* Allocate a new XmlNode */
\r
36 XmlNode* xml_new(char * name)
\r
38 XmlNode * ret = malloc(sizeof(XmlNode));
\r
39 if(!ret)return NULL;
\r
43 ret->child = ret->next = NULL;
\r
49 /* free a previously allocated XmlNode */
\r
50 void xml_free(XmlNode *target)
\r
53 for(i=0; i<target->nattrib*2; i++)
\r
54 if(target->attrib[i])
\r
55 free(target->attrib[i]);
\r
57 if(target->attrib)free(target->attrib);
\r
58 if(target->child)xml_free(target->child);
\r
59 if(target->next)xml_free(target->next);
\r
64 /* Raise flags if we have a character of special meaning.
\r
65 * This is where I've hidden the switch statements :-p
\r
67 int is_special(char item)
\r
69 if((item >= 'a' && item <= 'z') || (item >= 'A' && item <='Z'))
\r
71 if( item >= '0' && item <='9' )
\r
73 if( item == 0x20 || item == '\t' || item == 0x0D || item == 0x0A )
\r
83 if( item == '"' || item == '\'' )
\r
88 /* Refresh the buffer, if possible */
\r
89 static void xml_read_file(XMLBUF *xml)
\r
95 size = fread( xml->buf, 1, xml->len, xml->fptr);
\r
96 if( size != xml->len )
\r
98 printf("Buffer reduction\n");
\r
106 /* All reading of the XML buffer done through these two functions */
\r
107 /*** read a byte without advancing the offset */
\r
108 static char xml_peek(XMLBUF *xml)
\r
110 return xml->buf[xml->read_index];
\r
113 /*** read a byte and advance the offset */
\r
114 static char xml_read_byte(XMLBUF *xml)
\r
116 char ret = xml_peek(xml);
\r
118 if(xml->read_index >= xml->len)
\r
122 xml->read_index = xml->len;
\r
125 xml->read_index = 0 ;
\r
126 xml_read_file(xml);
\r
132 /* skip over bytes matching the is_special mask */
\r
133 static void xml_skip( XMLBUF *xml, int mask)
\r
135 while( is_special(xml_peek(xml)) & mask && !(xml->eof && xml->read_index >= xml->len) )
\r
136 xml_read_byte(xml);
\r
140 /* character matching tests for the feed functions */
\r
141 static char quotechar = 0;
\r
142 static int test_quote(const char x)
\r
144 static int escaped=0;
\r
145 if( escaped || '\\' == x )
\r
147 escaped = !escaped;
\r
150 if( x != quotechar )
\r
155 static int feed_mask = 0;
\r
156 static int test_mask(const char x)
\r
158 return !(is_special(x) & feed_mask);
\r
162 * char* xml_feed(x, test)
\r
164 * Reads as many contiguous chars that pass test() into a newly allocated
\r
167 * Instead of calling xml_read_byte and flogging realloc() for each byte,
\r
168 * it checks the buffer itself.
\r
170 static char* xml_feed( XMLBUF *xml, int (*test)(char) )
\r
172 int offset = xml->read_index;
\r
177 /* perform first and N middle realloc()'s */
\r
178 while( test(xml->buf[offset]) )
\r
182 if(offset >= xml->len)
\r
184 delta = offset - xml->read_index;
\r
185 ret = realloc(ret, size + delta + 1);
\r
186 memcpy(ret+size, xml->buf + xml->read_index, delta);
\r
189 if(xml->eof)return ret;
\r
190 xml_read_file(xml);
\r
191 xml->read_index = 0;
\r
195 /* perform final realloc() if needed */
\r
196 if(offset > xml->read_index)
\r
198 delta = offset - xml->read_index;
\r
199 ret = realloc(ret, size + delta + 1);
\r
200 memcpy(ret+size, xml->buf + xml->read_index, delta);
\r
201 xml->read_index = offset;
\r
208 /* this reads attributes from tags, of the form...
\r
210 * <tag attr1="some arguments" attr2=argument>
\r
212 * It is aware of quotes, and will allow anything inside quoted arguments
\r
214 static void xml_read_attr(struct XMLBUF *xml, XmlNode *node)
\r
218 // how does this tag finish?
\r
221 if( is_special(xml_peek(xml)) & (XML_CLOSE | XML_SLASH) )
\r
224 n = ++node->nattrib;
\r
225 node->attrib = realloc(node->attrib, n * 2 * sizeof(char*) );
\r
226 node->attrib[--n*2+1] = 0;
\r
228 feed_mask = XML_EQUALS | XML_SPACE | XML_CLOSE | XML_SLASH;
\r
229 node->attrib[n*2] = xml_feed(xml, test_mask );
\r
230 if( xml_peek(xml) == '=' )
\r
232 xml_read_byte(xml);
\r
233 if( is_special(xml_peek(xml)) & XML_QUOTE )
\r
235 quotechar = xml_read_byte(xml);
\r
236 node->attrib[n*2+1] = xml_feed(xml, test_quote);
\r
237 xml_read_byte(xml);
\r
241 feed_mask = XML_SPACE | XML_CLOSE | XML_SLASH;
\r
242 node->attrib[n*2+1] = xml_feed(xml, test_mask);
\r
245 xml_skip(xml, XML_SPACE);
\r
249 /* The big decision maker, is it a regular node, or a text node.
\r
250 * If it's a node, it will check if it should have children, and if so
\r
251 * will recurse over them.
\r
252 * Text nodes don't have children, so no recursing.
\r
254 static XmlNode* xml_parse(struct XMLBUF *xml)
\r
259 XmlNode **this, *ret = NULL;
\r
263 xml_skip(xml, XML_SPACE); // skip whitespace
\r
265 while( (xml->read_index < xml->len) || !xml->eof )
\r
267 switch(is_special(xml_peek(xml)))
\r
270 xml_read_byte(xml);
\r
271 if(xml_peek(xml) == '/')
\r
272 return ret; // parents close tag
\r
273 // read the tag name
\r
274 feed_mask = XML_SPACE | XML_SLASH | XML_CLOSE;
\r
275 *this = xml_new( xml_feed(xml, test_mask));
\r
276 xml_skip(xml, XML_SPACE); // skip any whitespace
\r
278 xml_read_attr(xml, *this); // read attributes
\r
280 // how does this tag finish?
\r
281 switch(is_special(xml_peek(xml)))
\r
283 case XML_CLOSE: // child-nodes ahead
\r
284 xml_read_byte(xml);
\r
285 (*this)->child = xml_parse(xml);
\r
286 xml_skip(xml, XML_ALL ^ XML_CLOSE);
\r
287 xml_read_byte(xml);
\r
289 case XML_SLASH: // self closing tag
\r
290 xml_read_byte(xml);
\r
291 xml_read_byte(xml);
\r
296 default: // text node
\r
297 *this = xml_new(0);
\r
298 xml_skip(xml, XML_SPACE); // skip any whitespace
\r
299 feed_mask = XML_OPEN;
\r
300 (*this)->nattrib=1;
\r
301 (*this)->attrib = malloc(sizeof(char*)*2);
\r
302 (*this)->attrib[1] = NULL;
\r
303 tmp = (*this)->attrib[0] = xml_feed(xml, test_mask);
\r
305 /* trim the whitespace off the end of text nodes,
\r
306 * by overwriting the spaces will null termination. */
\r
307 toff = strlen(tmp)-1;
\r
308 while( ( is_special(tmp[toff]) & XML_SPACE ) )
\r
316 this = &(*this)->next;
\r
317 xml_skip(xml, XML_SPACE); // skip whitespace
\r
324 /* bootstrap the structures for xml_parse() to be able to get started */
\r
325 XmlNode* xml_load(const char * filename)
\r
328 XmlNode *ret = NULL;
\r
330 // printf("xml_load(\"%s\");\n", filename);
\r
333 xml.read_index = 0;
\r
334 xml.fptr = fopen(filename, "rb");
\r
337 printf("Opening file failed\n");
\r
341 xml.buf = malloc(BUFFER+1);
\r
345 goto xml_load_fail_malloc_buf;
\r
347 xml_read_file(&xml);
\r
349 ret = xml_parse(&xml);
\r
352 xml_load_fail_malloc_buf:
\r
357 /* very basic function that will get you the first node with a given name */
\r
358 XmlNode * xml_find(XmlNode *xml, const char *name)
\r
361 if(xml->name)if(!strcmp(xml->name, name))return xml;
\r
364 ret = xml_find(xml->child, name);
\r
369 ret = xml_find(xml->next, name);
\r
375 /* very basic attribute lookup function */
\r
376 char* xml_attr(XmlNode *x, const char *name)
\r
379 for(i=0; i<x->nattrib; i++)
\r
381 if(!strcmp(x->attrib[i*2], name))
\r
382 return x->attrib[i*2+1];
\r
388 /* print out the heirarchy of an XML file, useful for debugging */
\r
389 void xp(XmlNode *x, int level, int max)
\r
392 char text[] = "text";
\r
394 if(level > max)return;
\r
396 if(x->name)name = x->name;
\r
397 for(i=0; i<level; i++)printf(" ");
\r
398 printf("%s:", name);
\r
400 for(i=0; i<x->nattrib; i++)
\r
401 printf("%s=\"%s\",", x->attrib[i*2], x->attrib[i*2+1]);
\r
402 else printf("%s", x->attrib[0]);
\r
404 if(x->child)xp(x->child, level+1, max);
\r
405 if(x->next)xp(x->next, level, max);
\r
409 int main(int argc, char *argv[])
\r
415 printf("USAGE: %s name\n\t reads name where name is an XML file.\n",
\r
421 for(int i=0; i<1000; i++)
\r
424 x = xml_load(argv[1]);
\r
428 printf("Failed to load.\n");
\r