Lines Matching refs:skip
45 * a very simple 'skip' calculation. In order to support large radixes,
134 daddr_t count, daddr_t radix, int skip);
137 daddr_t radix, int skip, daddr_t blk);
139 daddr_t skip, blist_t dest, daddr_t count);
141 int skip, daddr_t count);
144 daddr_t radix, int skip, int tab);
168 int skip = 0;
171 * Calculate radix and skip field used for scanning.
177 skip = (skip + 1) << BLIST_META_RADIX_SHIFT;
186 bl->bl_skip = skip;
396 int skip)
399 int next_skip = (skip >> BLIST_META_RADIX_SHIFT);
416 for (i = 1; i <= skip; i += next_skip) {
431 for (i = 1; i <= skip; i += next_skip) {
519 int skip, daddr_t blk)
522 int next_skip = (skip >> BLIST_META_RADIX_SHIFT);
540 for (i = 1; i <= skip; i += next_skip) {
575 while (i <= skip && blk < freeBlk + count) {
607 daddr_t skip, blist_t dest, daddr_t count)
660 next_skip = (skip >> BLIST_META_RADIX_SHIFT);
662 for (i = 1; count && i <= skip; i += next_skip) {
703 blst_radix_init(blmeta_t *scan, daddr_t radix, int skip, daddr_t count)
733 next_skip = (skip >> BLIST_META_RADIX_SHIFT);
735 for (i = 1; i <= skip; i += next_skip) {
775 blst_radix_print(blmeta_t *scan, daddr_t blk, daddr_t radix, int skip, int tab)
821 next_skip = (skip >> BLIST_META_RADIX_SHIFT);
824 for (i = 1; i <= skip; i += next_skip) {