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 /* 22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved. 23 * Copyright (c) 2012 by Delphix. All rights reserved. 24 */ 25 26 #include <sys/dmu.h> 27 #include <sys/dmu_objset.h> 28 #include <sys/dmu_tx.h> 29 #include <sys/dsl_dataset.h> 30 #include <sys/dsl_dir.h> 31 #include <sys/dsl_prop.h> 32 #include <sys/dsl_synctask.h> 33 #include <sys/dsl_deleg.h> 34 #include <sys/spa.h> 35 #include <sys/metaslab.h> 36 #include <sys/zap.h> 37 #include <sys/zio.h> 38 #include <sys/arc.h> 39 #include <sys/sunddi.h> 40 #include "zfs_namecheck.h" 41 42 static uint64_t dsl_dir_space_towrite(dsl_dir_t *dd); 43 static void dsl_dir_set_reservation_sync_impl(dsl_dir_t *dd, 44 uint64_t value, dmu_tx_t *tx); 45 46 /* ARGSUSED */ 47 static void 48 dsl_dir_evict(dmu_buf_t *db, void *arg) 49 { 50 dsl_dir_t *dd = arg; 51 dsl_pool_t *dp = dd->dd_pool; 52 int t; 53 54 for (t = 0; t < TXG_SIZE; t++) { 55 ASSERT(!txg_list_member(&dp->dp_dirty_dirs, dd, t)); 56 ASSERT(dd->dd_tempreserved[t] == 0); 57 ASSERT(dd->dd_space_towrite[t] == 0); 58 } 59 60 if (dd->dd_parent) 61 dsl_dir_close(dd->dd_parent, dd); 62 63 spa_close(dd->dd_pool->dp_spa, dd); 64 65 /* 66 * The props callback list should have been cleaned up by 67 * objset_evict(). 68 */ 69 list_destroy(&dd->dd_prop_cbs); 70 mutex_destroy(&dd->dd_lock); 71 kmem_free(dd, sizeof (dsl_dir_t)); 72 } 73 74 int 75 dsl_dir_open_obj(dsl_pool_t *dp, uint64_t ddobj, 76 const char *tail, void *tag, dsl_dir_t **ddp) 77 { 78 dmu_buf_t *dbuf; 79 dsl_dir_t *dd; 80 int err; 81 82 ASSERT(RW_LOCK_HELD(&dp->dp_config_rwlock) || 83 dsl_pool_sync_context(dp)); 84 85 err = dmu_bonus_hold(dp->dp_meta_objset, ddobj, tag, &dbuf); 86 if (err) 87 return (err); 88 dd = dmu_buf_get_user(dbuf); 89 #ifdef ZFS_DEBUG 90 { 91 dmu_object_info_t doi; 92 dmu_object_info_from_db(dbuf, &doi); 93 ASSERT3U(doi.doi_type, ==, DMU_OT_DSL_DIR); 94 ASSERT3U(doi.doi_bonus_size, >=, sizeof (dsl_dir_phys_t)); 95 } 96 #endif 97 if (dd == NULL) { 98 dsl_dir_t *winner; 99 100 dd = kmem_zalloc(sizeof (dsl_dir_t), KM_SLEEP); 101 dd->dd_object = ddobj; 102 dd->dd_dbuf = dbuf; 103 dd->dd_pool = dp; 104 dd->dd_phys = dbuf->db_data; 105 mutex_init(&dd->dd_lock, NULL, MUTEX_DEFAULT, NULL); 106 107 list_create(&dd->dd_prop_cbs, sizeof (dsl_prop_cb_record_t), 108 offsetof(dsl_prop_cb_record_t, cbr_node)); 109 110 dsl_dir_snap_cmtime_update(dd); 111 112 if (dd->dd_phys->dd_parent_obj) { 113 err = dsl_dir_open_obj(dp, dd->dd_phys->dd_parent_obj, 114 NULL, dd, &dd->dd_parent); 115 if (err) 116 goto errout; 117 if (tail) { 118 #ifdef ZFS_DEBUG 119 uint64_t foundobj; 120 121 err = zap_lookup(dp->dp_meta_objset, 122 dd->dd_parent->dd_phys->dd_child_dir_zapobj, 123 tail, sizeof (foundobj), 1, &foundobj); 124 ASSERT(err || foundobj == ddobj); 125 #endif 126 (void) strcpy(dd->dd_myname, tail); 127 } else { 128 err = zap_value_search(dp->dp_meta_objset, 129 dd->dd_parent->dd_phys->dd_child_dir_zapobj, 130 ddobj, 0, dd->dd_myname); 131 } 132 if (err) 133 goto errout; 134 } else { 135 (void) strcpy(dd->dd_myname, spa_name(dp->dp_spa)); 136 } 137 138 if (dsl_dir_is_clone(dd)) { 139 dmu_buf_t *origin_bonus; 140 dsl_dataset_phys_t *origin_phys; 141 142 /* 143 * We can't open the origin dataset, because 144 * that would require opening this dsl_dir. 145 * Just look at its phys directly instead. 146 */ 147 err = dmu_bonus_hold(dp->dp_meta_objset, 148 dd->dd_phys->dd_origin_obj, FTAG, &origin_bonus); 149 if (err) 150 goto errout; 151 origin_phys = origin_bonus->db_data; 152 dd->dd_origin_txg = 153 origin_phys->ds_creation_txg; 154 dmu_buf_rele(origin_bonus, FTAG); 155 } 156 157 winner = dmu_buf_set_user_ie(dbuf, dd, &dd->dd_phys, 158 dsl_dir_evict); 159 if (winner) { 160 if (dd->dd_parent) 161 dsl_dir_close(dd->dd_parent, dd); 162 mutex_destroy(&dd->dd_lock); 163 kmem_free(dd, sizeof (dsl_dir_t)); 164 dd = winner; 165 } else { 166 spa_open_ref(dp->dp_spa, dd); 167 } 168 } 169 170 /* 171 * The dsl_dir_t has both open-to-close and instantiate-to-evict 172 * holds on the spa. We need the open-to-close holds because 173 * otherwise the spa_refcnt wouldn't change when we open a 174 * dir which the spa also has open, so we could incorrectly 175 * think it was OK to unload/export/destroy the pool. We need 176 * the instantiate-to-evict hold because the dsl_dir_t has a 177 * pointer to the dd_pool, which has a pointer to the spa_t. 178 */ 179 spa_open_ref(dp->dp_spa, tag); 180 ASSERT3P(dd->dd_pool, ==, dp); 181 ASSERT3U(dd->dd_object, ==, ddobj); 182 ASSERT3P(dd->dd_dbuf, ==, dbuf); 183 *ddp = dd; 184 return (0); 185 186 errout: 187 if (dd->dd_parent) 188 dsl_dir_close(dd->dd_parent, dd); 189 mutex_destroy(&dd->dd_lock); 190 kmem_free(dd, sizeof (dsl_dir_t)); 191 dmu_buf_rele(dbuf, tag); 192 return (err); 193 } 194 195 void 196 dsl_dir_close(dsl_dir_t *dd, void *tag) 197 { 198 dprintf_dd(dd, "%s\n", ""); 199 spa_close(dd->dd_pool->dp_spa, tag); 200 dmu_buf_rele(dd->dd_dbuf, tag); 201 } 202 203 /* buf must be long enough (MAXNAMELEN + strlen(MOS_DIR_NAME) + 1 should do) */ 204 void 205 dsl_dir_name(dsl_dir_t *dd, char *buf) 206 { 207 if (dd->dd_parent) { 208 dsl_dir_name(dd->dd_parent, buf); 209 (void) strcat(buf, "/"); 210 } else { 211 buf[0] = '\0'; 212 } 213 if (!MUTEX_HELD(&dd->dd_lock)) { 214 /* 215 * recursive mutex so that we can use 216 * dprintf_dd() with dd_lock held 217 */ 218 mutex_enter(&dd->dd_lock); 219 (void) strcat(buf, dd->dd_myname); 220 mutex_exit(&dd->dd_lock); 221 } else { 222 (void) strcat(buf, dd->dd_myname); 223 } 224 } 225 226 /* Calculate name length, avoiding all the strcat calls of dsl_dir_name */ 227 int 228 dsl_dir_namelen(dsl_dir_t *dd) 229 { 230 int result = 0; 231 232 if (dd->dd_parent) { 233 /* parent's name + 1 for the "/" */ 234 result = dsl_dir_namelen(dd->dd_parent) + 1; 235 } 236 237 if (!MUTEX_HELD(&dd->dd_lock)) { 238 /* see dsl_dir_name */ 239 mutex_enter(&dd->dd_lock); 240 result += strlen(dd->dd_myname); 241 mutex_exit(&dd->dd_lock); 242 } else { 243 result += strlen(dd->dd_myname); 244 } 245 246 return (result); 247 } 248 249 static int 250 getcomponent(const char *path, char *component, const char **nextp) 251 { 252 char *p; 253 if ((path == NULL) || (path[0] == '\0')) 254 return (ENOENT); 255 /* This would be a good place to reserve some namespace... */ 256 p = strpbrk(path, "/@"); 257 if (p && (p[1] == '/' || p[1] == '@')) { 258 /* two separators in a row */ 259 return (EINVAL); 260 } 261 if (p == NULL || p == path) { 262 /* 263 * if the first thing is an @ or /, it had better be an 264 * @ and it had better not have any more ats or slashes, 265 * and it had better have something after the @. 266 */ 267 if (p != NULL && 268 (p[0] != '@' || strpbrk(path+1, "/@") || p[1] == '\0')) 269 return (EINVAL); 270 if (strlen(path) >= MAXNAMELEN) 271 return (ENAMETOOLONG); 272 (void) strcpy(component, path); 273 p = NULL; 274 } else if (p[0] == '/') { 275 if (p-path >= MAXNAMELEN) 276 return (ENAMETOOLONG); 277 (void) strncpy(component, path, p - path); 278 component[p-path] = '\0'; 279 p++; 280 } else if (p[0] == '@') { 281 /* 282 * if the next separator is an @, there better not be 283 * any more slashes. 284 */ 285 if (strchr(path, '/')) 286 return (EINVAL); 287 if (p-path >= MAXNAMELEN) 288 return (ENAMETOOLONG); 289 (void) strncpy(component, path, p - path); 290 component[p-path] = '\0'; 291 } else { 292 ASSERT(!"invalid p"); 293 } 294 *nextp = p; 295 return (0); 296 } 297 298 /* 299 * same as dsl_open_dir, ignore the first component of name and use the 300 * spa instead 301 */ 302 int 303 dsl_dir_open_spa(spa_t *spa, const char *name, void *tag, 304 dsl_dir_t **ddp, const char **tailp) 305 { 306 char buf[MAXNAMELEN]; 307 const char *next, *nextnext = NULL; 308 int err; 309 dsl_dir_t *dd; 310 dsl_pool_t *dp; 311 uint64_t ddobj; 312 int openedspa = FALSE; 313 314 dprintf("%s\n", name); 315 316 err = getcomponent(name, buf, &next); 317 if (err) 318 return (err); 319 if (spa == NULL) { 320 err = spa_open(buf, &spa, FTAG); 321 if (err) { 322 dprintf("spa_open(%s) failed\n", buf); 323 return (err); 324 } 325 openedspa = TRUE; 326 327 /* XXX this assertion belongs in spa_open */ 328 ASSERT(!dsl_pool_sync_context(spa_get_dsl(spa))); 329 } 330 331 dp = spa_get_dsl(spa); 332 333 rw_enter(&dp->dp_config_rwlock, RW_READER); 334 err = dsl_dir_open_obj(dp, dp->dp_root_dir_obj, NULL, tag, &dd); 335 if (err) { 336 rw_exit(&dp->dp_config_rwlock); 337 if (openedspa) 338 spa_close(spa, FTAG); 339 return (err); 340 } 341 342 while (next != NULL) { 343 dsl_dir_t *child_ds; 344 err = getcomponent(next, buf, &nextnext); 345 if (err) 346 break; 347 ASSERT(next[0] != '\0'); 348 if (next[0] == '@') 349 break; 350 dprintf("looking up %s in obj%lld\n", 351 buf, dd->dd_phys->dd_child_dir_zapobj); 352 353 err = zap_lookup(dp->dp_meta_objset, 354 dd->dd_phys->dd_child_dir_zapobj, 355 buf, sizeof (ddobj), 1, &ddobj); 356 if (err) { 357 if (err == ENOENT) 358 err = 0; 359 break; 360 } 361 362 err = dsl_dir_open_obj(dp, ddobj, buf, tag, &child_ds); 363 if (err) 364 break; 365 dsl_dir_close(dd, tag); 366 dd = child_ds; 367 next = nextnext; 368 } 369 rw_exit(&dp->dp_config_rwlock); 370 371 if (err) { 372 dsl_dir_close(dd, tag); 373 if (openedspa) 374 spa_close(spa, FTAG); 375 return (err); 376 } 377 378 /* 379 * It's an error if there's more than one component left, or 380 * tailp==NULL and there's any component left. 381 */ 382 if (next != NULL && 383 (tailp == NULL || (nextnext && nextnext[0] != '\0'))) { 384 /* bad path name */ 385 dsl_dir_close(dd, tag); 386 dprintf("next=%p (%s) tail=%p\n", next, next?next:"", tailp); 387 err = ENOENT; 388 } 389 if (tailp) 390 *tailp = next; 391 if (openedspa) 392 spa_close(spa, FTAG); 393 *ddp = dd; 394 return (err); 395 } 396 397 /* 398 * Return the dsl_dir_t, and possibly the last component which couldn't 399 * be found in *tail. Return NULL if the path is bogus, or if 400 * tail==NULL and we couldn't parse the whole name. (*tail)[0] == '@' 401 * means that the last component is a snapshot. 402 */ 403 int 404 dsl_dir_open(const char *name, void *tag, dsl_dir_t **ddp, const char **tailp) 405 { 406 return (dsl_dir_open_spa(NULL, name, tag, ddp, tailp)); 407 } 408 409 uint64_t 410 dsl_dir_create_sync(dsl_pool_t *dp, dsl_dir_t *pds, const char *name, 411 dmu_tx_t *tx) 412 { 413 objset_t *mos = dp->dp_meta_objset; 414 uint64_t ddobj; 415 dsl_dir_phys_t *ddphys; 416 dmu_buf_t *dbuf; 417 418 ddobj = dmu_object_alloc(mos, DMU_OT_DSL_DIR, 0, 419 DMU_OT_DSL_DIR, sizeof (dsl_dir_phys_t), tx); 420 if (pds) { 421 VERIFY(0 == zap_add(mos, pds->dd_phys->dd_child_dir_zapobj, 422 name, sizeof (uint64_t), 1, &ddobj, tx)); 423 } else { 424 /* it's the root dir */ 425 VERIFY(0 == zap_add(mos, DMU_POOL_DIRECTORY_OBJECT, 426 DMU_POOL_ROOT_DATASET, sizeof (uint64_t), 1, &ddobj, tx)); 427 } 428 VERIFY(0 == dmu_bonus_hold(mos, ddobj, FTAG, &dbuf)); 429 dmu_buf_will_dirty(dbuf, tx); 430 ddphys = dbuf->db_data; 431 432 ddphys->dd_creation_time = gethrestime_sec(); 433 if (pds) 434 ddphys->dd_parent_obj = pds->dd_object; 435 ddphys->dd_props_zapobj = zap_create(mos, 436 DMU_OT_DSL_PROPS, DMU_OT_NONE, 0, tx); 437 ddphys->dd_child_dir_zapobj = zap_create(mos, 438 DMU_OT_DSL_DIR_CHILD_MAP, DMU_OT_NONE, 0, tx); 439 if (spa_version(dp->dp_spa) >= SPA_VERSION_USED_BREAKDOWN) 440 ddphys->dd_flags |= DD_FLAG_USED_BREAKDOWN; 441 dmu_buf_rele(dbuf, FTAG); 442 443 return (ddobj); 444 } 445 446 /* ARGSUSED */ 447 int 448 dsl_dir_destroy_check(void *arg1, void *arg2, dmu_tx_t *tx) 449 { 450 dsl_dir_t *dd = arg1; 451 dsl_pool_t *dp = dd->dd_pool; 452 objset_t *mos = dp->dp_meta_objset; 453 int err; 454 uint64_t count; 455 456 /* 457 * There should be exactly two holds, both from 458 * dsl_dataset_destroy: one on the dd directory, and one on its 459 * head ds. Otherwise, someone is trying to lookup something 460 * inside this dir while we want to destroy it. The 461 * config_rwlock ensures that nobody else opens it after we 462 * check. 463 */ 464 if (dmu_buf_refcount(dd->dd_dbuf) > 2) 465 return (EBUSY); 466 467 err = zap_count(mos, dd->dd_phys->dd_child_dir_zapobj, &count); 468 if (err) 469 return (err); 470 if (count != 0) 471 return (EEXIST); 472 473 return (0); 474 } 475 476 void 477 dsl_dir_destroy_sync(void *arg1, void *tag, dmu_tx_t *tx) 478 { 479 dsl_dir_t *dd = arg1; 480 objset_t *mos = dd->dd_pool->dp_meta_objset; 481 uint64_t obj; 482 dd_used_t t; 483 484 ASSERT(RW_WRITE_HELD(&dd->dd_pool->dp_config_rwlock)); 485 ASSERT(dd->dd_phys->dd_head_dataset_obj == 0); 486 487 /* 488 * Remove our reservation. The impl() routine avoids setting the 489 * actual property, which would require the (already destroyed) ds. 490 */ 491 dsl_dir_set_reservation_sync_impl(dd, 0, tx); 492 493 ASSERT3U(dd->dd_phys->dd_used_bytes, ==, 0); 494 ASSERT3U(dd->dd_phys->dd_reserved, ==, 0); 495 for (t = 0; t < DD_USED_NUM; t++) 496 ASSERT3U(dd->dd_phys->dd_used_breakdown[t], ==, 0); 497 498 VERIFY(0 == zap_destroy(mos, dd->dd_phys->dd_child_dir_zapobj, tx)); 499 VERIFY(0 == zap_destroy(mos, dd->dd_phys->dd_props_zapobj, tx)); 500 VERIFY(0 == dsl_deleg_destroy(mos, dd->dd_phys->dd_deleg_zapobj, tx)); 501 VERIFY(0 == zap_remove(mos, 502 dd->dd_parent->dd_phys->dd_child_dir_zapobj, dd->dd_myname, tx)); 503 504 obj = dd->dd_object; 505 dsl_dir_close(dd, tag); 506 VERIFY(0 == dmu_object_free(mos, obj, tx)); 507 } 508 509 boolean_t 510 dsl_dir_is_clone(dsl_dir_t *dd) 511 { 512 return (dd->dd_phys->dd_origin_obj && 513 (dd->dd_pool->dp_origin_snap == NULL || 514 dd->dd_phys->dd_origin_obj != 515 dd->dd_pool->dp_origin_snap->ds_object)); 516 } 517 518 void 519 dsl_dir_stats(dsl_dir_t *dd, nvlist_t *nv) 520 { 521 mutex_enter(&dd->dd_lock); 522 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_USED, 523 dd->dd_phys->dd_used_bytes); 524 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_QUOTA, dd->dd_phys->dd_quota); 525 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_RESERVATION, 526 dd->dd_phys->dd_reserved); 527 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_COMPRESSRATIO, 528 dd->dd_phys->dd_compressed_bytes == 0 ? 100 : 529 (dd->dd_phys->dd_uncompressed_bytes * 100 / 530 dd->dd_phys->dd_compressed_bytes)); 531 if (dd->dd_phys->dd_flags & DD_FLAG_USED_BREAKDOWN) { 532 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_USEDSNAP, 533 dd->dd_phys->dd_used_breakdown[DD_USED_SNAP]); 534 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_USEDDS, 535 dd->dd_phys->dd_used_breakdown[DD_USED_HEAD]); 536 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_USEDREFRESERV, 537 dd->dd_phys->dd_used_breakdown[DD_USED_REFRSRV]); 538 dsl_prop_nvlist_add_uint64(nv, ZFS_PROP_USEDCHILD, 539 dd->dd_phys->dd_used_breakdown[DD_USED_CHILD] + 540 dd->dd_phys->dd_used_breakdown[DD_USED_CHILD_RSRV]); 541 } 542 mutex_exit(&dd->dd_lock); 543 544 rw_enter(&dd->dd_pool->dp_config_rwlock, RW_READER); 545 if (dsl_dir_is_clone(dd)) { 546 dsl_dataset_t *ds; 547 char buf[MAXNAMELEN]; 548 549 VERIFY(0 == dsl_dataset_hold_obj(dd->dd_pool, 550 dd->dd_phys->dd_origin_obj, FTAG, &ds)); 551 dsl_dataset_name(ds, buf); 552 dsl_dataset_rele(ds, FTAG); 553 dsl_prop_nvlist_add_string(nv, ZFS_PROP_ORIGIN, buf); 554 } 555 rw_exit(&dd->dd_pool->dp_config_rwlock); 556 } 557 558 void 559 dsl_dir_dirty(dsl_dir_t *dd, dmu_tx_t *tx) 560 { 561 dsl_pool_t *dp = dd->dd_pool; 562 563 ASSERT(dd->dd_phys); 564 565 if (txg_list_add(&dp->dp_dirty_dirs, dd, tx->tx_txg) == 0) { 566 /* up the hold count until we can be written out */ 567 dmu_buf_add_ref(dd->dd_dbuf, dd); 568 } 569 } 570 571 static int64_t 572 parent_delta(dsl_dir_t *dd, uint64_t used, int64_t delta) 573 { 574 uint64_t old_accounted = MAX(used, dd->dd_phys->dd_reserved); 575 uint64_t new_accounted = MAX(used + delta, dd->dd_phys->dd_reserved); 576 return (new_accounted - old_accounted); 577 } 578 579 void 580 dsl_dir_sync(dsl_dir_t *dd, dmu_tx_t *tx) 581 { 582 ASSERT(dmu_tx_is_syncing(tx)); 583 584 mutex_enter(&dd->dd_lock); 585 ASSERT3U(dd->dd_tempreserved[tx->tx_txg&TXG_MASK], ==, 0); 586 dprintf_dd(dd, "txg=%llu towrite=%lluK\n", tx->tx_txg, 587 dd->dd_space_towrite[tx->tx_txg&TXG_MASK] / 1024); 588 dd->dd_space_towrite[tx->tx_txg&TXG_MASK] = 0; 589 mutex_exit(&dd->dd_lock); 590 591 /* release the hold from dsl_dir_dirty */ 592 dmu_buf_rele(dd->dd_dbuf, dd); 593 } 594 595 static uint64_t 596 dsl_dir_space_towrite(dsl_dir_t *dd) 597 { 598 uint64_t space = 0; 599 int i; 600 601 ASSERT(MUTEX_HELD(&dd->dd_lock)); 602 603 for (i = 0; i < TXG_SIZE; i++) { 604 space += dd->dd_space_towrite[i&TXG_MASK]; 605 ASSERT3U(dd->dd_space_towrite[i&TXG_MASK], >=, 0); 606 } 607 return (space); 608 } 609 610 /* 611 * How much space would dd have available if ancestor had delta applied 612 * to it? If ondiskonly is set, we're only interested in what's 613 * on-disk, not estimated pending changes. 614 */ 615 uint64_t 616 dsl_dir_space_available(dsl_dir_t *dd, 617 dsl_dir_t *ancestor, int64_t delta, int ondiskonly) 618 { 619 uint64_t parentspace, myspace, quota, used; 620 621 /* 622 * If there are no restrictions otherwise, assume we have 623 * unlimited space available. 624 */ 625 quota = UINT64_MAX; 626 parentspace = UINT64_MAX; 627 628 if (dd->dd_parent != NULL) { 629 parentspace = dsl_dir_space_available(dd->dd_parent, 630 ancestor, delta, ondiskonly); 631 } 632 633 mutex_enter(&dd->dd_lock); 634 if (dd->dd_phys->dd_quota != 0) 635 quota = dd->dd_phys->dd_quota; 636 used = dd->dd_phys->dd_used_bytes; 637 if (!ondiskonly) 638 used += dsl_dir_space_towrite(dd); 639 640 if (dd->dd_parent == NULL) { 641 uint64_t poolsize = dsl_pool_adjustedsize(dd->dd_pool, FALSE); 642 quota = MIN(quota, poolsize); 643 } 644 645 if (dd->dd_phys->dd_reserved > used && parentspace != UINT64_MAX) { 646 /* 647 * We have some space reserved, in addition to what our 648 * parent gave us. 649 */ 650 parentspace += dd->dd_phys->dd_reserved - used; 651 } 652 653 if (dd == ancestor) { 654 ASSERT(delta <= 0); 655 ASSERT(used >= -delta); 656 used += delta; 657 if (parentspace != UINT64_MAX) 658 parentspace -= delta; 659 } 660 661 if (used > quota) { 662 /* over quota */ 663 myspace = 0; 664 } else { 665 /* 666 * the lesser of the space provided by our parent and 667 * the space left in our quota 668 */ 669 myspace = MIN(parentspace, quota - used); 670 } 671 672 mutex_exit(&dd->dd_lock); 673 674 return (myspace); 675 } 676 677 struct tempreserve { 678 list_node_t tr_node; 679 dsl_pool_t *tr_dp; 680 dsl_dir_t *tr_ds; 681 uint64_t tr_size; 682 }; 683 684 static int 685 dsl_dir_tempreserve_impl(dsl_dir_t *dd, uint64_t asize, boolean_t netfree, 686 boolean_t ignorequota, boolean_t checkrefquota, list_t *tr_list, 687 dmu_tx_t *tx, boolean_t first) 688 { 689 uint64_t txg = tx->tx_txg; 690 uint64_t est_inflight, used_on_disk, quota, parent_rsrv; 691 uint64_t deferred = 0; 692 struct tempreserve *tr; 693 int retval = EDQUOT; 694 int txgidx = txg & TXG_MASK; 695 int i; 696 uint64_t ref_rsrv = 0; 697 698 ASSERT3U(txg, !=, 0); 699 ASSERT3S(asize, >, 0); 700 701 mutex_enter(&dd->dd_lock); 702 703 /* 704 * Check against the dsl_dir's quota. We don't add in the delta 705 * when checking for over-quota because they get one free hit. 706 */ 707 est_inflight = dsl_dir_space_towrite(dd); 708 for (i = 0; i < TXG_SIZE; i++) 709 est_inflight += dd->dd_tempreserved[i]; 710 used_on_disk = dd->dd_phys->dd_used_bytes; 711 712 /* 713 * On the first iteration, fetch the dataset's used-on-disk and 714 * refreservation values. Also, if checkrefquota is set, test if 715 * allocating this space would exceed the dataset's refquota. 716 */ 717 if (first && tx->tx_objset) { 718 int error; 719 dsl_dataset_t *ds = tx->tx_objset->os_dsl_dataset; 720 721 error = dsl_dataset_check_quota(ds, checkrefquota, 722 asize, est_inflight, &used_on_disk, &ref_rsrv); 723 if (error) { 724 mutex_exit(&dd->dd_lock); 725 return (error); 726 } 727 } 728 729 /* 730 * If this transaction will result in a net free of space, 731 * we want to let it through. 732 */ 733 if (ignorequota || netfree || dd->dd_phys->dd_quota == 0) 734 quota = UINT64_MAX; 735 else 736 quota = dd->dd_phys->dd_quota; 737 738 /* 739 * Adjust the quota against the actual pool size at the root 740 * minus any outstanding deferred frees. 741 * To ensure that it's possible to remove files from a full 742 * pool without inducing transient overcommits, we throttle 743 * netfree transactions against a quota that is slightly larger, 744 * but still within the pool's allocation slop. In cases where 745 * we're very close to full, this will allow a steady trickle of 746 * removes to get through. 747 */ 748 if (dd->dd_parent == NULL) { 749 spa_t *spa = dd->dd_pool->dp_spa; 750 uint64_t poolsize = dsl_pool_adjustedsize(dd->dd_pool, netfree); 751 deferred = metaslab_class_get_deferred(spa_normal_class(spa)); 752 if (poolsize - deferred < quota) { 753 quota = poolsize - deferred; 754 retval = ENOSPC; 755 } 756 } 757 758 /* 759 * If they are requesting more space, and our current estimate 760 * is over quota, they get to try again unless the actual 761 * on-disk is over quota and there are no pending changes (which 762 * may free up space for us). 763 */ 764 if (used_on_disk + est_inflight >= quota) { 765 if (est_inflight > 0 || used_on_disk < quota || 766 (retval == ENOSPC && used_on_disk < quota + deferred)) 767 retval = ERESTART; 768 dprintf_dd(dd, "failing: used=%lluK inflight = %lluK " 769 "quota=%lluK tr=%lluK err=%d\n", 770 used_on_disk>>10, est_inflight>>10, 771 quota>>10, asize>>10, retval); 772 mutex_exit(&dd->dd_lock); 773 return (retval); 774 } 775 776 /* We need to up our estimated delta before dropping dd_lock */ 777 dd->dd_tempreserved[txgidx] += asize; 778 779 parent_rsrv = parent_delta(dd, used_on_disk + est_inflight, 780 asize - ref_rsrv); 781 mutex_exit(&dd->dd_lock); 782 783 tr = kmem_zalloc(sizeof (struct tempreserve), KM_SLEEP); 784 tr->tr_ds = dd; 785 tr->tr_size = asize; 786 list_insert_tail(tr_list, tr); 787 788 /* see if it's OK with our parent */ 789 if (dd->dd_parent && parent_rsrv) { 790 boolean_t ismos = (dd->dd_phys->dd_head_dataset_obj == 0); 791 792 return (dsl_dir_tempreserve_impl(dd->dd_parent, 793 parent_rsrv, netfree, ismos, TRUE, tr_list, tx, FALSE)); 794 } else { 795 return (0); 796 } 797 } 798 799 /* 800 * Reserve space in this dsl_dir, to be used in this tx's txg. 801 * After the space has been dirtied (and dsl_dir_willuse_space() 802 * has been called), the reservation should be canceled, using 803 * dsl_dir_tempreserve_clear(). 804 */ 805 int 806 dsl_dir_tempreserve_space(dsl_dir_t *dd, uint64_t lsize, uint64_t asize, 807 uint64_t fsize, uint64_t usize, void **tr_cookiep, dmu_tx_t *tx) 808 { 809 int err; 810 list_t *tr_list; 811 812 if (asize == 0) { 813 *tr_cookiep = NULL; 814 return (0); 815 } 816 817 tr_list = kmem_alloc(sizeof (list_t), KM_SLEEP); 818 list_create(tr_list, sizeof (struct tempreserve), 819 offsetof(struct tempreserve, tr_node)); 820 ASSERT3S(asize, >, 0); 821 ASSERT3S(fsize, >=, 0); 822 823 err = arc_tempreserve_space(lsize, tx->tx_txg); 824 if (err == 0) { 825 struct tempreserve *tr; 826 827 tr = kmem_zalloc(sizeof (struct tempreserve), KM_SLEEP); 828 tr->tr_size = lsize; 829 list_insert_tail(tr_list, tr); 830 831 err = dsl_pool_tempreserve_space(dd->dd_pool, asize, tx); 832 } else { 833 if (err == EAGAIN) { 834 txg_delay(dd->dd_pool, tx->tx_txg, 1); 835 err = ERESTART; 836 } 837 dsl_pool_memory_pressure(dd->dd_pool); 838 } 839 840 if (err == 0) { 841 struct tempreserve *tr; 842 843 tr = kmem_zalloc(sizeof (struct tempreserve), KM_SLEEP); 844 tr->tr_dp = dd->dd_pool; 845 tr->tr_size = asize; 846 list_insert_tail(tr_list, tr); 847 848 err = dsl_dir_tempreserve_impl(dd, asize, fsize >= asize, 849 FALSE, asize > usize, tr_list, tx, TRUE); 850 } 851 852 if (err) 853 dsl_dir_tempreserve_clear(tr_list, tx); 854 else 855 *tr_cookiep = tr_list; 856 857 return (err); 858 } 859 860 /* 861 * Clear a temporary reservation that we previously made with 862 * dsl_dir_tempreserve_space(). 863 */ 864 void 865 dsl_dir_tempreserve_clear(void *tr_cookie, dmu_tx_t *tx) 866 { 867 int txgidx = tx->tx_txg & TXG_MASK; 868 list_t *tr_list = tr_cookie; 869 struct tempreserve *tr; 870 871 ASSERT3U(tx->tx_txg, !=, 0); 872 873 if (tr_cookie == NULL) 874 return; 875 876 while (tr = list_head(tr_list)) { 877 if (tr->tr_dp) { 878 dsl_pool_tempreserve_clear(tr->tr_dp, tr->tr_size, tx); 879 } else if (tr->tr_ds) { 880 mutex_enter(&tr->tr_ds->dd_lock); 881 ASSERT3U(tr->tr_ds->dd_tempreserved[txgidx], >=, 882 tr->tr_size); 883 tr->tr_ds->dd_tempreserved[txgidx] -= tr->tr_size; 884 mutex_exit(&tr->tr_ds->dd_lock); 885 } else { 886 arc_tempreserve_clear(tr->tr_size); 887 } 888 list_remove(tr_list, tr); 889 kmem_free(tr, sizeof (struct tempreserve)); 890 } 891 892 kmem_free(tr_list, sizeof (list_t)); 893 } 894 895 static void 896 dsl_dir_willuse_space_impl(dsl_dir_t *dd, int64_t space, dmu_tx_t *tx) 897 { 898 int64_t parent_space; 899 uint64_t est_used; 900 901 mutex_enter(&dd->dd_lock); 902 if (space > 0) 903 dd->dd_space_towrite[tx->tx_txg & TXG_MASK] += space; 904 905 est_used = dsl_dir_space_towrite(dd) + dd->dd_phys->dd_used_bytes; 906 parent_space = parent_delta(dd, est_used, space); 907 mutex_exit(&dd->dd_lock); 908 909 /* Make sure that we clean up dd_space_to* */ 910 dsl_dir_dirty(dd, tx); 911 912 /* XXX this is potentially expensive and unnecessary... */ 913 if (parent_space && dd->dd_parent) 914 dsl_dir_willuse_space_impl(dd->dd_parent, parent_space, tx); 915 } 916 917 /* 918 * Call in open context when we think we're going to write/free space, 919 * eg. when dirtying data. Be conservative (ie. OK to write less than 920 * this or free more than this, but don't write more or free less). 921 */ 922 void 923 dsl_dir_willuse_space(dsl_dir_t *dd, int64_t space, dmu_tx_t *tx) 924 { 925 dsl_pool_willuse_space(dd->dd_pool, space, tx); 926 dsl_dir_willuse_space_impl(dd, space, tx); 927 } 928 929 /* call from syncing context when we actually write/free space for this dd */ 930 void 931 dsl_dir_diduse_space(dsl_dir_t *dd, dd_used_t type, 932 int64_t used, int64_t compressed, int64_t uncompressed, dmu_tx_t *tx) 933 { 934 int64_t accounted_delta; 935 boolean_t needlock = !MUTEX_HELD(&dd->dd_lock); 936 937 ASSERT(dmu_tx_is_syncing(tx)); 938 ASSERT(type < DD_USED_NUM); 939 940 if (needlock) 941 mutex_enter(&dd->dd_lock); 942 accounted_delta = parent_delta(dd, dd->dd_phys->dd_used_bytes, used); 943 ASSERT(used >= 0 || dd->dd_phys->dd_used_bytes >= -used); 944 ASSERT(compressed >= 0 || 945 dd->dd_phys->dd_compressed_bytes >= -compressed); 946 ASSERT(uncompressed >= 0 || 947 dd->dd_phys->dd_uncompressed_bytes >= -uncompressed); 948 dmu_buf_will_dirty(dd->dd_dbuf, tx); 949 dd->dd_phys->dd_used_bytes += used; 950 dd->dd_phys->dd_uncompressed_bytes += uncompressed; 951 dd->dd_phys->dd_compressed_bytes += compressed; 952 953 if (dd->dd_phys->dd_flags & DD_FLAG_USED_BREAKDOWN) { 954 ASSERT(used > 0 || 955 dd->dd_phys->dd_used_breakdown[type] >= -used); 956 dd->dd_phys->dd_used_breakdown[type] += used; 957 #ifdef DEBUG 958 dd_used_t t; 959 uint64_t u = 0; 960 for (t = 0; t < DD_USED_NUM; t++) 961 u += dd->dd_phys->dd_used_breakdown[t]; 962 ASSERT3U(u, ==, dd->dd_phys->dd_used_bytes); 963 #endif 964 } 965 if (needlock) 966 mutex_exit(&dd->dd_lock); 967 968 if (dd->dd_parent != NULL) { 969 dsl_dir_diduse_space(dd->dd_parent, DD_USED_CHILD, 970 accounted_delta, compressed, uncompressed, tx); 971 dsl_dir_transfer_space(dd->dd_parent, 972 used - accounted_delta, 973 DD_USED_CHILD_RSRV, DD_USED_CHILD, tx); 974 } 975 } 976 977 void 978 dsl_dir_transfer_space(dsl_dir_t *dd, int64_t delta, 979 dd_used_t oldtype, dd_used_t newtype, dmu_tx_t *tx) 980 { 981 boolean_t needlock = !MUTEX_HELD(&dd->dd_lock); 982 983 ASSERT(dmu_tx_is_syncing(tx)); 984 ASSERT(oldtype < DD_USED_NUM); 985 ASSERT(newtype < DD_USED_NUM); 986 987 if (delta == 0 || !(dd->dd_phys->dd_flags & DD_FLAG_USED_BREAKDOWN)) 988 return; 989 990 if (needlock) 991 mutex_enter(&dd->dd_lock); 992 ASSERT(delta > 0 ? 993 dd->dd_phys->dd_used_breakdown[oldtype] >= delta : 994 dd->dd_phys->dd_used_breakdown[newtype] >= -delta); 995 ASSERT(dd->dd_phys->dd_used_bytes >= ABS(delta)); 996 dmu_buf_will_dirty(dd->dd_dbuf, tx); 997 dd->dd_phys->dd_used_breakdown[oldtype] -= delta; 998 dd->dd_phys->dd_used_breakdown[newtype] += delta; 999 if (needlock) 1000 mutex_exit(&dd->dd_lock); 1001 } 1002 1003 static int 1004 dsl_dir_set_quota_check(void *arg1, void *arg2, dmu_tx_t *tx) 1005 { 1006 dsl_dataset_t *ds = arg1; 1007 dsl_dir_t *dd = ds->ds_dir; 1008 dsl_prop_setarg_t *psa = arg2; 1009 int err; 1010 uint64_t towrite; 1011 1012 if ((err = dsl_prop_predict_sync(ds->ds_dir, psa)) != 0) 1013 return (err); 1014 1015 if (psa->psa_effective_value == 0) 1016 return (0); 1017 1018 mutex_enter(&dd->dd_lock); 1019 /* 1020 * If we are doing the preliminary check in open context, and 1021 * there are pending changes, then don't fail it, since the 1022 * pending changes could under-estimate the amount of space to be 1023 * freed up. 1024 */ 1025 towrite = dsl_dir_space_towrite(dd); 1026 if ((dmu_tx_is_syncing(tx) || towrite == 0) && 1027 (psa->psa_effective_value < dd->dd_phys->dd_reserved || 1028 psa->psa_effective_value < dd->dd_phys->dd_used_bytes + towrite)) { 1029 err = ENOSPC; 1030 } 1031 mutex_exit(&dd->dd_lock); 1032 return (err); 1033 } 1034 1035 extern dsl_syncfunc_t dsl_prop_set_sync; 1036 1037 static void 1038 dsl_dir_set_quota_sync(void *arg1, void *arg2, dmu_tx_t *tx) 1039 { 1040 dsl_dataset_t *ds = arg1; 1041 dsl_dir_t *dd = ds->ds_dir; 1042 dsl_prop_setarg_t *psa = arg2; 1043 uint64_t effective_value = psa->psa_effective_value; 1044 1045 dsl_prop_set_sync(ds, psa, tx); 1046 DSL_PROP_CHECK_PREDICTION(dd, psa); 1047 1048 dmu_buf_will_dirty(dd->dd_dbuf, tx); 1049 1050 mutex_enter(&dd->dd_lock); 1051 dd->dd_phys->dd_quota = effective_value; 1052 mutex_exit(&dd->dd_lock); 1053 } 1054 1055 int 1056 dsl_dir_set_quota(const char *ddname, zprop_source_t source, uint64_t quota) 1057 { 1058 dsl_dir_t *dd; 1059 dsl_dataset_t *ds; 1060 dsl_prop_setarg_t psa; 1061 int err; 1062 1063 dsl_prop_setarg_init_uint64(&psa, "quota", source, "a); 1064 1065 err = dsl_dataset_hold(ddname, FTAG, &ds); 1066 if (err) 1067 return (err); 1068 1069 err = dsl_dir_open(ddname, FTAG, &dd, NULL); 1070 if (err) { 1071 dsl_dataset_rele(ds, FTAG); 1072 return (err); 1073 } 1074 1075 ASSERT(ds->ds_dir == dd); 1076 1077 /* 1078 * If someone removes a file, then tries to set the quota, we want to 1079 * make sure the file freeing takes effect. 1080 */ 1081 txg_wait_open(dd->dd_pool, 0); 1082 1083 err = dsl_sync_task_do(dd->dd_pool, dsl_dir_set_quota_check, 1084 dsl_dir_set_quota_sync, ds, &psa, 0); 1085 1086 dsl_dir_close(dd, FTAG); 1087 dsl_dataset_rele(ds, FTAG); 1088 return (err); 1089 } 1090 1091 int 1092 dsl_dir_set_reservation_check(void *arg1, void *arg2, dmu_tx_t *tx) 1093 { 1094 dsl_dataset_t *ds = arg1; 1095 dsl_dir_t *dd = ds->ds_dir; 1096 dsl_prop_setarg_t *psa = arg2; 1097 uint64_t effective_value; 1098 uint64_t used, avail; 1099 int err; 1100 1101 if ((err = dsl_prop_predict_sync(ds->ds_dir, psa)) != 0) 1102 return (err); 1103 1104 effective_value = psa->psa_effective_value; 1105 1106 /* 1107 * If we are doing the preliminary check in open context, the 1108 * space estimates may be inaccurate. 1109 */ 1110 if (!dmu_tx_is_syncing(tx)) 1111 return (0); 1112 1113 mutex_enter(&dd->dd_lock); 1114 used = dd->dd_phys->dd_used_bytes; 1115 mutex_exit(&dd->dd_lock); 1116 1117 if (dd->dd_parent) { 1118 avail = dsl_dir_space_available(dd->dd_parent, 1119 NULL, 0, FALSE); 1120 } else { 1121 avail = dsl_pool_adjustedsize(dd->dd_pool, B_FALSE) - used; 1122 } 1123 1124 if (MAX(used, effective_value) > MAX(used, dd->dd_phys->dd_reserved)) { 1125 uint64_t delta = MAX(used, effective_value) - 1126 MAX(used, dd->dd_phys->dd_reserved); 1127 1128 if (delta > avail) 1129 return (ENOSPC); 1130 if (dd->dd_phys->dd_quota > 0 && 1131 effective_value > dd->dd_phys->dd_quota) 1132 return (ENOSPC); 1133 } 1134 1135 return (0); 1136 } 1137 1138 static void 1139 dsl_dir_set_reservation_sync_impl(dsl_dir_t *dd, uint64_t value, dmu_tx_t *tx) 1140 { 1141 uint64_t used; 1142 int64_t delta; 1143 1144 dmu_buf_will_dirty(dd->dd_dbuf, tx); 1145 1146 mutex_enter(&dd->dd_lock); 1147 used = dd->dd_phys->dd_used_bytes; 1148 delta = MAX(used, value) - MAX(used, dd->dd_phys->dd_reserved); 1149 dd->dd_phys->dd_reserved = value; 1150 1151 if (dd->dd_parent != NULL) { 1152 /* Roll up this additional usage into our ancestors */ 1153 dsl_dir_diduse_space(dd->dd_parent, DD_USED_CHILD_RSRV, 1154 delta, 0, 0, tx); 1155 } 1156 mutex_exit(&dd->dd_lock); 1157 } 1158 1159 1160 static void 1161 dsl_dir_set_reservation_sync(void *arg1, void *arg2, dmu_tx_t *tx) 1162 { 1163 dsl_dataset_t *ds = arg1; 1164 dsl_dir_t *dd = ds->ds_dir; 1165 dsl_prop_setarg_t *psa = arg2; 1166 uint64_t value = psa->psa_effective_value; 1167 1168 dsl_prop_set_sync(ds, psa, tx); 1169 DSL_PROP_CHECK_PREDICTION(dd, psa); 1170 1171 dsl_dir_set_reservation_sync_impl(dd, value, tx); 1172 } 1173 1174 int 1175 dsl_dir_set_reservation(const char *ddname, zprop_source_t source, 1176 uint64_t reservation) 1177 { 1178 dsl_dir_t *dd; 1179 dsl_dataset_t *ds; 1180 dsl_prop_setarg_t psa; 1181 int err; 1182 1183 dsl_prop_setarg_init_uint64(&psa, "reservation", source, &reservation); 1184 1185 err = dsl_dataset_hold(ddname, FTAG, &ds); 1186 if (err) 1187 return (err); 1188 1189 err = dsl_dir_open(ddname, FTAG, &dd, NULL); 1190 if (err) { 1191 dsl_dataset_rele(ds, FTAG); 1192 return (err); 1193 } 1194 1195 ASSERT(ds->ds_dir == dd); 1196 1197 err = dsl_sync_task_do(dd->dd_pool, dsl_dir_set_reservation_check, 1198 dsl_dir_set_reservation_sync, ds, &psa, 0); 1199 1200 dsl_dir_close(dd, FTAG); 1201 dsl_dataset_rele(ds, FTAG); 1202 return (err); 1203 } 1204 1205 static dsl_dir_t * 1206 closest_common_ancestor(dsl_dir_t *ds1, dsl_dir_t *ds2) 1207 { 1208 for (; ds1; ds1 = ds1->dd_parent) { 1209 dsl_dir_t *dd; 1210 for (dd = ds2; dd; dd = dd->dd_parent) { 1211 if (ds1 == dd) 1212 return (dd); 1213 } 1214 } 1215 return (NULL); 1216 } 1217 1218 /* 1219 * If delta is applied to dd, how much of that delta would be applied to 1220 * ancestor? Syncing context only. 1221 */ 1222 static int64_t 1223 would_change(dsl_dir_t *dd, int64_t delta, dsl_dir_t *ancestor) 1224 { 1225 if (dd == ancestor) 1226 return (delta); 1227 1228 mutex_enter(&dd->dd_lock); 1229 delta = parent_delta(dd, dd->dd_phys->dd_used_bytes, delta); 1230 mutex_exit(&dd->dd_lock); 1231 return (would_change(dd->dd_parent, delta, ancestor)); 1232 } 1233 1234 struct renamearg { 1235 dsl_dir_t *newparent; 1236 const char *mynewname; 1237 }; 1238 1239 static int 1240 dsl_dir_rename_check(void *arg1, void *arg2, dmu_tx_t *tx) 1241 { 1242 dsl_dir_t *dd = arg1; 1243 struct renamearg *ra = arg2; 1244 dsl_pool_t *dp = dd->dd_pool; 1245 objset_t *mos = dp->dp_meta_objset; 1246 int err; 1247 uint64_t val; 1248 1249 /* 1250 * There should only be one reference, from dmu_objset_rename(). 1251 * Fleeting holds are also possible (eg, from "zfs list" getting 1252 * stats), but any that are present in open context will likely 1253 * be gone by syncing context, so only fail from syncing 1254 * context. 1255 */ 1256 if (dmu_tx_is_syncing(tx) && dmu_buf_refcount(dd->dd_dbuf) > 1) 1257 return (EBUSY); 1258 1259 /* check for existing name */ 1260 err = zap_lookup(mos, ra->newparent->dd_phys->dd_child_dir_zapobj, 1261 ra->mynewname, 8, 1, &val); 1262 if (err == 0) 1263 return (EEXIST); 1264 if (err != ENOENT) 1265 return (err); 1266 1267 if (ra->newparent != dd->dd_parent) { 1268 /* is there enough space? */ 1269 uint64_t myspace = 1270 MAX(dd->dd_phys->dd_used_bytes, dd->dd_phys->dd_reserved); 1271 1272 /* no rename into our descendant */ 1273 if (closest_common_ancestor(dd, ra->newparent) == dd) 1274 return (EINVAL); 1275 1276 if (err = dsl_dir_transfer_possible(dd->dd_parent, 1277 ra->newparent, myspace)) 1278 return (err); 1279 } 1280 1281 return (0); 1282 } 1283 1284 static void 1285 dsl_dir_rename_sync(void *arg1, void *arg2, dmu_tx_t *tx) 1286 { 1287 dsl_dir_t *dd = arg1; 1288 struct renamearg *ra = arg2; 1289 dsl_pool_t *dp = dd->dd_pool; 1290 objset_t *mos = dp->dp_meta_objset; 1291 int err; 1292 char namebuf[MAXNAMELEN]; 1293 1294 ASSERT(dmu_buf_refcount(dd->dd_dbuf) <= 2); 1295 1296 /* Log this before we change the name. */ 1297 dsl_dir_name(ra->newparent, namebuf); 1298 spa_history_log_internal_dd(dd, "rename", tx, 1299 "-> %s/%s", namebuf, ra->mynewname); 1300 1301 if (ra->newparent != dd->dd_parent) { 1302 dsl_dir_diduse_space(dd->dd_parent, DD_USED_CHILD, 1303 -dd->dd_phys->dd_used_bytes, 1304 -dd->dd_phys->dd_compressed_bytes, 1305 -dd->dd_phys->dd_uncompressed_bytes, tx); 1306 dsl_dir_diduse_space(ra->newparent, DD_USED_CHILD, 1307 dd->dd_phys->dd_used_bytes, 1308 dd->dd_phys->dd_compressed_bytes, 1309 dd->dd_phys->dd_uncompressed_bytes, tx); 1310 1311 if (dd->dd_phys->dd_reserved > dd->dd_phys->dd_used_bytes) { 1312 uint64_t unused_rsrv = dd->dd_phys->dd_reserved - 1313 dd->dd_phys->dd_used_bytes; 1314 1315 dsl_dir_diduse_space(dd->dd_parent, DD_USED_CHILD_RSRV, 1316 -unused_rsrv, 0, 0, tx); 1317 dsl_dir_diduse_space(ra->newparent, DD_USED_CHILD_RSRV, 1318 unused_rsrv, 0, 0, tx); 1319 } 1320 } 1321 1322 dmu_buf_will_dirty(dd->dd_dbuf, tx); 1323 1324 /* remove from old parent zapobj */ 1325 err = zap_remove(mos, dd->dd_parent->dd_phys->dd_child_dir_zapobj, 1326 dd->dd_myname, tx); 1327 ASSERT3U(err, ==, 0); 1328 1329 (void) strcpy(dd->dd_myname, ra->mynewname); 1330 dsl_dir_close(dd->dd_parent, dd); 1331 dd->dd_phys->dd_parent_obj = ra->newparent->dd_object; 1332 VERIFY(0 == dsl_dir_open_obj(dd->dd_pool, 1333 ra->newparent->dd_object, NULL, dd, &dd->dd_parent)); 1334 1335 /* add to new parent zapobj */ 1336 err = zap_add(mos, ra->newparent->dd_phys->dd_child_dir_zapobj, 1337 dd->dd_myname, 8, 1, &dd->dd_object, tx); 1338 ASSERT3U(err, ==, 0); 1339 1340 } 1341 1342 int 1343 dsl_dir_rename(dsl_dir_t *dd, const char *newname) 1344 { 1345 struct renamearg ra; 1346 int err; 1347 1348 /* new parent should exist */ 1349 err = dsl_dir_open(newname, FTAG, &ra.newparent, &ra.mynewname); 1350 if (err) 1351 return (err); 1352 1353 /* can't rename to different pool */ 1354 if (dd->dd_pool != ra.newparent->dd_pool) { 1355 err = ENXIO; 1356 goto out; 1357 } 1358 1359 /* new name should not already exist */ 1360 if (ra.mynewname == NULL) { 1361 err = EEXIST; 1362 goto out; 1363 } 1364 1365 err = dsl_sync_task_do(dd->dd_pool, 1366 dsl_dir_rename_check, dsl_dir_rename_sync, dd, &ra, 3); 1367 1368 out: 1369 dsl_dir_close(ra.newparent, FTAG); 1370 return (err); 1371 } 1372 1373 int 1374 dsl_dir_transfer_possible(dsl_dir_t *sdd, dsl_dir_t *tdd, uint64_t space) 1375 { 1376 dsl_dir_t *ancestor; 1377 int64_t adelta; 1378 uint64_t avail; 1379 1380 ancestor = closest_common_ancestor(sdd, tdd); 1381 adelta = would_change(sdd, -space, ancestor); 1382 avail = dsl_dir_space_available(tdd, ancestor, adelta, FALSE); 1383 if (avail < space) 1384 return (ENOSPC); 1385 1386 return (0); 1387 } 1388 1389 timestruc_t 1390 dsl_dir_snap_cmtime(dsl_dir_t *dd) 1391 { 1392 timestruc_t t; 1393 1394 mutex_enter(&dd->dd_lock); 1395 t = dd->dd_snap_cmtime; 1396 mutex_exit(&dd->dd_lock); 1397 1398 return (t); 1399 } 1400 1401 void 1402 dsl_dir_snap_cmtime_update(dsl_dir_t *dd) 1403 { 1404 timestruc_t t; 1405 1406 gethrestime(&t); 1407 mutex_enter(&dd->dd_lock); 1408 dd->dd_snap_cmtime = t; 1409 mutex_exit(&dd->dd_lock); 1410 } 1411