Lines Matching refs:ptr
59 __u64 ptr, struct buffer_head **bhp)
65 bh = nilfs_btnode_create_block(btnc, ptr);
156 nilfs_btree_node_set_ptr(struct nilfs_btree_node *node, int index, __u64 ptr,
159 *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr);
240 __u64 key, __u64 ptr, int ncmax)
256 dptrs[index] = cpu_to_le64(ptr);
266 __u64 ptr;
274 ptr = le64_to_cpu(dptrs[index]);
279 *ptrp = ptr;
470 static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,
480 ret = nilfs_btnode_submit_block(btnc, ptr, 0, REQ_OP_READ, 0, &bh,
488 * value of 'ptr'. In this case, return internal code
524 btree->b_inode->i_ino, (unsigned long long)ptr);
540 static int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,
543 return __nilfs_btree_get_block(btree, ptr, bhp, NULL);
553 __u64 ptr;
562 ptr = nilfs_btree_node_get_ptr(node, index,
578 ret = __nilfs_btree_get_block(btree, ptr, &path[level].bp_bh,
591 ptr = nilfs_btree_node_get_ptr(node, index, ncmax);
595 ptr = NILFS_BMAP_INVALID_PTR;
603 *ptrp = ptr;
613 __u64 ptr;
621 ptr = nilfs_btree_node_get_ptr(node, index,
628 ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh);
635 ptr = nilfs_btree_node_get_ptr(node, index, ncmax);
642 *ptrp = ptr;
709 __u64 ptr, ptr2;
719 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level, 1);
725 ret = nilfs_dat_translate(dat, ptr, &blocknr);
728 ptr = blocknr;
749 if (ptr2 != ptr + cnt || ++cnt == maxblocks)
780 *ptrp = ptr;
1041 __u64 ptr;
1043 ptr = nilfs_bmap_find_target_seq(btree, key);
1044 if (ptr != NILFS_BMAP_INVALID_PTR)
1046 return ptr;
1048 ptr = nilfs_btree_find_near(btree, path);
1049 if (ptr != NILFS_BMAP_INVALID_PTR)
1051 return ptr;
1059 int *levelp, __u64 key, __u64 ptr,
1071 /* allocate a new ptr for data block */
1208 int maxlevel, __u64 key, __u64 ptr)
1213 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1214 ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr;
1216 nilfs_bmap_set_target_v(btree, key, ptr);
1223 path[level].bp_op(btree, path, level, &key, &ptr);
1230 static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr)
1248 ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats);
1251 nilfs_btree_commit_insert(btree, path, level, key, ptr);
1653 __u64 ptr;
1666 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1668 ret = nilfs_btree_get_block(btree, ptr, &bh);
1694 __u64 ptr;
1707 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1709 ret = nilfs_btree_get_block(btree, ptr, &bh);
1750 /* cannot find near ptr */
1795 __u64 key, __u64 ptr,
1811 /* ptr must be a pointer to a buffer head. */
1812 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1861 * @ptr:
1867 __u64 key, __u64 ptr,
1892 nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n,
2038 __u64 ptr;
2050 ptr = nilfs_btree_node_get_ptr(parent,
2053 ret = nilfs_dat_mark_dirty(dat, ptr);
2197 __u64 ptr;
2201 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2204 path[level].bp_ctxt.oldkey = ptr;
2239 __u64 ptr;
2244 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2246 req.bpr_ptr = ptr;
2254 binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr);
2330 __u64 ptr;
2337 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0);
2342 ret = nilfs_btree_get_block(btree, ptr, &bh);