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