1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
Copyright (C) 2015-2017 Alexander Borisov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Author: lex.borisov@gmail.com (Alexander Borisov)
*/
#ifndef MyHTML_def_H
#define MyHTML_def_H
#pragma once
#ifdef __cplusplus
extern "C" {
#endif
#define myhtml_parser_skip_whitespace() \
if(myhtml_whithspace(html[html_offset], ==, ||)) { \
while (html_offset < html_size && (myhtml_whithspace(html[html_offset], ==, ||))) { \
html_offset++; \
} \
}
#define myhtml_parser_queue_set_attr(tree, token_node) \
if(token_node->attr_first == NULL) { \
token_node->attr_first = myhtml_tree_token_attr_current(tree); \
token_node->attr_last = token_node->attr_first; \
\
tree->attr_current = token_node->attr_last; \
tree->attr_current->next = NULL; \
tree->attr_current->prev = NULL; \
} \
else { \
token_node->attr_last->next = myhtml_tree_token_attr_current(tree); \
token_node->attr_last->next->prev = token_node->attr_last; \
token_node->attr_last = token_node->attr_last->next; \
\
token_node->attr_last->next = NULL; \
tree->attr_current = token_node->attr_last; \
}
#ifdef __cplusplus
} /* extern "C" */
#endif
#endif
|
