| 193 | } |
| 194 | |
| 195 | static void walk_xml_node(ACL_XML_NODE *node, int n) |
| 196 | { |
| 197 | ACL_ITER iter; |
| 198 | |
| 199 | /* ���������ӽ�� */ |
| 200 | |
| 201 | acl_foreach(iter, node) { |
| 202 | int i; |
| 203 | ACL_XML_NODE *child = (ACL_XML_NODE*) iter.data; |
| 204 | |
| 205 | for (i = 0; i < n; i++) |
| 206 | printf("\t"); |
| 207 | |
| 208 | printf("tag->%s, size: %ld\n", STR(child->ltag), |
| 209 | (long) LEN(child->ltag)); |
| 210 | |
| 211 | xml_node_attrs(child, n + 1); |
| 212 | |
| 213 | for (i = 0; i < n + 1; i++) |
| 214 | printf("\t"); |
| 215 | |
| 216 | printf("text->%s, size: %ld\n", STR(child->text), |
| 217 | (long) LEN(child->text)); |
| 218 | |
| 219 | walk_xml_node(child, n + 1); |
| 220 | } |
| 221 | } |
| 222 | |
| 223 | static void list_xml_tags(ACL_XML *xml) |
| 224 | { |
searching dependent graphs…