HomeSort by: relevance | last modified time | path
    Searched refs:sm_shift (Results 1 - 4 of 4) sorted by relevancy

  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
space_map.c 112 offset = (SM_OFFSET_DECODE(e) << sm->sm_shift) +
114 size = SM_RUN_DECODE(e) << sm->sm_shift;
116 VERIFY0(P2PHASE(offset, 1ULL << sm->sm_shift));
117 VERIFY0(P2PHASE(size, 1ULL << sm->sm_shift));
153 * ranges smaller than our sm_shift size.
155 for (int i = 0; i < sm->sm_shift; i++) {
180 * between 2^sm_shift to 2^(32+sm_shift-1). The range tree,
182 * map only cares about allocatable blocks (minimum of sm_shift) we
183 * can safely ignore all ranges in the range tree smaller than sm_shift
    [all...]
metaslab.c 1668 uint8_t shift = msp->ms_sm->sm_shift;
1819 msp->ms_sm->sm_shift);
2150 size = (rs->rs_end - rs->rs_start) >> sm->sm_shift;
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/sys/
space_map.h 67 * 2^(i+sm_shift) <= size of free region in bytes < 2^(i+sm_shift+1)
80 uint8_t sm_shift; /* unit shift */ member in struct:space_map
105 * | 0 | offset (sm_shift units) | type | run |
  /src/external/cddl/osnet/dist/cmd/zdb/
zdb.c 697 uint8_t mapshift = sm->sm_shift;
780 * of sm_shift (i.e. bucket 0 refers to 2^sm_shift).
785 SPACE_MAP_HISTOGRAM_SIZE, sm->sm_shift);

Completed in 88 milliseconds