]>
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. |
ef3c1dea | 23 | * Copyright 2011 Nexenta Systems, Inc. All rights reserved. |
4bda3bd0 | 24 | * Copyright (c) 2012, 2015 by Delphix. All rights reserved. |
3a17a7a9 | 25 | * Copyright (c) 2013 by Saso Kiselkov. All rights reserved. |
0c66c32d | 26 | * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved. |
34dc7c2f BB |
27 | */ |
28 | ||
34dc7c2f | 29 | #include <sys/zfs_context.h> |
c28b2279 | 30 | #include <sys/arc.h> |
34dc7c2f | 31 | #include <sys/dmu.h> |
ea97f8ce | 32 | #include <sys/dmu_send.h> |
34dc7c2f BB |
33 | #include <sys/dmu_impl.h> |
34 | #include <sys/dbuf.h> | |
35 | #include <sys/dmu_objset.h> | |
36 | #include <sys/dsl_dataset.h> | |
37 | #include <sys/dsl_dir.h> | |
38 | #include <sys/dmu_tx.h> | |
39 | #include <sys/spa.h> | |
40 | #include <sys/zio.h> | |
41 | #include <sys/dmu_zfetch.h> | |
428870ff BB |
42 | #include <sys/sa.h> |
43 | #include <sys/sa_impl.h> | |
9b67f605 MA |
44 | #include <sys/zfeature.h> |
45 | #include <sys/blkptr.h> | |
9bd274dd | 46 | #include <sys/range_tree.h> |
49ee64e5 | 47 | #include <sys/trace_dbuf.h> |
34dc7c2f | 48 | |
fc5bb51f BB |
49 | struct dbuf_hold_impl_data { |
50 | /* Function arguments */ | |
51 | dnode_t *dh_dn; | |
52 | uint8_t dh_level; | |
53 | uint64_t dh_blkid; | |
fcff0f35 PD |
54 | boolean_t dh_fail_sparse; |
55 | boolean_t dh_fail_uncached; | |
fc5bb51f BB |
56 | void *dh_tag; |
57 | dmu_buf_impl_t **dh_dbp; | |
58 | /* Local variables */ | |
59 | dmu_buf_impl_t *dh_db; | |
60 | dmu_buf_impl_t *dh_parent; | |
61 | blkptr_t *dh_bp; | |
62 | int dh_err; | |
63 | dbuf_dirty_record_t *dh_dr; | |
64 | arc_buf_contents_t dh_type; | |
65 | int dh_depth; | |
66 | }; | |
67 | ||
68 | static void __dbuf_hold_impl_init(struct dbuf_hold_impl_data *dh, | |
fcff0f35 PD |
69 | dnode_t *dn, uint8_t level, uint64_t blkid, boolean_t fail_sparse, |
70 | boolean_t fail_uncached, | |
71 | void *tag, dmu_buf_impl_t **dbp, int depth); | |
fc5bb51f BB |
72 | static int __dbuf_hold_impl(struct dbuf_hold_impl_data *dh); |
73 | ||
b663a23d MA |
74 | /* |
75 | * Number of times that zfs_free_range() took the slow path while doing | |
76 | * a zfs receive. A nonzero value indicates a potential performance problem. | |
77 | */ | |
78 | uint64_t zfs_free_range_recv_miss; | |
79 | ||
34dc7c2f | 80 | static void dbuf_destroy(dmu_buf_impl_t *db); |
13fe0198 | 81 | static boolean_t dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx); |
b128c09f | 82 | static void dbuf_write(dbuf_dirty_record_t *dr, arc_buf_t *data, dmu_tx_t *tx); |
34dc7c2f | 83 | |
0c66c32d JG |
84 | #ifndef __lint |
85 | extern inline void dmu_buf_init_user(dmu_buf_user_t *dbu, | |
86 | dmu_buf_evict_func_t *evict_func, dmu_buf_t **clear_on_evict_dbufp); | |
87 | #endif /* ! __lint */ | |
88 | ||
34dc7c2f BB |
89 | /* |
90 | * Global data structures and functions for the dbuf cache. | |
91 | */ | |
92 | static kmem_cache_t *dbuf_cache; | |
0c66c32d | 93 | static taskq_t *dbu_evict_taskq; |
34dc7c2f BB |
94 | |
95 | /* ARGSUSED */ | |
96 | static int | |
97 | dbuf_cons(void *vdb, void *unused, int kmflag) | |
98 | { | |
99 | dmu_buf_impl_t *db = vdb; | |
100 | bzero(db, sizeof (dmu_buf_impl_t)); | |
101 | ||
102 | mutex_init(&db->db_mtx, NULL, MUTEX_DEFAULT, NULL); | |
103 | cv_init(&db->db_changed, NULL, CV_DEFAULT, NULL); | |
104 | refcount_create(&db->db_holds); | |
8951cb8d | 105 | |
34dc7c2f BB |
106 | return (0); |
107 | } | |
108 | ||
109 | /* ARGSUSED */ | |
110 | static void | |
111 | dbuf_dest(void *vdb, void *unused) | |
112 | { | |
113 | dmu_buf_impl_t *db = vdb; | |
114 | mutex_destroy(&db->db_mtx); | |
115 | cv_destroy(&db->db_changed); | |
116 | refcount_destroy(&db->db_holds); | |
117 | } | |
118 | ||
119 | /* | |
120 | * dbuf hash table routines | |
121 | */ | |
122 | static dbuf_hash_table_t dbuf_hash_table; | |
123 | ||
124 | static uint64_t dbuf_hash_count; | |
125 | ||
126 | static uint64_t | |
127 | dbuf_hash(void *os, uint64_t obj, uint8_t lvl, uint64_t blkid) | |
128 | { | |
129 | uintptr_t osv = (uintptr_t)os; | |
130 | uint64_t crc = -1ULL; | |
131 | ||
132 | ASSERT(zfs_crc64_table[128] == ZFS_CRC64_POLY); | |
133 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (lvl)) & 0xFF]; | |
134 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (osv >> 6)) & 0xFF]; | |
135 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (obj >> 0)) & 0xFF]; | |
136 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (obj >> 8)) & 0xFF]; | |
137 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (blkid >> 0)) & 0xFF]; | |
138 | crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ (blkid >> 8)) & 0xFF]; | |
139 | ||
140 | crc ^= (osv>>14) ^ (obj>>16) ^ (blkid>>16); | |
141 | ||
142 | return (crc); | |
143 | } | |
144 | ||
145 | #define DBUF_HASH(os, obj, level, blkid) dbuf_hash(os, obj, level, blkid); | |
146 | ||
147 | #define DBUF_EQUAL(dbuf, os, obj, level, blkid) \ | |
148 | ((dbuf)->db.db_object == (obj) && \ | |
149 | (dbuf)->db_objset == (os) && \ | |
150 | (dbuf)->db_level == (level) && \ | |
151 | (dbuf)->db_blkid == (blkid)) | |
152 | ||
153 | dmu_buf_impl_t * | |
6ebebace | 154 | dbuf_find(objset_t *os, uint64_t obj, uint8_t level, uint64_t blkid) |
34dc7c2f BB |
155 | { |
156 | dbuf_hash_table_t *h = &dbuf_hash_table; | |
d6320ddb BB |
157 | uint64_t hv; |
158 | uint64_t idx; | |
34dc7c2f BB |
159 | dmu_buf_impl_t *db; |
160 | ||
d6320ddb BB |
161 | hv = DBUF_HASH(os, obj, level, blkid); |
162 | idx = hv & h->hash_table_mask; | |
163 | ||
34dc7c2f BB |
164 | mutex_enter(DBUF_HASH_MUTEX(h, idx)); |
165 | for (db = h->hash_table[idx]; db != NULL; db = db->db_hash_next) { | |
166 | if (DBUF_EQUAL(db, os, obj, level, blkid)) { | |
167 | mutex_enter(&db->db_mtx); | |
168 | if (db->db_state != DB_EVICTING) { | |
169 | mutex_exit(DBUF_HASH_MUTEX(h, idx)); | |
170 | return (db); | |
171 | } | |
172 | mutex_exit(&db->db_mtx); | |
173 | } | |
174 | } | |
175 | mutex_exit(DBUF_HASH_MUTEX(h, idx)); | |
176 | return (NULL); | |
177 | } | |
178 | ||
6ebebace JG |
179 | static dmu_buf_impl_t * |
180 | dbuf_find_bonus(objset_t *os, uint64_t object) | |
181 | { | |
182 | dnode_t *dn; | |
183 | dmu_buf_impl_t *db = NULL; | |
184 | ||
185 | if (dnode_hold(os, object, FTAG, &dn) == 0) { | |
186 | rw_enter(&dn->dn_struct_rwlock, RW_READER); | |
187 | if (dn->dn_bonus != NULL) { | |
188 | db = dn->dn_bonus; | |
189 | mutex_enter(&db->db_mtx); | |
190 | } | |
191 | rw_exit(&dn->dn_struct_rwlock); | |
192 | dnode_rele(dn, FTAG); | |
193 | } | |
194 | return (db); | |
195 | } | |
196 | ||
34dc7c2f BB |
197 | /* |
198 | * Insert an entry into the hash table. If there is already an element | |
199 | * equal to elem in the hash table, then the already existing element | |
200 | * will be returned and the new element will not be inserted. | |
201 | * Otherwise returns NULL. | |
202 | */ | |
203 | static dmu_buf_impl_t * | |
204 | dbuf_hash_insert(dmu_buf_impl_t *db) | |
205 | { | |
206 | dbuf_hash_table_t *h = &dbuf_hash_table; | |
428870ff | 207 | objset_t *os = db->db_objset; |
34dc7c2f BB |
208 | uint64_t obj = db->db.db_object; |
209 | int level = db->db_level; | |
d6320ddb | 210 | uint64_t blkid, hv, idx; |
34dc7c2f BB |
211 | dmu_buf_impl_t *dbf; |
212 | ||
d6320ddb BB |
213 | blkid = db->db_blkid; |
214 | hv = DBUF_HASH(os, obj, level, blkid); | |
215 | idx = hv & h->hash_table_mask; | |
216 | ||
34dc7c2f BB |
217 | mutex_enter(DBUF_HASH_MUTEX(h, idx)); |
218 | for (dbf = h->hash_table[idx]; dbf != NULL; dbf = dbf->db_hash_next) { | |
219 | if (DBUF_EQUAL(dbf, os, obj, level, blkid)) { | |
220 | mutex_enter(&dbf->db_mtx); | |
221 | if (dbf->db_state != DB_EVICTING) { | |
222 | mutex_exit(DBUF_HASH_MUTEX(h, idx)); | |
223 | return (dbf); | |
224 | } | |
225 | mutex_exit(&dbf->db_mtx); | |
226 | } | |
227 | } | |
228 | ||
229 | mutex_enter(&db->db_mtx); | |
230 | db->db_hash_next = h->hash_table[idx]; | |
231 | h->hash_table[idx] = db; | |
232 | mutex_exit(DBUF_HASH_MUTEX(h, idx)); | |
bc89ac84 | 233 | atomic_inc_64(&dbuf_hash_count); |
34dc7c2f BB |
234 | |
235 | return (NULL); | |
236 | } | |
237 | ||
238 | /* | |
bd089c54 | 239 | * Remove an entry from the hash table. It must be in the EVICTING state. |
34dc7c2f BB |
240 | */ |
241 | static void | |
242 | dbuf_hash_remove(dmu_buf_impl_t *db) | |
243 | { | |
244 | dbuf_hash_table_t *h = &dbuf_hash_table; | |
d6320ddb | 245 | uint64_t hv, idx; |
34dc7c2f BB |
246 | dmu_buf_impl_t *dbf, **dbp; |
247 | ||
d6320ddb BB |
248 | hv = DBUF_HASH(db->db_objset, db->db.db_object, |
249 | db->db_level, db->db_blkid); | |
250 | idx = hv & h->hash_table_mask; | |
251 | ||
34dc7c2f | 252 | /* |
bd089c54 | 253 | * We musn't hold db_mtx to maintain lock ordering: |
34dc7c2f BB |
254 | * DBUF_HASH_MUTEX > db_mtx. |
255 | */ | |
256 | ASSERT(refcount_is_zero(&db->db_holds)); | |
257 | ASSERT(db->db_state == DB_EVICTING); | |
258 | ASSERT(!MUTEX_HELD(&db->db_mtx)); | |
259 | ||
260 | mutex_enter(DBUF_HASH_MUTEX(h, idx)); | |
261 | dbp = &h->hash_table[idx]; | |
262 | while ((dbf = *dbp) != db) { | |
263 | dbp = &dbf->db_hash_next; | |
264 | ASSERT(dbf != NULL); | |
265 | } | |
266 | *dbp = db->db_hash_next; | |
267 | db->db_hash_next = NULL; | |
268 | mutex_exit(DBUF_HASH_MUTEX(h, idx)); | |
bc89ac84 | 269 | atomic_dec_64(&dbuf_hash_count); |
34dc7c2f BB |
270 | } |
271 | ||
272 | static arc_evict_func_t dbuf_do_evict; | |
273 | ||
0c66c32d JG |
274 | typedef enum { |
275 | DBVU_EVICTING, | |
276 | DBVU_NOT_EVICTING | |
277 | } dbvu_verify_type_t; | |
278 | ||
279 | static void | |
280 | dbuf_verify_user(dmu_buf_impl_t *db, dbvu_verify_type_t verify_type) | |
281 | { | |
282 | #ifdef ZFS_DEBUG | |
283 | int64_t holds; | |
284 | ||
285 | if (db->db_user == NULL) | |
286 | return; | |
287 | ||
288 | /* Only data blocks support the attachment of user data. */ | |
289 | ASSERT(db->db_level == 0); | |
290 | ||
291 | /* Clients must resolve a dbuf before attaching user data. */ | |
292 | ASSERT(db->db.db_data != NULL); | |
293 | ASSERT3U(db->db_state, ==, DB_CACHED); | |
294 | ||
295 | holds = refcount_count(&db->db_holds); | |
296 | if (verify_type == DBVU_EVICTING) { | |
297 | /* | |
298 | * Immediate eviction occurs when holds == dirtycnt. | |
299 | * For normal eviction buffers, holds is zero on | |
300 | * eviction, except when dbuf_fix_old_data() calls | |
301 | * dbuf_clear_data(). However, the hold count can grow | |
302 | * during eviction even though db_mtx is held (see | |
303 | * dmu_bonus_hold() for an example), so we can only | |
304 | * test the generic invariant that holds >= dirtycnt. | |
305 | */ | |
306 | ASSERT3U(holds, >=, db->db_dirtycnt); | |
307 | } else { | |
bc4501f7 | 308 | if (db->db_user_immediate_evict == TRUE) |
0c66c32d JG |
309 | ASSERT3U(holds, >=, db->db_dirtycnt); |
310 | else | |
311 | ASSERT3U(holds, >, 0); | |
312 | } | |
313 | #endif | |
314 | } | |
315 | ||
34dc7c2f BB |
316 | static void |
317 | dbuf_evict_user(dmu_buf_impl_t *db) | |
318 | { | |
0c66c32d JG |
319 | dmu_buf_user_t *dbu = db->db_user; |
320 | ||
34dc7c2f BB |
321 | ASSERT(MUTEX_HELD(&db->db_mtx)); |
322 | ||
0c66c32d | 323 | if (dbu == NULL) |
34dc7c2f BB |
324 | return; |
325 | ||
0c66c32d JG |
326 | dbuf_verify_user(db, DBVU_EVICTING); |
327 | db->db_user = NULL; | |
328 | ||
329 | #ifdef ZFS_DEBUG | |
330 | if (dbu->dbu_clear_on_evict_dbufp != NULL) | |
331 | *dbu->dbu_clear_on_evict_dbufp = NULL; | |
332 | #endif | |
333 | ||
334 | /* | |
335 | * Invoke the callback from a taskq to avoid lock order reversals | |
336 | * and limit stack depth. | |
337 | */ | |
338 | taskq_dispatch_ent(dbu_evict_taskq, dbu->dbu_evict_func, dbu, 0, | |
339 | &dbu->dbu_tqent); | |
34dc7c2f BB |
340 | } |
341 | ||
572e2857 BB |
342 | boolean_t |
343 | dbuf_is_metadata(dmu_buf_impl_t *db) | |
344 | { | |
cc79a5c2 BB |
345 | /* |
346 | * Consider indirect blocks and spill blocks to be meta data. | |
347 | */ | |
348 | if (db->db_level > 0 || db->db_blkid == DMU_SPILL_BLKID) { | |
572e2857 BB |
349 | return (B_TRUE); |
350 | } else { | |
351 | boolean_t is_metadata; | |
352 | ||
353 | DB_DNODE_ENTER(db); | |
9ae529ec | 354 | is_metadata = DMU_OT_IS_METADATA(DB_DNODE(db)->dn_type); |
572e2857 BB |
355 | DB_DNODE_EXIT(db); |
356 | ||
357 | return (is_metadata); | |
358 | } | |
359 | } | |
360 | ||
34dc7c2f BB |
361 | void |
362 | dbuf_evict(dmu_buf_impl_t *db) | |
363 | { | |
364 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
365 | ASSERT(db->db_buf == NULL); | |
366 | ASSERT(db->db_data_pending == NULL); | |
367 | ||
368 | dbuf_clear(db); | |
369 | dbuf_destroy(db); | |
370 | } | |
371 | ||
372 | void | |
373 | dbuf_init(void) | |
374 | { | |
375 | uint64_t hsize = 1ULL << 16; | |
376 | dbuf_hash_table_t *h = &dbuf_hash_table; | |
377 | int i; | |
378 | ||
379 | /* | |
380 | * The hash table is big enough to fill all of physical memory | |
69de3421 TC |
381 | * with an average block size of zfs_arc_average_blocksize (default 8K). |
382 | * By default, the table will take up | |
383 | * totalmem * sizeof(void*) / 8K (1MB per GB with 8-byte pointers). | |
34dc7c2f | 384 | */ |
69de3421 | 385 | while (hsize * zfs_arc_average_blocksize < physmem * PAGESIZE) |
34dc7c2f BB |
386 | hsize <<= 1; |
387 | ||
388 | retry: | |
389 | h->hash_table_mask = hsize - 1; | |
00b46022 | 390 | #if defined(_KERNEL) && defined(HAVE_SPL) |
d1d7e268 MK |
391 | /* |
392 | * Large allocations which do not require contiguous pages | |
393 | * should be using vmem_alloc() in the linux kernel | |
394 | */ | |
79c76d5b | 395 | h->hash_table = vmem_zalloc(hsize * sizeof (void *), KM_SLEEP); |
00b46022 | 396 | #else |
34dc7c2f | 397 | h->hash_table = kmem_zalloc(hsize * sizeof (void *), KM_NOSLEEP); |
00b46022 | 398 | #endif |
34dc7c2f BB |
399 | if (h->hash_table == NULL) { |
400 | /* XXX - we should really return an error instead of assert */ | |
401 | ASSERT(hsize > (1ULL << 10)); | |
402 | hsize >>= 1; | |
403 | goto retry; | |
404 | } | |
405 | ||
406 | dbuf_cache = kmem_cache_create("dmu_buf_impl_t", | |
407 | sizeof (dmu_buf_impl_t), | |
408 | 0, dbuf_cons, dbuf_dest, NULL, NULL, NULL, 0); | |
409 | ||
410 | for (i = 0; i < DBUF_MUTEXES; i++) | |
40d06e3c | 411 | mutex_init(&h->hash_mutexes[i], NULL, MUTEX_DEFAULT, NULL); |
e0b0ca98 BB |
412 | |
413 | dbuf_stats_init(h); | |
0c66c32d JG |
414 | |
415 | /* | |
416 | * All entries are queued via taskq_dispatch_ent(), so min/maxalloc | |
417 | * configuration is not required. | |
418 | */ | |
1229323d | 419 | dbu_evict_taskq = taskq_create("dbu_evict", 1, defclsyspri, 0, 0, 0); |
34dc7c2f BB |
420 | } |
421 | ||
422 | void | |
423 | dbuf_fini(void) | |
424 | { | |
425 | dbuf_hash_table_t *h = &dbuf_hash_table; | |
426 | int i; | |
427 | ||
e0b0ca98 BB |
428 | dbuf_stats_destroy(); |
429 | ||
34dc7c2f BB |
430 | for (i = 0; i < DBUF_MUTEXES; i++) |
431 | mutex_destroy(&h->hash_mutexes[i]); | |
00b46022 | 432 | #if defined(_KERNEL) && defined(HAVE_SPL) |
d1d7e268 MK |
433 | /* |
434 | * Large allocations which do not require contiguous pages | |
435 | * should be using vmem_free() in the linux kernel | |
436 | */ | |
00b46022 BB |
437 | vmem_free(h->hash_table, (h->hash_table_mask + 1) * sizeof (void *)); |
438 | #else | |
34dc7c2f | 439 | kmem_free(h->hash_table, (h->hash_table_mask + 1) * sizeof (void *)); |
00b46022 | 440 | #endif |
34dc7c2f | 441 | kmem_cache_destroy(dbuf_cache); |
0c66c32d | 442 | taskq_destroy(dbu_evict_taskq); |
34dc7c2f BB |
443 | } |
444 | ||
445 | /* | |
446 | * Other stuff. | |
447 | */ | |
448 | ||
449 | #ifdef ZFS_DEBUG | |
450 | static void | |
451 | dbuf_verify(dmu_buf_impl_t *db) | |
452 | { | |
572e2857 | 453 | dnode_t *dn; |
428870ff | 454 | dbuf_dirty_record_t *dr; |
34dc7c2f BB |
455 | |
456 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
457 | ||
458 | if (!(zfs_flags & ZFS_DEBUG_DBUF_VERIFY)) | |
459 | return; | |
460 | ||
461 | ASSERT(db->db_objset != NULL); | |
572e2857 BB |
462 | DB_DNODE_ENTER(db); |
463 | dn = DB_DNODE(db); | |
34dc7c2f BB |
464 | if (dn == NULL) { |
465 | ASSERT(db->db_parent == NULL); | |
466 | ASSERT(db->db_blkptr == NULL); | |
467 | } else { | |
468 | ASSERT3U(db->db.db_object, ==, dn->dn_object); | |
469 | ASSERT3P(db->db_objset, ==, dn->dn_objset); | |
470 | ASSERT3U(db->db_level, <, dn->dn_nlevels); | |
572e2857 BB |
471 | ASSERT(db->db_blkid == DMU_BONUS_BLKID || |
472 | db->db_blkid == DMU_SPILL_BLKID || | |
8951cb8d | 473 | !avl_is_empty(&dn->dn_dbufs)); |
34dc7c2f | 474 | } |
428870ff BB |
475 | if (db->db_blkid == DMU_BONUS_BLKID) { |
476 | ASSERT(dn != NULL); | |
477 | ASSERT3U(db->db.db_size, >=, dn->dn_bonuslen); | |
478 | ASSERT3U(db->db.db_offset, ==, DMU_BONUS_BLKID); | |
479 | } else if (db->db_blkid == DMU_SPILL_BLKID) { | |
34dc7c2f | 480 | ASSERT(dn != NULL); |
c99c9001 | 481 | ASSERT0(db->db.db_offset); |
34dc7c2f BB |
482 | } else { |
483 | ASSERT3U(db->db.db_offset, ==, db->db_blkid * db->db.db_size); | |
484 | } | |
485 | ||
428870ff BB |
486 | for (dr = db->db_data_pending; dr != NULL; dr = dr->dr_next) |
487 | ASSERT(dr->dr_dbuf == db); | |
488 | ||
489 | for (dr = db->db_last_dirty; dr != NULL; dr = dr->dr_next) | |
490 | ASSERT(dr->dr_dbuf == db); | |
491 | ||
b128c09f BB |
492 | /* |
493 | * We can't assert that db_size matches dn_datablksz because it | |
494 | * can be momentarily different when another thread is doing | |
495 | * dnode_set_blksz(). | |
496 | */ | |
497 | if (db->db_level == 0 && db->db.db_object == DMU_META_DNODE_OBJECT) { | |
428870ff | 498 | dr = db->db_data_pending; |
b128c09f BB |
499 | /* |
500 | * It should only be modified in syncing context, so | |
501 | * make sure we only have one copy of the data. | |
502 | */ | |
503 | ASSERT(dr == NULL || dr->dt.dl.dr_data == db->db_buf); | |
34dc7c2f BB |
504 | } |
505 | ||
506 | /* verify db->db_blkptr */ | |
507 | if (db->db_blkptr) { | |
508 | if (db->db_parent == dn->dn_dbuf) { | |
509 | /* db is pointed to by the dnode */ | |
510 | /* ASSERT3U(db->db_blkid, <, dn->dn_nblkptr); */ | |
9babb374 | 511 | if (DMU_OBJECT_IS_SPECIAL(db->db.db_object)) |
34dc7c2f BB |
512 | ASSERT(db->db_parent == NULL); |
513 | else | |
514 | ASSERT(db->db_parent != NULL); | |
428870ff BB |
515 | if (db->db_blkid != DMU_SPILL_BLKID) |
516 | ASSERT3P(db->db_blkptr, ==, | |
517 | &dn->dn_phys->dn_blkptr[db->db_blkid]); | |
34dc7c2f BB |
518 | } else { |
519 | /* db is pointed to by an indirect block */ | |
1fde1e37 BB |
520 | ASSERTV(int epb = db->db_parent->db.db_size >> |
521 | SPA_BLKPTRSHIFT); | |
34dc7c2f BB |
522 | ASSERT3U(db->db_parent->db_level, ==, db->db_level+1); |
523 | ASSERT3U(db->db_parent->db.db_object, ==, | |
524 | db->db.db_object); | |
525 | /* | |
526 | * dnode_grow_indblksz() can make this fail if we don't | |
527 | * have the struct_rwlock. XXX indblksz no longer | |
528 | * grows. safe to do this now? | |
529 | */ | |
572e2857 | 530 | if (RW_WRITE_HELD(&dn->dn_struct_rwlock)) { |
34dc7c2f BB |
531 | ASSERT3P(db->db_blkptr, ==, |
532 | ((blkptr_t *)db->db_parent->db.db_data + | |
533 | db->db_blkid % epb)); | |
534 | } | |
535 | } | |
536 | } | |
537 | if ((db->db_blkptr == NULL || BP_IS_HOLE(db->db_blkptr)) && | |
428870ff BB |
538 | (db->db_buf == NULL || db->db_buf->b_data) && |
539 | db->db.db_data && db->db_blkid != DMU_BONUS_BLKID && | |
34dc7c2f BB |
540 | db->db_state != DB_FILL && !dn->dn_free_txg) { |
541 | /* | |
542 | * If the blkptr isn't set but they have nonzero data, | |
543 | * it had better be dirty, otherwise we'll lose that | |
544 | * data when we evict this buffer. | |
bc77ba73 PD |
545 | * |
546 | * There is an exception to this rule for indirect blocks; in | |
547 | * this case, if the indirect block is a hole, we fill in a few | |
548 | * fields on each of the child blocks (importantly, birth time) | |
549 | * to prevent hole birth times from being lost when you | |
550 | * partially fill in a hole. | |
34dc7c2f BB |
551 | */ |
552 | if (db->db_dirtycnt == 0) { | |
bc77ba73 PD |
553 | if (db->db_level == 0) { |
554 | uint64_t *buf = db->db.db_data; | |
555 | int i; | |
34dc7c2f | 556 | |
bc77ba73 PD |
557 | for (i = 0; i < db->db.db_size >> 3; i++) { |
558 | ASSERT(buf[i] == 0); | |
559 | } | |
560 | } else { | |
561 | int i; | |
562 | blkptr_t *bps = db->db.db_data; | |
563 | ASSERT3U(1 << DB_DNODE(db)->dn_indblkshift, ==, | |
564 | db->db.db_size); | |
565 | /* | |
566 | * We want to verify that all the blkptrs in the | |
567 | * indirect block are holes, but we may have | |
568 | * automatically set up a few fields for them. | |
569 | * We iterate through each blkptr and verify | |
570 | * they only have those fields set. | |
571 | */ | |
572 | for (i = 0; | |
573 | i < db->db.db_size / sizeof (blkptr_t); | |
574 | i++) { | |
575 | blkptr_t *bp = &bps[i]; | |
576 | ASSERT(ZIO_CHECKSUM_IS_ZERO( | |
577 | &bp->blk_cksum)); | |
578 | ASSERT( | |
579 | DVA_IS_EMPTY(&bp->blk_dva[0]) && | |
580 | DVA_IS_EMPTY(&bp->blk_dva[1]) && | |
581 | DVA_IS_EMPTY(&bp->blk_dva[2])); | |
582 | ASSERT0(bp->blk_fill); | |
583 | ASSERT0(bp->blk_pad[0]); | |
584 | ASSERT0(bp->blk_pad[1]); | |
585 | ASSERT(!BP_IS_EMBEDDED(bp)); | |
586 | ASSERT(BP_IS_HOLE(bp)); | |
587 | ASSERT0(bp->blk_phys_birth); | |
588 | } | |
34dc7c2f BB |
589 | } |
590 | } | |
591 | } | |
572e2857 | 592 | DB_DNODE_EXIT(db); |
34dc7c2f BB |
593 | } |
594 | #endif | |
595 | ||
0c66c32d JG |
596 | static void |
597 | dbuf_clear_data(dmu_buf_impl_t *db) | |
598 | { | |
599 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
600 | dbuf_evict_user(db); | |
601 | db->db_buf = NULL; | |
602 | db->db.db_data = NULL; | |
603 | if (db->db_state != DB_NOFILL) | |
604 | db->db_state = DB_UNCACHED; | |
605 | } | |
606 | ||
34dc7c2f BB |
607 | static void |
608 | dbuf_set_data(dmu_buf_impl_t *db, arc_buf_t *buf) | |
609 | { | |
610 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
0c66c32d JG |
611 | ASSERT(buf != NULL); |
612 | ||
34dc7c2f | 613 | db->db_buf = buf; |
0c66c32d JG |
614 | ASSERT(buf->b_data != NULL); |
615 | db->db.db_data = buf->b_data; | |
616 | if (!arc_released(buf)) | |
617 | arc_set_callback(buf, dbuf_do_evict, db); | |
34dc7c2f BB |
618 | } |
619 | ||
428870ff BB |
620 | /* |
621 | * Loan out an arc_buf for read. Return the loaned arc_buf. | |
622 | */ | |
623 | arc_buf_t * | |
624 | dbuf_loan_arcbuf(dmu_buf_impl_t *db) | |
625 | { | |
626 | arc_buf_t *abuf; | |
627 | ||
628 | mutex_enter(&db->db_mtx); | |
629 | if (arc_released(db->db_buf) || refcount_count(&db->db_holds) > 1) { | |
630 | int blksz = db->db.db_size; | |
b0bc7a84 | 631 | spa_t *spa = db->db_objset->os_spa; |
572e2857 | 632 | |
428870ff | 633 | mutex_exit(&db->db_mtx); |
572e2857 | 634 | abuf = arc_loan_buf(spa, blksz); |
428870ff BB |
635 | bcopy(db->db.db_data, abuf->b_data, blksz); |
636 | } else { | |
637 | abuf = db->db_buf; | |
638 | arc_loan_inuse_buf(abuf, db); | |
0c66c32d | 639 | dbuf_clear_data(db); |
428870ff BB |
640 | mutex_exit(&db->db_mtx); |
641 | } | |
642 | return (abuf); | |
643 | } | |
644 | ||
fcff0f35 PD |
645 | /* |
646 | * Calculate which level n block references the data at the level 0 offset | |
647 | * provided. | |
648 | */ | |
34dc7c2f | 649 | uint64_t |
fcff0f35 | 650 | dbuf_whichblock(dnode_t *dn, int64_t level, uint64_t offset) |
34dc7c2f | 651 | { |
fcff0f35 PD |
652 | if (dn->dn_datablkshift != 0 && dn->dn_indblkshift != 0) { |
653 | /* | |
654 | * The level n blkid is equal to the level 0 blkid divided by | |
655 | * the number of level 0s in a level n block. | |
656 | * | |
657 | * The level 0 blkid is offset >> datablkshift = | |
658 | * offset / 2^datablkshift. | |
659 | * | |
660 | * The number of level 0s in a level n is the number of block | |
661 | * pointers in an indirect block, raised to the power of level. | |
662 | * This is 2^(indblkshift - SPA_BLKPTRSHIFT)^level = | |
663 | * 2^(level*(indblkshift - SPA_BLKPTRSHIFT)). | |
664 | * | |
665 | * Thus, the level n blkid is: offset / | |
666 | * ((2^datablkshift)*(2^(level*(indblkshift - SPA_BLKPTRSHIFT))) | |
667 | * = offset / 2^(datablkshift + level * | |
668 | * (indblkshift - SPA_BLKPTRSHIFT)) | |
669 | * = offset >> (datablkshift + level * | |
670 | * (indblkshift - SPA_BLKPTRSHIFT)) | |
671 | */ | |
672 | return (offset >> (dn->dn_datablkshift + level * | |
673 | (dn->dn_indblkshift - SPA_BLKPTRSHIFT))); | |
34dc7c2f BB |
674 | } else { |
675 | ASSERT3U(offset, <, dn->dn_datablksz); | |
676 | return (0); | |
677 | } | |
678 | } | |
679 | ||
680 | static void | |
681 | dbuf_read_done(zio_t *zio, arc_buf_t *buf, void *vdb) | |
682 | { | |
683 | dmu_buf_impl_t *db = vdb; | |
684 | ||
685 | mutex_enter(&db->db_mtx); | |
686 | ASSERT3U(db->db_state, ==, DB_READ); | |
687 | /* | |
688 | * All reads are synchronous, so we must have a hold on the dbuf | |
689 | */ | |
690 | ASSERT(refcount_count(&db->db_holds) > 0); | |
691 | ASSERT(db->db_buf == NULL); | |
692 | ASSERT(db->db.db_data == NULL); | |
693 | if (db->db_level == 0 && db->db_freed_in_flight) { | |
694 | /* we were freed in flight; disregard any error */ | |
695 | arc_release(buf, db); | |
696 | bzero(buf->b_data, db->db.db_size); | |
697 | arc_buf_freeze(buf); | |
698 | db->db_freed_in_flight = FALSE; | |
699 | dbuf_set_data(db, buf); | |
700 | db->db_state = DB_CACHED; | |
701 | } else if (zio == NULL || zio->io_error == 0) { | |
702 | dbuf_set_data(db, buf); | |
703 | db->db_state = DB_CACHED; | |
704 | } else { | |
428870ff | 705 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f | 706 | ASSERT3P(db->db_buf, ==, NULL); |
13fe0198 | 707 | VERIFY(arc_buf_remove_ref(buf, db)); |
34dc7c2f BB |
708 | db->db_state = DB_UNCACHED; |
709 | } | |
710 | cv_broadcast(&db->db_changed); | |
428870ff | 711 | dbuf_rele_and_unlock(db, NULL); |
34dc7c2f BB |
712 | } |
713 | ||
5f6d0b6f | 714 | static int |
7f60329a | 715 | dbuf_read_impl(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags) |
34dc7c2f | 716 | { |
572e2857 | 717 | dnode_t *dn; |
5dbd68a3 | 718 | zbookmark_phys_t zb; |
2a432414 | 719 | uint32_t aflags = ARC_FLAG_NOWAIT; |
5f6d0b6f | 720 | int err; |
34dc7c2f | 721 | |
572e2857 BB |
722 | DB_DNODE_ENTER(db); |
723 | dn = DB_DNODE(db); | |
34dc7c2f BB |
724 | ASSERT(!refcount_is_zero(&db->db_holds)); |
725 | /* We need the struct_rwlock to prevent db_blkptr from changing. */ | |
b128c09f | 726 | ASSERT(RW_LOCK_HELD(&dn->dn_struct_rwlock)); |
34dc7c2f BB |
727 | ASSERT(MUTEX_HELD(&db->db_mtx)); |
728 | ASSERT(db->db_state == DB_UNCACHED); | |
729 | ASSERT(db->db_buf == NULL); | |
730 | ||
428870ff | 731 | if (db->db_blkid == DMU_BONUS_BLKID) { |
50c957f7 NB |
732 | /* |
733 | * The bonus length stored in the dnode may be less than | |
734 | * the maximum available space in the bonus buffer. | |
735 | */ | |
9babb374 | 736 | int bonuslen = MIN(dn->dn_bonuslen, dn->dn_phys->dn_bonuslen); |
50c957f7 | 737 | int max_bonuslen = DN_SLOTS_TO_BONUSLEN(dn->dn_num_slots); |
34dc7c2f BB |
738 | |
739 | ASSERT3U(bonuslen, <=, db->db.db_size); | |
50c957f7 | 740 | db->db.db_data = zio_buf_alloc(max_bonuslen); |
25458cbe | 741 | arc_space_consume(max_bonuslen, ARC_SPACE_BONUS); |
50c957f7 NB |
742 | if (bonuslen < max_bonuslen) |
743 | bzero(db->db.db_data, max_bonuslen); | |
9babb374 BB |
744 | if (bonuslen) |
745 | bcopy(DN_BONUS(dn->dn_phys), db->db.db_data, bonuslen); | |
572e2857 | 746 | DB_DNODE_EXIT(db); |
34dc7c2f BB |
747 | db->db_state = DB_CACHED; |
748 | mutex_exit(&db->db_mtx); | |
5f6d0b6f | 749 | return (0); |
34dc7c2f BB |
750 | } |
751 | ||
b128c09f BB |
752 | /* |
753 | * Recheck BP_IS_HOLE() after dnode_block_freed() in case dnode_sync() | |
754 | * processes the delete record and clears the bp while we are waiting | |
755 | * for the dn_mtx (resulting in a "no" from block_freed). | |
756 | */ | |
757 | if (db->db_blkptr == NULL || BP_IS_HOLE(db->db_blkptr) || | |
758 | (db->db_level == 0 && (dnode_block_freed(dn, db->db_blkid) || | |
759 | BP_IS_HOLE(db->db_blkptr)))) { | |
34dc7c2f BB |
760 | arc_buf_contents_t type = DBUF_GET_BUFC_TYPE(db); |
761 | ||
b0bc7a84 MG |
762 | dbuf_set_data(db, arc_buf_alloc(db->db_objset->os_spa, |
763 | db->db.db_size, db, type)); | |
34dc7c2f | 764 | bzero(db->db.db_data, db->db.db_size); |
bc77ba73 PD |
765 | |
766 | if (db->db_blkptr != NULL && db->db_level > 0 && | |
767 | BP_IS_HOLE(db->db_blkptr) && | |
768 | db->db_blkptr->blk_birth != 0) { | |
769 | blkptr_t *bps = db->db.db_data; | |
770 | int i; | |
771 | for (i = 0; i < ((1 << | |
772 | DB_DNODE(db)->dn_indblkshift) / sizeof (blkptr_t)); | |
773 | i++) { | |
774 | blkptr_t *bp = &bps[i]; | |
775 | ASSERT3U(BP_GET_LSIZE(db->db_blkptr), ==, | |
776 | 1 << dn->dn_indblkshift); | |
777 | BP_SET_LSIZE(bp, | |
778 | BP_GET_LEVEL(db->db_blkptr) == 1 ? | |
779 | dn->dn_datablksz : | |
780 | BP_GET_LSIZE(db->db_blkptr)); | |
781 | BP_SET_TYPE(bp, BP_GET_TYPE(db->db_blkptr)); | |
782 | BP_SET_LEVEL(bp, | |
783 | BP_GET_LEVEL(db->db_blkptr) - 1); | |
784 | BP_SET_BIRTH(bp, db->db_blkptr->blk_birth, 0); | |
785 | } | |
786 | } | |
787 | DB_DNODE_EXIT(db); | |
34dc7c2f | 788 | db->db_state = DB_CACHED; |
34dc7c2f | 789 | mutex_exit(&db->db_mtx); |
5f6d0b6f | 790 | return (0); |
34dc7c2f BB |
791 | } |
792 | ||
572e2857 BB |
793 | DB_DNODE_EXIT(db); |
794 | ||
34dc7c2f BB |
795 | db->db_state = DB_READ; |
796 | mutex_exit(&db->db_mtx); | |
797 | ||
b128c09f | 798 | if (DBUF_IS_L2CACHEABLE(db)) |
2a432414 | 799 | aflags |= ARC_FLAG_L2CACHE; |
3a17a7a9 | 800 | if (DBUF_IS_L2COMPRESSIBLE(db)) |
2a432414 | 801 | aflags |= ARC_FLAG_L2COMPRESS; |
b128c09f | 802 | |
428870ff BB |
803 | SET_BOOKMARK(&zb, db->db_objset->os_dsl_dataset ? |
804 | db->db_objset->os_dsl_dataset->ds_object : DMU_META_OBJSET, | |
805 | db->db.db_object, db->db_level, db->db_blkid); | |
34dc7c2f BB |
806 | |
807 | dbuf_add_ref(db, NULL); | |
b128c09f | 808 | |
5f6d0b6f | 809 | err = arc_read(zio, db->db_objset->os_spa, db->db_blkptr, |
34dc7c2f | 810 | dbuf_read_done, db, ZIO_PRIORITY_SYNC_READ, |
7f60329a | 811 | (flags & DB_RF_CANFAIL) ? ZIO_FLAG_CANFAIL : ZIO_FLAG_MUSTSUCCEED, |
34dc7c2f | 812 | &aflags, &zb); |
5f6d0b6f BB |
813 | |
814 | return (SET_ERROR(err)); | |
34dc7c2f BB |
815 | } |
816 | ||
817 | int | |
818 | dbuf_read(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags) | |
819 | { | |
820 | int err = 0; | |
b0bc7a84 MG |
821 | boolean_t havepzio = (zio != NULL); |
822 | boolean_t prefetch; | |
572e2857 | 823 | dnode_t *dn; |
34dc7c2f BB |
824 | |
825 | /* | |
826 | * We don't have to hold the mutex to check db_state because it | |
827 | * can't be freed while we have a hold on the buffer. | |
828 | */ | |
829 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
830 | ||
b128c09f | 831 | if (db->db_state == DB_NOFILL) |
2e528b49 | 832 | return (SET_ERROR(EIO)); |
b128c09f | 833 | |
572e2857 BB |
834 | DB_DNODE_ENTER(db); |
835 | dn = DB_DNODE(db); | |
34dc7c2f | 836 | if ((flags & DB_RF_HAVESTRUCT) == 0) |
572e2857 | 837 | rw_enter(&dn->dn_struct_rwlock, RW_READER); |
34dc7c2f | 838 | |
428870ff | 839 | prefetch = db->db_level == 0 && db->db_blkid != DMU_BONUS_BLKID && |
572e2857 | 840 | (flags & DB_RF_NOPREFETCH) == 0 && dn != NULL && |
b128c09f | 841 | DBUF_IS_CACHEABLE(db); |
34dc7c2f BB |
842 | |
843 | mutex_enter(&db->db_mtx); | |
844 | if (db->db_state == DB_CACHED) { | |
845 | mutex_exit(&db->db_mtx); | |
846 | if (prefetch) | |
7f60329a | 847 | dmu_zfetch(&dn->dn_zfetch, db->db_blkid, 1); |
34dc7c2f | 848 | if ((flags & DB_RF_HAVESTRUCT) == 0) |
572e2857 BB |
849 | rw_exit(&dn->dn_struct_rwlock); |
850 | DB_DNODE_EXIT(db); | |
34dc7c2f | 851 | } else if (db->db_state == DB_UNCACHED) { |
572e2857 BB |
852 | spa_t *spa = dn->dn_objset->os_spa; |
853 | ||
854 | if (zio == NULL) | |
855 | zio = zio_root(spa, NULL, NULL, ZIO_FLAG_CANFAIL); | |
5f6d0b6f | 856 | |
7f60329a | 857 | err = dbuf_read_impl(db, zio, flags); |
34dc7c2f BB |
858 | |
859 | /* dbuf_read_impl has dropped db_mtx for us */ | |
860 | ||
5f6d0b6f | 861 | if (!err && prefetch) |
7f60329a | 862 | dmu_zfetch(&dn->dn_zfetch, db->db_blkid, 1); |
34dc7c2f BB |
863 | |
864 | if ((flags & DB_RF_HAVESTRUCT) == 0) | |
572e2857 BB |
865 | rw_exit(&dn->dn_struct_rwlock); |
866 | DB_DNODE_EXIT(db); | |
34dc7c2f | 867 | |
5f6d0b6f | 868 | if (!err && !havepzio) |
34dc7c2f BB |
869 | err = zio_wait(zio); |
870 | } else { | |
e49f1e20 WA |
871 | /* |
872 | * Another reader came in while the dbuf was in flight | |
873 | * between UNCACHED and CACHED. Either a writer will finish | |
874 | * writing the buffer (sending the dbuf to CACHED) or the | |
875 | * first reader's request will reach the read_done callback | |
876 | * and send the dbuf to CACHED. Otherwise, a failure | |
877 | * occurred and the dbuf went to UNCACHED. | |
878 | */ | |
34dc7c2f BB |
879 | mutex_exit(&db->db_mtx); |
880 | if (prefetch) | |
7f60329a | 881 | dmu_zfetch(&dn->dn_zfetch, db->db_blkid, 1); |
34dc7c2f | 882 | if ((flags & DB_RF_HAVESTRUCT) == 0) |
572e2857 BB |
883 | rw_exit(&dn->dn_struct_rwlock); |
884 | DB_DNODE_EXIT(db); | |
34dc7c2f | 885 | |
e49f1e20 | 886 | /* Skip the wait per the caller's request. */ |
34dc7c2f BB |
887 | mutex_enter(&db->db_mtx); |
888 | if ((flags & DB_RF_NEVERWAIT) == 0) { | |
889 | while (db->db_state == DB_READ || | |
890 | db->db_state == DB_FILL) { | |
891 | ASSERT(db->db_state == DB_READ || | |
892 | (flags & DB_RF_HAVESTRUCT) == 0); | |
64dbba36 AL |
893 | DTRACE_PROBE2(blocked__read, dmu_buf_impl_t *, |
894 | db, zio_t *, zio); | |
34dc7c2f BB |
895 | cv_wait(&db->db_changed, &db->db_mtx); |
896 | } | |
897 | if (db->db_state == DB_UNCACHED) | |
2e528b49 | 898 | err = SET_ERROR(EIO); |
34dc7c2f BB |
899 | } |
900 | mutex_exit(&db->db_mtx); | |
901 | } | |
902 | ||
903 | ASSERT(err || havepzio || db->db_state == DB_CACHED); | |
904 | return (err); | |
905 | } | |
906 | ||
907 | static void | |
908 | dbuf_noread(dmu_buf_impl_t *db) | |
909 | { | |
910 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
428870ff | 911 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f BB |
912 | mutex_enter(&db->db_mtx); |
913 | while (db->db_state == DB_READ || db->db_state == DB_FILL) | |
914 | cv_wait(&db->db_changed, &db->db_mtx); | |
915 | if (db->db_state == DB_UNCACHED) { | |
916 | arc_buf_contents_t type = DBUF_GET_BUFC_TYPE(db); | |
b0bc7a84 | 917 | spa_t *spa = db->db_objset->os_spa; |
34dc7c2f BB |
918 | |
919 | ASSERT(db->db_buf == NULL); | |
920 | ASSERT(db->db.db_data == NULL); | |
572e2857 | 921 | dbuf_set_data(db, arc_buf_alloc(spa, db->db.db_size, db, type)); |
34dc7c2f | 922 | db->db_state = DB_FILL; |
b128c09f | 923 | } else if (db->db_state == DB_NOFILL) { |
0c66c32d | 924 | dbuf_clear_data(db); |
34dc7c2f BB |
925 | } else { |
926 | ASSERT3U(db->db_state, ==, DB_CACHED); | |
927 | } | |
928 | mutex_exit(&db->db_mtx); | |
929 | } | |
930 | ||
931 | /* | |
932 | * This is our just-in-time copy function. It makes a copy of | |
933 | * buffers, that have been modified in a previous transaction | |
934 | * group, before we modify them in the current active group. | |
935 | * | |
936 | * This function is used in two places: when we are dirtying a | |
937 | * buffer for the first time in a txg, and when we are freeing | |
938 | * a range in a dnode that includes this buffer. | |
939 | * | |
940 | * Note that when we are called from dbuf_free_range() we do | |
941 | * not put a hold on the buffer, we just traverse the active | |
942 | * dbuf list for the dnode. | |
943 | */ | |
944 | static void | |
945 | dbuf_fix_old_data(dmu_buf_impl_t *db, uint64_t txg) | |
946 | { | |
947 | dbuf_dirty_record_t *dr = db->db_last_dirty; | |
948 | ||
949 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
950 | ASSERT(db->db.db_data != NULL); | |
951 | ASSERT(db->db_level == 0); | |
952 | ASSERT(db->db.db_object != DMU_META_DNODE_OBJECT); | |
953 | ||
954 | if (dr == NULL || | |
955 | (dr->dt.dl.dr_data != | |
428870ff | 956 | ((db->db_blkid == DMU_BONUS_BLKID) ? db->db.db_data : db->db_buf))) |
34dc7c2f BB |
957 | return; |
958 | ||
959 | /* | |
960 | * If the last dirty record for this dbuf has not yet synced | |
961 | * and its referencing the dbuf data, either: | |
572e2857 | 962 | * reset the reference to point to a new copy, |
34dc7c2f BB |
963 | * or (if there a no active holders) |
964 | * just null out the current db_data pointer. | |
965 | */ | |
966 | ASSERT(dr->dr_txg >= txg - 2); | |
428870ff | 967 | if (db->db_blkid == DMU_BONUS_BLKID) { |
34dc7c2f | 968 | /* Note that the data bufs here are zio_bufs */ |
50c957f7 NB |
969 | dnode_t *dn = DB_DNODE(db); |
970 | int bonuslen = DN_SLOTS_TO_BONUSLEN(dn->dn_num_slots); | |
971 | dr->dt.dl.dr_data = zio_buf_alloc(bonuslen); | |
25458cbe | 972 | arc_space_consume(bonuslen, ARC_SPACE_BONUS); |
50c957f7 | 973 | bcopy(db->db.db_data, dr->dt.dl.dr_data, bonuslen); |
34dc7c2f BB |
974 | } else if (refcount_count(&db->db_holds) > db->db_dirtycnt) { |
975 | int size = db->db.db_size; | |
976 | arc_buf_contents_t type = DBUF_GET_BUFC_TYPE(db); | |
b0bc7a84 | 977 | spa_t *spa = db->db_objset->os_spa; |
572e2857 | 978 | |
572e2857 | 979 | dr->dt.dl.dr_data = arc_buf_alloc(spa, size, db, type); |
34dc7c2f BB |
980 | bcopy(db->db.db_data, dr->dt.dl.dr_data->b_data, size); |
981 | } else { | |
0c66c32d | 982 | dbuf_clear_data(db); |
34dc7c2f BB |
983 | } |
984 | } | |
985 | ||
986 | void | |
987 | dbuf_unoverride(dbuf_dirty_record_t *dr) | |
988 | { | |
989 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
428870ff | 990 | blkptr_t *bp = &dr->dt.dl.dr_overridden_by; |
34dc7c2f BB |
991 | uint64_t txg = dr->dr_txg; |
992 | ||
993 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
994 | ASSERT(dr->dt.dl.dr_override_state != DR_IN_DMU_SYNC); | |
995 | ASSERT(db->db_level == 0); | |
996 | ||
428870ff | 997 | if (db->db_blkid == DMU_BONUS_BLKID || |
34dc7c2f BB |
998 | dr->dt.dl.dr_override_state == DR_NOT_OVERRIDDEN) |
999 | return; | |
1000 | ||
428870ff BB |
1001 | ASSERT(db->db_data_pending != dr); |
1002 | ||
34dc7c2f | 1003 | /* free this block */ |
b0bc7a84 MG |
1004 | if (!BP_IS_HOLE(bp) && !dr->dt.dl.dr_nopwrite) |
1005 | zio_free(db->db_objset->os_spa, txg, bp); | |
428870ff | 1006 | |
34dc7c2f | 1007 | dr->dt.dl.dr_override_state = DR_NOT_OVERRIDDEN; |
03c6040b GW |
1008 | dr->dt.dl.dr_nopwrite = B_FALSE; |
1009 | ||
34dc7c2f BB |
1010 | /* |
1011 | * Release the already-written buffer, so we leave it in | |
1012 | * a consistent dirty state. Note that all callers are | |
1013 | * modifying the buffer, so they will immediately do | |
1014 | * another (redundant) arc_release(). Therefore, leave | |
1015 | * the buf thawed to save the effort of freezing & | |
1016 | * immediately re-thawing it. | |
1017 | */ | |
1018 | arc_release(dr->dt.dl.dr_data, db); | |
1019 | } | |
1020 | ||
b128c09f BB |
1021 | /* |
1022 | * Evict (if its unreferenced) or clear (if its referenced) any level-0 | |
1023 | * data blocks in the free range, so that any future readers will find | |
b0bc7a84 | 1024 | * empty blocks. |
ea97f8ce MA |
1025 | * |
1026 | * This is a no-op if the dataset is in the middle of an incremental | |
1027 | * receive; see comment below for details. | |
b128c09f | 1028 | */ |
34dc7c2f | 1029 | void |
8951cb8d AR |
1030 | dbuf_free_range(dnode_t *dn, uint64_t start_blkid, uint64_t end_blkid, |
1031 | dmu_tx_t *tx) | |
34dc7c2f | 1032 | { |
0c66c32d JG |
1033 | dmu_buf_impl_t *db_search; |
1034 | dmu_buf_impl_t *db, *db_next; | |
34dc7c2f | 1035 | uint64_t txg = tx->tx_txg; |
8951cb8d | 1036 | avl_index_t where; |
4254acb0 | 1037 | boolean_t freespill = |
8951cb8d AR |
1038 | (start_blkid == DMU_SPILL_BLKID || end_blkid == DMU_SPILL_BLKID); |
1039 | ||
1040 | if (end_blkid > dn->dn_maxblkid && !freespill) | |
1041 | end_blkid = dn->dn_maxblkid; | |
1042 | dprintf_dnode(dn, "start=%llu end=%llu\n", start_blkid, end_blkid); | |
34dc7c2f | 1043 | |
0c66c32d | 1044 | db_search = kmem_alloc(sizeof (dmu_buf_impl_t), KM_SLEEP); |
8951cb8d AR |
1045 | db_search->db_level = 0; |
1046 | db_search->db_blkid = start_blkid; | |
9925c28c | 1047 | db_search->db_state = DB_SEARCH; |
ea97f8ce | 1048 | |
b663a23d | 1049 | mutex_enter(&dn->dn_dbufs_mtx); |
8951cb8d | 1050 | if (start_blkid >= dn->dn_unlisted_l0_blkid && !freespill) { |
b663a23d | 1051 | /* There can't be any dbufs in this range; no need to search. */ |
8951cb8d AR |
1052 | #ifdef DEBUG |
1053 | db = avl_find(&dn->dn_dbufs, db_search, &where); | |
1054 | ASSERT3P(db, ==, NULL); | |
1055 | db = avl_nearest(&dn->dn_dbufs, where, AVL_AFTER); | |
1056 | ASSERT(db == NULL || db->db_level > 0); | |
1057 | #endif | |
1058 | goto out; | |
b663a23d | 1059 | } else if (dmu_objset_is_receiving(dn->dn_objset)) { |
ea97f8ce | 1060 | /* |
b663a23d MA |
1061 | * If we are receiving, we expect there to be no dbufs in |
1062 | * the range to be freed, because receive modifies each | |
1063 | * block at most once, and in offset order. If this is | |
1064 | * not the case, it can lead to performance problems, | |
1065 | * so note that we unexpectedly took the slow path. | |
ea97f8ce | 1066 | */ |
b663a23d | 1067 | atomic_inc_64(&zfs_free_range_recv_miss); |
ea97f8ce MA |
1068 | } |
1069 | ||
8951cb8d AR |
1070 | db = avl_find(&dn->dn_dbufs, db_search, &where); |
1071 | ASSERT3P(db, ==, NULL); | |
1072 | db = avl_nearest(&dn->dn_dbufs, where, AVL_AFTER); | |
1073 | ||
1074 | for (; db != NULL; db = db_next) { | |
1075 | db_next = AVL_NEXT(&dn->dn_dbufs, db); | |
428870ff | 1076 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
b128c09f | 1077 | |
8951cb8d AR |
1078 | if (db->db_level != 0 || db->db_blkid > end_blkid) { |
1079 | break; | |
1080 | } | |
1081 | ASSERT3U(db->db_blkid, >=, start_blkid); | |
34dc7c2f BB |
1082 | |
1083 | /* found a level 0 buffer in the range */ | |
13fe0198 MA |
1084 | mutex_enter(&db->db_mtx); |
1085 | if (dbuf_undirty(db, tx)) { | |
1086 | /* mutex has been dropped and dbuf destroyed */ | |
34dc7c2f | 1087 | continue; |
13fe0198 | 1088 | } |
34dc7c2f | 1089 | |
34dc7c2f | 1090 | if (db->db_state == DB_UNCACHED || |
b128c09f | 1091 | db->db_state == DB_NOFILL || |
34dc7c2f BB |
1092 | db->db_state == DB_EVICTING) { |
1093 | ASSERT(db->db.db_data == NULL); | |
1094 | mutex_exit(&db->db_mtx); | |
1095 | continue; | |
1096 | } | |
1097 | if (db->db_state == DB_READ || db->db_state == DB_FILL) { | |
1098 | /* will be handled in dbuf_read_done or dbuf_rele */ | |
1099 | db->db_freed_in_flight = TRUE; | |
1100 | mutex_exit(&db->db_mtx); | |
1101 | continue; | |
1102 | } | |
1103 | if (refcount_count(&db->db_holds) == 0) { | |
1104 | ASSERT(db->db_buf); | |
1105 | dbuf_clear(db); | |
1106 | continue; | |
1107 | } | |
1108 | /* The dbuf is referenced */ | |
1109 | ||
1110 | if (db->db_last_dirty != NULL) { | |
1111 | dbuf_dirty_record_t *dr = db->db_last_dirty; | |
1112 | ||
1113 | if (dr->dr_txg == txg) { | |
1114 | /* | |
1115 | * This buffer is "in-use", re-adjust the file | |
1116 | * size to reflect that this buffer may | |
1117 | * contain new data when we sync. | |
1118 | */ | |
428870ff BB |
1119 | if (db->db_blkid != DMU_SPILL_BLKID && |
1120 | db->db_blkid > dn->dn_maxblkid) | |
34dc7c2f BB |
1121 | dn->dn_maxblkid = db->db_blkid; |
1122 | dbuf_unoverride(dr); | |
1123 | } else { | |
1124 | /* | |
1125 | * This dbuf is not dirty in the open context. | |
1126 | * Either uncache it (if its not referenced in | |
1127 | * the open context) or reset its contents to | |
1128 | * empty. | |
1129 | */ | |
1130 | dbuf_fix_old_data(db, txg); | |
1131 | } | |
1132 | } | |
1133 | /* clear the contents if its cached */ | |
1134 | if (db->db_state == DB_CACHED) { | |
1135 | ASSERT(db->db.db_data != NULL); | |
1136 | arc_release(db->db_buf, db); | |
1137 | bzero(db->db.db_data, db->db.db_size); | |
1138 | arc_buf_freeze(db->db_buf); | |
1139 | } | |
1140 | ||
1141 | mutex_exit(&db->db_mtx); | |
1142 | } | |
8951cb8d AR |
1143 | |
1144 | out: | |
1145 | kmem_free(db_search, sizeof (dmu_buf_impl_t)); | |
34dc7c2f BB |
1146 | mutex_exit(&dn->dn_dbufs_mtx); |
1147 | } | |
1148 | ||
1149 | static int | |
1150 | dbuf_block_freeable(dmu_buf_impl_t *db) | |
1151 | { | |
1152 | dsl_dataset_t *ds = db->db_objset->os_dsl_dataset; | |
1153 | uint64_t birth_txg = 0; | |
1154 | ||
1155 | /* | |
1156 | * We don't need any locking to protect db_blkptr: | |
1157 | * If it's syncing, then db_last_dirty will be set | |
1158 | * so we'll ignore db_blkptr. | |
b0bc7a84 MG |
1159 | * |
1160 | * This logic ensures that only block births for | |
1161 | * filled blocks are considered. | |
34dc7c2f BB |
1162 | */ |
1163 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
b0bc7a84 MG |
1164 | if (db->db_last_dirty && (db->db_blkptr == NULL || |
1165 | !BP_IS_HOLE(db->db_blkptr))) { | |
34dc7c2f | 1166 | birth_txg = db->db_last_dirty->dr_txg; |
b0bc7a84 | 1167 | } else if (db->db_blkptr != NULL && !BP_IS_HOLE(db->db_blkptr)) { |
34dc7c2f | 1168 | birth_txg = db->db_blkptr->blk_birth; |
b0bc7a84 | 1169 | } |
34dc7c2f | 1170 | |
572e2857 | 1171 | /* |
b0bc7a84 | 1172 | * If this block don't exist or is in a snapshot, it can't be freed. |
572e2857 BB |
1173 | * Don't pass the bp to dsl_dataset_block_freeable() since we |
1174 | * are holding the db_mtx lock and might deadlock if we are | |
1175 | * prefetching a dedup-ed block. | |
1176 | */ | |
b0bc7a84 | 1177 | if (birth_txg != 0) |
34dc7c2f | 1178 | return (ds == NULL || |
572e2857 | 1179 | dsl_dataset_block_freeable(ds, NULL, birth_txg)); |
34dc7c2f | 1180 | else |
b0bc7a84 | 1181 | return (B_FALSE); |
34dc7c2f BB |
1182 | } |
1183 | ||
1184 | void | |
1185 | dbuf_new_size(dmu_buf_impl_t *db, int size, dmu_tx_t *tx) | |
1186 | { | |
1187 | arc_buf_t *buf, *obuf; | |
1188 | int osize = db->db.db_size; | |
1189 | arc_buf_contents_t type = DBUF_GET_BUFC_TYPE(db); | |
572e2857 | 1190 | dnode_t *dn; |
34dc7c2f | 1191 | |
428870ff | 1192 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f | 1193 | |
572e2857 BB |
1194 | DB_DNODE_ENTER(db); |
1195 | dn = DB_DNODE(db); | |
1196 | ||
34dc7c2f | 1197 | /* XXX does *this* func really need the lock? */ |
572e2857 | 1198 | ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); |
34dc7c2f BB |
1199 | |
1200 | /* | |
b0bc7a84 | 1201 | * This call to dmu_buf_will_dirty() with the dn_struct_rwlock held |
34dc7c2f BB |
1202 | * is OK, because there can be no other references to the db |
1203 | * when we are changing its size, so no concurrent DB_FILL can | |
1204 | * be happening. | |
1205 | */ | |
1206 | /* | |
1207 | * XXX we should be doing a dbuf_read, checking the return | |
1208 | * value and returning that up to our callers | |
1209 | */ | |
b0bc7a84 | 1210 | dmu_buf_will_dirty(&db->db, tx); |
34dc7c2f BB |
1211 | |
1212 | /* create the data buffer for the new block */ | |
572e2857 | 1213 | buf = arc_buf_alloc(dn->dn_objset->os_spa, size, db, type); |
34dc7c2f BB |
1214 | |
1215 | /* copy old block data to the new block */ | |
1216 | obuf = db->db_buf; | |
1217 | bcopy(obuf->b_data, buf->b_data, MIN(osize, size)); | |
1218 | /* zero the remainder */ | |
1219 | if (size > osize) | |
1220 | bzero((uint8_t *)buf->b_data + osize, size - osize); | |
1221 | ||
1222 | mutex_enter(&db->db_mtx); | |
1223 | dbuf_set_data(db, buf); | |
13fe0198 | 1224 | VERIFY(arc_buf_remove_ref(obuf, db)); |
34dc7c2f BB |
1225 | db->db.db_size = size; |
1226 | ||
1227 | if (db->db_level == 0) { | |
1228 | ASSERT3U(db->db_last_dirty->dr_txg, ==, tx->tx_txg); | |
1229 | db->db_last_dirty->dt.dl.dr_data = buf; | |
1230 | } | |
1231 | mutex_exit(&db->db_mtx); | |
1232 | ||
572e2857 BB |
1233 | dnode_willuse_space(dn, size-osize, tx); |
1234 | DB_DNODE_EXIT(db); | |
34dc7c2f BB |
1235 | } |
1236 | ||
428870ff BB |
1237 | void |
1238 | dbuf_release_bp(dmu_buf_impl_t *db) | |
1239 | { | |
b0bc7a84 | 1240 | ASSERTV(objset_t *os = db->db_objset); |
428870ff BB |
1241 | |
1242 | ASSERT(dsl_pool_sync_context(dmu_objset_pool(os))); | |
1243 | ASSERT(arc_released(os->os_phys_buf) || | |
1244 | list_link_active(&os->os_dsl_dataset->ds_synced_link)); | |
1245 | ASSERT(db->db_parent == NULL || arc_released(db->db_parent->db_buf)); | |
1246 | ||
294f6806 | 1247 | (void) arc_release(db->db_buf, db); |
428870ff BB |
1248 | } |
1249 | ||
5a28a973 MA |
1250 | /* |
1251 | * We already have a dirty record for this TXG, and we are being | |
1252 | * dirtied again. | |
1253 | */ | |
1254 | static void | |
1255 | dbuf_redirty(dbuf_dirty_record_t *dr) | |
1256 | { | |
1257 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
1258 | ||
1259 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
1260 | ||
1261 | if (db->db_level == 0 && db->db_blkid != DMU_BONUS_BLKID) { | |
1262 | /* | |
1263 | * If this buffer has already been written out, | |
1264 | * we now need to reset its state. | |
1265 | */ | |
1266 | dbuf_unoverride(dr); | |
1267 | if (db->db.db_object != DMU_META_DNODE_OBJECT && | |
1268 | db->db_state != DB_NOFILL) { | |
1269 | /* Already released on initial dirty, so just thaw. */ | |
1270 | ASSERT(arc_released(db->db_buf)); | |
1271 | arc_buf_thaw(db->db_buf); | |
1272 | } | |
1273 | } | |
1274 | } | |
1275 | ||
34dc7c2f BB |
1276 | dbuf_dirty_record_t * |
1277 | dbuf_dirty(dmu_buf_impl_t *db, dmu_tx_t *tx) | |
1278 | { | |
572e2857 BB |
1279 | dnode_t *dn; |
1280 | objset_t *os; | |
34dc7c2f BB |
1281 | dbuf_dirty_record_t **drp, *dr; |
1282 | int drop_struct_lock = FALSE; | |
b128c09f | 1283 | boolean_t do_free_accounting = B_FALSE; |
34dc7c2f BB |
1284 | int txgoff = tx->tx_txg & TXG_MASK; |
1285 | ||
1286 | ASSERT(tx->tx_txg != 0); | |
1287 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
1288 | DMU_TX_DIRTY_BUF(tx, db); | |
1289 | ||
572e2857 BB |
1290 | DB_DNODE_ENTER(db); |
1291 | dn = DB_DNODE(db); | |
34dc7c2f BB |
1292 | /* |
1293 | * Shouldn't dirty a regular buffer in syncing context. Private | |
1294 | * objects may be dirtied in syncing context, but only if they | |
1295 | * were already pre-dirtied in open context. | |
34dc7c2f BB |
1296 | */ |
1297 | ASSERT(!dmu_tx_is_syncing(tx) || | |
1298 | BP_IS_HOLE(dn->dn_objset->os_rootbp) || | |
9babb374 BB |
1299 | DMU_OBJECT_IS_SPECIAL(dn->dn_object) || |
1300 | dn->dn_objset->os_dsl_dataset == NULL); | |
34dc7c2f BB |
1301 | /* |
1302 | * We make this assert for private objects as well, but after we | |
1303 | * check if we're already dirty. They are allowed to re-dirty | |
1304 | * in syncing context. | |
1305 | */ | |
1306 | ASSERT(dn->dn_object == DMU_META_DNODE_OBJECT || | |
1307 | dn->dn_dirtyctx == DN_UNDIRTIED || dn->dn_dirtyctx == | |
1308 | (dmu_tx_is_syncing(tx) ? DN_DIRTY_SYNC : DN_DIRTY_OPEN)); | |
1309 | ||
1310 | mutex_enter(&db->db_mtx); | |
1311 | /* | |
1312 | * XXX make this true for indirects too? The problem is that | |
1313 | * transactions created with dmu_tx_create_assigned() from | |
1314 | * syncing context don't bother holding ahead. | |
1315 | */ | |
1316 | ASSERT(db->db_level != 0 || | |
b128c09f BB |
1317 | db->db_state == DB_CACHED || db->db_state == DB_FILL || |
1318 | db->db_state == DB_NOFILL); | |
34dc7c2f BB |
1319 | |
1320 | mutex_enter(&dn->dn_mtx); | |
1321 | /* | |
1322 | * Don't set dirtyctx to SYNC if we're just modifying this as we | |
1323 | * initialize the objset. | |
1324 | */ | |
1325 | if (dn->dn_dirtyctx == DN_UNDIRTIED && | |
1326 | !BP_IS_HOLE(dn->dn_objset->os_rootbp)) { | |
1327 | dn->dn_dirtyctx = | |
1328 | (dmu_tx_is_syncing(tx) ? DN_DIRTY_SYNC : DN_DIRTY_OPEN); | |
1329 | ASSERT(dn->dn_dirtyctx_firstset == NULL); | |
79c76d5b | 1330 | dn->dn_dirtyctx_firstset = kmem_alloc(1, KM_SLEEP); |
34dc7c2f BB |
1331 | } |
1332 | mutex_exit(&dn->dn_mtx); | |
1333 | ||
428870ff BB |
1334 | if (db->db_blkid == DMU_SPILL_BLKID) |
1335 | dn->dn_have_spill = B_TRUE; | |
1336 | ||
34dc7c2f BB |
1337 | /* |
1338 | * If this buffer is already dirty, we're done. | |
1339 | */ | |
1340 | drp = &db->db_last_dirty; | |
1341 | ASSERT(*drp == NULL || (*drp)->dr_txg <= tx->tx_txg || | |
1342 | db->db.db_object == DMU_META_DNODE_OBJECT); | |
1343 | while ((dr = *drp) != NULL && dr->dr_txg > tx->tx_txg) | |
1344 | drp = &dr->dr_next; | |
1345 | if (dr && dr->dr_txg == tx->tx_txg) { | |
572e2857 BB |
1346 | DB_DNODE_EXIT(db); |
1347 | ||
5a28a973 | 1348 | dbuf_redirty(dr); |
34dc7c2f BB |
1349 | mutex_exit(&db->db_mtx); |
1350 | return (dr); | |
1351 | } | |
1352 | ||
1353 | /* | |
1354 | * Only valid if not already dirty. | |
1355 | */ | |
9babb374 BB |
1356 | ASSERT(dn->dn_object == 0 || |
1357 | dn->dn_dirtyctx == DN_UNDIRTIED || dn->dn_dirtyctx == | |
34dc7c2f BB |
1358 | (dmu_tx_is_syncing(tx) ? DN_DIRTY_SYNC : DN_DIRTY_OPEN)); |
1359 | ||
1360 | ASSERT3U(dn->dn_nlevels, >, db->db_level); | |
1361 | ASSERT((dn->dn_phys->dn_nlevels == 0 && db->db_level == 0) || | |
1362 | dn->dn_phys->dn_nlevels > db->db_level || | |
1363 | dn->dn_next_nlevels[txgoff] > db->db_level || | |
1364 | dn->dn_next_nlevels[(tx->tx_txg-1) & TXG_MASK] > db->db_level || | |
1365 | dn->dn_next_nlevels[(tx->tx_txg-2) & TXG_MASK] > db->db_level); | |
1366 | ||
1367 | /* | |
1368 | * We should only be dirtying in syncing context if it's the | |
9babb374 BB |
1369 | * mos or we're initializing the os or it's a special object. |
1370 | * However, we are allowed to dirty in syncing context provided | |
1371 | * we already dirtied it in open context. Hence we must make | |
1372 | * this assertion only if we're not already dirty. | |
34dc7c2f | 1373 | */ |
572e2857 | 1374 | os = dn->dn_objset; |
9babb374 BB |
1375 | ASSERT(!dmu_tx_is_syncing(tx) || DMU_OBJECT_IS_SPECIAL(dn->dn_object) || |
1376 | os->os_dsl_dataset == NULL || BP_IS_HOLE(os->os_rootbp)); | |
34dc7c2f BB |
1377 | ASSERT(db->db.db_size != 0); |
1378 | ||
1379 | dprintf_dbuf(db, "size=%llx\n", (u_longlong_t)db->db.db_size); | |
1380 | ||
428870ff | 1381 | if (db->db_blkid != DMU_BONUS_BLKID) { |
34dc7c2f BB |
1382 | /* |
1383 | * Update the accounting. | |
b128c09f BB |
1384 | * Note: we delay "free accounting" until after we drop |
1385 | * the db_mtx. This keeps us from grabbing other locks | |
428870ff | 1386 | * (and possibly deadlocking) in bp_get_dsize() while |
b128c09f | 1387 | * also holding the db_mtx. |
34dc7c2f | 1388 | */ |
34dc7c2f | 1389 | dnode_willuse_space(dn, db->db.db_size, tx); |
b128c09f | 1390 | do_free_accounting = dbuf_block_freeable(db); |
34dc7c2f BB |
1391 | } |
1392 | ||
1393 | /* | |
1394 | * If this buffer is dirty in an old transaction group we need | |
1395 | * to make a copy of it so that the changes we make in this | |
1396 | * transaction group won't leak out when we sync the older txg. | |
1397 | */ | |
79c76d5b | 1398 | dr = kmem_zalloc(sizeof (dbuf_dirty_record_t), KM_SLEEP); |
98f72a53 | 1399 | list_link_init(&dr->dr_dirty_node); |
34dc7c2f BB |
1400 | if (db->db_level == 0) { |
1401 | void *data_old = db->db_buf; | |
1402 | ||
b128c09f | 1403 | if (db->db_state != DB_NOFILL) { |
428870ff | 1404 | if (db->db_blkid == DMU_BONUS_BLKID) { |
b128c09f BB |
1405 | dbuf_fix_old_data(db, tx->tx_txg); |
1406 | data_old = db->db.db_data; | |
1407 | } else if (db->db.db_object != DMU_META_DNODE_OBJECT) { | |
1408 | /* | |
1409 | * Release the data buffer from the cache so | |
1410 | * that we can modify it without impacting | |
1411 | * possible other users of this cached data | |
1412 | * block. Note that indirect blocks and | |
1413 | * private objects are not released until the | |
1414 | * syncing state (since they are only modified | |
1415 | * then). | |
1416 | */ | |
1417 | arc_release(db->db_buf, db); | |
1418 | dbuf_fix_old_data(db, tx->tx_txg); | |
1419 | data_old = db->db_buf; | |
1420 | } | |
1421 | ASSERT(data_old != NULL); | |
34dc7c2f | 1422 | } |
34dc7c2f BB |
1423 | dr->dt.dl.dr_data = data_old; |
1424 | } else { | |
448d7aaa | 1425 | mutex_init(&dr->dt.di.dr_mtx, NULL, MUTEX_NOLOCKDEP, NULL); |
34dc7c2f BB |
1426 | list_create(&dr->dt.di.dr_children, |
1427 | sizeof (dbuf_dirty_record_t), | |
1428 | offsetof(dbuf_dirty_record_t, dr_dirty_node)); | |
1429 | } | |
e8b96c60 MA |
1430 | if (db->db_blkid != DMU_BONUS_BLKID && os->os_dsl_dataset != NULL) |
1431 | dr->dr_accounted = db->db.db_size; | |
34dc7c2f BB |
1432 | dr->dr_dbuf = db; |
1433 | dr->dr_txg = tx->tx_txg; | |
1434 | dr->dr_next = *drp; | |
1435 | *drp = dr; | |
1436 | ||
1437 | /* | |
1438 | * We could have been freed_in_flight between the dbuf_noread | |
1439 | * and dbuf_dirty. We win, as though the dbuf_noread() had | |
1440 | * happened after the free. | |
1441 | */ | |
428870ff BB |
1442 | if (db->db_level == 0 && db->db_blkid != DMU_BONUS_BLKID && |
1443 | db->db_blkid != DMU_SPILL_BLKID) { | |
34dc7c2f | 1444 | mutex_enter(&dn->dn_mtx); |
9bd274dd MA |
1445 | if (dn->dn_free_ranges[txgoff] != NULL) { |
1446 | range_tree_clear(dn->dn_free_ranges[txgoff], | |
1447 | db->db_blkid, 1); | |
1448 | } | |
34dc7c2f BB |
1449 | mutex_exit(&dn->dn_mtx); |
1450 | db->db_freed_in_flight = FALSE; | |
1451 | } | |
1452 | ||
1453 | /* | |
1454 | * This buffer is now part of this txg | |
1455 | */ | |
1456 | dbuf_add_ref(db, (void *)(uintptr_t)tx->tx_txg); | |
1457 | db->db_dirtycnt += 1; | |
1458 | ASSERT3U(db->db_dirtycnt, <=, 3); | |
1459 | ||
1460 | mutex_exit(&db->db_mtx); | |
1461 | ||
428870ff BB |
1462 | if (db->db_blkid == DMU_BONUS_BLKID || |
1463 | db->db_blkid == DMU_SPILL_BLKID) { | |
34dc7c2f BB |
1464 | mutex_enter(&dn->dn_mtx); |
1465 | ASSERT(!list_link_active(&dr->dr_dirty_node)); | |
1466 | list_insert_tail(&dn->dn_dirty_records[txgoff], dr); | |
1467 | mutex_exit(&dn->dn_mtx); | |
1468 | dnode_setdirty(dn, tx); | |
572e2857 | 1469 | DB_DNODE_EXIT(db); |
34dc7c2f | 1470 | return (dr); |
b128c09f BB |
1471 | } else if (do_free_accounting) { |
1472 | blkptr_t *bp = db->db_blkptr; | |
1473 | int64_t willfree = (bp && !BP_IS_HOLE(bp)) ? | |
428870ff | 1474 | bp_get_dsize(os->os_spa, bp) : db->db.db_size; |
b128c09f BB |
1475 | /* |
1476 | * This is only a guess -- if the dbuf is dirty | |
1477 | * in a previous txg, we don't know how much | |
1478 | * space it will use on disk yet. We should | |
1479 | * really have the struct_rwlock to access | |
1480 | * db_blkptr, but since this is just a guess, | |
1481 | * it's OK if we get an odd answer. | |
1482 | */ | |
572e2857 | 1483 | ddt_prefetch(os->os_spa, bp); |
b128c09f | 1484 | dnode_willuse_space(dn, -willfree, tx); |
34dc7c2f BB |
1485 | } |
1486 | ||
1487 | if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { | |
1488 | rw_enter(&dn->dn_struct_rwlock, RW_READER); | |
1489 | drop_struct_lock = TRUE; | |
1490 | } | |
1491 | ||
b128c09f BB |
1492 | if (db->db_level == 0) { |
1493 | dnode_new_blkid(dn, db->db_blkid, tx, drop_struct_lock); | |
1494 | ASSERT(dn->dn_maxblkid >= db->db_blkid); | |
1495 | } | |
1496 | ||
34dc7c2f BB |
1497 | if (db->db_level+1 < dn->dn_nlevels) { |
1498 | dmu_buf_impl_t *parent = db->db_parent; | |
1499 | dbuf_dirty_record_t *di; | |
1500 | int parent_held = FALSE; | |
1501 | ||
1502 | if (db->db_parent == NULL || db->db_parent == dn->dn_dbuf) { | |
1503 | int epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; | |
1504 | ||
1505 | parent = dbuf_hold_level(dn, db->db_level+1, | |
1506 | db->db_blkid >> epbs, FTAG); | |
428870ff | 1507 | ASSERT(parent != NULL); |
34dc7c2f BB |
1508 | parent_held = TRUE; |
1509 | } | |
1510 | if (drop_struct_lock) | |
1511 | rw_exit(&dn->dn_struct_rwlock); | |
1512 | ASSERT3U(db->db_level+1, ==, parent->db_level); | |
1513 | di = dbuf_dirty(parent, tx); | |
1514 | if (parent_held) | |
1515 | dbuf_rele(parent, FTAG); | |
1516 | ||
1517 | mutex_enter(&db->db_mtx); | |
e8b96c60 MA |
1518 | /* |
1519 | * Since we've dropped the mutex, it's possible that | |
1520 | * dbuf_undirty() might have changed this out from under us. | |
1521 | */ | |
34dc7c2f BB |
1522 | if (db->db_last_dirty == dr || |
1523 | dn->dn_object == DMU_META_DNODE_OBJECT) { | |
1524 | mutex_enter(&di->dt.di.dr_mtx); | |
1525 | ASSERT3U(di->dr_txg, ==, tx->tx_txg); | |
1526 | ASSERT(!list_link_active(&dr->dr_dirty_node)); | |
1527 | list_insert_tail(&di->dt.di.dr_children, dr); | |
1528 | mutex_exit(&di->dt.di.dr_mtx); | |
1529 | dr->dr_parent = di; | |
1530 | } | |
1531 | mutex_exit(&db->db_mtx); | |
1532 | } else { | |
1533 | ASSERT(db->db_level+1 == dn->dn_nlevels); | |
1534 | ASSERT(db->db_blkid < dn->dn_nblkptr); | |
572e2857 | 1535 | ASSERT(db->db_parent == NULL || db->db_parent == dn->dn_dbuf); |
34dc7c2f BB |
1536 | mutex_enter(&dn->dn_mtx); |
1537 | ASSERT(!list_link_active(&dr->dr_dirty_node)); | |
1538 | list_insert_tail(&dn->dn_dirty_records[txgoff], dr); | |
1539 | mutex_exit(&dn->dn_mtx); | |
1540 | if (drop_struct_lock) | |
1541 | rw_exit(&dn->dn_struct_rwlock); | |
1542 | } | |
1543 | ||
1544 | dnode_setdirty(dn, tx); | |
572e2857 | 1545 | DB_DNODE_EXIT(db); |
34dc7c2f BB |
1546 | return (dr); |
1547 | } | |
1548 | ||
13fe0198 | 1549 | /* |
e49f1e20 WA |
1550 | * Undirty a buffer in the transaction group referenced by the given |
1551 | * transaction. Return whether this evicted the dbuf. | |
13fe0198 MA |
1552 | */ |
1553 | static boolean_t | |
34dc7c2f BB |
1554 | dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx) |
1555 | { | |
572e2857 | 1556 | dnode_t *dn; |
34dc7c2f BB |
1557 | uint64_t txg = tx->tx_txg; |
1558 | dbuf_dirty_record_t *dr, **drp; | |
1559 | ||
1560 | ASSERT(txg != 0); | |
4bda3bd0 MA |
1561 | |
1562 | /* | |
1563 | * Due to our use of dn_nlevels below, this can only be called | |
1564 | * in open context, unless we are operating on the MOS. | |
1565 | * From syncing context, dn_nlevels may be different from the | |
1566 | * dn_nlevels used when dbuf was dirtied. | |
1567 | */ | |
1568 | ASSERT(db->db_objset == | |
1569 | dmu_objset_pool(db->db_objset)->dp_meta_objset || | |
1570 | txg != spa_syncing_txg(dmu_objset_spa(db->db_objset))); | |
428870ff | 1571 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
13fe0198 MA |
1572 | ASSERT0(db->db_level); |
1573 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
34dc7c2f | 1574 | |
34dc7c2f BB |
1575 | /* |
1576 | * If this buffer is not dirty, we're done. | |
1577 | */ | |
1578 | for (drp = &db->db_last_dirty; (dr = *drp) != NULL; drp = &dr->dr_next) | |
1579 | if (dr->dr_txg <= txg) | |
1580 | break; | |
13fe0198 MA |
1581 | if (dr == NULL || dr->dr_txg < txg) |
1582 | return (B_FALSE); | |
34dc7c2f | 1583 | ASSERT(dr->dr_txg == txg); |
428870ff | 1584 | ASSERT(dr->dr_dbuf == db); |
34dc7c2f | 1585 | |
572e2857 BB |
1586 | DB_DNODE_ENTER(db); |
1587 | dn = DB_DNODE(db); | |
1588 | ||
34dc7c2f BB |
1589 | dprintf_dbuf(db, "size=%llx\n", (u_longlong_t)db->db.db_size); |
1590 | ||
1591 | ASSERT(db->db.db_size != 0); | |
1592 | ||
4bda3bd0 MA |
1593 | dsl_pool_undirty_space(dmu_objset_pool(dn->dn_objset), |
1594 | dr->dr_accounted, txg); | |
34dc7c2f BB |
1595 | |
1596 | *drp = dr->dr_next; | |
1597 | ||
ef3c1dea GR |
1598 | /* |
1599 | * Note that there are three places in dbuf_dirty() | |
1600 | * where this dirty record may be put on a list. | |
1601 | * Make sure to do a list_remove corresponding to | |
1602 | * every one of those list_insert calls. | |
1603 | */ | |
34dc7c2f BB |
1604 | if (dr->dr_parent) { |
1605 | mutex_enter(&dr->dr_parent->dt.di.dr_mtx); | |
1606 | list_remove(&dr->dr_parent->dt.di.dr_children, dr); | |
1607 | mutex_exit(&dr->dr_parent->dt.di.dr_mtx); | |
ef3c1dea | 1608 | } else if (db->db_blkid == DMU_SPILL_BLKID || |
4bda3bd0 | 1609 | db->db_level + 1 == dn->dn_nlevels) { |
b128c09f | 1610 | ASSERT(db->db_blkptr == NULL || db->db_parent == dn->dn_dbuf); |
34dc7c2f BB |
1611 | mutex_enter(&dn->dn_mtx); |
1612 | list_remove(&dn->dn_dirty_records[txg & TXG_MASK], dr); | |
1613 | mutex_exit(&dn->dn_mtx); | |
1614 | } | |
572e2857 | 1615 | DB_DNODE_EXIT(db); |
34dc7c2f | 1616 | |
13fe0198 MA |
1617 | if (db->db_state != DB_NOFILL) { |
1618 | dbuf_unoverride(dr); | |
34dc7c2f | 1619 | |
34dc7c2f | 1620 | ASSERT(db->db_buf != NULL); |
13fe0198 MA |
1621 | ASSERT(dr->dt.dl.dr_data != NULL); |
1622 | if (dr->dt.dl.dr_data != db->db_buf) | |
1623 | VERIFY(arc_buf_remove_ref(dr->dt.dl.dr_data, db)); | |
34dc7c2f | 1624 | } |
58c4aa00 | 1625 | |
34dc7c2f BB |
1626 | kmem_free(dr, sizeof (dbuf_dirty_record_t)); |
1627 | ||
1628 | ASSERT(db->db_dirtycnt > 0); | |
1629 | db->db_dirtycnt -= 1; | |
1630 | ||
1631 | if (refcount_remove(&db->db_holds, (void *)(uintptr_t)txg) == 0) { | |
1632 | arc_buf_t *buf = db->db_buf; | |
1633 | ||
428870ff | 1634 | ASSERT(db->db_state == DB_NOFILL || arc_released(buf)); |
0c66c32d | 1635 | dbuf_clear_data(db); |
13fe0198 | 1636 | VERIFY(arc_buf_remove_ref(buf, db)); |
34dc7c2f | 1637 | dbuf_evict(db); |
13fe0198 | 1638 | return (B_TRUE); |
34dc7c2f BB |
1639 | } |
1640 | ||
13fe0198 | 1641 | return (B_FALSE); |
34dc7c2f BB |
1642 | } |
1643 | ||
34dc7c2f | 1644 | void |
b0bc7a84 | 1645 | dmu_buf_will_dirty(dmu_buf_t *db_fake, dmu_tx_t *tx) |
34dc7c2f | 1646 | { |
b0bc7a84 | 1647 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; |
34dc7c2f | 1648 | int rf = DB_RF_MUST_SUCCEED | DB_RF_NOPREFETCH; |
5a28a973 | 1649 | dbuf_dirty_record_t *dr; |
34dc7c2f BB |
1650 | |
1651 | ASSERT(tx->tx_txg != 0); | |
1652 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
1653 | ||
5a28a973 MA |
1654 | /* |
1655 | * Quick check for dirtyness. For already dirty blocks, this | |
1656 | * reduces runtime of this function by >90%, and overall performance | |
1657 | * by 50% for some workloads (e.g. file deletion with indirect blocks | |
1658 | * cached). | |
1659 | */ | |
1660 | mutex_enter(&db->db_mtx); | |
1661 | ||
1662 | for (dr = db->db_last_dirty; | |
1663 | dr != NULL && dr->dr_txg >= tx->tx_txg; dr = dr->dr_next) { | |
1664 | /* | |
1665 | * It's possible that it is already dirty but not cached, | |
1666 | * because there are some calls to dbuf_dirty() that don't | |
1667 | * go through dmu_buf_will_dirty(). | |
1668 | */ | |
1669 | if (dr->dr_txg == tx->tx_txg && db->db_state == DB_CACHED) { | |
1670 | /* This dbuf is already dirty and cached. */ | |
1671 | dbuf_redirty(dr); | |
1672 | mutex_exit(&db->db_mtx); | |
1673 | return; | |
1674 | } | |
1675 | } | |
1676 | mutex_exit(&db->db_mtx); | |
1677 | ||
572e2857 BB |
1678 | DB_DNODE_ENTER(db); |
1679 | if (RW_WRITE_HELD(&DB_DNODE(db)->dn_struct_rwlock)) | |
34dc7c2f | 1680 | rf |= DB_RF_HAVESTRUCT; |
572e2857 | 1681 | DB_DNODE_EXIT(db); |
34dc7c2f BB |
1682 | (void) dbuf_read(db, NULL, rf); |
1683 | (void) dbuf_dirty(db, tx); | |
1684 | } | |
1685 | ||
b128c09f BB |
1686 | void |
1687 | dmu_buf_will_not_fill(dmu_buf_t *db_fake, dmu_tx_t *tx) | |
1688 | { | |
1689 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
1690 | ||
1691 | db->db_state = DB_NOFILL; | |
1692 | ||
1693 | dmu_buf_will_fill(db_fake, tx); | |
1694 | } | |
1695 | ||
34dc7c2f BB |
1696 | void |
1697 | dmu_buf_will_fill(dmu_buf_t *db_fake, dmu_tx_t *tx) | |
1698 | { | |
1699 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
1700 | ||
428870ff | 1701 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f BB |
1702 | ASSERT(tx->tx_txg != 0); |
1703 | ASSERT(db->db_level == 0); | |
1704 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
1705 | ||
1706 | ASSERT(db->db.db_object != DMU_META_DNODE_OBJECT || | |
1707 | dmu_tx_private_ok(tx)); | |
1708 | ||
1709 | dbuf_noread(db); | |
1710 | (void) dbuf_dirty(db, tx); | |
1711 | } | |
1712 | ||
1713 | #pragma weak dmu_buf_fill_done = dbuf_fill_done | |
1714 | /* ARGSUSED */ | |
1715 | void | |
1716 | dbuf_fill_done(dmu_buf_impl_t *db, dmu_tx_t *tx) | |
1717 | { | |
1718 | mutex_enter(&db->db_mtx); | |
1719 | DBUF_VERIFY(db); | |
1720 | ||
1721 | if (db->db_state == DB_FILL) { | |
1722 | if (db->db_level == 0 && db->db_freed_in_flight) { | |
428870ff | 1723 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f BB |
1724 | /* we were freed while filling */ |
1725 | /* XXX dbuf_undirty? */ | |
1726 | bzero(db->db.db_data, db->db.db_size); | |
1727 | db->db_freed_in_flight = FALSE; | |
1728 | } | |
1729 | db->db_state = DB_CACHED; | |
1730 | cv_broadcast(&db->db_changed); | |
1731 | } | |
1732 | mutex_exit(&db->db_mtx); | |
1733 | } | |
1734 | ||
9b67f605 MA |
1735 | void |
1736 | dmu_buf_write_embedded(dmu_buf_t *dbuf, void *data, | |
1737 | bp_embedded_type_t etype, enum zio_compress comp, | |
1738 | int uncompressed_size, int compressed_size, int byteorder, | |
1739 | dmu_tx_t *tx) | |
1740 | { | |
1741 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)dbuf; | |
1742 | struct dirty_leaf *dl; | |
1743 | dmu_object_type_t type; | |
1744 | ||
241b5415 MA |
1745 | if (etype == BP_EMBEDDED_TYPE_DATA) { |
1746 | ASSERT(spa_feature_is_active(dmu_objset_spa(db->db_objset), | |
1747 | SPA_FEATURE_EMBEDDED_DATA)); | |
1748 | } | |
1749 | ||
9b67f605 MA |
1750 | DB_DNODE_ENTER(db); |
1751 | type = DB_DNODE(db)->dn_type; | |
1752 | DB_DNODE_EXIT(db); | |
1753 | ||
1754 | ASSERT0(db->db_level); | |
1755 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); | |
1756 | ||
1757 | dmu_buf_will_not_fill(dbuf, tx); | |
1758 | ||
1759 | ASSERT3U(db->db_last_dirty->dr_txg, ==, tx->tx_txg); | |
1760 | dl = &db->db_last_dirty->dt.dl; | |
1761 | encode_embedded_bp_compressed(&dl->dr_overridden_by, | |
1762 | data, comp, uncompressed_size, compressed_size); | |
1763 | BPE_SET_ETYPE(&dl->dr_overridden_by, etype); | |
1764 | BP_SET_TYPE(&dl->dr_overridden_by, type); | |
1765 | BP_SET_LEVEL(&dl->dr_overridden_by, 0); | |
1766 | BP_SET_BYTEORDER(&dl->dr_overridden_by, byteorder); | |
1767 | ||
1768 | dl->dr_override_state = DR_OVERRIDDEN; | |
1769 | dl->dr_overridden_by.blk_birth = db->db_last_dirty->dr_txg; | |
1770 | } | |
1771 | ||
9babb374 BB |
1772 | /* |
1773 | * Directly assign a provided arc buf to a given dbuf if it's not referenced | |
1774 | * by anybody except our caller. Otherwise copy arcbuf's contents to dbuf. | |
1775 | */ | |
1776 | void | |
1777 | dbuf_assign_arcbuf(dmu_buf_impl_t *db, arc_buf_t *buf, dmu_tx_t *tx) | |
1778 | { | |
1779 | ASSERT(!refcount_is_zero(&db->db_holds)); | |
428870ff | 1780 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
9babb374 BB |
1781 | ASSERT(db->db_level == 0); |
1782 | ASSERT(DBUF_GET_BUFC_TYPE(db) == ARC_BUFC_DATA); | |
1783 | ASSERT(buf != NULL); | |
1784 | ASSERT(arc_buf_size(buf) == db->db.db_size); | |
1785 | ASSERT(tx->tx_txg != 0); | |
1786 | ||
1787 | arc_return_buf(buf, db); | |
1788 | ASSERT(arc_released(buf)); | |
1789 | ||
1790 | mutex_enter(&db->db_mtx); | |
1791 | ||
1792 | while (db->db_state == DB_READ || db->db_state == DB_FILL) | |
1793 | cv_wait(&db->db_changed, &db->db_mtx); | |
1794 | ||
1795 | ASSERT(db->db_state == DB_CACHED || db->db_state == DB_UNCACHED); | |
1796 | ||
1797 | if (db->db_state == DB_CACHED && | |
1798 | refcount_count(&db->db_holds) - 1 > db->db_dirtycnt) { | |
1799 | mutex_exit(&db->db_mtx); | |
1800 | (void) dbuf_dirty(db, tx); | |
1801 | bcopy(buf->b_data, db->db.db_data, db->db.db_size); | |
13fe0198 | 1802 | VERIFY(arc_buf_remove_ref(buf, db)); |
428870ff | 1803 | xuio_stat_wbuf_copied(); |
9babb374 BB |
1804 | return; |
1805 | } | |
1806 | ||
428870ff | 1807 | xuio_stat_wbuf_nocopy(); |
9babb374 BB |
1808 | if (db->db_state == DB_CACHED) { |
1809 | dbuf_dirty_record_t *dr = db->db_last_dirty; | |
1810 | ||
1811 | ASSERT(db->db_buf != NULL); | |
1812 | if (dr != NULL && dr->dr_txg == tx->tx_txg) { | |
1813 | ASSERT(dr->dt.dl.dr_data == db->db_buf); | |
1814 | if (!arc_released(db->db_buf)) { | |
1815 | ASSERT(dr->dt.dl.dr_override_state == | |
1816 | DR_OVERRIDDEN); | |
1817 | arc_release(db->db_buf, db); | |
1818 | } | |
1819 | dr->dt.dl.dr_data = buf; | |
13fe0198 | 1820 | VERIFY(arc_buf_remove_ref(db->db_buf, db)); |
9babb374 BB |
1821 | } else if (dr == NULL || dr->dt.dl.dr_data != db->db_buf) { |
1822 | arc_release(db->db_buf, db); | |
13fe0198 | 1823 | VERIFY(arc_buf_remove_ref(db->db_buf, db)); |
9babb374 BB |
1824 | } |
1825 | db->db_buf = NULL; | |
1826 | } | |
1827 | ASSERT(db->db_buf == NULL); | |
1828 | dbuf_set_data(db, buf); | |
1829 | db->db_state = DB_FILL; | |
1830 | mutex_exit(&db->db_mtx); | |
1831 | (void) dbuf_dirty(db, tx); | |
b0bc7a84 | 1832 | dmu_buf_fill_done(&db->db, tx); |
9babb374 BB |
1833 | } |
1834 | ||
34dc7c2f BB |
1835 | /* |
1836 | * "Clear" the contents of this dbuf. This will mark the dbuf | |
e8b96c60 | 1837 | * EVICTING and clear *most* of its references. Unfortunately, |
34dc7c2f BB |
1838 | * when we are not holding the dn_dbufs_mtx, we can't clear the |
1839 | * entry in the dn_dbufs list. We have to wait until dbuf_destroy() | |
1840 | * in this case. For callers from the DMU we will usually see: | |
bd089c54 | 1841 | * dbuf_clear()->arc_clear_callback()->dbuf_do_evict()->dbuf_destroy() |
34dc7c2f | 1842 | * For the arc callback, we will usually see: |
572e2857 | 1843 | * dbuf_do_evict()->dbuf_clear();dbuf_destroy() |
34dc7c2f | 1844 | * Sometimes, though, we will get a mix of these two: |
bd089c54 | 1845 | * DMU: dbuf_clear()->arc_clear_callback() |
34dc7c2f | 1846 | * ARC: dbuf_do_evict()->dbuf_destroy() |
bd089c54 MA |
1847 | * |
1848 | * This routine will dissociate the dbuf from the arc, by calling | |
1849 | * arc_clear_callback(), but will not evict the data from the ARC. | |
34dc7c2f BB |
1850 | */ |
1851 | void | |
1852 | dbuf_clear(dmu_buf_impl_t *db) | |
1853 | { | |
572e2857 | 1854 | dnode_t *dn; |
34dc7c2f | 1855 | dmu_buf_impl_t *parent = db->db_parent; |
572e2857 | 1856 | dmu_buf_impl_t *dndb; |
bd089c54 | 1857 | boolean_t dbuf_gone = B_FALSE; |
34dc7c2f BB |
1858 | |
1859 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
1860 | ASSERT(refcount_is_zero(&db->db_holds)); | |
1861 | ||
1862 | dbuf_evict_user(db); | |
1863 | ||
1864 | if (db->db_state == DB_CACHED) { | |
1865 | ASSERT(db->db.db_data != NULL); | |
428870ff | 1866 | if (db->db_blkid == DMU_BONUS_BLKID) { |
50c957f7 NB |
1867 | int slots = DB_DNODE(db)->dn_num_slots; |
1868 | int bonuslen = DN_SLOTS_TO_BONUSLEN(slots); | |
1869 | zio_buf_free(db->db.db_data, bonuslen); | |
25458cbe | 1870 | arc_space_return(bonuslen, ARC_SPACE_BONUS); |
34dc7c2f BB |
1871 | } |
1872 | db->db.db_data = NULL; | |
1873 | db->db_state = DB_UNCACHED; | |
1874 | } | |
1875 | ||
b128c09f | 1876 | ASSERT(db->db_state == DB_UNCACHED || db->db_state == DB_NOFILL); |
34dc7c2f BB |
1877 | ASSERT(db->db_data_pending == NULL); |
1878 | ||
1879 | db->db_state = DB_EVICTING; | |
1880 | db->db_blkptr = NULL; | |
1881 | ||
572e2857 BB |
1882 | DB_DNODE_ENTER(db); |
1883 | dn = DB_DNODE(db); | |
1884 | dndb = dn->dn_dbuf; | |
428870ff | 1885 | if (db->db_blkid != DMU_BONUS_BLKID && MUTEX_HELD(&dn->dn_dbufs_mtx)) { |
8951cb8d | 1886 | avl_remove(&dn->dn_dbufs, db); |
73ad4a9f | 1887 | atomic_dec_32(&dn->dn_dbufs_count); |
572e2857 BB |
1888 | membar_producer(); |
1889 | DB_DNODE_EXIT(db); | |
1890 | /* | |
1891 | * Decrementing the dbuf count means that the hold corresponding | |
1892 | * to the removed dbuf is no longer discounted in dnode_move(), | |
1893 | * so the dnode cannot be moved until after we release the hold. | |
1894 | * The membar_producer() ensures visibility of the decremented | |
1895 | * value in dnode_move(), since DB_DNODE_EXIT doesn't actually | |
1896 | * release any lock. | |
1897 | */ | |
34dc7c2f | 1898 | dnode_rele(dn, db); |
572e2857 BB |
1899 | db->db_dnode_handle = NULL; |
1900 | } else { | |
1901 | DB_DNODE_EXIT(db); | |
34dc7c2f BB |
1902 | } |
1903 | ||
1904 | if (db->db_buf) | |
bd089c54 | 1905 | dbuf_gone = arc_clear_callback(db->db_buf); |
34dc7c2f BB |
1906 | |
1907 | if (!dbuf_gone) | |
1908 | mutex_exit(&db->db_mtx); | |
1909 | ||
1910 | /* | |
572e2857 | 1911 | * If this dbuf is referenced from an indirect dbuf, |
34dc7c2f BB |
1912 | * decrement the ref count on the indirect dbuf. |
1913 | */ | |
1914 | if (parent && parent != dndb) | |
1915 | dbuf_rele(parent, db); | |
1916 | } | |
1917 | ||
fcff0f35 PD |
1918 | /* |
1919 | * Note: While bpp will always be updated if the function returns success, | |
1920 | * parentp will not be updated if the dnode does not have dn_dbuf filled in; | |
1921 | * this happens when the dnode is the meta-dnode, or a userused or groupused | |
1922 | * object. | |
1923 | */ | |
bf701a83 BB |
1924 | __attribute__((always_inline)) |
1925 | static inline int | |
34dc7c2f | 1926 | dbuf_findbp(dnode_t *dn, int level, uint64_t blkid, int fail_sparse, |
fc5bb51f | 1927 | dmu_buf_impl_t **parentp, blkptr_t **bpp, struct dbuf_hold_impl_data *dh) |
34dc7c2f BB |
1928 | { |
1929 | int nlevels, epbs; | |
1930 | ||
1931 | *parentp = NULL; | |
1932 | *bpp = NULL; | |
1933 | ||
428870ff BB |
1934 | ASSERT(blkid != DMU_BONUS_BLKID); |
1935 | ||
1936 | if (blkid == DMU_SPILL_BLKID) { | |
1937 | mutex_enter(&dn->dn_mtx); | |
1938 | if (dn->dn_have_spill && | |
1939 | (dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR)) | |
50c957f7 | 1940 | *bpp = DN_SPILL_BLKPTR(dn->dn_phys); |
428870ff BB |
1941 | else |
1942 | *bpp = NULL; | |
1943 | dbuf_add_ref(dn->dn_dbuf, NULL); | |
1944 | *parentp = dn->dn_dbuf; | |
1945 | mutex_exit(&dn->dn_mtx); | |
1946 | return (0); | |
1947 | } | |
34dc7c2f BB |
1948 | |
1949 | if (dn->dn_phys->dn_nlevels == 0) | |
1950 | nlevels = 1; | |
1951 | else | |
1952 | nlevels = dn->dn_phys->dn_nlevels; | |
1953 | ||
1954 | epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; | |
1955 | ||
1956 | ASSERT3U(level * epbs, <, 64); | |
1957 | ASSERT(RW_LOCK_HELD(&dn->dn_struct_rwlock)); | |
1958 | if (level >= nlevels || | |
1959 | (blkid > (dn->dn_phys->dn_maxblkid >> (level * epbs)))) { | |
1960 | /* the buffer has no parent yet */ | |
2e528b49 | 1961 | return (SET_ERROR(ENOENT)); |
34dc7c2f BB |
1962 | } else if (level < nlevels-1) { |
1963 | /* this block is referenced from an indirect block */ | |
fc5bb51f BB |
1964 | int err; |
1965 | if (dh == NULL) { | |
fcff0f35 PD |
1966 | err = dbuf_hold_impl(dn, level+1, |
1967 | blkid >> epbs, fail_sparse, FALSE, NULL, parentp); | |
d1d7e268 | 1968 | } else { |
fc5bb51f | 1969 | __dbuf_hold_impl_init(dh + 1, dn, dh->dh_level + 1, |
fcff0f35 PD |
1970 | blkid >> epbs, fail_sparse, FALSE, NULL, |
1971 | parentp, dh->dh_depth + 1); | |
fc5bb51f BB |
1972 | err = __dbuf_hold_impl(dh + 1); |
1973 | } | |
34dc7c2f BB |
1974 | if (err) |
1975 | return (err); | |
1976 | err = dbuf_read(*parentp, NULL, | |
1977 | (DB_RF_HAVESTRUCT | DB_RF_NOPREFETCH | DB_RF_CANFAIL)); | |
1978 | if (err) { | |
1979 | dbuf_rele(*parentp, NULL); | |
1980 | *parentp = NULL; | |
1981 | return (err); | |
1982 | } | |
1983 | *bpp = ((blkptr_t *)(*parentp)->db.db_data) + | |
1984 | (blkid & ((1ULL << epbs) - 1)); | |
1985 | return (0); | |
1986 | } else { | |
1987 | /* the block is referenced from the dnode */ | |
1988 | ASSERT3U(level, ==, nlevels-1); | |
1989 | ASSERT(dn->dn_phys->dn_nblkptr == 0 || | |
1990 | blkid < dn->dn_phys->dn_nblkptr); | |
1991 | if (dn->dn_dbuf) { | |
1992 | dbuf_add_ref(dn->dn_dbuf, NULL); | |
1993 | *parentp = dn->dn_dbuf; | |
1994 | } | |
1995 | *bpp = &dn->dn_phys->dn_blkptr[blkid]; | |
1996 | return (0); | |
1997 | } | |
1998 | } | |
1999 | ||
2000 | static dmu_buf_impl_t * | |
2001 | dbuf_create(dnode_t *dn, uint8_t level, uint64_t blkid, | |
2002 | dmu_buf_impl_t *parent, blkptr_t *blkptr) | |
2003 | { | |
428870ff | 2004 | objset_t *os = dn->dn_objset; |
34dc7c2f BB |
2005 | dmu_buf_impl_t *db, *odb; |
2006 | ||
2007 | ASSERT(RW_LOCK_HELD(&dn->dn_struct_rwlock)); | |
2008 | ASSERT(dn->dn_type != DMU_OT_NONE); | |
2009 | ||
79c76d5b | 2010 | db = kmem_cache_alloc(dbuf_cache, KM_SLEEP); |
34dc7c2f BB |
2011 | |
2012 | db->db_objset = os; | |
2013 | db->db.db_object = dn->dn_object; | |
2014 | db->db_level = level; | |
2015 | db->db_blkid = blkid; | |
2016 | db->db_last_dirty = NULL; | |
2017 | db->db_dirtycnt = 0; | |
572e2857 | 2018 | db->db_dnode_handle = dn->dn_handle; |
34dc7c2f BB |
2019 | db->db_parent = parent; |
2020 | db->db_blkptr = blkptr; | |
2021 | ||
0c66c32d | 2022 | db->db_user = NULL; |
bc4501f7 JG |
2023 | db->db_user_immediate_evict = FALSE; |
2024 | db->db_freed_in_flight = FALSE; | |
2025 | db->db_pending_evict = FALSE; | |
34dc7c2f | 2026 | |
428870ff | 2027 | if (blkid == DMU_BONUS_BLKID) { |
34dc7c2f | 2028 | ASSERT3P(parent, ==, dn->dn_dbuf); |
50c957f7 | 2029 | db->db.db_size = DN_SLOTS_TO_BONUSLEN(dn->dn_num_slots) - |
34dc7c2f BB |
2030 | (dn->dn_nblkptr-1) * sizeof (blkptr_t); |
2031 | ASSERT3U(db->db.db_size, >=, dn->dn_bonuslen); | |
428870ff | 2032 | db->db.db_offset = DMU_BONUS_BLKID; |
34dc7c2f BB |
2033 | db->db_state = DB_UNCACHED; |
2034 | /* the bonus dbuf is not placed in the hash table */ | |
25458cbe | 2035 | arc_space_consume(sizeof (dmu_buf_impl_t), ARC_SPACE_DBUF); |
34dc7c2f | 2036 | return (db); |
428870ff BB |
2037 | } else if (blkid == DMU_SPILL_BLKID) { |
2038 | db->db.db_size = (blkptr != NULL) ? | |
2039 | BP_GET_LSIZE(blkptr) : SPA_MINBLOCKSIZE; | |
2040 | db->db.db_offset = 0; | |
34dc7c2f BB |
2041 | } else { |
2042 | int blocksize = | |
e8b96c60 | 2043 | db->db_level ? 1 << dn->dn_indblkshift : dn->dn_datablksz; |
34dc7c2f BB |
2044 | db->db.db_size = blocksize; |
2045 | db->db.db_offset = db->db_blkid * blocksize; | |
2046 | } | |
2047 | ||
2048 | /* | |
2049 | * Hold the dn_dbufs_mtx while we get the new dbuf | |
2050 | * in the hash table *and* added to the dbufs list. | |
2051 | * This prevents a possible deadlock with someone | |
2052 | * trying to look up this dbuf before its added to the | |
2053 | * dn_dbufs list. | |
2054 | */ | |
2055 | mutex_enter(&dn->dn_dbufs_mtx); | |
2056 | db->db_state = DB_EVICTING; | |
2057 | if ((odb = dbuf_hash_insert(db)) != NULL) { | |
2058 | /* someone else inserted it first */ | |
2059 | kmem_cache_free(dbuf_cache, db); | |
2060 | mutex_exit(&dn->dn_dbufs_mtx); | |
2061 | return (odb); | |
2062 | } | |
8951cb8d | 2063 | avl_add(&dn->dn_dbufs, db); |
b663a23d MA |
2064 | if (db->db_level == 0 && db->db_blkid >= |
2065 | dn->dn_unlisted_l0_blkid) | |
2066 | dn->dn_unlisted_l0_blkid = db->db_blkid + 1; | |
34dc7c2f BB |
2067 | db->db_state = DB_UNCACHED; |
2068 | mutex_exit(&dn->dn_dbufs_mtx); | |
25458cbe | 2069 | arc_space_consume(sizeof (dmu_buf_impl_t), ARC_SPACE_DBUF); |
34dc7c2f BB |
2070 | |
2071 | if (parent && parent != dn->dn_dbuf) | |
2072 | dbuf_add_ref(parent, db); | |
2073 | ||
2074 | ASSERT(dn->dn_object == DMU_META_DNODE_OBJECT || | |
2075 | refcount_count(&dn->dn_holds) > 0); | |
2076 | (void) refcount_add(&dn->dn_holds, db); | |
73ad4a9f | 2077 | atomic_inc_32(&dn->dn_dbufs_count); |
34dc7c2f BB |
2078 | |
2079 | dprintf_dbuf(db, "db=%p\n", db); | |
2080 | ||
2081 | return (db); | |
2082 | } | |
2083 | ||
2084 | static int | |
2085 | dbuf_do_evict(void *private) | |
2086 | { | |
bd089c54 | 2087 | dmu_buf_impl_t *db = private; |
34dc7c2f BB |
2088 | |
2089 | if (!MUTEX_HELD(&db->db_mtx)) | |
2090 | mutex_enter(&db->db_mtx); | |
2091 | ||
2092 | ASSERT(refcount_is_zero(&db->db_holds)); | |
2093 | ||
2094 | if (db->db_state != DB_EVICTING) { | |
2095 | ASSERT(db->db_state == DB_CACHED); | |
2096 | DBUF_VERIFY(db); | |
2097 | db->db_buf = NULL; | |
2098 | dbuf_evict(db); | |
2099 | } else { | |
2100 | mutex_exit(&db->db_mtx); | |
2101 | dbuf_destroy(db); | |
2102 | } | |
2103 | return (0); | |
2104 | } | |
2105 | ||
2106 | static void | |
2107 | dbuf_destroy(dmu_buf_impl_t *db) | |
2108 | { | |
2109 | ASSERT(refcount_is_zero(&db->db_holds)); | |
2110 | ||
428870ff | 2111 | if (db->db_blkid != DMU_BONUS_BLKID) { |
34dc7c2f BB |
2112 | /* |
2113 | * If this dbuf is still on the dn_dbufs list, | |
2114 | * remove it from that list. | |
2115 | */ | |
572e2857 BB |
2116 | if (db->db_dnode_handle != NULL) { |
2117 | dnode_t *dn; | |
34dc7c2f | 2118 | |
572e2857 BB |
2119 | DB_DNODE_ENTER(db); |
2120 | dn = DB_DNODE(db); | |
34dc7c2f | 2121 | mutex_enter(&dn->dn_dbufs_mtx); |
8951cb8d | 2122 | avl_remove(&dn->dn_dbufs, db); |
73ad4a9f | 2123 | atomic_dec_32(&dn->dn_dbufs_count); |
34dc7c2f | 2124 | mutex_exit(&dn->dn_dbufs_mtx); |
572e2857 BB |
2125 | DB_DNODE_EXIT(db); |
2126 | /* | |
2127 | * Decrementing the dbuf count means that the hold | |
2128 | * corresponding to the removed dbuf is no longer | |
2129 | * discounted in dnode_move(), so the dnode cannot be | |
2130 | * moved until after we release the hold. | |
2131 | */ | |
34dc7c2f | 2132 | dnode_rele(dn, db); |
572e2857 | 2133 | db->db_dnode_handle = NULL; |
34dc7c2f BB |
2134 | } |
2135 | dbuf_hash_remove(db); | |
2136 | } | |
2137 | db->db_parent = NULL; | |
2138 | db->db_buf = NULL; | |
2139 | ||
34dc7c2f BB |
2140 | ASSERT(db->db.db_data == NULL); |
2141 | ASSERT(db->db_hash_next == NULL); | |
2142 | ASSERT(db->db_blkptr == NULL); | |
2143 | ASSERT(db->db_data_pending == NULL); | |
2144 | ||
2145 | kmem_cache_free(dbuf_cache, db); | |
25458cbe | 2146 | arc_space_return(sizeof (dmu_buf_impl_t), ARC_SPACE_DBUF); |
34dc7c2f BB |
2147 | } |
2148 | ||
fcff0f35 PD |
2149 | typedef struct dbuf_prefetch_arg { |
2150 | spa_t *dpa_spa; /* The spa to issue the prefetch in. */ | |
2151 | zbookmark_phys_t dpa_zb; /* The target block to prefetch. */ | |
2152 | int dpa_epbs; /* Entries (blkptr_t's) Per Block Shift. */ | |
2153 | int dpa_curlevel; /* The current level that we're reading */ | |
2154 | zio_priority_t dpa_prio; /* The priority I/Os should be issued at. */ | |
2155 | zio_t *dpa_zio; /* The parent zio_t for all prefetches. */ | |
2156 | arc_flags_t dpa_aflags; /* Flags to pass to the final prefetch. */ | |
2157 | } dbuf_prefetch_arg_t; | |
2158 | ||
2159 | /* | |
2160 | * Actually issue the prefetch read for the block given. | |
2161 | */ | |
2162 | static void | |
2163 | dbuf_issue_final_prefetch(dbuf_prefetch_arg_t *dpa, blkptr_t *bp) | |
2164 | { | |
2165 | arc_flags_t aflags; | |
2166 | if (BP_IS_HOLE(bp) || BP_IS_EMBEDDED(bp)) | |
2167 | return; | |
2168 | ||
2169 | aflags = dpa->dpa_aflags | ARC_FLAG_NOWAIT | ARC_FLAG_PREFETCH; | |
2170 | ||
2171 | ASSERT3U(dpa->dpa_curlevel, ==, BP_GET_LEVEL(bp)); | |
2172 | ASSERT3U(dpa->dpa_curlevel, ==, dpa->dpa_zb.zb_level); | |
2173 | ASSERT(dpa->dpa_zio != NULL); | |
2174 | (void) arc_read(dpa->dpa_zio, dpa->dpa_spa, bp, NULL, NULL, | |
2175 | dpa->dpa_prio, ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE, | |
2176 | &aflags, &dpa->dpa_zb); | |
2177 | } | |
2178 | ||
2179 | /* | |
2180 | * Called when an indirect block above our prefetch target is read in. This | |
2181 | * will either read in the next indirect block down the tree or issue the actual | |
2182 | * prefetch if the next block down is our target. | |
2183 | */ | |
2184 | static void | |
2185 | dbuf_prefetch_indirect_done(zio_t *zio, arc_buf_t *abuf, void *private) | |
2186 | { | |
2187 | dbuf_prefetch_arg_t *dpa = private; | |
2188 | uint64_t nextblkid; | |
2189 | blkptr_t *bp; | |
2190 | ||
2191 | ASSERT3S(dpa->dpa_zb.zb_level, <, dpa->dpa_curlevel); | |
2192 | ASSERT3S(dpa->dpa_curlevel, >, 0); | |
2193 | if (zio != NULL) { | |
2194 | ASSERT3S(BP_GET_LEVEL(zio->io_bp), ==, dpa->dpa_curlevel); | |
2195 | ASSERT3U(BP_GET_LSIZE(zio->io_bp), ==, zio->io_size); | |
2196 | ASSERT3P(zio->io_spa, ==, dpa->dpa_spa); | |
2197 | } | |
2198 | ||
2199 | dpa->dpa_curlevel--; | |
2200 | ||
2201 | nextblkid = dpa->dpa_zb.zb_blkid >> | |
2202 | (dpa->dpa_epbs * (dpa->dpa_curlevel - dpa->dpa_zb.zb_level)); | |
2203 | bp = ((blkptr_t *)abuf->b_data) + | |
2204 | P2PHASE(nextblkid, 1ULL << dpa->dpa_epbs); | |
2205 | if (BP_IS_HOLE(bp) || (zio != NULL && zio->io_error != 0)) { | |
2206 | kmem_free(dpa, sizeof (*dpa)); | |
2207 | } else if (dpa->dpa_curlevel == dpa->dpa_zb.zb_level) { | |
2208 | ASSERT3U(nextblkid, ==, dpa->dpa_zb.zb_blkid); | |
2209 | dbuf_issue_final_prefetch(dpa, bp); | |
2210 | kmem_free(dpa, sizeof (*dpa)); | |
2211 | } else { | |
2212 | arc_flags_t iter_aflags = ARC_FLAG_NOWAIT; | |
2213 | zbookmark_phys_t zb; | |
2214 | ||
2215 | ASSERT3U(dpa->dpa_curlevel, ==, BP_GET_LEVEL(bp)); | |
2216 | ||
2217 | SET_BOOKMARK(&zb, dpa->dpa_zb.zb_objset, | |
2218 | dpa->dpa_zb.zb_object, dpa->dpa_curlevel, nextblkid); | |
2219 | ||
2220 | (void) arc_read(dpa->dpa_zio, dpa->dpa_spa, | |
2221 | bp, dbuf_prefetch_indirect_done, dpa, dpa->dpa_prio, | |
2222 | ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE, | |
2223 | &iter_aflags, &zb); | |
2224 | } | |
2225 | (void) arc_buf_remove_ref(abuf, private); | |
2226 | } | |
2227 | ||
2228 | /* | |
2229 | * Issue prefetch reads for the given block on the given level. If the indirect | |
2230 | * blocks above that block are not in memory, we will read them in | |
2231 | * asynchronously. As a result, this call never blocks waiting for a read to | |
2232 | * complete. | |
2233 | */ | |
34dc7c2f | 2234 | void |
fcff0f35 PD |
2235 | dbuf_prefetch(dnode_t *dn, int64_t level, uint64_t blkid, zio_priority_t prio, |
2236 | arc_flags_t aflags) | |
34dc7c2f | 2237 | { |
fcff0f35 PD |
2238 | blkptr_t bp; |
2239 | int epbs, nlevels, curlevel; | |
2240 | uint64_t curblkid; | |
2241 | dmu_buf_impl_t *db; | |
2242 | zio_t *pio; | |
2243 | dbuf_prefetch_arg_t *dpa; | |
2244 | dsl_dataset_t *ds; | |
34dc7c2f | 2245 | |
428870ff | 2246 | ASSERT(blkid != DMU_BONUS_BLKID); |
34dc7c2f BB |
2247 | ASSERT(RW_LOCK_HELD(&dn->dn_struct_rwlock)); |
2248 | ||
7f60329a MA |
2249 | if (blkid > dn->dn_maxblkid) |
2250 | return; | |
2251 | ||
34dc7c2f BB |
2252 | if (dnode_block_freed(dn, blkid)) |
2253 | return; | |
2254 | ||
fcff0f35 PD |
2255 | /* |
2256 | * This dnode hasn't been written to disk yet, so there's nothing to | |
2257 | * prefetch. | |
2258 | */ | |
2259 | nlevels = dn->dn_phys->dn_nlevels; | |
2260 | if (level >= nlevels || dn->dn_phys->dn_nblkptr == 0) | |
2261 | return; | |
2262 | ||
2263 | epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; | |
2264 | if (dn->dn_phys->dn_maxblkid < blkid << (epbs * level)) | |
2265 | return; | |
2266 | ||
2267 | db = dbuf_find(dn->dn_objset, dn->dn_object, | |
2268 | level, blkid); | |
2269 | if (db != NULL) { | |
2270 | mutex_exit(&db->db_mtx); | |
572e2857 | 2271 | /* |
fcff0f35 PD |
2272 | * This dbuf already exists. It is either CACHED, or |
2273 | * (we assume) about to be read or filled. | |
572e2857 | 2274 | */ |
572e2857 | 2275 | return; |
34dc7c2f BB |
2276 | } |
2277 | ||
fcff0f35 PD |
2278 | /* |
2279 | * Find the closest ancestor (indirect block) of the target block | |
2280 | * that is present in the cache. In this indirect block, we will | |
2281 | * find the bp that is at curlevel, curblkid. | |
2282 | */ | |
2283 | curlevel = level; | |
2284 | curblkid = blkid; | |
2285 | while (curlevel < nlevels - 1) { | |
2286 | int parent_level = curlevel + 1; | |
2287 | uint64_t parent_blkid = curblkid >> epbs; | |
2288 | dmu_buf_impl_t *db; | |
2289 | ||
2290 | if (dbuf_hold_impl(dn, parent_level, parent_blkid, | |
2291 | FALSE, TRUE, FTAG, &db) == 0) { | |
2292 | blkptr_t *bpp = db->db_buf->b_data; | |
2293 | bp = bpp[P2PHASE(curblkid, 1 << epbs)]; | |
2294 | dbuf_rele(db, FTAG); | |
2295 | break; | |
2296 | } | |
428870ff | 2297 | |
fcff0f35 PD |
2298 | curlevel = parent_level; |
2299 | curblkid = parent_blkid; | |
2300 | } | |
34dc7c2f | 2301 | |
fcff0f35 PD |
2302 | if (curlevel == nlevels - 1) { |
2303 | /* No cached indirect blocks found. */ | |
2304 | ASSERT3U(curblkid, <, dn->dn_phys->dn_nblkptr); | |
2305 | bp = dn->dn_phys->dn_blkptr[curblkid]; | |
34dc7c2f | 2306 | } |
fcff0f35 PD |
2307 | if (BP_IS_HOLE(&bp)) |
2308 | return; | |
2309 | ||
2310 | ASSERT3U(curlevel, ==, BP_GET_LEVEL(&bp)); | |
2311 | ||
2312 | pio = zio_root(dmu_objset_spa(dn->dn_objset), NULL, NULL, | |
2313 | ZIO_FLAG_CANFAIL); | |
2314 | ||
2315 | dpa = kmem_zalloc(sizeof (*dpa), KM_SLEEP); | |
2316 | ds = dn->dn_objset->os_dsl_dataset; | |
2317 | SET_BOOKMARK(&dpa->dpa_zb, ds != NULL ? ds->ds_object : DMU_META_OBJSET, | |
2318 | dn->dn_object, level, blkid); | |
2319 | dpa->dpa_curlevel = curlevel; | |
2320 | dpa->dpa_prio = prio; | |
2321 | dpa->dpa_aflags = aflags; | |
2322 | dpa->dpa_spa = dn->dn_objset->os_spa; | |
2323 | dpa->dpa_epbs = epbs; | |
2324 | dpa->dpa_zio = pio; | |
2325 | ||
2326 | /* | |
2327 | * If we have the indirect just above us, no need to do the asynchronous | |
2328 | * prefetch chain; we'll just run the last step ourselves. If we're at | |
2329 | * a higher level, though, we want to issue the prefetches for all the | |
2330 | * indirect blocks asynchronously, so we can go on with whatever we were | |
2331 | * doing. | |
2332 | */ | |
2333 | if (curlevel == level) { | |
2334 | ASSERT3U(curblkid, ==, blkid); | |
2335 | dbuf_issue_final_prefetch(dpa, &bp); | |
2336 | kmem_free(dpa, sizeof (*dpa)); | |
2337 | } else { | |
2338 | arc_flags_t iter_aflags = ARC_FLAG_NOWAIT; | |
2339 | zbookmark_phys_t zb; | |
2340 | ||
2341 | SET_BOOKMARK(&zb, ds != NULL ? ds->ds_object : DMU_META_OBJSET, | |
2342 | dn->dn_object, curlevel, curblkid); | |
2343 | (void) arc_read(dpa->dpa_zio, dpa->dpa_spa, | |
2344 | &bp, dbuf_prefetch_indirect_done, dpa, prio, | |
2345 | ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE, | |
2346 | &iter_aflags, &zb); | |
2347 | } | |
2348 | /* | |
2349 | * We use pio here instead of dpa_zio since it's possible that | |
2350 | * dpa may have already been freed. | |
2351 | */ | |
2352 | zio_nowait(pio); | |
34dc7c2f BB |
2353 | } |
2354 | ||
d1d7e268 | 2355 | #define DBUF_HOLD_IMPL_MAX_DEPTH 20 |
fc5bb51f | 2356 | |
34dc7c2f BB |
2357 | /* |
2358 | * Returns with db_holds incremented, and db_mtx not held. | |
2359 | * Note: dn_struct_rwlock must be held. | |
2360 | */ | |
fc5bb51f BB |
2361 | static int |
2362 | __dbuf_hold_impl(struct dbuf_hold_impl_data *dh) | |
34dc7c2f | 2363 | { |
fc5bb51f BB |
2364 | ASSERT3S(dh->dh_depth, <, DBUF_HOLD_IMPL_MAX_DEPTH); |
2365 | dh->dh_parent = NULL; | |
34dc7c2f | 2366 | |
fc5bb51f BB |
2367 | ASSERT(dh->dh_blkid != DMU_BONUS_BLKID); |
2368 | ASSERT(RW_LOCK_HELD(&dh->dh_dn->dn_struct_rwlock)); | |
2369 | ASSERT3U(dh->dh_dn->dn_nlevels, >, dh->dh_level); | |
34dc7c2f | 2370 | |
fc5bb51f | 2371 | *(dh->dh_dbp) = NULL; |
34dc7c2f BB |
2372 | top: |
2373 | /* dbuf_find() returns with db_mtx held */ | |
6ebebace JG |
2374 | dh->dh_db = dbuf_find(dh->dh_dn->dn_objset, dh->dh_dn->dn_object, |
2375 | dh->dh_level, dh->dh_blkid); | |
fc5bb51f BB |
2376 | |
2377 | if (dh->dh_db == NULL) { | |
2378 | dh->dh_bp = NULL; | |
2379 | ||
fcff0f35 PD |
2380 | if (dh->dh_fail_uncached) |
2381 | return (SET_ERROR(ENOENT)); | |
2382 | ||
fc5bb51f BB |
2383 | ASSERT3P(dh->dh_parent, ==, NULL); |
2384 | dh->dh_err = dbuf_findbp(dh->dh_dn, dh->dh_level, dh->dh_blkid, | |
2385 | dh->dh_fail_sparse, &dh->dh_parent, | |
2386 | &dh->dh_bp, dh); | |
2387 | if (dh->dh_fail_sparse) { | |
d1d7e268 MK |
2388 | if (dh->dh_err == 0 && |
2389 | dh->dh_bp && BP_IS_HOLE(dh->dh_bp)) | |
2e528b49 | 2390 | dh->dh_err = SET_ERROR(ENOENT); |
fc5bb51f BB |
2391 | if (dh->dh_err) { |
2392 | if (dh->dh_parent) | |
2393 | dbuf_rele(dh->dh_parent, NULL); | |
2394 | return (dh->dh_err); | |
34dc7c2f BB |
2395 | } |
2396 | } | |
fc5bb51f BB |
2397 | if (dh->dh_err && dh->dh_err != ENOENT) |
2398 | return (dh->dh_err); | |
2399 | dh->dh_db = dbuf_create(dh->dh_dn, dh->dh_level, dh->dh_blkid, | |
2400 | dh->dh_parent, dh->dh_bp); | |
34dc7c2f BB |
2401 | } |
2402 | ||
fcff0f35 PD |
2403 | if (dh->dh_fail_uncached && dh->dh_db->db_state != DB_CACHED) { |
2404 | mutex_exit(&dh->dh_db->db_mtx); | |
2405 | return (SET_ERROR(ENOENT)); | |
2406 | } | |
2407 | ||
fc5bb51f BB |
2408 | if (dh->dh_db->db_buf && refcount_is_zero(&dh->dh_db->db_holds)) { |
2409 | arc_buf_add_ref(dh->dh_db->db_buf, dh->dh_db); | |
2410 | if (dh->dh_db->db_buf->b_data == NULL) { | |
2411 | dbuf_clear(dh->dh_db); | |
2412 | if (dh->dh_parent) { | |
2413 | dbuf_rele(dh->dh_parent, NULL); | |
2414 | dh->dh_parent = NULL; | |
34dc7c2f BB |
2415 | } |
2416 | goto top; | |
2417 | } | |
fc5bb51f | 2418 | ASSERT3P(dh->dh_db->db.db_data, ==, dh->dh_db->db_buf->b_data); |
34dc7c2f BB |
2419 | } |
2420 | ||
fc5bb51f | 2421 | ASSERT(dh->dh_db->db_buf == NULL || arc_referenced(dh->dh_db->db_buf)); |
34dc7c2f BB |
2422 | |
2423 | /* | |
2424 | * If this buffer is currently syncing out, and we are are | |
2425 | * still referencing it from db_data, we need to make a copy | |
2426 | * of it in case we decide we want to dirty it again in this txg. | |
2427 | */ | |
fc5bb51f BB |
2428 | if (dh->dh_db->db_level == 0 && |
2429 | dh->dh_db->db_blkid != DMU_BONUS_BLKID && | |
2430 | dh->dh_dn->dn_object != DMU_META_DNODE_OBJECT && | |
2431 | dh->dh_db->db_state == DB_CACHED && dh->dh_db->db_data_pending) { | |
2432 | dh->dh_dr = dh->dh_db->db_data_pending; | |
2433 | ||
2434 | if (dh->dh_dr->dt.dl.dr_data == dh->dh_db->db_buf) { | |
2435 | dh->dh_type = DBUF_GET_BUFC_TYPE(dh->dh_db); | |
2436 | ||
2437 | dbuf_set_data(dh->dh_db, | |
2438 | arc_buf_alloc(dh->dh_dn->dn_objset->os_spa, | |
2439 | dh->dh_db->db.db_size, dh->dh_db, dh->dh_type)); | |
2440 | bcopy(dh->dh_dr->dt.dl.dr_data->b_data, | |
2441 | dh->dh_db->db.db_data, dh->dh_db->db.db_size); | |
34dc7c2f BB |
2442 | } |
2443 | } | |
2444 | ||
fc5bb51f | 2445 | (void) refcount_add(&dh->dh_db->db_holds, dh->dh_tag); |
fc5bb51f BB |
2446 | DBUF_VERIFY(dh->dh_db); |
2447 | mutex_exit(&dh->dh_db->db_mtx); | |
34dc7c2f BB |
2448 | |
2449 | /* NOTE: we can't rele the parent until after we drop the db_mtx */ | |
fc5bb51f BB |
2450 | if (dh->dh_parent) |
2451 | dbuf_rele(dh->dh_parent, NULL); | |
34dc7c2f | 2452 | |
fc5bb51f BB |
2453 | ASSERT3P(DB_DNODE(dh->dh_db), ==, dh->dh_dn); |
2454 | ASSERT3U(dh->dh_db->db_blkid, ==, dh->dh_blkid); | |
2455 | ASSERT3U(dh->dh_db->db_level, ==, dh->dh_level); | |
2456 | *(dh->dh_dbp) = dh->dh_db; | |
34dc7c2f BB |
2457 | |
2458 | return (0); | |
2459 | } | |
2460 | ||
fc5bb51f BB |
2461 | /* |
2462 | * The following code preserves the recursive function dbuf_hold_impl() | |
2463 | * but moves the local variables AND function arguments to the heap to | |
2464 | * minimize the stack frame size. Enough space is initially allocated | |
2465 | * on the stack for 20 levels of recursion. | |
2466 | */ | |
2467 | int | |
fcff0f35 PD |
2468 | dbuf_hold_impl(dnode_t *dn, uint8_t level, uint64_t blkid, |
2469 | boolean_t fail_sparse, boolean_t fail_uncached, | |
fc5bb51f BB |
2470 | void *tag, dmu_buf_impl_t **dbp) |
2471 | { | |
2472 | struct dbuf_hold_impl_data *dh; | |
2473 | int error; | |
2474 | ||
d9eea113 | 2475 | dh = kmem_alloc(sizeof (struct dbuf_hold_impl_data) * |
79c76d5b | 2476 | DBUF_HOLD_IMPL_MAX_DEPTH, KM_SLEEP); |
fcff0f35 PD |
2477 | __dbuf_hold_impl_init(dh, dn, level, blkid, fail_sparse, |
2478 | fail_uncached, tag, dbp, 0); | |
fc5bb51f BB |
2479 | |
2480 | error = __dbuf_hold_impl(dh); | |
2481 | ||
d1d7e268 | 2482 | kmem_free(dh, sizeof (struct dbuf_hold_impl_data) * |
fc5bb51f BB |
2483 | DBUF_HOLD_IMPL_MAX_DEPTH); |
2484 | ||
2485 | return (error); | |
2486 | } | |
2487 | ||
2488 | static void | |
2489 | __dbuf_hold_impl_init(struct dbuf_hold_impl_data *dh, | |
fcff0f35 PD |
2490 | dnode_t *dn, uint8_t level, uint64_t blkid, |
2491 | boolean_t fail_sparse, boolean_t fail_uncached, | |
2492 | void *tag, dmu_buf_impl_t **dbp, int depth) | |
fc5bb51f BB |
2493 | { |
2494 | dh->dh_dn = dn; | |
2495 | dh->dh_level = level; | |
2496 | dh->dh_blkid = blkid; | |
fcff0f35 | 2497 | |
fc5bb51f | 2498 | dh->dh_fail_sparse = fail_sparse; |
fcff0f35 PD |
2499 | dh->dh_fail_uncached = fail_uncached; |
2500 | ||
fc5bb51f BB |
2501 | dh->dh_tag = tag; |
2502 | dh->dh_dbp = dbp; | |
d9eea113 MA |
2503 | |
2504 | dh->dh_db = NULL; | |
2505 | dh->dh_parent = NULL; | |
2506 | dh->dh_bp = NULL; | |
2507 | dh->dh_err = 0; | |
2508 | dh->dh_dr = NULL; | |
2509 | dh->dh_type = 0; | |
2510 | ||
fc5bb51f BB |
2511 | dh->dh_depth = depth; |
2512 | } | |
2513 | ||
34dc7c2f BB |
2514 | dmu_buf_impl_t * |
2515 | dbuf_hold(dnode_t *dn, uint64_t blkid, void *tag) | |
2516 | { | |
fcff0f35 | 2517 | return (dbuf_hold_level(dn, 0, blkid, tag)); |
34dc7c2f BB |
2518 | } |
2519 | ||
2520 | dmu_buf_impl_t * | |
2521 | dbuf_hold_level(dnode_t *dn, int level, uint64_t blkid, void *tag) | |
2522 | { | |
2523 | dmu_buf_impl_t *db; | |
fcff0f35 | 2524 | int err = dbuf_hold_impl(dn, level, blkid, FALSE, FALSE, tag, &db); |
34dc7c2f BB |
2525 | return (err ? NULL : db); |
2526 | } | |
2527 | ||
2528 | void | |
2529 | dbuf_create_bonus(dnode_t *dn) | |
2530 | { | |
2531 | ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); | |
2532 | ||
2533 | ASSERT(dn->dn_bonus == NULL); | |
428870ff BB |
2534 | dn->dn_bonus = dbuf_create(dn, 0, DMU_BONUS_BLKID, dn->dn_dbuf, NULL); |
2535 | } | |
2536 | ||
2537 | int | |
2538 | dbuf_spill_set_blksz(dmu_buf_t *db_fake, uint64_t blksz, dmu_tx_t *tx) | |
2539 | { | |
2540 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
572e2857 BB |
2541 | dnode_t *dn; |
2542 | ||
428870ff | 2543 | if (db->db_blkid != DMU_SPILL_BLKID) |
2e528b49 | 2544 | return (SET_ERROR(ENOTSUP)); |
428870ff BB |
2545 | if (blksz == 0) |
2546 | blksz = SPA_MINBLOCKSIZE; | |
f1512ee6 MA |
2547 | ASSERT3U(blksz, <=, spa_maxblocksize(dmu_objset_spa(db->db_objset))); |
2548 | blksz = P2ROUNDUP(blksz, SPA_MINBLOCKSIZE); | |
428870ff | 2549 | |
572e2857 BB |
2550 | DB_DNODE_ENTER(db); |
2551 | dn = DB_DNODE(db); | |
2552 | rw_enter(&dn->dn_struct_rwlock, RW_WRITER); | |
428870ff | 2553 | dbuf_new_size(db, blksz, tx); |
572e2857 BB |
2554 | rw_exit(&dn->dn_struct_rwlock); |
2555 | DB_DNODE_EXIT(db); | |
428870ff BB |
2556 | |
2557 | return (0); | |
2558 | } | |
2559 | ||
2560 | void | |
2561 | dbuf_rm_spill(dnode_t *dn, dmu_tx_t *tx) | |
2562 | { | |
2563 | dbuf_free_range(dn, DMU_SPILL_BLKID, DMU_SPILL_BLKID, tx); | |
34dc7c2f BB |
2564 | } |
2565 | ||
2566 | #pragma weak dmu_buf_add_ref = dbuf_add_ref | |
2567 | void | |
2568 | dbuf_add_ref(dmu_buf_impl_t *db, void *tag) | |
2569 | { | |
1fde1e37 | 2570 | VERIFY(refcount_add(&db->db_holds, tag) > 1); |
34dc7c2f BB |
2571 | } |
2572 | ||
6ebebace JG |
2573 | #pragma weak dmu_buf_try_add_ref = dbuf_try_add_ref |
2574 | boolean_t | |
2575 | dbuf_try_add_ref(dmu_buf_t *db_fake, objset_t *os, uint64_t obj, uint64_t blkid, | |
2576 | void *tag) | |
2577 | { | |
2578 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
2579 | dmu_buf_impl_t *found_db; | |
2580 | boolean_t result = B_FALSE; | |
2581 | ||
d617648c | 2582 | if (blkid == DMU_BONUS_BLKID) |
6ebebace JG |
2583 | found_db = dbuf_find_bonus(os, obj); |
2584 | else | |
2585 | found_db = dbuf_find(os, obj, 0, blkid); | |
2586 | ||
2587 | if (found_db != NULL) { | |
2588 | if (db == found_db && dbuf_refcount(db) > db->db_dirtycnt) { | |
2589 | (void) refcount_add(&db->db_holds, tag); | |
2590 | result = B_TRUE; | |
2591 | } | |
d617648c | 2592 | mutex_exit(&found_db->db_mtx); |
6ebebace JG |
2593 | } |
2594 | return (result); | |
2595 | } | |
2596 | ||
572e2857 BB |
2597 | /* |
2598 | * If you call dbuf_rele() you had better not be referencing the dnode handle | |
2599 | * unless you have some other direct or indirect hold on the dnode. (An indirect | |
2600 | * hold is a hold on one of the dnode's dbufs, including the bonus buffer.) | |
2601 | * Without that, the dbuf_rele() could lead to a dnode_rele() followed by the | |
2602 | * dnode's parent dbuf evicting its dnode handles. | |
2603 | */ | |
34dc7c2f BB |
2604 | void |
2605 | dbuf_rele(dmu_buf_impl_t *db, void *tag) | |
428870ff BB |
2606 | { |
2607 | mutex_enter(&db->db_mtx); | |
2608 | dbuf_rele_and_unlock(db, tag); | |
2609 | } | |
2610 | ||
b0bc7a84 MG |
2611 | void |
2612 | dmu_buf_rele(dmu_buf_t *db, void *tag) | |
2613 | { | |
2614 | dbuf_rele((dmu_buf_impl_t *)db, tag); | |
2615 | } | |
2616 | ||
428870ff BB |
2617 | /* |
2618 | * dbuf_rele() for an already-locked dbuf. This is necessary to allow | |
2619 | * db_dirtycnt and db_holds to be updated atomically. | |
2620 | */ | |
2621 | void | |
2622 | dbuf_rele_and_unlock(dmu_buf_impl_t *db, void *tag) | |
34dc7c2f BB |
2623 | { |
2624 | int64_t holds; | |
2625 | ||
428870ff | 2626 | ASSERT(MUTEX_HELD(&db->db_mtx)); |
34dc7c2f BB |
2627 | DBUF_VERIFY(db); |
2628 | ||
572e2857 BB |
2629 | /* |
2630 | * Remove the reference to the dbuf before removing its hold on the | |
2631 | * dnode so we can guarantee in dnode_move() that a referenced bonus | |
2632 | * buffer has a corresponding dnode hold. | |
2633 | */ | |
34dc7c2f BB |
2634 | holds = refcount_remove(&db->db_holds, tag); |
2635 | ASSERT(holds >= 0); | |
2636 | ||
2637 | /* | |
2638 | * We can't freeze indirects if there is a possibility that they | |
2639 | * may be modified in the current syncing context. | |
2640 | */ | |
2641 | if (db->db_buf && holds == (db->db_level == 0 ? db->db_dirtycnt : 0)) | |
2642 | arc_buf_freeze(db->db_buf); | |
2643 | ||
2644 | if (holds == db->db_dirtycnt && | |
bc4501f7 | 2645 | db->db_level == 0 && db->db_user_immediate_evict) |
34dc7c2f BB |
2646 | dbuf_evict_user(db); |
2647 | ||
2648 | if (holds == 0) { | |
428870ff | 2649 | if (db->db_blkid == DMU_BONUS_BLKID) { |
4c7b7eed | 2650 | dnode_t *dn; |
bc4501f7 | 2651 | boolean_t evict_dbuf = db->db_pending_evict; |
572e2857 BB |
2652 | |
2653 | /* | |
4c7b7eed JG |
2654 | * If the dnode moves here, we cannot cross this |
2655 | * barrier until the move completes. | |
572e2857 BB |
2656 | */ |
2657 | DB_DNODE_ENTER(db); | |
4c7b7eed JG |
2658 | |
2659 | dn = DB_DNODE(db); | |
2660 | atomic_dec_32(&dn->dn_dbufs_count); | |
2661 | ||
2662 | /* | |
2663 | * Decrementing the dbuf count means that the bonus | |
2664 | * buffer's dnode hold is no longer discounted in | |
2665 | * dnode_move(). The dnode cannot move until after | |
bc4501f7 | 2666 | * the dnode_rele() below. |
4c7b7eed | 2667 | */ |
572e2857 | 2668 | DB_DNODE_EXIT(db); |
4c7b7eed JG |
2669 | |
2670 | /* | |
2671 | * Do not reference db after its lock is dropped. | |
2672 | * Another thread may evict it. | |
2673 | */ | |
2674 | mutex_exit(&db->db_mtx); | |
2675 | ||
bc4501f7 | 2676 | if (evict_dbuf) |
4c7b7eed | 2677 | dnode_evict_bonus(dn); |
bc4501f7 JG |
2678 | |
2679 | dnode_rele(dn, db); | |
34dc7c2f BB |
2680 | } else if (db->db_buf == NULL) { |
2681 | /* | |
2682 | * This is a special case: we never associated this | |
2683 | * dbuf with any data allocated from the ARC. | |
2684 | */ | |
b128c09f BB |
2685 | ASSERT(db->db_state == DB_UNCACHED || |
2686 | db->db_state == DB_NOFILL); | |
34dc7c2f BB |
2687 | dbuf_evict(db); |
2688 | } else if (arc_released(db->db_buf)) { | |
2689 | arc_buf_t *buf = db->db_buf; | |
2690 | /* | |
2691 | * This dbuf has anonymous data associated with it. | |
2692 | */ | |
0c66c32d | 2693 | dbuf_clear_data(db); |
13fe0198 | 2694 | VERIFY(arc_buf_remove_ref(buf, db)); |
34dc7c2f BB |
2695 | dbuf_evict(db); |
2696 | } else { | |
13fe0198 | 2697 | VERIFY(!arc_buf_remove_ref(db->db_buf, db)); |
1eb5bfa3 GW |
2698 | |
2699 | /* | |
2700 | * A dbuf will be eligible for eviction if either the | |
2701 | * 'primarycache' property is set or a duplicate | |
2702 | * copy of this buffer is already cached in the arc. | |
2703 | * | |
2704 | * In the case of the 'primarycache' a buffer | |
2705 | * is considered for eviction if it matches the | |
2706 | * criteria set in the property. | |
2707 | * | |
2708 | * To decide if our buffer is considered a | |
2709 | * duplicate, we must call into the arc to determine | |
2710 | * if multiple buffers are referencing the same | |
2711 | * block on-disk. If so, then we simply evict | |
2712 | * ourselves. | |
2713 | */ | |
bd089c54 MA |
2714 | if (!DBUF_IS_CACHEABLE(db)) { |
2715 | if (db->db_blkptr != NULL && | |
2716 | !BP_IS_HOLE(db->db_blkptr) && | |
2717 | !BP_IS_EMBEDDED(db->db_blkptr)) { | |
2718 | spa_t *spa = | |
2719 | dmu_objset_spa(db->db_objset); | |
2720 | blkptr_t bp = *db->db_blkptr; | |
2721 | dbuf_clear(db); | |
2722 | arc_freed(spa, &bp); | |
2723 | } else { | |
2724 | dbuf_clear(db); | |
2725 | } | |
bc4501f7 | 2726 | } else if (db->db_pending_evict || |
0c66c32d | 2727 | arc_buf_eviction_needed(db->db_buf)) { |
b128c09f | 2728 | dbuf_clear(db); |
bd089c54 | 2729 | } else { |
b128c09f | 2730 | mutex_exit(&db->db_mtx); |
bd089c54 | 2731 | } |
34dc7c2f BB |
2732 | } |
2733 | } else { | |
2734 | mutex_exit(&db->db_mtx); | |
2735 | } | |
2736 | } | |
2737 | ||
2738 | #pragma weak dmu_buf_refcount = dbuf_refcount | |
2739 | uint64_t | |
2740 | dbuf_refcount(dmu_buf_impl_t *db) | |
2741 | { | |
2742 | return (refcount_count(&db->db_holds)); | |
2743 | } | |
2744 | ||
2745 | void * | |
0c66c32d JG |
2746 | dmu_buf_replace_user(dmu_buf_t *db_fake, dmu_buf_user_t *old_user, |
2747 | dmu_buf_user_t *new_user) | |
34dc7c2f | 2748 | { |
0c66c32d JG |
2749 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; |
2750 | ||
2751 | mutex_enter(&db->db_mtx); | |
2752 | dbuf_verify_user(db, DBVU_NOT_EVICTING); | |
2753 | if (db->db_user == old_user) | |
2754 | db->db_user = new_user; | |
2755 | else | |
2756 | old_user = db->db_user; | |
2757 | dbuf_verify_user(db, DBVU_NOT_EVICTING); | |
2758 | mutex_exit(&db->db_mtx); | |
2759 | ||
2760 | return (old_user); | |
34dc7c2f BB |
2761 | } |
2762 | ||
2763 | void * | |
0c66c32d | 2764 | dmu_buf_set_user(dmu_buf_t *db_fake, dmu_buf_user_t *user) |
34dc7c2f | 2765 | { |
0c66c32d | 2766 | return (dmu_buf_replace_user(db_fake, NULL, user)); |
34dc7c2f BB |
2767 | } |
2768 | ||
2769 | void * | |
0c66c32d | 2770 | dmu_buf_set_user_ie(dmu_buf_t *db_fake, dmu_buf_user_t *user) |
34dc7c2f BB |
2771 | { |
2772 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
34dc7c2f | 2773 | |
bc4501f7 | 2774 | db->db_user_immediate_evict = TRUE; |
0c66c32d JG |
2775 | return (dmu_buf_set_user(db_fake, user)); |
2776 | } | |
34dc7c2f | 2777 | |
0c66c32d JG |
2778 | void * |
2779 | dmu_buf_remove_user(dmu_buf_t *db_fake, dmu_buf_user_t *user) | |
2780 | { | |
2781 | return (dmu_buf_replace_user(db_fake, user, NULL)); | |
34dc7c2f BB |
2782 | } |
2783 | ||
2784 | void * | |
2785 | dmu_buf_get_user(dmu_buf_t *db_fake) | |
2786 | { | |
2787 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake; | |
34dc7c2f | 2788 | |
0c66c32d JG |
2789 | dbuf_verify_user(db, DBVU_NOT_EVICTING); |
2790 | return (db->db_user); | |
2791 | } | |
2792 | ||
2793 | void | |
2794 | dmu_buf_user_evict_wait() | |
2795 | { | |
2796 | taskq_wait(dbu_evict_taskq); | |
34dc7c2f BB |
2797 | } |
2798 | ||
9babb374 BB |
2799 | boolean_t |
2800 | dmu_buf_freeable(dmu_buf_t *dbuf) | |
2801 | { | |
2802 | boolean_t res = B_FALSE; | |
2803 | dmu_buf_impl_t *db = (dmu_buf_impl_t *)dbuf; | |
2804 | ||
2805 | if (db->db_blkptr) | |
2806 | res = dsl_dataset_block_freeable(db->db_objset->os_dsl_dataset, | |
428870ff | 2807 | db->db_blkptr, db->db_blkptr->blk_birth); |
9babb374 BB |
2808 | |
2809 | return (res); | |
2810 | } | |
2811 | ||
03c6040b GW |
2812 | blkptr_t * |
2813 | dmu_buf_get_blkptr(dmu_buf_t *db) | |
2814 | { | |
2815 | dmu_buf_impl_t *dbi = (dmu_buf_impl_t *)db; | |
2816 | return (dbi->db_blkptr); | |
2817 | } | |
2818 | ||
34dc7c2f BB |
2819 | static void |
2820 | dbuf_check_blkptr(dnode_t *dn, dmu_buf_impl_t *db) | |
2821 | { | |
2822 | /* ASSERT(dmu_tx_is_syncing(tx) */ | |
2823 | ASSERT(MUTEX_HELD(&db->db_mtx)); | |
2824 | ||
2825 | if (db->db_blkptr != NULL) | |
2826 | return; | |
2827 | ||
428870ff | 2828 | if (db->db_blkid == DMU_SPILL_BLKID) { |
50c957f7 | 2829 | db->db_blkptr = DN_SPILL_BLKPTR(dn->dn_phys); |
428870ff BB |
2830 | BP_ZERO(db->db_blkptr); |
2831 | return; | |
2832 | } | |
34dc7c2f BB |
2833 | if (db->db_level == dn->dn_phys->dn_nlevels-1) { |
2834 | /* | |
2835 | * This buffer was allocated at a time when there was | |
2836 | * no available blkptrs from the dnode, or it was | |
2837 | * inappropriate to hook it in (i.e., nlevels mis-match). | |
2838 | */ | |
2839 | ASSERT(db->db_blkid < dn->dn_phys->dn_nblkptr); | |
2840 | ASSERT(db->db_parent == NULL); | |
2841 | db->db_parent = dn->dn_dbuf; | |
2842 | db->db_blkptr = &dn->dn_phys->dn_blkptr[db->db_blkid]; | |
2843 | DBUF_VERIFY(db); | |
2844 | } else { | |
2845 | dmu_buf_impl_t *parent = db->db_parent; | |
2846 | int epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; | |
2847 | ||
2848 | ASSERT(dn->dn_phys->dn_nlevels > 1); | |
2849 | if (parent == NULL) { | |
2850 | mutex_exit(&db->db_mtx); | |
2851 | rw_enter(&dn->dn_struct_rwlock, RW_READER); | |
fcff0f35 PD |
2852 | parent = dbuf_hold_level(dn, db->db_level + 1, |
2853 | db->db_blkid >> epbs, db); | |
34dc7c2f BB |
2854 | rw_exit(&dn->dn_struct_rwlock); |
2855 | mutex_enter(&db->db_mtx); | |
2856 | db->db_parent = parent; | |
2857 | } | |
2858 | db->db_blkptr = (blkptr_t *)parent->db.db_data + | |
2859 | (db->db_blkid & ((1ULL << epbs) - 1)); | |
2860 | DBUF_VERIFY(db); | |
2861 | } | |
2862 | } | |
2863 | ||
d1d7e268 MK |
2864 | /* |
2865 | * dbuf_sync_indirect() is called recursively from dbuf_sync_list() so it | |
60948de1 BB |
2866 | * is critical the we not allow the compiler to inline this function in to |
2867 | * dbuf_sync_list() thereby drastically bloating the stack usage. | |
2868 | */ | |
2869 | noinline static void | |
34dc7c2f BB |
2870 | dbuf_sync_indirect(dbuf_dirty_record_t *dr, dmu_tx_t *tx) |
2871 | { | |
2872 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
572e2857 | 2873 | dnode_t *dn; |
34dc7c2f BB |
2874 | zio_t *zio; |
2875 | ||
2876 | ASSERT(dmu_tx_is_syncing(tx)); | |
2877 | ||
2878 | dprintf_dbuf_bp(db, db->db_blkptr, "blkptr=%p", db->db_blkptr); | |
2879 | ||
2880 | mutex_enter(&db->db_mtx); | |
2881 | ||
2882 | ASSERT(db->db_level > 0); | |
2883 | DBUF_VERIFY(db); | |
2884 | ||
e49f1e20 | 2885 | /* Read the block if it hasn't been read yet. */ |
34dc7c2f BB |
2886 | if (db->db_buf == NULL) { |
2887 | mutex_exit(&db->db_mtx); | |
2888 | (void) dbuf_read(db, NULL, DB_RF_MUST_SUCCEED); | |
2889 | mutex_enter(&db->db_mtx); | |
2890 | } | |
2891 | ASSERT3U(db->db_state, ==, DB_CACHED); | |
34dc7c2f BB |
2892 | ASSERT(db->db_buf != NULL); |
2893 | ||
572e2857 BB |
2894 | DB_DNODE_ENTER(db); |
2895 | dn = DB_DNODE(db); | |
e49f1e20 | 2896 | /* Indirect block size must match what the dnode thinks it is. */ |
572e2857 | 2897 | ASSERT3U(db->db.db_size, ==, 1<<dn->dn_phys->dn_indblkshift); |
34dc7c2f | 2898 | dbuf_check_blkptr(dn, db); |
572e2857 | 2899 | DB_DNODE_EXIT(db); |
34dc7c2f | 2900 | |
e49f1e20 | 2901 | /* Provide the pending dirty record to child dbufs */ |
34dc7c2f BB |
2902 | db->db_data_pending = dr; |
2903 | ||
34dc7c2f | 2904 | mutex_exit(&db->db_mtx); |
b128c09f | 2905 | dbuf_write(dr, db->db_buf, tx); |
34dc7c2f BB |
2906 | |
2907 | zio = dr->dr_zio; | |
2908 | mutex_enter(&dr->dt.di.dr_mtx); | |
4bda3bd0 | 2909 | dbuf_sync_list(&dr->dt.di.dr_children, db->db_level - 1, tx); |
34dc7c2f BB |
2910 | ASSERT(list_head(&dr->dt.di.dr_children) == NULL); |
2911 | mutex_exit(&dr->dt.di.dr_mtx); | |
2912 | zio_nowait(zio); | |
2913 | } | |
2914 | ||
d1d7e268 MK |
2915 | /* |
2916 | * dbuf_sync_leaf() is called recursively from dbuf_sync_list() so it is | |
60948de1 BB |
2917 | * critical the we not allow the compiler to inline this function in to |
2918 | * dbuf_sync_list() thereby drastically bloating the stack usage. | |
2919 | */ | |
2920 | noinline static void | |
34dc7c2f BB |
2921 | dbuf_sync_leaf(dbuf_dirty_record_t *dr, dmu_tx_t *tx) |
2922 | { | |
2923 | arc_buf_t **datap = &dr->dt.dl.dr_data; | |
2924 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
572e2857 BB |
2925 | dnode_t *dn; |
2926 | objset_t *os; | |
34dc7c2f | 2927 | uint64_t txg = tx->tx_txg; |
34dc7c2f BB |
2928 | |
2929 | ASSERT(dmu_tx_is_syncing(tx)); | |
2930 | ||
2931 | dprintf_dbuf_bp(db, db->db_blkptr, "blkptr=%p", db->db_blkptr); | |
2932 | ||
2933 | mutex_enter(&db->db_mtx); | |
2934 | /* | |
2935 | * To be synced, we must be dirtied. But we | |
2936 | * might have been freed after the dirty. | |
2937 | */ | |
2938 | if (db->db_state == DB_UNCACHED) { | |
2939 | /* This buffer has been freed since it was dirtied */ | |
2940 | ASSERT(db->db.db_data == NULL); | |
2941 | } else if (db->db_state == DB_FILL) { | |
2942 | /* This buffer was freed and is now being re-filled */ | |
2943 | ASSERT(db->db.db_data != dr->dt.dl.dr_data); | |
2944 | } else { | |
b128c09f | 2945 | ASSERT(db->db_state == DB_CACHED || db->db_state == DB_NOFILL); |
34dc7c2f BB |
2946 | } |
2947 | DBUF_VERIFY(db); | |
2948 | ||
572e2857 BB |
2949 | DB_DNODE_ENTER(db); |
2950 | dn = DB_DNODE(db); | |
2951 | ||
428870ff BB |
2952 | if (db->db_blkid == DMU_SPILL_BLKID) { |
2953 | mutex_enter(&dn->dn_mtx); | |
81edd3e8 P |
2954 | if (!(dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR)) { |
2955 | /* | |
2956 | * In the previous transaction group, the bonus buffer | |
2957 | * was entirely used to store the attributes for the | |
2958 | * dnode which overrode the dn_spill field. However, | |
2959 | * when adding more attributes to the file a spill | |
2960 | * block was required to hold the extra attributes. | |
2961 | * | |
2962 | * Make sure to clear the garbage left in the dn_spill | |
2963 | * field from the previous attributes in the bonus | |
2964 | * buffer. Otherwise, after writing out the spill | |
2965 | * block to the new allocated dva, it will free | |
2966 | * the old block pointed to by the invalid dn_spill. | |
2967 | */ | |
2968 | db->db_blkptr = NULL; | |
2969 | } | |
428870ff BB |
2970 | dn->dn_phys->dn_flags |= DNODE_FLAG_SPILL_BLKPTR; |
2971 | mutex_exit(&dn->dn_mtx); | |
2972 | } | |
2973 | ||
34dc7c2f BB |
2974 | /* |
2975 | * If this is a bonus buffer, simply copy the bonus data into the | |
2976 | * dnode. It will be written out when the dnode is synced (and it | |
2977 | * will be synced, since it must have been dirty for dbuf_sync to | |
2978 | * be called). | |
2979 | */ | |
428870ff | 2980 | if (db->db_blkid == DMU_BONUS_BLKID) { |
34dc7c2f BB |
2981 | dbuf_dirty_record_t **drp; |
2982 | ||
2983 | ASSERT(*datap != NULL); | |
c99c9001 | 2984 | ASSERT0(db->db_level); |
50c957f7 NB |
2985 | ASSERT3U(dn->dn_phys->dn_bonuslen, <=, |
2986 | DN_SLOTS_TO_BONUSLEN(dn->dn_phys->dn_extra_slots + 1)); | |
34dc7c2f | 2987 | bcopy(*datap, DN_BONUS(dn->dn_phys), dn->dn_phys->dn_bonuslen); |
572e2857 BB |
2988 | DB_DNODE_EXIT(db); |
2989 | ||
34dc7c2f | 2990 | if (*datap != db->db.db_data) { |
50c957f7 NB |
2991 | int slots = DB_DNODE(db)->dn_num_slots; |
2992 | int bonuslen = DN_SLOTS_TO_BONUSLEN(slots); | |
2993 | zio_buf_free(*datap, bonuslen); | |
25458cbe | 2994 | arc_space_return(bonuslen, ARC_SPACE_BONUS); |
34dc7c2f BB |
2995 | } |
2996 | db->db_data_pending = NULL; | |
2997 | drp = &db->db_last_dirty; | |
2998 | while (*drp != dr) | |
2999 | drp = &(*drp)->dr_next; | |
3000 | ASSERT(dr->dr_next == NULL); | |
428870ff | 3001 | ASSERT(dr->dr_dbuf == db); |
34dc7c2f | 3002 | *drp = dr->dr_next; |
753972fc BB |
3003 | if (dr->dr_dbuf->db_level != 0) { |
3004 | mutex_destroy(&dr->dt.di.dr_mtx); | |
3005 | list_destroy(&dr->dt.di.dr_children); | |
3006 | } | |
34dc7c2f BB |
3007 | kmem_free(dr, sizeof (dbuf_dirty_record_t)); |
3008 | ASSERT(db->db_dirtycnt > 0); | |
3009 | db->db_dirtycnt -= 1; | |
428870ff | 3010 | dbuf_rele_and_unlock(db, (void *)(uintptr_t)txg); |
34dc7c2f BB |
3011 | return; |
3012 | } | |
3013 | ||
572e2857 BB |
3014 | os = dn->dn_objset; |
3015 | ||
34dc7c2f BB |
3016 | /* |
3017 | * This function may have dropped the db_mtx lock allowing a dmu_sync | |
3018 | * operation to sneak in. As a result, we need to ensure that we | |
3019 | * don't check the dr_override_state until we have returned from | |
3020 | * dbuf_check_blkptr. | |
3021 | */ | |
3022 | dbuf_check_blkptr(dn, db); | |
3023 | ||
3024 | /* | |
572e2857 | 3025 | * If this buffer is in the middle of an immediate write, |
34dc7c2f BB |
3026 | * wait for the synchronous IO to complete. |
3027 | */ | |
3028 | while (dr->dt.dl.dr_override_state == DR_IN_DMU_SYNC) { | |
3029 | ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT); | |
3030 | cv_wait(&db->db_changed, &db->db_mtx); | |
3031 | ASSERT(dr->dt.dl.dr_override_state != DR_NOT_OVERRIDDEN); | |
3032 | } | |
3033 | ||
9babb374 BB |
3034 | if (db->db_state != DB_NOFILL && |
3035 | dn->dn_object != DMU_META_DNODE_OBJECT && | |
3036 | refcount_count(&db->db_holds) > 1 && | |
428870ff | 3037 | dr->dt.dl.dr_override_state != DR_OVERRIDDEN && |
9babb374 BB |
3038 | *datap == db->db_buf) { |
3039 | /* | |
3040 | * If this buffer is currently "in use" (i.e., there | |
3041 | * are active holds and db_data still references it), | |
3042 | * then make a copy before we start the write so that | |
3043 | * any modifications from the open txg will not leak | |
3044 | * into this write. | |
3045 | * | |
3046 | * NOTE: this copy does not need to be made for | |
3047 | * objects only modified in the syncing context (e.g. | |
3048 | * DNONE_DNODE blocks). | |
3049 | */ | |
3050 | int blksz = arc_buf_size(*datap); | |
3051 | arc_buf_contents_t type = DBUF_GET_BUFC_TYPE(db); | |
3052 | *datap = arc_buf_alloc(os->os_spa, blksz, db, type); | |
3053 | bcopy(db->db.db_data, (*datap)->b_data, blksz); | |
b128c09f | 3054 | } |
34dc7c2f BB |
3055 | db->db_data_pending = dr; |
3056 | ||
3057 | mutex_exit(&db->db_mtx); | |
3058 | ||
b128c09f | 3059 | dbuf_write(dr, *datap, tx); |
34dc7c2f BB |
3060 | |
3061 | ASSERT(!list_link_active(&dr->dr_dirty_node)); | |
572e2857 | 3062 | if (dn->dn_object == DMU_META_DNODE_OBJECT) { |
34dc7c2f | 3063 | list_insert_tail(&dn->dn_dirty_records[txg&TXG_MASK], dr); |
572e2857 BB |
3064 | DB_DNODE_EXIT(db); |
3065 | } else { | |
3066 | /* | |
3067 | * Although zio_nowait() does not "wait for an IO", it does | |
3068 | * initiate the IO. If this is an empty write it seems plausible | |
3069 | * that the IO could actually be completed before the nowait | |
3070 | * returns. We need to DB_DNODE_EXIT() first in case | |
3071 | * zio_nowait() invalidates the dbuf. | |
3072 | */ | |
3073 | DB_DNODE_EXIT(db); | |
34dc7c2f | 3074 | zio_nowait(dr->dr_zio); |
572e2857 | 3075 | } |
34dc7c2f BB |
3076 | } |
3077 | ||
3078 | void | |
4bda3bd0 | 3079 | dbuf_sync_list(list_t *list, int level, dmu_tx_t *tx) |
34dc7c2f BB |
3080 | { |
3081 | dbuf_dirty_record_t *dr; | |
3082 | ||
c65aa5b2 | 3083 | while ((dr = list_head(list))) { |
34dc7c2f BB |
3084 | if (dr->dr_zio != NULL) { |
3085 | /* | |
3086 | * If we find an already initialized zio then we | |
3087 | * are processing the meta-dnode, and we have finished. | |
3088 | * The dbufs for all dnodes are put back on the list | |
3089 | * during processing, so that we can zio_wait() | |
3090 | * these IOs after initiating all child IOs. | |
3091 | */ | |
3092 | ASSERT3U(dr->dr_dbuf->db.db_object, ==, | |
3093 | DMU_META_DNODE_OBJECT); | |
3094 | break; | |
3095 | } | |
4bda3bd0 MA |
3096 | if (dr->dr_dbuf->db_blkid != DMU_BONUS_BLKID && |
3097 | dr->dr_dbuf->db_blkid != DMU_SPILL_BLKID) { | |
3098 | VERIFY3U(dr->dr_dbuf->db_level, ==, level); | |
3099 | } | |
34dc7c2f BB |
3100 | list_remove(list, dr); |
3101 | if (dr->dr_dbuf->db_level > 0) | |
3102 | dbuf_sync_indirect(dr, tx); | |
3103 | else | |
3104 | dbuf_sync_leaf(dr, tx); | |
3105 | } | |
3106 | } | |
3107 | ||
34dc7c2f BB |
3108 | /* ARGSUSED */ |
3109 | static void | |
3110 | dbuf_write_ready(zio_t *zio, arc_buf_t *buf, void *vdb) | |
3111 | { | |
3112 | dmu_buf_impl_t *db = vdb; | |
572e2857 | 3113 | dnode_t *dn; |
b128c09f | 3114 | blkptr_t *bp = zio->io_bp; |
34dc7c2f | 3115 | blkptr_t *bp_orig = &zio->io_bp_orig; |
428870ff BB |
3116 | spa_t *spa = zio->io_spa; |
3117 | int64_t delta; | |
34dc7c2f | 3118 | uint64_t fill = 0; |
428870ff | 3119 | int i; |
34dc7c2f | 3120 | |
463a8cfe AR |
3121 | ASSERT3P(db->db_blkptr, !=, NULL); |
3122 | ASSERT3P(&db->db_data_pending->dr_bp_copy, ==, bp); | |
b128c09f | 3123 | |
572e2857 BB |
3124 | DB_DNODE_ENTER(db); |
3125 | dn = DB_DNODE(db); | |
428870ff BB |
3126 | delta = bp_get_dsize_sync(spa, bp) - bp_get_dsize_sync(spa, bp_orig); |
3127 | dnode_diduse_space(dn, delta - zio->io_prev_space_delta); | |
3128 | zio->io_prev_space_delta = delta; | |
34dc7c2f | 3129 | |
b0bc7a84 MG |
3130 | if (bp->blk_birth != 0) { |
3131 | ASSERT((db->db_blkid != DMU_SPILL_BLKID && | |
3132 | BP_GET_TYPE(bp) == dn->dn_type) || | |
3133 | (db->db_blkid == DMU_SPILL_BLKID && | |
9b67f605 MA |
3134 | BP_GET_TYPE(bp) == dn->dn_bonustype) || |
3135 | BP_IS_EMBEDDED(bp)); | |
b0bc7a84 | 3136 | ASSERT(BP_GET_LEVEL(bp) == db->db_level); |
34dc7c2f BB |
3137 | } |
3138 | ||
3139 | mutex_enter(&db->db_mtx); | |
3140 | ||
428870ff BB |
3141 | #ifdef ZFS_DEBUG |
3142 | if (db->db_blkid == DMU_SPILL_BLKID) { | |
428870ff | 3143 | ASSERT(dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR); |
463a8cfe | 3144 | ASSERT(!(BP_IS_HOLE(bp)) && |
50c957f7 | 3145 | db->db_blkptr == DN_SPILL_BLKPTR(dn->dn_phys)); |
428870ff BB |
3146 | } |
3147 | #endif | |
3148 | ||
34dc7c2f BB |
3149 | if (db->db_level == 0) { |
3150 | mutex_enter(&dn->dn_mtx); | |
428870ff BB |
3151 | if (db->db_blkid > dn->dn_phys->dn_maxblkid && |
3152 | db->db_blkid != DMU_SPILL_BLKID) | |
34dc7c2f BB |
3153 | dn->dn_phys->dn_maxblkid = db->db_blkid; |
3154 | mutex_exit(&dn->dn_mtx); | |
3155 | ||
3156 | if (dn->dn_type == DMU_OT_DNODE) { | |
50c957f7 NB |
3157 | i = 0; |
3158 | while (i < db->db.db_size) { | |
3159 | dnode_phys_t *dnp = db->db.db_data + i; | |
3160 | ||
3161 | i += DNODE_MIN_SIZE; | |
3162 | if (dnp->dn_type != DMU_OT_NONE) { | |
34dc7c2f | 3163 | fill++; |
50c957f7 NB |
3164 | i += dnp->dn_extra_slots * |
3165 | DNODE_MIN_SIZE; | |
3166 | } | |
34dc7c2f BB |
3167 | } |
3168 | } else { | |
b0bc7a84 MG |
3169 | if (BP_IS_HOLE(bp)) { |
3170 | fill = 0; | |
3171 | } else { | |
3172 | fill = 1; | |
3173 | } | |
34dc7c2f BB |
3174 | } |
3175 | } else { | |
b128c09f | 3176 | blkptr_t *ibp = db->db.db_data; |
34dc7c2f | 3177 | ASSERT3U(db->db.db_size, ==, 1<<dn->dn_phys->dn_indblkshift); |
b128c09f BB |
3178 | for (i = db->db.db_size >> SPA_BLKPTRSHIFT; i > 0; i--, ibp++) { |
3179 | if (BP_IS_HOLE(ibp)) | |
34dc7c2f | 3180 | continue; |
9b67f605 | 3181 | fill += BP_GET_FILL(ibp); |
34dc7c2f BB |
3182 | } |
3183 | } | |
572e2857 | 3184 | DB_DNODE_EXIT(db); |
34dc7c2f | 3185 | |
9b67f605 MA |
3186 | if (!BP_IS_EMBEDDED(bp)) |
3187 | bp->blk_fill = fill; | |
34dc7c2f BB |
3188 | |
3189 | mutex_exit(&db->db_mtx); | |
463a8cfe AR |
3190 | |
3191 | rw_enter(&dn->dn_struct_rwlock, RW_WRITER); | |
3192 | *db->db_blkptr = *bp; | |
3193 | rw_exit(&dn->dn_struct_rwlock); | |
34dc7c2f BB |
3194 | } |
3195 | ||
bc77ba73 PD |
3196 | /* ARGSUSED */ |
3197 | /* | |
3198 | * This function gets called just prior to running through the compression | |
3199 | * stage of the zio pipeline. If we're an indirect block comprised of only | |
3200 | * holes, then we want this indirect to be compressed away to a hole. In | |
3201 | * order to do that we must zero out any information about the holes that | |
3202 | * this indirect points to prior to before we try to compress it. | |
3203 | */ | |
3204 | static void | |
3205 | dbuf_write_children_ready(zio_t *zio, arc_buf_t *buf, void *vdb) | |
3206 | { | |
3207 | dmu_buf_impl_t *db = vdb; | |
3208 | dnode_t *dn; | |
3209 | blkptr_t *bp; | |
3210 | uint64_t i; | |
3211 | int epbs; | |
3212 | ||
3213 | ASSERT3U(db->db_level, >, 0); | |
3214 | DB_DNODE_ENTER(db); | |
3215 | dn = DB_DNODE(db); | |
3216 | epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; | |
3217 | ||
3218 | /* Determine if all our children are holes */ | |
3219 | for (i = 0, bp = db->db.db_data; i < 1 << epbs; i++, bp++) { | |
3220 | if (!BP_IS_HOLE(bp)) | |
3221 | break; | |
3222 | } | |
3223 | ||
3224 | /* | |
3225 | * If all the children are holes, then zero them all out so that | |
3226 | * we may get compressed away. | |
3227 | */ | |
3228 | if (i == 1 << epbs) { | |
3229 | /* didn't find any non-holes */ | |
3230 | bzero(db->db.db_data, db->db.db_size); | |
3231 | } | |
3232 | DB_DNODE_EXIT(db); | |
3233 | } | |
3234 | ||
e8b96c60 MA |
3235 | /* |
3236 | * The SPA will call this callback several times for each zio - once | |
3237 | * for every physical child i/o (zio->io_phys_children times). This | |
3238 | * allows the DMU to monitor the progress of each logical i/o. For example, | |
3239 | * there may be 2 copies of an indirect block, or many fragments of a RAID-Z | |
3240 | * block. There may be a long delay before all copies/fragments are completed, | |
3241 | * so this callback allows us to retire dirty space gradually, as the physical | |
3242 | * i/os complete. | |
3243 | */ | |
3244 | /* ARGSUSED */ | |
3245 | static void | |
3246 | dbuf_write_physdone(zio_t *zio, arc_buf_t *buf, void *arg) | |
3247 | { | |
3248 | dmu_buf_impl_t *db = arg; | |
3249 | objset_t *os = db->db_objset; | |
3250 | dsl_pool_t *dp = dmu_objset_pool(os); | |
3251 | dbuf_dirty_record_t *dr; | |
3252 | int delta = 0; | |
3253 | ||
3254 | dr = db->db_data_pending; | |
3255 | ASSERT3U(dr->dr_txg, ==, zio->io_txg); | |
3256 | ||
3257 | /* | |
3258 | * The callback will be called io_phys_children times. Retire one | |
3259 | * portion of our dirty space each time we are called. Any rounding | |
3260 | * error will be cleaned up by dsl_pool_sync()'s call to | |
3261 | * dsl_pool_undirty_space(). | |
3262 | */ | |
3263 | delta = dr->dr_accounted / zio->io_phys_children; | |
3264 | dsl_pool_undirty_space(dp, delta, zio->io_txg); | |
3265 | } | |
3266 | ||
34dc7c2f BB |
3267 | /* ARGSUSED */ |
3268 | static void | |
3269 | dbuf_write_done(zio_t *zio, arc_buf_t *buf, void *vdb) | |
3270 | { | |
3271 | dmu_buf_impl_t *db = vdb; | |
428870ff | 3272 | blkptr_t *bp_orig = &zio->io_bp_orig; |
b0bc7a84 MG |
3273 | blkptr_t *bp = db->db_blkptr; |
3274 | objset_t *os = db->db_objset; | |
3275 | dmu_tx_t *tx = os->os_synctx; | |
34dc7c2f BB |
3276 | dbuf_dirty_record_t **drp, *dr; |
3277 | ||
c99c9001 | 3278 | ASSERT0(zio->io_error); |
428870ff BB |
3279 | ASSERT(db->db_blkptr == bp); |
3280 | ||
03c6040b GW |
3281 | /* |
3282 | * For nopwrites and rewrites we ensure that the bp matches our | |
3283 | * original and bypass all the accounting. | |
3284 | */ | |
3285 | if (zio->io_flags & (ZIO_FLAG_IO_REWRITE | ZIO_FLAG_NOPWRITE)) { | |
428870ff BB |
3286 | ASSERT(BP_EQUAL(bp, bp_orig)); |
3287 | } else { | |
b0bc7a84 | 3288 | dsl_dataset_t *ds = os->os_dsl_dataset; |
428870ff BB |
3289 | (void) dsl_dataset_block_kill(ds, bp_orig, tx, B_TRUE); |
3290 | dsl_dataset_block_born(ds, bp, tx); | |
3291 | } | |
34dc7c2f BB |
3292 | |
3293 | mutex_enter(&db->db_mtx); | |
3294 | ||
428870ff BB |
3295 | DBUF_VERIFY(db); |
3296 | ||
34dc7c2f BB |
3297 | drp = &db->db_last_dirty; |
3298 | while ((dr = *drp) != db->db_data_pending) | |
3299 | drp = &dr->dr_next; | |
3300 | ASSERT(!list_link_active(&dr->dr_dirty_node)); | |
428870ff | 3301 | ASSERT(dr->dr_dbuf == db); |
34dc7c2f BB |
3302 | ASSERT(dr->dr_next == NULL); |
3303 | *drp = dr->dr_next; | |
3304 | ||
428870ff BB |
3305 | #ifdef ZFS_DEBUG |
3306 | if (db->db_blkid == DMU_SPILL_BLKID) { | |
572e2857 BB |
3307 | dnode_t *dn; |
3308 | ||
3309 | DB_DNODE_ENTER(db); | |
3310 | dn = DB_DNODE(db); | |
428870ff BB |
3311 | ASSERT(dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR); |
3312 | ASSERT(!(BP_IS_HOLE(db->db_blkptr)) && | |
50c957f7 | 3313 | db->db_blkptr == DN_SPILL_BLKPTR(dn->dn_phys)); |
572e2857 | 3314 | DB_DNODE_EXIT(db); |
428870ff BB |
3315 | } |
3316 | #endif | |
3317 | ||
34dc7c2f | 3318 | if (db->db_level == 0) { |
428870ff | 3319 | ASSERT(db->db_blkid != DMU_BONUS_BLKID); |
34dc7c2f | 3320 | ASSERT(dr->dt.dl.dr_override_state == DR_NOT_OVERRIDDEN); |
b128c09f BB |
3321 | if (db->db_state != DB_NOFILL) { |
3322 | if (dr->dt.dl.dr_data != db->db_buf) | |
3323 | VERIFY(arc_buf_remove_ref(dr->dt.dl.dr_data, | |
13fe0198 | 3324 | db)); |
428870ff | 3325 | else if (!arc_released(db->db_buf)) |
b128c09f | 3326 | arc_set_callback(db->db_buf, dbuf_do_evict, db); |
b128c09f | 3327 | } |
34dc7c2f | 3328 | } else { |
572e2857 BB |
3329 | dnode_t *dn; |
3330 | ||
3331 | DB_DNODE_ENTER(db); | |
3332 | dn = DB_DNODE(db); | |
34dc7c2f | 3333 | ASSERT(list_head(&dr->dt.di.dr_children) == NULL); |
b0bc7a84 | 3334 | ASSERT3U(db->db.db_size, ==, 1 << dn->dn_phys->dn_indblkshift); |
34dc7c2f | 3335 | if (!BP_IS_HOLE(db->db_blkptr)) { |
1fde1e37 BB |
3336 | ASSERTV(int epbs = dn->dn_phys->dn_indblkshift - |
3337 | SPA_BLKPTRSHIFT); | |
b0bc7a84 MG |
3338 | ASSERT3U(db->db_blkid, <=, |
3339 | dn->dn_phys->dn_maxblkid >> (db->db_level * epbs)); | |
34dc7c2f BB |
3340 | ASSERT3U(BP_GET_LSIZE(db->db_blkptr), ==, |
3341 | db->db.db_size); | |
9b67f605 MA |
3342 | if (!arc_released(db->db_buf)) |
3343 | arc_set_callback(db->db_buf, dbuf_do_evict, db); | |
34dc7c2f | 3344 | } |
572e2857 | 3345 | DB_DNODE_EXIT(db); |
34dc7c2f BB |
3346 | mutex_destroy(&dr->dt.di.dr_mtx); |
3347 | list_destroy(&dr->dt.di.dr_children); | |
3348 | } | |
3349 | kmem_free(dr, sizeof (dbuf_dirty_record_t)); | |
3350 | ||
3351 | cv_broadcast(&db->db_changed); | |
3352 | ASSERT(db->db_dirtycnt > 0); | |
3353 | db->db_dirtycnt -= 1; | |
3354 | db->db_data_pending = NULL; | |
b0bc7a84 | 3355 | dbuf_rele_and_unlock(db, (void *)(uintptr_t)tx->tx_txg); |
428870ff BB |
3356 | } |
3357 | ||
3358 | static void | |
3359 | dbuf_write_nofill_ready(zio_t *zio) | |
3360 | { | |
3361 | dbuf_write_ready(zio, NULL, zio->io_private); | |
3362 | } | |
3363 | ||
3364 | static void | |
3365 | dbuf_write_nofill_done(zio_t *zio) | |
3366 | { | |
3367 | dbuf_write_done(zio, NULL, zio->io_private); | |
3368 | } | |
3369 | ||
3370 | static void | |
3371 | dbuf_write_override_ready(zio_t *zio) | |
3372 | { | |
3373 | dbuf_dirty_record_t *dr = zio->io_private; | |
3374 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
3375 | ||
3376 | dbuf_write_ready(zio, NULL, db); | |
3377 | } | |
3378 | ||
3379 | static void | |
3380 | dbuf_write_override_done(zio_t *zio) | |
3381 | { | |
3382 | dbuf_dirty_record_t *dr = zio->io_private; | |
3383 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
3384 | blkptr_t *obp = &dr->dt.dl.dr_overridden_by; | |
3385 | ||
3386 | mutex_enter(&db->db_mtx); | |
3387 | if (!BP_EQUAL(zio->io_bp, obp)) { | |
3388 | if (!BP_IS_HOLE(obp)) | |
3389 | dsl_free(spa_get_dsl(zio->io_spa), zio->io_txg, obp); | |
3390 | arc_release(dr->dt.dl.dr_data, db); | |
3391 | } | |
34dc7c2f BB |
3392 | mutex_exit(&db->db_mtx); |
3393 | ||
428870ff BB |
3394 | dbuf_write_done(zio, NULL, db); |
3395 | } | |
3396 | ||
e49f1e20 | 3397 | /* Issue I/O to commit a dirty buffer to disk. */ |
428870ff BB |
3398 | static void |
3399 | dbuf_write(dbuf_dirty_record_t *dr, arc_buf_t *data, dmu_tx_t *tx) | |
3400 | { | |
3401 | dmu_buf_impl_t *db = dr->dr_dbuf; | |
572e2857 BB |
3402 | dnode_t *dn; |
3403 | objset_t *os; | |
428870ff BB |
3404 | dmu_buf_impl_t *parent = db->db_parent; |
3405 | uint64_t txg = tx->tx_txg; | |
5dbd68a3 | 3406 | zbookmark_phys_t zb; |
428870ff BB |
3407 | zio_prop_t zp; |
3408 | zio_t *zio; | |
3409 | int wp_flag = 0; | |
34dc7c2f | 3410 | |
463a8cfe AR |
3411 | ASSERT(dmu_tx_is_syncing(tx)); |
3412 | ||
572e2857 BB |
3413 | DB_DNODE_ENTER(db); |
3414 | dn = DB_DNODE(db); | |
3415 | os = dn->dn_objset; | |
3416 | ||
428870ff BB |
3417 | if (db->db_state != DB_NOFILL) { |
3418 | if (db->db_level > 0 || dn->dn_type == DMU_OT_DNODE) { | |
3419 | /* | |
3420 | * Private object buffers are released here rather | |
3421 | * than in dbuf_dirty() since they are only modified | |
3422 | * in the syncing context and we don't want the | |
3423 | * overhead of making multiple copies of the data. | |
3424 | */ | |
3425 | if (BP_IS_HOLE(db->db_blkptr)) { | |
3426 | arc_buf_thaw(data); | |
3427 | } else { | |
3428 | dbuf_release_bp(db); | |
3429 | } | |
3430 | } | |
3431 | } | |
3432 | ||
3433 | if (parent != dn->dn_dbuf) { | |
e49f1e20 WA |
3434 | /* Our parent is an indirect block. */ |
3435 | /* We have a dirty parent that has been scheduled for write. */ | |
428870ff | 3436 | ASSERT(parent && parent->db_data_pending); |
e49f1e20 | 3437 | /* Our parent's buffer is one level closer to the dnode. */ |
428870ff | 3438 | ASSERT(db->db_level == parent->db_level-1); |
e49f1e20 WA |
3439 | /* |
3440 | * We're about to modify our parent's db_data by modifying | |
3441 | * our block pointer, so the parent must be released. | |
3442 | */ | |
428870ff BB |
3443 | ASSERT(arc_released(parent->db_buf)); |
3444 | zio = parent->db_data_pending->dr_zio; | |
3445 | } else { | |
e49f1e20 | 3446 | /* Our parent is the dnode itself. */ |
428870ff BB |
3447 | ASSERT((db->db_level == dn->dn_phys->dn_nlevels-1 && |
3448 | db->db_blkid != DMU_SPILL_BLKID) || | |
3449 | (db->db_blkid == DMU_SPILL_BLKID && db->db_level == 0)); | |
3450 | if (db->db_blkid != DMU_SPILL_BLKID) | |
3451 | ASSERT3P(db->db_blkptr, ==, | |
3452 | &dn->dn_phys->dn_blkptr[db->db_blkid]); | |
3453 | zio = dn->dn_zio; | |
3454 | } | |
3455 | ||
3456 | ASSERT(db->db_level == 0 || data == db->db_buf); | |
3457 | ASSERT3U(db->db_blkptr->blk_birth, <=, txg); | |
3458 | ASSERT(zio); | |
3459 | ||
3460 | SET_BOOKMARK(&zb, os->os_dsl_dataset ? | |
3461 | os->os_dsl_dataset->ds_object : DMU_META_OBJSET, | |
3462 | db->db.db_object, db->db_level, db->db_blkid); | |
3463 | ||
3464 | if (db->db_blkid == DMU_SPILL_BLKID) | |
3465 | wp_flag = WP_SPILL; | |
3466 | wp_flag |= (db->db_state == DB_NOFILL) ? WP_NOFILL : 0; | |
3467 | ||
3468 | dmu_write_policy(os, dn, db->db_level, wp_flag, &zp); | |
572e2857 | 3469 | DB_DNODE_EXIT(db); |
428870ff | 3470 | |
463a8cfe AR |
3471 | /* |
3472 | * We copy the blkptr now (rather than when we instantiate the dirty | |
3473 | * record), because its value can change between open context and | |
3474 | * syncing context. We do not need to hold dn_struct_rwlock to read | |
3475 | * db_blkptr because we are in syncing context. | |
3476 | */ | |
3477 | dr->dr_bp_copy = *db->db_blkptr; | |
3478 | ||
9b67f605 MA |
3479 | if (db->db_level == 0 && |
3480 | dr->dt.dl.dr_override_state == DR_OVERRIDDEN) { | |
3481 | /* | |
3482 | * The BP for this block has been provided by open context | |
3483 | * (by dmu_sync() or dmu_buf_write_embedded()). | |
3484 | */ | |
3485 | void *contents = (data != NULL) ? data->b_data : NULL; | |
3486 | ||
428870ff | 3487 | dr->dr_zio = zio_write(zio, os->os_spa, txg, |
463a8cfe | 3488 | &dr->dr_bp_copy, contents, db->db.db_size, &zp, |
bc77ba73 PD |
3489 | dbuf_write_override_ready, NULL, NULL, |
3490 | dbuf_write_override_done, | |
e8b96c60 | 3491 | dr, ZIO_PRIORITY_ASYNC_WRITE, ZIO_FLAG_MUSTSUCCEED, &zb); |
428870ff BB |
3492 | mutex_enter(&db->db_mtx); |
3493 | dr->dt.dl.dr_override_state = DR_NOT_OVERRIDDEN; | |
3494 | zio_write_override(dr->dr_zio, &dr->dt.dl.dr_overridden_by, | |
03c6040b | 3495 | dr->dt.dl.dr_copies, dr->dt.dl.dr_nopwrite); |
428870ff BB |
3496 | mutex_exit(&db->db_mtx); |
3497 | } else if (db->db_state == DB_NOFILL) { | |
3498 | ASSERT(zp.zp_checksum == ZIO_CHECKSUM_OFF); | |
3499 | dr->dr_zio = zio_write(zio, os->os_spa, txg, | |
463a8cfe | 3500 | &dr->dr_bp_copy, NULL, db->db.db_size, &zp, |
bc77ba73 PD |
3501 | dbuf_write_nofill_ready, NULL, NULL, |
3502 | dbuf_write_nofill_done, db, | |
428870ff BB |
3503 | ZIO_PRIORITY_ASYNC_WRITE, |
3504 | ZIO_FLAG_MUSTSUCCEED | ZIO_FLAG_NODATA, &zb); | |
3505 | } else { | |
bc77ba73 | 3506 | arc_done_func_t *children_ready_cb = NULL; |
428870ff | 3507 | ASSERT(arc_released(data)); |
bc77ba73 PD |
3508 | |
3509 | /* | |
3510 | * For indirect blocks, we want to setup the children | |
3511 | * ready callback so that we can properly handle an indirect | |
3512 | * block that only contains holes. | |
3513 | */ | |
3514 | if (db->db_level != 0) | |
3515 | children_ready_cb = dbuf_write_children_ready; | |
3516 | ||
428870ff | 3517 | dr->dr_zio = arc_write(zio, os->os_spa, txg, |
463a8cfe | 3518 | &dr->dr_bp_copy, data, DBUF_IS_L2CACHEABLE(db), |
3a17a7a9 | 3519 | DBUF_IS_L2COMPRESSIBLE(db), &zp, dbuf_write_ready, |
bc77ba73 | 3520 | children_ready_cb, |
e8b96c60 MA |
3521 | dbuf_write_physdone, dbuf_write_done, db, |
3522 | ZIO_PRIORITY_ASYNC_WRITE, ZIO_FLAG_MUSTSUCCEED, &zb); | |
428870ff | 3523 | } |
34dc7c2f | 3524 | } |
c28b2279 BB |
3525 | |
3526 | #if defined(_KERNEL) && defined(HAVE_SPL) | |
8f576c23 BB |
3527 | EXPORT_SYMBOL(dbuf_find); |
3528 | EXPORT_SYMBOL(dbuf_is_metadata); | |
3529 | EXPORT_SYMBOL(dbuf_evict); | |
3530 | EXPORT_SYMBOL(dbuf_loan_arcbuf); | |
3531 | EXPORT_SYMBOL(dbuf_whichblock); | |
3532 | EXPORT_SYMBOL(dbuf_read); | |
3533 | EXPORT_SYMBOL(dbuf_unoverride); | |
3534 | EXPORT_SYMBOL(dbuf_free_range); | |
3535 | EXPORT_SYMBOL(dbuf_new_size); | |
3536 | EXPORT_SYMBOL(dbuf_release_bp); | |
3537 | EXPORT_SYMBOL(dbuf_dirty); | |
c28b2279 | 3538 | EXPORT_SYMBOL(dmu_buf_will_dirty); |
8f576c23 BB |
3539 | EXPORT_SYMBOL(dmu_buf_will_not_fill); |
3540 | EXPORT_SYMBOL(dmu_buf_will_fill); | |
3541 | EXPORT_SYMBOL(dmu_buf_fill_done); | |
4047414a | 3542 | EXPORT_SYMBOL(dmu_buf_rele); |
8f576c23 BB |
3543 | EXPORT_SYMBOL(dbuf_assign_arcbuf); |
3544 | EXPORT_SYMBOL(dbuf_clear); | |
3545 | EXPORT_SYMBOL(dbuf_prefetch); | |
3546 | EXPORT_SYMBOL(dbuf_hold_impl); | |
3547 | EXPORT_SYMBOL(dbuf_hold); | |
3548 | EXPORT_SYMBOL(dbuf_hold_level); | |
3549 | EXPORT_SYMBOL(dbuf_create_bonus); | |
3550 | EXPORT_SYMBOL(dbuf_spill_set_blksz); | |
3551 | EXPORT_SYMBOL(dbuf_rm_spill); | |
3552 | EXPORT_SYMBOL(dbuf_add_ref); | |
3553 | EXPORT_SYMBOL(dbuf_rele); | |
3554 | EXPORT_SYMBOL(dbuf_rele_and_unlock); | |
3555 | EXPORT_SYMBOL(dbuf_refcount); | |
3556 | EXPORT_SYMBOL(dbuf_sync_list); | |
3557 | EXPORT_SYMBOL(dmu_buf_set_user); | |
3558 | EXPORT_SYMBOL(dmu_buf_set_user_ie); | |
8f576c23 BB |
3559 | EXPORT_SYMBOL(dmu_buf_get_user); |
3560 | EXPORT_SYMBOL(dmu_buf_freeable); | |
0f699108 | 3561 | EXPORT_SYMBOL(dmu_buf_get_blkptr); |
c28b2279 | 3562 | #endif |