Lines Matching refs:chunk

30  * chunk number n means l_chunk[n], even though the header precedes it.
47 #define CHAIN_END 0xffff /* end of the chunk chain */
179 uint_t chunk = zap_leaf_phys(l)->l_hdr.lh_freelist;
180 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
181 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE);
184 ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next;
188 return (chunk);
192 zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk)
194 struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free;
196 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
202 zap_leaf_phys(l)->l_hdr.lh_freelist = chunk;
227 uint16_t chunk = zap_leaf_chunk_alloc(l);
228 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
243 *chunkp = chunk;
254 uint16_t chunk = *chunkp;
258 while (chunk != CHAIN_END) {
259 uint_t nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next;
260 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==,
262 zap_leaf_chunk_free(l, chunk);
263 chunk = nextchunk;
269 zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk,
282 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
296 while (chunk != CHAIN_END) {
298 &ZAP_LEAF_CHUNK(l, chunk).l_array;
301 chunk = la->la_next;
307 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
309 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
322 chunk = la->la_next;
328 uint_t chunk, int array_numints)
337 zap_leaf_array_read(l, chunk, sizeof (*thiskey), array_numints,
349 zap_leaf_array_read(l, chunk, sizeof (char), array_numints,
364 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
366 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
370 chunk = la->la_next;
389 uint16_t chunk = *chunkp;
390 le = ZAP_LEAF_ENTRY(l, chunk);
392 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
436 for (uint16_t chunk = zap_leaf_phys(l)->l_hash[lh];
437 chunk != CHAIN_END; chunk = le->le_next) {
438 le = ZAP_LEAF_ENTRY(l, chunk);
440 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
454 zeh->zeh_fakechunk = chunk;
551 uint16_t chunk;
567 for (chunk = *LEAF_HASH_ENTPTR(l, h);
568 chunk != CHAIN_END; chunk = le->le_next) {
569 le = ZAP_LEAF_ENTRY(l, chunk);
580 for (chunk = *LEAF_HASH_ENTPTR(l, h);
581 chunk != CHAIN_END; chunk = le->le_next) {
582 le = ZAP_LEAF_ENTRY(l, chunk);
589 if (chunk == CHAIN_END)
604 chunk = zap_leaf_chunk_alloc(l);
605 le = ZAP_LEAF_ENTRY(l, chunk);
619 uint16_t *chunkp = zap_leaf_rehash_entry(l, le, chunk);
653 for (uint16_t chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash);
654 chunk != CHAIN_END; chunk = le->le_next) {
655 le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk);
705 zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl)
710 while (chunk != CHAIN_END) {
715 &ZAP_LEAF_CHUNK(l, chunk).l_array;
718 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
723 zap_leaf_chunk_free(l, chunk);
724 chunk = nextchunk;
738 uint16_t chunk = zap_leaf_chunk_alloc(nl);
739 struct zap_leaf_entry *nle = ZAP_LEAF_ENTRY(nl, chunk);
742 (void) zap_leaf_rehash_entry(nl, nle, chunk);
819 uint_t chunk = zap_leaf_phys(l)->l_hash[i];
821 while (chunk != CHAIN_END) {
823 ZAP_LEAF_ENTRY(l, chunk);
831 chunk = le->le_next;