28 struct toptree *toptree_alloc(int level, int id)  in toptree_alloc()  argument
38 	res->level = level;  in toptree_alloc()
117 	if (target->level != (cand->level + 1))  in toptree_insert()
153 	if (cand->level < 2)  in toptree_unify()
156 	cand_copy = toptree_alloc(cand->level, 0);  in toptree_unify()
193 	if (cand->level + 1 == target->level) {  in toptree_move()
205 		stack_target = toptree_alloc(ptr->level + 1,  in toptree_move()
211 	} while (stack_target->level < (target->level - 1));  in toptree_move()
234 	child = toptree_alloc(cand->level-1, id);  in toptree_get_child()
248 struct toptree *toptree_first(struct toptree *context, int level)  in toptree_first()  argument
252 	if (context->level == level)  in toptree_first()
257 			tmp = toptree_first(child, level);  in toptree_first()
296 			     int level)  in toptree_next()  argument
303 	if (context->level == level)  in toptree_next()
311 	while (cur_context->level < context->level - 1) {  in toptree_next()
318 			tmp = toptree_first(tmp, level);  in toptree_next()
334 int toptree_count(struct toptree *context, int level)  in toptree_count()  argument
339 	toptree_for_each(cur, context, level)  in toptree_count()