Lines Matching refs:rmap
37 * The rmap btree is part of the free space management, so blocks for the tree
167 key->rmap.rm_startblock = rec->rmap.rm_startblock;
168 key->rmap.rm_owner = rec->rmap.rm_owner;
169 key->rmap.rm_offset = rec->rmap.rm_offset;
187 adj = be32_to_cpu(rec->rmap.rm_blockcount) - 1;
189 key->rmap.rm_startblock = rec->rmap.rm_startblock;
190 be32_add_cpu(&key->rmap.rm_startblock, adj);
191 key->rmap.rm_owner = rec->rmap.rm_owner;
192 key->rmap.rm_offset = rec->rmap.rm_offset;
193 if (XFS_RMAP_NON_INODE_OWNER(be64_to_cpu(rec->rmap.rm_owner)) ||
194 XFS_RMAP_IS_BMBT_BLOCK(be64_to_cpu(rec->rmap.rm_offset)))
196 off = be64_to_cpu(key->rmap.rm_offset);
198 key->rmap.rm_offset = cpu_to_be64(off);
206 rec->rmap.rm_startblock = cpu_to_be32(cur->bc_rec.r.rm_startblock);
207 rec->rmap.rm_blockcount = cpu_to_be32(cur->bc_rec.r.rm_blockcount);
208 rec->rmap.rm_owner = cpu_to_be64(cur->bc_rec.r.rm_owner);
209 rec->rmap.rm_offset = cpu_to_be64(
231 struct xfs_rmap_key *kp = &key->rmap;
261 struct xfs_rmap_key *kp1 = &k1->rmap;
262 struct xfs_rmap_key *kp2 = &k2->rmap;
381 x = be32_to_cpu(k1->rmap.rm_startblock);
382 y = be32_to_cpu(k2->rmap.rm_startblock);
387 a = be64_to_cpu(k1->rmap.rm_owner);
388 b = be64_to_cpu(k2->rmap.rm_owner);
393 a = XFS_RMAP_OFF(be64_to_cpu(k1->rmap.rm_offset));
394 b = XFS_RMAP_OFF(be64_to_cpu(k2->rmap.rm_offset));
411 x = be32_to_cpu(r1->rmap.rm_startblock);
412 y = be32_to_cpu(r2->rmap.rm_startblock);
417 a = be64_to_cpu(r1->rmap.rm_owner);
418 b = be64_to_cpu(r2->rmap.rm_owner);
423 a = XFS_RMAP_OFF(be64_to_cpu(r1->rmap.rm_offset));
424 b = XFS_RMAP_OFF(be64_to_cpu(r2->rmap.rm_offset));
528 * Calculate number of records in an rmap btree block.
543 /* Compute the maximum height of an rmap btree. */
549 * On a non-reflink filesystem, the maximum number of rmap
554 * could face up to 2^64 rmap records.