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

  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
zap_leaf.c 128 zap_leaf_chunk_t *lc = &ZAP_LEAF_CHUNK(&l, i);
171 ZAP_LEAF_CHUNK(l, i).l_free.lf_type = ZAP_CHUNK_FREE;
172 ZAP_LEAF_CHUNK(l, i).l_free.lf_next = i+1;
174 ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)-1).l_free.lf_next = CHAIN_END;
195 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE);
198 ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next;
208 struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free;
240 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
273 int nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next;
274 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==
    [all...]
zap.c 498 ASSERT3P(&ZAP_LEAF_CHUNK(l, 0), ==,
502 ASSERT3U((uintptr_t)&ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)) -
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/sys/
zap_leaf.h 85 #define ZAP_LEAF_CHUNK(l, idx) \
88 #define ZAP_LEAF_ENTRY(l, idx) (&ZAP_LEAF_CHUNK(l, idx).l_entry)
124 * zap_leaf_chunk structures. These structures are accessed
125 * with the ZAP_LEAF_CHUNK() macro.
131 typedef union zap_leaf_chunk { union

Completed in 22 milliseconds