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 /* 23 * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. 24 * Portions Copyright 2011 iXsystems, Inc 25 * Copyright (c) 2013 by Delphix. All rights reserved. 26 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved. 27 */ 28 29 #include <sys/zfs_context.h> 30 #include <sys/types.h> 31 #include <sys/param.h> 32 #include <sys/systm.h> 33 #include <sys/sysmacros.h> 34 #include <sys/dmu.h> 35 #include <sys/dmu_impl.h> 36 #include <sys/dmu_objset.h> 37 #include <sys/dbuf.h> 38 #include <sys/dnode.h> 39 #include <sys/zap.h> 40 #include <sys/sa.h> 41 #include <sys/sunddi.h> 42 #include <sys/sa_impl.h> 43 #include <sys/dnode.h> 44 #include <sys/errno.h> 45 #include <sys/zfs_context.h> 46 47 /* 48 * ZFS System attributes: 49 * 50 * A generic mechanism to allow for arbitrary attributes 51 * to be stored in a dnode. The data will be stored in the bonus buffer of 52 * the dnode and if necessary a special "spill" block will be used to handle 53 * overflow situations. The spill block will be sized to fit the data 54 * from 512 - 128K. When a spill block is used the BP (blkptr_t) for the 55 * spill block is stored at the end of the current bonus buffer. Any 56 * attributes that would be in the way of the blkptr_t will be relocated 57 * into the spill block. 58 * 59 * Attribute registration: 60 * 61 * Stored persistently on a per dataset basis 62 * a mapping between attribute "string" names and their actual attribute 63 * numeric values, length, and byteswap function. The names are only used 64 * during registration. All attributes are known by their unique attribute 65 * id value. If an attribute can have a variable size then the value 66 * 0 will be used to indicate this. 67 * 68 * Attribute Layout: 69 * 70 * Attribute layouts are a way to compactly store multiple attributes, but 71 * without taking the overhead associated with managing each attribute 72 * individually. Since you will typically have the same set of attributes 73 * stored in the same order a single table will be used to represent that 74 * layout. The ZPL for example will usually have only about 10 different 75 * layouts (regular files, device files, symlinks, 76 * regular files + scanstamp, files/dir with extended attributes, and then 77 * you have the possibility of all of those minus ACL, because it would 78 * be kicked out into the spill block) 79 * 80 * Layouts are simply an array of the attributes and their 81 * ordering i.e. [0, 1, 4, 5, 2] 82 * 83 * Each distinct layout is given a unique layout number and that is whats 84 * stored in the header at the beginning of the SA data buffer. 85 * 86 * A layout only covers a single dbuf (bonus or spill). If a set of 87 * attributes is split up between the bonus buffer and a spill buffer then 88 * two different layouts will be used. This allows us to byteswap the 89 * spill without looking at the bonus buffer and keeps the on disk format of 90 * the bonus and spill buffer the same. 91 * 92 * Adding a single attribute will cause the entire set of attributes to 93 * be rewritten and could result in a new layout number being constructed 94 * as part of the rewrite if no such layout exists for the new set of 95 * attribues. The new attribute will be appended to the end of the already 96 * existing attributes. 97 * 98 * Both the attribute registration and attribute layout information are 99 * stored in normal ZAP attributes. Their should be a small number of 100 * known layouts and the set of attributes is assumed to typically be quite 101 * small. 102 * 103 * The registered attributes and layout "table" information is maintained 104 * in core and a special "sa_os_t" is attached to the objset_t. 105 * 106 * A special interface is provided to allow for quickly applying 107 * a large set of attributes at once. sa_replace_all_by_template() is 108 * used to set an array of attributes. This is used by the ZPL when 109 * creating a brand new file. The template that is passed into the function 110 * specifies the attribute, size for variable length attributes, location of 111 * data and special "data locator" function if the data isn't in a contiguous 112 * location. 113 * 114 * Byteswap implications: 115 * 116 * Since the SA attributes are not entirely self describing we can't do 117 * the normal byteswap processing. The special ZAP layout attribute and 118 * attribute registration attributes define the byteswap function and the 119 * size of the attributes, unless it is variable sized. 120 * The normal ZFS byteswapping infrastructure assumes you don't need 121 * to read any objects in order to do the necessary byteswapping. Whereas 122 * SA attributes can only be properly byteswapped if the dataset is opened 123 * and the layout/attribute ZAP attributes are available. Because of this 124 * the SA attributes will be byteswapped when they are first accessed by 125 * the SA code that will read the SA data. 126 */ 127 128 typedef void (sa_iterfunc_t)(void *hdr, void *addr, sa_attr_type_t, 129 uint16_t length, int length_idx, boolean_t, void *userp); 130 131 static int sa_build_index(sa_handle_t *hdl, sa_buf_type_t buftype); 132 static void sa_idx_tab_hold(objset_t *os, sa_idx_tab_t *idx_tab); 133 static void *sa_find_idx_tab(objset_t *os, dmu_object_type_t bonustype, 134 void *data); 135 static void sa_idx_tab_rele(objset_t *os, void *arg); 136 static void sa_copy_data(sa_data_locator_t *func, void *start, void *target, 137 int buflen); 138 static int sa_modify_attrs(sa_handle_t *hdl, sa_attr_type_t newattr, 139 sa_data_op_t action, sa_data_locator_t *locator, void *datastart, 140 uint16_t buflen, dmu_tx_t *tx); 141 142 arc_byteswap_func_t *sa_bswap_table[] = { 143 byteswap_uint64_array, 144 byteswap_uint32_array, 145 byteswap_uint16_array, 146 byteswap_uint8_array, 147 zfs_acl_byteswap, 148 }; 149 150 #define SA_COPY_DATA(f, s, t, l) \ 151 { \ 152 if (f == NULL) { \ 153 if (l == 8) { \ 154 *(uint64_t *)t = *(uint64_t *)s; \ 155 } else if (l == 16) { \ 156 *(uint64_t *)t = *(uint64_t *)s; \ 157 *(uint64_t *)((uintptr_t)t + 8) = \ 158 *(uint64_t *)((uintptr_t)s + 8); \ 159 } else { \ 160 bcopy(s, t, l); \ 161 } \ 162 } else \ 163 sa_copy_data(f, s, t, l); \ 164 } 165 166 /* 167 * This table is fixed and cannot be changed. Its purpose is to 168 * allow the SA code to work with both old/new ZPL file systems. 169 * It contains the list of legacy attributes. These attributes aren't 170 * stored in the "attribute" registry zap objects, since older ZPL file systems 171 * won't have the registry. Only objsets of type ZFS_TYPE_FILESYSTEM will 172 * use this static table. 173 */ 174 sa_attr_reg_t sa_legacy_attrs[] = { 175 {"ZPL_ATIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 0}, 176 {"ZPL_MTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 1}, 177 {"ZPL_CTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 2}, 178 {"ZPL_CRTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 3}, 179 {"ZPL_GEN", sizeof (uint64_t), SA_UINT64_ARRAY, 4}, 180 {"ZPL_MODE", sizeof (uint64_t), SA_UINT64_ARRAY, 5}, 181 {"ZPL_SIZE", sizeof (uint64_t), SA_UINT64_ARRAY, 6}, 182 {"ZPL_PARENT", sizeof (uint64_t), SA_UINT64_ARRAY, 7}, 183 {"ZPL_LINKS", sizeof (uint64_t), SA_UINT64_ARRAY, 8}, 184 {"ZPL_XATTR", sizeof (uint64_t), SA_UINT64_ARRAY, 9}, 185 {"ZPL_RDEV", sizeof (uint64_t), SA_UINT64_ARRAY, 10}, 186 {"ZPL_FLAGS", sizeof (uint64_t), SA_UINT64_ARRAY, 11}, 187 {"ZPL_UID", sizeof (uint64_t), SA_UINT64_ARRAY, 12}, 188 {"ZPL_GID", sizeof (uint64_t), SA_UINT64_ARRAY, 13}, 189 {"ZPL_PAD", sizeof (uint64_t) * 4, SA_UINT64_ARRAY, 14}, 190 {"ZPL_ZNODE_ACL", 88, SA_UINT8_ARRAY, 15}, 191 }; 192 193 /* 194 * This is only used for objects of type DMU_OT_ZNODE 195 */ 196 sa_attr_type_t sa_legacy_zpl_layout[] = { 197 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 198 }; 199 200 /* 201 * Special dummy layout used for buffers with no attributes. 202 */ 203 sa_attr_type_t sa_dummy_zpl_layout[] = { 0 }; 204 205 static int sa_legacy_attr_count = 16; 206 static kmem_cache_t *sa_cache = NULL; 207 208 /*ARGSUSED*/ 209 static int 210 sa_cache_constructor(void *buf, void *unused, int kmflag) 211 { 212 sa_handle_t *hdl = buf; 213 214 mutex_init(&hdl->sa_lock, NULL, MUTEX_DEFAULT, NULL); 215 return (0); 216 } 217 218 /*ARGSUSED*/ 219 static void 220 sa_cache_destructor(void *buf, void *unused) 221 { 222 sa_handle_t *hdl = buf; 223 mutex_destroy(&hdl->sa_lock); 224 } 225 226 void 227 sa_cache_init(void) 228 { 229 sa_cache = kmem_cache_create("sa_cache", 230 sizeof (sa_handle_t), 0, sa_cache_constructor, 231 sa_cache_destructor, NULL, NULL, NULL, 0); 232 } 233 234 void 235 sa_cache_fini(void) 236 { 237 if (sa_cache) 238 kmem_cache_destroy(sa_cache); 239 } 240 241 static int 242 layout_num_compare(const void *arg1, const void *arg2) 243 { 244 const sa_lot_t *node1 = arg1; 245 const sa_lot_t *node2 = arg2; 246 247 if (node1->lot_num > node2->lot_num) 248 return (1); 249 else if (node1->lot_num < node2->lot_num) 250 return (-1); 251 return (0); 252 } 253 254 static int 255 layout_hash_compare(const void *arg1, const void *arg2) 256 { 257 const sa_lot_t *node1 = arg1; 258 const sa_lot_t *node2 = arg2; 259 260 if (node1->lot_hash > node2->lot_hash) 261 return (1); 262 if (node1->lot_hash < node2->lot_hash) 263 return (-1); 264 if (node1->lot_instance > node2->lot_instance) 265 return (1); 266 if (node1->lot_instance < node2->lot_instance) 267 return (-1); 268 return (0); 269 } 270 271 boolean_t 272 sa_layout_equal(sa_lot_t *tbf, sa_attr_type_t *attrs, int count) 273 { 274 int i; 275 276 if (count != tbf->lot_attr_count) 277 return (1); 278 279 for (i = 0; i != count; i++) { 280 if (attrs[i] != tbf->lot_attrs[i]) 281 return (1); 282 } 283 return (0); 284 } 285 286 #define SA_ATTR_HASH(attr) (zfs_crc64_table[(-1ULL ^ attr) & 0xFF]) 287 288 static uint64_t 289 sa_layout_info_hash(sa_attr_type_t *attrs, int attr_count) 290 { 291 int i; 292 uint64_t crc = -1ULL; 293 294 for (i = 0; i != attr_count; i++) 295 crc ^= SA_ATTR_HASH(attrs[i]); 296 297 return (crc); 298 } 299 300 static int 301 sa_get_spill(sa_handle_t *hdl) 302 { 303 int rc; 304 if (hdl->sa_spill == NULL) { 305 if ((rc = dmu_spill_hold_existing(hdl->sa_bonus, NULL, 306 &hdl->sa_spill)) == 0) 307 VERIFY(0 == sa_build_index(hdl, SA_SPILL)); 308 } else { 309 rc = 0; 310 } 311 312 return (rc); 313 } 314 315 /* 316 * Main attribute lookup/update function 317 * returns 0 for success or non zero for failures 318 * 319 * Operates on bulk array, first failure will abort further processing 320 */ 321 int 322 sa_attr_op(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count, 323 sa_data_op_t data_op, dmu_tx_t *tx) 324 { 325 sa_os_t *sa = hdl->sa_os->os_sa; 326 int i; 327 int error = 0; 328 sa_buf_type_t buftypes; 329 330 buftypes = 0; 331 332 ASSERT(count > 0); 333 for (i = 0; i != count; i++) { 334 ASSERT(bulk[i].sa_attr <= hdl->sa_os->os_sa->sa_num_attrs); 335 336 bulk[i].sa_addr = NULL; 337 /* First check the bonus buffer */ 338 339 if (hdl->sa_bonus_tab && TOC_ATTR_PRESENT( 340 hdl->sa_bonus_tab->sa_idx_tab[bulk[i].sa_attr])) { 341 SA_ATTR_INFO(sa, hdl->sa_bonus_tab, 342 SA_GET_HDR(hdl, SA_BONUS), 343 bulk[i].sa_attr, bulk[i], SA_BONUS, hdl); 344 if (tx && !(buftypes & SA_BONUS)) { 345 dmu_buf_will_dirty(hdl->sa_bonus, tx); 346 buftypes |= SA_BONUS; 347 } 348 } 349 if (bulk[i].sa_addr == NULL && 350 ((error = sa_get_spill(hdl)) == 0)) { 351 if (TOC_ATTR_PRESENT( 352 hdl->sa_spill_tab->sa_idx_tab[bulk[i].sa_attr])) { 353 SA_ATTR_INFO(sa, hdl->sa_spill_tab, 354 SA_GET_HDR(hdl, SA_SPILL), 355 bulk[i].sa_attr, bulk[i], SA_SPILL, hdl); 356 if (tx && !(buftypes & SA_SPILL) && 357 bulk[i].sa_size == bulk[i].sa_length) { 358 dmu_buf_will_dirty(hdl->sa_spill, tx); 359 buftypes |= SA_SPILL; 360 } 361 } 362 } 363 if (error && error != ENOENT) { 364 return ((error == ECKSUM) ? EIO : error); 365 } 366 367 switch (data_op) { 368 case SA_LOOKUP: 369 if (bulk[i].sa_addr == NULL) 370 return (SET_ERROR(ENOENT)); 371 if (bulk[i].sa_data) { 372 SA_COPY_DATA(bulk[i].sa_data_func, 373 bulk[i].sa_addr, bulk[i].sa_data, 374 bulk[i].sa_size); 375 } 376 continue; 377 378 case SA_UPDATE: 379 /* existing rewrite of attr */ 380 if (bulk[i].sa_addr && 381 bulk[i].sa_size == bulk[i].sa_length) { 382 SA_COPY_DATA(bulk[i].sa_data_func, 383 bulk[i].sa_data, bulk[i].sa_addr, 384 bulk[i].sa_length); 385 continue; 386 } else if (bulk[i].sa_addr) { /* attr size change */ 387 error = sa_modify_attrs(hdl, bulk[i].sa_attr, 388 SA_REPLACE, bulk[i].sa_data_func, 389 bulk[i].sa_data, bulk[i].sa_length, tx); 390 } else { /* adding new attribute */ 391 error = sa_modify_attrs(hdl, bulk[i].sa_attr, 392 SA_ADD, bulk[i].sa_data_func, 393 bulk[i].sa_data, bulk[i].sa_length, tx); 394 } 395 if (error) 396 return (error); 397 break; 398 } 399 } 400 return (error); 401 } 402 403 static sa_lot_t * 404 sa_add_layout_entry(objset_t *os, sa_attr_type_t *attrs, int attr_count, 405 uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx) 406 { 407 sa_os_t *sa = os->os_sa; 408 sa_lot_t *tb, *findtb; 409 int i; 410 avl_index_t loc; 411 412 ASSERT(MUTEX_HELD(&sa->sa_lock)); 413 tb = kmem_zalloc(sizeof (sa_lot_t), KM_SLEEP); 414 tb->lot_attr_count = attr_count; 415 tb->lot_attrs = kmem_alloc(sizeof (sa_attr_type_t) * attr_count, 416 KM_SLEEP); 417 bcopy(attrs, tb->lot_attrs, sizeof (sa_attr_type_t) * attr_count); 418 tb->lot_num = lot_num; 419 tb->lot_hash = hash; 420 tb->lot_instance = 0; 421 422 if (zapadd) { 423 char attr_name[8]; 424 425 if (sa->sa_layout_attr_obj == 0) { 426 sa->sa_layout_attr_obj = zap_create_link(os, 427 DMU_OT_SA_ATTR_LAYOUTS, 428 sa->sa_master_obj, SA_LAYOUTS, tx); 429 } 430 431 (void) snprintf(attr_name, sizeof (attr_name), 432 "%d", (int)lot_num); 433 VERIFY(0 == zap_update(os, os->os_sa->sa_layout_attr_obj, 434 attr_name, 2, attr_count, attrs, tx)); 435 } 436 437 list_create(&tb->lot_idx_tab, sizeof (sa_idx_tab_t), 438 offsetof(sa_idx_tab_t, sa_next)); 439 440 for (i = 0; i != attr_count; i++) { 441 if (sa->sa_attr_table[tb->lot_attrs[i]].sa_length == 0) 442 tb->lot_var_sizes++; 443 } 444 445 avl_add(&sa->sa_layout_num_tree, tb); 446 447 /* verify we don't have a hash collision */ 448 if ((findtb = avl_find(&sa->sa_layout_hash_tree, tb, &loc)) != NULL) { 449 for (; findtb && findtb->lot_hash == hash; 450 findtb = AVL_NEXT(&sa->sa_layout_hash_tree, findtb)) { 451 if (findtb->lot_instance != tb->lot_instance) 452 break; 453 tb->lot_instance++; 454 } 455 } 456 avl_add(&sa->sa_layout_hash_tree, tb); 457 return (tb); 458 } 459 460 static void 461 sa_find_layout(objset_t *os, uint64_t hash, sa_attr_type_t *attrs, 462 int count, dmu_tx_t *tx, sa_lot_t **lot) 463 { 464 sa_lot_t *tb, tbsearch; 465 avl_index_t loc; 466 sa_os_t *sa = os->os_sa; 467 boolean_t found = B_FALSE; 468 469 mutex_enter(&sa->sa_lock); 470 tbsearch.lot_hash = hash; 471 tbsearch.lot_instance = 0; 472 tb = avl_find(&sa->sa_layout_hash_tree, &tbsearch, &loc); 473 if (tb) { 474 for (; tb && tb->lot_hash == hash; 475 tb = AVL_NEXT(&sa->sa_layout_hash_tree, tb)) { 476 if (sa_layout_equal(tb, attrs, count) == 0) { 477 found = B_TRUE; 478 break; 479 } 480 } 481 } 482 if (!found) { 483 tb = sa_add_layout_entry(os, attrs, count, 484 avl_numnodes(&sa->sa_layout_num_tree), hash, B_TRUE, tx); 485 } 486 mutex_exit(&sa->sa_lock); 487 *lot = tb; 488 } 489 490 static int 491 sa_resize_spill(sa_handle_t *hdl, uint32_t size, dmu_tx_t *tx) 492 { 493 int error; 494 uint32_t blocksize; 495 496 if (size == 0) { 497 blocksize = SPA_MINBLOCKSIZE; 498 } else if (size > SPA_OLD_MAXBLOCKSIZE) { 499 ASSERT(0); 500 return (SET_ERROR(EFBIG)); 501 } else { 502 blocksize = P2ROUNDUP_TYPED(size, SPA_MINBLOCKSIZE, uint32_t); 503 } 504 505 error = dbuf_spill_set_blksz(hdl->sa_spill, blocksize, tx); 506 ASSERT(error == 0); 507 return (error); 508 } 509 510 static void 511 sa_copy_data(sa_data_locator_t *func, void *datastart, void *target, int buflen) 512 { 513 if (func == NULL) { 514 bcopy(datastart, target, buflen); 515 } else { 516 boolean_t start; 517 int bytes; 518 void *dataptr; 519 void *saptr = target; 520 uint32_t length; 521 522 start = B_TRUE; 523 bytes = 0; 524 while (bytes < buflen) { 525 func(&dataptr, &length, buflen, start, datastart); 526 bcopy(dataptr, saptr, length); 527 saptr = (void *)((caddr_t)saptr + length); 528 bytes += length; 529 start = B_FALSE; 530 } 531 } 532 } 533 534 /* 535 * Determine several different sizes 536 * first the sa header size 537 * the number of bytes to be stored 538 * if spill would occur the index in the attribute array is returned 539 * 540 * the boolean will_spill will be set when spilling is necessary. It 541 * is only set when the buftype is SA_BONUS 542 */ 543 static int 544 sa_find_sizes(sa_os_t *sa, sa_bulk_attr_t *attr_desc, int attr_count, 545 dmu_buf_t *db, sa_buf_type_t buftype, int *index, int *total, 546 boolean_t *will_spill) 547 { 548 int var_size = 0; 549 int i; 550 int j = -1; 551 int full_space; 552 int hdrsize; 553 boolean_t done = B_FALSE; 554 555 if (buftype == SA_BONUS && sa->sa_force_spill) { 556 *total = 0; 557 *index = 0; 558 *will_spill = B_TRUE; 559 return (0); 560 } 561 562 *index = -1; 563 *total = 0; 564 565 if (buftype == SA_BONUS) 566 *will_spill = B_FALSE; 567 568 hdrsize = (SA_BONUSTYPE_FROM_DB(db) == DMU_OT_ZNODE) ? 0 : 569 sizeof (sa_hdr_phys_t); 570 571 full_space = (buftype == SA_BONUS) ? DN_MAX_BONUSLEN : db->db_size; 572 ASSERT(IS_P2ALIGNED(full_space, 8)); 573 574 for (i = 0; i != attr_count; i++) { 575 boolean_t is_var_sz; 576 577 *total = P2ROUNDUP(*total, 8); 578 *total += attr_desc[i].sa_length; 579 if (done) 580 goto next; 581 582 is_var_sz = (SA_REGISTERED_LEN(sa, attr_desc[i].sa_attr) == 0); 583 if (is_var_sz) { 584 var_size++; 585 } 586 587 if (is_var_sz && var_size > 1) { 588 if (P2ROUNDUP(hdrsize + sizeof (uint16_t), 8) + 589 *total < full_space) { 590 /* 591 * Account for header space used by array of 592 * optional sizes of variable-length attributes. 593 * Record the index in case this increase needs 594 * to be reversed due to spill-over. 595 */ 596 hdrsize += sizeof (uint16_t); 597 j = i; 598 } else { 599 done = B_TRUE; 600 *index = i; 601 if (buftype == SA_BONUS) 602 *will_spill = B_TRUE; 603 continue; 604 } 605 } 606 607 /* 608 * find index of where spill *could* occur. 609 * Then continue to count of remainder attribute 610 * space. The sum is used later for sizing bonus 611 * and spill buffer. 612 */ 613 if (buftype == SA_BONUS && *index == -1 && 614 *total + P2ROUNDUP(hdrsize, 8) > 615 (full_space - sizeof (blkptr_t))) { 616 *index = i; 617 done = B_TRUE; 618 } 619 620 next: 621 if (*total + P2ROUNDUP(hdrsize, 8) > full_space && 622 buftype == SA_BONUS) 623 *will_spill = B_TRUE; 624 } 625 626 /* 627 * j holds the index of the last variable-sized attribute for 628 * which hdrsize was increased. Reverse the increase if that 629 * attribute will be relocated to the spill block. 630 */ 631 if (*will_spill && j == *index) 632 hdrsize -= sizeof (uint16_t); 633 634 hdrsize = P2ROUNDUP(hdrsize, 8); 635 return (hdrsize); 636 } 637 638 #define BUF_SPACE_NEEDED(total, header) (total + header) 639 640 /* 641 * Find layout that corresponds to ordering of attributes 642 * If not found a new layout number is created and added to 643 * persistent layout tables. 644 */ 645 static int 646 sa_build_layouts(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc, int attr_count, 647 dmu_tx_t *tx) 648 { 649 sa_os_t *sa = hdl->sa_os->os_sa; 650 uint64_t hash; 651 sa_buf_type_t buftype; 652 sa_hdr_phys_t *sahdr; 653 void *data_start; 654 int buf_space; 655 sa_attr_type_t *attrs, *attrs_start; 656 int i, lot_count; 657 int hdrsize; 658 int spillhdrsize = 0; 659 int used; 660 dmu_object_type_t bonustype; 661 sa_lot_t *lot; 662 int len_idx; 663 int spill_used; 664 boolean_t spilling; 665 666 dmu_buf_will_dirty(hdl->sa_bonus, tx); 667 bonustype = SA_BONUSTYPE_FROM_DB(hdl->sa_bonus); 668 669 /* first determine bonus header size and sum of all attributes */ 670 hdrsize = sa_find_sizes(sa, attr_desc, attr_count, hdl->sa_bonus, 671 SA_BONUS, &i, &used, &spilling); 672 673 if (used > SPA_OLD_MAXBLOCKSIZE) 674 return (SET_ERROR(EFBIG)); 675 676 VERIFY(0 == dmu_set_bonus(hdl->sa_bonus, spilling ? 677 MIN(DN_MAX_BONUSLEN - sizeof (blkptr_t), used + hdrsize) : 678 used + hdrsize, tx)); 679 680 ASSERT((bonustype == DMU_OT_ZNODE && spilling == 0) || 681 bonustype == DMU_OT_SA); 682 683 /* setup and size spill buffer when needed */ 684 if (spilling) { 685 boolean_t dummy; 686 687 if (hdl->sa_spill == NULL) { 688 VERIFY(dmu_spill_hold_by_bonus(hdl->sa_bonus, NULL, 689 &hdl->sa_spill) == 0); 690 } 691 dmu_buf_will_dirty(hdl->sa_spill, tx); 692 693 spillhdrsize = sa_find_sizes(sa, &attr_desc[i], 694 attr_count - i, hdl->sa_spill, SA_SPILL, &i, 695 &spill_used, &dummy); 696 697 if (spill_used > SPA_OLD_MAXBLOCKSIZE) 698 return (SET_ERROR(EFBIG)); 699 700 buf_space = hdl->sa_spill->db_size - spillhdrsize; 701 if (BUF_SPACE_NEEDED(spill_used, spillhdrsize) > 702 hdl->sa_spill->db_size) 703 VERIFY(0 == sa_resize_spill(hdl, 704 BUF_SPACE_NEEDED(spill_used, spillhdrsize), tx)); 705 } 706 707 /* setup starting pointers to lay down data */ 708 data_start = (void *)((uintptr_t)hdl->sa_bonus->db_data + hdrsize); 709 sahdr = (sa_hdr_phys_t *)hdl->sa_bonus->db_data; 710 buftype = SA_BONUS; 711 712 if (spilling) 713 buf_space = (sa->sa_force_spill) ? 714 0 : SA_BLKPTR_SPACE - hdrsize; 715 else 716 buf_space = hdl->sa_bonus->db_size - hdrsize; 717 718 attrs_start = attrs = kmem_alloc(sizeof (sa_attr_type_t) * attr_count, 719 KM_SLEEP); 720 lot_count = 0; 721 722 for (i = 0, len_idx = 0, hash = -1ULL; i != attr_count; i++) { 723 uint16_t length; 724 725 ASSERT(IS_P2ALIGNED(data_start, 8)); 726 ASSERT(IS_P2ALIGNED(buf_space, 8)); 727 attrs[i] = attr_desc[i].sa_attr; 728 length = SA_REGISTERED_LEN(sa, attrs[i]); 729 if (length == 0) 730 length = attr_desc[i].sa_length; 731 732 if (buf_space < length) { /* switch to spill buffer */ 733 VERIFY(spilling); 734 VERIFY(bonustype == DMU_OT_SA); 735 if (buftype == SA_BONUS && !sa->sa_force_spill) { 736 sa_find_layout(hdl->sa_os, hash, attrs_start, 737 lot_count, tx, &lot); 738 SA_SET_HDR(sahdr, lot->lot_num, hdrsize); 739 } 740 741 buftype = SA_SPILL; 742 hash = -1ULL; 743 len_idx = 0; 744 745 sahdr = (sa_hdr_phys_t *)hdl->sa_spill->db_data; 746 sahdr->sa_magic = SA_MAGIC; 747 data_start = (void *)((uintptr_t)sahdr + 748 spillhdrsize); 749 attrs_start = &attrs[i]; 750 buf_space = hdl->sa_spill->db_size - spillhdrsize; 751 lot_count = 0; 752 } 753 hash ^= SA_ATTR_HASH(attrs[i]); 754 attr_desc[i].sa_addr = data_start; 755 attr_desc[i].sa_size = length; 756 SA_COPY_DATA(attr_desc[i].sa_data_func, attr_desc[i].sa_data, 757 data_start, length); 758 if (sa->sa_attr_table[attrs[i]].sa_length == 0) { 759 sahdr->sa_lengths[len_idx++] = length; 760 } 761 data_start = (void *)P2ROUNDUP(((uintptr_t)data_start + 762 length), 8); 763 buf_space -= P2ROUNDUP(length, 8); 764 lot_count++; 765 } 766 767 sa_find_layout(hdl->sa_os, hash, attrs_start, lot_count, tx, &lot); 768 769 /* 770 * Verify that old znodes always have layout number 0. 771 * Must be DMU_OT_SA for arbitrary layouts 772 */ 773 VERIFY((bonustype == DMU_OT_ZNODE && lot->lot_num == 0) || 774 (bonustype == DMU_OT_SA && lot->lot_num > 1)); 775 776 if (bonustype == DMU_OT_SA) { 777 SA_SET_HDR(sahdr, lot->lot_num, 778 buftype == SA_BONUS ? hdrsize : spillhdrsize); 779 } 780 781 kmem_free(attrs, sizeof (sa_attr_type_t) * attr_count); 782 if (hdl->sa_bonus_tab) { 783 sa_idx_tab_rele(hdl->sa_os, hdl->sa_bonus_tab); 784 hdl->sa_bonus_tab = NULL; 785 } 786 if (!sa->sa_force_spill) 787 VERIFY(0 == sa_build_index(hdl, SA_BONUS)); 788 if (hdl->sa_spill) { 789 sa_idx_tab_rele(hdl->sa_os, hdl->sa_spill_tab); 790 if (!spilling) { 791 /* 792 * remove spill block that is no longer needed. 793 */ 794 dmu_buf_rele(hdl->sa_spill, NULL); 795 hdl->sa_spill = NULL; 796 hdl->sa_spill_tab = NULL; 797 VERIFY(0 == dmu_rm_spill(hdl->sa_os, 798 sa_handle_object(hdl), tx)); 799 } else { 800 VERIFY(0 == sa_build_index(hdl, SA_SPILL)); 801 } 802 } 803 804 return (0); 805 } 806 807 static void 808 sa_free_attr_table(sa_os_t *sa) 809 { 810 int i; 811 812 if (sa->sa_attr_table == NULL) 813 return; 814 815 for (i = 0; i != sa->sa_num_attrs; i++) { 816 if (sa->sa_attr_table[i].sa_name) 817 kmem_free(sa->sa_attr_table[i].sa_name, 818 strlen(sa->sa_attr_table[i].sa_name) + 1); 819 } 820 821 kmem_free(sa->sa_attr_table, 822 sizeof (sa_attr_table_t) * sa->sa_num_attrs); 823 824 sa->sa_attr_table = NULL; 825 } 826 827 static int 828 sa_attr_table_setup(objset_t *os, sa_attr_reg_t *reg_attrs, int count) 829 { 830 sa_os_t *sa = os->os_sa; 831 uint64_t sa_attr_count = 0; 832 uint64_t sa_reg_count = 0; 833 int error = 0; 834 uint64_t attr_value; 835 sa_attr_table_t *tb; 836 zap_cursor_t zc; 837 zap_attribute_t za; 838 int registered_count = 0; 839 int i; 840 dmu_objset_type_t ostype = dmu_objset_type(os); 841 842 sa->sa_user_table = 843 kmem_zalloc(count * sizeof (sa_attr_type_t), KM_SLEEP); 844 sa->sa_user_table_sz = count * sizeof (sa_attr_type_t); 845 846 if (sa->sa_reg_attr_obj != 0) { 847 error = zap_count(os, sa->sa_reg_attr_obj, 848 &sa_attr_count); 849 850 /* 851 * Make sure we retrieved a count and that it isn't zero 852 */ 853 if (error || (error == 0 && sa_attr_count == 0)) { 854 if (error == 0) 855 error = SET_ERROR(EINVAL); 856 goto bail; 857 } 858 sa_reg_count = sa_attr_count; 859 } 860 861 if (ostype == DMU_OST_ZFS && sa_attr_count == 0) 862 sa_attr_count += sa_legacy_attr_count; 863 864 /* Allocate attribute numbers for attributes that aren't registered */ 865 for (i = 0; i != count; i++) { 866 boolean_t found = B_FALSE; 867 int j; 868 869 if (ostype == DMU_OST_ZFS) { 870 for (j = 0; j != sa_legacy_attr_count; j++) { 871 if (strcmp(reg_attrs[i].sa_name, 872 sa_legacy_attrs[j].sa_name) == 0) { 873 sa->sa_user_table[i] = 874 sa_legacy_attrs[j].sa_attr; 875 found = B_TRUE; 876 } 877 } 878 } 879 if (found) 880 continue; 881 882 if (sa->sa_reg_attr_obj) 883 error = zap_lookup(os, sa->sa_reg_attr_obj, 884 reg_attrs[i].sa_name, 8, 1, &attr_value); 885 else 886 error = SET_ERROR(ENOENT); 887 switch (error) { 888 case ENOENT: 889 sa->sa_user_table[i] = (sa_attr_type_t)sa_attr_count; 890 sa_attr_count++; 891 break; 892 case 0: 893 sa->sa_user_table[i] = ATTR_NUM(attr_value); 894 break; 895 default: 896 goto bail; 897 } 898 } 899 900 sa->sa_num_attrs = sa_attr_count; 901 tb = sa->sa_attr_table = 902 kmem_zalloc(sizeof (sa_attr_table_t) * sa_attr_count, KM_SLEEP); 903 904 /* 905 * Attribute table is constructed from requested attribute list, 906 * previously foreign registered attributes, and also the legacy 907 * ZPL set of attributes. 908 */ 909 910 if (sa->sa_reg_attr_obj) { 911 for (zap_cursor_init(&zc, os, sa->sa_reg_attr_obj); 912 (error = zap_cursor_retrieve(&zc, &za)) == 0; 913 zap_cursor_advance(&zc)) { 914 uint64_t value; 915 value = za.za_first_integer; 916 917 registered_count++; 918 tb[ATTR_NUM(value)].sa_attr = ATTR_NUM(value); 919 tb[ATTR_NUM(value)].sa_length = ATTR_LENGTH(value); 920 tb[ATTR_NUM(value)].sa_byteswap = ATTR_BSWAP(value); 921 tb[ATTR_NUM(value)].sa_registered = B_TRUE; 922 923 if (tb[ATTR_NUM(value)].sa_name) { 924 continue; 925 } 926 tb[ATTR_NUM(value)].sa_name = 927 kmem_zalloc(strlen(za.za_name) +1, KM_SLEEP); 928 (void) strlcpy(tb[ATTR_NUM(value)].sa_name, za.za_name, 929 strlen(za.za_name) +1); 930 } 931 zap_cursor_fini(&zc); 932 /* 933 * Make sure we processed the correct number of registered 934 * attributes 935 */ 936 if (registered_count != sa_reg_count) { 937 ASSERT(error != 0); 938 goto bail; 939 } 940 941 } 942 943 if (ostype == DMU_OST_ZFS) { 944 for (i = 0; i != sa_legacy_attr_count; i++) { 945 if (tb[i].sa_name) 946 continue; 947 tb[i].sa_attr = sa_legacy_attrs[i].sa_attr; 948 tb[i].sa_length = sa_legacy_attrs[i].sa_length; 949 tb[i].sa_byteswap = sa_legacy_attrs[i].sa_byteswap; 950 tb[i].sa_registered = B_FALSE; 951 tb[i].sa_name = 952 kmem_zalloc(strlen(sa_legacy_attrs[i].sa_name) +1, 953 KM_SLEEP); 954 (void) strlcpy(tb[i].sa_name, 955 sa_legacy_attrs[i].sa_name, 956 strlen(sa_legacy_attrs[i].sa_name) + 1); 957 } 958 } 959 960 for (i = 0; i != count; i++) { 961 sa_attr_type_t attr_id; 962 963 attr_id = sa->sa_user_table[i]; 964 if (tb[attr_id].sa_name) 965 continue; 966 967 tb[attr_id].sa_length = reg_attrs[i].sa_length; 968 tb[attr_id].sa_byteswap = reg_attrs[i].sa_byteswap; 969 tb[attr_id].sa_attr = attr_id; 970 tb[attr_id].sa_name = 971 kmem_zalloc(strlen(reg_attrs[i].sa_name) + 1, KM_SLEEP); 972 (void) strlcpy(tb[attr_id].sa_name, reg_attrs[i].sa_name, 973 strlen(reg_attrs[i].sa_name) + 1); 974 } 975 976 sa->sa_need_attr_registration = 977 (sa_attr_count != registered_count); 978 979 return (0); 980 bail: 981 kmem_free(sa->sa_user_table, count * sizeof (sa_attr_type_t)); 982 sa->sa_user_table = NULL; 983 sa_free_attr_table(sa); 984 return ((error != 0) ? error : EINVAL); 985 } 986 987 int 988 sa_setup(objset_t *os, uint64_t sa_obj, sa_attr_reg_t *reg_attrs, int count, 989 sa_attr_type_t **user_table) 990 { 991 zap_cursor_t zc; 992 zap_attribute_t za; 993 sa_os_t *sa; 994 dmu_objset_type_t ostype = dmu_objset_type(os); 995 sa_attr_type_t *tb; 996 int error; 997 998 mutex_enter(&os->os_user_ptr_lock); 999 if (os->os_sa) { 1000 mutex_enter(&os->os_sa->sa_lock); 1001 mutex_exit(&os->os_user_ptr_lock); 1002 tb = os->os_sa->sa_user_table; 1003 mutex_exit(&os->os_sa->sa_lock); 1004 *user_table = tb; 1005 return (0); 1006 } 1007 1008 sa = kmem_zalloc(sizeof (sa_os_t), KM_SLEEP); 1009 mutex_init(&sa->sa_lock, NULL, MUTEX_DEFAULT, NULL); 1010 sa->sa_master_obj = sa_obj; 1011 1012 os->os_sa = sa; 1013 mutex_enter(&sa->sa_lock); 1014 mutex_exit(&os->os_user_ptr_lock); 1015 avl_create(&sa->sa_layout_num_tree, layout_num_compare, 1016 sizeof (sa_lot_t), offsetof(sa_lot_t, lot_num_node)); 1017 avl_create(&sa->sa_layout_hash_tree, layout_hash_compare, 1018 sizeof (sa_lot_t), offsetof(sa_lot_t, lot_hash_node)); 1019 1020 if (sa_obj) { 1021 error = zap_lookup(os, sa_obj, SA_LAYOUTS, 1022 8, 1, &sa->sa_layout_attr_obj); 1023 if (error != 0 && error != ENOENT) 1024 goto fail; 1025 error = zap_lookup(os, sa_obj, SA_REGISTRY, 1026 8, 1, &sa->sa_reg_attr_obj); 1027 if (error != 0 && error != ENOENT) 1028 goto fail; 1029 } 1030 1031 if ((error = sa_attr_table_setup(os, reg_attrs, count)) != 0) 1032 goto fail; 1033 1034 if (sa->sa_layout_attr_obj != 0) { 1035 uint64_t layout_count; 1036 1037 error = zap_count(os, sa->sa_layout_attr_obj, 1038 &layout_count); 1039 1040 /* 1041 * Layout number count should be > 0 1042 */ 1043 if (error || (error == 0 && layout_count == 0)) { 1044 if (error == 0) 1045 error = SET_ERROR(EINVAL); 1046 goto fail; 1047 } 1048 1049 for (zap_cursor_init(&zc, os, sa->sa_layout_attr_obj); 1050 (error = zap_cursor_retrieve(&zc, &za)) == 0; 1051 zap_cursor_advance(&zc)) { 1052 sa_attr_type_t *lot_attrs; 1053 uint64_t lot_num; 1054 1055 lot_attrs = kmem_zalloc(sizeof (sa_attr_type_t) * 1056 za.za_num_integers, KM_SLEEP); 1057 1058 if ((error = (zap_lookup(os, sa->sa_layout_attr_obj, 1059 za.za_name, 2, za.za_num_integers, 1060 lot_attrs))) != 0) { 1061 kmem_free(lot_attrs, sizeof (sa_attr_type_t) * 1062 za.za_num_integers); 1063 break; 1064 } 1065 VERIFY(ddi_strtoull(za.za_name, NULL, 10, 1066 (unsigned long long *)&lot_num) == 0); 1067 1068 (void) sa_add_layout_entry(os, lot_attrs, 1069 za.za_num_integers, lot_num, 1070 sa_layout_info_hash(lot_attrs, 1071 za.za_num_integers), B_FALSE, NULL); 1072 kmem_free(lot_attrs, sizeof (sa_attr_type_t) * 1073 za.za_num_integers); 1074 } 1075 zap_cursor_fini(&zc); 1076 1077 /* 1078 * Make sure layout count matches number of entries added 1079 * to AVL tree 1080 */ 1081 if (avl_numnodes(&sa->sa_layout_num_tree) != layout_count) { 1082 ASSERT(error != 0); 1083 goto fail; 1084 } 1085 } 1086 1087 /* Add special layout number for old ZNODES */ 1088 if (ostype == DMU_OST_ZFS) { 1089 (void) sa_add_layout_entry(os, sa_legacy_zpl_layout, 1090 sa_legacy_attr_count, 0, 1091 sa_layout_info_hash(sa_legacy_zpl_layout, 1092 sa_legacy_attr_count), B_FALSE, NULL); 1093 1094 (void) sa_add_layout_entry(os, sa_dummy_zpl_layout, 0, 1, 1095 0, B_FALSE, NULL); 1096 } 1097 *user_table = os->os_sa->sa_user_table; 1098 mutex_exit(&sa->sa_lock); 1099 return (0); 1100 fail: 1101 os->os_sa = NULL; 1102 sa_free_attr_table(sa); 1103 if (sa->sa_user_table) 1104 kmem_free(sa->sa_user_table, sa->sa_user_table_sz); 1105 mutex_exit(&sa->sa_lock); 1106 avl_destroy(&sa->sa_layout_hash_tree); 1107 avl_destroy(&sa->sa_layout_num_tree); 1108 mutex_destroy(&sa->sa_lock); 1109 kmem_free(sa, sizeof (sa_os_t)); 1110 return ((error == ECKSUM) ? EIO : error); 1111 } 1112 1113 void 1114 sa_tear_down(objset_t *os) 1115 { 1116 sa_os_t *sa = os->os_sa; 1117 sa_lot_t *layout; 1118 void *cookie; 1119 1120 kmem_free(sa->sa_user_table, sa->sa_user_table_sz); 1121 1122 /* Free up attr table */ 1123 1124 sa_free_attr_table(sa); 1125 1126 cookie = NULL; 1127 while (layout = avl_destroy_nodes(&sa->sa_layout_hash_tree, &cookie)) { 1128 sa_idx_tab_t *tab; 1129 while (tab = list_head(&layout->lot_idx_tab)) { 1130 ASSERT(refcount_count(&tab->sa_refcount)); 1131 sa_idx_tab_rele(os, tab); 1132 } 1133 } 1134 1135 cookie = NULL; 1136 while (layout = avl_destroy_nodes(&sa->sa_layout_num_tree, &cookie)) { 1137 kmem_free(layout->lot_attrs, 1138 sizeof (sa_attr_type_t) * layout->lot_attr_count); 1139 kmem_free(layout, sizeof (sa_lot_t)); 1140 } 1141 1142 avl_destroy(&sa->sa_layout_hash_tree); 1143 avl_destroy(&sa->sa_layout_num_tree); 1144 mutex_destroy(&sa->sa_lock); 1145 1146 kmem_free(sa, sizeof (sa_os_t)); 1147 os->os_sa = NULL; 1148 } 1149 1150 void 1151 sa_build_idx_tab(void *hdr, void *attr_addr, sa_attr_type_t attr, 1152 uint16_t length, int length_idx, boolean_t var_length, void *userp) 1153 { 1154 sa_idx_tab_t *idx_tab = userp; 1155 1156 if (var_length) { 1157 ASSERT(idx_tab->sa_variable_lengths); 1158 idx_tab->sa_variable_lengths[length_idx] = length; 1159 } 1160 TOC_ATTR_ENCODE(idx_tab->sa_idx_tab[attr], length_idx, 1161 (uint32_t)((uintptr_t)attr_addr - (uintptr_t)hdr)); 1162 } 1163 1164 static void 1165 sa_attr_iter(objset_t *os, sa_hdr_phys_t *hdr, dmu_object_type_t type, 1166 sa_iterfunc_t func, sa_lot_t *tab, void *userp) 1167 { 1168 void *data_start; 1169 sa_lot_t *tb = tab; 1170 sa_lot_t search; 1171 avl_index_t loc; 1172 sa_os_t *sa = os->os_sa; 1173 int i; 1174 uint16_t *length_start = NULL; 1175 uint8_t length_idx = 0; 1176 1177 if (tab == NULL) { 1178 search.lot_num = SA_LAYOUT_NUM(hdr, type); 1179 tb = avl_find(&sa->sa_layout_num_tree, &search, &loc); 1180 ASSERT(tb); 1181 } 1182 1183 if (IS_SA_BONUSTYPE(type)) { 1184 data_start = (void *)P2ROUNDUP(((uintptr_t)hdr + 1185 offsetof(sa_hdr_phys_t, sa_lengths) + 1186 (sizeof (uint16_t) * tb->lot_var_sizes)), 8); 1187 length_start = hdr->sa_lengths; 1188 } else { 1189 data_start = hdr; 1190 } 1191 1192 for (i = 0; i != tb->lot_attr_count; i++) { 1193 int attr_length, reg_length; 1194 uint8_t idx_len; 1195 1196 reg_length = sa->sa_attr_table[tb->lot_attrs[i]].sa_length; 1197 if (reg_length) { 1198 attr_length = reg_length; 1199 idx_len = 0; 1200 } else { 1201 attr_length = length_start[length_idx]; 1202 idx_len = length_idx++; 1203 } 1204 1205 func(hdr, data_start, tb->lot_attrs[i], attr_length, 1206 idx_len, reg_length == 0 ? B_TRUE : B_FALSE, userp); 1207 1208 data_start = (void *)P2ROUNDUP(((uintptr_t)data_start + 1209 attr_length), 8); 1210 } 1211 } 1212 1213 /*ARGSUSED*/ 1214 void 1215 sa_byteswap_cb(void *hdr, void *attr_addr, sa_attr_type_t attr, 1216 uint16_t length, int length_idx, boolean_t variable_length, void *userp) 1217 { 1218 sa_handle_t *hdl = userp; 1219 sa_os_t *sa = hdl->sa_os->os_sa; 1220 1221 sa_bswap_table[sa->sa_attr_table[attr].sa_byteswap](attr_addr, length); 1222 } 1223 1224 void 1225 sa_byteswap(sa_handle_t *hdl, sa_buf_type_t buftype) 1226 { 1227 sa_hdr_phys_t *sa_hdr_phys = SA_GET_HDR(hdl, buftype); 1228 dmu_buf_impl_t *db; 1229 sa_os_t *sa = hdl->sa_os->os_sa; 1230 int num_lengths = 1; 1231 int i; 1232 1233 ASSERT(MUTEX_HELD(&sa->sa_lock)); 1234 if (sa_hdr_phys->sa_magic == SA_MAGIC) 1235 return; 1236 1237 db = SA_GET_DB(hdl, buftype); 1238 1239 if (buftype == SA_SPILL) { 1240 arc_release(db->db_buf, NULL); 1241 arc_buf_thaw(db->db_buf); 1242 } 1243 1244 sa_hdr_phys->sa_magic = BSWAP_32(sa_hdr_phys->sa_magic); 1245 sa_hdr_phys->sa_layout_info = BSWAP_16(sa_hdr_phys->sa_layout_info); 1246 1247 /* 1248 * Determine number of variable lenghts in header 1249 * The standard 8 byte header has one for free and a 1250 * 16 byte header would have 4 + 1; 1251 */ 1252 if (SA_HDR_SIZE(sa_hdr_phys) > 8) 1253 num_lengths += (SA_HDR_SIZE(sa_hdr_phys) - 8) >> 1; 1254 for (i = 0; i != num_lengths; i++) 1255 sa_hdr_phys->sa_lengths[i] = 1256 BSWAP_16(sa_hdr_phys->sa_lengths[i]); 1257 1258 sa_attr_iter(hdl->sa_os, sa_hdr_phys, DMU_OT_SA, 1259 sa_byteswap_cb, NULL, hdl); 1260 1261 if (buftype == SA_SPILL) 1262 arc_buf_freeze(((dmu_buf_impl_t *)hdl->sa_spill)->db_buf); 1263 } 1264 1265 static int 1266 sa_build_index(sa_handle_t *hdl, sa_buf_type_t buftype) 1267 { 1268 sa_hdr_phys_t *sa_hdr_phys; 1269 dmu_buf_impl_t *db = SA_GET_DB(hdl, buftype); 1270 dmu_object_type_t bonustype = SA_BONUSTYPE_FROM_DB(db); 1271 sa_os_t *sa = hdl->sa_os->os_sa; 1272 sa_idx_tab_t *idx_tab; 1273 1274 sa_hdr_phys = SA_GET_HDR(hdl, buftype); 1275 1276 mutex_enter(&sa->sa_lock); 1277 1278 /* Do we need to byteswap? */ 1279 1280 /* only check if not old znode */ 1281 if (IS_SA_BONUSTYPE(bonustype) && sa_hdr_phys->sa_magic != SA_MAGIC && 1282 sa_hdr_phys->sa_magic != 0) { 1283 VERIFY(BSWAP_32(sa_hdr_phys->sa_magic) == SA_MAGIC); 1284 sa_byteswap(hdl, buftype); 1285 } 1286 1287 idx_tab = sa_find_idx_tab(hdl->sa_os, bonustype, sa_hdr_phys); 1288 1289 if (buftype == SA_BONUS) 1290 hdl->sa_bonus_tab = idx_tab; 1291 else 1292 hdl->sa_spill_tab = idx_tab; 1293 1294 mutex_exit(&sa->sa_lock); 1295 return (0); 1296 } 1297 1298 /*ARGSUSED*/ 1299 static void 1300 sa_evict(void *dbu) 1301 { 1302 panic("evicting sa dbuf\n"); 1303 } 1304 1305 static void 1306 sa_idx_tab_rele(objset_t *os, void *arg) 1307 { 1308 sa_os_t *sa = os->os_sa; 1309 sa_idx_tab_t *idx_tab = arg; 1310 1311 if (idx_tab == NULL) 1312 return; 1313 1314 mutex_enter(&sa->sa_lock); 1315 if (refcount_remove(&idx_tab->sa_refcount, NULL) == 0) { 1316 list_remove(&idx_tab->sa_layout->lot_idx_tab, idx_tab); 1317 if (idx_tab->sa_variable_lengths) 1318 kmem_free(idx_tab->sa_variable_lengths, 1319 sizeof (uint16_t) * 1320 idx_tab->sa_layout->lot_var_sizes); 1321 refcount_destroy(&idx_tab->sa_refcount); 1322 kmem_free(idx_tab->sa_idx_tab, 1323 sizeof (uint32_t) * sa->sa_num_attrs); 1324 kmem_free(idx_tab, sizeof (sa_idx_tab_t)); 1325 } 1326 mutex_exit(&sa->sa_lock); 1327 } 1328 1329 static void 1330 sa_idx_tab_hold(objset_t *os, sa_idx_tab_t *idx_tab) 1331 { 1332 sa_os_t *sa = os->os_sa; 1333 1334 ASSERT(MUTEX_HELD(&sa->sa_lock)); 1335 (void) refcount_add(&idx_tab->sa_refcount, NULL); 1336 } 1337 1338 void 1339 sa_handle_destroy(sa_handle_t *hdl) 1340 { 1341 dmu_buf_t *db = hdl->sa_bonus; 1342 1343 mutex_enter(&hdl->sa_lock); 1344 (void) dmu_buf_remove_user(db, &hdl->sa_dbu); 1345 1346 if (hdl->sa_bonus_tab) 1347 sa_idx_tab_rele(hdl->sa_os, hdl->sa_bonus_tab); 1348 1349 if (hdl->sa_spill_tab) 1350 sa_idx_tab_rele(hdl->sa_os, hdl->sa_spill_tab); 1351 1352 dmu_buf_rele(hdl->sa_bonus, NULL); 1353 1354 if (hdl->sa_spill) 1355 dmu_buf_rele((dmu_buf_t *)hdl->sa_spill, NULL); 1356 mutex_exit(&hdl->sa_lock); 1357 1358 kmem_cache_free(sa_cache, hdl); 1359 } 1360 1361 int 1362 sa_handle_get_from_db(objset_t *os, dmu_buf_t *db, void *userp, 1363 sa_handle_type_t hdl_type, sa_handle_t **handlepp) 1364 { 1365 int error = 0; 1366 dmu_object_info_t doi; 1367 sa_handle_t *handle = NULL; 1368 1369 #ifdef ZFS_DEBUG 1370 dmu_object_info_from_db(db, &doi); 1371 ASSERT(doi.doi_bonus_type == DMU_OT_SA || 1372 doi.doi_bonus_type == DMU_OT_ZNODE); 1373 #endif 1374 /* find handle, if it exists */ 1375 /* if one doesn't exist then create a new one, and initialize it */ 1376 1377 if (hdl_type == SA_HDL_SHARED) 1378 handle = dmu_buf_get_user(db); 1379 1380 if (handle == NULL) { 1381 sa_handle_t *winner = NULL; 1382 1383 handle = kmem_cache_alloc(sa_cache, KM_SLEEP); 1384 handle->sa_dbu.dbu_evict_func = NULL; 1385 handle->sa_userp = userp; 1386 handle->sa_bonus = db; 1387 handle->sa_os = os; 1388 handle->sa_spill = NULL; 1389 handle->sa_bonus_tab = NULL; 1390 handle->sa_spill_tab = NULL; 1391 1392 error = sa_build_index(handle, SA_BONUS); 1393 1394 if (hdl_type == SA_HDL_SHARED) { 1395 dmu_buf_init_user(&handle->sa_dbu, sa_evict, NULL); 1396 winner = dmu_buf_set_user_ie(db, &handle->sa_dbu); 1397 } 1398 1399 if (winner != NULL) { 1400 kmem_cache_free(sa_cache, handle); 1401 handle = winner; 1402 } 1403 } 1404 *handlepp = handle; 1405 1406 return (error); 1407 } 1408 1409 int 1410 sa_handle_get(objset_t *objset, uint64_t objid, void *userp, 1411 sa_handle_type_t hdl_type, sa_handle_t **handlepp) 1412 { 1413 dmu_buf_t *db; 1414 int error; 1415 1416 if (error = dmu_bonus_hold(objset, objid, NULL, &db)) 1417 return (error); 1418 1419 return (sa_handle_get_from_db(objset, db, userp, hdl_type, 1420 handlepp)); 1421 } 1422 1423 int 1424 sa_buf_hold(objset_t *objset, uint64_t obj_num, void *tag, dmu_buf_t **db) 1425 { 1426 return (dmu_bonus_hold(objset, obj_num, tag, db)); 1427 } 1428 1429 void 1430 sa_buf_rele(dmu_buf_t *db, void *tag) 1431 { 1432 dmu_buf_rele(db, tag); 1433 } 1434 1435 int 1436 sa_lookup_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count) 1437 { 1438 ASSERT(hdl); 1439 ASSERT(MUTEX_HELD(&hdl->sa_lock)); 1440 return (sa_attr_op(hdl, bulk, count, SA_LOOKUP, NULL)); 1441 } 1442 1443 int 1444 sa_lookup(sa_handle_t *hdl, sa_attr_type_t attr, void *buf, uint32_t buflen) 1445 { 1446 int error; 1447 sa_bulk_attr_t bulk; 1448 1449 bulk.sa_attr = attr; 1450 bulk.sa_data = buf; 1451 bulk.sa_length = buflen; 1452 bulk.sa_data_func = NULL; 1453 1454 ASSERT(hdl); 1455 mutex_enter(&hdl->sa_lock); 1456 error = sa_lookup_impl(hdl, &bulk, 1); 1457 mutex_exit(&hdl->sa_lock); 1458 return (error); 1459 } 1460 1461 #ifdef _KERNEL 1462 int 1463 sa_lookup_uio(sa_handle_t *hdl, sa_attr_type_t attr, uio_t *uio) 1464 { 1465 int error; 1466 sa_bulk_attr_t bulk; 1467 1468 bulk.sa_data = NULL; 1469 bulk.sa_attr = attr; 1470 bulk.sa_data_func = NULL; 1471 1472 ASSERT(hdl); 1473 1474 mutex_enter(&hdl->sa_lock); 1475 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) == 0) { 1476 error = uiomove((void *)bulk.sa_addr, MIN(bulk.sa_size, 1477 uio->uio_resid), UIO_READ, uio); 1478 } 1479 mutex_exit(&hdl->sa_lock); 1480 return (error); 1481 1482 } 1483 #endif 1484 1485 void * 1486 sa_find_idx_tab(objset_t *os, dmu_object_type_t bonustype, void *data) 1487 { 1488 sa_idx_tab_t *idx_tab; 1489 sa_hdr_phys_t *hdr = (sa_hdr_phys_t *)data; 1490 sa_os_t *sa = os->os_sa; 1491 sa_lot_t *tb, search; 1492 avl_index_t loc; 1493 1494 /* 1495 * Deterimine layout number. If SA node and header == 0 then 1496 * force the index table to the dummy "1" empty layout. 1497 * 1498 * The layout number would only be zero for a newly created file 1499 * that has not added any attributes yet, or with crypto enabled which 1500 * doesn't write any attributes to the bonus buffer. 1501 */ 1502 1503 search.lot_num = SA_LAYOUT_NUM(hdr, bonustype); 1504 1505 tb = avl_find(&sa->sa_layout_num_tree, &search, &loc); 1506 1507 /* Verify header size is consistent with layout information */ 1508 ASSERT(tb); 1509 ASSERT(IS_SA_BONUSTYPE(bonustype) && 1510 SA_HDR_SIZE_MATCH_LAYOUT(hdr, tb) || !IS_SA_BONUSTYPE(bonustype) || 1511 (IS_SA_BONUSTYPE(bonustype) && hdr->sa_layout_info == 0)); 1512 1513 /* 1514 * See if any of the already existing TOC entries can be reused? 1515 */ 1516 1517 for (idx_tab = list_head(&tb->lot_idx_tab); idx_tab; 1518 idx_tab = list_next(&tb->lot_idx_tab, idx_tab)) { 1519 boolean_t valid_idx = B_TRUE; 1520 int i; 1521 1522 if (tb->lot_var_sizes != 0 && 1523 idx_tab->sa_variable_lengths != NULL) { 1524 for (i = 0; i != tb->lot_var_sizes; i++) { 1525 if (hdr->sa_lengths[i] != 1526 idx_tab->sa_variable_lengths[i]) { 1527 valid_idx = B_FALSE; 1528 break; 1529 } 1530 } 1531 } 1532 if (valid_idx) { 1533 sa_idx_tab_hold(os, idx_tab); 1534 return (idx_tab); 1535 } 1536 } 1537 1538 /* No such luck, create a new entry */ 1539 idx_tab = kmem_zalloc(sizeof (sa_idx_tab_t), KM_SLEEP); 1540 idx_tab->sa_idx_tab = 1541 kmem_zalloc(sizeof (uint32_t) * sa->sa_num_attrs, KM_SLEEP); 1542 idx_tab->sa_layout = tb; 1543 refcount_create(&idx_tab->sa_refcount); 1544 if (tb->lot_var_sizes) 1545 idx_tab->sa_variable_lengths = kmem_alloc(sizeof (uint16_t) * 1546 tb->lot_var_sizes, KM_SLEEP); 1547 1548 sa_attr_iter(os, hdr, bonustype, sa_build_idx_tab, 1549 tb, idx_tab); 1550 sa_idx_tab_hold(os, idx_tab); /* one hold for consumer */ 1551 sa_idx_tab_hold(os, idx_tab); /* one for layout */ 1552 list_insert_tail(&tb->lot_idx_tab, idx_tab); 1553 return (idx_tab); 1554 } 1555 1556 void 1557 sa_default_locator(void **dataptr, uint32_t *len, uint32_t total_len, 1558 boolean_t start, void *userdata) 1559 { 1560 ASSERT(start); 1561 1562 *dataptr = userdata; 1563 *len = total_len; 1564 } 1565 1566 static void 1567 sa_attr_register_sync(sa_handle_t *hdl, dmu_tx_t *tx) 1568 { 1569 uint64_t attr_value = 0; 1570 sa_os_t *sa = hdl->sa_os->os_sa; 1571 sa_attr_table_t *tb = sa->sa_attr_table; 1572 int i; 1573 1574 mutex_enter(&sa->sa_lock); 1575 1576 if (!sa->sa_need_attr_registration || sa->sa_master_obj == NULL) { 1577 mutex_exit(&sa->sa_lock); 1578 return; 1579 } 1580 1581 if (sa->sa_reg_attr_obj == NULL) { 1582 sa->sa_reg_attr_obj = zap_create_link(hdl->sa_os, 1583 DMU_OT_SA_ATTR_REGISTRATION, 1584 sa->sa_master_obj, SA_REGISTRY, tx); 1585 } 1586 for (i = 0; i != sa->sa_num_attrs; i++) { 1587 if (sa->sa_attr_table[i].sa_registered) 1588 continue; 1589 ATTR_ENCODE(attr_value, tb[i].sa_attr, tb[i].sa_length, 1590 tb[i].sa_byteswap); 1591 VERIFY(0 == zap_update(hdl->sa_os, sa->sa_reg_attr_obj, 1592 tb[i].sa_name, 8, 1, &attr_value, tx)); 1593 tb[i].sa_registered = B_TRUE; 1594 } 1595 sa->sa_need_attr_registration = B_FALSE; 1596 mutex_exit(&sa->sa_lock); 1597 } 1598 1599 /* 1600 * Replace all attributes with attributes specified in template. 1601 * If dnode had a spill buffer then those attributes will be 1602 * also be replaced, possibly with just an empty spill block 1603 * 1604 * This interface is intended to only be used for bulk adding of 1605 * attributes for a new file. It will also be used by the ZPL 1606 * when converting and old formatted znode to native SA support. 1607 */ 1608 int 1609 sa_replace_all_by_template_locked(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc, 1610 int attr_count, dmu_tx_t *tx) 1611 { 1612 sa_os_t *sa = hdl->sa_os->os_sa; 1613 1614 if (sa->sa_need_attr_registration) 1615 sa_attr_register_sync(hdl, tx); 1616 return (sa_build_layouts(hdl, attr_desc, attr_count, tx)); 1617 } 1618 1619 int 1620 sa_replace_all_by_template(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc, 1621 int attr_count, dmu_tx_t *tx) 1622 { 1623 int error; 1624 1625 mutex_enter(&hdl->sa_lock); 1626 error = sa_replace_all_by_template_locked(hdl, attr_desc, 1627 attr_count, tx); 1628 mutex_exit(&hdl->sa_lock); 1629 return (error); 1630 } 1631 1632 /* 1633 * add/remove/replace a single attribute and then rewrite the entire set 1634 * of attributes. 1635 */ 1636 static int 1637 sa_modify_attrs(sa_handle_t *hdl, sa_attr_type_t newattr, 1638 sa_data_op_t action, sa_data_locator_t *locator, void *datastart, 1639 uint16_t buflen, dmu_tx_t *tx) 1640 { 1641 sa_os_t *sa = hdl->sa_os->os_sa; 1642 dmu_buf_impl_t *db = (dmu_buf_impl_t *)hdl->sa_bonus; 1643 dnode_t *dn; 1644 sa_bulk_attr_t *attr_desc; 1645 void *old_data[2]; 1646 int bonus_attr_count = 0; 1647 int bonus_data_size = 0; 1648 int spill_data_size = 0; 1649 int spill_attr_count = 0; 1650 int error; 1651 uint16_t length; 1652 int i, j, k, length_idx; 1653 sa_hdr_phys_t *hdr; 1654 sa_idx_tab_t *idx_tab; 1655 int attr_count; 1656 int count; 1657 1658 ASSERT(MUTEX_HELD(&hdl->sa_lock)); 1659 1660 /* First make of copy of the old data */ 1661 1662 DB_DNODE_ENTER(db); 1663 dn = DB_DNODE(db); 1664 if (dn->dn_bonuslen != 0) { 1665 bonus_data_size = hdl->sa_bonus->db_size; 1666 old_data[0] = kmem_alloc(bonus_data_size, KM_SLEEP); 1667 bcopy(hdl->sa_bonus->db_data, old_data[0], 1668 hdl->sa_bonus->db_size); 1669 bonus_attr_count = hdl->sa_bonus_tab->sa_layout->lot_attr_count; 1670 } else { 1671 old_data[0] = NULL; 1672 } 1673 DB_DNODE_EXIT(db); 1674 1675 /* Bring spill buffer online if it isn't currently */ 1676 1677 if ((error = sa_get_spill(hdl)) == 0) { 1678 spill_data_size = hdl->sa_spill->db_size; 1679 old_data[1] = kmem_alloc(spill_data_size, KM_SLEEP); 1680 bcopy(hdl->sa_spill->db_data, old_data[1], 1681 hdl->sa_spill->db_size); 1682 spill_attr_count = 1683 hdl->sa_spill_tab->sa_layout->lot_attr_count; 1684 } else if (error && error != ENOENT) { 1685 if (old_data[0]) 1686 kmem_free(old_data[0], bonus_data_size); 1687 return (error); 1688 } else { 1689 old_data[1] = NULL; 1690 } 1691 1692 /* build descriptor of all attributes */ 1693 1694 attr_count = bonus_attr_count + spill_attr_count; 1695 if (action == SA_ADD) 1696 attr_count++; 1697 else if (action == SA_REMOVE) 1698 attr_count--; 1699 1700 attr_desc = kmem_zalloc(sizeof (sa_bulk_attr_t) * attr_count, KM_SLEEP); 1701 1702 /* 1703 * loop through bonus and spill buffer if it exists, and 1704 * build up new attr_descriptor to reset the attributes 1705 */ 1706 k = j = 0; 1707 count = bonus_attr_count; 1708 hdr = SA_GET_HDR(hdl, SA_BONUS); 1709 idx_tab = SA_IDX_TAB_GET(hdl, SA_BONUS); 1710 for (; k != 2; k++) { 1711 /* iterate over each attribute in layout */ 1712 for (i = 0, length_idx = 0; i != count; i++) { 1713 sa_attr_type_t attr; 1714 1715 attr = idx_tab->sa_layout->lot_attrs[i]; 1716 if (attr == newattr) { 1717 if (action == SA_REMOVE) { 1718 j++; 1719 continue; 1720 } 1721 ASSERT(SA_REGISTERED_LEN(sa, attr) == 0); 1722 ASSERT(action == SA_REPLACE); 1723 SA_ADD_BULK_ATTR(attr_desc, j, attr, 1724 locator, datastart, buflen); 1725 } else { 1726 length = SA_REGISTERED_LEN(sa, attr); 1727 if (length == 0) { 1728 length = hdr->sa_lengths[length_idx++]; 1729 } 1730 1731 SA_ADD_BULK_ATTR(attr_desc, j, attr, 1732 NULL, (void *) 1733 (TOC_OFF(idx_tab->sa_idx_tab[attr]) + 1734 (uintptr_t)old_data[k]), length); 1735 } 1736 } 1737 if (k == 0 && hdl->sa_spill) { 1738 hdr = SA_GET_HDR(hdl, SA_SPILL); 1739 idx_tab = SA_IDX_TAB_GET(hdl, SA_SPILL); 1740 count = spill_attr_count; 1741 } else { 1742 break; 1743 } 1744 } 1745 if (action == SA_ADD) { 1746 length = SA_REGISTERED_LEN(sa, newattr); 1747 if (length == 0) { 1748 length = buflen; 1749 } 1750 SA_ADD_BULK_ATTR(attr_desc, j, newattr, locator, 1751 datastart, buflen); 1752 } 1753 1754 error = sa_build_layouts(hdl, attr_desc, attr_count, tx); 1755 1756 if (old_data[0]) 1757 kmem_free(old_data[0], bonus_data_size); 1758 if (old_data[1]) 1759 kmem_free(old_data[1], spill_data_size); 1760 kmem_free(attr_desc, sizeof (sa_bulk_attr_t) * attr_count); 1761 1762 return (error); 1763 } 1764 1765 static int 1766 sa_bulk_update_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count, 1767 dmu_tx_t *tx) 1768 { 1769 int error; 1770 sa_os_t *sa = hdl->sa_os->os_sa; 1771 dmu_object_type_t bonustype; 1772 1773 bonustype = SA_BONUSTYPE_FROM_DB(SA_GET_DB(hdl, SA_BONUS)); 1774 1775 ASSERT(hdl); 1776 ASSERT(MUTEX_HELD(&hdl->sa_lock)); 1777 1778 /* sync out registration table if necessary */ 1779 if (sa->sa_need_attr_registration) 1780 sa_attr_register_sync(hdl, tx); 1781 1782 error = sa_attr_op(hdl, bulk, count, SA_UPDATE, tx); 1783 if (error == 0 && !IS_SA_BONUSTYPE(bonustype) && sa->sa_update_cb) 1784 sa->sa_update_cb(hdl, tx); 1785 1786 return (error); 1787 } 1788 1789 /* 1790 * update or add new attribute 1791 */ 1792 int 1793 sa_update(sa_handle_t *hdl, sa_attr_type_t type, 1794 void *buf, uint32_t buflen, dmu_tx_t *tx) 1795 { 1796 int error; 1797 sa_bulk_attr_t bulk; 1798 1799 bulk.sa_attr = type; 1800 bulk.sa_data_func = NULL; 1801 bulk.sa_length = buflen; 1802 bulk.sa_data = buf; 1803 1804 mutex_enter(&hdl->sa_lock); 1805 error = sa_bulk_update_impl(hdl, &bulk, 1, tx); 1806 mutex_exit(&hdl->sa_lock); 1807 return (error); 1808 } 1809 1810 int 1811 sa_update_from_cb(sa_handle_t *hdl, sa_attr_type_t attr, 1812 uint32_t buflen, sa_data_locator_t *locator, void *userdata, dmu_tx_t *tx) 1813 { 1814 int error; 1815 sa_bulk_attr_t bulk; 1816 1817 bulk.sa_attr = attr; 1818 bulk.sa_data = userdata; 1819 bulk.sa_data_func = locator; 1820 bulk.sa_length = buflen; 1821 1822 mutex_enter(&hdl->sa_lock); 1823 error = sa_bulk_update_impl(hdl, &bulk, 1, tx); 1824 mutex_exit(&hdl->sa_lock); 1825 return (error); 1826 } 1827 1828 /* 1829 * Return size of an attribute 1830 */ 1831 1832 int 1833 sa_size(sa_handle_t *hdl, sa_attr_type_t attr, int *size) 1834 { 1835 sa_bulk_attr_t bulk; 1836 int error; 1837 1838 bulk.sa_data = NULL; 1839 bulk.sa_attr = attr; 1840 bulk.sa_data_func = NULL; 1841 1842 ASSERT(hdl); 1843 mutex_enter(&hdl->sa_lock); 1844 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) != 0) { 1845 mutex_exit(&hdl->sa_lock); 1846 return (error); 1847 } 1848 *size = bulk.sa_size; 1849 1850 mutex_exit(&hdl->sa_lock); 1851 return (0); 1852 } 1853 1854 int 1855 sa_bulk_lookup_locked(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count) 1856 { 1857 ASSERT(hdl); 1858 ASSERT(MUTEX_HELD(&hdl->sa_lock)); 1859 return (sa_lookup_impl(hdl, attrs, count)); 1860 } 1861 1862 int 1863 sa_bulk_lookup(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count) 1864 { 1865 int error; 1866 1867 ASSERT(hdl); 1868 mutex_enter(&hdl->sa_lock); 1869 error = sa_bulk_lookup_locked(hdl, attrs, count); 1870 mutex_exit(&hdl->sa_lock); 1871 return (error); 1872 } 1873 1874 int 1875 sa_bulk_update(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count, dmu_tx_t *tx) 1876 { 1877 int error; 1878 1879 ASSERT(hdl); 1880 mutex_enter(&hdl->sa_lock); 1881 error = sa_bulk_update_impl(hdl, attrs, count, tx); 1882 mutex_exit(&hdl->sa_lock); 1883 return (error); 1884 } 1885 1886 int 1887 sa_remove(sa_handle_t *hdl, sa_attr_type_t attr, dmu_tx_t *tx) 1888 { 1889 int error; 1890 1891 mutex_enter(&hdl->sa_lock); 1892 error = sa_modify_attrs(hdl, attr, SA_REMOVE, NULL, 1893 NULL, 0, tx); 1894 mutex_exit(&hdl->sa_lock); 1895 return (error); 1896 } 1897 1898 void 1899 sa_object_info(sa_handle_t *hdl, dmu_object_info_t *doi) 1900 { 1901 dmu_object_info_from_db((dmu_buf_t *)hdl->sa_bonus, doi); 1902 } 1903 1904 void 1905 sa_object_size(sa_handle_t *hdl, uint32_t *blksize, u_longlong_t *nblocks) 1906 { 1907 dmu_object_size_from_db((dmu_buf_t *)hdl->sa_bonus, 1908 blksize, nblocks); 1909 } 1910 1911 void 1912 sa_set_userp(sa_handle_t *hdl, void *ptr) 1913 { 1914 hdl->sa_userp = ptr; 1915 } 1916 1917 dmu_buf_t * 1918 sa_get_db(sa_handle_t *hdl) 1919 { 1920 return ((dmu_buf_t *)hdl->sa_bonus); 1921 } 1922 1923 void * 1924 sa_get_userdata(sa_handle_t *hdl) 1925 { 1926 return (hdl->sa_userp); 1927 } 1928 1929 void 1930 sa_register_update_callback_locked(objset_t *os, sa_update_cb_t *func) 1931 { 1932 ASSERT(MUTEX_HELD(&os->os_sa->sa_lock)); 1933 os->os_sa->sa_update_cb = func; 1934 } 1935 1936 void 1937 sa_register_update_callback(objset_t *os, sa_update_cb_t *func) 1938 { 1939 1940 mutex_enter(&os->os_sa->sa_lock); 1941 sa_register_update_callback_locked(os, func); 1942 mutex_exit(&os->os_sa->sa_lock); 1943 } 1944 1945 uint64_t 1946 sa_handle_object(sa_handle_t *hdl) 1947 { 1948 return (hdl->sa_bonus->db_object); 1949 } 1950 1951 boolean_t 1952 sa_enabled(objset_t *os) 1953 { 1954 return (os->os_sa == NULL); 1955 } 1956 1957 int 1958 sa_set_sa_object(objset_t *os, uint64_t sa_object) 1959 { 1960 sa_os_t *sa = os->os_sa; 1961 1962 if (sa->sa_master_obj) 1963 return (1); 1964 1965 sa->sa_master_obj = sa_object; 1966 1967 return (0); 1968 } 1969 1970 int 1971 sa_hdrsize(void *arg) 1972 { 1973 sa_hdr_phys_t *hdr = arg; 1974 1975 return (SA_HDR_SIZE(hdr)); 1976 } 1977 1978 void 1979 sa_handle_lock(sa_handle_t *hdl) 1980 { 1981 ASSERT(hdl); 1982 mutex_enter(&hdl->sa_lock); 1983 } 1984 1985 void 1986 sa_handle_unlock(sa_handle_t *hdl) 1987 { 1988 ASSERT(hdl); 1989 mutex_exit(&hdl->sa_lock); 1990 } 1991