2 * Copyright (C) 2005 QSDN,Inc. All rights reserved.
3 * Copyright (C) 2005 Atsushi Konno All rights reserved.
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
9 * http://www.apache.org/licenses/LICENSE-2.0
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
17 #ifndef __QS_PARSE_STRING_H__
18 #define __QS_PARSE_STRING_H__
27 * Max of memory allocation times.
29 #define QX_ALLOC_MAX (100*1024)
32 * It is judged whether it is the first byte of Japanese Shift_JIS
35 #define is_sjis_kanji(c) ((0x81 <= (unsigned char)(c&0xff) && \
36 (unsigned char)(c&0xff) <= 0x9f) \
37 || (0xe0 <= (unsigned char)(c&0xff) && \
38 (unsigned char)(c&0xff) <= 0xfc))
40 * It is judged whether it is a byte of Japanese Shift_JIS "HANKAKU KANA".
42 #define is_sjis_kana(c) ((0xa1 <= (unsigned char)(c&0xff) && (unsigned char)(c&0xff) <= 0xdf))
45 * It is judged whether it is a Japanese code part of EUC.
47 #define is_euc_kanji(c) (0xa1 <= (unsigned char)(c&0xff) && (unsigned char)(c&0xff) <= 0xfe)
50 * It is judged whether it is a Japanese code part of EUC "KANA".
52 #define is_euc_kana(c) (0x8e == (unsigned char)(c&0xff))
55 * True is returned for whitespace.
57 #define is_white_space(c) (' ' == (unsigned char)(c&0xff) \
58 || '\t' == (unsigned char)(c&0xff) \
59 || '\n' == (unsigned char)(c&0xff) \
60 || '\r' == (unsigned char)(c&0xff))
63 * True is returned for the quotation mark.
65 #define is_quote(c) ('\'' == (unsigned char)(c&0xff) \
66 ||'"' == (unsigned char)(c&0xff))
69 * It is judged whether the tag of the object has the child element.
70 * The "<option>" tag has the child. Please write </ option >.
72 #define has_child(c) ((strcasecmp(c, "base" ) != 0) \
73 && (strcasecmp(c, "meta" ) != 0) \
74 && (strcasecmp(c, "br" ) != 0) \
75 && (strcasecmp(c, "dt" ) != 0) \
76 && (strcasecmp(c, "dd" ) != 0) \
77 && (strcasecmp(c, "hr" ) != 0) \
78 && (strcasecmp(c, "img" ) != 0) \
79 && (strcasecmp(c, "input" ) != 0) \
80 && (strcasecmp(c, "p" ) != 0) \
81 && (strcasecmp(c, "plaintext") != 0) \
82 && (strcasecmp(c, "?xml" ) != 0) \
83 && (strcasecmp(c, "!doctype" ) != 0) \
84 && (strcasecmp(c, "link" ) != 0) \
85 && (strcasecmp(c, "!--" ) != 0) \
86 && (strncasecmp(c, "![CDATA[",8) != 0))
89 * It is judged whether the tag of the object has the child element.
90 * The "<option>" tag has the child. Please write </ option >.
92 #define has_child_hdml(c) ((strcasecmp(c, "center" ) != 0) \
93 && (strcasecmp(c, "br" ) != 0) \
94 && (strcasecmp(c, "action" ) != 0) \
95 && (strcasecmp(c, "!--" ) != 0))
98 * The structure of the attribute is defined.
100 typedef struct Attr Attr;
110 * The structure of the element is defined.
112 typedef struct Node Node;
118 struct Node* child_tail;
120 struct Attr* attr_tail;
127 typedef struct pointer_table_t {
128 unsigned int address;
130 struct pointer_table_t* next;
131 struct pointer_table_t* prev;
135 typedef enum chxj_parse_mode_t {
140 typedef struct _doc {
141 Node* now_parent_node;
145 unsigned long alloc_size;
147 Pointer_Table* pointer_table;
148 Pointer_Table* free_list_head;
149 Pointer_Table* free_list_tail;
150 Pointer_Table* allocated_list_head;
151 Pointer_Table* allocated_list_tail;
153 ParseMode_t parse_mode;
155 apr_allocator_t* allocator;
158 #ifndef __NON_MOD_CHXJ__
166 extern Node* qs_init_root_node(
169 extern void qs_add_child_node(
173 extern void qs_free_node(
177 extern Node* qs_get_root(
180 extern Node* qs_parse_string(
185 char* qs_get_node_value(Doc* doc,Node* node);
186 char* qs_get_node_name(Doc* doc, Node* node) ;
187 int qs_get_node_size(Doc* doc, Node* node) ;
188 Node* qs_get_child_node(Doc* doc, Node* node) ;
189 Node* qs_get_next_node(Doc* doc, Node* node) ;
190 Attr* qs_get_attr(Doc* doc, Node* node) ;
191 Attr* qs_get_next_attr(Doc* doc, Attr* attr) ;
192 char* qs_get_attr_name(Doc* doc, Attr* attr) ;
193 char* qs_get_attr_value(Doc* doc, Attr* attr) ;