Lines Matching refs:alloc
130 len = rec->alloc.ar_blockcount;
133 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
136 len = rec->alloc.ar_blockcount;
186 key->alloc.ar_startblock = rec->alloc.ar_startblock;
187 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
197 x = be32_to_cpu(rec->alloc.ar_startblock);
198 x += be32_to_cpu(rec->alloc.ar_blockcount) - 1;
199 key->alloc.ar_startblock = cpu_to_be32(x);
200 key->alloc.ar_blockcount = 0;
208 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
209 key->alloc.ar_startblock = 0;
217 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
218 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
239 xfs_alloc_key_t *kp = &key->alloc;
250 xfs_alloc_key_t *kp = &key->alloc;
266 return (int64_t)be32_to_cpu(k1->alloc.ar_startblock) -
267 be32_to_cpu(k2->alloc.ar_startblock);
278 diff = be32_to_cpu(k1->alloc.ar_blockcount) -
279 be32_to_cpu(k2->alloc.ar_blockcount);
283 return be32_to_cpu(k1->alloc.ar_startblock) -
284 be32_to_cpu(k2->alloc.ar_startblock);
386 return be32_to_cpu(k1->alloc.ar_startblock) <
387 be32_to_cpu(k2->alloc.ar_startblock);
396 return be32_to_cpu(r1->alloc.ar_startblock) +
397 be32_to_cpu(r1->alloc.ar_blockcount) <=
398 be32_to_cpu(r2->alloc.ar_startblock);
407 return be32_to_cpu(k1->alloc.ar_blockcount) <
408 be32_to_cpu(k2->alloc.ar_blockcount) ||
409 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
410 be32_to_cpu(k1->alloc.ar_startblock) <
411 be32_to_cpu(k2->alloc.ar_startblock));
420 return be32_to_cpu(r1->alloc.ar_blockcount) <
421 be32_to_cpu(r2->alloc.ar_blockcount) ||
422 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
423 be32_to_cpu(r1->alloc.ar_startblock) <
424 be32_to_cpu(r2->alloc.ar_startblock));
511 struct xfs_btree_cur * /* new alloc btree cursor */
576 * Calculate number of records in an alloc btree block.