fs/nilfs2/btree.c

263 				    __u64 *keyp, __u64 *ptrp, int ncmax)
276 	if (keyp != NULL)
277 		*keyp = key;
610 				      __u64 *keyp, __u64 *ptrp)
639 	if (keyp != NULL)
640 		*keyp = nilfs_btree_node_get_key(node, index);
815 				  int level, __u64 *keyp, __u64 *ptrp)
824 					*keyp, *ptrp, ncblk);
835 					*keyp, *ptrp,
842 				   int level, __u64 *keyp, __u64 *ptrp)
883 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
888 				    int level, __u64 *keyp, __u64 *ptrp)
930 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
935 			      int level, __u64 *keyp, __u64 *ptrp)
962 					*keyp, *ptrp, ncblk);
964 		*keyp = nilfs_btree_node_get_key(right, 0);
971 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
973 		*keyp = nilfs_btree_node_get_key(right, 0);
985 			     int level, __u64 *keyp, __u64 *ptrp)
1006 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
1008 	*keyp = nilfs_btree_node_get_key(child, 0);
1265 				  int level, __u64 *keyp, __u64 *ptrp)
1274 					keyp, ptrp, ncblk);
1283 					keyp, ptrp,
1290 				    int level, __u64 *keyp, __u64 *ptrp)
1295 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1322 				     int level, __u64 *keyp, __u64 *ptrp)
1327 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1355 				    int level, __u64 *keyp, __u64 *ptrp)
1360 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1381 				     int level, __u64 *keyp, __u64 *ptrp)
1386 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1406 			       int level, __u64 *keyp, __u64 *ptrp)
1411 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1430 			    int level, __u64 *keyp, __u64 *ptrp)
1616 				__u64 *keyp)
1628 		*keyp = start;
1630 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);
1636 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)
1645 	ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);