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