@@ -97,16 +97,16 @@ static inline void bound_str(str s, int mn, int mx)
97 bound(end(s), mn, mx);
97 bound(end(s), mn, mx);
100−void render_str(render* r, str s)
100+static void render_str(render* r, str s)
102 bound_str(s, 0, doc_length(r->d));
102 bound_str(s, 0, doc_length(r->d));
103 for (int i = 0; i < s.length; i++)
103 for (int i = 0; i < s.length; i++)
104 render_char(r, r->d->body[s.start + i]);
104 render_char(r, r->d->body[s.start + i]);
107−void render_tag(render* r, const node* n);
107+static void render_tag(render* r, const node* n);
109−void render_content(render* r, const node* n)
109+static void render_content(render* r, const node* n)
111 bound_str(n->inner, 0, doc_length(r->d));
111 bound_str(n->inner, 0, doc_length(r->d));
112 bound_str(n->nodes, 0, r->d->nodes.used_front);
112 bound_str(n->nodes, 0, r->d->nodes.used_front);
@@ -123,7 +123,7 @@ void render_content(render* r, const node* n)
123 render_str(r, start_end(done, end(n->inner)));
123 render_str(r, start_end(done, end(n->inner)));
126−void render_tag(render* r, const node* n)
126+static void render_tag(render* r, const node* n)
128 render_char(r, '<');
128 render_char(r, '<');
129 render_str(r, n->name);
129 render_str(r, n->name);
@@ -145,7 +145,7 @@ void render_tag(render* r, const node* n)
145 render_char(r, '>');
145 render_char(r, '>');
148−int node_render(const document* d, const node* n, char* buffer, int length)
148+int hexml_node_render(const document* d, const node* n, char* buffer, int length)
150 render r;
150 render r;
@@ -164,10 +164,10 @@ int node_render(const document* d, const node* n, char* buffer, int length)
164/////////////////////////////////////////////////////////////////////
164/////////////////////////////////////////////////////////////////////
165// NOT THE PARSER
165// NOT THE PARSER
167−char* document_error(const document* d){return d->error_message;}
167+char* hexml_document_error(const document* d){return d->error_message;}
168−node* document_node(const document* d){return &d->nodes.nodes[0];}
168+node* hexml_document_node(const document* d){return &d->nodes.nodes[0];}
170−void document_free(document* d)
170+void hexml_document_free(document* d)
172 free(d->error_message);
172 free(d->error_message);
173 free(d->nodes.alloc);
173 free(d->nodes.alloc);
@@ -175,20 +175,20 @@ void document_free(document* d)
178−node* node_children(const document* d, const node* n, int* res)
178+node* hexml_node_children(const document* d, const node* n, int* res)
180 *res = n->nodes.length;
180 *res = n->nodes.length;
181 return &d->nodes.nodes[n->nodes.start];
181 return &d->nodes.nodes[n->nodes.start];
184−attr* node_attributes(const document* d, const node* n, int* res)
184+attr* hexml_node_attributes(const document* d, const node* n, int* res)
186 *res = n->attrs.length;
186 *res = n->attrs.length;
187 return &d->attrs.attrs[n->attrs.start];
187 return &d->attrs.attrs[n->attrs.start];
191−attr* node_attributeBy(const document* d, const node* n, const char* s, int slen)
191+attr* hexml_node_attributeBy(const document* d, const node* n, const char* s, int slen)
193 if (slen == -1) slen = (int) strlen(s);
193 if (slen == -1) slen = (int) strlen(s);
194 const int limit = end(n->attrs);
194 const int limit = end(n->attrs);
@@ -202,7 +202,7 @@ attr* node_attributeBy(const document* d, const node* n, const char* s, int slen
204// Search for given strings within a node
204// Search for given strings within a node
205−node* node_childBy(const document* d, const node* parent, const node* prev, const char* s, int slen)
205+node* hexml_node_childBy(const document* d, const node* parent, const node* prev, const char* s, int slen)
207 if (slen == -1) slen = (int) strlen(s);
207 if (slen == -1) slen = (int) strlen(s);
208 int i = prev == NULL ? parent->nodes.start : (int) (prev + 1 - d->nodes.nodes);
208 int i = prev == NULL ? parent->nodes.start : (int) (prev + 1 - d->nodes.nodes);
@@ -220,13 +220,13 @@ node* node_childBy(const document* d, const node* parent, const node* prev, cons
220/////////////////////////////////////////////////////////////////////
220/////////////////////////////////////////////////////////////////////
221// PARSE TABLE
221// PARSE TABLE
223−const char tag_name1 = 0x1;
223+static const char tag_name1 = 0x1;
224−const char tag_name = 0x2;
224+static const char tag_name = 0x2;
225−const char tag_space = 0x4;
225+static const char tag_space = 0x4;
227−char parse_table[256];
227+static char parse_table[256];
229−void init_parse_table()
229+static void init_parse_table()
231 static bool done = 0;
231 static bool done = 0;
232 if (done) return;
232 if (done) return;
@@ -262,7 +262,7 @@ static inline void trim(document* d)
264// 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
265−bool find(document* d, char c)
265+static bool find(document* d, char c)
267 char* x = memchr(d->cursor, c, d->end - d->cursor);
267 char* x = memchr(d->cursor, c, d->end - d->cursor);
268 if (x == NULL)
268 if (x == NULL)
@@ -310,7 +310,7 @@ static inline void attr_alloc(attr_buffer* b, int ask)
310 b->alloc = buf2;
310 b->alloc = buf2;
313−void set_error(document* d, const char* msg)
313+static void set_error(document* d, const char* msg)
315 if (d->error_message != NULL) return; // keep the first error message
315 if (d->error_message != NULL) return; // keep the first error message
316 d->error_message = malloc(strlen(msg)+1);
316 d->error_message = malloc(strlen(msg)+1);
@@ -381,7 +381,7 @@ static inline str parse_attributes(document* d)
381 return start_end(start, d->attrs.used);
381 return start_end(start, d->attrs.used);
384−str parse_content(document* d);
384+static str parse_content(document* d);
387// Add a new entry into tag, am at a '<'
387// Add a new entry into tag, am at a '<'
@@ -451,7 +451,7 @@ static inline void parse_tag(document* d)
452// Parser until </, return the index of your node children
452// Parser until </, return the index of your node children
453// Not inline as it is recursive
453// Not inline as it is recursive
454−str parse_content(document* d)
454+static str parse_content(document* d)
456 int before = d->nodes.used_back;
456 int before = d->nodes.used_back;
457 while (d->error_message == NULL)
457 while (d->error_message == NULL)
@@ -512,7 +512,7 @@ typedef struct
512 node nodes[500];
512 node nodes[500];
515−document* document_parse(const char* s, int slen)
515+document* hexml_document_parse(const char* s, int slen)
517 if (slen == -1) slen = (int) strlen(s);
517 if (slen == -1) slen = (int) strlen(s);
518 assert(s[slen] == 0);
518 assert(s[slen] == 0);