/* Copyright (c) MediaArea.net SARL Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. (MIT License) */ #include "tfsxml.h" #ifndef NULL #ifdef __cplusplus #define NULL 0 #else #define NULL ((void *)0) #endif #endif #if !defined(inline) #define inline #endif /* * priv flags : * 0: is inside an element header * 1: previous element is open (potentially with sub elements) */ /* * attribute / value flags : * 0: must be decoded */ static inline void set_flag(tfsxml_string* priv, int offset) { priv->flags |= (1 << offset); } static inline int get_flag(tfsxml_string* priv, int offset) { return priv->flags & (1 << offset); } static inline void unset_flag(tfsxml_string* priv, int offset) { priv->flags &= ~(1 << offset); } #define set_is_in_element_header() set_flag(priv, 0) #define get_is_in_element_header() get_flag(priv, 0) #define unset_is_in_element_header() unset_flag(priv, 0) #define set_previous_element_is_open() set_flag(priv, 1) #define get_previous_element_is_open() get_flag(priv, 1) #define unset_previous_element_is_open() unset_flag(priv, 1) #define set_must_be_decoded() set_flag(v, 0) static inline void set_level(tfsxml_string* priv, int level) { const int offset = (sizeof(priv->flags) - 1) * 8; priv->flags <<= 8; priv->flags >>= 8; priv->flags |= level << offset; } static inline void get_level(tfsxml_string* priv, unsigned* level) { const int offset = (sizeof(priv->flags) - 1) * 8; *level = priv->flags >> offset; } static inline void next_char(tfsxml_string* priv) { priv->buf++; priv->len--; } static int tfsxml_leave_element_header(tfsxml_string* priv) { /* Skip attributes */ tfsxml_string n, v; for (;;) { int result = tfsxml_attr(priv, &n, &v); switch (result) { case -1: { return 0; } case 1: { return 1; } default: { } } } } int tfsxml_strcmp_charp(tfsxml_string a, const char* b) { /* Compare char per char and return the difference if chars are no equal */ for (; a.len && *b; a.buf++, a.len--, b++) { int c = *a.buf - *b; if (c) return c; } if (!a.len && !*b) return 0; /* All equal */ else if (*b) return -*b; /* b is longer than a */ else return *a.buf; /* a is longer than b */ } int tfsxml_strncmp_charp(tfsxml_string a, const char* b, unsigned n) { tfsxml_string a2 = a; if (a2.len > n) a2.len = n; return tfsxml_strcmp_charp(a2, b); } tfsxml_string tfsxml_strstr_charp(tfsxml_string a, const char* b) { /* Iterate string to be scanned */ for (; a.len; a.buf++, a.len--) { const char* buf = a.buf; int len = a.len; const char* bb = b; /* Compare char per char */ for (; len && *bb; buf++, len--, bb++) { char c = *buf - *bb; if (c) break; } if (!len || *bb) { return a; } } a.buf = NULL; a.len = 0; return a; } int tfsxml_init(tfsxml_string* priv, const void* buf, unsigned len, unsigned version) { const char* buf_8 = (const char*)buf; if (version != 0) { return -1; } /* BOM detection */ if (len > 3 && (unsigned char)buf_8[0] == 0xEF && (unsigned char)buf_8[1] == 0xBB && (unsigned char)buf_8[2] == 0xBF) { buf_8 += 3; len -= 3; } /* Start detection */ if (len < 1 || buf_8[0] != '<') { return -1; } /* Init */ priv->buf = (const char*)buf; priv->len = len; priv->flags = 0; return 0; } int tfsxml_next(tfsxml_string* priv, tfsxml_string* n) { tfsxml_string priv_bak; unsigned level; get_level(priv, &level); /* Exiting previous element header analysis if needed */ if (!level && get_is_in_element_header()) { int result = tfsxml_leave_element_header(priv); if (result) { return result; } } /* Leaving previous element content if needed */ if (level || get_previous_element_is_open()) { if (!level && get_previous_element_is_open()) { level++; } level--; set_level(priv, level); int result = tfsxml_leave(priv); if (result) { return result; } get_level(priv, &level); } priv_bak = *priv; while (priv->len) { switch (*priv->buf) { case '<': { if (priv->len == 1) { *priv = priv_bak; set_level(priv, level); return 1; } if (priv->buf[1] == '/') { while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } if (!level) { next_char(priv); unset_previous_element_is_open(); set_level(priv, level); return -1; } level--; break; } if (priv->buf[1] == '?') { next_char(priv); n->buf = priv->buf; while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } n->len = priv->buf - n->buf; next_char(priv); unset_previous_element_is_open(); set_level(priv, 0); return 0; } if (priv->buf[1] == '!') { unsigned long long probe = 0; int i; if (priv->len <= 8) { *priv = priv_bak; set_level(priv, level); return 1; } for (i = 2; i <= 8; i++) { probe <<= 8; probe |= priv->buf[i]; } if (probe == 0x5B43444154415BULL) { /* "buf += 9; priv->len -= 9; while (priv->len) { probe &= 0xFFFF; probe <<= 8; probe |= *priv->buf; if (probe == 0x5D5D3EULL) { /* "]]>" */ break; } next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } break; } if ((probe >> 40) == 0x2D2D) { /* "" */ break; next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } n->len = priv->buf - n->buf; next_char(priv); unset_previous_element_is_open(); set_level(priv, 0); return 0; } while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } n->buf = priv_bak.buf; n->len = priv->buf - n->buf; next_char(priv); unset_previous_element_is_open(); set_level(priv, 0); return 0; } if (!level) { next_char(priv); n->buf = priv->buf; for (;;) { if (!priv->len) { *priv = priv_bak; set_level(priv, level); return 1; } switch (*priv->buf) { case '\n': case '\t': case '\r': case ' ': case '/': case '>': n->len = priv->buf - n->buf; set_is_in_element_header(); set_previous_element_is_open(); set_level(priv, 0); return 0; default: { } } next_char(priv); } } level++; break; } default: { } } next_char(priv); } set_level(priv, level); return 1; } int tfsxml_attr(tfsxml_string* priv, tfsxml_string* n, tfsxml_string* v) { if (!get_is_in_element_header()) { return -1; } v->flags = 0; tfsxml_string priv_bak = *priv; while (priv->len) { switch (*priv->buf) { case '/': { unset_previous_element_is_open(); //fall through } case '\n': case '\t': case '\r': case ' ': { break; } case '>': { next_char(priv); unset_is_in_element_header(); return -1; } default: { if (!get_previous_element_is_open()) { break; // Junk after "/", ignoring } /* Attribute */ n->buf = priv->buf; while (priv->len && *priv->buf != '=') { next_char(priv); } if (!priv->len) { *priv = priv_bak; return 1; } n->len = priv->buf - n->buf; next_char(priv); /* Value */ const char quote = *priv->buf; if (!priv->len) { *priv = priv_bak; return 1; } next_char(priv); v->buf = priv->buf; while (priv->len && *priv->buf != quote) { if (*priv->buf == '&') { set_flag(v, 0); } next_char(priv); } v->len = priv->buf - v->buf; if (!priv->len) { *priv = priv_bak; return 1; } next_char(priv); return 0; } } next_char(priv); } *priv = priv_bak; return 1; } int tfsxml_value(tfsxml_string* priv, tfsxml_string* v) { tfsxml_string priv_bak; unsigned len_sav; /* Exiting previous element header analysis if needed */ if (get_is_in_element_header()) { int result = tfsxml_leave_element_header(priv); if (result) { return result; } } /* Previous element must not be finished */ if (!get_previous_element_is_open()) { return -1; } priv_bak = *priv; len_sav = priv->len; v->flags = 0; while (priv->len) { switch (*priv->buf) { case '&': { set_must_be_decoded(); break; } case '<': { if (priv->len == 1) { *priv = priv_bak; return 1; } if (priv->buf[1] == '!') { if (priv->len <= 8) { *priv = priv_bak; return 1; } unsigned long long probe = 0; int i; for (i = 2; i <= 8; i++) { probe <<= 8; probe |= priv->buf[i]; } if (probe == 0x5B43444154415BULL) { /* "buf += 9; priv->len -= 9; while (priv->len) { probe &= 0xFFFF; probe <<= 8; probe |= *priv->buf; if (probe == 0x5D5D3EULL) { /* "]]>" */ break; } next_char(priv); } if (!priv->len) { *priv = priv_bak; return 1; } break; } } v->len = len_sav - priv->len; v->buf = priv->buf - v->len; set_previous_element_is_open(); set_level(priv, 0); int result = tfsxml_leave(priv); if (result) { *priv = priv_bak; return result; } return 0; } default: { } } next_char(priv); } *priv = priv_bak; return 1; } int tfsxml_enter(tfsxml_string* priv) { /* Exiting previous element header if needed */ if (get_is_in_element_header()) { int result = tfsxml_leave_element_header(priv); if (result) { return result; } } /* Previous element must not be finished */ if (!get_previous_element_is_open()) { return -1; } unset_previous_element_is_open(); return 0; } int tfsxml_leave(tfsxml_string* priv) { tfsxml_string priv_bak; unsigned level; get_level(priv, &level); level++; /* Exiting previous element header analysis if needed */ if (get_is_in_element_header()) { int result = tfsxml_leave_element_header(priv); if (result) { get_level(priv, &level); set_level(priv, level - 1); return result; } if (get_previous_element_is_open()) { level++; } } set_previous_element_is_open(); priv_bak = *priv; while (priv->len) { switch (*priv->buf) { case '<': { priv_bak = *priv; if (priv->len == 1) { *priv = priv_bak; set_level(priv, level - 1); return 1; } if (priv->buf[1] == '/') { while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } level--; if (!level) { next_char(priv); unset_previous_element_is_open(); set_level(priv, 0); return 0; } priv_bak = *priv; break; } if (priv->buf[1] == '?') { while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } unset_previous_element_is_open(); break; } if (priv->buf[1] == '!') { unsigned long long probe = 0; int i; if (priv->len <= 8) { *priv = priv_bak; set_level(priv, level - 1); return 1; } for (i = 2; i <= 8; i++) { probe <<= 8; probe |= priv->buf[i]; } if (probe == 0x5B43444154415BULL) { /* "buf += 9; priv->len -= 9; while (priv->len) { probe &= 0xFFFF; probe <<= 8; probe |= *priv->buf; if (probe == 0x5D5D3EULL) { /* "]]>" */ break; } next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } break; } if ((probe >> 40) == 0x2D2D) { /* "" */ break; next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } break; } while (priv->len && *priv->buf != '>') { next_char(priv); } if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } next_char(priv); break; } for (;;) { int split; if (!priv->len) { *priv = priv_bak; set_level(priv, level - 1); return 1; } split = 0; switch (*priv->buf) { case '\n': case '\t': case '\r': case ' ': case '/': case '>': { set_is_in_element_header(); set_previous_element_is_open(); split = 1; break; } default: { } } if (split) break; next_char(priv); } int result = tfsxml_leave_element_header(priv); if (result) { set_is_in_element_header(); set_previous_element_is_open(); set_level(priv, level - 1); return result; } if (get_previous_element_is_open()) { level++; set_previous_element_is_open(); } continue; } default: { } } next_char(priv); } set_level(priv, level - 1); return 1; } static const char* const tfsxml_decode_markup[2] = { "amp\0apos\0gt\0lt\0quot", "&'><\"", }; void tfsxml_decode(void* s, const tfsxml_string* v, void (*func)(void*, const char*, unsigned)) { const char* buf_begin; const char* buf = v->buf; unsigned len = v->len; if (!(v->flags & 1)) { func(s, buf, len); return; } buf_begin = buf; while (len) { if (*buf == '&') { const char* buf_end = buf; int len_end = len; while (len_end && *buf_end != ';') { buf_end++; len_end--; } if (len_end) { const char* buf_beg = buf + 1; unsigned len_beg = buf_end - buf_beg; if (len_beg && *buf_beg == '#') { unsigned long value = 0; buf_beg++; len_beg--; if (*buf_beg == 'x' || *buf_beg == 'X') { buf_beg++; len_beg--; while (len_beg) { char c = *buf_beg++; len_beg--; value <<= 4; if (value >= 0x110000) { value = -1; break; } if (c >= '0' && c <= '9') value |= c - '0'; else if (c >= 'A' && c <= 'F') value |= c - ('A' - 10); else if (c >= 'a' && c <= 'f') value |= c - ('a' - 10); else { value = -1; break; } } } else { while (len_beg) { char c = *buf_beg++; len_beg--; if (c < '0' || c > '9') { value = -1; break; } value *= 10; value += c - '0'; if (value >= 0x110000) { value = -1; break; } } } if (value != (unsigned long)-1) { char utf8[4]; func(s, buf_begin, buf - buf_begin); if (value < 0x0080) { utf8[0] = (char)value; func(s, utf8, 1); } else if (value < 0x0800) { utf8[0] = 0xC0 | (char)(value >> 6); utf8[1] = 0x80 | (char)(value & 0x3F); func(s, utf8, 2); } else if (value < 0x10000) { utf8[0] = 0xE0 | (char)((value >> 12)); utf8[1] = 0x80 | (char)((value >> 6) & 0x3F); utf8[2] = 0x80 | (char)((value & 0x3F)); func(s, utf8, 3); } else if (value < 0x110000) { utf8[0] = 0xF0 | (char)((value >> 18)); utf8[1] = 0x80 | (char)((value >> 12) & 0x3F); utf8[2] = 0x80 | (char)((value >> 6) & 0x3F); utf8[3] = 0x80 | (char)((value & 0x3F)); func(s, utf8, 4); } len -= buf_end - buf; buf = buf_end; buf_begin = buf_end + 1; } } else { const char* const buf_beg_sav = buf_beg; const char* replaced = tfsxml_decode_markup[0]; const char* replace_bys = tfsxml_decode_markup[1]; for (;;) { char replace_by = *replace_bys++; if (!replace_by) { break; } while (*replaced) { if (buf_beg == buf_end || !*replaced || *replaced != *buf_beg) break; replaced++; buf_beg++; } if (buf_beg == buf_end && !*replaced) { func(s, buf_begin, buf - buf_begin); func(s, &replace_by, 1); len -= buf_end - buf; buf = buf_end; buf_begin = buf_end + 1; break; } buf_beg = buf_beg_sav; while (*replaced) { replaced++; } replaced++; } } } } if (*buf == '<' && len > 8) { unsigned long long probe = 0; int i; for (i = 1; i <= 8; i++) { probe <<= 8; probe |= buf[i]; } if (probe == 0x215B43444154415BULL) { /* "" */ break; } buf++; len--; } func(s, buf_begin, buf - 2 - buf_begin); buf_begin = buf + 1; } } buf++; len--; } func(s, buf_begin, buf - buf_begin); }