comparison: src/cx/tree.h
src/cx/tree.h
- changeset 1319
- aa1f580f8f59
- parent 1318
- 12fa1d37fe48
- child 1424
- 563033aa998c
equal
deleted
inserted
replaced
| 1318:12fa1d37fe48 | 1319:aa1f580f8f59 |
|---|---|
| 211 * Releases internal memory of the given tree iterator. | 211 * Releases internal memory of the given tree iterator. |
| 212 * @param iter the iterator | 212 * @param iter the iterator |
| 213 */ | 213 */ |
| 214 cx_attr_nonnull | 214 cx_attr_nonnull |
| 215 static inline void cxTreeIteratorDispose(CxTreeIterator *iter) { | 215 static inline void cxTreeIteratorDispose(CxTreeIterator *iter) { |
| 216 cxFree(cxDefaultAllocator, iter->stack); | 216 cxFreeDefault(iter->stack); |
| 217 iter->stack = NULL; | 217 iter->stack = NULL; |
| 218 } | 218 } |
| 219 | 219 |
| 220 /** | 220 /** |
| 221 * Releases internal memory of the given tree visitor. | 221 * Releases internal memory of the given tree visitor. |
| 224 cx_attr_nonnull | 224 cx_attr_nonnull |
| 225 static inline void cxTreeVisitorDispose(CxTreeVisitor *visitor) { | 225 static inline void cxTreeVisitorDispose(CxTreeVisitor *visitor) { |
| 226 struct cx_tree_visitor_queue_s *q = visitor->queue_next; | 226 struct cx_tree_visitor_queue_s *q = visitor->queue_next; |
| 227 while (q != NULL) { | 227 while (q != NULL) { |
| 228 struct cx_tree_visitor_queue_s *next = q->next; | 228 struct cx_tree_visitor_queue_s *next = q->next; |
| 229 cxFree(cxDefaultAllocator, q); | 229 cxFreeDefault(q); |
| 230 q = next; | 230 q = next; |
| 231 } | 231 } |
| 232 } | 232 } |
| 233 | 233 |
| 234 /** | 234 /** |
