Lines Matching refs:NILFS_BTREE_LEVEL_NODE_MIN

318 	if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) {  in nilfs_btree_node_lookup()
350 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_node_broken()
381 	if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_root_broken()
562 		if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) {  in nilfs_btree_do_lookup()
584 			WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);  in nilfs_btree_do_lookup()
702 	int level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_contig()
1008 	level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_find_near()
1017 	level = NILFS_BTREE_LEVEL_NODE_MIN + 1;  in nilfs_btree_find_near()
1074 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_prepare_insert()
1210 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_insert()
1231 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);  in nilfs_btree_insert()
1436 	for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;  in nilfs_btree_prepare_delete()
1546 	for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {  in nilfs_btree_prepare_delete()
1561 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_delete()
1583 				    NILFS_BTREE_LEVEL_NODE_MIN, 0);  in nilfs_btree_delete()
1605 	const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_seek_key()
2117 	if (level < NILFS_BTREE_LEVEL_NODE_MIN ||  in nilfs_btree_add_dirty_buffer()
2149 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_dirty_buffers()
2170 	for (level = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_lookup_dirty_buffers()