@@ -1,5 +1,5 @@
1#include "hexml.h"
1#include "hexml.h"
2−#include <malloc.h>
2+#include <stdlib.h>
3#include <string.h>
3#include <string.h>
4#include <assert.h>
4#include <assert.h>
5#include <ctype.h>
5#include <ctype.h>
@@ -10,18 +10,18 @@ typedef int bool;
10/////////////////////////////////////////////////////////////////////
10/////////////////////////////////////////////////////////////////////
13−int static inline end(str s) { return s.start + s.length; }
13+static inline int end(str s) { return s.start + s.length; }
15−str static inline start_length(int32_t start, int32_t length)
15+static inline str start_length(int32_t start, int32_t length)
17− if (start < 0 || length < 0) assert(0);
17+ assert(start >= 0 && length >= 0);
19 res.start = start;
19 res.start = start;
20 res.length = length;
20 res.length = length;
21 return res;
21 return res;
24−str static inline start_end(int32_t start, int32_t end)
24+static inline str start_end(int32_t start, int32_t end)
26 return start_length(start, end - start);
26 return start_length(start, end - start);
@@ -34,23 +34,13 @@ typedef struct
34 attr* alloc; // what to call free on
34 attr* alloc; // what to call free on
35} attr_buffer;
35} attr_buffer;
40− str name; // tag name, e.g. <[foo]>
41− str outer; // outer text, [<foo>bar</foo>]
42− str inner; // inner text, <foo>[bar]</foo>
43− str attrs; // all the attributes, in the attribute buffer
44− str nodes; // all the nodes, in the node buffer
47typedef struct
37typedef struct
49 // have a cursor at the front, which is all the stuff I have written out, final
39 // have a cursor at the front, which is all the stuff I have written out, final
50 // have a cursor at the end, which is stack scoped, so children write out, then I do
40 // have a cursor at the end, which is stack scoped, so children write out, then I do
51 // when you commit, you copy over from end to front
41 // when you commit, you copy over from end to front
53− // nodes
43+ // nodes
55 int used_front; // front entries, stored for good
45 int used_front; // front entries, stored for good
56 int used_back; // back entries, stack based, copied into front
46 int used_back; // back entries, stack based, copied into front
@@ -61,11 +51,11 @@ typedef struct
62struct document
52struct document
64− char* body; // pointer to initial argument, not owned by us
54+ const char* body; // pointer to initial argument, not owned by us
66 // things only used while parsing
56 // things only used while parsing
67− char* cursor; // pointer to where we are in body
57+ const char* cursor; // pointer to where we are in body
68− char* end; // pointer to one past the last char
58+ const char* end; // pointer to one past the last char
69 // if cursor is > end we have gone past the end
59 // if cursor is > end we have gone past the end
71 char* error_message;
61 char* error_message;
@@ -73,8 +63,8 @@ struct document
73 attr_buffer attrs;
63 attr_buffer attrs;
76−int static inline doc_length(document* d) { return d->end - d->body; }
66+static inline int doc_length(const document* d) { return (int) (d->end - d->body); }
77−int static inline doc_position(document* d) { return d->cursor - d->body; }
67+static inline int doc_position(const document* d) { return (int) (d->cursor - d->body); }
80/////////////////////////////////////////////////////////////////////
70/////////////////////////////////////////////////////////////////////
@@ -82,51 +72,45 @@ int static inline doc_position(document* d) { return d->cursor - d->body; }
83typedef struct
73typedef struct
85− document* d;
75+ const document* d;
86 char* buffer;
76 char* buffer;
87 int length;
77 int length;
88 int cursor;
78 int cursor;
91−void static inline render_char(render* r, char c)
81+static inline void render_char(render* r, char c)
93 if (r->cursor < r->length)
83 if (r->cursor < r->length)
94 r->buffer[r->cursor] = c;
84 r->buffer[r->cursor] = c;
95 r->cursor++;
85 r->cursor++;
98−void static inline bound(char* msg, int index, int mn, int mx)
88+static inline void bound(int idx, int mn, int mx)
100− if (index < mn || index > mx)
102− printf("Bounds checking failed %s, got %i, which should be in %i:%i\n", msg, index, mn, mx);
103− assert(0);
90+ assert(idx >= mn && idx <= mx);
107−void static inline bound_str(char* msg, str s, int mn, int mx)
93+static inline void bound_str(str s, int mn, int mx)
109− if (s.length < 0) assert(0);
95+ assert(s.length >= 0);
110− bound(msg, s.start, mn, mx);
96+ bound(s.start, mn, mx);
111− bound(msg, end(s), mn, mx);
97+ bound(end(s), mn, mx);
114−void render_str(render* r, str s)
100+static void render_str(render* r, str s)
116− bound_str("render_str", s, 0, doc_length(r->d));
102+ bound_str(s, 0, doc_length(r->d));
117− render_char(r, '[');
118 for (int i = 0; i < s.length; i++)
103 for (int i = 0; i < s.length; i++)
119 render_char(r, r->d->body[s.start + i]);
104 render_char(r, r->d->body[s.start + i]);
120− render_char(r, ']');
123−void render_tag(render* r, node* n);
107+static void render_tag(render* r, const node* n);
125−void render_content(render* r, node* n)
109+static void render_content(render* r, const node* n)
127− bound_str("render_conent inner", n->inner, 0, doc_length(r->d));
111+ bound_str(n->inner, 0, doc_length(r->d));
128− bound_str("render_conent nodes", n->nodes, 0, r->d->nodes.used_front);
112+ bound_str(n->nodes, 0, r->d->nodes.used_front);
129− bound_str("render_conent attrs", n->attrs, 0, r->d->attrs.used);
113+ bound_str(n->attrs, 0, r->d->attrs.used);
131 int done = n->inner.start;
115 int done = n->inner.start;
132 for (int i = 0; i < n->nodes.length; i++)
116 for (int i = 0; i < n->nodes.length; i++)
@@ -139,7 +123,7 @@ void render_content(render* r, node* n)
139 render_str(r, start_end(done, end(n->inner)));
123 render_str(r, start_end(done, end(n->inner)));
142−void render_tag(render* r, node* n)
126+static void render_tag(render* r, const node* n)
144 render_char(r, '<');
128 render_char(r, '<');
145 render_str(r, n->name);
129 render_str(r, n->name);
@@ -161,14 +145,18 @@ void render_tag(render* r, node* n)
161 render_char(r, '>');
145 render_char(r, '>');
164−int document_render(document* d, char* buffer, int length)
148+int hexml_node_render(const document* d, const node* n, char* buffer, int length)
166 render r;
150 render r;
168 r.buffer = buffer;
152 r.buffer = buffer;
169 r.length = length;
153 r.length = length;
170 r.cursor = 0;
154 r.cursor = 0;
155+ // The root node (and only the root node) has an empty length, so just render its innards
156+ if (n->name.length == 0)
171− render_content(&r, document_node(d));
157+ render_content(&r, n);
172 return r.cursor;
160 return r.cursor;
@@ -176,12 +164,10 @@ int document_render(document* d, char* buffer, int length)
176/////////////////////////////////////////////////////////////////////
164/////////////////////////////////////////////////////////////////////
177// NOT THE PARSER
165// NOT THE PARSER
179−char* document_error(document* d){return d->error_message;}
167+char* hexml_document_error(const document* d){return d->error_message;}
180−node* document_node(document* d){return &d->nodes.nodes[0];}
168+node* hexml_document_node(const document* d){return &d->nodes.nodes[0];}
181−str node_inner(node* n){return n->inner;}
182−str node_outer(node* n){return n->outer;}
184−void document_free(document* d)
170+void hexml_document_free(document* d)
186 free(d->error_message);
172 free(d->error_message);
187 free(d->nodes.alloc);
173 free(d->nodes.alloc);
@@ -189,93 +175,94 @@ void document_free(document* d)
192−node* node_children(document* d, node* n, int* res)
178+node* hexml_node_children(const document* d, const node* n, int* res)
194 *res = n->nodes.length;
180 *res = n->nodes.length;
195 return &d->nodes.nodes[n->nodes.start];
181 return &d->nodes.nodes[n->nodes.start];
198−attr* node_attributes(document* d, node* n, int* res)
184+attr* hexml_node_attributes(const document* d, const node* n, int* res)
200 *res = n->attrs.length;
186 *res = n->attrs.length;
201 return &d->attrs.attrs[n->attrs.start];
187 return &d->attrs.attrs[n->attrs.start];
205−attr* node_attributeBy(document* d, node* n, char* s, int slen)
191+attr* hexml_node_attribute(const document* d, const node* n, const char* s, int slen)
207− assert(0);
193+ if (slen == -1) slen = (int) strlen(s);
194+ const int limit = end(n->attrs);
195+ for (int i = n->attrs.start; i < limit; i++)
197+ attr* r = &d->attrs.attrs[i];
198+ if (r->name.length == slen && memcmp(s, &d->body[r->name.start], slen) == 0)
208 return NULL;
201 return NULL;
211// Search for given strings within a node
204// Search for given strings within a node
212−node* node_firstChildBy(document* d, node* n, char* s, int slen)
205+node* hexml_node_child(const document* d, const node* parent, const node* prev, const char* s, int slen)
214− if (slen == -1) slen = strlen(s);
207+ if (slen == -1) slen = (int) strlen(s);
215− int i = n->nodes.start;
208+ int i = prev == NULL ? parent->nodes.start : (int) (prev + 1 - d->nodes.nodes);
216− int limit = i + n->nodes.length;
209+ const int limit = end(parent->nodes);
217 for (; i < limit; i++)
210 for (; i < limit; i++)
219− if (d->nodes.nodes[i].name.length == slen &&
212+ node* r = &d->nodes.nodes[i];
220− memcmp(s, &d->body[d->nodes.nodes[i].name.start], slen) == 0)
213+ if (r->name.length == slen && memcmp(s, &d->body[r->name.start], slen) == 0)
221− return &d->nodes.nodes[i];
214+ return r;
223 return NULL;
216 return NULL;
226−node* node_nextChildBy(document* d, node* parent, node* prev, char* s, int slen)
233/////////////////////////////////////////////////////////////////////
220/////////////////////////////////////////////////////////////////////
234// PARSE TABLE
221// PARSE TABLE
236−const char tag_name1 = 0x1;
223+static const char tag_name1 = 0x1;
237−const char tag_name = 0x2;
224+static const char tag_name = 0x2;
238−const char tag_space = 0x4;
225+static const char tag_space = 0x4;
240−char parse_table[256];
227+static char parse_table[256];
242−void init_parse_table()
229+static void init_parse_table()
244 static bool done = 0;
231 static bool done = 0;
245 if (done) return;
232 if (done) return;
246 for (int i = 0; i < 256; i++)
233 for (int i = 0; i < 256; i++)
248 bool name1 = i == ':' || i == '_' || (i >= 'a' && i <= 'z') || (i >= 'A' && i <= 'Z');
235 bool name1 = i == ':' || i == '_' || (i >= 'a' && i <= 'z') || (i >= 'A' && i <= 'Z');
249− bool name = name1 || i == '-' || (i >= '0' && i <= '9');
236+ bool name = name1 || i == '-' || i == '.' || (i >= '0' && i <= '9');
250 bool space = i == ' ' || i == '\t' || i == '\r' || i == '\n';
237 bool space = i == ' ' || i == '\t' || i == '\r' || i == '\n';
251 parse_table[i] = (name1 ? tag_name1 : 0) | (name ? tag_name : 0) | (space ? tag_space : 0);
238 parse_table[i] = (name1 ? tag_name1 : 0) | (name ? tag_name : 0) | (space ? tag_space : 0);
253 done = 1;
240 done = 1;
256−bool static inline is(char c, char tag) { return parse_table[c] & tag; }
243+static inline bool is(char c, char tag) { return parse_table[(unsigned char) c] & tag; }
257−bool static inline is_name1(char c) { return is(c, tag_name1); }
244+static inline bool is_name1(char c) { return is(c, tag_name1); }
258−bool static inline is_name(char c) { return is(c, tag_name); }
245+static inline bool is_name(char c) { return is(c, tag_name); }
259−bool static inline is_space(char c) { return is(c, tag_space); }
246+static inline bool is_space(char c) { return is(c, tag_space); }
262/////////////////////////////////////////////////////////////////////
249/////////////////////////////////////////////////////////////////////
263// PARSER COMBINATORS
250// PARSER COMBINATORS
265−char static inline peekAt(document* d, int i) { return d->cursor[i]; }
252+static inline char peek_at(const document* d, int i) { return d->cursor[i]; }
253+static inline char peek(const document* d) { return peek_at(d, 0); }
266−void static inline skip(document* d, int i) { d->cursor += i; }
254+static inline void skip(document* d, int i) { d->cursor += i; }
267−char static inline peek(document* d) { return peekAt(d, 0); }
268−char static inline get(document* d) { char c = peek(d); skip(d, 1); return c; }
255+static inline char get(document* d) { char c = peek(d); skip(d, 1); return c; }
270// Remove whitespace characters from the cursor while they are still whitespace
257// Remove whitespace characters from the cursor while they are still whitespace
271−void static inline trim(document* d)
258+static inline void trim(document* d)
273 while (is_space(peek(d)))
260 while (is_space(peek(d)))
274 skip(d, 1);
261 skip(d, 1);
277// Find this character form the cursor onwards, if true adjust the cursor to that char, otherwise leave it at the end
264// Find this character form the cursor onwards, if true adjust the cursor to that char, otherwise leave it at the end
278−bool find(document* d, char c)
265+static bool find(document* d, char c)
280 char* x = memchr(d->cursor, c, d->end - d->cursor);
267 char* x = memchr(d->cursor, c, d->end - d->cursor);
281 if (x == NULL)
268 if (x == NULL)
@@ -294,30 +281,47 @@ bool find(document* d, char c)
294/////////////////////////////////////////////////////////////////////
281/////////////////////////////////////////////////////////////////////
295// PARSING CODE
282// PARSING CODE
297−void static inline node_alloc(node_buffer* b, int ask)
284+static inline void node_alloc(node_buffer* b, int ask)
299 int space = b->size - b->used_back - b->used_front;
286 int space = b->size - b->used_back - b->used_front;
300 if (space >= ask) return;
287 if (space >= ask) return;
288+ int size2 = (b->size + 1000 + ask) * 2;
289+ node* buf2 = malloc(size2 * sizeof(node));
301− assert(0);
290+ assert(buf2);
291+ memcpy(buf2, b->nodes, b->used_front * sizeof(node));
292+ memcpy(&buf2[size2 - b->used_back], &b->nodes[b->size - b->used_back], b->used_back * sizeof(node));
304−void static inline attr_alloc(attr_buffer* b, int ask)
299+static inline void attr_alloc(attr_buffer* b, int ask)
306 int space = b->size - b->used;
301 int space = b->size - b->used;
307 if (space >= ask) return;
302 if (space >= ask) return;
308 int size2 = (b->size + 1000 + ask) * 2;
303 int size2 = (b->size + 1000 + ask) * 2;
309 attr* buf2 = malloc(size2 * sizeof(attr));
304 attr* buf2 = malloc(size2 * sizeof(attr));
310 memcpy(buf2, b->attrs, b->used * sizeof(attr));
306 memcpy(buf2, b->attrs, b->used * sizeof(attr));
311 free(b->alloc);
307 free(b->alloc);
312 b->attrs = buf2;
309 b->attrs = buf2;
313 b->alloc = buf2;
310 b->alloc = buf2;
313+static void set_error(document* d, const char* msg)
315+ if (d->error_message != NULL) return; // keep the first error message
316+ d->error_message = malloc(strlen(msg)+1);
317+ assert(d->error_message);
318+ strcpy(d->error_message, msg);
316// you now expect a name, perhaps preceeded by whitespace
321// you now expect a name, perhaps preceeded by whitespace
317// the name may be empty
322// the name may be empty
318−str static inline parse_name(document* d)
323+static inline str parse_name(document* d)
321 int start = doc_position(d);
325 int start = doc_position(d);
322 if (!is_name1(peek(d)))
326 if (!is_name1(peek(d)))
323 return start_length(start, 0);
327 return start_length(start, 0);
@@ -327,10 +331,14 @@ str static inline parse_name(document* d)
327 return start_end(start, doc_position(d));
331 return start_end(start, doc_position(d));
330−str static inline parse_attrval(document* d)
334+static inline str parse_attrval(document* d)
339+ set_error(d, "Expected = in attribute, but missing");
333− if (peek(d) != '=') return start_length(0,0);
340+ return start_length(0, 0);
334 skip(d, 1);
342 skip(d, 1);
336 char c = peek(d);
344 char c = peek(d);
@@ -340,26 +348,29 @@ str static inline parse_attrval(document* d)
340 int start = doc_position(d);
348 int start = doc_position(d);
341 if (!find(d, c))
349 if (!find(d, c))
343− d->error_message = _strdup("Couldn't find closing attribute bit");
351+ set_error(d, "Couldn't find closing attribute bit");
344 return start_length(0, 0);
352 return start_length(0, 0);
346 skip(d, 1);
354 skip(d, 1);
347 return start_end(start, doc_position(d) - 1);
355 return start_end(start, doc_position(d) - 1);
350− return parse_name(d);
358+ {
359+ set_error(d, "Invalid attribute");
360+ return start_length(0, 0);
355// seen a tag name, now looking for attributes terminated by >
366// seen a tag name, now looking for attributes terminated by >
356// puts the attributes it finds in the attribute buffer
367// puts the attributes it finds in the attribute buffer
357−str static inline parse_attributes(document* d)
368+static inline str parse_attributes(document* d)
360− res.start = d->attrs.used;
370+ int start = d->attrs.used;
361− for (int i = 0; ; i++)
371+ while (d->error_message == NULL)
363 str name = parse_name(d);
374 str name = parse_name(d);
364 if (name.length == 0) break;
375 if (name.length == 0) break;
365 attr_alloc(&d->attrs, 1);
376 attr_alloc(&d->attrs, 1);
@@ -367,70 +378,80 @@ str static inline parse_attributes(document* d)
367 d->attrs.attrs[d->attrs.used].value = parse_attrval(d);
378 d->attrs.attrs[d->attrs.used].value = parse_attrval(d);
368 d->attrs.used++;
379 d->attrs.used++;
370− res.length = d->attrs.used - res.start;
381+ return start_end(start, d->attrs.used);
374−str parse_content(document* d);
384+static str parse_content(document* d);
377// Add a new entry into tag, am at a '<'
387// Add a new entry into tag, am at a '<'
378−void static inline parse_tag(document* d)
388+static inline void parse_tag(document* d)
380 node_alloc(&d->nodes, 1);
390 node_alloc(&d->nodes, 1);
381 d->nodes.used_back++;
391 d->nodes.used_back++;
382− int me = d->nodes.size - d->nodes.used_back;
392+ node* me = &d->nodes.nodes[d->nodes.size - d->nodes.used_back];
384− d->nodes.nodes[me].outer.start = doc_position(d);
394+ me->outer.start = doc_position(d);
385 char c = get(d);
395 char c = get(d);
386 assert(c == '<');
396 assert(c == '<');
387 if (peek(d) == '?') skip(d, 1);
397 if (peek(d) == '?') skip(d, 1);
388− d->nodes.nodes[me].name = parse_name(d);
398+ me->name = parse_name(d);
399+ if (me->name.length == 0)
401+ set_error(d, "Missing tag name");
389− d->nodes.nodes[me].attrs = parse_attributes(d);
404+ me->attrs = parse_attributes(d);
405+ if (d->error_message != NULL) return;
391− c = get(d);
407+ c = peek(d);
392− if ((c == '/' || c == '?') && peek(d) == '>')
408+ if ((c == '/' || c == '?') && peek_at(d, 1) == '>')
394− skip(d, 1);
410+ skip(d, 2);
395− d->nodes.nodes[me].nodes = start_length(0, 0);
411+ me->nodes = start_length(0, 0);
396− d->nodes.nodes[me].outer.length = start_end(d->nodes.nodes[me].outer.start, doc_position(d)).length;
412+ me->outer.length = start_end(me->outer.start, doc_position(d)).length;
397− d->nodes.nodes[me].inner = start_length(doc_position(d), 0);
413+ me->inner = start_length(doc_position(d), 0);
400 else if (c != '>')
416 else if (c != '>')
402− d->error_message = _strdup("Gunk at the end of the tag");
418+ set_error(d, "Gunk at the end of the tag");
405− d->nodes.nodes[me].inner.start = doc_position(d);
423+ me->inner.start = doc_position(d);
406− d->nodes.nodes[me].nodes = parse_content(d);
424+ str content = parse_content(d);
426+ // parse_content may have allocated more nodes, so recompute me
427+ me = &d->nodes.nodes[d->nodes.size - d->nodes.used_back];
428+ me->nodes = content;
407− d->nodes.nodes[me].inner.length = start_end(d->nodes.nodes[me].inner.start, doc_position(d)).length;
429+ me->inner.length = start_end(me->inner.start, doc_position(d)).length;
409 if (d->error_message != NULL) return;
431 if (d->error_message != NULL) return;
410− if (peek(d) == '<' && peekAt(d, 1) == '/')
432+ if (peek(d) == '<' && peek_at(d, 1) == '/')
412 skip(d, 2);
434 skip(d, 2);
414− if (d->end - d->cursor >= d->nodes.nodes[me].name.length &&
435+ if (d->end - d->cursor >= me->name.length &&
415− memcmp(d->cursor, &d->body[d->nodes.nodes[me].name.start], d->nodes.nodes[me].name.length) == 0)
436+ memcmp(d->cursor, &d->body[me->name.start], me->name.length) == 0)
417− skip(d, d->nodes.nodes[me].name.length);
438+ skip(d, me->name.length);
419 if (get(d) == '>')
440 if (get(d) == '>')
421− d->nodes.nodes[me].outer.length = start_end(d->nodes.nodes[me].outer.start, doc_position(d)).length;
442+ me->outer.length = start_end(me->outer.start, doc_position(d)).length;
425− d->error_message = _strdup("Mismatch in closing tags");
446+ set_error(d, "Mismatch in closing tags");
428− d->error_message = _strdup("Weirdness when trying to close tags");
449+ set_error(d, "Weirdness when trying to close tags");
431// Parser until </, return the index of your node children
452// Parser until </, return the index of your node children
432// Not inline as it is recursive
453// Not inline as it is recursive
433−str parse_content(document* d)
454+static str parse_content(document* d)
435 int before = d->nodes.used_back;
456 int before = d->nodes.used_back;
436 while (d->error_message == NULL)
457 while (d->error_message == NULL)
@@ -440,11 +461,33 @@ str parse_content(document* d)
443− if (peekAt(d, 1) == '/')
464+ else if (peek_at(d, 1) == '/')
445 // have found a </
466 // have found a </
469+ else if (peek_at(d, 1) == '!' && peek_at(d, 2) == '-' && peek_at(d, 3) == '-')
472+ // you can't reuse the two '-' characters for the closing as well
473+ if (peek_at(d, 0) == '\0' || peek_at(d, 1) == '\0')
475+ set_error(d, "Didn't get a closing comment");
476+ return start_end(0, 0);
483+ set_error(d, "Didn't get a closing comment");
484+ return start_end(0, 0);
487+ if (peek_at(d, -3) == '-' && peek_at(d, -2) == '-')
450 parse_tag(d);
493 parse_tag(d);
@@ -460,20 +503,23 @@ str parse_content(document* d)
460 return res;
503 return res;
506+// Based on looking at ~50Kb XML documents, they seem to have ~700 attributes
507+// and ~300 nodes, so size appropriately to cope with that.
463typedef struct
508typedef struct
465 document document;
510 document document;
466 attr attrs[1000];
511 attr attrs[1000];
467− node nodes[1000];
512+ node nodes[500];
470−document* document_parse(char* s, int slen)
515+document* hexml_document_parse(const char* s, int slen)
472− if (slen == -1) slen = strlen(s);
517+ if (slen == -1) slen = (int) strlen(s);
473 assert(s[slen] == 0);
518 assert(s[slen] == 0);
474 init_parse_table();
519 init_parse_table();
476 buffer* buf = malloc(sizeof(buffer));
521 buffer* buf = malloc(sizeof(buffer));
477 document* d = &buf->document;
523 document* d = &buf->document;
478 d->body = s;
524 d->body = s;
479 d->cursor = s;
525 d->cursor = s;
@@ -483,7 +529,7 @@ document* document_parse(char* s, int slen)
483 d->attrs.used = 0;
529 d->attrs.used = 0;
484 d->attrs.attrs = buf->attrs;
530 d->attrs.attrs = buf->attrs;
485 d->attrs.alloc = NULL;
531 d->attrs.alloc = NULL;
486− d->nodes.size = 1000;
532+ d->nodes.size = 500;
487 d->nodes.used_back = 0;
533 d->nodes.used_back = 0;
488 d->nodes.used_front = 1;
534 d->nodes.used_front = 1;
489 d->nodes.nodes = buf->nodes;
535 d->nodes.nodes = buf->nodes;
@@ -493,11 +539,13 @@ document* document_parse(char* s, int slen)
493 d->nodes.nodes[0].outer = start_length(0, slen);
539 d->nodes.nodes[0].outer = start_length(0, slen);
494 d->nodes.nodes[0].inner = start_length(0, slen);
540 d->nodes.nodes[0].inner = start_length(0, slen);
495 d->nodes.nodes[0].attrs = start_length(0, 0);
541 d->nodes.nodes[0].attrs = start_length(0, 0);
496− d->nodes.nodes[0].nodes = parse_content(d);
543+ // Introduce an intermediate result, otherwise behaviour is undefined
544+ // because there is no guaranteed ordering between LHS and RHS evaluation
545+ str content = parse_content(d);
546+ d->nodes.nodes[0].nodes = content;
498− if (d->cursor < d->end && d->error_message == NULL)
548+ if (d->cursor < d->end)
500− d->error_message = _strdup("Trailing junk at the end of the document");
549+ set_error(d, "Trailing junk at the end of the document");
502 return d;
550 return d;