36 	unsigned int depth;  member
106 	for (; l < t->depth - 1; l++)  in high()
237 	if (t->depth >= 2)  in dm_table_destroy()
238 		vfree(t->index[t->depth - 2]);  in dm_table_destroy()
988 	for (i = t->depth - 2; i >= 0; i--) {  in setup_indexes()
998 	for (i = t->depth - 2; i >= 0; i--) {  in setup_indexes()
1017 	t->depth = 1 + int_log(leaf_nodes, CHILDREN_PER_NODE);  in dm_table_build_index()
1020 	t->counts[t->depth - 1] = leaf_nodes;  in dm_table_build_index()
1021 	t->index[t->depth - 1] = t->highs;  in dm_table_build_index()
1023 	if (t->depth >= 2)  in dm_table_build_index()
1195 	for (l = 0; l < t->depth; l++) {  in dm_table_find_target()