36 #define toptree_for_each_child(child, ptree)				\  argument
37 	list_for_each_entry(child,  &ptree->children, sibling)
39 #define toptree_for_each_child_safe(child, ptmp, ptree)			\  argument
40 	list_for_each_entry_safe(child, ptmp, &ptree->children, sibling)
42 #define toptree_is_last(ptree)					\  argument
43 	((ptree->parent == NULL) ||				\
44 	 (ptree->parent->children.prev == &ptree->sibling))
46 #define toptree_for_each(ptree, cont, ttype)		\  argument
47 	for (ptree = toptree_first(cont, ttype);	\
48 	     ptree != NULL;				\
49 	     ptree = toptree_next(ptree, cont, ttype))
51 #define toptree_for_each_safe(ptree, tmp, cont, ttype)		\  argument
52 	for (ptree = toptree_first(cont, ttype),		\
53 		     tmp = toptree_next(ptree, cont, ttype);	\
54 	     ptree != NULL;					\
55 	     ptree = tmp,					\
56 		     tmp = toptree_next(ptree, cont, ttype))
58 #define toptree_for_each_sibling(ptree, start)			\  argument
59 	toptree_for_each(ptree, start->parent, start->level)