| 34 | } |
| 35 | |
| 36 | static void xml_node_walk(acl::xml_node& node, int depth) |
| 37 | { |
| 38 | acl::xml_node* child = node.first_child(); |
| 39 | |
| 40 | while (child) |
| 41 | { |
| 42 | xml_node_print(*child, depth); |
| 43 | xml_node_walk(*child, depth + 1); |
| 44 | child = node.next_child(); |
| 45 | } |
| 46 | } |
| 47 | |
| 48 | static void test_build(void) |
| 49 | { |
searching dependent graphs…