134 	struct _tree_node_t *walk = NULL, *del = NULL;  in tree_del_recursive()  local
137 	TREE_DFS_FOREACH(walk, node, &stack, link) {  in tree_del_recursive()
140 		del = walk;  in tree_del_recursive()
156 	struct _tree_node_t *walk = NULL;  in tree_search()  local
159 	TREE_DFS_FOREACH(walk, root, &stack, link)  in tree_search()
160 		if (walk->ev == ev) {  in tree_search()
161 			return walk;  in tree_search()
323 	stree_t *newstree, *walk;
326 	struct _tree_node_t *walk = NULL, *del = NULL;
329 	TREE_DFS_FOREACH(walk, stree->root, &stack, link) {
333 		del = walk;
762 	tree_node_t *parent, *new, *walk;  in mtcp_define_event()  local
776 	for (walk = TREE_FIRSTBORN(parent, link);  in mtcp_define_event()
777 	     walk;  in mtcp_define_event()
778 	     walk = TREE_YOUNGER(walk, link))  in mtcp_define_event()
779 		if ((walk->ft == filter) &&  in mtcp_define_event()
780 		    ((walk->arg.arg == NULL && (!arg || !arg->arg || arg->len <= 0)) ||  in mtcp_define_event()
781 		     (walk->arg.len == arg->len &&  in mtcp_define_event()
782 		      memcmp(walk->arg.arg, arg->arg, arg->len) == 0)))  in mtcp_define_event()
783 			return walk->ev;  in mtcp_define_event()
838 	tree_node_t *walk;  in RaiseEv()  local
839 	for (walk = TREE_FIRSTBORN(g_cur_ev, link);  in RaiseEv()
840 	     walk;  in RaiseEv()
841 		 walk = TREE_YOUNGER(walk, link)) {  in RaiseEv()
842 		if (walk->ev == event && IS_FLOATING_EVENT(walk)) {  in RaiseEv()
843 			ev = walk;  in RaiseEv()
886 	tree_node_t *walk, *bev, *ev;  in HandleCb()  local
901 		TREE_DFS_FOREACH_SELECTIVE(walk, bev, &queue, invk, proceed) {  in HandleCb()
905 			g_cur_ev = walk;  in HandleCb()
907 			if (walk != bev && walk->ft &&  in HandleCb()
908 			    walk->ft(mctx, sock, side, walk->ev, &walk->arg) == false) {  in HandleCb()
914 			if (walk->cb)  in HandleCb()
915 				walk->cb(mctx, sock, side, walk->ev, &walk->arg);  in HandleCb()
919 				TREE_INSERT_CHILD(walk, *ptr, invk);  in HandleCb()