| 415 static void *cx_tree_visitor_current(const void *it) { |
415 static void *cx_tree_visitor_current(const void *it) { |
| 416 const struct cx_tree_visitor_s *iter = it; |
416 const struct cx_tree_visitor_s *iter = it; |
| 417 return iter->node; |
417 return iter->node; |
| 418 } |
418 } |
| 419 |
419 |
| 420 cx_attr_nonnull |
420 CX_NONNULL |
| 421 static void cx_tree_visitor_enqueue_siblings( |
421 static void cx_tree_visitor_enqueue_siblings( |
| 422 struct cx_tree_visitor_s *iter, void *node, ptrdiff_t loc_next) { |
422 struct cx_tree_visitor_s *iter, void *node, ptrdiff_t loc_next) { |
| 423 node = tree_next(node); |
423 node = tree_next(node); |
| 424 while (node != NULL) { |
424 while (node != NULL) { |
| 425 struct cx_tree_visitor_queue_s *q; |
425 struct cx_tree_visitor_queue_s *q; |