Home
last modified time | relevance | path

Searched refs:bc_ptrs (Results 1 - 8 of 8) sorted by relevance

/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dbtree.c138 rec = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block); in xchk_btree_rec()
154 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
163 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
185 key = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); in xchk_btree_key()
201 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
209 key = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); in xchk_btree_key()
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
293 pp = xfs_btree_ptr_addr(ncur, ncur->bc_ptrs[level + 1], pblock); in xchk_btree_block_check_sibling()
572 parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], in xchk_btree_block_keys()
583 high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[leve in xchk_btree_block_keys()
[all...]
H A Dtrace.h345 __entry->ptr = cur->bc_ptrs[level];
386 __entry->ptr = cur->bc_ptrs[level];
428 __entry->ptr = cur->bc_ptrs[level];
468 __entry->ptr = cur->bc_ptrs[level];
508 __entry->ptr = cur->bc_ptrs[level];
H A Dbitmap.c225 * the first btree record, we'll observe that bc_ptrs[0] == 1, so we record
226 * that we saw block 1. Then we observe that bc_ptrs[1] == 1, so we record
229 * For the second btree record, we see that bc_ptrs[0] == 2, so we exit the
233 * bc_ptrs[0] == 1 again, so we record that we saw block 2. We see that
234 * bc_ptrs[1] == 2, so we exit the loop. The list is now [1, 4, 2].
236 * For the 102nd record, bc_ptrs[0] == 2, so we continue.
238 * For the 201st record, we've moved on to leaf block 3. bc_ptrs[0] == 1, so
259 for (i = 0; i < cur->bc_nlevels && cur->bc_ptrs[i] == 1; i++) { in xbitmap_set_btcur_path()
H A Dbmap.c409 bs->cur->bc_ptrs[0] == 1) { in xchk_bmapbt_rec()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_btree.c421 new->bc_ptrs[i] = cur->bc_ptrs[i]; in xfs_btree_dup_cursor()
717 cur->bc_ptrs[level] = 1; in xfs_btree_firstrec()
747 cur->bc_ptrs[level] = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1554 if (++cur->bc_ptrs[level] <= xfs_btree_get_numrecs(block)) in xfs_btree_increment()
1577 if (++cur->bc_ptrs[lev] <= xfs_btree_get_numrecs(block)) in xfs_btree_increment()
1604 ptrp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[lev], block); in xfs_btree_increment()
1611 cur->bc_ptrs[lev] = 1; in xfs_btree_increment()
1647 if (--cur->bc_ptrs[level] > 0) in xfs_btree_decrement()
1671 if (--cur->bc_ptrs[le in xfs_btree_decrement()
[all...]
H A Dxfs_btree.h226 int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ member
H A Dxfs_alloc.c1516 acur->cnt->bc_ptrs[0] = 1; in xfs_alloc_ag_vextent_lastblock()
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_trace.h2336 __entry->ptr = cur->bc_ptrs[level];

Completed in 16 milliseconds