fs/nilfs2/btree.c

35 		path[level].bp_index = 0;
565 	path[level].bp_index = index;
597 		path[level].bp_index = index;
624 	path[level].bp_index = index;
636 		path[level].bp_index = index;
665 	/* Next index is already set to bp_index for leaf nodes. */
673 		index = path[level].bp_index + next_adj;
679 		/* For non-leaf nodes, next index is stored at bp_index + 1. */
736 	index = path[level].bp_index + 1;
758 		p.index = path[level + 1].bp_index + 1;
764 		path[level + 1].bp_index = p.index;
776 		path[level].bp_index = index;
799 				path[level].bp_index, key);
802 		} while ((path[level].bp_index == 0) &&
809 					 path[level].bp_index, key);
823 		nilfs_btree_node_insert(node, path[level].bp_index,
828 		if (path[level].bp_index == 0)
834 		nilfs_btree_node_insert(node, path[level].bp_index,
855 	if (n > path[level].bp_index) {
875 		path[level].bp_index += lnchildren;
876 		path[level + 1].bp_index--;
880 		path[level].bp_index -= n;
901 	if (n > nchildren - path[level].bp_index) {
914 	path[level + 1].bp_index++;
917 	path[level + 1].bp_index--;
923 		path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
924 		path[level + 1].bp_index++;
947 	if (n > nchildren - path[level].bp_index) {
960 		path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
961 		nilfs_btree_node_insert(right, path[level].bp_index,
980 	path[level + 1].bp_index++;
1023 	if (path[level].bp_index > 0) {
1026 						path[level].bp_index - 1,
1034 		return nilfs_btree_node_get_ptr(node, path[level].bp_index,
1099 		pindex = path[level + 1].bp_index;
1273 		nilfs_btree_node_delete(node, path[level].bp_index,
1277 		if (path[level].bp_index == 0)
1282 		nilfs_btree_node_delete(node, path[level].bp_index,
1317 	path[level].bp_index += n;
1344 	path[level + 1].bp_index++;
1347 	path[level + 1].bp_index--;
1376 	path[level].bp_index += nilfs_btree_node_get_nchildren(left);
1401 	path[level + 1].bp_index++;
1450 	for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;
1468 		pindex = path[level + 1].bp_index;
1930 		nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
1976 	nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index,
2062 					       path[level + 1].bp_index,
2212 	ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2229 	nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr,
2232 	key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index);
2256 	ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2264 	key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index);