Lines Matching defs: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;
255 zap_leaf_array_copy(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl)
260 while (chunk != CHAIN_END) {
261 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
265 &ZAP_LEAF_CHUNK(l, chunk).l_array;
272 chunk = la->la_next;
285 zap_leaf_array_free(zap_leaf_t *l, uint16_t chunk)
291 while (chunk != CHAIN_END) {
292 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
293 zap_leaf_chunk_t *c = &ZAP_LEAF_CHUNK(l, chunk);
296 *tailp = chunk;
297 chunk = c->l_array.la_next;
312 zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk,
325 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
339 while (chunk != CHAIN_END) {
341 &ZAP_LEAF_CHUNK(l, chunk).l_array;
344 chunk = la->la_next;
350 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
352 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
365 chunk = la->la_next;
371 uint_t chunk, int array_numints)
380 zap_leaf_array_read(l, chunk, sizeof (*thiskey), array_numints,
392 zap_leaf_array_read(l, chunk, sizeof (char), array_numints,
407 struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array;
409 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
413 chunk = la->la_next;
432 uint16_t chunk = *chunkp;
433 le = ZAP_LEAF_ENTRY(l, chunk);
435 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
479 for (uint16_t chunk = zap_leaf_phys(l)->l_hash[lh];
480 chunk != CHAIN_END; chunk = le->le_next) {
481 le = ZAP_LEAF_ENTRY(l, chunk);
483 ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l));
497 zeh->zeh_fakechunk = chunk;
595 uint16_t chunk;
611 for (chunk = *LEAF_HASH_ENTPTR(l, h);
612 chunk != CHAIN_END; chunk = le->le_next) {
613 le = ZAP_LEAF_ENTRY(l, chunk);
624 for (chunk = *LEAF_HASH_ENTPTR(l, h);
625 chunk != CHAIN_END; chunk = le->le_next) {
626 le = ZAP_LEAF_ENTRY(l, chunk);
633 if (chunk == CHAIN_END)
648 chunk = zap_leaf_chunk_alloc(l);
649 le = ZAP_LEAF_ENTRY(l, chunk);
663 uint16_t *chunkp = zap_leaf_rehash_entry(l, le, chunk);
697 for (uint16_t chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash);
698 chunk != CHAIN_END; chunk = le->le_next) {
699 le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk);
754 uint16_t chunk = zap_leaf_chunk_alloc(nl);
755 struct zap_leaf_entry *nle = ZAP_LEAF_ENTRY(nl, chunk);
758 (void) zap_leaf_rehash_entry(nl, nle, chunk);
837 uint_t chunk = zap_leaf_phys(l)->l_hash[i];
839 while (chunk != CHAIN_END) {
841 ZAP_LEAF_ENTRY(l, chunk);
849 chunk = le->le_next;