| 165 | } |
| 166 | |
| 167 | int mime_node_delete(MIME_NODE *node) |
| 168 | { |
| 169 | ACL_RING *next; |
| 170 | MIME_NODE *node_next; |
| 171 | int n = 1; |
| 172 | |
| 173 | while ((next = acl_ring_pop_head(&node->children)) != NULL) { |
| 174 | node_next = acl_ring_to_appl(next, MIME_NODE, node); |
| 175 | n += mime_node_delete(node_next); |
| 176 | } |
| 177 | |
| 178 | node->state->node_cnt--; |
| 179 | mime_node_free(node); |
| 180 | return (n); |
| 181 | } |
| 182 | |
| 183 | void mime_node_add_child(MIME_NODE *parent, MIME_NODE *child) |
| 184 | { |
no test coverage detected
searching dependent graphs…