Lines Matching refs:chunk
30 * chunk number n means l_chunk[n], even though the header precedes it.
46 #define CHAIN_END 0xffff /* end of the chunk chain */
190 int chunk = zap_leaf_phys(l)->l_hdr.lh_freelist;
191 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
192 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE);
195 ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next;
199 return (chunk);
203 zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk)
205 struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free;
207 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
213 zap_leaf_phys(l)->l_hdr.lh_freelist = chunk;
236 uint16_t chunk = zap_leaf_chunk_alloc(l);
237 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
253 *chunkp = chunk;
264 uint16_t chunk = *chunkp;
268 while (chunk != CHAIN_END) {
269 int nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next;
270 ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==,
272 zap_leaf_chunk_free(l, chunk);
273 chunk = nextchunk;
279 zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk,
292 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
306 while (chunk != CHAIN_END) {
308 &ZAP_LEAF_CHUNK(l, chunk).l_array;
311 chunk = la->la_next;
317 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
319 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
332 chunk = la->la_next;
338 int chunk, int array_numints)
347 zap_leaf_array_read(l, chunk, sizeof (*thiskey), array_numints,
359 zap_leaf_array_read(l, chunk, sizeof (char), array_numints,
374 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
376 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
379 chunk = la->la_next;
398 uint16_t chunk = *chunkp;
399 le = ZAP_LEAF_ENTRY(l, chunk);
401 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
445 for (uint16_t chunk = zap_leaf_phys(l)->l_hash[lh];
446 chunk != CHAIN_END; chunk = le->le_next) {
447 le = ZAP_LEAF_ENTRY(l, chunk);
449 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
463 zeh->zeh_fakechunk = chunk;
560 uint16_t chunk;
576 for (chunk = *LEAF_HASH_ENTPTR(l, h);
577 chunk != CHAIN_END; chunk = le->le_next) {
578 le = ZAP_LEAF_ENTRY(l, chunk);
589 for (chunk = *LEAF_HASH_ENTPTR(l, h);
590 chunk != CHAIN_END; chunk = le->le_next) {
591 le = ZAP_LEAF_ENTRY(l, chunk);
598 if (chunk == CHAIN_END)
613 chunk = zap_leaf_chunk_alloc(l);
614 le = ZAP_LEAF_ENTRY(l, chunk);
628 uint16_t *chunkp = zap_leaf_rehash_entry(l, chunk);
662 for (uint16_t chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash);
663 chunk != CHAIN_END; chunk = le->le_next) {
664 le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk);
715 zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl)
720 while (chunk != CHAIN_END) {
725 &ZAP_LEAF_CHUNK(l, chunk).l_array;
728 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
733 zap_leaf_chunk_free(l, chunk);
734 chunk = nextchunk;
748 uint16_t chunk = zap_leaf_chunk_alloc(nl);
749 struct zap_leaf_entry *nle = ZAP_LEAF_ENTRY(nl, chunk);
752 (void) zap_leaf_rehash_entry(nl, chunk);
829 int chunk = zap_leaf_phys(l)->l_hash[i];
831 while (chunk != CHAIN_END) {
833 ZAP_LEAF_ENTRY(l, chunk);
841 chunk = le->le_next;