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 /* first determine bonus header size and sum of all attributes */
664 hdrsize = sa_find_sizes(sa, attr_desc, attr_count, hdl->sa_bonus,
665 SA_BONUS, bonuslen, &i, &used, &spilling);
666
667 if (used > SPA_OLD_MAXBLOCKSIZE)
668 return (SET_ERROR(EFBIG));
669
670 VERIFY(0 == dmu_set_bonus(hdl->sa_bonus, spilling ?
671 MIN(bonuslen - sizeof (blkptr_t), used + hdrsize) :
672 used + hdrsize, tx));
673
674 ASSERT((bonustype == DMU_OT_ZNODE && spilling == 0) ||
675 bonustype == DMU_OT_SA);
676
677 /* setup and size spill buffer when needed */
678 if (spilling) {
679 boolean_t dummy;
680
681 if (hdl->sa_spill == NULL) {
682 VERIFY(dmu_spill_hold_by_bonus(hdl->sa_bonus, NULL,
683 &hdl->sa_spill) == 0);
684 }
685 dmu_buf_will_dirty(hdl->sa_spill, tx);
686
687 spillhdrsize = sa_find_sizes(sa, &attr_desc[i],
688 attr_count - i, hdl->sa_spill, SA_SPILL,
689 hdl->sa_spill->db_size, &i, &spill_used, &dummy);
690
691 if (spill_used > SPA_OLD_MAXBLOCKSIZE)
692 return (SET_ERROR(EFBIG));
693
694 buf_space = hdl->sa_spill->db_size - spillhdrsize;
695 if (BUF_SPACE_NEEDED(spill_used, spillhdrsize) >
696 hdl->sa_spill->db_size)
697 VERIFY(0 == sa_resize_spill(hdl,
698 BUF_SPACE_NEEDED(spill_used, spillhdrsize), tx));
699 }
700
701 /* setup starting pointers to lay down data */
702 data_start = (void *)((uintptr_t)hdl->sa_bonus->db_data + hdrsize);
703 sahdr = (sa_hdr_phys_t *)hdl->sa_bonus->db_data;
704 buftype = SA_BONUS;
705
706 if (spilling)
707 buf_space = (sa->sa_force_spill) ?
708 0 : SA_BLKPTR_SPACE - hdrsize;
709 else
710 buf_space = hdl->sa_bonus->db_size - hdrsize;
711
712 attrs_start = attrs = kmem_alloc(sizeof (sa_attr_type_t) * attr_count,
713 KM_SLEEP);
714 lot_count = 0;
715
716 for (i = 0, len_idx = 0, hash = -1ULL; i != attr_count; i++) {
717 uint16_t length;
718
719 ASSERT(IS_P2ALIGNED(data_start, 8));
720 ASSERT(IS_P2ALIGNED(buf_space, 8));
721 attrs[i] = attr_desc[i].sa_attr;
722 length = SA_REGISTERED_LEN(sa, attrs[i]);
723 if (length == 0)
724 length = attr_desc[i].sa_length;
725 else
726 VERIFY(length == attr_desc[i].sa_length);
727
728 if (buf_space < length) { /* switch to spill buffer */
729 VERIFY(spilling);
730 VERIFY(bonustype == DMU_OT_SA);
731 if (buftype == SA_BONUS && !sa->sa_force_spill) {
732 sa_find_layout(hdl->sa_os, hash, attrs_start,
733 lot_count, tx, &lot);
734 SA_SET_HDR(sahdr, lot->lot_num, hdrsize);
735 }
736
737 buftype = SA_SPILL;
738 hash = -1ULL;
739 len_idx = 0;
740
741 sahdr = (sa_hdr_phys_t *)hdl->sa_spill->db_data;
742 sahdr->sa_magic = SA_MAGIC;
743 data_start = (void *)((uintptr_t)sahdr +
744 spillhdrsize);
745 attrs_start = &attrs[i];
746 buf_space = hdl->sa_spill->db_size - spillhdrsize;
747 lot_count = 0;
748 }
749 hash ^= SA_ATTR_HASH(attrs[i]);
750 attr_desc[i].sa_addr = data_start;
751 attr_desc[i].sa_size = length;
752 SA_COPY_DATA(attr_desc[i].sa_data_func, attr_desc[i].sa_data,
753 data_start, length);
754 if (sa->sa_attr_table[attrs[i]].sa_length == 0) {
755 sahdr->sa_lengths[len_idx++] = length;
756 }
757 VERIFY((uintptr_t)data_start % 8 == 0);
758 data_start = (void *)P2ROUNDUP(((uintptr_t)data_start +
759 length), 8);
760 buf_space -= P2ROUNDUP(length, 8);
761 lot_count++;
762 }
763
764 sa_find_layout(hdl->sa_os, hash, attrs_start, lot_count, tx, &lot);
765
766 /*
767 * Verify that old znodes always have layout number 0.
768 * Must be DMU_OT_SA for arbitrary layouts
769 */
770 VERIFY((bonustype == DMU_OT_ZNODE && lot->lot_num == 0) ||
771 (bonustype == DMU_OT_SA && lot->lot_num > 1));
772
773 if (bonustype == DMU_OT_SA) {
774 SA_SET_HDR(sahdr, lot->lot_num,
775 buftype == SA_BONUS ? hdrsize : spillhdrsize);
776 }
777
778 kmem_free(attrs, sizeof (sa_attr_type_t) * attr_count);
779 if (hdl->sa_bonus_tab) {
780 sa_idx_tab_rele(hdl->sa_os, hdl->sa_bonus_tab);
781 hdl->sa_bonus_tab = NULL;
782 }
783 if (!sa->sa_force_spill)
784 VERIFY(0 == sa_build_index(hdl, SA_BONUS));
785 if (hdl->sa_spill) {
786 sa_idx_tab_rele(hdl->sa_os, hdl->sa_spill_tab);
787 if (!spilling) {
788 /*
789 * remove spill block that is no longer needed.
790 */
791 dmu_buf_rele(hdl->sa_spill, NULL);
792 hdl->sa_spill = NULL;
793 hdl->sa_spill_tab = NULL;
794 VERIFY(0 == dmu_rm_spill(hdl->sa_os,
795 sa_handle_object(hdl), tx));
796 } else {
797 VERIFY(0 == sa_build_index(hdl, SA_SPILL));
798 }
799 }
800
801 return (0);
802 }
803
804 static void
sa_free_attr_table(sa_os_t * sa)805 sa_free_attr_table(sa_os_t *sa)
806 {
807 int i;
808
809 if (sa->sa_attr_table == NULL)
810 return;
811
812 for (i = 0; i != sa->sa_num_attrs; i++) {
813 if (sa->sa_attr_table[i].sa_name)
814 kmem_free(sa->sa_attr_table[i].sa_name,
815 strlen(sa->sa_attr_table[i].sa_name) + 1);
816 }
817
818 kmem_free(sa->sa_attr_table,
819 sizeof (sa_attr_table_t) * sa->sa_num_attrs);
820
821 sa->sa_attr_table = NULL;
822 }
823
824 static int
sa_attr_table_setup(objset_t * os,sa_attr_reg_t * reg_attrs,int count)825 sa_attr_table_setup(objset_t *os, sa_attr_reg_t *reg_attrs, int count)
826 {
827 sa_os_t *sa = os->os_sa;
828 uint64_t sa_attr_count = 0;
829 uint64_t sa_reg_count = 0;
830 int error = 0;
831 uint64_t attr_value;
832 sa_attr_table_t *tb;
833 zap_cursor_t zc;
834 zap_attribute_t za;
835 int registered_count = 0;
836 int i;
837 dmu_objset_type_t ostype = dmu_objset_type(os);
838
839 sa->sa_user_table =
840 kmem_zalloc(count * sizeof (sa_attr_type_t), KM_SLEEP);
841 sa->sa_user_table_sz = count * sizeof (sa_attr_type_t);
842
843 if (sa->sa_reg_attr_obj != 0) {
844 error = zap_count(os, sa->sa_reg_attr_obj,
845 &sa_attr_count);
846
847 /*
848 * Make sure we retrieved a count and that it isn't zero
849 */
850 if (error || (error == 0 && sa_attr_count == 0)) {
851 if (error == 0)
852 error = SET_ERROR(EINVAL);
853 goto bail;
854 }
855 sa_reg_count = sa_attr_count;
856 }
857
858 if (ostype == DMU_OST_ZFS && sa_attr_count == 0)
859 sa_attr_count += sa_legacy_attr_count;
860
861 /* Allocate attribute numbers for attributes that aren't registered */
862 for (i = 0; i != count; i++) {
863 boolean_t found = B_FALSE;
864 int j;
865
866 if (ostype == DMU_OST_ZFS) {
867 for (j = 0; j != sa_legacy_attr_count; j++) {
868 if (strcmp(reg_attrs[i].sa_name,
869 sa_legacy_attrs[j].sa_name) == 0) {
870 sa->sa_user_table[i] =
871 sa_legacy_attrs[j].sa_attr;
872 found = B_TRUE;
873 }
874 }
875 }
876 if (found)
877 continue;
878
879 if (sa->sa_reg_attr_obj)
880 error = zap_lookup(os, sa->sa_reg_attr_obj,
881 reg_attrs[i].sa_name, 8, 1, &attr_value);
882 else
883 error = SET_ERROR(ENOENT);
884 switch (error) {
885 case ENOENT:
886 sa->sa_user_table[i] = (sa_attr_type_t)sa_attr_count;
887 sa_attr_count++;
888 break;
889 case 0:
890 sa->sa_user_table[i] = ATTR_NUM(attr_value);
891 break;
892 default:
893 goto bail;
894 }
895 }
896
897 sa->sa_num_attrs = sa_attr_count;
898 tb = sa->sa_attr_table =
899 kmem_zalloc(sizeof (sa_attr_table_t) * sa_attr_count, KM_SLEEP);
900
901 /*
902 * Attribute table is constructed from requested attribute list,
903 * previously foreign registered attributes, and also the legacy
904 * ZPL set of attributes.
905 */
906
907 if (sa->sa_reg_attr_obj) {
908 for (zap_cursor_init(&zc, os, sa->sa_reg_attr_obj);
909 (error = zap_cursor_retrieve(&zc, &za)) == 0;
910 zap_cursor_advance(&zc)) {
911 uint64_t value;
912 value = za.za_first_integer;
913
914 registered_count++;
915 tb[ATTR_NUM(value)].sa_attr = ATTR_NUM(value);
916 tb[ATTR_NUM(value)].sa_length = ATTR_LENGTH(value);
917 tb[ATTR_NUM(value)].sa_byteswap = ATTR_BSWAP(value);
918 tb[ATTR_NUM(value)].sa_registered = B_TRUE;
919
920 if (tb[ATTR_NUM(value)].sa_name) {
921 continue;
922 }
923 tb[ATTR_NUM(value)].sa_name =
924 kmem_zalloc(strlen(za.za_name) +1, KM_SLEEP);
925 (void) strlcpy(tb[ATTR_NUM(value)].sa_name, za.za_name,
926 strlen(za.za_name) +1);
927 }
928 zap_cursor_fini(&zc);
929 /*
930 * Make sure we processed the correct number of registered
931 * attributes
932 */
933 if (registered_count != sa_reg_count) {
934 ASSERT(error != 0);
935 goto bail;
936 }
937
938 }
939
940 if (ostype == DMU_OST_ZFS) {
941 for (i = 0; i != sa_legacy_attr_count; i++) {
942 if (tb[i].sa_name)
943 continue;
944 tb[i].sa_attr = sa_legacy_attrs[i].sa_attr;
945 tb[i].sa_length = sa_legacy_attrs[i].sa_length;
946 tb[i].sa_byteswap = sa_legacy_attrs[i].sa_byteswap;
947 tb[i].sa_registered = B_FALSE;
948 tb[i].sa_name =
949 kmem_zalloc(strlen(sa_legacy_attrs[i].sa_name) +1,
950 KM_SLEEP);
951 (void) strlcpy(tb[i].sa_name,
952 sa_legacy_attrs[i].sa_name,
953 strlen(sa_legacy_attrs[i].sa_name) + 1);
954 }
955 }
956
957 for (i = 0; i != count; i++) {
958 sa_attr_type_t attr_id;
959
960 attr_id = sa->sa_user_table[i];
961 if (tb[attr_id].sa_name)
962 continue;
963
964 tb[attr_id].sa_length = reg_attrs[i].sa_length;
965 tb[attr_id].sa_byteswap = reg_attrs[i].sa_byteswap;
966 tb[attr_id].sa_attr = attr_id;
967 tb[attr_id].sa_name =
968 kmem_zalloc(strlen(reg_attrs[i].sa_name) + 1, KM_SLEEP);
969 (void) strlcpy(tb[attr_id].sa_name, reg_attrs[i].sa_name,
970 strlen(reg_attrs[i].sa_name) + 1);
971 }
972
973 sa->sa_need_attr_registration =
974 (sa_attr_count != registered_count);
975
976 return (0);
977 bail:
978 kmem_free(sa->sa_user_table, count * sizeof (sa_attr_type_t));
979 sa->sa_user_table = NULL;
980 sa_free_attr_table(sa);
981 return ((error != 0) ? error : EINVAL);
982 }
983
984 int
sa_setup(objset_t * os,uint64_t sa_obj,sa_attr_reg_t * reg_attrs,int count,sa_attr_type_t ** user_table)985 sa_setup(objset_t *os, uint64_t sa_obj, sa_attr_reg_t *reg_attrs, int count,
986 sa_attr_type_t **user_table)
987 {
988 zap_cursor_t zc;
989 zap_attribute_t za;
990 sa_os_t *sa;
991 dmu_objset_type_t ostype = dmu_objset_type(os);
992 sa_attr_type_t *tb;
993 int error;
994
995 mutex_enter(&os->os_user_ptr_lock);
996 if (os->os_sa) {
997 mutex_enter(&os->os_sa->sa_lock);
998 mutex_exit(&os->os_user_ptr_lock);
999 tb = os->os_sa->sa_user_table;
1000 mutex_exit(&os->os_sa->sa_lock);
1001 *user_table = tb;
1002 return (0);
1003 }
1004
1005 sa = kmem_zalloc(sizeof (sa_os_t), KM_SLEEP);
1006 mutex_init(&sa->sa_lock, NULL, MUTEX_DEFAULT, NULL);
1007 sa->sa_master_obj = sa_obj;
1008
1009 os->os_sa = sa;
1010 mutex_enter(&sa->sa_lock);
1011 mutex_exit(&os->os_user_ptr_lock);
1012 avl_create(&sa->sa_layout_num_tree, layout_num_compare,
1013 sizeof (sa_lot_t), offsetof(sa_lot_t, lot_num_node));
1014 avl_create(&sa->sa_layout_hash_tree, layout_hash_compare,
1015 sizeof (sa_lot_t), offsetof(sa_lot_t, lot_hash_node));
1016
1017 if (sa_obj) {
1018 error = zap_lookup(os, sa_obj, SA_LAYOUTS,
1019 8, 1, &sa->sa_layout_attr_obj);
1020 if (error != 0 && error != ENOENT)
1021 goto fail;
1022 error = zap_lookup(os, sa_obj, SA_REGISTRY,
1023 8, 1, &sa->sa_reg_attr_obj);
1024 if (error != 0 && error != ENOENT)
1025 goto fail;
1026 }
1027
1028 if ((error = sa_attr_table_setup(os, reg_attrs, count)) != 0)
1029 goto fail;
1030
1031 if (sa->sa_layout_attr_obj != 0) {
1032 uint64_t layout_count;
1033
1034 error = zap_count(os, sa->sa_layout_attr_obj,
1035 &layout_count);
1036
1037 /*
1038 * Layout number count should be > 0
1039 */
1040 if (error || (error == 0 && layout_count == 0)) {
1041 if (error == 0)
1042 error = SET_ERROR(EINVAL);
1043 goto fail;
1044 }
1045
1046 for (zap_cursor_init(&zc, os, sa->sa_layout_attr_obj);
1047 (error = zap_cursor_retrieve(&zc, &za)) == 0;
1048 zap_cursor_advance(&zc)) {
1049 sa_attr_type_t *lot_attrs;
1050 uint64_t lot_num;
1051
1052 lot_attrs = kmem_zalloc(sizeof (sa_attr_type_t) *
1053 za.za_num_integers, KM_SLEEP);
1054
1055 if ((error = (zap_lookup(os, sa->sa_layout_attr_obj,
1056 za.za_name, 2, za.za_num_integers,
1057 lot_attrs))) != 0) {
1058 kmem_free(lot_attrs, sizeof (sa_attr_type_t) *
1059 za.za_num_integers);
1060 break;
1061 }
1062 VERIFY(ddi_strtoull(za.za_name, NULL, 10,
1063 (unsigned long long *)&lot_num) == 0);
1064
1065 (void) sa_add_layout_entry(os, lot_attrs,
1066 za.za_num_integers, lot_num,
1067 sa_layout_info_hash(lot_attrs,
1068 za.za_num_integers), B_FALSE, NULL);
1069 kmem_free(lot_attrs, sizeof (sa_attr_type_t) *
1070 za.za_num_integers);
1071 }
1072 zap_cursor_fini(&zc);
1073
1074 /*
1075 * Make sure layout count matches number of entries added
1076 * to AVL tree
1077 */
1078 if (avl_numnodes(&sa->sa_layout_num_tree) != layout_count) {
1079 ASSERT(error != 0);
1080 goto fail;
1081 }
1082 }
1083
1084 /* Add special layout number for old ZNODES */
1085 if (ostype == DMU_OST_ZFS) {
1086 (void) sa_add_layout_entry(os, sa_legacy_zpl_layout,
1087 sa_legacy_attr_count, 0,
1088 sa_layout_info_hash(sa_legacy_zpl_layout,
1089 sa_legacy_attr_count), B_FALSE, NULL);
1090
1091 (void) sa_add_layout_entry(os, sa_dummy_zpl_layout, 0, 1,
1092 0, B_FALSE, NULL);
1093 }
1094 *user_table = os->os_sa->sa_user_table;
1095 mutex_exit(&sa->sa_lock);
1096 return (0);
1097 fail:
1098 os->os_sa = NULL;
1099 sa_free_attr_table(sa);
1100 if (sa->sa_user_table)
1101 kmem_free(sa->sa_user_table, sa->sa_user_table_sz);
1102 mutex_exit(&sa->sa_lock);
1103 avl_destroy(&sa->sa_layout_hash_tree);
1104 avl_destroy(&sa->sa_layout_num_tree);
1105 mutex_destroy(&sa->sa_lock);
1106 kmem_free(sa, sizeof (sa_os_t));
1107 return ((error == ECKSUM) ? EIO : error);
1108 }
1109
1110 void
sa_tear_down(objset_t * os)1111 sa_tear_down(objset_t *os)
1112 {
1113 sa_os_t *sa = os->os_sa;
1114 sa_lot_t *layout;
1115 void *cookie;
1116
1117 kmem_free(sa->sa_user_table, sa->sa_user_table_sz);
1118
1119 /* Free up attr table */
1120
1121 sa_free_attr_table(sa);
1122
1123 cookie = NULL;
1124 while (layout = avl_destroy_nodes(&sa->sa_layout_hash_tree, &cookie)) {
1125 sa_idx_tab_t *tab;
1126 while (tab = list_head(&layout->lot_idx_tab)) {
1127 ASSERT(refcount_count(&tab->sa_refcount));
1128 sa_idx_tab_rele(os, tab);
1129 }
1130 }
1131
1132 cookie = NULL;
1133 while (layout = avl_destroy_nodes(&sa->sa_layout_num_tree, &cookie)) {
1134 kmem_free(layout->lot_attrs,
1135 sizeof (sa_attr_type_t) * layout->lot_attr_count);
1136 kmem_free(layout, sizeof (sa_lot_t));
1137 }
1138
1139 avl_destroy(&sa->sa_layout_hash_tree);
1140 avl_destroy(&sa->sa_layout_num_tree);
1141 mutex_destroy(&sa->sa_lock);
1142
1143 kmem_free(sa, sizeof (sa_os_t));
1144 os->os_sa = NULL;
1145 }
1146
1147 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)1148 sa_build_idx_tab(void *hdr, void *attr_addr, sa_attr_type_t attr,
1149 uint16_t length, int length_idx, boolean_t var_length, void *userp)
1150 {
1151 sa_idx_tab_t *idx_tab = userp;
1152
1153 if (var_length) {
1154 ASSERT(idx_tab->sa_variable_lengths);
1155 idx_tab->sa_variable_lengths[length_idx] = length;
1156 }
1157 TOC_ATTR_ENCODE(idx_tab->sa_idx_tab[attr], length_idx,
1158 (uint32_t)((uintptr_t)attr_addr - (uintptr_t)hdr));
1159 }
1160
1161 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)1162 sa_attr_iter(objset_t *os, sa_hdr_phys_t *hdr, dmu_object_type_t type,
1163 sa_iterfunc_t func, sa_lot_t *tab, void *userp)
1164 {
1165 void *data_start;
1166 sa_lot_t *tb = tab;
1167 sa_lot_t search;
1168 avl_index_t loc;
1169 sa_os_t *sa = os->os_sa;
1170 int i;
1171 uint16_t *length_start = NULL;
1172 uint8_t length_idx = 0;
1173
1174 if (tab == NULL) {
1175 search.lot_num = SA_LAYOUT_NUM(hdr, type);
1176 tb = avl_find(&sa->sa_layout_num_tree, &search, &loc);
1177 ASSERT(tb);
1178 }
1179
1180 if (IS_SA_BONUSTYPE(type)) {
1181 data_start = (void *)P2ROUNDUP(((uintptr_t)hdr +
1182 offsetof(sa_hdr_phys_t, sa_lengths) +
1183 (sizeof (uint16_t) * tb->lot_var_sizes)), 8);
1184 length_start = hdr->sa_lengths;
1185 } else {
1186 data_start = hdr;
1187 }
1188
1189 for (i = 0; i != tb->lot_attr_count; i++) {
1190 int attr_length, reg_length;
1191 uint8_t idx_len;
1192
1193 reg_length = sa->sa_attr_table[tb->lot_attrs[i]].sa_length;
1194 if (reg_length) {
1195 attr_length = reg_length;
1196 idx_len = 0;
1197 } else {
1198 attr_length = length_start[length_idx];
1199 idx_len = length_idx++;
1200 }
1201
1202 func(hdr, data_start, tb->lot_attrs[i], attr_length,
1203 idx_len, reg_length == 0 ? B_TRUE : B_FALSE, userp);
1204
1205 data_start = (void *)P2ROUNDUP(((uintptr_t)data_start +
1206 attr_length), 8);
1207 }
1208 }
1209
1210 /*ARGSUSED*/
1211 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)1212 sa_byteswap_cb(void *hdr, void *attr_addr, sa_attr_type_t attr,
1213 uint16_t length, int length_idx, boolean_t variable_length, void *userp)
1214 {
1215 sa_handle_t *hdl = userp;
1216 sa_os_t *sa = hdl->sa_os->os_sa;
1217
1218 sa_bswap_table[sa->sa_attr_table[attr].sa_byteswap](attr_addr, length);
1219 }
1220
1221 void
sa_byteswap(sa_handle_t * hdl,sa_buf_type_t buftype)1222 sa_byteswap(sa_handle_t *hdl, sa_buf_type_t buftype)
1223 {
1224 sa_hdr_phys_t *sa_hdr_phys = SA_GET_HDR(hdl, buftype);
1225 dmu_buf_impl_t *db;
1226 sa_os_t *sa = hdl->sa_os->os_sa;
1227 int num_lengths = 1;
1228 int i;
1229
1230 ASSERT(MUTEX_HELD(&sa->sa_lock));
1231 if (sa_hdr_phys->sa_magic == SA_MAGIC)
1232 return;
1233
1234 db = SA_GET_DB(hdl, buftype);
1235
1236 if (buftype == SA_SPILL) {
1237 arc_release(db->db_buf, NULL);
1238 arc_buf_thaw(db->db_buf);
1239 }
1240
1241 sa_hdr_phys->sa_magic = BSWAP_32(sa_hdr_phys->sa_magic);
1242 sa_hdr_phys->sa_layout_info = BSWAP_16(sa_hdr_phys->sa_layout_info);
1243
1244 /*
1245 * Determine number of variable lenghts in header
1246 * The standard 8 byte header has one for free and a
1247 * 16 byte header would have 4 + 1;
1248 */
1249 if (SA_HDR_SIZE(sa_hdr_phys) > 8)
1250 num_lengths += (SA_HDR_SIZE(sa_hdr_phys) - 8) >> 1;
1251 for (i = 0; i != num_lengths; i++)
1252 sa_hdr_phys->sa_lengths[i] =
1253 BSWAP_16(sa_hdr_phys->sa_lengths[i]);
1254
1255 sa_attr_iter(hdl->sa_os, sa_hdr_phys, DMU_OT_SA,
1256 sa_byteswap_cb, NULL, hdl);
1257
1258 if (buftype == SA_SPILL)
1259 arc_buf_freeze(((dmu_buf_impl_t *)hdl->sa_spill)->db_buf);
1260 }
1261
1262 static int
sa_build_index(sa_handle_t * hdl,sa_buf_type_t buftype)1263 sa_build_index(sa_handle_t *hdl, sa_buf_type_t buftype)
1264 {
1265 sa_hdr_phys_t *sa_hdr_phys;
1266 dmu_buf_impl_t *db = SA_GET_DB(hdl, buftype);
1267 dmu_object_type_t bonustype = SA_BONUSTYPE_FROM_DB(db);
1268 sa_os_t *sa = hdl->sa_os->os_sa;
1269 sa_idx_tab_t *idx_tab;
1270
1271 sa_hdr_phys = SA_GET_HDR(hdl, buftype);
1272
1273 mutex_enter(&sa->sa_lock);
1274
1275 /* Do we need to byteswap? */
1276
1277 /* only check if not old znode */
1278 if (IS_SA_BONUSTYPE(bonustype) && sa_hdr_phys->sa_magic != SA_MAGIC &&
1279 sa_hdr_phys->sa_magic != 0) {
1280 VERIFY(BSWAP_32(sa_hdr_phys->sa_magic) == SA_MAGIC);
1281 sa_byteswap(hdl, buftype);
1282 }
1283
1284 idx_tab = sa_find_idx_tab(hdl->sa_os, bonustype, sa_hdr_phys);
1285
1286 if (buftype == SA_BONUS)
1287 hdl->sa_bonus_tab = idx_tab;
1288 else
1289 hdl->sa_spill_tab = idx_tab;
1290
1291 mutex_exit(&sa->sa_lock);
1292 return (0);
1293 }
1294
1295 /*ARGSUSED*/
1296 static void
sa_evict_sync(void * dbu)1297 sa_evict_sync(void *dbu)
1298 {
1299 panic("evicting sa dbuf\n");
1300 }
1301
1302 static void
sa_idx_tab_rele(objset_t * os,void * arg)1303 sa_idx_tab_rele(objset_t *os, void *arg)
1304 {
1305 sa_os_t *sa = os->os_sa;
1306 sa_idx_tab_t *idx_tab = arg;
1307
1308 if (idx_tab == NULL)
1309 return;
1310
1311 mutex_enter(&sa->sa_lock);
1312 if (refcount_remove(&idx_tab->sa_refcount, NULL) == 0) {
1313 list_remove(&idx_tab->sa_layout->lot_idx_tab, idx_tab);
1314 if (idx_tab->sa_variable_lengths)
1315 kmem_free(idx_tab->sa_variable_lengths,
1316 sizeof (uint16_t) *
1317 idx_tab->sa_layout->lot_var_sizes);
1318 refcount_destroy(&idx_tab->sa_refcount);
1319 kmem_free(idx_tab->sa_idx_tab,
1320 sizeof (uint32_t) * sa->sa_num_attrs);
1321 kmem_free(idx_tab, sizeof (sa_idx_tab_t));
1322 }
1323 mutex_exit(&sa->sa_lock);
1324 }
1325
1326 static void
sa_idx_tab_hold(objset_t * os,sa_idx_tab_t * idx_tab)1327 sa_idx_tab_hold(objset_t *os, sa_idx_tab_t *idx_tab)
1328 {
1329 sa_os_t *sa = os->os_sa;
1330
1331 ASSERT(MUTEX_HELD(&sa->sa_lock));
1332 (void) refcount_add(&idx_tab->sa_refcount, NULL);
1333 }
1334
1335 void
sa_handle_destroy(sa_handle_t * hdl)1336 sa_handle_destroy(sa_handle_t *hdl)
1337 {
1338 dmu_buf_t *db = hdl->sa_bonus;
1339
1340 mutex_enter(&hdl->sa_lock);
1341 (void) dmu_buf_remove_user(db, &hdl->sa_dbu);
1342
1343 if (hdl->sa_bonus_tab)
1344 sa_idx_tab_rele(hdl->sa_os, hdl->sa_bonus_tab);
1345
1346 if (hdl->sa_spill_tab)
1347 sa_idx_tab_rele(hdl->sa_os, hdl->sa_spill_tab);
1348
1349 dmu_buf_rele(hdl->sa_bonus, NULL);
1350
1351 if (hdl->sa_spill)
1352 dmu_buf_rele((dmu_buf_t *)hdl->sa_spill, NULL);
1353 mutex_exit(&hdl->sa_lock);
1354
1355 kmem_cache_free(sa_cache, hdl);
1356 }
1357
1358 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)1359 sa_handle_get_from_db(objset_t *os, dmu_buf_t *db, void *userp,
1360 sa_handle_type_t hdl_type, sa_handle_t **handlepp)
1361 {
1362 int error = 0;
1363 dmu_object_info_t doi;
1364 sa_handle_t *handle = NULL;
1365
1366 #ifdef ZFS_DEBUG
1367 dmu_object_info_from_db(db, &doi);
1368 ASSERT(doi.doi_bonus_type == DMU_OT_SA ||
1369 doi.doi_bonus_type == DMU_OT_ZNODE);
1370 #endif
1371 /* find handle, if it exists */
1372 /* if one doesn't exist then create a new one, and initialize it */
1373
1374 if (hdl_type == SA_HDL_SHARED)
1375 handle = dmu_buf_get_user(db);
1376
1377 if (handle == NULL) {
1378 sa_handle_t *winner = NULL;
1379
1380 handle = kmem_cache_alloc(sa_cache, KM_SLEEP);
1381 handle->sa_dbu.dbu_evict_func_sync = NULL;
1382 handle->sa_dbu.dbu_evict_func_async = NULL;
1383 handle->sa_userp = userp;
1384 handle->sa_bonus = db;
1385 handle->sa_os = os;
1386 handle->sa_spill = NULL;
1387 handle->sa_bonus_tab = NULL;
1388 handle->sa_spill_tab = NULL;
1389
1390 error = sa_build_index(handle, SA_BONUS);
1391
1392 if (hdl_type == SA_HDL_SHARED) {
1393 dmu_buf_init_user(&handle->sa_dbu, sa_evict_sync, NULL,
1394 NULL);
1395 winner = dmu_buf_set_user_ie(db, &handle->sa_dbu);
1396 }
1397
1398 if (winner != NULL) {
1399 kmem_cache_free(sa_cache, handle);
1400 handle = winner;
1401 }
1402 }
1403 *handlepp = handle;
1404
1405 return (error);
1406 }
1407
1408 int
sa_handle_get(objset_t * objset,uint64_t objid,void * userp,sa_handle_type_t hdl_type,sa_handle_t ** handlepp)1409 sa_handle_get(objset_t *objset, uint64_t objid, void *userp,
1410 sa_handle_type_t hdl_type, sa_handle_t **handlepp)
1411 {
1412 dmu_buf_t *db;
1413 int error;
1414
1415 if (error = dmu_bonus_hold(objset, objid, NULL, &db))
1416 return (error);
1417
1418 return (sa_handle_get_from_db(objset, db, userp, hdl_type,
1419 handlepp));
1420 }
1421
1422 int
sa_buf_hold(objset_t * objset,uint64_t obj_num,void * tag,dmu_buf_t ** db)1423 sa_buf_hold(objset_t *objset, uint64_t obj_num, void *tag, dmu_buf_t **db)
1424 {
1425 return (dmu_bonus_hold(objset, obj_num, tag, db));
1426 }
1427
1428 void
sa_buf_rele(dmu_buf_t * db,void * tag)1429 sa_buf_rele(dmu_buf_t *db, void *tag)
1430 {
1431 dmu_buf_rele(db, tag);
1432 }
1433
1434 int
sa_lookup_impl(sa_handle_t * hdl,sa_bulk_attr_t * bulk,int count)1435 sa_lookup_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count)
1436 {
1437 ASSERT(hdl);
1438 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1439 return (sa_attr_op(hdl, bulk, count, SA_LOOKUP, NULL));
1440 }
1441
1442 int
sa_lookup(sa_handle_t * hdl,sa_attr_type_t attr,void * buf,uint32_t buflen)1443 sa_lookup(sa_handle_t *hdl, sa_attr_type_t attr, void *buf, uint32_t buflen)
1444 {
1445 int error;
1446 sa_bulk_attr_t bulk;
1447
1448 bulk.sa_attr = attr;
1449 bulk.sa_data = buf;
1450 bulk.sa_length = buflen;
1451 bulk.sa_data_func = NULL;
1452
1453 ASSERT(hdl);
1454 mutex_enter(&hdl->sa_lock);
1455 error = sa_lookup_impl(hdl, &bulk, 1);
1456 mutex_exit(&hdl->sa_lock);
1457 return (error);
1458 }
1459
1460 #ifdef _KERNEL
1461 int
sa_lookup_uio(sa_handle_t * hdl,sa_attr_type_t attr,uio_t * uio)1462 sa_lookup_uio(sa_handle_t *hdl, sa_attr_type_t attr, uio_t *uio)
1463 {
1464 int error;
1465 sa_bulk_attr_t bulk;
1466
1467 bulk.sa_data = NULL;
1468 bulk.sa_attr = attr;
1469 bulk.sa_data_func = NULL;
1470
1471 ASSERT(hdl);
1472
1473 mutex_enter(&hdl->sa_lock);
1474 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) == 0) {
1475 error = uiomove((void *)bulk.sa_addr, MIN(bulk.sa_size,
1476 uio->uio_resid), UIO_READ, uio);
1477 }
1478 mutex_exit(&hdl->sa_lock);
1479 return (error);
1480
1481 }
1482 #endif
1483
1484 static sa_idx_tab_t *
sa_find_idx_tab(objset_t * os,dmu_object_type_t bonustype,sa_hdr_phys_t * hdr)1485 sa_find_idx_tab(objset_t *os, dmu_object_type_t bonustype, sa_hdr_phys_t *hdr)
1486 {
1487 sa_idx_tab_t *idx_tab;
1488 sa_os_t *sa = os->os_sa;
1489 sa_lot_t *tb, search;
1490 avl_index_t loc;
1491
1492 /*
1493 * Deterimine layout number. If SA node and header == 0 then
1494 * force the index table to the dummy "1" empty layout.
1495 *
1496 * The layout number would only be zero for a newly created file
1497 * that has not added any attributes yet, or with crypto enabled which
1498 * doesn't write any attributes to the bonus buffer.
1499 */
1500
1501 search.lot_num = SA_LAYOUT_NUM(hdr, bonustype);
1502
1503 tb = avl_find(&sa->sa_layout_num_tree, &search, &loc);
1504
1505 /* Verify header size is consistent with layout information */
1506 ASSERT(tb);
1507 ASSERT(IS_SA_BONUSTYPE(bonustype) &&
1508 SA_HDR_SIZE_MATCH_LAYOUT(hdr, tb) || !IS_SA_BONUSTYPE(bonustype) ||
1509 (IS_SA_BONUSTYPE(bonustype) && hdr->sa_layout_info == 0));
1510
1511 /*
1512 * See if any of the already existing TOC entries can be reused?
1513 */
1514
1515 for (idx_tab = list_head(&tb->lot_idx_tab); idx_tab;
1516 idx_tab = list_next(&tb->lot_idx_tab, idx_tab)) {
1517 boolean_t valid_idx = B_TRUE;
1518 int i;
1519
1520 if (tb->lot_var_sizes != 0 &&
1521 idx_tab->sa_variable_lengths != NULL) {
1522 for (i = 0; i != tb->lot_var_sizes; i++) {
1523 if (hdr->sa_lengths[i] !=
1524 idx_tab->sa_variable_lengths[i]) {
1525 valid_idx = B_FALSE;
1526 break;
1527 }
1528 }
1529 }
1530 if (valid_idx) {
1531 sa_idx_tab_hold(os, idx_tab);
1532 return (idx_tab);
1533 }
1534 }
1535
1536 /* No such luck, create a new entry */
1537 idx_tab = kmem_zalloc(sizeof (sa_idx_tab_t), KM_SLEEP);
1538 idx_tab->sa_idx_tab =
1539 kmem_zalloc(sizeof (uint32_t) * sa->sa_num_attrs, KM_SLEEP);
1540 idx_tab->sa_layout = tb;
1541 refcount_create(&idx_tab->sa_refcount);
1542 if (tb->lot_var_sizes)
1543 idx_tab->sa_variable_lengths = kmem_alloc(sizeof (uint16_t) *
1544 tb->lot_var_sizes, KM_SLEEP);
1545
1546 sa_attr_iter(os, hdr, bonustype, sa_build_idx_tab,
1547 tb, idx_tab);
1548 sa_idx_tab_hold(os, idx_tab); /* one hold for consumer */
1549 sa_idx_tab_hold(os, idx_tab); /* one for layout */
1550 list_insert_tail(&tb->lot_idx_tab, idx_tab);
1551 return (idx_tab);
1552 }
1553
1554 void
sa_default_locator(void ** dataptr,uint32_t * len,uint32_t total_len,boolean_t start,void * userdata)1555 sa_default_locator(void **dataptr, uint32_t *len, uint32_t total_len,
1556 boolean_t start, void *userdata)
1557 {
1558 ASSERT(start);
1559
1560 *dataptr = userdata;
1561 *len = total_len;
1562 }
1563
1564 static void
sa_attr_register_sync(sa_handle_t * hdl,dmu_tx_t * tx)1565 sa_attr_register_sync(sa_handle_t *hdl, dmu_tx_t *tx)
1566 {
1567 uint64_t attr_value = 0;
1568 sa_os_t *sa = hdl->sa_os->os_sa;
1569 sa_attr_table_t *tb = sa->sa_attr_table;
1570 int i;
1571
1572 mutex_enter(&sa->sa_lock);
1573
1574 if (!sa->sa_need_attr_registration || sa->sa_master_obj == 0) {
1575 mutex_exit(&sa->sa_lock);
1576 return;
1577 }
1578
1579 if (sa->sa_reg_attr_obj == 0) {
1580 sa->sa_reg_attr_obj = zap_create_link(hdl->sa_os,
1581 DMU_OT_SA_ATTR_REGISTRATION,
1582 sa->sa_master_obj, SA_REGISTRY, tx);
1583 }
1584 for (i = 0; i != sa->sa_num_attrs; i++) {
1585 if (sa->sa_attr_table[i].sa_registered)
1586 continue;
1587 ATTR_ENCODE(attr_value, tb[i].sa_attr, tb[i].sa_length,
1588 tb[i].sa_byteswap);
1589 VERIFY(0 == zap_update(hdl->sa_os, sa->sa_reg_attr_obj,
1590 tb[i].sa_name, 8, 1, &attr_value, tx));
1591 tb[i].sa_registered = B_TRUE;
1592 }
1593 sa->sa_need_attr_registration = B_FALSE;
1594 mutex_exit(&sa->sa_lock);
1595 }
1596
1597 /*
1598 * Replace all attributes with attributes specified in template.
1599 * If dnode had a spill buffer then those attributes will be
1600 * also be replaced, possibly with just an empty spill block
1601 *
1602 * This interface is intended to only be used for bulk adding of
1603 * attributes for a new file. It will also be used by the ZPL
1604 * when converting and old formatted znode to native SA support.
1605 */
1606 int
sa_replace_all_by_template_locked(sa_handle_t * hdl,sa_bulk_attr_t * attr_desc,int attr_count,dmu_tx_t * tx)1607 sa_replace_all_by_template_locked(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc,
1608 int attr_count, dmu_tx_t *tx)
1609 {
1610 sa_os_t *sa = hdl->sa_os->os_sa;
1611
1612 if (sa->sa_need_attr_registration)
1613 sa_attr_register_sync(hdl, tx);
1614 return (sa_build_layouts(hdl, attr_desc, attr_count, tx));
1615 }
1616
1617 int
sa_replace_all_by_template(sa_handle_t * hdl,sa_bulk_attr_t * attr_desc,int attr_count,dmu_tx_t * tx)1618 sa_replace_all_by_template(sa_handle_t *hdl, sa_bulk_attr_t *attr_desc,
1619 int attr_count, dmu_tx_t *tx)
1620 {
1621 int error;
1622
1623 mutex_enter(&hdl->sa_lock);
1624 error = sa_replace_all_by_template_locked(hdl, attr_desc,
1625 attr_count, tx);
1626 mutex_exit(&hdl->sa_lock);
1627 return (error);
1628 }
1629
1630 /*
1631 * Add/remove a single attribute or replace a variable-sized attribute value
1632 * with a value of a different size, and then rewrite the entire set
1633 * of attributes.
1634 * Same-length attribute value replacement (including fixed-length attributes)
1635 * is handled more efficiently by the upper layers.
1636 */
1637 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)1638 sa_modify_attrs(sa_handle_t *hdl, sa_attr_type_t newattr,
1639 sa_data_op_t action, sa_data_locator_t *locator, void *datastart,
1640 uint16_t buflen, dmu_tx_t *tx)
1641 {
1642 sa_os_t *sa = hdl->sa_os->os_sa;
1643 dmu_buf_impl_t *db = (dmu_buf_impl_t *)hdl->sa_bonus;
1644 dnode_t *dn;
1645 sa_bulk_attr_t *attr_desc;
1646 void *old_data[2];
1647 int bonus_attr_count = 0;
1648 int bonus_data_size = 0;
1649 int spill_data_size = 0;
1650 int spill_attr_count = 0;
1651 int error;
1652 uint16_t length, reg_length;
1653 int i, j, k, length_idx;
1654 sa_hdr_phys_t *hdr;
1655 sa_idx_tab_t *idx_tab;
1656 int attr_count;
1657 int count;
1658
1659 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1660
1661 /* First make of copy of the old data */
1662
1663 DB_DNODE_ENTER(db);
1664 dn = DB_DNODE(db);
1665 if (dn->dn_bonuslen != 0) {
1666 bonus_data_size = hdl->sa_bonus->db_size;
1667 old_data[0] = kmem_alloc(bonus_data_size, KM_SLEEP);
1668 bcopy(hdl->sa_bonus->db_data, old_data[0],
1669 hdl->sa_bonus->db_size);
1670 bonus_attr_count = hdl->sa_bonus_tab->sa_layout->lot_attr_count;
1671 } else {
1672 old_data[0] = NULL;
1673 }
1674 DB_DNODE_EXIT(db);
1675
1676 /* Bring spill buffer online if it isn't currently */
1677
1678 if ((error = sa_get_spill(hdl)) == 0) {
1679 spill_data_size = hdl->sa_spill->db_size;
1680 old_data[1] = kmem_alloc(spill_data_size, KM_SLEEP);
1681 bcopy(hdl->sa_spill->db_data, old_data[1],
1682 hdl->sa_spill->db_size);
1683 spill_attr_count =
1684 hdl->sa_spill_tab->sa_layout->lot_attr_count;
1685 } else if (error && error != ENOENT) {
1686 if (old_data[0])
1687 kmem_free(old_data[0], bonus_data_size);
1688 return (error);
1689 } else {
1690 old_data[1] = NULL;
1691 }
1692
1693 /* build descriptor of all attributes */
1694
1695 attr_count = bonus_attr_count + spill_attr_count;
1696 if (action == SA_ADD)
1697 attr_count++;
1698 else if (action == SA_REMOVE)
1699 attr_count--;
1700
1701 attr_desc = kmem_zalloc(sizeof (sa_bulk_attr_t) * attr_count, KM_SLEEP);
1702
1703 /*
1704 * loop through bonus and spill buffer if it exists, and
1705 * build up new attr_descriptor to reset the attributes
1706 */
1707 k = j = 0;
1708 count = bonus_attr_count;
1709 hdr = SA_GET_HDR(hdl, SA_BONUS);
1710 idx_tab = SA_IDX_TAB_GET(hdl, SA_BONUS);
1711 for (; k != 2; k++) {
1712 /*
1713 * Iterate over each attribute in layout. Fetch the
1714 * size of variable-length attributes needing rewrite
1715 * from sa_lengths[].
1716 */
1717 for (i = 0, length_idx = 0; i != count; i++) {
1718 sa_attr_type_t attr;
1719
1720 attr = idx_tab->sa_layout->lot_attrs[i];
1721 reg_length = SA_REGISTERED_LEN(sa, attr);
1722 if (reg_length == 0) {
1723 length = hdr->sa_lengths[length_idx];
1724 length_idx++;
1725 } else {
1726 length = reg_length;
1727 }
1728 if (attr == newattr) {
1729 /*
1730 * There is nothing to do for SA_REMOVE,
1731 * so it is just skipped.
1732 */
1733 if (action == SA_REMOVE)
1734 continue;
1735
1736 /*
1737 * Duplicate attributes are not allowed, so the
1738 * action can not be SA_ADD here.
1739 */
1740 ASSERT3S(action, ==, SA_REPLACE);
1741
1742 /*
1743 * Only a variable-sized attribute can be
1744 * replaced here, and its size must be changing.
1745 */
1746 ASSERT3U(reg_length, ==, 0);
1747 ASSERT3U(length, !=, buflen);
1748 SA_ADD_BULK_ATTR(attr_desc, j, attr,
1749 locator, datastart, buflen);
1750 } else {
1751 SA_ADD_BULK_ATTR(attr_desc, j, attr,
1752 NULL, (void *)
1753 (TOC_OFF(idx_tab->sa_idx_tab[attr]) +
1754 (uintptr_t)old_data[k]), length);
1755 }
1756 }
1757 if (k == 0 && hdl->sa_spill) {
1758 hdr = SA_GET_HDR(hdl, SA_SPILL);
1759 idx_tab = SA_IDX_TAB_GET(hdl, SA_SPILL);
1760 count = spill_attr_count;
1761 } else {
1762 break;
1763 }
1764 }
1765 if (action == SA_ADD) {
1766 reg_length = SA_REGISTERED_LEN(sa, newattr);
1767 IMPLY(reg_length != 0, reg_length == buflen);
1768 SA_ADD_BULK_ATTR(attr_desc, j, newattr, locator,
1769 datastart, buflen);
1770 }
1771 ASSERT3U(j, ==, attr_count);
1772
1773 error = sa_build_layouts(hdl, attr_desc, attr_count, tx);
1774
1775 if (old_data[0])
1776 kmem_free(old_data[0], bonus_data_size);
1777 if (old_data[1])
1778 kmem_free(old_data[1], spill_data_size);
1779 kmem_free(attr_desc, sizeof (sa_bulk_attr_t) * attr_count);
1780
1781 return (error);
1782 }
1783
1784 static int
sa_bulk_update_impl(sa_handle_t * hdl,sa_bulk_attr_t * bulk,int count,dmu_tx_t * tx)1785 sa_bulk_update_impl(sa_handle_t *hdl, sa_bulk_attr_t *bulk, int count,
1786 dmu_tx_t *tx)
1787 {
1788 int error;
1789 sa_os_t *sa = hdl->sa_os->os_sa;
1790 dmu_object_type_t bonustype;
1791
1792 bonustype = SA_BONUSTYPE_FROM_DB(SA_GET_DB(hdl, SA_BONUS));
1793
1794 ASSERT(hdl);
1795 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1796
1797 /* sync out registration table if necessary */
1798 if (sa->sa_need_attr_registration)
1799 sa_attr_register_sync(hdl, tx);
1800
1801 error = sa_attr_op(hdl, bulk, count, SA_UPDATE, tx);
1802 if (error == 0 && !IS_SA_BONUSTYPE(bonustype) && sa->sa_update_cb)
1803 sa->sa_update_cb(hdl, tx);
1804
1805 return (error);
1806 }
1807
1808 /*
1809 * update or add new attribute
1810 */
1811 int
sa_update(sa_handle_t * hdl,sa_attr_type_t type,void * buf,uint32_t buflen,dmu_tx_t * tx)1812 sa_update(sa_handle_t *hdl, sa_attr_type_t type,
1813 void *buf, uint32_t buflen, dmu_tx_t *tx)
1814 {
1815 int error;
1816 sa_bulk_attr_t bulk;
1817
1818 bulk.sa_attr = type;
1819 bulk.sa_data_func = NULL;
1820 bulk.sa_length = buflen;
1821 bulk.sa_data = buf;
1822
1823 mutex_enter(&hdl->sa_lock);
1824 error = sa_bulk_update_impl(hdl, &bulk, 1, tx);
1825 mutex_exit(&hdl->sa_lock);
1826 return (error);
1827 }
1828
1829 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)1830 sa_update_from_cb(sa_handle_t *hdl, sa_attr_type_t attr,
1831 uint32_t buflen, sa_data_locator_t *locator, void *userdata, dmu_tx_t *tx)
1832 {
1833 int error;
1834 sa_bulk_attr_t bulk;
1835
1836 bulk.sa_attr = attr;
1837 bulk.sa_data = userdata;
1838 bulk.sa_data_func = locator;
1839 bulk.sa_length = buflen;
1840
1841 mutex_enter(&hdl->sa_lock);
1842 error = sa_bulk_update_impl(hdl, &bulk, 1, tx);
1843 mutex_exit(&hdl->sa_lock);
1844 return (error);
1845 }
1846
1847 /*
1848 * Return size of an attribute
1849 */
1850
1851 int
sa_size(sa_handle_t * hdl,sa_attr_type_t attr,int * size)1852 sa_size(sa_handle_t *hdl, sa_attr_type_t attr, int *size)
1853 {
1854 sa_bulk_attr_t bulk;
1855 int error;
1856
1857 bulk.sa_data = NULL;
1858 bulk.sa_attr = attr;
1859 bulk.sa_data_func = NULL;
1860
1861 ASSERT(hdl);
1862 mutex_enter(&hdl->sa_lock);
1863 if ((error = sa_attr_op(hdl, &bulk, 1, SA_LOOKUP, NULL)) != 0) {
1864 mutex_exit(&hdl->sa_lock);
1865 return (error);
1866 }
1867 *size = bulk.sa_size;
1868
1869 mutex_exit(&hdl->sa_lock);
1870 return (0);
1871 }
1872
1873 int
sa_bulk_lookup_locked(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count)1874 sa_bulk_lookup_locked(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count)
1875 {
1876 ASSERT(hdl);
1877 ASSERT(MUTEX_HELD(&hdl->sa_lock));
1878 return (sa_lookup_impl(hdl, attrs, count));
1879 }
1880
1881 int
sa_bulk_lookup(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count)1882 sa_bulk_lookup(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count)
1883 {
1884 int error;
1885
1886 ASSERT(hdl);
1887 mutex_enter(&hdl->sa_lock);
1888 error = sa_bulk_lookup_locked(hdl, attrs, count);
1889 mutex_exit(&hdl->sa_lock);
1890 return (error);
1891 }
1892
1893 int
sa_bulk_update(sa_handle_t * hdl,sa_bulk_attr_t * attrs,int count,dmu_tx_t * tx)1894 sa_bulk_update(sa_handle_t *hdl, sa_bulk_attr_t *attrs, int count, dmu_tx_t *tx)
1895 {
1896 int error;
1897
1898 ASSERT(hdl);
1899 mutex_enter(&hdl->sa_lock);
1900 error = sa_bulk_update_impl(hdl, attrs, count, tx);
1901 mutex_exit(&hdl->sa_lock);
1902 return (error);
1903 }
1904
1905 int
sa_remove(sa_handle_t * hdl,sa_attr_type_t attr,dmu_tx_t * tx)1906 sa_remove(sa_handle_t *hdl, sa_attr_type_t attr, dmu_tx_t *tx)
1907 {
1908 int error;
1909
1910 mutex_enter(&hdl->sa_lock);
1911 error = sa_modify_attrs(hdl, attr, SA_REMOVE, NULL,
1912 NULL, 0, tx);
1913 mutex_exit(&hdl->sa_lock);
1914 return (error);
1915 }
1916
1917 void
sa_object_info(sa_handle_t * hdl,dmu_object_info_t * doi)1918 sa_object_info(sa_handle_t *hdl, dmu_object_info_t *doi)
1919 {
1920 dmu_object_info_from_db((dmu_buf_t *)hdl->sa_bonus, doi);
1921 }
1922
1923 void
sa_object_size(sa_handle_t * hdl,uint32_t * blksize,u_longlong_t * nblocks)1924 sa_object_size(sa_handle_t *hdl, uint32_t *blksize, u_longlong_t *nblocks)
1925 {
1926 dmu_object_size_from_db((dmu_buf_t *)hdl->sa_bonus,
1927 blksize, nblocks);
1928 }
1929
1930 void
sa_set_userp(sa_handle_t * hdl,void * ptr)1931 sa_set_userp(sa_handle_t *hdl, void *ptr)
1932 {
1933 hdl->sa_userp = ptr;
1934 }
1935
1936 dmu_buf_t *
sa_get_db(sa_handle_t * hdl)1937 sa_get_db(sa_handle_t *hdl)
1938 {
1939 return ((dmu_buf_t *)hdl->sa_bonus);
1940 }
1941
1942 void *
sa_get_userdata(sa_handle_t * hdl)1943 sa_get_userdata(sa_handle_t *hdl)
1944 {
1945 return (hdl->sa_userp);
1946 }
1947
1948 void
sa_register_update_callback_locked(objset_t * os,sa_update_cb_t * func)1949 sa_register_update_callback_locked(objset_t *os, sa_update_cb_t *func)
1950 {
1951 ASSERT(MUTEX_HELD(&os->os_sa->sa_lock));
1952 os->os_sa->sa_update_cb = func;
1953 }
1954
1955 void
sa_register_update_callback(objset_t * os,sa_update_cb_t * func)1956 sa_register_update_callback(objset_t *os, sa_update_cb_t *func)
1957 {
1958
1959 mutex_enter(&os->os_sa->sa_lock);
1960 sa_register_update_callback_locked(os, func);
1961 mutex_exit(&os->os_sa->sa_lock);
1962 }
1963
1964 uint64_t
sa_handle_object(sa_handle_t * hdl)1965 sa_handle_object(sa_handle_t *hdl)
1966 {
1967 return (hdl->sa_bonus->db_object);
1968 }
1969
1970 boolean_t
sa_enabled(objset_t * os)1971 sa_enabled(objset_t *os)
1972 {
1973 return (os->os_sa == NULL);
1974 }
1975
1976 int
sa_set_sa_object(objset_t * os,uint64_t sa_object)1977 sa_set_sa_object(objset_t *os, uint64_t sa_object)
1978 {
1979 sa_os_t *sa = os->os_sa;
1980
1981 if (sa->sa_master_obj)
1982 return (1);
1983
1984 sa->sa_master_obj = sa_object;
1985
1986 return (0);
1987 }
1988
1989 int
sa_hdrsize(void * arg)1990 sa_hdrsize(void *arg)
1991 {
1992 sa_hdr_phys_t *hdr = arg;
1993
1994 return (SA_HDR_SIZE(hdr));
1995 }
1996
1997 void
sa_handle_lock(sa_handle_t * hdl)1998 sa_handle_lock(sa_handle_t *hdl)
1999 {
2000 ASSERT(hdl);
2001 mutex_enter(&hdl->sa_lock);
2002 }
2003
2004 void
sa_handle_unlock(sa_handle_t * hdl)2005 sa_handle_unlock(sa_handle_t *hdl)
2006 {
2007 ASSERT(hdl);
2008 mutex_exit(&hdl->sa_lock);
2009 }
2010