Searched refs:bc_levels (Results 1 - 11 of 11) sorted by relevance

/linux-master/fs/xfs/scrub/
H A Dtrace.c36 if (level < cur->bc_nlevels && cur->bc_levels[level].bp)
38 xfs_buf_daddr(cur->bc_levels[level].bp));
H A Dbtree.c150 rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block);
167 keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock);
176 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock);
198 key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block);
214 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock);
222 key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block);
223 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr,
303 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock);
557 parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr,
569 cur->bc_levels[leve
[all...]
H A Dagb_bitmap.c32 * the first btree record, we'll observe that bc_levels[0].ptr == 1, so we
33 * record that we saw block 1. Then we observe that bc_levels[1].ptr == 1, so
36 * For the second btree record, we see that bc_levels[0].ptr == 2, so we exit
40 * bc_levels[0].ptr == 1 again, so we record that we saw block 2. We see that
41 * bc_levels[1].ptr == 2, so we exit the loop. The list is now [1, 4, 2].
43 * For the 102nd record, bc_levels[0].ptr == 2, so we continue.
46 * bc_levels[0].ptr == 1, so we add 3 to the list. Now it is [1, 4, 2, 3].
96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) {
H A Drmap.c164 if (cur->bc_levels[level].ptr > 1)
H A Dtrace.h482 __entry->ptr = cur->bc_levels[level].ptr;
523 __entry->ptr = cur->bc_levels[level].ptr;
565 __entry->ptr = cur->bc_levels[level].ptr;
605 __entry->ptr = cur->bc_levels[level].ptr;
645 __entry->ptr = cur->bc_levels[level].ptr;
H A Dbmap.c482 bs->cur->bc_levels[0].ptr == 1) {
/linux-master/fs/xfs/libxfs/
H A Dxfs_btree.c511 if (cur->bc_levels[i].bp)
512 xfs_trans_brelse(cur->bc_tp, cur->bc_levels[i].bp);
602 new->bc_levels[i].ptr = cur->bc_levels[i].ptr;
603 new->bc_levels[i].ra = cur->bc_levels[i].ra;
604 bp = cur->bc_levels[i].bp;
619 new->bc_levels[i].bp = bp;
861 *bpp = cur->bc_levels[level].bp;
891 cur->bc_levels[leve
[all...]
H A Dxfs_btree.h303 struct xfs_btree_level bc_levels[]; member in struct:xfs_btree_cur
308 * height. The bc_levels array handles node and leaf blocks, so its size
314 return struct_size_t(struct xfs_btree_cur, bc_levels, nlevels);
H A Dxfs_bmap.c266 if (!cur->bc_levels[i].bp)
268 if (xfs_buf_daddr(cur->bc_levels[i].bp) == bno)
269 return cur->bc_levels[i].bp;
614 if (cur->bc_levels[0].bp == cbp)
615 cur->bc_levels[0].bp = NULL;
H A Dxfs_alloc.c547 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp);
548 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp);
1533 acur->cnt->bc_levels[0].ptr = 1;
/linux-master/fs/xfs/
H A Dxfs_trace.h2473 __entry->ptr = cur->bc_levels[level].ptr;

Completed in 224 milliseconds