@@ -249,13 +249,13 @@ static inline bool is_space(char c) { return is(c, tag_space); }
249249/////////////////////////////////////////////////////////////////////
250250// PARSER COMBINATORS
251251
252−char static inline peekAt(document* d, int i) { return d->cursor[i]; }
253−void static inline skip(document* d, int i) { d->cursor += i; }
254−char static inline peek(document* d) { return peekAt(d, 0); }
255−char static inline get(document* d) { char c = peek(d); skip(d, 1); return c; }
252+static inline char peekAt(document* d, int i) { return d->cursor[i]; }
253+static inline void skip(document* d, int i) { d->cursor += i; }
254+static inline char peek(document* d) { return peekAt(d, 0); }
255+static inline char get(document* d) { char c = peek(d); skip(d, 1); return c; }
256256
257257// Remove whitespace characters from the cursor while they are still whitespace
258−void static inline trim(document* d)
258+static inline void trim(document* d)
259259{
260260 while (is_space(peek(d)))
261261 skip(d, 1);
@@ -281,7 +281,7 @@ bool find(document* d, char c)
281281/////////////////////////////////////////////////////////////////////
282282// PARSING CODE
283283
284−void static inline node_alloc(node_buffer* b, int ask)
284+static inline void node_alloc(node_buffer* b, int ask)
285285{
286286 int space = b->size - b->used_back - b->used_front;
287287 if (space >= ask) return;
@@ -296,7 +296,7 @@ void static inline node_alloc(node_buffer* b, int ask)
296296 b->alloc = buf2;
297297}
298298
299−void static inline attr_alloc(attr_buffer* b, int ask)
299+static inline void attr_alloc(attr_buffer* b, int ask)
300300{
301301 int space = b->size - b->used;
302302 if (space >= ask) return;