]>
Commit | Line | Data |
---|---|---|
34dc7c2f BB |
1 | /* |
2 | * CDDL HEADER START | |
3 | * | |
4 | * The contents of this file are subject to the terms of the | |
5 | * Common Development and Distribution License (the "License"). | |
6 | * You may not use this file except in compliance with the License. | |
7 | * | |
8 | * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE | |
9 | * or http://www.opensolaris.org/os/licensing. | |
10 | * See the License for the specific language governing permissions | |
11 | * and limitations under the License. | |
12 | * | |
13 | * When distributing Covered Code, include this CDDL HEADER in each | |
14 | * file and include the License file at usr/src/OPENSOLARIS.LICENSE. | |
15 | * If applicable, add the following below this CDDL HEADER, with the | |
16 | * fields enclosed by brackets "[]" replaced with your own identifying | |
17 | * information: Portions Copyright [yyyy] [name of copyright owner] | |
18 | * | |
19 | * CDDL HEADER END | |
20 | */ | |
21 | /* | |
428870ff | 22 | * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved. |
34dc7c2f BB |
23 | */ |
24 | ||
34dc7c2f BB |
25 | /* |
26 | * This file contains the top half of the zfs directory structure | |
27 | * implementation. The bottom half is in zap_leaf.c. | |
28 | * | |
29 | * The zdir is an extendable hash data structure. There is a table of | |
30 | * pointers to buckets (zap_t->zd_data->zd_leafs). The buckets are | |
31 | * each a constant size and hold a variable number of directory entries. | |
32 | * The buckets (aka "leaf nodes") are implemented in zap_leaf.c. | |
33 | * | |
34 | * The pointer table holds a power of 2 number of pointers. | |
35 | * (1<<zap_t->zd_data->zd_phys->zd_prefix_len). The bucket pointed to | |
36 | * by the pointer at index i in the table holds entries whose hash value | |
37 | * has a zd_prefix_len - bit prefix | |
38 | */ | |
39 | ||
40 | #include <sys/spa.h> | |
41 | #include <sys/dmu.h> | |
42 | #include <sys/zfs_context.h> | |
43 | #include <sys/zfs_znode.h> | |
9babb374 | 44 | #include <sys/fs/zfs.h> |
34dc7c2f BB |
45 | #include <sys/zap.h> |
46 | #include <sys/refcount.h> | |
47 | #include <sys/zap_impl.h> | |
48 | #include <sys/zap_leaf.h> | |
49 | ||
50 | int fzap_default_block_shift = 14; /* 16k blocksize */ | |
51 | ||
52 | static void zap_leaf_pageout(dmu_buf_t *db, void *vl); | |
53 | static uint64_t zap_allocate_blocks(zap_t *zap, int nblocks); | |
54 | ||
55 | ||
56 | void | |
57 | fzap_byteswap(void *vbuf, size_t size) | |
58 | { | |
59 | uint64_t block_type; | |
60 | ||
61 | block_type = *(uint64_t *)vbuf; | |
62 | ||
63 | if (block_type == ZBT_LEAF || block_type == BSWAP_64(ZBT_LEAF)) | |
64 | zap_leaf_byteswap(vbuf, size); | |
65 | else { | |
66 | /* it's a ptrtbl block */ | |
67 | byteswap_uint64_array(vbuf, size); | |
68 | } | |
69 | } | |
70 | ||
71 | void | |
428870ff | 72 | fzap_upgrade(zap_t *zap, dmu_tx_t *tx, zap_flags_t flags) |
34dc7c2f BB |
73 | { |
74 | dmu_buf_t *db; | |
75 | zap_leaf_t *l; | |
76 | int i; | |
77 | zap_phys_t *zp; | |
78 | ||
79 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
80 | zap->zap_ismicro = FALSE; | |
81 | ||
82 | (void) dmu_buf_update_user(zap->zap_dbuf, zap, zap, | |
83 | &zap->zap_f.zap_phys, zap_evict); | |
84 | ||
85 | mutex_init(&zap->zap_f.zap_num_entries_mtx, 0, 0, 0); | |
86 | zap->zap_f.zap_block_shift = highbit(zap->zap_dbuf->db_size) - 1; | |
87 | ||
88 | zp = zap->zap_f.zap_phys; | |
89 | /* | |
90 | * explicitly zero it since it might be coming from an | |
91 | * initialized microzap | |
92 | */ | |
93 | bzero(zap->zap_dbuf->db_data, zap->zap_dbuf->db_size); | |
94 | zp->zap_block_type = ZBT_HEADER; | |
95 | zp->zap_magic = ZAP_MAGIC; | |
96 | ||
97 | zp->zap_ptrtbl.zt_shift = ZAP_EMBEDDED_PTRTBL_SHIFT(zap); | |
98 | ||
99 | zp->zap_freeblk = 2; /* block 1 will be the first leaf */ | |
100 | zp->zap_num_leafs = 1; | |
101 | zp->zap_num_entries = 0; | |
102 | zp->zap_salt = zap->zap_salt; | |
103 | zp->zap_normflags = zap->zap_normflags; | |
428870ff | 104 | zp->zap_flags = flags; |
34dc7c2f BB |
105 | |
106 | /* block 1 will be the first leaf */ | |
107 | for (i = 0; i < (1<<zp->zap_ptrtbl.zt_shift); i++) | |
108 | ZAP_EMBEDDED_PTRTBL_ENT(zap, i) = 1; | |
109 | ||
110 | /* | |
111 | * set up block 1 - the first leaf | |
112 | */ | |
113 | VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 114 | 1<<FZAP_BLOCK_SHIFT(zap), FTAG, &db, DMU_READ_NO_PREFETCH)); |
34dc7c2f BB |
115 | dmu_buf_will_dirty(db, tx); |
116 | ||
b8d06fca | 117 | l = kmem_zalloc(sizeof (zap_leaf_t), KM_PUSHPAGE); |
34dc7c2f BB |
118 | l->l_dbuf = db; |
119 | l->l_phys = db->db_data; | |
120 | ||
121 | zap_leaf_init(l, zp->zap_normflags != 0); | |
122 | ||
123 | kmem_free(l, sizeof (zap_leaf_t)); | |
124 | dmu_buf_rele(db, FTAG); | |
125 | } | |
126 | ||
127 | static int | |
128 | zap_tryupgradedir(zap_t *zap, dmu_tx_t *tx) | |
129 | { | |
130 | if (RW_WRITE_HELD(&zap->zap_rwlock)) | |
131 | return (1); | |
132 | if (rw_tryupgrade(&zap->zap_rwlock)) { | |
133 | dmu_buf_will_dirty(zap->zap_dbuf, tx); | |
134 | return (1); | |
135 | } | |
136 | return (0); | |
137 | } | |
138 | ||
139 | /* | |
140 | * Generic routines for dealing with the pointer & cookie tables. | |
141 | */ | |
142 | ||
143 | static int | |
144 | zap_table_grow(zap_t *zap, zap_table_phys_t *tbl, | |
145 | void (*transfer_func)(const uint64_t *src, uint64_t *dst, int n), | |
146 | dmu_tx_t *tx) | |
147 | { | |
148 | uint64_t b, newblk; | |
149 | dmu_buf_t *db_old, *db_new; | |
150 | int err; | |
151 | int bs = FZAP_BLOCK_SHIFT(zap); | |
152 | int hepb = 1<<(bs-4); | |
153 | /* hepb = half the number of entries in a block */ | |
154 | ||
155 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
156 | ASSERT(tbl->zt_blk != 0); | |
157 | ASSERT(tbl->zt_numblks > 0); | |
158 | ||
159 | if (tbl->zt_nextblk != 0) { | |
160 | newblk = tbl->zt_nextblk; | |
161 | } else { | |
162 | newblk = zap_allocate_blocks(zap, tbl->zt_numblks * 2); | |
163 | tbl->zt_nextblk = newblk; | |
164 | ASSERT3U(tbl->zt_blks_copied, ==, 0); | |
165 | dmu_prefetch(zap->zap_objset, zap->zap_object, | |
166 | tbl->zt_blk << bs, tbl->zt_numblks << bs); | |
167 | } | |
168 | ||
169 | /* | |
170 | * Copy the ptrtbl from the old to new location. | |
171 | */ | |
172 | ||
173 | b = tbl->zt_blks_copied; | |
174 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 175 | (tbl->zt_blk + b) << bs, FTAG, &db_old, DMU_READ_NO_PREFETCH); |
34dc7c2f BB |
176 | if (err) |
177 | return (err); | |
178 | ||
179 | /* first half of entries in old[b] go to new[2*b+0] */ | |
180 | VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 181 | (newblk + 2*b+0) << bs, FTAG, &db_new, DMU_READ_NO_PREFETCH)); |
34dc7c2f BB |
182 | dmu_buf_will_dirty(db_new, tx); |
183 | transfer_func(db_old->db_data, db_new->db_data, hepb); | |
184 | dmu_buf_rele(db_new, FTAG); | |
185 | ||
186 | /* second half of entries in old[b] go to new[2*b+1] */ | |
187 | VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 188 | (newblk + 2*b+1) << bs, FTAG, &db_new, DMU_READ_NO_PREFETCH)); |
34dc7c2f BB |
189 | dmu_buf_will_dirty(db_new, tx); |
190 | transfer_func((uint64_t *)db_old->db_data + hepb, | |
191 | db_new->db_data, hepb); | |
192 | dmu_buf_rele(db_new, FTAG); | |
193 | ||
194 | dmu_buf_rele(db_old, FTAG); | |
195 | ||
196 | tbl->zt_blks_copied++; | |
197 | ||
198 | dprintf("copied block %llu of %llu\n", | |
199 | tbl->zt_blks_copied, tbl->zt_numblks); | |
200 | ||
201 | if (tbl->zt_blks_copied == tbl->zt_numblks) { | |
202 | (void) dmu_free_range(zap->zap_objset, zap->zap_object, | |
203 | tbl->zt_blk << bs, tbl->zt_numblks << bs, tx); | |
204 | ||
205 | tbl->zt_blk = newblk; | |
206 | tbl->zt_numblks *= 2; | |
207 | tbl->zt_shift++; | |
208 | tbl->zt_nextblk = 0; | |
209 | tbl->zt_blks_copied = 0; | |
210 | ||
211 | dprintf("finished; numblocks now %llu (%lluk entries)\n", | |
212 | tbl->zt_numblks, 1<<(tbl->zt_shift-10)); | |
213 | } | |
214 | ||
215 | return (0); | |
216 | } | |
217 | ||
218 | static int | |
219 | zap_table_store(zap_t *zap, zap_table_phys_t *tbl, uint64_t idx, uint64_t val, | |
220 | dmu_tx_t *tx) | |
221 | { | |
222 | int err; | |
223 | uint64_t blk, off; | |
224 | int bs = FZAP_BLOCK_SHIFT(zap); | |
225 | dmu_buf_t *db; | |
226 | ||
227 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
228 | ASSERT(tbl->zt_blk != 0); | |
229 | ||
230 | dprintf("storing %llx at index %llx\n", val, idx); | |
231 | ||
232 | blk = idx >> (bs-3); | |
233 | off = idx & ((1<<(bs-3))-1); | |
234 | ||
235 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 236 | (tbl->zt_blk + blk) << bs, FTAG, &db, DMU_READ_NO_PREFETCH); |
34dc7c2f BB |
237 | if (err) |
238 | return (err); | |
239 | dmu_buf_will_dirty(db, tx); | |
240 | ||
241 | if (tbl->zt_nextblk != 0) { | |
242 | uint64_t idx2 = idx * 2; | |
243 | uint64_t blk2 = idx2 >> (bs-3); | |
244 | uint64_t off2 = idx2 & ((1<<(bs-3))-1); | |
245 | dmu_buf_t *db2; | |
246 | ||
247 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff BB |
248 | (tbl->zt_nextblk + blk2) << bs, FTAG, &db2, |
249 | DMU_READ_NO_PREFETCH); | |
34dc7c2f BB |
250 | if (err) { |
251 | dmu_buf_rele(db, FTAG); | |
252 | return (err); | |
253 | } | |
254 | dmu_buf_will_dirty(db2, tx); | |
255 | ((uint64_t *)db2->db_data)[off2] = val; | |
256 | ((uint64_t *)db2->db_data)[off2+1] = val; | |
257 | dmu_buf_rele(db2, FTAG); | |
258 | } | |
259 | ||
260 | ((uint64_t *)db->db_data)[off] = val; | |
261 | dmu_buf_rele(db, FTAG); | |
262 | ||
263 | return (0); | |
264 | } | |
265 | ||
266 | static int | |
267 | zap_table_load(zap_t *zap, zap_table_phys_t *tbl, uint64_t idx, uint64_t *valp) | |
268 | { | |
269 | uint64_t blk, off; | |
270 | int err; | |
271 | dmu_buf_t *db; | |
272 | int bs = FZAP_BLOCK_SHIFT(zap); | |
273 | ||
274 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
275 | ||
276 | blk = idx >> (bs-3); | |
277 | off = idx & ((1<<(bs-3))-1); | |
278 | ||
279 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 280 | (tbl->zt_blk + blk) << bs, FTAG, &db, DMU_READ_NO_PREFETCH); |
34dc7c2f BB |
281 | if (err) |
282 | return (err); | |
283 | *valp = ((uint64_t *)db->db_data)[off]; | |
284 | dmu_buf_rele(db, FTAG); | |
285 | ||
286 | if (tbl->zt_nextblk != 0) { | |
287 | /* | |
288 | * read the nextblk for the sake of i/o error checking, | |
289 | * so that zap_table_load() will catch errors for | |
290 | * zap_table_store. | |
291 | */ | |
292 | blk = (idx*2) >> (bs-3); | |
293 | ||
294 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff BB |
295 | (tbl->zt_nextblk + blk) << bs, FTAG, &db, |
296 | DMU_READ_NO_PREFETCH); | |
34dc7c2f BB |
297 | dmu_buf_rele(db, FTAG); |
298 | } | |
299 | return (err); | |
300 | } | |
301 | ||
302 | /* | |
303 | * Routines for growing the ptrtbl. | |
304 | */ | |
305 | ||
306 | static void | |
307 | zap_ptrtbl_transfer(const uint64_t *src, uint64_t *dst, int n) | |
308 | { | |
309 | int i; | |
310 | for (i = 0; i < n; i++) { | |
311 | uint64_t lb = src[i]; | |
312 | dst[2*i+0] = lb; | |
313 | dst[2*i+1] = lb; | |
314 | } | |
315 | } | |
316 | ||
317 | static int | |
318 | zap_grow_ptrtbl(zap_t *zap, dmu_tx_t *tx) | |
319 | { | |
428870ff BB |
320 | /* |
321 | * The pointer table should never use more hash bits than we | |
322 | * have (otherwise we'd be using useless zero bits to index it). | |
323 | * If we are within 2 bits of running out, stop growing, since | |
324 | * this is already an aberrant condition. | |
325 | */ | |
326 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_shift >= zap_hashbits(zap) - 2) | |
34dc7c2f BB |
327 | return (ENOSPC); |
328 | ||
329 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) { | |
330 | /* | |
331 | * We are outgrowing the "embedded" ptrtbl (the one | |
332 | * stored in the header block). Give it its own entire | |
333 | * block, which will double the size of the ptrtbl. | |
334 | */ | |
335 | uint64_t newblk; | |
336 | dmu_buf_t *db_new; | |
337 | int err; | |
338 | ||
339 | ASSERT3U(zap->zap_f.zap_phys->zap_ptrtbl.zt_shift, ==, | |
340 | ZAP_EMBEDDED_PTRTBL_SHIFT(zap)); | |
341 | ASSERT3U(zap->zap_f.zap_phys->zap_ptrtbl.zt_blk, ==, 0); | |
342 | ||
343 | newblk = zap_allocate_blocks(zap, 1); | |
344 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff BB |
345 | newblk << FZAP_BLOCK_SHIFT(zap), FTAG, &db_new, |
346 | DMU_READ_NO_PREFETCH); | |
34dc7c2f BB |
347 | if (err) |
348 | return (err); | |
349 | dmu_buf_will_dirty(db_new, tx); | |
350 | zap_ptrtbl_transfer(&ZAP_EMBEDDED_PTRTBL_ENT(zap, 0), | |
351 | db_new->db_data, 1 << ZAP_EMBEDDED_PTRTBL_SHIFT(zap)); | |
352 | dmu_buf_rele(db_new, FTAG); | |
353 | ||
354 | zap->zap_f.zap_phys->zap_ptrtbl.zt_blk = newblk; | |
355 | zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks = 1; | |
356 | zap->zap_f.zap_phys->zap_ptrtbl.zt_shift++; | |
357 | ||
358 | ASSERT3U(1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift, ==, | |
359 | zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks << | |
360 | (FZAP_BLOCK_SHIFT(zap)-3)); | |
361 | ||
362 | return (0); | |
363 | } else { | |
364 | return (zap_table_grow(zap, &zap->zap_f.zap_phys->zap_ptrtbl, | |
365 | zap_ptrtbl_transfer, tx)); | |
366 | } | |
367 | } | |
368 | ||
369 | static void | |
370 | zap_increment_num_entries(zap_t *zap, int delta, dmu_tx_t *tx) | |
371 | { | |
372 | dmu_buf_will_dirty(zap->zap_dbuf, tx); | |
373 | mutex_enter(&zap->zap_f.zap_num_entries_mtx); | |
374 | ASSERT(delta > 0 || zap->zap_f.zap_phys->zap_num_entries >= -delta); | |
375 | zap->zap_f.zap_phys->zap_num_entries += delta; | |
376 | mutex_exit(&zap->zap_f.zap_num_entries_mtx); | |
377 | } | |
378 | ||
379 | static uint64_t | |
380 | zap_allocate_blocks(zap_t *zap, int nblocks) | |
381 | { | |
382 | uint64_t newblk; | |
383 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
384 | newblk = zap->zap_f.zap_phys->zap_freeblk; | |
385 | zap->zap_f.zap_phys->zap_freeblk += nblocks; | |
386 | return (newblk); | |
387 | } | |
388 | ||
389 | static zap_leaf_t * | |
390 | zap_create_leaf(zap_t *zap, dmu_tx_t *tx) | |
391 | { | |
392 | void *winner; | |
b8d06fca | 393 | zap_leaf_t *l = kmem_alloc(sizeof (zap_leaf_t), KM_PUSHPAGE); |
34dc7c2f BB |
394 | |
395 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
396 | ||
ef5319df | 397 | rw_init(&l->l_rwlock, NULL, RW_DEFAULT, NULL); |
34dc7c2f BB |
398 | rw_enter(&l->l_rwlock, RW_WRITER); |
399 | l->l_blkid = zap_allocate_blocks(zap, 1); | |
400 | l->l_dbuf = NULL; | |
401 | l->l_phys = NULL; | |
402 | ||
403 | VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff BB |
404 | l->l_blkid << FZAP_BLOCK_SHIFT(zap), NULL, &l->l_dbuf, |
405 | DMU_READ_NO_PREFETCH)); | |
34dc7c2f BB |
406 | winner = dmu_buf_set_user(l->l_dbuf, l, &l->l_phys, zap_leaf_pageout); |
407 | ASSERT(winner == NULL); | |
408 | dmu_buf_will_dirty(l->l_dbuf, tx); | |
409 | ||
410 | zap_leaf_init(l, zap->zap_normflags != 0); | |
411 | ||
412 | zap->zap_f.zap_phys->zap_num_leafs++; | |
413 | ||
414 | return (l); | |
415 | } | |
416 | ||
417 | int | |
418 | fzap_count(zap_t *zap, uint64_t *count) | |
419 | { | |
420 | ASSERT(!zap->zap_ismicro); | |
421 | mutex_enter(&zap->zap_f.zap_num_entries_mtx); /* unnecessary */ | |
422 | *count = zap->zap_f.zap_phys->zap_num_entries; | |
423 | mutex_exit(&zap->zap_f.zap_num_entries_mtx); | |
424 | return (0); | |
425 | } | |
426 | ||
427 | /* | |
428 | * Routines for obtaining zap_leaf_t's | |
429 | */ | |
430 | ||
431 | void | |
432 | zap_put_leaf(zap_leaf_t *l) | |
433 | { | |
434 | rw_exit(&l->l_rwlock); | |
435 | dmu_buf_rele(l->l_dbuf, NULL); | |
436 | } | |
437 | ||
438 | _NOTE(ARGSUSED(0)) | |
439 | static void | |
440 | zap_leaf_pageout(dmu_buf_t *db, void *vl) | |
441 | { | |
442 | zap_leaf_t *l = vl; | |
443 | ||
444 | rw_destroy(&l->l_rwlock); | |
445 | kmem_free(l, sizeof (zap_leaf_t)); | |
446 | } | |
447 | ||
448 | static zap_leaf_t * | |
449 | zap_open_leaf(uint64_t blkid, dmu_buf_t *db) | |
450 | { | |
451 | zap_leaf_t *l, *winner; | |
452 | ||
453 | ASSERT(blkid != 0); | |
454 | ||
b8d06fca | 455 | l = kmem_alloc(sizeof (zap_leaf_t), KM_PUSHPAGE); |
ef5319df | 456 | rw_init(&l->l_rwlock, NULL, RW_DEFAULT, NULL); |
34dc7c2f BB |
457 | rw_enter(&l->l_rwlock, RW_WRITER); |
458 | l->l_blkid = blkid; | |
459 | l->l_bs = highbit(db->db_size)-1; | |
460 | l->l_dbuf = db; | |
461 | l->l_phys = NULL; | |
462 | ||
463 | winner = dmu_buf_set_user(db, l, &l->l_phys, zap_leaf_pageout); | |
464 | ||
465 | rw_exit(&l->l_rwlock); | |
466 | if (winner != NULL) { | |
467 | /* someone else set it first */ | |
468 | zap_leaf_pageout(NULL, l); | |
469 | l = winner; | |
470 | } | |
471 | ||
472 | /* | |
473 | * lhr_pad was previously used for the next leaf in the leaf | |
474 | * chain. There should be no chained leafs (as we have removed | |
475 | * support for them). | |
476 | */ | |
477 | ASSERT3U(l->l_phys->l_hdr.lh_pad1, ==, 0); | |
478 | ||
479 | /* | |
480 | * There should be more hash entries than there can be | |
481 | * chunks to put in the hash table | |
482 | */ | |
483 | ASSERT3U(ZAP_LEAF_HASH_NUMENTRIES(l), >, ZAP_LEAF_NUMCHUNKS(l) / 3); | |
484 | ||
485 | /* The chunks should begin at the end of the hash table */ | |
b8864a23 | 486 | ASSERT3P(&ZAP_LEAF_CHUNK(l, 0), ==, (zap_leaf_chunk_t *) |
34dc7c2f BB |
487 | &l->l_phys->l_hash[ZAP_LEAF_HASH_NUMENTRIES(l)]); |
488 | ||
489 | /* The chunks should end at the end of the block */ | |
490 | ASSERT3U((uintptr_t)&ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)) - | |
491 | (uintptr_t)l->l_phys, ==, l->l_dbuf->db_size); | |
492 | ||
493 | return (l); | |
494 | } | |
495 | ||
496 | static int | |
497 | zap_get_leaf_byblk(zap_t *zap, uint64_t blkid, dmu_tx_t *tx, krw_t lt, | |
498 | zap_leaf_t **lp) | |
499 | { | |
500 | dmu_buf_t *db; | |
501 | zap_leaf_t *l; | |
502 | int bs = FZAP_BLOCK_SHIFT(zap); | |
503 | int err; | |
504 | ||
505 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
506 | ||
507 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
428870ff | 508 | blkid << bs, NULL, &db, DMU_READ_NO_PREFETCH); |
34dc7c2f BB |
509 | if (err) |
510 | return (err); | |
511 | ||
512 | ASSERT3U(db->db_object, ==, zap->zap_object); | |
513 | ASSERT3U(db->db_offset, ==, blkid << bs); | |
514 | ASSERT3U(db->db_size, ==, 1 << bs); | |
515 | ASSERT(blkid != 0); | |
516 | ||
517 | l = dmu_buf_get_user(db); | |
518 | ||
519 | if (l == NULL) | |
520 | l = zap_open_leaf(blkid, db); | |
521 | ||
522 | rw_enter(&l->l_rwlock, lt); | |
523 | /* | |
524 | * Must lock before dirtying, otherwise l->l_phys could change, | |
525 | * causing ASSERT below to fail. | |
526 | */ | |
527 | if (lt == RW_WRITER) | |
528 | dmu_buf_will_dirty(db, tx); | |
529 | ASSERT3U(l->l_blkid, ==, blkid); | |
530 | ASSERT3P(l->l_dbuf, ==, db); | |
531 | ASSERT3P(l->l_phys, ==, l->l_dbuf->db_data); | |
532 | ASSERT3U(l->l_phys->l_hdr.lh_block_type, ==, ZBT_LEAF); | |
533 | ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); | |
534 | ||
535 | *lp = l; | |
536 | return (0); | |
537 | } | |
538 | ||
539 | static int | |
540 | zap_idx_to_blk(zap_t *zap, uint64_t idx, uint64_t *valp) | |
541 | { | |
542 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
543 | ||
544 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) { | |
545 | ASSERT3U(idx, <, | |
546 | (1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift)); | |
547 | *valp = ZAP_EMBEDDED_PTRTBL_ENT(zap, idx); | |
548 | return (0); | |
549 | } else { | |
550 | return (zap_table_load(zap, &zap->zap_f.zap_phys->zap_ptrtbl, | |
551 | idx, valp)); | |
552 | } | |
553 | } | |
554 | ||
555 | static int | |
556 | zap_set_idx_to_blk(zap_t *zap, uint64_t idx, uint64_t blk, dmu_tx_t *tx) | |
557 | { | |
558 | ASSERT(tx != NULL); | |
559 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
560 | ||
561 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk == 0) { | |
562 | ZAP_EMBEDDED_PTRTBL_ENT(zap, idx) = blk; | |
563 | return (0); | |
564 | } else { | |
565 | return (zap_table_store(zap, &zap->zap_f.zap_phys->zap_ptrtbl, | |
566 | idx, blk, tx)); | |
567 | } | |
568 | } | |
569 | ||
570 | static int | |
571 | zap_deref_leaf(zap_t *zap, uint64_t h, dmu_tx_t *tx, krw_t lt, zap_leaf_t **lp) | |
572 | { | |
573 | uint64_t idx, blk; | |
574 | int err; | |
575 | ||
576 | ASSERT(zap->zap_dbuf == NULL || | |
577 | zap->zap_f.zap_phys == zap->zap_dbuf->db_data); | |
578 | ASSERT3U(zap->zap_f.zap_phys->zap_magic, ==, ZAP_MAGIC); | |
579 | idx = ZAP_HASH_IDX(h, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift); | |
580 | err = zap_idx_to_blk(zap, idx, &blk); | |
581 | if (err != 0) | |
582 | return (err); | |
583 | err = zap_get_leaf_byblk(zap, blk, tx, lt, lp); | |
584 | ||
585 | ASSERT(err || ZAP_HASH_IDX(h, (*lp)->l_phys->l_hdr.lh_prefix_len) == | |
586 | (*lp)->l_phys->l_hdr.lh_prefix); | |
587 | return (err); | |
588 | } | |
589 | ||
590 | static int | |
591 | zap_expand_leaf(zap_name_t *zn, zap_leaf_t *l, dmu_tx_t *tx, zap_leaf_t **lp) | |
592 | { | |
593 | zap_t *zap = zn->zn_zap; | |
594 | uint64_t hash = zn->zn_hash; | |
595 | zap_leaf_t *nl; | |
596 | int prefix_diff, i, err; | |
597 | uint64_t sibling; | |
598 | int old_prefix_len = l->l_phys->l_hdr.lh_prefix_len; | |
599 | ||
600 | ASSERT3U(old_prefix_len, <=, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift); | |
601 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
602 | ||
603 | ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_len), ==, | |
604 | l->l_phys->l_hdr.lh_prefix); | |
605 | ||
606 | if (zap_tryupgradedir(zap, tx) == 0 || | |
607 | old_prefix_len == zap->zap_f.zap_phys->zap_ptrtbl.zt_shift) { | |
608 | /* We failed to upgrade, or need to grow the pointer table */ | |
609 | objset_t *os = zap->zap_objset; | |
610 | uint64_t object = zap->zap_object; | |
611 | ||
612 | zap_put_leaf(l); | |
613 | zap_unlockdir(zap); | |
614 | err = zap_lockdir(os, object, tx, RW_WRITER, | |
615 | FALSE, FALSE, &zn->zn_zap); | |
616 | zap = zn->zn_zap; | |
617 | if (err) | |
618 | return (err); | |
619 | ASSERT(!zap->zap_ismicro); | |
620 | ||
621 | while (old_prefix_len == | |
622 | zap->zap_f.zap_phys->zap_ptrtbl.zt_shift) { | |
623 | err = zap_grow_ptrtbl(zap, tx); | |
624 | if (err) | |
625 | return (err); | |
626 | } | |
627 | ||
628 | err = zap_deref_leaf(zap, hash, tx, RW_WRITER, &l); | |
629 | if (err) | |
630 | return (err); | |
631 | ||
632 | if (l->l_phys->l_hdr.lh_prefix_len != old_prefix_len) { | |
633 | /* it split while our locks were down */ | |
634 | *lp = l; | |
635 | return (0); | |
636 | } | |
637 | } | |
638 | ASSERT(RW_WRITE_HELD(&zap->zap_rwlock)); | |
639 | ASSERT3U(old_prefix_len, <, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift); | |
640 | ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_len), ==, | |
641 | l->l_phys->l_hdr.lh_prefix); | |
642 | ||
643 | prefix_diff = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift - | |
644 | (old_prefix_len + 1); | |
645 | sibling = (ZAP_HASH_IDX(hash, old_prefix_len + 1) | 1) << prefix_diff; | |
646 | ||
647 | /* check for i/o errors before doing zap_leaf_split */ | |
648 | for (i = 0; i < (1ULL<<prefix_diff); i++) { | |
649 | uint64_t blk; | |
650 | err = zap_idx_to_blk(zap, sibling+i, &blk); | |
651 | if (err) | |
652 | return (err); | |
653 | ASSERT3U(blk, ==, l->l_blkid); | |
654 | } | |
655 | ||
656 | nl = zap_create_leaf(zap, tx); | |
657 | zap_leaf_split(l, nl, zap->zap_normflags != 0); | |
658 | ||
659 | /* set sibling pointers */ | |
660 | for (i = 0; i < (1ULL<<prefix_diff); i++) { | |
661 | err = zap_set_idx_to_blk(zap, sibling+i, nl->l_blkid, tx); | |
662 | ASSERT3U(err, ==, 0); /* we checked for i/o errors above */ | |
663 | } | |
664 | ||
665 | if (hash & (1ULL << (64 - l->l_phys->l_hdr.lh_prefix_len))) { | |
666 | /* we want the sibling */ | |
667 | zap_put_leaf(l); | |
668 | *lp = nl; | |
669 | } else { | |
670 | zap_put_leaf(nl); | |
671 | *lp = l; | |
672 | } | |
673 | ||
674 | return (0); | |
675 | } | |
676 | ||
677 | static void | |
678 | zap_put_leaf_maybe_grow_ptrtbl(zap_name_t *zn, zap_leaf_t *l, dmu_tx_t *tx) | |
679 | { | |
680 | zap_t *zap = zn->zn_zap; | |
681 | int shift = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift; | |
682 | int leaffull = (l->l_phys->l_hdr.lh_prefix_len == shift && | |
683 | l->l_phys->l_hdr.lh_nfree < ZAP_LEAF_LOW_WATER); | |
684 | ||
685 | zap_put_leaf(l); | |
686 | ||
687 | if (leaffull || zap->zap_f.zap_phys->zap_ptrtbl.zt_nextblk) { | |
688 | int err; | |
689 | ||
690 | /* | |
691 | * We are in the middle of growing the pointer table, or | |
692 | * this leaf will soon make us grow it. | |
693 | */ | |
694 | if (zap_tryupgradedir(zap, tx) == 0) { | |
695 | objset_t *os = zap->zap_objset; | |
696 | uint64_t zapobj = zap->zap_object; | |
697 | ||
698 | zap_unlockdir(zap); | |
699 | err = zap_lockdir(os, zapobj, tx, | |
700 | RW_WRITER, FALSE, FALSE, &zn->zn_zap); | |
701 | zap = zn->zn_zap; | |
702 | if (err) | |
703 | return; | |
704 | } | |
705 | ||
706 | /* could have finished growing while our locks were down */ | |
707 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_shift == shift) | |
708 | (void) zap_grow_ptrtbl(zap, tx); | |
709 | } | |
710 | } | |
711 | ||
34dc7c2f | 712 | static int |
428870ff | 713 | fzap_checkname(zap_name_t *zn) |
34dc7c2f | 714 | { |
428870ff BB |
715 | if (zn->zn_key_orig_numints * zn->zn_key_intlen > ZAP_MAXNAMELEN) |
716 | return (ENAMETOOLONG); | |
717 | return (0); | |
718 | } | |
34dc7c2f | 719 | |
428870ff BB |
720 | static int |
721 | fzap_checksize(uint64_t integer_size, uint64_t num_integers) | |
722 | { | |
34dc7c2f BB |
723 | /* Only integer sizes supported by C */ |
724 | switch (integer_size) { | |
725 | case 1: | |
726 | case 2: | |
727 | case 4: | |
728 | case 8: | |
729 | break; | |
730 | default: | |
731 | return (EINVAL); | |
732 | } | |
733 | ||
734 | if (integer_size * num_integers > ZAP_MAXVALUELEN) | |
735 | return (E2BIG); | |
736 | ||
737 | return (0); | |
738 | } | |
739 | ||
428870ff BB |
740 | static int |
741 | fzap_check(zap_name_t *zn, uint64_t integer_size, uint64_t num_integers) | |
742 | { | |
743 | int err; | |
744 | ||
745 | if ((err = fzap_checkname(zn)) != 0) | |
746 | return (err); | |
747 | return (fzap_checksize(integer_size, num_integers)); | |
748 | } | |
749 | ||
34dc7c2f BB |
750 | /* |
751 | * Routines for manipulating attributes. | |
752 | */ | |
753 | int | |
754 | fzap_lookup(zap_name_t *zn, | |
755 | uint64_t integer_size, uint64_t num_integers, void *buf, | |
756 | char *realname, int rn_len, boolean_t *ncp) | |
757 | { | |
758 | zap_leaf_t *l; | |
759 | int err; | |
760 | zap_entry_handle_t zeh; | |
761 | ||
428870ff | 762 | if ((err = fzap_checkname(zn)) != 0) |
34dc7c2f BB |
763 | return (err); |
764 | ||
765 | err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, NULL, RW_READER, &l); | |
766 | if (err != 0) | |
767 | return (err); | |
768 | err = zap_leaf_lookup(l, zn, &zeh); | |
769 | if (err == 0) { | |
428870ff BB |
770 | if ((err = fzap_checksize(integer_size, num_integers)) != 0) { |
771 | zap_put_leaf(l); | |
772 | return (err); | |
773 | } | |
774 | ||
34dc7c2f | 775 | err = zap_entry_read(&zeh, integer_size, num_integers, buf); |
428870ff | 776 | (void) zap_entry_read_name(zn->zn_zap, &zeh, rn_len, realname); |
34dc7c2f BB |
777 | if (ncp) { |
778 | *ncp = zap_entry_normalization_conflict(&zeh, | |
779 | zn, NULL, zn->zn_zap); | |
780 | } | |
781 | } | |
782 | ||
783 | zap_put_leaf(l); | |
784 | return (err); | |
785 | } | |
786 | ||
787 | int | |
788 | fzap_add_cd(zap_name_t *zn, | |
789 | uint64_t integer_size, uint64_t num_integers, | |
790 | const void *val, uint32_t cd, dmu_tx_t *tx) | |
791 | { | |
792 | zap_leaf_t *l; | |
793 | int err; | |
794 | zap_entry_handle_t zeh; | |
795 | zap_t *zap = zn->zn_zap; | |
796 | ||
797 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
798 | ASSERT(!zap->zap_ismicro); | |
428870ff | 799 | ASSERT(fzap_check(zn, integer_size, num_integers) == 0); |
34dc7c2f BB |
800 | |
801 | err = zap_deref_leaf(zap, zn->zn_hash, tx, RW_WRITER, &l); | |
802 | if (err != 0) | |
803 | return (err); | |
804 | retry: | |
805 | err = zap_leaf_lookup(l, zn, &zeh); | |
806 | if (err == 0) { | |
807 | err = EEXIST; | |
808 | goto out; | |
809 | } | |
810 | if (err != ENOENT) | |
811 | goto out; | |
812 | ||
428870ff | 813 | err = zap_entry_create(l, zn, cd, |
34dc7c2f BB |
814 | integer_size, num_integers, val, &zeh); |
815 | ||
816 | if (err == 0) { | |
817 | zap_increment_num_entries(zap, 1, tx); | |
818 | } else if (err == EAGAIN) { | |
819 | err = zap_expand_leaf(zn, l, tx, &l); | |
820 | zap = zn->zn_zap; /* zap_expand_leaf() may change zap */ | |
821 | if (err == 0) | |
822 | goto retry; | |
823 | } | |
824 | ||
825 | out: | |
826 | if (zap != NULL) | |
827 | zap_put_leaf_maybe_grow_ptrtbl(zn, l, tx); | |
828 | return (err); | |
829 | } | |
830 | ||
831 | int | |
832 | fzap_add(zap_name_t *zn, | |
833 | uint64_t integer_size, uint64_t num_integers, | |
834 | const void *val, dmu_tx_t *tx) | |
835 | { | |
428870ff | 836 | int err = fzap_check(zn, integer_size, num_integers); |
34dc7c2f BB |
837 | if (err != 0) |
838 | return (err); | |
839 | ||
840 | return (fzap_add_cd(zn, integer_size, num_integers, | |
428870ff | 841 | val, ZAP_NEED_CD, tx)); |
34dc7c2f BB |
842 | } |
843 | ||
844 | int | |
845 | fzap_update(zap_name_t *zn, | |
846 | int integer_size, uint64_t num_integers, const void *val, dmu_tx_t *tx) | |
847 | { | |
848 | zap_leaf_t *l; | |
849 | int err, create; | |
850 | zap_entry_handle_t zeh; | |
851 | zap_t *zap = zn->zn_zap; | |
852 | ||
853 | ASSERT(RW_LOCK_HELD(&zap->zap_rwlock)); | |
428870ff | 854 | err = fzap_check(zn, integer_size, num_integers); |
34dc7c2f BB |
855 | if (err != 0) |
856 | return (err); | |
857 | ||
858 | err = zap_deref_leaf(zap, zn->zn_hash, tx, RW_WRITER, &l); | |
859 | if (err != 0) | |
860 | return (err); | |
861 | retry: | |
862 | err = zap_leaf_lookup(l, zn, &zeh); | |
863 | create = (err == ENOENT); | |
864 | ASSERT(err == 0 || err == ENOENT); | |
865 | ||
866 | if (create) { | |
428870ff BB |
867 | err = zap_entry_create(l, zn, ZAP_NEED_CD, |
868 | integer_size, num_integers, val, &zeh); | |
34dc7c2f BB |
869 | if (err == 0) |
870 | zap_increment_num_entries(zap, 1, tx); | |
871 | } else { | |
872 | err = zap_entry_update(&zeh, integer_size, num_integers, val); | |
873 | } | |
874 | ||
875 | if (err == EAGAIN) { | |
876 | err = zap_expand_leaf(zn, l, tx, &l); | |
877 | zap = zn->zn_zap; /* zap_expand_leaf() may change zap */ | |
878 | if (err == 0) | |
879 | goto retry; | |
880 | } | |
881 | ||
882 | if (zap != NULL) | |
883 | zap_put_leaf_maybe_grow_ptrtbl(zn, l, tx); | |
884 | return (err); | |
885 | } | |
886 | ||
887 | int | |
888 | fzap_length(zap_name_t *zn, | |
889 | uint64_t *integer_size, uint64_t *num_integers) | |
890 | { | |
891 | zap_leaf_t *l; | |
892 | int err; | |
893 | zap_entry_handle_t zeh; | |
894 | ||
895 | err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, NULL, RW_READER, &l); | |
896 | if (err != 0) | |
897 | return (err); | |
898 | err = zap_leaf_lookup(l, zn, &zeh); | |
899 | if (err != 0) | |
900 | goto out; | |
901 | ||
902 | if (integer_size) | |
903 | *integer_size = zeh.zeh_integer_size; | |
904 | if (num_integers) | |
905 | *num_integers = zeh.zeh_num_integers; | |
906 | out: | |
907 | zap_put_leaf(l); | |
908 | return (err); | |
909 | } | |
910 | ||
911 | int | |
912 | fzap_remove(zap_name_t *zn, dmu_tx_t *tx) | |
913 | { | |
914 | zap_leaf_t *l; | |
915 | int err; | |
916 | zap_entry_handle_t zeh; | |
917 | ||
918 | err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, tx, RW_WRITER, &l); | |
919 | if (err != 0) | |
920 | return (err); | |
921 | err = zap_leaf_lookup(l, zn, &zeh); | |
922 | if (err == 0) { | |
923 | zap_entry_remove(&zeh); | |
924 | zap_increment_num_entries(zn->zn_zap, -1, tx); | |
925 | } | |
926 | zap_put_leaf(l); | |
927 | return (err); | |
928 | } | |
929 | ||
428870ff BB |
930 | void |
931 | fzap_prefetch(zap_name_t *zn) | |
932 | { | |
933 | uint64_t idx, blk; | |
934 | zap_t *zap = zn->zn_zap; | |
935 | int bs; | |
936 | ||
937 | idx = ZAP_HASH_IDX(zn->zn_hash, | |
938 | zap->zap_f.zap_phys->zap_ptrtbl.zt_shift); | |
939 | if (zap_idx_to_blk(zap, idx, &blk) != 0) | |
940 | return; | |
941 | bs = FZAP_BLOCK_SHIFT(zap); | |
942 | dmu_prefetch(zap->zap_objset, zap->zap_object, blk << bs, 1 << bs); | |
943 | } | |
944 | ||
b128c09f BB |
945 | /* |
946 | * Helper functions for consumers. | |
947 | */ | |
948 | ||
34dc7c2f BB |
949 | int |
950 | zap_value_search(objset_t *os, uint64_t zapobj, uint64_t value, uint64_t mask, | |
951 | char *name) | |
952 | { | |
953 | zap_cursor_t zc; | |
954 | zap_attribute_t *za; | |
955 | int err; | |
956 | ||
957 | if (mask == 0) | |
958 | mask = -1ULL; | |
959 | ||
b8d06fca | 960 | za = kmem_alloc(sizeof (zap_attribute_t), KM_PUSHPAGE); |
34dc7c2f BB |
961 | for (zap_cursor_init(&zc, os, zapobj); |
962 | (err = zap_cursor_retrieve(&zc, za)) == 0; | |
963 | zap_cursor_advance(&zc)) { | |
964 | if ((za->za_first_integer & mask) == (value & mask)) { | |
965 | (void) strcpy(name, za->za_name); | |
966 | break; | |
967 | } | |
968 | } | |
969 | zap_cursor_fini(&zc); | |
970 | kmem_free(za, sizeof (zap_attribute_t)); | |
971 | return (err); | |
972 | } | |
973 | ||
b128c09f BB |
974 | int |
975 | zap_join(objset_t *os, uint64_t fromobj, uint64_t intoobj, dmu_tx_t *tx) | |
976 | { | |
977 | zap_cursor_t zc; | |
978 | zap_attribute_t za; | |
979 | int err; | |
980 | ||
981 | for (zap_cursor_init(&zc, os, fromobj); | |
982 | zap_cursor_retrieve(&zc, &za) == 0; | |
983 | (void) zap_cursor_advance(&zc)) { | |
984 | if (za.za_integer_length != 8 || za.za_num_integers != 1) | |
985 | return (EINVAL); | |
986 | err = zap_add(os, intoobj, za.za_name, | |
987 | 8, 1, &za.za_first_integer, tx); | |
988 | if (err) | |
989 | return (err); | |
990 | } | |
991 | zap_cursor_fini(&zc); | |
992 | return (0); | |
993 | } | |
994 | ||
428870ff BB |
995 | int |
996 | zap_join_key(objset_t *os, uint64_t fromobj, uint64_t intoobj, | |
997 | uint64_t value, dmu_tx_t *tx) | |
998 | { | |
999 | zap_cursor_t zc; | |
1000 | zap_attribute_t za; | |
1001 | int err; | |
1002 | ||
1003 | for (zap_cursor_init(&zc, os, fromobj); | |
1004 | zap_cursor_retrieve(&zc, &za) == 0; | |
1005 | (void) zap_cursor_advance(&zc)) { | |
1006 | if (za.za_integer_length != 8 || za.za_num_integers != 1) | |
1007 | return (EINVAL); | |
1008 | err = zap_add(os, intoobj, za.za_name, | |
1009 | 8, 1, &value, tx); | |
1010 | if (err) | |
1011 | return (err); | |
1012 | } | |
1013 | zap_cursor_fini(&zc); | |
1014 | return (0); | |
1015 | } | |
1016 | ||
1017 | int | |
1018 | zap_join_increment(objset_t *os, uint64_t fromobj, uint64_t intoobj, | |
1019 | dmu_tx_t *tx) | |
1020 | { | |
1021 | zap_cursor_t zc; | |
1022 | zap_attribute_t za; | |
1023 | int err; | |
1024 | ||
1025 | for (zap_cursor_init(&zc, os, fromobj); | |
1026 | zap_cursor_retrieve(&zc, &za) == 0; | |
1027 | (void) zap_cursor_advance(&zc)) { | |
1028 | uint64_t delta = 0; | |
1029 | ||
1030 | if (za.za_integer_length != 8 || za.za_num_integers != 1) | |
1031 | return (EINVAL); | |
1032 | ||
1033 | err = zap_lookup(os, intoobj, za.za_name, 8, 1, &delta); | |
1034 | if (err != 0 && err != ENOENT) | |
1035 | return (err); | |
1036 | delta += za.za_first_integer; | |
1037 | err = zap_update(os, intoobj, za.za_name, 8, 1, &delta, tx); | |
1038 | if (err) | |
1039 | return (err); | |
1040 | } | |
1041 | zap_cursor_fini(&zc); | |
1042 | return (0); | |
1043 | } | |
1044 | ||
b128c09f BB |
1045 | int |
1046 | zap_add_int(objset_t *os, uint64_t obj, uint64_t value, dmu_tx_t *tx) | |
1047 | { | |
1048 | char name[20]; | |
1049 | ||
1050 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value); | |
1051 | return (zap_add(os, obj, name, 8, 1, &value, tx)); | |
1052 | } | |
1053 | ||
1054 | int | |
1055 | zap_remove_int(objset_t *os, uint64_t obj, uint64_t value, dmu_tx_t *tx) | |
1056 | { | |
1057 | char name[20]; | |
1058 | ||
1059 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value); | |
1060 | return (zap_remove(os, obj, name, tx)); | |
1061 | } | |
1062 | ||
1063 | int | |
1064 | zap_lookup_int(objset_t *os, uint64_t obj, uint64_t value) | |
1065 | { | |
1066 | char name[20]; | |
1067 | ||
1068 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value); | |
1069 | return (zap_lookup(os, obj, name, 8, 1, &value)); | |
1070 | } | |
34dc7c2f | 1071 | |
428870ff BB |
1072 | int |
1073 | zap_add_int_key(objset_t *os, uint64_t obj, | |
1074 | uint64_t key, uint64_t value, dmu_tx_t *tx) | |
1075 | { | |
1076 | char name[20]; | |
1077 | ||
1078 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key); | |
1079 | return (zap_add(os, obj, name, 8, 1, &value, tx)); | |
1080 | } | |
1081 | ||
1082 | int | |
1083 | zap_lookup_int_key(objset_t *os, uint64_t obj, uint64_t key, uint64_t *valuep) | |
1084 | { | |
1085 | char name[20]; | |
1086 | ||
1087 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key); | |
1088 | return (zap_lookup(os, obj, name, 8, 1, valuep)); | |
1089 | } | |
1090 | ||
1091 | int | |
1092 | zap_increment(objset_t *os, uint64_t obj, const char *name, int64_t delta, | |
1093 | dmu_tx_t *tx) | |
1094 | { | |
1095 | uint64_t value = 0; | |
1096 | int err; | |
1097 | ||
1098 | if (delta == 0) | |
1099 | return (0); | |
1100 | ||
1101 | err = zap_lookup(os, obj, name, 8, 1, &value); | |
1102 | if (err != 0 && err != ENOENT) | |
1103 | return (err); | |
1104 | value += delta; | |
1105 | if (value == 0) | |
1106 | err = zap_remove(os, obj, name, tx); | |
1107 | else | |
1108 | err = zap_update(os, obj, name, 8, 1, &value, tx); | |
1109 | return (err); | |
1110 | } | |
1111 | ||
1112 | int | |
1113 | zap_increment_int(objset_t *os, uint64_t obj, uint64_t key, int64_t delta, | |
1114 | dmu_tx_t *tx) | |
1115 | { | |
1116 | char name[20]; | |
1117 | ||
1118 | (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key); | |
1119 | return (zap_increment(os, obj, name, delta, tx)); | |
1120 | } | |
1121 | ||
34dc7c2f BB |
1122 | /* |
1123 | * Routines for iterating over the attributes. | |
1124 | */ | |
1125 | ||
1126 | int | |
1127 | fzap_cursor_retrieve(zap_t *zap, zap_cursor_t *zc, zap_attribute_t *za) | |
1128 | { | |
1129 | int err = ENOENT; | |
1130 | zap_entry_handle_t zeh; | |
1131 | zap_leaf_t *l; | |
1132 | ||
1133 | /* retrieve the next entry at or after zc_hash/zc_cd */ | |
1134 | /* if no entry, return ENOENT */ | |
1135 | ||
1136 | if (zc->zc_leaf && | |
1137 | (ZAP_HASH_IDX(zc->zc_hash, | |
1138 | zc->zc_leaf->l_phys->l_hdr.lh_prefix_len) != | |
1139 | zc->zc_leaf->l_phys->l_hdr.lh_prefix)) { | |
1140 | rw_enter(&zc->zc_leaf->l_rwlock, RW_READER); | |
1141 | zap_put_leaf(zc->zc_leaf); | |
1142 | zc->zc_leaf = NULL; | |
1143 | } | |
1144 | ||
1145 | again: | |
1146 | if (zc->zc_leaf == NULL) { | |
1147 | err = zap_deref_leaf(zap, zc->zc_hash, NULL, RW_READER, | |
1148 | &zc->zc_leaf); | |
1149 | if (err != 0) | |
1150 | return (err); | |
1151 | } else { | |
1152 | rw_enter(&zc->zc_leaf->l_rwlock, RW_READER); | |
1153 | } | |
1154 | l = zc->zc_leaf; | |
1155 | ||
1156 | err = zap_leaf_lookup_closest(l, zc->zc_hash, zc->zc_cd, &zeh); | |
1157 | ||
1158 | if (err == ENOENT) { | |
1159 | uint64_t nocare = | |
1160 | (1ULL << (64 - l->l_phys->l_hdr.lh_prefix_len)) - 1; | |
1161 | zc->zc_hash = (zc->zc_hash & ~nocare) + nocare + 1; | |
1162 | zc->zc_cd = 0; | |
1163 | if (l->l_phys->l_hdr.lh_prefix_len == 0 || zc->zc_hash == 0) { | |
1164 | zc->zc_hash = -1ULL; | |
1165 | } else { | |
1166 | zap_put_leaf(zc->zc_leaf); | |
1167 | zc->zc_leaf = NULL; | |
1168 | goto again; | |
1169 | } | |
1170 | } | |
1171 | ||
1172 | if (err == 0) { | |
1173 | zc->zc_hash = zeh.zeh_hash; | |
1174 | zc->zc_cd = zeh.zeh_cd; | |
1175 | za->za_integer_length = zeh.zeh_integer_size; | |
1176 | za->za_num_integers = zeh.zeh_num_integers; | |
1177 | if (zeh.zeh_num_integers == 0) { | |
1178 | za->za_first_integer = 0; | |
1179 | } else { | |
1180 | err = zap_entry_read(&zeh, 8, 1, &za->za_first_integer); | |
1181 | ASSERT(err == 0 || err == EOVERFLOW); | |
1182 | } | |
428870ff | 1183 | err = zap_entry_read_name(zap, &zeh, |
34dc7c2f BB |
1184 | sizeof (za->za_name), za->za_name); |
1185 | ASSERT(err == 0); | |
1186 | ||
1187 | za->za_normalization_conflict = | |
1188 | zap_entry_normalization_conflict(&zeh, | |
1189 | NULL, za->za_name, zap); | |
1190 | } | |
1191 | rw_exit(&zc->zc_leaf->l_rwlock); | |
1192 | return (err); | |
1193 | } | |
1194 | ||
34dc7c2f BB |
1195 | static void |
1196 | zap_stats_ptrtbl(zap_t *zap, uint64_t *tbl, int len, zap_stats_t *zs) | |
1197 | { | |
1198 | int i, err; | |
1199 | uint64_t lastblk = 0; | |
1200 | ||
1201 | /* | |
1202 | * NB: if a leaf has more pointers than an entire ptrtbl block | |
1203 | * can hold, then it'll be accounted for more than once, since | |
1204 | * we won't have lastblk. | |
1205 | */ | |
1206 | for (i = 0; i < len; i++) { | |
1207 | zap_leaf_t *l; | |
1208 | ||
1209 | if (tbl[i] == lastblk) | |
1210 | continue; | |
1211 | lastblk = tbl[i]; | |
1212 | ||
1213 | err = zap_get_leaf_byblk(zap, tbl[i], NULL, RW_READER, &l); | |
1214 | if (err == 0) { | |
1215 | zap_leaf_stats(zap, l, zs); | |
1216 | zap_put_leaf(l); | |
1217 | } | |
1218 | } | |
1219 | } | |
1220 | ||
428870ff BB |
1221 | int |
1222 | fzap_cursor_move_to_key(zap_cursor_t *zc, zap_name_t *zn) | |
1223 | { | |
1224 | int err; | |
1225 | zap_leaf_t *l; | |
1226 | zap_entry_handle_t zeh; | |
1227 | ||
1228 | if (zn->zn_key_orig_numints * zn->zn_key_intlen > ZAP_MAXNAMELEN) | |
1229 | return (ENAMETOOLONG); | |
1230 | ||
1231 | err = zap_deref_leaf(zc->zc_zap, zn->zn_hash, NULL, RW_READER, &l); | |
1232 | if (err != 0) | |
1233 | return (err); | |
1234 | ||
1235 | err = zap_leaf_lookup(l, zn, &zeh); | |
1236 | if (err != 0) | |
1237 | return (err); | |
1238 | ||
1239 | zc->zc_leaf = l; | |
1240 | zc->zc_hash = zeh.zeh_hash; | |
1241 | zc->zc_cd = zeh.zeh_cd; | |
1242 | ||
1243 | return (err); | |
1244 | } | |
1245 | ||
34dc7c2f BB |
1246 | void |
1247 | fzap_get_stats(zap_t *zap, zap_stats_t *zs) | |
1248 | { | |
1249 | int bs = FZAP_BLOCK_SHIFT(zap); | |
1250 | zs->zs_blocksize = 1ULL << bs; | |
1251 | ||
1252 | /* | |
1253 | * Set zap_phys_t fields | |
1254 | */ | |
1255 | zs->zs_num_leafs = zap->zap_f.zap_phys->zap_num_leafs; | |
1256 | zs->zs_num_entries = zap->zap_f.zap_phys->zap_num_entries; | |
1257 | zs->zs_num_blocks = zap->zap_f.zap_phys->zap_freeblk; | |
1258 | zs->zs_block_type = zap->zap_f.zap_phys->zap_block_type; | |
1259 | zs->zs_magic = zap->zap_f.zap_phys->zap_magic; | |
1260 | zs->zs_salt = zap->zap_f.zap_phys->zap_salt; | |
1261 | ||
1262 | /* | |
1263 | * Set zap_ptrtbl fields | |
1264 | */ | |
1265 | zs->zs_ptrtbl_len = 1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift; | |
1266 | zs->zs_ptrtbl_nextblk = zap->zap_f.zap_phys->zap_ptrtbl.zt_nextblk; | |
1267 | zs->zs_ptrtbl_blks_copied = | |
1268 | zap->zap_f.zap_phys->zap_ptrtbl.zt_blks_copied; | |
1269 | zs->zs_ptrtbl_zt_blk = zap->zap_f.zap_phys->zap_ptrtbl.zt_blk; | |
1270 | zs->zs_ptrtbl_zt_numblks = zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks; | |
1271 | zs->zs_ptrtbl_zt_shift = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift; | |
1272 | ||
1273 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) { | |
1274 | /* the ptrtbl is entirely in the header block. */ | |
1275 | zap_stats_ptrtbl(zap, &ZAP_EMBEDDED_PTRTBL_ENT(zap, 0), | |
1276 | 1 << ZAP_EMBEDDED_PTRTBL_SHIFT(zap), zs); | |
1277 | } else { | |
1278 | int b; | |
1279 | ||
1280 | dmu_prefetch(zap->zap_objset, zap->zap_object, | |
1281 | zap->zap_f.zap_phys->zap_ptrtbl.zt_blk << bs, | |
1282 | zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks << bs); | |
1283 | ||
1284 | for (b = 0; b < zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks; | |
1285 | b++) { | |
1286 | dmu_buf_t *db; | |
1287 | int err; | |
1288 | ||
1289 | err = dmu_buf_hold(zap->zap_objset, zap->zap_object, | |
1290 | (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk + b) << bs, | |
428870ff | 1291 | FTAG, &db, DMU_READ_NO_PREFETCH); |
34dc7c2f BB |
1292 | if (err == 0) { |
1293 | zap_stats_ptrtbl(zap, db->db_data, | |
1294 | 1<<(bs-3), zs); | |
1295 | dmu_buf_rele(db, FTAG); | |
1296 | } | |
1297 | } | |
1298 | } | |
1299 | } | |
9babb374 BB |
1300 | |
1301 | int | |
1302 | fzap_count_write(zap_name_t *zn, int add, uint64_t *towrite, | |
1303 | uint64_t *tooverwrite) | |
1304 | { | |
1305 | zap_t *zap = zn->zn_zap; | |
1306 | zap_leaf_t *l; | |
1307 | int err; | |
1308 | ||
1309 | /* | |
1310 | * Account for the header block of the fatzap. | |
1311 | */ | |
1312 | if (!add && dmu_buf_freeable(zap->zap_dbuf)) { | |
428870ff | 1313 | *tooverwrite += zap->zap_dbuf->db_size; |
9babb374 | 1314 | } else { |
428870ff | 1315 | *towrite += zap->zap_dbuf->db_size; |
9babb374 BB |
1316 | } |
1317 | ||
1318 | /* | |
1319 | * Account for the pointer table blocks. | |
1320 | * If we are adding we need to account for the following cases : | |
1321 | * - If the pointer table is embedded, this operation could force an | |
1322 | * external pointer table. | |
1323 | * - If this already has an external pointer table this operation | |
1324 | * could extend the table. | |
1325 | */ | |
1326 | if (add) { | |
1327 | if (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk == 0) | |
428870ff | 1328 | *towrite += zap->zap_dbuf->db_size; |
9babb374 | 1329 | else |
428870ff | 1330 | *towrite += (zap->zap_dbuf->db_size * 3); |
9babb374 BB |
1331 | } |
1332 | ||
1333 | /* | |
1334 | * Now, check if the block containing leaf is freeable | |
1335 | * and account accordingly. | |
1336 | */ | |
1337 | err = zap_deref_leaf(zap, zn->zn_hash, NULL, RW_READER, &l); | |
1338 | if (err != 0) { | |
1339 | return (err); | |
1340 | } | |
1341 | ||
1342 | if (!add && dmu_buf_freeable(l->l_dbuf)) { | |
428870ff | 1343 | *tooverwrite += l->l_dbuf->db_size; |
9babb374 BB |
1344 | } else { |
1345 | /* | |
1346 | * If this an add operation, the leaf block could split. | |
1347 | * Hence, we need to account for an additional leaf block. | |
1348 | */ | |
428870ff | 1349 | *towrite += (add ? 2 : 1) * l->l_dbuf->db_size; |
9babb374 BB |
1350 | } |
1351 | ||
1352 | zap_put_leaf(l); | |
1353 | return (0); | |
1354 | } |