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, 2017 by Delphix. All rights reserved.
26 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
27 * Copyright (c) 2014 Integros [integros.com]
28 */
29
30 #include <sys/zfs_context.h>
31 #include <sys/types.h>
32 #include <sys/param.h>
33 #include <sys/systm.h>
34 #include <sys/sysmacros.h>
35 #include <sys/dmu.h>
36 #include <sys/dmu_impl.h>
37 #include <sys/dmu_objset.h>
38 #include <sys/dmu_tx.h>
39 #include <sys/dbuf.h>
40 #include <sys/dnode.h>
41 #include <sys/zap.h>
42 #include <sys/sa.h>
43 #include <sys/sunddi.h>
44 #include <sys/sa_impl.h>
45 #include <sys/dnode.h>
46 #include <sys/errno.h>
47 #include <sys/zfs_context.h>
48
49 /*
50 * ZFS System attributes:
51 *
52 * A generic mechanism to allow for arbitrary attributes
53 * to be stored in a dnode. The data will be stored in the bonus buffer of
54 * the dnode and if necessary a special "spill" block will be used to handle
55 * overflow situations. The spill block will be sized to fit the data
56 * from 512 - 128K. When a spill block is used the BP (blkptr_t) for the
57 * spill block is stored at the end of the current bonus buffer. Any
58 * attributes that would be in the way of the blkptr_t will be relocated
59 * into the spill block.
60 *
61 * Attribute registration:
62 *
63 * Stored persistently on a per dataset basis
64 * a mapping between attribute "string" names and their actual attribute
65 * numeric values, length, and byteswap function. The names are only used
66 * during registration. All attributes are known by their unique attribute
67 * id value. If an attribute can have a variable size then the value
68 * 0 will be used to indicate this.
69 *
70 * Attribute Layout:
71 *
72 * Attribute layouts are a way to compactly store multiple attributes, but
73 * without taking the overhead associated with managing each attribute
74 * individually. Since you will typically have the same set of attributes
75 * stored in the same order a single table will be used to represent that
76 * layout. The ZPL for example will usually have only about 10 different
77 * layouts (regular files, device files, symlinks,
78 * regular files + scanstamp, files/dir with extended attributes, and then
79 * you have the possibility of all of those minus ACL, because it would
80 * be kicked out into the spill block)
81 *
82 * Layouts are simply an array of the attributes and their
83 * ordering i.e. [0, 1, 4, 5, 2]
84 *
85 * Each distinct layout is given a unique layout number and that is whats
86 * stored in the header at the beginning of the SA data buffer.
87 *
88 * A layout only covers a single dbuf (bonus or spill). If a set of
89 * attributes is split up between the bonus buffer and a spill buffer then
90 * two different layouts will be used. This allows us to byteswap the
91 * spill without looking at the bonus buffer and keeps the on disk format of
92 * the bonus and spill buffer the same.
93 *
94 * Adding a single attribute will cause the entire set of attributes to
95 * be rewritten and could result in a new layout number being constructed
96 * as part of the rewrite if no such layout exists for the new set of
97 * attribues. The new attribute will be appended to the end of the already
98 * existing attributes.
99 *
100 * Both the attribute registration and attribute layout information are
101 * stored in normal ZAP attributes. Their should be a small number of
102 * known layouts and the set of attributes is assumed to typically be quite
103 * small.
104 *
105 * The registered attributes and layout "table" information is maintained
106 * in core and a special "sa_os_t" is attached to the objset_t.
107 *
108 * A special interface is provided to allow for quickly applying
109 * a large set of attributes at once. sa_replace_all_by_template() is
110 * used to set an array of attributes. This is used by the ZPL when
111 * creating a brand new file. The template that is passed into the function
112 * specifies the attribute, size for variable length attributes, location of
113 * data and special "data locator" function if the data isn't in a contiguous
114 * location.
115 *
116 * Byteswap implications:
117 *
118 * Since the SA attributes are not entirely self describing we can't do
119 * the normal byteswap processing. The special ZAP layout attribute and
120 * attribute registration attributes define the byteswap function and the
121 * size of the attributes, unless it is variable sized.
122 * The normal ZFS byteswapping infrastructure assumes you don't need
123 * to read any objects in order to do the necessary byteswapping. Whereas
124 * SA attributes can only be properly byteswapped if the dataset is opened
125 * and the layout/attribute ZAP attributes are available. Because of this
126 * the SA attributes will be byteswapped when they are first accessed by
127 * the SA code that will read the SA data.
128 */
129
130 typedef void (sa_iterfunc_t)(void *hdr, void *addr, sa_attr_type_t,
131 uint16_t length, int length_idx, boolean_t, void *userp);
132
133 static int sa_build_index(sa_handle_t *hdl, sa_buf_type_t buftype);
134 static void sa_idx_tab_hold(objset_t *os, sa_idx_tab_t *idx_tab);
135 static sa_idx_tab_t *sa_find_idx_tab(objset_t *os, dmu_object_type_t bonustype,
136 sa_hdr_phys_t *hdr);
137 static void sa_idx_tab_rele(objset_t *os, void *arg);
138 static void sa_copy_data(sa_data_locator_t *func, void *start, void *target,
139 int buflen);
140 static int sa_modify_attrs(sa_handle_t *hdl, sa_attr_type_t newattr,
141 sa_data_op_t action, sa_data_locator_t *locator, void *datastart,
142 uint16_t buflen, dmu_tx_t *tx);
143
144 arc_byteswap_func_t *sa_bswap_table[] = {
145 byteswap_uint64_array,
146 byteswap_uint32_array,
147 byteswap_uint16_array,
148 byteswap_uint8_array,
149 zfs_acl_byteswap,
150 };
151
152 #define SA_COPY_DATA(f, s, t, l) \
153 { \
154 if (f == NULL) { \
155 if (l == 8) { \
156 *(uint64_t *)t = *(uint64_t *)s; \
157 } else if (l == 16) { \
158 *(uint64_t *)t = *(uint64_t *)s; \
159 *(uint64_t *)((uintptr_t)t + 8) = \
160 *(uint64_t *)((uintptr_t)s + 8); \
161 } else { \
162 bcopy(s, t, l); \
163 } \
164 } else \
165 sa_copy_data(f, s, t, l); \
166 }
167
168 /*
169 * This table is fixed and cannot be changed. Its purpose is to
170 * allow the SA code to work with both old/new ZPL file systems.
171 * It contains the list of legacy attributes. These attributes aren't
172 * stored in the "attribute" registry zap objects, since older ZPL file systems
173 * won't have the registry. Only objsets of type ZFS_TYPE_FILESYSTEM will
174 * use this static table.
175 */
176 sa_attr_reg_t sa_legacy_attrs[] = {
177 {"ZPL_ATIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 0},
178 {"ZPL_MTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 1},
179 {"ZPL_CTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 2},
180 {"ZPL_CRTIME", sizeof (uint64_t) * 2, SA_UINT64_ARRAY, 3},
181 {"ZPL_GEN", sizeof (uint64_t), SA_UINT64_ARRAY, 4},
182 {"ZPL_MODE", sizeof (uint64_t), SA_UINT64_ARRAY, 5},
183 {"ZPL_SIZE", sizeof (uint64_t), SA_UINT64_ARRAY, 6},
184 {"ZPL_PARENT", sizeof (uint64_t), SA_UINT64_ARRAY, 7},
185 {"ZPL_LINKS", sizeof (uint64_t), SA_UINT64_ARRAY, 8},
186 {"ZPL_XATTR", sizeof (uint64_t), SA_UINT64_ARRAY, 9},
187 {"ZPL_RDEV", sizeof (uint64_t), SA_UINT64_ARRAY, 10},
188 {"ZPL_FLAGS", sizeof (uint64_t), SA_UINT64_ARRAY, 11},
189 {"ZPL_UID", sizeof (uint64_t), SA_UINT64_ARRAY, 12},
190 {"ZPL_GID", sizeof (uint64_t), SA_UINT64_ARRAY, 13},
191 {"ZPL_PAD", sizeof (uint64_t) * 4, SA_UINT64_ARRAY, 14},
192 {"ZPL_ZNODE_ACL", 88, SA_UINT8_ARRAY, 15},
193 };
194
195 /*
196 * This is only used for objects of type DMU_OT_ZNODE
197 */
198 sa_attr_type_t sa_legacy_zpl_layout[] = {
199 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
200 };
201
202 /*
203 * Special dummy layout used for buffers with no attributes.
204 */
205 sa_attr_type_t sa_dummy_zpl_layout[] = { 0 };
206
207 static int sa_legacy_attr_count = 16;
208 static kmem_cache_t *sa_cache = NULL;
209
210 /*ARGSUSED*/
211 static int
sa_cache_constructor(void * buf,void * unused,int kmflag)212 sa_cache_constructor(void *buf, void *unused, int kmflag)
213 {
214 sa_handle_t *hdl = buf;
215
216 mutex_init(&hdl->sa_lock, NULL, MUTEX_DEFAULT, NULL);
217 return (0);
218 }
219
220 /*ARGSUSED*/
221 static void
sa_cache_destructor(void * buf,void * unused)222 sa_cache_destructor(void *buf, void *unused)
223 {
224 sa_handle_t *hdl = buf;
225 mutex_destroy(&hdl->sa_lock);
226 }
227
228 void
sa_cache_init(void)229 sa_cache_init(void)
230 {
231 sa_cache = kmem_cache_create("sa_cache",
232 sizeof (sa_handle_t), 0, sa_cache_constructor,
233 sa_cache_destructor, NULL, NULL, NULL, 0);
234 }
235
236 void
sa_cache_fini(void)237 sa_cache_fini(void)
238 {
239 if (sa_cache)
240 kmem_cache_destroy(sa_cache);
241 }
242
243 static int
layout_num_compare(const void * arg1,const void * arg2)244 layout_num_compare(const void *arg1, const void *arg2)
245 {
246 const sa_lot_t *node1 = (const sa_lot_t *)arg1;
247 const sa_lot_t *node2 = (const sa_lot_t *)arg2;
248
249 return (AVL_CMP(node1->lot_num, node2->lot_num));
250 }
251
252 static int
layout_hash_compare(const void * arg1,const void * arg2)253 layout_hash_compare(const void *arg1, const void *arg2)
254 {
255 const sa_lot_t *node1 = (const sa_lot_t *)arg1;
256 const sa_lot_t *node2 = (const sa_lot_t *)arg2;
257
258 int cmp = AVL_CMP(node1->lot_hash, node2->lot_hash);
259 if (likely(cmp))
260 return (cmp);
261
262 return (AVL_CMP(node1->lot_instance, node2->lot_instance));
263 }
264
265 boolean_t
sa_layout_equal(sa_lot_t * tbf,sa_attr_type_t * attrs,int count)266 sa_layout_equal(sa_lot_t *tbf, sa_attr_type_t *attrs, int count)
267 {
268 int i;
269
270 if (count != tbf->lot_attr_count)
271 return (1);
272
273 for (i = 0; i != count; i++) {
274 if (attrs[i] != tbf->lot_attrs[i])
275 return (1);
276 }
277 return (0);
278 }
279
280 #define SA_ATTR_HASH(attr) (zfs_crc64_table[(-1ULL ^ attr) & 0xFF])
281
282 static uint64_t
sa_layout_info_hash(sa_attr_type_t * attrs,int attr_count)283 sa_layout_info_hash(sa_attr_type_t *attrs, int attr_count)
284 {
285 int i;
286 uint64_t crc = -1ULL;
287
288 for (i = 0; i != attr_count; i++)
289 crc ^= SA_ATTR_HASH(attrs[i]);
290
291 return (crc);
292 }
293
294 static int
sa_get_spill(sa_handle_t * hdl)295 sa_get_spill(sa_handle_t *hdl)
296 {
297 int rc;
298 if (hdl->sa_spill == NULL) {
299 if ((rc = dmu_spill_hold_existing(hdl->sa_bonus, NULL,
300 &hdl->sa_spill)) == 0)
301 VERIFY(0 == sa_build_index(hdl, SA_SPILL));
302 } else {
303 rc = 0;
304 }
305
306 return (rc);
307 }
308
309 /*
310 * Main attribute lookup/update function
311 * returns 0 for success or non zero for failures
312 *
313 * Operates on bulk array, first failure will abort further processing
314 */
315 int
sa_attr_op(sa_handle_t * hdl,sa_bulk_attr_t * bulk,int count,sa_data_op_t data_op,dmu_tx_t * tx)316 sa_attr_op(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count,
317 sa_data_op_t data_op, dmu_tx_t *tx)
318 {
319 sa_os_t *sa = hdl->sa_os->os_sa;
320 int i;
321 int error = 0;
322 sa_buf_type_t buftypes;
323
324 buftypes = 0;
325
326 ASSERT(count > 0);
327 for (i = 0; i != count; i++) {
328 ASSERT(bulk[i].sa_attr <= hdl->sa_os->os_sa->sa_num_attrs);
329
330 bulk[i].sa_addr = NULL;
331 /* First check the bonus buffer */
332
333 if (hdl->sa_bonus_tab && TOC_ATTR_PRESENT(
334 hdl->sa_bonus_tab->sa_idx_tab[bulk[i].sa_attr])) {
335 SA_ATTR_INFO(sa, hdl->sa_bonus_tab,
336 SA_GET_HDR(hdl, SA_BONUS),
337 bulk[i].sa_attr, bulk[i], SA_BONUS, hdl);
338 if (tx && !(buftypes & SA_BONUS)) {
339 dmu_buf_will_dirty(hdl->sa_bonus, tx);
340 buftypes |= SA_BONUS;
341 }
342 }
343 if (bulk[i].sa_addr == NULL &&
344 ((error = sa_get_spill(hdl)) == 0)) {
345 if (TOC_ATTR_PRESENT(
346 hdl->sa_spill_tab->sa_idx_tab[bulk[i].sa_attr])) {
347 SA_ATTR_INFO(sa, hdl->sa_spill_tab,
348 SA_GET_HDR(hdl, SA_SPILL),
349 bulk[i].sa_attr, bulk[i], SA_SPILL, hdl);
350 if (tx && !(buftypes & SA_SPILL) &&
351 bulk[i].sa_size == bulk[i].sa_length) {
352 dmu_buf_will_dirty(hdl->sa_spill, tx);
353 buftypes |= SA_SPILL;
354 }
355 }
356 }
357 if (error && error != ENOENT) {
358 return ((error == ECKSUM) ? EIO : error);
359 }
360
361 switch (data_op) {
362 case SA_LOOKUP:
363 if (bulk[i].sa_addr == NULL)
364 return (SET_ERROR(ENOENT));
365 if (bulk[i].sa_data) {
366 SA_COPY_DATA(bulk[i].sa_data_func,
367 bulk[i].sa_addr, bulk[i].sa_data,
368 bulk[i].sa_size);
369 }
370 continue;
371
372 case SA_UPDATE:
373 /* existing rewrite of attr */
374 if (bulk[i].sa_addr &&
375 bulk[i].sa_size == bulk[i].sa_length) {
376 SA_COPY_DATA(bulk[i].sa_data_func,
377 bulk[i].sa_data, bulk[i].sa_addr,
378 bulk[i].sa_length);
379 continue;
380 } else if (bulk[i].sa_addr) { /* attr size change */
381 error = sa_modify_attrs(hdl, bulk[i].sa_attr,
382 SA_REPLACE, bulk[i].sa_data_func,
383 bulk[i].sa_data, bulk[i].sa_length, tx);
384 } else { /* adding new attribute */
385 error = sa_modify_attrs(hdl, bulk[i].sa_attr,
386 SA_ADD, bulk[i].sa_data_func,
387 bulk[i].sa_data, bulk[i].sa_length, tx);
388 }
389 if (error)
390 return (error);
391 break;
392 }
393 }
394 return (error);
395 }
396
397 static sa_lot_t *
sa_add_layout_entry(objset_t * os,sa_attr_type_t * attrs,int attr_count,uint64_t lot_num,uint64_t hash,boolean_t zapadd,dmu_tx_t * tx)398 sa_add_layout_entry(objset_t *os, sa_attr_type_t *attrs, int attr_count,
399 uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx)
400 {
401 sa_os_t *sa = os->os_sa;
402 sa_lot_t *tb, *findtb;
403 int i;
404 avl_index_t loc;
405
406 ASSERT(MUTEX_HELD(&sa->sa_lock));
407 tb = kmem_zalloc(sizeof (sa_lot_t), KM_SLEEP);
408 tb->lot_attr_count = attr_count;
409 tb->lot_attrs = kmem_alloc(sizeof (sa_attr_type_t) * attr_count,
410 KM_SLEEP);
411 bcopy(attrs, tb->lot_attrs, sizeof (sa_attr_type_t) * attr_count);
412 tb->lot_num = lot_num;
413 tb->lot_hash = hash;
414 tb->lot_instance = 0;
415
416 if (zapadd) {
417 char attr_name[8];
418
419 if (sa->sa_layout_attr_obj == 0) {
420 sa->sa_layout_attr_obj = zap_create_link(os,
421 DMU_OT_SA_ATTR_LAYOUTS,
422 sa->sa_master_obj, SA_LAYOUTS, tx);
423 }
424
425 (void) snprintf(attr_name, sizeof (attr_name),
426 "%d", (int)lot_num);
427 VERIFY(0 == zap_update(os, os->os_sa->sa_layout_attr_obj,
428 attr_name, 2, attr_count, attrs, tx));
429 }
430
431 list_create(&tb->lot_idx_tab, sizeof (sa_idx_tab_t),
432 offsetof(sa_idx_tab_t, sa_next));
433
434 for (i = 0; i != attr_count; i++) {
435 if (sa->sa_attr_table[tb->lot_attrs[i]].sa_length == 0)
436 tb->lot_var_sizes++;
437 }
438
439 avl_add(&sa->sa_layout_num_tree, tb);
440
441 /* verify we don't have a hash collision */
442 if ((findtb = avl_find(&sa->sa_layout_hash_tree, tb, &loc)) != NULL) {
443 for (; findtb && findtb->lot_hash == hash;
444 findtb = AVL_NEXT(&sa->sa_layout_hash_tree, findtb)) {
445 if (findtb->lot_instance != tb->lot_instance)
446 break;
447 tb->lot_instance++;
448 }
449 }
450 avl_add(&sa->sa_layout_hash_tree, tb);
451 return (tb);
452 }
453
454 static void
sa_find_layout(objset_t * os,uint64_t hash,sa_attr_type_t * attrs,int count,dmu_tx_t * tx,sa_lot_t ** lot)455 sa_find_layout(objset_t *os, uint64_t hash, sa_attr_type_t *attrs,
456 int count, dmu_tx_t *tx, sa_lot_t **lot)
457 {
458 sa_lot_t *tb, tbsearch;
459 avl_index_t loc;
460 sa_os_t *sa = os->os_sa;
461 boolean_t found = B_FALSE;
462
463 mutex_enter(&sa->sa_lock);
464 tbsearch.lot_hash = hash;
465 tbsearch.lot_instance = 0;
466 tb = avl_find(&sa->sa_layout_hash_tree, &tbsearch, &loc);
467 if (tb) {
468 for (; tb && tb->lot_hash == hash;
469 tb = AVL_NEXT(&sa->sa_layout_hash_tree, tb)) {
470 if (sa_layout_equal(tb, attrs, count) == 0) {
471 found = B_TRUE;
472 break;
473 }
474 }
475 }
476 if (!found) {
477 tb = sa_add_layout_entry(os, attrs, count,
478 avl_numnodes(&sa->sa_layout_num_tree), hash, B_TRUE, tx);
479 }
480 mutex_exit(&sa->sa_lock);
481 *lot = tb;
482 }
483
484 static int
sa_resize_spill(sa_handle_t * hdl,uint32_t size,dmu_tx_t * tx)485 sa_resize_spill(sa_handle_t *hdl, uint32_t size, dmu_tx_t *tx)
486 {
487 int error;
488 uint32_t blocksize;
489
490 if (size == 0) {
491 blocksize = SPA_MINBLOCKSIZE;
492 } else if (size > SPA_OLD_MAXBLOCKSIZE) {
493 ASSERT(0);
494 return (SET_ERROR(EFBIG));
495 } else {
496 blocksize = P2ROUNDUP_TYPED(size, SPA_MINBLOCKSIZE, uint32_t);
497 }
498
499 error = dbuf_spill_set_blksz(hdl->sa_spill, blocksize, tx);
500 ASSERT(error == 0);
501 return (error);
502 }
503
504 static void
sa_copy_data(sa_data_locator_t * func,void * datastart,void * target,int buflen)505 sa_copy_data(sa_data_locator_t *func, void *datastart, void *target, int buflen)
506 {
507 if (func == NULL) {
508 bcopy(datastart, target, buflen);
509 } else {
510 boolean_t start;
511 int bytes;
512 void *dataptr;
513 void *saptr = target;
514 uint32_t length;
515
516 start = B_TRUE;
517 bytes = 0;
518 while (bytes < buflen) {
519 func(&dataptr, &length, buflen, start, datastart);
520 bcopy(dataptr, saptr, length);
521 saptr = (void *)((caddr_t)saptr + length);
522 bytes += length;
523 start = B_FALSE;
524 }
525 }
526 }
527
528 /*
529 * Determine several different sizes
530 * first the sa header size
531 * the number of bytes to be stored
532 * if spill would occur the index in the attribute array is returned
533 *
534 * the boolean will_spill will be set when spilling is necessary. It
535 * is only set when the buftype is SA_BONUS
536 */
537 static int
sa_find_sizes(sa_os_t * sa,sa_bulk_attr_t * attr_desc,int attr_count,dmu_buf_t * db,sa_buf_type_t buftype,int full_space,int * index,int * total,boolean_t * will_spill)538 sa_find_sizes(sa_os_t *sa, sa_bulk_attr_t *attr_desc, int attr_count,
539 dmu_buf_t *db, sa_buf_type_t buftype, int full_space, int *index,
540 int *total, boolean_t *will_spill)
541 {
542 int var_size = 0;
543 int i;
544 int hdrsize;
545 int extra_hdrsize;
546
547 if (buftype == SA_BONUS && sa->sa_force_spill) {
548 *total = 0;
549 *index = 0;
550 *will_spill = B_TRUE;
551 return (0);
552 }
553
554 *index = -1;
555 *total = 0;
556 *will_spill = B_FALSE;
557
558 extra_hdrsize = 0;
559 hdrsize = (SA_BONUSTYPE_FROM_DB(db) == DMU_OT_ZNODE) ? 0 :
560 sizeof (sa_hdr_phys_t);
561
562 ASSERT(IS_P2ALIGNED(full_space, 8));
563
564 for (i = 0; i != attr_count; i++) {
565 boolean_t is_var_sz;
566
567 *total = P2ROUNDUP(*total, 8);
568 *total += attr_desc[i].sa_length;
569 if (*will_spill)
570 continue;
571
572 is_var_sz = (SA_REGISTERED_LEN(sa, attr_desc[i].sa_attr) == 0);
573 if (is_var_sz) {
574 var_size++;
575 }
576
577 if (is_var_sz && var_size > 1) {
578 /*
579 * Don't worry that the spill block might overflow.
580 * It will be resized if needed in sa_build_layouts().
581 */
582 if (buftype == SA_SPILL ||
583 P2ROUNDUP(hdrsize + sizeof (uint16_t), 8) +
584 *total < full_space) {
585 /*
586 * Account for header space used by array of
587 * optional sizes of variable-length attributes.
588 * Record the extra header size in case this
589 * increase needs to be reversed due to
590 * spill-over.
591 */
592 hdrsize += sizeof (uint16_t);
593 if (*index != -1)
594 extra_hdrsize += sizeof (uint16_t);
595 } else {
596 ASSERT(buftype == SA_BONUS);
597 if (*index == -1)
598 *index = i;
599 *will_spill = B_TRUE;
600 continue;
601 }
602 }
603
604 /*
605 * find index of where spill *could* occur.
606 * Then continue to count of remainder attribute
607 * space. The sum is used later for sizing bonus
608 * and spill buffer.
609 */
610 if (buftype == SA_BONUS && *index == -1 &&
611 (*total + P2ROUNDUP(hdrsize, 8)) >
612 (full_space - sizeof (blkptr_t))) {
613 *index = i;
614 }
615
616 if ((*total + P2ROUNDUP(hdrsize, 8)) > full_space &&
617 buftype == SA_BONUS)
618 *will_spill = B_TRUE;
619 }
620
621 if (*will_spill)
622 hdrsize -= extra_hdrsize;
623
624 hdrsize = P2ROUNDUP(hdrsize, 8);
625 return (hdrsize);
626 }
627
628 #define BUF_SPACE_NEEDED(total, header) (total + header)
629
630 /*
631 * Find layout that corresponds to ordering of attributes
632 * If not found a new layout number is created and added to
633 * persistent layout tables.
634 */
635 static int
sa_build_layouts(sa_handle_t * hdl,sa_bulk_attr_t * attr_desc,int attr_count,dmu_tx_t * tx)636 sa_build_layouts(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc, int attr_count,
637 dmu_tx_t *tx)
638 {
639 sa_os_t *sa = hdl->sa_os->os_sa;
640 uint64_t hash;
641 sa_buf_type_t buftype;
642 sa_hdr_phys_t *sahdr;
643 void *data_start;
644 int buf_space;
645 sa_attr_type_t *attrs, *attrs_start;
646 int i, lot_count;
647 int dnodesize;
648 int hdrsize;
649 int spillhdrsize = 0;
650 int used;
651 dmu_object_type_t bonustype;
652 sa_lot_t *lot;
653 int len_idx;
654 int spill_used;
655 int bonuslen;
656 boolean_t spilling;
657
658 dmu_buf_will_dirty(hdl->sa_bonus, tx);
659 bonustype = SA_BONUSTYPE_FROM_DB(hdl->sa_bonus);
660 dmu_object_dnsize_from_db(hdl->sa_bonus, &dnodesize);
661 bonuslen = DN_BONUS_SIZE(dnodesize);
662
663 dmu_object_dnsize_from_db(hdl->sa_bonus, &dnodesize);
664 bonuslen = DN_BONUS_SIZE(dnodesize);
665
666 /* first determine bonus header size and sum of all attributes */
667 hdrsize = sa_find_sizes(sa, attr_desc, attr_count, hdl->sa_bonus,
668 SA_BONUS, bonuslen, &i, &used, &spilling);
669
670 if (used > SPA_OLD_MAXBLOCKSIZE)
671 return (SET_ERROR(EFBIG));
672
673 VERIFY(0 == dmu_set_bonus(hdl->sa_bonus, spilling ?
674 MIN(bonuslen - sizeof (blkptr_t), used + hdrsize) :
675 used + hdrsize, tx));
676
677 ASSERT((bonustype == DMU_OT_ZNODE && spilling == 0) ||
678 bonustype == DMU_OT_SA);
679
680 /* setup and size spill buffer when needed */
681 if (spilling) {
682 boolean_t dummy;
683
684 if (hdl->sa_spill == NULL) {
685 VERIFY(dmu_spill_hold_by_bonus(hdl->sa_bonus, NULL,
686 &hdl->sa_spill) == 0);
687 }
688 dmu_buf_will_dirty(hdl->sa_spill, tx);
689
690 spillhdrsize = sa_find_sizes(sa, &attr_desc[i],
691 attr_count - i, hdl->sa_spill, SA_SPILL,
692 hdl->sa_spill->db_size, &i, &spill_used, &dummy);
693
694 if (spill_used > SPA_OLD_MAXBLOCKSIZE)
695 return (SET_ERROR(EFBIG));
696
697 buf_space = hdl->sa_spill->db_size - spillhdrsize;
698 if (BUF_SPACE_NEEDED(spill_used, spillhdrsize) >
699 hdl->sa_spill->db_size)
700 VERIFY(0 == sa_resize_spill(hdl,
701 BUF_SPACE_NEEDED(spill_used, spillhdrsize), tx));
702 }
703
704 /* setup starting pointers to lay down data */
705 data_start = (void *)((uintptr_t)hdl->sa_bonus->db_data + hdrsize);
706 sahdr = (sa_hdr_phys_t *)hdl->sa_bonus->db_data;
707 buftype = SA_BONUS;
708
709 if (spilling)
710 buf_space = (sa->sa_force_spill) ?
711 0 : SA_BLKPTR_SPACE - hdrsize;
712 else
713 buf_space = hdl->sa_bonus->db_size - hdrsize;
714
715 attrs_start = attrs = kmem_alloc(sizeof (sa_attr_type_t) * attr_count,
716 KM_SLEEP);
717 lot_count = 0;
718
719 for (i = 0, len_idx = 0, hash = -1ULL; i != attr_count; i++) {
720 uint16_t length;
721
722 ASSERT(IS_P2ALIGNED(data_start, 8));
723 ASSERT(IS_P2ALIGNED(buf_space, 8));
724 attrs[i] = attr_desc[i].sa_attr;
725 length = SA_REGISTERED_LEN(sa, attrs[i]);
726 if (length == 0)
727 length = attr_desc[i].sa_length;
728 else
729 VERIFY(length == attr_desc[i].sa_length);
730
731 if (buf_space < length) { /* switch to spill buffer */
732 VERIFY(spilling);
733 VERIFY(bonustype == DMU_OT_SA);
734 if (buftype == SA_BONUS && !sa->sa_force_spill) {
735 sa_find_layout(hdl->sa_os, hash, attrs_start,
736 lot_count, tx, &lot);
737 SA_SET_HDR(sahdr, lot->lot_num, hdrsize);
738 }
739
740 buftype = SA_SPILL;
741 hash = -1ULL;
742 len_idx = 0;
743
744 sahdr = (sa_hdr_phys_t *)hdl->sa_spill->db_data;
745 sahdr->sa_magic = SA_MAGIC;
746 data_start = (void *)((uintptr_t)sahdr +
747 spillhdrsize);
748 attrs_start = &attrs[i];
749 buf_space = hdl->sa_spill->db_size - spillhdrsize;
750 lot_count = 0;
751 }
752 hash ^= SA_ATTR_HASH(attrs[i]);
753 attr_desc[i].sa_addr = data_start;
754 attr_desc[i].sa_size = length;
755 SA_COPY_DATA(attr_desc[i].sa_data_func, attr_desc[i].sa_data,
756 data_start, length);
757 if (sa->sa_attr_table[attrs[i]].sa_length == 0) {
758 sahdr->sa_lengths[len_idx++] = length;
759 }
760 VERIFY((uintptr_t)data_start % 8 == 0);
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
sa_free_attr_table(sa_os_t * sa)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
sa_attr_table_setup(objset_t * os,sa_attr_reg_t * reg_attrs,int count)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
sa_setup(objset_t * os,uint64_t sa_obj,sa_attr_reg_t * reg_attrs,int count,sa_attr_type_t ** user_table)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
sa_tear_down(objset_t * os)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(zfs_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
sa_build_idx_tab(void * hdr,void * attr_addr,sa_attr_type_t attr,uint16_t length,int length_idx,boolean_t var_length,void * userp)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
sa_attr_iter(objset_t * os,sa_hdr_phys_t * hdr,dmu_object_type_t type,sa_iterfunc_t func,sa_lot_t * tab,void * userp)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
sa_byteswap_cb(void * hdr,void * attr_addr,sa_attr_type_t attr,uint16_t length,int length_idx,boolean_t variable_length,void * userp)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
sa_byteswap(sa_handle_t * hdl,sa_buf_type_t buftype)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
sa_build_index(sa_handle_t * hdl,sa_buf_type_t buftype)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
sa_evict_sync(void * dbu)1300 sa_evict_sync(void *dbu)
1301 {
1302 panic("evicting sa dbuf\n");
1303 }
1304
1305 static void
sa_idx_tab_rele(objset_t * os,void * arg)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 (zfs_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 zfs_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
sa_idx_tab_hold(objset_t * os,sa_idx_tab_t * idx_tab)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) zfs_refcount_add(&idx_tab->sa_refcount, NULL);
1336 }
1337
1338 void
sa_handle_destroy(sa_handle_t * hdl)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
sa_handle_get_from_db(objset_t * os,dmu_buf_t * db,void * userp,sa_handle_type_t hdl_type,sa_handle_t ** handlepp)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_sync = NULL;
1385 handle->sa_dbu.dbu_evict_func_async = NULL;
1386 handle->sa_userp = userp;
1387 handle->sa_bonus = db;
1388 handle->sa_os = os;
1389 handle->sa_spill = NULL;
1390 handle->sa_bonus_tab = NULL;
1391 handle->sa_spill_tab = NULL;
1392
1393 error = sa_build_index(handle, SA_BONUS);
1394
1395 if (hdl_type == SA_HDL_SHARED) {
1396 dmu_buf_init_user(&handle->sa_dbu, sa_evict_sync, NULL,
1397 NULL);
1398 winner = dmu_buf_set_user_ie(db, &handle->sa_dbu);
1399 }
1400
1401 if (winner != NULL) {
1402 kmem_cache_free(sa_cache, handle);
1403 handle = winner;
1404 }
1405 }
1406 *handlepp = handle;
1407
1408 return (error);
1409 }
1410
1411 int
sa_handle_get(objset_t * objset,uint64_t objid,void * userp,sa_handle_type_t hdl_type,sa_handle_t ** handlepp)1412 sa_handle_get(objset_t *objset, uint64_t objid, void *userp,
1413 sa_handle_type_t hdl_type, sa_handle_t **handlepp)
1414 {
1415 dmu_buf_t *db;
1416 int error;
1417
1418 if (error = dmu_bonus_hold(objset, objid, NULL, &db))
1419 return (error);
1420
1421 return (sa_handle_get_from_db(objset, db, userp, hdl_type,
1422 handlepp));
1423 }
1424
1425 int
sa_buf_hold(objset_t * objset,uint64_t obj_num,void * tag,dmu_buf_t ** db)1426 sa_buf_hold(objset_t *objset, uint64_t obj_num, void *tag, dmu_buf_t **db)
1427 {
1428 return (dmu_bonus_hold(objset, obj_num, tag, db));
1429 }
1430
1431 void
sa_buf_rele(dmu_buf_t * db,void * tag)1432 sa_buf_rele(dmu_buf_t *db, void *tag)
1433 {
1434 dmu_buf_rele(db, tag);
1435 }
1436
1437 int
sa_lookup_impl(sa_handle_t * hdl,sa_bulk_attr_t * bulk,int count)1438 sa_lookup_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count)
1439 {
1440 ASSERT(hdl);
1441 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1442 return (sa_attr_op(hdl, bulk, count, SA_LOOKUP, NULL));
1443 }
1444
1445 int
sa_lookup(sa_handle_t * hdl,sa_attr_type_t attr,void * buf,uint32_t buflen)1446 sa_lookup(sa_handle_t *hdl, sa_attr_type_t attr, void *buf, uint32_t buflen)
1447 {
1448 int error;
1449 sa_bulk_attr_t bulk;
1450
1451 bulk.sa_attr = attr;
1452 bulk.sa_data = buf;
1453 bulk.sa_length = buflen;
1454 bulk.sa_data_func = NULL;
1455
1456 ASSERT(hdl);
1457 mutex_enter(&hdl->sa_lock);
1458 error = sa_lookup_impl(hdl, &bulk, 1);
1459 mutex_exit(&hdl->sa_lock);
1460 return (error);
1461 }
1462
1463 #ifdef _KERNEL
1464 int
sa_lookup_uio(sa_handle_t * hdl,sa_attr_type_t attr,uio_t * uio)1465 sa_lookup_uio(sa_handle_t *hdl, sa_attr_type_t attr, uio_t *uio)
1466 {
1467 int error;
1468 sa_bulk_attr_t bulk;
1469
1470 bulk.sa_data = NULL;
1471 bulk.sa_attr = attr;
1472 bulk.sa_data_func = NULL;
1473
1474 ASSERT(hdl);
1475
1476 mutex_enter(&hdl->sa_lock);
1477 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) == 0) {
1478 error = uiomove((void *)bulk.sa_addr, MIN(bulk.sa_size,
1479 uio->uio_resid), UIO_READ, uio);
1480 }
1481 mutex_exit(&hdl->sa_lock);
1482 return (error);
1483
1484 }
1485 #endif
1486
1487 static sa_idx_tab_t *
sa_find_idx_tab(objset_t * os,dmu_object_type_t bonustype,sa_hdr_phys_t * hdr)1488 sa_find_idx_tab(objset_t *os, dmu_object_type_t bonustype, sa_hdr_phys_t *hdr)
1489 {
1490 sa_idx_tab_t *idx_tab;
1491 sa_os_t *sa = os->os_sa;
1492 sa_lot_t *tb, search;
1493 avl_index_t loc;
1494
1495 /*
1496 * Deterimine layout number. If SA node and header == 0 then
1497 * force the index table to the dummy "1" empty layout.
1498 *
1499 * The layout number would only be zero for a newly created file
1500 * that has not added any attributes yet, or with crypto enabled which
1501 * doesn't write any attributes to the bonus buffer.
1502 */
1503
1504 search.lot_num = SA_LAYOUT_NUM(hdr, bonustype);
1505
1506 tb = avl_find(&sa->sa_layout_num_tree, &search, &loc);
1507
1508 /* Verify header size is consistent with layout information */
1509 ASSERT(tb);
1510 ASSERT(IS_SA_BONUSTYPE(bonustype) &&
1511 SA_HDR_SIZE_MATCH_LAYOUT(hdr, tb) || !IS_SA_BONUSTYPE(bonustype) ||
1512 (IS_SA_BONUSTYPE(bonustype) && hdr->sa_layout_info == 0));
1513
1514 /*
1515 * See if any of the already existing TOC entries can be reused?
1516 */
1517
1518 for (idx_tab = list_head(&tb->lot_idx_tab); idx_tab;
1519 idx_tab = list_next(&tb->lot_idx_tab, idx_tab)) {
1520 boolean_t valid_idx = B_TRUE;
1521 int i;
1522
1523 if (tb->lot_var_sizes != 0 &&
1524 idx_tab->sa_variable_lengths != NULL) {
1525 for (i = 0; i != tb->lot_var_sizes; i++) {
1526 if (hdr->sa_lengths[i] !=
1527 idx_tab->sa_variable_lengths[i]) {
1528 valid_idx = B_FALSE;
1529 break;
1530 }
1531 }
1532 }
1533 if (valid_idx) {
1534 sa_idx_tab_hold(os, idx_tab);
1535 return (idx_tab);
1536 }
1537 }
1538
1539 /* No such luck, create a new entry */
1540 idx_tab = kmem_zalloc(sizeof (sa_idx_tab_t), KM_SLEEP);
1541 idx_tab->sa_idx_tab =
1542 kmem_zalloc(sizeof (uint32_t) * sa->sa_num_attrs, KM_SLEEP);
1543 idx_tab->sa_layout = tb;
1544 zfs_refcount_create(&idx_tab->sa_refcount);
1545 if (tb->lot_var_sizes)
1546 idx_tab->sa_variable_lengths = kmem_alloc(sizeof (uint16_t) *
1547 tb->lot_var_sizes, KM_SLEEP);
1548
1549 sa_attr_iter(os, hdr, bonustype, sa_build_idx_tab,
1550 tb, idx_tab);
1551 sa_idx_tab_hold(os, idx_tab); /* one hold for consumer */
1552 sa_idx_tab_hold(os, idx_tab); /* one for layout */
1553 list_insert_tail(&tb->lot_idx_tab, idx_tab);
1554 return (idx_tab);
1555 }
1556
1557 void
sa_default_locator(void ** dataptr,uint32_t * len,uint32_t total_len,boolean_t start,void * userdata)1558 sa_default_locator(void **dataptr, uint32_t *len, uint32_t total_len,
1559 boolean_t start, void *userdata)
1560 {
1561 ASSERT(start);
1562
1563 *dataptr = userdata;
1564 *len = total_len;
1565 }
1566
1567 static void
sa_attr_register_sync(sa_handle_t * hdl,dmu_tx_t * tx)1568 sa_attr_register_sync(sa_handle_t *hdl, dmu_tx_t *tx)
1569 {
1570 uint64_t attr_value = 0;
1571 sa_os_t *sa = hdl->sa_os->os_sa;
1572 sa_attr_table_t *tb = sa->sa_attr_table;
1573 int i;
1574
1575 mutex_enter(&sa->sa_lock);
1576
1577 if (!sa->sa_need_attr_registration || sa->sa_master_obj == 0) {
1578 mutex_exit(&sa->sa_lock);
1579 return;
1580 }
1581
1582 if (sa->sa_reg_attr_obj == 0) {
1583 sa->sa_reg_attr_obj = zap_create_link(hdl->sa_os,
1584 DMU_OT_SA_ATTR_REGISTRATION,
1585 sa->sa_master_obj, SA_REGISTRY, tx);
1586 }
1587 for (i = 0; i != sa->sa_num_attrs; i++) {
1588 if (sa->sa_attr_table[i].sa_registered)
1589 continue;
1590 ATTR_ENCODE(attr_value, tb[i].sa_attr, tb[i].sa_length,
1591 tb[i].sa_byteswap);
1592 VERIFY(0 == zap_update(hdl->sa_os, sa->sa_reg_attr_obj,
1593 tb[i].sa_name, 8, 1, &attr_value, tx));
1594 tb[i].sa_registered = B_TRUE;
1595 }
1596 sa->sa_need_attr_registration = B_FALSE;
1597 mutex_exit(&sa->sa_lock);
1598 }
1599
1600 /*
1601 * Replace all attributes with attributes specified in template.
1602 * If dnode had a spill buffer then those attributes will be
1603 * also be replaced, possibly with just an empty spill block
1604 *
1605 * This interface is intended to only be used for bulk adding of
1606 * attributes for a new file. It will also be used by the ZPL
1607 * when converting and old formatted znode to native SA support.
1608 */
1609 int
sa_replace_all_by_template_locked(sa_handle_t * hdl,sa_bulk_attr_t * attr_desc,int attr_count,dmu_tx_t * tx)1610 sa_replace_all_by_template_locked(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc,
1611 int attr_count, dmu_tx_t *tx)
1612 {
1613 sa_os_t *sa = hdl->sa_os->os_sa;
1614
1615 if (sa->sa_need_attr_registration)
1616 sa_attr_register_sync(hdl, tx);
1617 return (sa_build_layouts(hdl, attr_desc, attr_count, tx));
1618 }
1619
1620 int
sa_replace_all_by_template(sa_handle_t * hdl,sa_bulk_attr_t * attr_desc,int attr_count,dmu_tx_t * tx)1621 sa_replace_all_by_template(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc,
1622 int attr_count, dmu_tx_t *tx)
1623 {
1624 int error;
1625
1626 mutex_enter(&hdl->sa_lock);
1627 error = sa_replace_all_by_template_locked(hdl, attr_desc,
1628 attr_count, tx);
1629 mutex_exit(&hdl->sa_lock);
1630 return (error);
1631 }
1632
1633 /*
1634 * Add/remove a single attribute or replace a variable-sized attribute value
1635 * with a value of a different size, and then rewrite the entire set
1636 * of attributes.
1637 * Same-length attribute value replacement (including fixed-length attributes)
1638 * is handled more efficiently by the upper layers.
1639 */
1640 static int
sa_modify_attrs(sa_handle_t * hdl,sa_attr_type_t newattr,sa_data_op_t action,sa_data_locator_t * locator,void * datastart,uint16_t buflen,dmu_tx_t * tx)1641 sa_modify_attrs(sa_handle_t *hdl, sa_attr_type_t newattr,
1642 sa_data_op_t action, sa_data_locator_t *locator, void *datastart,
1643 uint16_t buflen, dmu_tx_t *tx)
1644 {
1645 sa_os_t *sa = hdl->sa_os->os_sa;
1646 dmu_buf_impl_t *db = (dmu_buf_impl_t *)hdl->sa_bonus;
1647 dnode_t *dn;
1648 sa_bulk_attr_t *attr_desc;
1649 void *old_data[2];
1650 int bonus_attr_count = 0;
1651 int bonus_data_size = 0;
1652 int spill_data_size = 0;
1653 int spill_attr_count = 0;
1654 int error;
1655 uint16_t length, reg_length;
1656 int i, j, k, length_idx;
1657 sa_hdr_phys_t *hdr;
1658 sa_idx_tab_t *idx_tab;
1659 int attr_count;
1660 int count;
1661
1662 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1663
1664 /* First make of copy of the old data */
1665
1666 DB_DNODE_ENTER(db);
1667 dn = DB_DNODE(db);
1668 if (dn->dn_bonuslen != 0) {
1669 bonus_data_size = hdl->sa_bonus->db_size;
1670 old_data[0] = kmem_alloc(bonus_data_size, KM_SLEEP);
1671 bcopy(hdl->sa_bonus->db_data, old_data[0],
1672 hdl->sa_bonus->db_size);
1673 bonus_attr_count = hdl->sa_bonus_tab->sa_layout->lot_attr_count;
1674 } else {
1675 old_data[0] = NULL;
1676 }
1677 DB_DNODE_EXIT(db);
1678
1679 /* Bring spill buffer online if it isn't currently */
1680
1681 if ((error = sa_get_spill(hdl)) == 0) {
1682 spill_data_size = hdl->sa_spill->db_size;
1683 old_data[1] = kmem_alloc(spill_data_size, KM_SLEEP);
1684 bcopy(hdl->sa_spill->db_data, old_data[1],
1685 hdl->sa_spill->db_size);
1686 spill_attr_count =
1687 hdl->sa_spill_tab->sa_layout->lot_attr_count;
1688 } else if (error && error != ENOENT) {
1689 if (old_data[0])
1690 kmem_free(old_data[0], bonus_data_size);
1691 return (error);
1692 } else {
1693 old_data[1] = NULL;
1694 }
1695
1696 /* build descriptor of all attributes */
1697
1698 attr_count = bonus_attr_count + spill_attr_count;
1699 if (action == SA_ADD)
1700 attr_count++;
1701 else if (action == SA_REMOVE)
1702 attr_count--;
1703
1704 attr_desc = kmem_zalloc(sizeof (sa_bulk_attr_t) * attr_count, KM_SLEEP);
1705
1706 /*
1707 * loop through bonus and spill buffer if it exists, and
1708 * build up new attr_descriptor to reset the attributes
1709 */
1710 k = j = 0;
1711 count = bonus_attr_count;
1712 hdr = SA_GET_HDR(hdl, SA_BONUS);
1713 idx_tab = SA_IDX_TAB_GET(hdl, SA_BONUS);
1714 for (; k != 2; k++) {
1715 /*
1716 * Iterate over each attribute in layout. Fetch the
1717 * size of variable-length attributes needing rewrite
1718 * from sa_lengths[].
1719 */
1720 for (i = 0, length_idx = 0; i != count; i++) {
1721 sa_attr_type_t attr;
1722
1723 attr = idx_tab->sa_layout->lot_attrs[i];
1724 reg_length = SA_REGISTERED_LEN(sa, attr);
1725 if (reg_length == 0) {
1726 length = hdr->sa_lengths[length_idx];
1727 length_idx++;
1728 } else {
1729 length = reg_length;
1730 }
1731 if (attr == newattr) {
1732 /*
1733 * There is nothing to do for SA_REMOVE,
1734 * so it is just skipped.
1735 */
1736 if (action == SA_REMOVE)
1737 continue;
1738
1739 /*
1740 * Duplicate attributes are not allowed, so the
1741 * action can not be SA_ADD here.
1742 */
1743 ASSERT3S(action, ==, SA_REPLACE);
1744
1745 /*
1746 * Only a variable-sized attribute can be
1747 * replaced here, and its size must be changing.
1748 */
1749 ASSERT3U(reg_length, ==, 0);
1750 ASSERT3U(length, !=, buflen);
1751 SA_ADD_BULK_ATTR(attr_desc, j, attr,
1752 locator, datastart, buflen);
1753 } else {
1754 SA_ADD_BULK_ATTR(attr_desc, j, attr,
1755 NULL, (void *)
1756 (TOC_OFF(idx_tab->sa_idx_tab[attr]) +
1757 (uintptr_t)old_data[k]), length);
1758 }
1759 }
1760 if (k == 0 && hdl->sa_spill) {
1761 hdr = SA_GET_HDR(hdl, SA_SPILL);
1762 idx_tab = SA_IDX_TAB_GET(hdl, SA_SPILL);
1763 count = spill_attr_count;
1764 } else {
1765 break;
1766 }
1767 }
1768 if (action == SA_ADD) {
1769 reg_length = SA_REGISTERED_LEN(sa, newattr);
1770 IMPLY(reg_length != 0, reg_length == buflen);
1771 SA_ADD_BULK_ATTR(attr_desc, j, newattr, locator,
1772 datastart, buflen);
1773 }
1774 ASSERT3U(j, ==, attr_count);
1775
1776 error = sa_build_layouts(hdl, attr_desc, attr_count, tx);
1777
1778 if (old_data[0])
1779 kmem_free(old_data[0], bonus_data_size);
1780 if (old_data[1])
1781 kmem_free(old_data[1], spill_data_size);
1782 kmem_free(attr_desc, sizeof (sa_bulk_attr_t) * attr_count);
1783
1784 return (error);
1785 }
1786
1787 static int
sa_bulk_update_impl(sa_handle_t * hdl,sa_bulk_attr_t * bulk,int count,dmu_tx_t * tx)1788 sa_bulk_update_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count,
1789 dmu_tx_t *tx)
1790 {
1791 int error;
1792 sa_os_t *sa = hdl->sa_os->os_sa;
1793 dmu_object_type_t bonustype;
1794
1795 bonustype = SA_BONUSTYPE_FROM_DB(SA_GET_DB(hdl, SA_BONUS));
1796
1797 ASSERT(hdl);
1798 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1799
1800 /* sync out registration table if necessary */
1801 if (sa->sa_need_attr_registration)
1802 sa_attr_register_sync(hdl, tx);
1803
1804 error = sa_attr_op(hdl, bulk, count, SA_UPDATE, tx);
1805 if (error == 0 && !IS_SA_BONUSTYPE(bonustype) && sa->sa_update_cb)
1806 sa->sa_update_cb(hdl, tx);
1807
1808 return (error);
1809 }
1810
1811 /*
1812 * update or add new attribute
1813 */
1814 int
sa_update(sa_handle_t * hdl,sa_attr_type_t type,void * buf,uint32_t buflen,dmu_tx_t * tx)1815 sa_update(sa_handle_t *hdl, sa_attr_type_t type,
1816 void *buf, uint32_t buflen, dmu_tx_t *tx)
1817 {
1818 int error;
1819 sa_bulk_attr_t bulk;
1820
1821 bulk.sa_attr = type;
1822 bulk.sa_data_func = NULL;
1823 bulk.sa_length = buflen;
1824 bulk.sa_data = buf;
1825
1826 mutex_enter(&hdl->sa_lock);
1827 error = sa_bulk_update_impl(hdl, &bulk, 1, tx);
1828 mutex_exit(&hdl->sa_lock);
1829 return (error);
1830 }
1831
1832 int
sa_update_from_cb(sa_handle_t * hdl,sa_attr_type_t attr,uint32_t buflen,sa_data_locator_t * locator,void * userdata,dmu_tx_t * tx)1833 sa_update_from_cb(sa_handle_t *hdl, sa_attr_type_t attr,
1834 uint32_t buflen, sa_data_locator_t *locator, void *userdata, dmu_tx_t *tx)
1835 {
1836 int error;
1837 sa_bulk_attr_t bulk;
1838
1839 bulk.sa_attr = attr;
1840 bulk.sa_data = userdata;
1841 bulk.sa_data_func = locator;
1842 bulk.sa_length = buflen;
1843
1844 mutex_enter(&hdl->sa_lock);
1845 error = sa_bulk_update_impl(hdl, &bulk, 1, tx);
1846 mutex_exit(&hdl->sa_lock);
1847 return (error);
1848 }
1849
1850 /*
1851 * Return size of an attribute
1852 */
1853
1854 int
sa_size(sa_handle_t * hdl,sa_attr_type_t attr,int * size)1855 sa_size(sa_handle_t *hdl, sa_attr_type_t attr, int *size)
1856 {
1857 sa_bulk_attr_t bulk;
1858 int error;
1859
1860 bulk.sa_data = NULL;
1861 bulk.sa_attr = attr;
1862 bulk.sa_data_func = NULL;
1863
1864 ASSERT(hdl);
1865 mutex_enter(&hdl->sa_lock);
1866 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) != 0) {
1867 mutex_exit(&hdl->sa_lock);
1868 return (error);
1869 }
1870 *size = bulk.sa_size;
1871
1872 mutex_exit(&hdl->sa_lock);
1873 return (0);
1874 }
1875
1876 int
sa_bulk_lookup_locked(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count)1877 sa_bulk_lookup_locked(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count)
1878 {
1879 ASSERT(hdl);
1880 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1881 return (sa_lookup_impl(hdl, attrs, count));
1882 }
1883
1884 int
sa_bulk_lookup(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count)1885 sa_bulk_lookup(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count)
1886 {
1887 int error;
1888
1889 ASSERT(hdl);
1890 mutex_enter(&hdl->sa_lock);
1891 error = sa_bulk_lookup_locked(hdl, attrs, count);
1892 mutex_exit(&hdl->sa_lock);
1893 return (error);
1894 }
1895
1896 int
sa_bulk_update(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count,dmu_tx_t * tx)1897 sa_bulk_update(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count, dmu_tx_t *tx)
1898 {
1899 int error;
1900
1901 ASSERT(hdl);
1902 mutex_enter(&hdl->sa_lock);
1903 error = sa_bulk_update_impl(hdl, attrs, count, tx);
1904 mutex_exit(&hdl->sa_lock);
1905 return (error);
1906 }
1907
1908 int
sa_remove(sa_handle_t * hdl,sa_attr_type_t attr,dmu_tx_t * tx)1909 sa_remove(sa_handle_t *hdl, sa_attr_type_t attr, dmu_tx_t *tx)
1910 {
1911 int error;
1912
1913 mutex_enter(&hdl->sa_lock);
1914 error = sa_modify_attrs(hdl, attr, SA_REMOVE, NULL,
1915 NULL, 0, tx);
1916 mutex_exit(&hdl->sa_lock);
1917 return (error);
1918 }
1919
1920 void
sa_object_info(sa_handle_t * hdl,dmu_object_info_t * doi)1921 sa_object_info(sa_handle_t *hdl, dmu_object_info_t *doi)
1922 {
1923 dmu_object_info_from_db((dmu_buf_t *)hdl->sa_bonus, doi);
1924 }
1925
1926 void
sa_object_size(sa_handle_t * hdl,uint32_t * blksize,u_longlong_t * nblocks)1927 sa_object_size(sa_handle_t *hdl, uint32_t *blksize, u_longlong_t *nblocks)
1928 {
1929 dmu_object_size_from_db((dmu_buf_t *)hdl->sa_bonus,
1930 blksize, nblocks);
1931 }
1932
1933 void
sa_set_userp(sa_handle_t * hdl,void * ptr)1934 sa_set_userp(sa_handle_t *hdl, void *ptr)
1935 {
1936 hdl->sa_userp = ptr;
1937 }
1938
1939 dmu_buf_t *
sa_get_db(sa_handle_t * hdl)1940 sa_get_db(sa_handle_t *hdl)
1941 {
1942 return ((dmu_buf_t *)hdl->sa_bonus);
1943 }
1944
1945 void *
sa_get_userdata(sa_handle_t * hdl)1946 sa_get_userdata(sa_handle_t *hdl)
1947 {
1948 return (hdl->sa_userp);
1949 }
1950
1951 void
sa_register_update_callback_locked(objset_t * os,sa_update_cb_t * func)1952 sa_register_update_callback_locked(objset_t *os, sa_update_cb_t *func)
1953 {
1954 ASSERT(MUTEX_HELD(&os->os_sa->sa_lock));
1955 os->os_sa->sa_update_cb = func;
1956 }
1957
1958 void
sa_register_update_callback(objset_t * os,sa_update_cb_t * func)1959 sa_register_update_callback(objset_t *os, sa_update_cb_t *func)
1960 {
1961
1962 mutex_enter(&os->os_sa->sa_lock);
1963 sa_register_update_callback_locked(os, func);
1964 mutex_exit(&os->os_sa->sa_lock);
1965 }
1966
1967 uint64_t
sa_handle_object(sa_handle_t * hdl)1968 sa_handle_object(sa_handle_t *hdl)
1969 {
1970 return (hdl->sa_bonus->db_object);
1971 }
1972
1973 boolean_t
sa_enabled(objset_t * os)1974 sa_enabled(objset_t *os)
1975 {
1976 return (os->os_sa == NULL);
1977 }
1978
1979 int
sa_set_sa_object(objset_t * os,uint64_t sa_object)1980 sa_set_sa_object(objset_t *os, uint64_t sa_object)
1981 {
1982 sa_os_t *sa = os->os_sa;
1983
1984 if (sa->sa_master_obj)
1985 return (1);
1986
1987 sa->sa_master_obj = sa_object;
1988
1989 return (0);
1990 }
1991
1992 int
sa_hdrsize(void * arg)1993 sa_hdrsize(void *arg)
1994 {
1995 sa_hdr_phys_t *hdr = arg;
1996
1997 return (SA_HDR_SIZE(hdr));
1998 }
1999
2000 void
sa_handle_lock(sa_handle_t * hdl)2001 sa_handle_lock(sa_handle_t *hdl)
2002 {
2003 ASSERT(hdl);
2004 mutex_enter(&hdl->sa_lock);
2005 }
2006
2007 void
sa_handle_unlock(sa_handle_t * hdl)2008 sa_handle_unlock(sa_handle_t *hdl)
2009 {
2010 ASSERT(hdl);
2011 mutex_exit(&hdl->sa_lock);
2012 }
2013