Lines Matching defs: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, &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)
779 *ptrp = ptr;
1040 __u64 ptr;
1042 ptr = nilfs_bmap_find_target_seq(btree, key);
1043 if (ptr != NILFS_BMAP_INVALID_PTR)
1045 return ptr;
1047 ptr = nilfs_btree_find_near(btree, path);
1048 if (ptr != NILFS_BMAP_INVALID_PTR)
1050 return ptr;
1058 int *levelp, __u64 key, __u64 ptr,
1070 /* allocate a new ptr for data block */
1207 int maxlevel, __u64 key, __u64 ptr)
1212 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1213 ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr;
1215 nilfs_bmap_set_target_v(btree, key, ptr);
1222 path[level].bp_op(btree, path, level, &key, &ptr);
1229 static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr)
1247 ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats);
1250 nilfs_btree_commit_insert(btree, path, level, key, ptr);
1652 __u64 ptr;
1665 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1667 ret = nilfs_btree_get_block(btree, ptr, &bh);
1692 __u64 ptr;
1705 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1707 ret = nilfs_btree_get_block(btree, ptr, &bh);
1747 /* cannot find near ptr */
1792 __u64 key, __u64 ptr,
1808 /* ptr must be a pointer to a buffer head. */
1809 set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
1858 * @ptr:
1864 __u64 key, __u64 ptr,
1889 nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n,
2035 __u64 ptr;
2047 ptr = nilfs_btree_node_get_ptr(parent,
2050 ret = nilfs_dat_mark_dirty(dat, ptr);
2194 __u64 ptr;
2198 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2201 path[level].bp_ctxt.oldkey = ptr;
2237 __u64 ptr;
2242 ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
2244 req.bpr_ptr = ptr;
2252 binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr);
2328 __u64 ptr;
2335 ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0);
2340 ret = nilfs_btree_get_block(btree, ptr, &bh);