113 static int toptree_insert(struct toptree *cand, struct toptree *target)  in toptree_insert()  argument
115 	if (!cand || !target)  in toptree_insert()
117 	if (target->level != (cand->level + 1))  in toptree_insert()
119 	list_add_tail(&cand->sibling, &target->children);  in toptree_insert()
120 	cand->parent = target;  in toptree_insert()
121 	toptree_update_mask(target);  in toptree_insert()
132 static void toptree_move_children(struct toptree *cand, struct toptree *target)  in toptree_move_children()  argument
137 		toptree_move(child, target);  in toptree_move_children()
189 void toptree_move(struct toptree *cand, struct toptree *target)  in toptree_move()  argument
193 	if (cand->level + 1 == target->level) {  in toptree_move()
195 		toptree_insert(cand, target);  in toptree_move()
211 	} while (stack_target->level < (target->level - 1));  in toptree_move()
215 	toptree_insert(stack_target, target);  in toptree_move()