usr/src/cmd/acct/acctdusg.c

224

switch (add_tnode(&tree, statb.st_dev, statb.st_ino)) {

usr/src/cmd/acct/acctdusg.c

60

static avl_tree_t *tree = NULL;

usr/src/cmd/chgrp/chgrp.c

217

tree = NULL;

usr/src/cmd/chgrp/chgrp.c

254

if (add_tnode(&tree,

usr/src/cmd/chgrp/chgrp.c

305

if (add_tnode(&tree, stbuf.st_dev,

usr/src/cmd/chgrp/chgrp.c

422

if ((rc = add_tnode(&tree,

usr/src/cmd/chgrp/chgrp.c

477

if ((rc = add_tnode(&tree, st.st_dev,

usr/src/cmd/chgrp/chgrp.c

76

static avl_tree_t *tree; /* search tree to store inode data */

usr/src/cmd/chown/chown.c

252

tree = NULL;

usr/src/cmd/chown/chown.c

290

if (add_tnode(&tree,

usr/src/cmd/chown/chown.c

327

if (add_tnode(&tree, stbuf.st_dev,

usr/src/cmd/chown/chown.c

432

if ((rc = add_tnode(&tree,

usr/src/cmd/chown/chown.c

472

if ((rc = add_tnode(&tree, st.st_dev,

usr/src/cmd/chown/chown.c

74

static avl_tree_t *tree;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1571

local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1573

local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1575

local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1576

local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1590

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1594

# define send_code(s, c, tree) \

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1596

send_bits(s, tree[c].Code, tree[c].Len); }

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1792

#define pqremove(s, tree, top) \

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1796

pqdownheap(s, tree, SMALLEST); \

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1803

#define smaller(tree, n, m, depth) \

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1804

(tree[n].Freq < tree[m].Freq || \

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1805

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1813

local void pqdownheap(s, tree, k)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1815

ct_data *tree; /* the tree to restore */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1823

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1827

if (smaller(tree, v, s->heap[j], s->depth)) break;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1852

ct_data *tree = desc->dyn_tree;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1870

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1874

bits = tree[tree[n].Dad].Len + 1;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1876

tree[n].Len = (ush)bits;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1884

f = tree[n].Freq;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1916

if (tree[m].Len != (unsigned) bits) {

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1917

Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1918

s->opt_len += ((long)bits - (long)tree[m].Len)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1919

*(long)tree[m].Freq;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1920

tree[m].Len = (ush)bits;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1935

local void gen_codes (tree, max_code, bl_count)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1936

ct_data *tree; /* the tree to decorate */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1959

int len = tree[n].Len;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1962

tree[n].Code = bi_reverse(next_code[len]++, len);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1964

Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1965

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1981

ct_data *tree = desc->dyn_tree;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1995

if (tree[n].Freq != 0) {

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

1999

tree[n].Len = 0;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2010

tree[node].Freq = 1;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2020

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2027

pqremove(s, tree, n); /* n = node of least frequency */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2034

tree[node].Freq = tree[n].Freq + tree[m].Freq;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2036

tree[n].Dad = tree[m].Dad = (ush)node;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2038

if (tree == s->bl_tree) {

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2040

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2045

pqdownheap(s, tree, SMALLEST);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2057

gen_codes ((ct_data *)tree, max_code, s->bl_count);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2064

local void scan_tree (s, tree, max_code)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2066

ct_data *tree; /* the tree to be scanned */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2072

int nextlen = tree[0].Len; /* length of next code */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2078

tree[max_code+1].Len = (ush)0xffff; /* guard */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2081

curlen = nextlen; nextlen = tree[n+1].Len;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2109

local void send_tree (s, tree, max_code)

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2111

ct_data *tree; /* the tree to be scanned */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2117

int nextlen = tree[0].Len; /* length of next code */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

2126

curlen = nextlen; nextlen = tree[n+1].Len;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4113

inflate_huft *tree; /* pointer into tree */

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4191

c->sub.code.tree = c->ltree;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4197

t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4219

c->sub.code.tree = t->next;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4238

c->sub.code.tree = c->dtree;

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4245

t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);

usr/src/cmd/cmd-inet/usr.bin/pppdump/zlib.c

4258

c->sub.code.tree = t->next;

usr/src/cmd/du/du.c

367

if ((rc = add_tnode(&tree, stb.st_dev, stb.st_ino)) != 1) {

usr/src/cmd/du/du.c

96

static avl_tree_t *tree = NULL;

usr/src/cmd/fs.d/ufs/fsck/dup_avl.c

349

free_invert_frags(avl_tree_t *tree)

usr/src/cmd/fs.d/ufs/fsck/dup_avl.c

356

while ((inode_dup = avl_destroy_nodes(tree, &outer)) != NULL) {

usr/src/cmd/fs.d/ufs/fsck/dup_avl.c

365

avl_destroy(tree);

usr/src/cmd/mdb/common/modules/genunix/avl.c

101

tree = &aw->aw_tree;

usr/src/cmd/mdb/common/modules/genunix/avl.c

102

if (mdb_vread(tree, sizeof (avl_tree_t), wsp->walk_addr) == -1) {

usr/src/cmd/mdb/common/modules/genunix/avl.c

106

if (tree->avl_size < tree->avl_offset + sizeof (avl_node_t)) {

usr/src/cmd/mdb/common/modules/genunix/avl.c

108

wsp->walk_addr, tree->avl_size, tree->avl_offset);

usr/src/cmd/mdb/common/modules/genunix/avl.c

116

aw->aw_buff = mdb_zalloc(tree->avl_size, UM_SLEEP);

usr/src/cmd/mdb/common/modules/genunix/avl.c

117

aw->aw_end = (end == 0 ? 0 : end + tree->avl_offset);

usr/src/cmd/mdb/common/modules/genunix/avl.c

127

addr = (uintptr_t)tree->avl_root;

usr/src/cmd/mdb/common/modules/genunix/avl.c

132

addr = avl_leftmostchild(addr, aw->aw_buff, tree->avl_offset,

usr/src/cmd/mdb/common/modules/genunix/avl.c

133

tree->avl_size, aw->aw_elem_name);

usr/src/cmd/mdb/common/modules/genunix/avl.c

138

wsp->walk_addr = begin + tree->avl_offset;

usr/src/cmd/mdb/common/modules/genunix/avl.c

145

mdb_free(aw->aw_buff, sizeof (tree->avl_size));

usr/src/cmd/mdb/common/modules/genunix/avl.c

85

avl_tree_t *tree;

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

224

avl_tree_t *tree = &stacks_ulwp_byid;

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

235

avl_create(tree, stacks_ulwp_compare, sizeof (stacks_ulwp_t),

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

250

if ((sulwp = avl_find(tree, &cmp, NULL)) == NULL) {

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

307

avl_tree_t *tree = &stacks_ulwp_byid;

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

314

while ((sulwp = avl_destroy_nodes(tree, &cookie)) != NULL)

usr/src/cmd/mdb/common/modules/libc/findstack_subr.c

317

bzero(tree, sizeof (*tree));

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

328

ttree_t *tree = (ttree_t *)data;

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

331

if (mdb_readstr(scheme, sizeof (scheme), (uintptr_t)tree->tt_scheme)

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

334

tree->tt_scheme);

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

338

*((tnode_t **)arg) = tree->tt_root;

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

597

ttree_t *tree;

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

612

tree = (ttree_t *)wsp->walk_data;

usr/src/cmd/mdb/common/modules/libtopo/libtopo.c

613

wsp->walk_addr = (uintptr_t)tree->tt_list.l_next;

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1673

mdb_smb_tree_t *tree;

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1677

tree = mdb_zalloc(sizeof (*tree), UM_SLEEP | UM_GC);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1678

if (mdb_ctf_vread(tree, SMBSRV_SCOPE "smb_tree_t",

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1687

"smb_tree_state_t", tree->t_state,

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1692

mdb_printf("TID: %04x\n", tree->t_tid);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1693

mdb_printf("State: %d (%s)\n", tree->t_state, state);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1694

mdb_printf("Share: %s\n", tree->t_sharename);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1695

mdb_printf("Resource: %s\n", tree->t_resource);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1696

mdb_printf("Type: %s\n", tree->t_typename);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1697

mdb_printf("Volume: %s\n", tree->t_volume);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1698

mdb_printf("Umask: %04x\n", tree->t_umask);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1699

mdb_printf("Flags: %08x <%b>\n", tree->t_flags,

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1700

tree->t_flags, tree_flag_bits);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1701

mdb_printf("SMB Node: %llx\n", tree->t_snode);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1702

mdb_printf("Reference Count: %d\n\n", tree->t_refcnt);

usr/src/cmd/mdb/common/modules/smbsrv/smbsrv.c

1710

tree->t_tid, tree->t_sharename, tree->t_resource);

usr/src/cmd/nscd/cache.c

2094

avl_remove(&nscdb->tree, entry);

usr/src/cmd/nscd/cache.c

2136

*entry = (nsc_entry_t *)avl_find(&nscdb->tree, &find_entry, &pos);

usr/src/cmd/nscd/cache.c

2185

avl_insert(&nscdb->tree, *entry, pos); /* O(log n) */

usr/src/cmd/nscd/cache.c

2358

nentries = avl_numnodes(&nscdb->tree);

usr/src/cmd/nscd/cache.c

2431

nodes_togo = (value * avl_numnodes(&nscdb->tree)) / 100;

usr/src/cmd/nscd/cache.c

602

for (entry = avl_first(&nscdb->tree), i = 0; entry != NULL;

usr/src/cmd/nscd/cache.c

603

entry = avl_walk(&nscdb->tree, entry, AVL_AFTER)) {

usr/src/cmd/nscd/cache.c

620

nscdb->name, avl_numnodes(&nscdb->tree));

usr/src/cmd/nscd/cache.c

757

avl_create(&nscdb->tree, nscdb->compar, sizeof (nsc_entry_t),

usr/src/cmd/nscd/cache.h

241

avl_tree_t tree;

usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/fcal_leds_thread.c

408

di_node_t tree = di_init("/", DINFOCPYALL);

usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/fcal_leds_thread.c

409

if (tree == DI_NODE_NIL) {

usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/fcal_leds_thread.c

414

r = walk_disks(tree, dtls);

usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/fcal_leds_thread.c

415

if (tree != DI_NODE_NIL)

usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/fcal_leds_thread.c

416

di_fini(tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2094

gather_pattern(entity_t *e, ptrn_type_t type, uu_avl_t *tree,

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2128

match = uu_avl_find(tree, info, NULL, &marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2131

uu_avl_insert(tree, info, marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2646

tmpl_include_values_check(uu_avl_t *tree, tmpl_errors_t *errs)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2654

for (info = uu_avl_first(tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2656

info = uu_avl_next(tree, info)) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2682

tmpl_pattern_conflict(entity_t *inst, uu_avl_t *tree, ptrn_type_t type,

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2689

rc = gather_pattern(inst, type, tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2692

r = gather_pattern(inst->sc_parent, type, tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2700

tmpl_required_attr_present(uu_avl_t *tree, tmpl_errors_t *errs)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2707

for (pinfo = uu_avl_first(tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2709

pinfo = uu_avl_next(tree, pinfo)) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2773

tmpl_scan_general(entity_t *general, uu_avl_t *tree,

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2801

match = uu_avl_find(tree, ginfo, NULL, NULL);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2855

tmpl_level_redefine(entity_t *inst, uu_avl_t *tree, tmpl_errors_t *errs)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2867

rc = tmpl_scan_general(restarter, tree, TL_RESTARTER, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2868

r = tmpl_scan_general(svc->sc_u.sc_service.sc_global, tree,

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2905

uu_avl_t *tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2910

tree = uu_avl_create(ptrn_info_pool, NULL, TMPL_DEBUG_TREE);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2911

if (tree == NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2916

rc = tmpl_pattern_conflict(inst, tree, PG_PATTERN, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2923

r = tmpl_level_redefine(inst, tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2941

r = tmpl_required_attr_present(tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2946

while ((info = uu_avl_teardown(tree, &marker)) != NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2950

r = tmpl_pattern_conflict(inst, tree, PROP_PATTERN, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2958

r = tmpl_required_attr_present(tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2966

r = tmpl_include_values_check(tree, errs);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2972

while ((info = uu_avl_teardown(tree, &marker)) != NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

2975

uu_avl_destroy(tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

3342

uu_avl_t *tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

3364

tree = e->sc_u.sc_instance.sc_composed;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

3368

match = uu_avl_find(tree, &cpg, NULL, NULL);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

620

grow_props_tree(pgroup_t *pg, uu_avl_t *tree)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

628

if (uu_avl_find(tree, prop, NULL, &marker) == NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

637

uu_avl_insert(tree, prop, marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

650

uu_avl_t *tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

652

tree = uu_avl_create(composed_prop_pool, cpg, TMPL_DEBUG_TREE);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

653

if (tree == NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

657

cpg->cpg_composed_props = tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

669

grow_props_tree(cpg->cpg_instance_pg, tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

675

grow_props_tree(cpg->cpg_service_pg, tree);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

682

build_composed_property_groups(entity_t *inst, uu_avl_t *tree)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

698

match = uu_avl_find(tree, cpg, NULL, &marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

701

uu_avl_insert(tree, cpg, marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

716

match = uu_avl_find(tree, cpg, NULL, &marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

718

uu_avl_insert(tree, cpg, marker);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

738

uu_avl_t *tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

743

tree = uu_avl_create(composed_pg_pool, inst, TMPL_DEBUG_TREE);

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

744

if (tree == NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

748

inst->sc_u.sc_instance.sc_composed = tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

759

uu_avl_t *tree;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

761

tree = inst->sc_u.sc_instance.sc_composed;

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

762

if (tree == NULL)

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

766

while ((cpg = uu_avl_teardown(tree, &marker)) != NULL) {

usr/src/cmd/svc/svccfg/svccfg_tmpl.c

769

uu_avl_destroy(tree);

usr/src/cmd/unpack/unpack.c

138

tree[i] = eof;

usr/src/cmd/unpack/unpack.c

202

p = &tree[lev][j];

usr/src/cmd/unpack/unpack.c

74

static char *tree[25];

usr/src/cmd/zdb/zdb.c

3074

cksum_record_lookup(avl_tree_t *tree, zio_cksum_t *cksum)

usr/src/cmd/zdb/zdb.c

3079

return (avl_find(tree, &lookup, &where));

usr/src/cmd/zdb/zdb.c

3083

cksum_record_insert(avl_tree_t *tree, zio_cksum_t *cksum, int l)

usr/src/cmd/zdb/zdb.c

3087

rec = cksum_record_lookup(tree, cksum);

usr/src/cmd/zdb/zdb.c

3092

avl_add(tree, rec);

usr/src/cmd/zfs/zfs_main.c

6869

uu_avl_t *tree = NULL;

usr/src/cmd/zfs/zfs_main.c

6883

((tree = uu_avl_create(pool, NULL, UU_DEFAULT)) == NULL))

usr/src/cmd/zfs/zfs_main.c

6949

if (uu_avl_find(tree, node, NULL, &idx) == NULL) {

usr/src/cmd/zfs/zfs_main.c

6950

uu_avl_insert(tree, node, idx);

usr/src/cmd/zfs/zfs_main.c

6986

if ((walk = uu_avl_walk_start(tree,

usr/src/cmd/zfs/zfs_main.c

6991

uu_avl_remove(tree, node);

usr/src/cmd/zfs/zfs_main.c

7013

uu_avl_destroy(tree);

usr/src/cmd/ztest/ztest.c

3118

nvlist_t *tree, **child, *config, *split, **schild;

usr/src/cmd/ztest/ztest.c

3141

&tree) == 0);

usr/src/cmd/ztest/ztest.c

3144

VERIFY(nvlist_lookup_nvlist_array(tree, ZPOOL_CONFIG_CHILDREN, &child,

usr/src/common/avl/avl.c

1002

ASSERT(tree->avl_numnodes > 1);

usr/src/common/avl/avl.c

1003

--tree->avl_numnodes;

usr/src/common/avl/avl.c

1041

ASSERT(node == tree->avl_root);

usr/src/common/avl/avl.c

121

avl_walk(avl_tree_t *tree, void *oldnode, int left)

usr/src/common/avl/avl.c

123

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

168

avl_first(avl_tree_t *tree)

usr/src/common/avl/avl.c

172

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

174

for (node = tree->avl_root; node != NULL; node = node->avl_child[0])

usr/src/common/avl/avl.c

187

avl_last(avl_tree_t *tree)

usr/src/common/avl/avl.c

191

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

193

for (node = tree->avl_root; node != NULL; node = node->avl_child[1])

usr/src/common/avl/avl.c

211

avl_nearest(avl_tree_t *tree, avl_index_t where, int direction)

usr/src/common/avl/avl.c

216

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

219

ASSERT(tree->avl_root == NULL);

usr/src/common/avl/avl.c

226

return (avl_walk(tree, data, direction));

usr/src/common/avl/avl.c

240

avl_find(avl_tree_t *tree, const void *value, avl_index_t *where)

usr/src/common/avl/avl.c

246

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

248

for (node = tree->avl_root; node != NULL;

usr/src/common/avl/avl.c

253

diff = tree->avl_compar(value, AVL_NODE2DATA(node, off));

usr/src/common/avl/avl.c

287

avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance)

usr/src/common/avl/avl.c

366

tree->avl_root = child;

usr/src/common/avl/avl.c

449

tree->avl_root = gchild;

usr/src/common/avl/avl.c

466

avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where)

usr/src/common/avl/avl.c

473

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

475

ASSERT(tree);

usr/src/common/avl/avl.c

485

++tree->avl_numnodes;

usr/src/common/avl/avl.c

497

ASSERT(tree->avl_root == NULL);

usr/src/common/avl/avl.c

498

tree->avl_root = node;

usr/src/common/avl/avl.c

540

(void) avl_rotation(tree, node, new_balance);

usr/src/common/avl/avl.c

557

avl_tree_t *tree,

usr/src/common/avl/avl.c

568

ASSERT(tree != NULL);

usr/src/common/avl/avl.c

577

node = AVL_DATA2NODE(here, tree->avl_offset);

usr/src/common/avl/avl.c

580

diff = tree->avl_compar(new_data, here);

usr/src/common/avl/avl.c

591

diff = tree->avl_compar(new_data,

usr/src/common/avl/avl.c

592

AVL_NODE2DATA(node, tree->avl_offset));

usr/src/common/avl/avl.c

600

diff = tree->avl_compar(new_data,

usr/src/common/avl/avl.c

601

AVL_NODE2DATA(node, tree->avl_offset));

usr/src/common/avl/avl.c

609

avl_insert(tree, new_data, AVL_MKINDEX(node, child));

usr/src/common/avl/avl.c

616

avl_add(avl_tree_t *tree, void *new_node)

usr/src/common/avl/avl.c

628

if (avl_find(tree, new_node, &where) != NULL)

usr/src/common/avl/avl.c

635

avl_insert(tree, new_node, where);

usr/src/common/avl/avl.c

662

avl_remove(avl_tree_t *tree, void *data)

usr/src/common/avl/avl.c

673

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

675

ASSERT(tree);

usr/src/common/avl/avl.c

721

tree->avl_root = node;

usr/src/common/avl/avl.c

742

ASSERT(tree->avl_numnodes > 0);

usr/src/common/avl/avl.c

743

--tree->avl_numnodes;

usr/src/common/avl/avl.c

759

tree->avl_root = node;

usr/src/common/avl/avl.c

802

else if (!avl_rotation(tree, node, new_balance))

usr/src/common/avl/avl.c

807

#define AVL_REINSERT(tree, obj) \

usr/src/common/avl/avl.c

808

avl_remove((tree), (obj)); \

usr/src/common/avl/avl.c

809

avl_add((tree), (obj))

usr/src/common/avl/avl.c

887

avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *),

usr/src/common/avl/avl.c

890

ASSERT(tree);

usr/src/common/avl/avl.c

898

tree->avl_compar = compar;

usr/src/common/avl/avl.c

899

tree->avl_root = NULL;

usr/src/common/avl/avl.c

900

tree->avl_numnodes = 0;

usr/src/common/avl/avl.c

901

tree->avl_size = size;

usr/src/common/avl/avl.c

902

tree->avl_offset = offset;

usr/src/common/avl/avl.c

910

avl_destroy(avl_tree_t *tree)

usr/src/common/avl/avl.c

912

ASSERT(tree);

usr/src/common/avl/avl.c

913

ASSERT(tree->avl_numnodes == 0);

usr/src/common/avl/avl.c

914

ASSERT(tree->avl_root == NULL);

usr/src/common/avl/avl.c

922

avl_numnodes(avl_tree_t *tree)

usr/src/common/avl/avl.c

924

ASSERT(tree);

usr/src/common/avl/avl.c

925

return (tree->avl_numnodes);

usr/src/common/avl/avl.c

929

avl_is_empty(avl_tree_t *tree)

usr/src/common/avl/avl.c

931

ASSERT(tree);

usr/src/common/avl/avl.c

932

return (tree->avl_numnodes == 0);

usr/src/common/avl/avl.c

957

avl_destroy_nodes(avl_tree_t *tree, void **cookie)

usr/src/common/avl/avl.c

963

size_t off = tree->avl_offset;

usr/src/common/avl/avl.c

969

first = avl_first(tree);

usr/src/common/avl/avl.c

989

if (tree->avl_root != NULL) {

usr/src/common/avl/avl.c

990

ASSERT(tree->avl_numnodes == 1);

usr/src/common/avl/avl.c

991

tree->avl_root = NULL;

usr/src/common/avl/avl.c

992

tree->avl_numnodes = 0;

usr/src/lib/gss_mechs/mech_krb5/krb5/krb/walk_rtree.c

122

krb5_walk_realm_tree(krb5_context context, const krb5_data *client, const krb5_data *server, krb5_principal **tree, int realm_branch_char)

usr/src/lib/gss_mechs/mech_krb5/krb5/krb/walk_rtree.c

418

*tree = rettree;

usr/src/lib/gss_mechs/mech_krb5/krb5/krb/walk_rtree.c

423

if ((*tree)[i])

usr/src/lib/gss_mechs/mech_krb5/krb5/krb/walk_rtree.c

424

krb5int_dbgref_dump_principal("krb5_walk_realm_tree tree",(*tree)[i]);

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal.c

152

unsigned int filterlen=0, tree=0, ntree=1, i=0;

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal.c

204

for (tree=0; tree < ntree; ++tree) {

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal.c

206

LDAP_SEARCH(subtree[tree], ldap_context->lrparams->search_scope, filter, principal_attributes);

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

135

for (tree=0; tree < ntrees && *nentries == 0; ++tree) {

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

137

LDAP_SEARCH(subtree[tree], ldap_context->lrparams->search_scope, filter, principal_attributes);

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

520

int tree = 0, princlen = 0, numlentries = 0;

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

550

for (tree = 0; found_entry == FALSE && tree < ntrees; ++tree) {

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

553

LDAP_SEARCH_1(subtreelist[tree], ldap_context->lrparams->search_scope, filter, principal_attributes, IGNORE_STATUS);

usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ldap_principal2.c

87

unsigned int tree=0, ntrees=1, princlen=0;

usr/src/lib/libidmap/common/idmap_cache.c

1000

avl_insert(&idmap_cache.gid2sid_winname.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

1003

if ((avl_numnodes(&idmap_cache.gid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1035

result = avl_find(&idmap_cache.sid2uid_gid.tree, &find, &where);

usr/src/lib/libidmap/common/idmap_cache.c

1079

avl_insert(&idmap_cache.sid2uid_gid.tree, new, where);

usr/src/lib/libidmap/common/idmap_cache.c

1081

if ((avl_numnodes(&idmap_cache.sid2uid_gid.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1102

result = avl_find(&idmap_cache.uid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

1132

avl_insert(&idmap_cache.uid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

1135

if ((avl_numnodes(&idmap_cache.uid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1149

result = avl_find(&idmap_cache.gid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

1179

avl_insert(&idmap_cache.gid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

1182

if ((avl_numnodes(&idmap_cache.gid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1216

result = avl_find(&idmap_cache.winname2uid_gid.tree, &find,

usr/src/lib/libidmap/common/idmap_cache.c

1249

avl_insert(&idmap_cache.winname2uid_gid.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

1252

if ((avl_numnodes(&idmap_cache.winname2uid_gid.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1272

result = avl_find(&idmap_cache.uid2sid_winname.tree, &find,

usr/src/lib/libidmap/common/idmap_cache.c

1309

avl_insert(&idmap_cache.uid2sid_winname.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

1312

if ((avl_numnodes(&idmap_cache.uid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1346

result = avl_find(&idmap_cache.winname2uid_gid.tree, &find,

usr/src/lib/libidmap/common/idmap_cache.c

136

avl_tree_t tree;

usr/src/lib/libidmap/common/idmap_cache.c

1380

avl_insert(&idmap_cache.winname2uid_gid.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

1383

if ((avl_numnodes(&idmap_cache.winname2uid_gid.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1403

result = avl_find(&idmap_cache.gid2sid_winname.tree, &find,

usr/src/lib/libidmap/common/idmap_cache.c

1441

avl_insert(&idmap_cache.gid2sid_winname.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

1444

if ((avl_numnodes(&idmap_cache.gid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

1463

while (avl_numnodes(&cache->tree) > limit) {

usr/src/lib/libidmap/common/idmap_cache.c

1467

avl_remove(&cache->tree, item);

usr/src/lib/libidmap/common/idmap_cache.c

148

avl_tree_t tree;

usr/src/lib/libidmap/common/idmap_cache.c

1489

while (avl_numnodes(&cache->tree) > limit) {

usr/src/lib/libidmap/common/idmap_cache.c

1493

avl_remove(&cache->tree, item);

usr/src/lib/libidmap/common/idmap_cache.c

1515

while (avl_numnodes(&cache->tree) > limit) {

usr/src/lib/libidmap/common/idmap_cache.c

1519

avl_remove(&cache->tree, item);

usr/src/lib/libidmap/common/idmap_cache.c

160

avl_tree_t tree;

usr/src/lib/libidmap/common/idmap_cache.c

293

avl_create(&idmap_cache.sid2uid_gid.tree,

usr/src/lib/libidmap/common/idmap_cache.c

305

avl_create(&idmap_cache.uid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

318

avl_create(&idmap_cache.gid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

331

avl_create(&idmap_cache.winname2uid_gid.tree,

usr/src/lib/libidmap/common/idmap_cache.c

358

&idmap_cache.sid2uid_gid.tree, &cookie)) != NULL) {

usr/src/lib/libidmap/common/idmap_cache.c

362

avl_destroy(&idmap_cache.sid2uid_gid.tree);

usr/src/lib/libidmap/common/idmap_cache.c

363

avl_create(&idmap_cache.sid2uid_gid.tree,

usr/src/lib/libidmap/common/idmap_cache.c

379

&idmap_cache.uid2sid_winname.tree, &cookie)) != NULL) {

usr/src/lib/libidmap/common/idmap_cache.c

386

avl_destroy(&idmap_cache.uid2sid_winname.tree);

usr/src/lib/libidmap/common/idmap_cache.c

387

avl_create(&idmap_cache.uid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

404

&idmap_cache.gid2sid_winname.tree, &cookie)) != NULL) {

usr/src/lib/libidmap/common/idmap_cache.c

411

avl_destroy(&idmap_cache.gid2sid_winname.tree);

usr/src/lib/libidmap/common/idmap_cache.c

412

avl_create(&idmap_cache.gid2sid_winname.tree,

usr/src/lib/libidmap/common/idmap_cache.c

428

&idmap_cache.winname2uid_gid.tree, &cookie)) != NULL) {

usr/src/lib/libidmap/common/idmap_cache.c

434

avl_destroy(&idmap_cache.winname2uid_gid.tree);

usr/src/lib/libidmap/common/idmap_cache.c

435

avl_create(&idmap_cache.winname2uid_gid.tree,

usr/src/lib/libidmap/common/idmap_cache.c

495

result = avl_find(&idmap_cache.sid2uid_gid.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

526

result = avl_find(&idmap_cache.sid2uid_gid.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

558

result = avl_find(&idmap_cache.sid2uid_gid.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

594

result = avl_find(&idmap_cache.uid2sid_winname.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

626

result = avl_find(&idmap_cache.gid2sid_winname.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

658

result = avl_find(&idmap_cache.uid2sid_winname.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

703

result = avl_find(&idmap_cache.gid2sid_winname.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

750

result = avl_find(&idmap_cache.winname2uid_gid.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

780

result = avl_find(&idmap_cache.winname2uid_gid.tree, &entry, &where);

usr/src/lib/libidmap/common/idmap_cache.c

813

result = avl_find(&idmap_cache.sid2uid_gid.tree, &find, &where);

usr/src/lib/libidmap/common/idmap_cache.c

838

avl_insert(&idmap_cache.sid2uid_gid.tree, new, where);

usr/src/lib/libidmap/common/idmap_cache.c

840

if ((avl_numnodes(&idmap_cache.sid2uid_gid.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

860

result = avl_find(&idmap_cache.uid2sid_winname.tree, &find,

usr/src/lib/libidmap/common/idmap_cache.c

888

avl_insert(&idmap_cache.uid2sid_winname.tree, new,

usr/src/lib/libidmap/common/idmap_cache.c

891

if ((avl_numnodes(&idmap_cache.uid2sid_winname.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

925

result = avl_find(&idmap_cache.sid2uid_gid.tree, &find, &where);

usr/src/lib/libidmap/common/idmap_cache.c

950

avl_insert(&idmap_cache.sid2uid_gid.tree, new, where);

usr/src/lib/libidmap/common/idmap_cache.c

952

if ((avl_numnodes(&idmap_cache.sid2uid_gid.tree) >

usr/src/lib/libidmap/common/idmap_cache.c

972

result = avl_find(&idmap_cache.gid2sid_winname.tree, &find,

usr/src/lib/libprtdiag/common/cpu.c

112

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag/common/cpu.c

134

for (bnode = tree->bd_list; bnode != NULL; bnode = bnode->next)

usr/src/lib/libprtdiag/common/display_sun4u.c

105

display_cpu_devices(tree);

usr/src/lib/libprtdiag/common/display_sun4u.c

108

display_memoryconf(tree);

usr/src/lib/libprtdiag/common/display_sun4u.c

111

(void) display_io_devices(tree);

usr/src/lib/libprtdiag/common/display_sun4u.c

118

display_hp_fail_fault(tree, kstats);

usr/src/lib/libprtdiag/common/display_sun4u.c

121

root, tree, kstats);

usr/src/lib/libprtdiag/common/display_sun4u.c

129

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag/common/display_sun4u.c

132

tree = tree;

usr/src/lib/libprtdiag/common/display_sun4u.c

142

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag/common/display_sun4u.c

145

tree = tree;

usr/src/lib/libprtdiag/common/display_sun4u.c

155

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag/common/display_sun4u.c

158

tree = tree;

usr/src/lib/libprtdiag/common/display_sun4u.c

167

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag/common/display_sun4u.c

173

tree = tree;

usr/src/lib/libprtdiag/common/display_sun4u.c

183

resolve_board_types(Sys_tree *tree)

usr/src/lib/libprtdiag/common/display_sun4u.c

186

tree = tree;

usr/src/lib/libprtdiag/common/display_sun4u.c

58

display(Sys_tree *tree,

usr/src/lib/libprtdiag/common/display_sun4u.c

72

exit_code = error_check(tree, kstats);

usr/src/lib/libprtdiag/common/display_sun4u.c

99

display_memorysize(tree, kstats, &memory_total);

usr/src/lib/libprtdiag/common/display_sun4v.c

118

sun4v_display(Sys_tree *tree, Prom_node *root, int log,

usr/src/lib/libprtdiag/common/display_sun4v.c

158

display_memorysize(tree, NULL, &memory_total);

usr/src/lib/libprtdiag/common/io.c

263

display_io_devices(Sys_tree *tree)

usr/src/lib/libprtdiag/common/io.c

279

bnode = tree->bd_list;

usr/src/lib/libprtdiag/common/kstat.c

60

read_platform_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat,

usr/src/lib/libprtdiag/common/kstat.c

70

read_sun4u_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat)

usr/src/lib/libprtdiag/common/kstat.c

90

read_platform_kstats(tree, sys_kstat, ep);

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

138

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

160

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

172

pnode->child = walk_di_tree(tree, pnode, curnode);

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

177

return (walk_di_tree(tree, root, curnode));

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

179

pnode->sibling = walk_di_tree(tree, root, curnode);

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

53

static Prom_node *walk_di_tree(Sys_tree *tree, Prom_node *root,

usr/src/lib/libprtdiag/common/libdevinfo_sun4u.c

71

walk_di_tree(Sys_tree *tree, Prom_node *root, di_node_t di_node)

usr/src/lib/libprtdiag/common/memory.c

112

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag/common/memory.c

87

display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats,

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

160

walk(Sys_tree *tree, Prom_node *root, int id)

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

216

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

243

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

257

pnode->child = walk(tree, pnode, curnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

262

return (walk(tree, root, curnode));

usr/src/lib/libprtdiag/common/pdevinfo_sun4u.c

264

pnode->sibling = walk(tree, root, curnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

146

sun4v_walk(Sys_tree *tree, Prom_node *root, int id)

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

196

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

203

add_node(tree, pnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

217

pnode->child = sun4v_walk(tree, pnode, curnode);

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

222

return (sun4v_walk(tree, root, curnode));

usr/src/lib/libprtdiag/common/pdevinfo_sun4v.c

224

pnode->sibling = sun4v_walk(tree, root, curnode);

usr/src/lib/libprtdiag/common/prom.c

90

platform_disp_prom_version(Sys_tree *tree)

usr/src/lib/libprtdiag/common/prom.c

95

bnode = tree->bd_list;

usr/src/lib/libprtdiag/inc/libprtdiag.h

106

void display_io_devices(Sys_tree *tree);

usr/src/lib/libprtdiag/inc/libprtdiag.h

132

void read_platform_kstats(Sys_tree *tree,

usr/src/lib/libprtdiag/inc/libprtdiag.h

140

void display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats,

usr/src/lib/libprtdiag/inc/libprtdiag.h

142

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag/inc/libprtdiag.h

77

int error_check(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag/inc/libprtdiag.h

78

int disp_fail_parts(Sys_tree *tree);

usr/src/lib/libprtdiag/inc/libprtdiag.h

79

void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag/inc/libprtdiag.h

80

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

105

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

232

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

234

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

262

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

282

display_hw_revisions(root, tree->bd_list);

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

71

void display_cpu_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

74

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

77

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/cherrystone/common/cherrystone.c

94

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

109

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

116

if (disp_fail_parts(tree)) {

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

134

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

138

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

237

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

240

(void) disp_fail_parts(tree);

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

244

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

246

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

276

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

296

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

591

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

612

dak_display_hw_revisions(root, tree->bd_list);

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

80

void display_cpu_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

84

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/daktari/common/daktari.c

87

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

106

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

118

if (disp_fail_parts(tree)) {

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

137

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

141

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

244

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

251

(void) disp_fail_parts(tree);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

255

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

276

dt_disp_asic_revs(tree);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

278

platform_disp_prom_version(tree);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

312

dt_disp_asic_revs(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

327

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

90

int error_check(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

91

int disp_fail_parts(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

92

void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/desktop/common/desktop.c

93

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

103

if (disp_fail_parts(tree) || disp_envc_status(kstats)) {

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

1149

tazjav_disp_asic_revs(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

1165

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

133

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

155

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

230

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

234

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

355

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

361

(void) disp_fail_parts(tree);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

366

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

385

tazjav_disp_asic_revs(tree);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

387

platform_disp_prom_version(tree);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

70

int error_check(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

71

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

72

int disp_fail_parts(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

73

void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

74

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

756

read_platform_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat,

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

80

void read_platform_kstats(Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

855

walk(Sys_tree *tree, Prom_node *root, int id)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

912

add_node(tree, pnode);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

92

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

932

add_node(tree, pnode);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

946

pnode->child = walk(tree, pnode, curnode);

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

951

return (walk(tree, root, curnode));

usr/src/lib/libprtdiag_psr/sparc/javelin/common/javelin.c

953

pnode->sibling = walk(tree, root, curnode);

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

104

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

109

if (disp_fail_parts(tree) || disp_envc_status())

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

119

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

138

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

234

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

236

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

264

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

285

lneck_display_hw_revisions(root, tree->bd_list);

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

458

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

462

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

76

int error_check(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

77

void display_cpu_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

80

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/littleneck/common/littleneck.c

83

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

100

static void opl_disp_hw_revisions(Sys_tree *tree, Prom_node *root);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

162

display_io_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

179

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

248

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

289

for (bnode = tree->bd_list; bnode != NULL; bnode = bnode->next) {

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

505

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

507

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

546

for (bnode = tree->bd_list; bnode != NULL; bnode = bnode->next) {

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

662

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

666

opl_disp_hw_revisions(tree, root);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

674

opl_disp_hw_revisions(Sys_tree *tree, Prom_node *root)

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

87

void display_cpu_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

89

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

91

void display_io_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/opl/common/opl.c

92

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1176

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1205

serengeti_display_hw_revisions(root, tree->bd_list);

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

133

void display_cpu_devices(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

135

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

137

void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

139

int display_failed_parts(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

140

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1564

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1578

display_failed_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1584

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

175

static int tree = DEVINFO_TREE;

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1755

schizo_failed = display_schizo_revisions(tree->bd_list,

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1769

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1771

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1933

if (tree == DEVINFO_TREE)

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1961

if (tree == DEVINFO_TREE) {

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

1989

if (tree == DEVINFO_TREE) {

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

2017

if (tree == DEVINFO_TREE) {

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

2062

tree = OBP_TREE; /* Switch to the OBP tree */

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

2073

tree = DEVINFO_TREE; /* Switch back to the DEVINFO tree */

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

918

display_cpu_devices(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/serengeti/common/serengeti.c

946

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

106

if (disp_fail_parts(tree) || disp_envctrl_status(tree, kstats)) {

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

1244

check_disk_presence(Sys_tree *tree, int *i4disk, int *i8disk, int *j8disk)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

1255

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

1357

tazjav_disp_asic_revs(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

136

display_memoryconf(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

1373

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

158

bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

233

disp_fail_parts(Sys_tree *tree)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

237

Board_node *bnode = tree->bd_list;

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

361

display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

367

(void) disp_fail_parts(tree);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

372

display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

389

(void) disp_envctrl_status(tree, kstats);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

391

tazjav_disp_asic_revs(tree);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

393

platform_disp_prom_version(tree);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

70

int error_check(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

71

void display_memoryconf(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

72

int disp_fail_parts(Sys_tree *tree);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

73

void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

74

void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

759

read_platform_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat,

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

80

void read_platform_kstats(Sys_tree *tree,

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

820

walk(Sys_tree *tree, Prom_node *root, int id)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

877

add_node(tree, pnode);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

897

add_node(tree, pnode);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

911

pnode->child = walk(tree, pnode, curnode);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

916

return (walk(tree, root, curnode));

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

918

pnode->sibling = walk(tree, root, curnode);

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

941

disp_envctrl_status(Sys_tree *tree, struct system_kstat_data *sys_kstats)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

95

error_check(Sys_tree *tree, struct system_kstat_data *kstats)

usr/src/lib/libprtdiag_psr/sparc/tazmo/common/tazmo.c

974

check_disk_presence(tree, &first_4disk_bp, &first_8disk_bp,

usr/src/lib/libresolv2/common/isc/tree.c

100

tree_srch(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t), tree_t p_user) {

usr/src/lib/libresolv2/common/isc/tree.c

127

tree_add(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t),

usr/src/lib/libresolv2/common/isc/tree.c

139

tree_delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t),

usr/src/lib/libresolv2/common/isc/tree.c

150

tree_trav(tree **ppr_tree, int (*pfi_uar)(tree_t)) {

usr/src/lib/libresolv2/common/isc/tree.c

166

tree_mung(tree **ppr_tree, void (*pfv_uar)(tree_t)) {

usr/src/lib/libresolv2/common/isc/tree.c

173

memput(*ppr_tree, sizeof(tree));

usr/src/lib/libresolv2/common/isc/tree.c

179

static tree *

usr/src/lib/libresolv2/common/isc/tree.c

180

sprout(tree **ppr, tree_t p_data, int *pi_balance,

usr/src/lib/libresolv2/common/isc/tree.c

183

tree *p1, *p2, *sub;

usr/src/lib/libresolv2/common/isc/tree.c

193

*ppr = (tree *) memget(sizeof(tree));

usr/src/lib/libresolv2/common/isc/tree.c

334

delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t), tree_t p_user,

usr/src/lib/libresolv2/common/isc/tree.c

337

tree *pr_q;

usr/src/lib/libresolv2/common/isc/tree.c

381

memput(pr_q, sizeof(tree));

usr/src/lib/libresolv2/common/isc/tree.c

388

del(tree **ppr_r, int *pi_balance, tree **ppr_q,

usr/src/lib/libresolv2/common/isc/tree.c

412

bal_L(tree **ppr_p, int *pi_balance) {

usr/src/lib/libresolv2/common/isc/tree.c

413

tree *p1, *p2;

usr/src/lib/libresolv2/common/isc/tree.c

472

bal_R(tree **ppr_p, int *pi_balance) {

usr/src/lib/libresolv2/common/isc/tree.c

473

tree *p1, *p2;

usr/src/lib/libresolv2/common/isc/tree.c

86

static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)());

usr/src/lib/libresolv2/common/isc/tree.c

87

static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *);

usr/src/lib/libresolv2/common/isc/tree.c

88

static void del(tree **, int *, tree **, void (*)(), int *);

usr/src/lib/libresolv2/common/isc/tree.c

89

static void bal_L(tree **, int *);

usr/src/lib/libresolv2/common/isc/tree.c

90

static void bal_R(tree **, int *);

usr/src/lib/libresolv2/common/isc/tree.c

93

tree_init(tree **ppr_tree) {

usr/src/lib/libresolv2/include/isc/tree.h

50

void tree_init __P((tree **));

usr/src/lib/libresolv2/include/isc/tree.h

51

tree_t tree_srch __P((tree **, int (*)(), tree_t));

usr/src/lib/libresolv2/include/isc/tree.h

52

tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)()));

usr/src/lib/libresolv2/include/isc/tree.h

53

int tree_delete __P((tree **, int (*)(), tree_t, void (*)()));

usr/src/lib/libresolv2/include/isc/tree.h

54

int tree_trav __P((tree **, int (*)()));

usr/src/lib/libresolv2/include/isc/tree.h

55

void tree_mung __P((tree **, void (*)()));

usr/src/lib/libshare/common/libshare.c

1001

SA_LEGACY_DFSTAB, &handle->tree);

usr/src/lib/libshare/common/libshare.c

1004

handle->tree,

usr/src/lib/libshare/common/libshare.c

1053

&handle->tree, paths, paths_len);

usr/src/lib/libshare/common/libshare.c

1068

&handle->tree, ptr_to_path, 1);

usr/src/lib/libshare/common/libshare.c

1082

&handle->tree, ptr_to_path, 1);

usr/src/lib/libshare/common/libshare.c

1087

&handle->tree);

usr/src/lib/libshare/common/libshare.c

1134

remove_handle_for_root(impl_handle->tree);

usr/src/lib/libshare/common/libshare.c

1253

if (impl_handle != NULL && impl_handle->tree != NULL) {

usr/src/lib/libshare/common/libshare.c

1270

node = find_group_by_name(impl_handle->tree,

usr/src/lib/libshare/common/libshare.c

1951

node = xmlNewChild(impl_handle->tree, NULL, (xmlChar *)"group",

usr/src/lib/libshare/common/libshare.c

2016

node = xmlNewChild(impl_handle->tree, NULL,

usr/src/lib/libshare/common/libshare.c

949

handle->tree = xmlNewNode(NULL,

usr/src/lib/libshare/common/libshare.c

952

handle->tree != NULL) {

usr/src/lib/libshare/common/libshare.c

954

handle->tree);

usr/src/lib/libshare/common/libshare.c

955

err = add_handle_for_root(handle->tree,

usr/src/lib/libshare/common/libshare.c

960

handle->tree, handle);

usr/src/lib/libshare/common/libshare.c

964

if (handle->tree != NULL)

usr/src/lib/libshare/common/libshare.c

965

xmlFreeNode(handle->tree);

usr/src/lib/libshare/common/libshare_impl.h

110

xmlNodePtr tree;

usr/src/lib/libsqlite/src/btree_rb.c

1026

static int memRbtreeClearTable(Rbtree* tree, int n)

usr/src/lib/libsqlite/src/btree_rb.c

1031

pTree = sqliteHashFind(&tree->tblHash, 0, n);

usr/src/lib/libsqlite/src/btree_rb.c

1044

if( tree->eTransState == TRANS_ROLLBACK ){

usr/src/lib/libsqlite/src/btree_rb.c

1056

btreeLogRollbackOp(tree, pRollbackOp);

usr/src/lib/libsqlite/src/btree_rb.c

1225

static int memRbtreeGetMeta(Rbtree* tree, int* aMeta)

usr/src/lib/libsqlite/src/btree_rb.c

1227

memcpy( aMeta, tree->aMetaData, sizeof(int) * SQLITE_N_BTREE_META );

usr/src/lib/libsqlite/src/btree_rb.c

1231

static int memRbtreeUpdateMeta(Rbtree* tree, int* aMeta)

usr/src/lib/libsqlite/src/btree_rb.c

1233

memcpy( tree->aMetaData, aMeta, sizeof(int) * SQLITE_N_BTREE_META );

usr/src/lib/libsqlite/src/btree_rb.c

1242

static char *memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot)

usr/src/lib/libsqlite/src/btree_rb.c

1247

for(p=sqliteHashFirst(&tree->tblHash); p; p=sqliteHashNext(p)){

usr/src/lib/libsqlite/src/btree_rb.c

1255

static int memRbtreeSetCacheSize(Rbtree* tree, int sz)

usr/src/lib/libsqlite/src/btree_rb.c

1264

static int memRbtreeBeginTrans(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

1266

if( tree->eTransState != TRANS_NONE )

usr/src/lib/libsqlite/src/btree_rb.c

1269

assert( tree->pTransRollback == 0 );

usr/src/lib/libsqlite/src/btree_rb.c

1270

tree->eTransState = TRANS_INTRANSACTION;

usr/src/lib/libsqlite/src/btree_rb.c

1287

static int memRbtreeCommit(Rbtree* tree){

usr/src/lib/libsqlite/src/btree_rb.c

1289

deleteRollbackList(tree->pCheckRollback);

usr/src/lib/libsqlite/src/btree_rb.c

1290

deleteRollbackList(tree->pTransRollback);

usr/src/lib/libsqlite/src/btree_rb.c

1291

tree->pTransRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1292

tree->pCheckRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1293

tree->pCheckRollbackTail = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1294

tree->eTransState = TRANS_NONE;

usr/src/lib/libsqlite/src/btree_rb.c

1301

static int memRbtreeClose(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

1304

memRbtreeCommit(tree);

usr/src/lib/libsqlite/src/btree_rb.c

1305

while( (p=sqliteHashFirst(&tree->tblHash))!=0 ){

usr/src/lib/libsqlite/src/btree_rb.c

1306

tree->eTransState = TRANS_ROLLBACK;

usr/src/lib/libsqlite/src/btree_rb.c

1307

memRbtreeDropTable(tree, sqliteHashKeysize(p));

usr/src/lib/libsqlite/src/btree_rb.c

1309

sqliteHashClear(&tree->tblHash);

usr/src/lib/libsqlite/src/btree_rb.c

1310

sqliteFree(tree);

usr/src/lib/libsqlite/src/btree_rb.c

1361

static int memRbtreeRollback(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

1363

tree->eTransState = TRANS_ROLLBACK;

usr/src/lib/libsqlite/src/btree_rb.c

1364

execute_rollback_list(tree, tree->pCheckRollback);

usr/src/lib/libsqlite/src/btree_rb.c

1365

execute_rollback_list(tree, tree->pTransRollback);

usr/src/lib/libsqlite/src/btree_rb.c

1366

tree->pTransRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1367

tree->pCheckRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1368

tree->pCheckRollbackTail = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1369

tree->eTransState = TRANS_NONE;

usr/src/lib/libsqlite/src/btree_rb.c

1373

static int memRbtreeBeginCkpt(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

1375

if( tree->eTransState != TRANS_INTRANSACTION )

usr/src/lib/libsqlite/src/btree_rb.c

1378

assert( tree->pCheckRollback == 0 );

usr/src/lib/libsqlite/src/btree_rb.c

1379

assert( tree->pCheckRollbackTail == 0 );

usr/src/lib/libsqlite/src/btree_rb.c

1380

tree->eTransState = TRANS_INCHECKPOINT;

usr/src/lib/libsqlite/src/btree_rb.c

1384

static int memRbtreeCommitCkpt(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

1386

if( tree->eTransState == TRANS_INCHECKPOINT ){

usr/src/lib/libsqlite/src/btree_rb.c

1387

if( tree->pCheckRollback ){

usr/src/lib/libsqlite/src/btree_rb.c

1388

tree->pCheckRollbackTail->pNext = tree->pTransRollback;

usr/src/lib/libsqlite/src/btree_rb.c

1389

tree->pTransRollback = tree->pCheckRollback;

usr/src/lib/libsqlite/src/btree_rb.c

1390

tree->pCheckRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1391

tree->pCheckRollbackTail = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1393

tree->eTransState = TRANS_INTRANSACTION;

usr/src/lib/libsqlite/src/btree_rb.c

1398

static int memRbtreeRollbackCkpt(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

140

static int memRbtreeClearTable(Rbtree* tree, int n);

usr/src/lib/libsqlite/src/btree_rb.c

1400

if( tree->eTransState != TRANS_INCHECKPOINT ) return SQLITE_OK;

usr/src/lib/libsqlite/src/btree_rb.c

1401

tree->eTransState = TRANS_ROLLBACK;

usr/src/lib/libsqlite/src/btree_rb.c

1402

execute_rollback_list(tree, tree->pCheckRollback);

usr/src/lib/libsqlite/src/btree_rb.c

1403

tree->pCheckRollback = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1404

tree->pCheckRollbackTail = 0;

usr/src/lib/libsqlite/src/btree_rb.c

1405

tree->eTransState = TRANS_INTRANSACTION;

usr/src/lib/libsqlite/src/btree_rb.c

1410

static int memRbtreePageDump(Rbtree* tree, int pgno, int rec)

usr/src/lib/libsqlite/src/btree_rb.c

1423

static struct Pager *memRbtreePager(Rbtree* tree)

usr/src/lib/libsqlite/src/btree_rb.c

328

static void check_redblack_tree(BtRbTree * tree, char ** msg)

usr/src/lib/libsqlite/src/btree_rb.c

337

pNode = tree->pHead;

usr/src/lib/libsqlite/src/btree_rb.c

364

*msg = append_node(*msg, tree->pHead, 0);

usr/src/lib/libsqlite/src/btree_rb.c

384

*msg = append_node(*msg, tree->pHead, 0);

usr/src/lib/libsqlite/src/btree_rb.c

644

static int memRbtreeCreateTable(Rbtree* tree, int* n)

usr/src/lib/libsqlite/src/btree_rb.c

646

assert( tree->eTransState != TRANS_NONE );

usr/src/lib/libsqlite/src/btree_rb.c

648

*n = tree->next_idx++;

usr/src/lib/libsqlite/src/btree_rb.c

649

btreeCreateTable(tree, *n);

usr/src/lib/libsqlite/src/btree_rb.c

654

if( tree->eTransState != TRANS_ROLLBACK ){

usr/src/lib/libsqlite/src/btree_rb.c

659

btreeLogRollbackOp(tree, pRollbackOp);

usr/src/lib/libsqlite/src/btree_rb.c

668

static int memRbtreeDropTable(Rbtree* tree, int n)

usr/src/lib/libsqlite/src/btree_rb.c

671

assert( tree->eTransState != TRANS_NONE );

usr/src/lib/libsqlite/src/btree_rb.c

673

memRbtreeClearTable(tree, n);

usr/src/lib/libsqlite/src/btree_rb.c

674

pTree = sqliteHashInsert(&tree->tblHash, 0, n, 0);

usr/src/lib/libsqlite/src/btree_rb.c

679

if( tree->eTransState != TRANS_ROLLBACK ){

usr/src/lib/libsqlite/src/btree_rb.c

684

btreeLogRollbackOp(tree, pRollbackOp);

usr/src/lib/libsqlite/src/btree_rb.c

715

Rbtree* tree,

usr/src/lib/libsqlite/src/btree_rb.c

721

assert(tree);

usr/src/lib/libsqlite/src/btree_rb.c

724

pCur->pTree = sqliteHashFind(&tree->tblHash, 0, iTable);

usr/src/lib/libsqlite/src/btree_rb.c

726

pCur->pRbtree = tree;

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

124

__m_decode_free(tree)

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

125

t_decode **tree;

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

127

if (*tree != (t_decode *) 0) {

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

128

__m_decode_free(&(*tree)->sibling);

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

129

__m_decode_free(&(*tree)->child);

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

130

free(*tree);

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

131

*tree = (t_decode *) 0;

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

139

__m_decode_init(tree)

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

140

t_decode **tree;

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

145

*tree = (t_decode *) 0;

usr/src/lib/libxcurses/src/libc/xcurses/keypad.c

148

len = decode_add(tree, cur_term->_str[**p], (*p)[1]);

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

127

__m_decode_free(t_decode **tree)

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

129

if (*tree != NULL) {

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

130

__m_decode_free(&(*tree)->sibling);

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

131

__m_decode_free(&(*tree)->child);

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

132

free(*tree);

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

133

*tree = NULL;

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

141

__m_decode_init(t_decode **tree)

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

146

*tree = NULL;

usr/src/lib/libxcurses2/src/libc/xcurses/keypad.c

149

len = decode_add(tree, cur_term->_str[**p], (*p)[1]);

usr/src/lib/libzfs/common/libzfs_dataset.c

5375

nvlist_t *config, *tree, **vdevs;

usr/src/lib/libzfs/common/libzfs_dataset.c

5380

if (nvlist_lookup_nvlist(config, ZPOOL_CONFIG_VDEV_TREE, &tree) != 0 ||

usr/src/lib/libzfs/common/libzfs_dataset.c

5381

nvlist_lookup_nvlist_array(tree, ZPOOL_CONFIG_CHILDREN,

usr/src/lib/libzfs/common/libzfs_pool.c

3364

nvlist_t *tree, *config, **child, **newchild, *newconfig = NULL;

usr/src/lib/libzfs/common/libzfs_pool.c

3384

verify(nvlist_lookup_nvlist(config, ZPOOL_CONFIG_VDEV_TREE, &tree)

usr/src/lib/libzfs/common/libzfs_pool.c

3395

if (nvlist_lookup_nvlist_array(tree, ZPOOL_CONFIG_CHILDREN, &child,

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

428

smb_netconnectinfo_t *tree;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

441

tree = &item->nsi_un.nsi_tree;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

445

ci0->coni0_id = tree->ci_id;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

450

ci1->coni1_id = tree->ci_id;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

451

ci1->coni1_type = tree->ci_type;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

452

ci1->coni1_num_opens = tree->ci_numopens;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

453

ci1->coni1_num_users = tree->ci_numusers;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

454

ci1->coni1_time = tree->ci_time;

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

456

NDR_STRDUP(mxa, tree->ci_username);

usr/src/lib/smbsrv/libmlsvc/common/srvsvc_svc.c

458

NDR_STRDUP(mxa, tree->ci_share);

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

345

smb_netconnectinfo_t *tree;

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

366

tree = &item->nsi_un.nsi_tree;

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

367

free(tree->ci_username);

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

368

free(tree->ci_share);

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

397

smb_netconnectinfo_t *tree;

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

429

tree = &items->nsi_un.nsi_tree;

usr/src/lib/smbsrv/libsmb/common/smb_kmod.c

430

rc = smb_netconnectinfo_decode(tree, data, len,

usr/src/psm/stand/boot/common/heap_kmem.c

124

void insert(Dblk p, size_t len, Freehdr *tree);

usr/src/psm/stand/boot/common/heap_kmem.c

210

Freehdr *tree) /* Address of ptr to root */

usr/src/psm/stand/boot/common/heap_kmem.c

217

x = *tree;

usr/src/psm/stand/boot/common/heap_kmem.c

226

tree = &x->left;

usr/src/psm/stand/boot/common/heap_kmem.c

228

tree = &x->right;

usr/src/psm/stand/boot/common/heap_kmem.c

229

x = *tree;

usr/src/psm/stand/boot/common/heap_kmem.c

241

*tree = newhdr;

usr/src/tools/smatch/src/expression.c

136

static struct token *parse_type(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

139

*tree = alloc_expression(token->pos, EXPR_TYPE);

usr/src/tools/smatch/src/expression.c

145

(*tree)->symbol = sym;

usr/src/tools/smatch/src/expression.c

150

struct expression **tree)

usr/src/tools/smatch/src/expression.c

171

*tree = expr;

usr/src/tools/smatch/src/expression.c

176

struct expression **tree)

usr/src/tools/smatch/src/expression.c

202

*tree = expr;

usr/src/tools/smatch/src/expression.c

373

struct token *primary_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

475

*tree = expr;

usr/src/tools/smatch/src/expression.c

498

static struct token *postfix_expression(struct token *token, struct expression **tree, struct expression *cast_init_expr)

usr/src/tools/smatch/src/expression.c

569

*tree = expr;

usr/src/tools/smatch/src/expression.c

573

static struct token *cast_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.c

574

static struct token *unary_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.c

577

struct expression **tree, int type)

usr/src/tools/smatch/src/expression.c

582

*tree = expr;

usr/src/tools/smatch/src/expression.c

615

static struct token *unary_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

633

return type_info_expression(token, tree, type_information[i].type);

usr/src/tools/smatch/src/expression.c

649

*tree = NULL;

usr/src/tools/smatch/src/expression.c

655

*tree = unary;

usr/src/tools/smatch/src/expression.c

667

*tree = NULL;

usr/src/tools/smatch/src/expression.c

673

*tree = unary;

usr/src/tools/smatch/src/expression.c

687

*tree = label;

usr/src/tools/smatch/src/expression.c

693

return postfix_expression(token, tree, NULL);

usr/src/tools/smatch/src/expression.c

704

static struct token *cast_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

724

return postfix_expression(token, tree, cast);

usr/src/tools/smatch/src/expression.c

726

*tree = cast;

usr/src/tools/smatch/src/expression.c

736

return unary_expression(token, tree);

usr/src/tools/smatch/src/expression.c

752

#define LR_BINOP_EXPRESSION(__token, tree, type, inner, compare) \

usr/src/tools/smatch/src/expression.c

776

*tree = left; \

usr/src/tools/smatch/src/expression.c

779

static struct token *multiplicative_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

782

token, tree, EXPR_BINOP, cast_expression,

usr/src/tools/smatch/src/expression.c

787

static struct token *additive_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

790

token, tree, EXPR_BINOP, multiplicative_expression,

usr/src/tools/smatch/src/expression.c

795

static struct token *shift_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

798

token, tree, EXPR_BINOP, additive_expression,

usr/src/tools/smatch/src/expression.c

803

static struct token *relational_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

806

token, tree, EXPR_COMPARE, shift_expression,

usr/src/tools/smatch/src/expression.c

812

static struct token *equality_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

815

token, tree, EXPR_COMPARE, relational_expression,

usr/src/tools/smatch/src/expression.c

820

static struct token *bitwise_and_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

823

token, tree, EXPR_BINOP, equality_expression,

usr/src/tools/smatch/src/expression.c

828

static struct token *bitwise_xor_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

831

token, tree, EXPR_BINOP, bitwise_and_expression,

usr/src/tools/smatch/src/expression.c

836

static struct token *bitwise_or_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

839

token, tree, EXPR_BINOP, bitwise_xor_expression,

usr/src/tools/smatch/src/expression.c

844

static struct token *logical_and_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

847

token, tree, EXPR_LOGICAL, bitwise_or_expression,

usr/src/tools/smatch/src/expression.c

852

static struct token *logical_or_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

855

token, tree, EXPR_LOGICAL, logical_and_expression,

usr/src/tools/smatch/src/expression.c

860

struct token *conditional_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

862

token = logical_or_expression(token, tree);

usr/src/tools/smatch/src/expression.c

863

if (*tree && match_op(token, '?')) {

usr/src/tools/smatch/src/expression.c

866

expr->left = *tree;

usr/src/tools/smatch/src/expression.c

867

*tree = expr;

usr/src/tools/smatch/src/expression.c

875

struct token *assignment_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

877

token = conditional_expression(token, tree);

usr/src/tools/smatch/src/expression.c

878

if (*tree && token_type(token) == TOKEN_SPECIAL) {

usr/src/tools/smatch/src/expression.c

890

expr->left = *tree;

usr/src/tools/smatch/src/expression.c

892

*tree = expr;

usr/src/tools/smatch/src/expression.c

899

static struct token *comma_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

902

token, tree, EXPR_COMMA, assignment_expression,

usr/src/tools/smatch/src/expression.c

907

struct token *parse_expression(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/expression.c

909

return comma_expression(token,tree);

usr/src/tools/smatch/src/expression.h

278

struct token *parse_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.h

279

struct token *conditional_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.h

280

struct token *primary_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.h

282

struct token *assignment_expression(struct token *token, struct expression **tree);

usr/src/tools/smatch/src/expression.h

325

struct token *initializer(struct expression **tree, struct token *token);

usr/src/tools/smatch/src/expression.h

329

#define constant_expression(token,tree) conditional_expression(token, tree)

usr/src/tools/smatch/src/parse.c

2070

static struct token *expression_statement(struct token *token, struct expression **tree)

usr/src/tools/smatch/src/parse.c

2075

token = parse_expression(token, tree);

usr/src/tools/smatch/src/parse.c

2517

static struct token *statement(struct token *token, struct statement **tree)

usr/src/tools/smatch/src/parse.c

2521

*tree = stmt;

usr/src/tools/smatch/src/parse.c

2533

return statement(token, tree);

usr/src/tools/smatch/src/parse.c

2758

struct token *initializer(struct expression **tree, struct token *token)

usr/src/tools/smatch/src/parse.c

2762

*tree = expr;

usr/src/tools/smatch/src/parse.c

2766

return assignment_expression(token, tree);

usr/src/tools/smatch/src/parse.c

51

static struct token *statement(struct token *token, struct statement **tree);

usr/src/uts/common/fs/nfs/nfs4_subr.c

115

avl_node_t tree; /* AVL tree link */

usr/src/uts/common/fs/nfs/nfs4_subr.c

2395

offsetof(rddir4_cache_impl, tree));

usr/src/uts/common/fs/nfs/nfs_auth.c

1451

avl_tree_t *tree = exi->exi_cache[i];

usr/src/uts/common/fs/nfs/nfs_auth.c

1455

while ((node = avl_destroy_nodes(tree, &cookie)) != NULL)

usr/src/uts/common/fs/nfs/nfs_auth.c

1518

avl_tree_t *tree;

usr/src/uts/common/fs/nfs/nfs_auth.c

1521

tree = exi->exi_cache[i];

usr/src/uts/common/fs/nfs/nfs_auth.c

1529

for (c = avl_first(tree); c != NULL; c = AVL_NEXT(tree, c)) {

usr/src/uts/common/fs/nfs/nfs_auth.c

1589

for (c = avl_first(tree); c != NULL; c = nextc) {

usr/src/uts/common/fs/nfs/nfs_auth.c

1590

nextc = AVL_NEXT(tree, c);

usr/src/uts/common/fs/nfs/nfs_auth.c

1595

avl_remove(tree, c);

usr/src/uts/common/fs/nfs/nfs_auth.c

862

avl_tree_t *tree;

usr/src/uts/common/fs/nfs/nfs_auth.c

906

tree = exi->exi_cache[hash(&addr)];

usr/src/uts/common/fs/nfs/nfs_auth.c

909

c = (struct auth_cache_clnt *)avl_find(tree, &acc, NULL);

usr/src/uts/common/fs/nfs/nfs_auth.c

936

c = (struct auth_cache_clnt *)avl_find(tree, &acc, &where);

usr/src/uts/common/fs/nfs/nfs_auth.c

938

avl_insert(tree, nc, where);

usr/src/uts/common/fs/nfs/nfs_subr.c

2593

offsetof(rddir_cache, tree));

usr/src/uts/common/fs/proc/prcontrol.c

2621

avl_tree_t *tree;

usr/src/uts/common/fs/proc/prcontrol.c

2629

tree = &p->p_wpage;

usr/src/uts/common/fs/proc/prcontrol.c

2631

tree = &as->a_wpage;

usr/src/uts/common/fs/proc/prcontrol.c

2636

for (pwp = avl_first(tree); pwp != NULL;

usr/src/uts/common/fs/proc/prcontrol.c

2637

pwp = AVL_NEXT(tree, pwp)) {

usr/src/uts/common/fs/proc/prsubr.c

4299

avl_tree_t *tree;

usr/src/uts/common/fs/proc/prsubr.c

4305

tree = &p->p_wpage;

usr/src/uts/common/fs/proc/prsubr.c

4307

tree = &as->a_wpage;

usr/src/uts/common/fs/proc/prsubr.c

4311

pwp = avl_find(tree, &tpw, &where);

usr/src/uts/common/fs/proc/prsubr.c

4313

pwp = avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/fs/proc/prsubr.c

4364

pwp = AVL_NEXT(tree, pwp);

usr/src/uts/common/fs/smbclnt/smbfs/smbfs_node.h

73

avl_node_t tree; /* AVL tree links */

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1422

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1428

if (smb_idpool_alloc(&tree->t_fid_pool, &fid))

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1472

smb_tree_hold_internal(tree);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1473

of->f_tree = tree;

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1476

smb_lavl_enter(&tree->t_ofile_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1477

smb_lavl_insert(&tree->t_ofile_list, of);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1478

smb_lavl_exit(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1479

atomic_inc_32(&tree->t_open_files);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

1532

smb_idpool_free(&tree->t_fid_pool, fid);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

498

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_durable.c

539

tree->t_resource, str_node->od_name, u32);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

551

tree->t_resource, str_node->od_name, u64);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

562

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

565

if (smb_strcasecmp(s, tree->t_sharename, 0) != 0) {

usr/src/uts/common/fs/smbsrv/smb2_durable.c

569

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

580

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

590

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

601

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

612

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

623

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

635

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

648

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

680

tree->t_resource, str_node->od_name, status);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

698

tree->t_resource, str_node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

710

tree->t_resource, str_node->od_name, rc);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

729

tree->t_resource, str_node->od_name, status);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

786

tree->t_resource,

usr/src/uts/common/fs/smbsrv/smb2_durable.c

799

tree->t_resource,

usr/src/uts/common/fs/smbsrv/smb2_durable.c

876

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_durable.c

886

tree->t_resource, node->od_name, rc);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

893

tree->t_resource, node->od_name,

usr/src/uts/common/fs/smbsrv/smb2_durable.c

910

tree->t_resource, node->od_name, rc);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

915

tree->t_resource, node->od_name);

usr/src/uts/common/fs/smbsrv/smb2_durable.c

922

tree->t_resource, node->od_name, rc);

usr/src/uts/common/fs/smbsrv/smb2_qinfo_file.c

734

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_file.c

744

s_vfs = SMB_NODE_VFS(tree->t_snode);

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

105

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

108

snode = tree->t_snode;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

111

LabelLength = smb_wcequiv_strlen(tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

118

&tree->t_create_time, /* (T) */

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

123

tree->t_volume); /* (U) */

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

137

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

140

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

166

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

169

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

195

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

200

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

222

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

229

switch (tree->t_res_type & STYPE_MASK) {

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

248

if (tree->t_flags & SMB_TREE_UNICODE_ON_DISK)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

250

if (tree->t_flags & SMB_TREE_SUPPORTS_ACLS)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

252

if ((tree->t_flags & SMB_TREE_CASEINSENSITIVE) == 0)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

254

if (tree->t_flags & SMB_TREE_STREAMS)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

256

if (tree->t_flags & SMB_TREE_QUOTA)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

258

if (tree->t_flags & SMB_TREE_SPARSE)

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

279

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

282

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

381

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

386

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_qinfo_fs.c

99

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_setinfo_fs.c

71

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_setinfo_fs.c

73

if (!STYPE_ISDSK(tree->t_res_type))

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

110

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

115

switch (tree->t_res_type & STYPE_MASK) {

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

132

if (tree->t_encrypt != SMB_CONFIG_DISABLED)

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

138

if ((tree->t_flags & SMB_TREE_DFSROOT) != 0)

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

140

if ((tree->t_flags & SMB_TREE_CA) != 0)

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

153

tree->t_access); /* l */

usr/src/uts/common/fs/smbsrv/smb2_tree_connect.c

30

smb_tree_t *tree = NULL;

usr/src/uts/common/fs/smbsrv/smb_common_open.c

1232

smb_idpool_free(&tree->t_fid_pool, tree_fid);

usr/src/uts/common/fs/smbsrv/smb_common_open.c

251

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_common_open.c

321

if (smb_idpool_alloc(&tree->t_fid_pool, &tree_fid))

usr/src/uts/common/fs/smbsrv/smb_find.c

230

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_find.c

263

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_find.c

268

(void) strncpy(name, tree->t_volume, sizeof (name));

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

164

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

171

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

173

if (!STYPE_ISDSK(tree->t_res_type)) {

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

182

snode = tree->t_snode;

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

212

length = smb_wcequiv_strlen(tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

217

rc = smb_msgbuf_encode(&mb, "U", tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

225

length = strlen(tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

227

fsid.val[0], length, tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

238

length = smb_wcequiv_strlen(tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

241

length = strlen(tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

253

tree->t_volume);

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

292

if (tree->t_flags & SMB_TREE_UNICODE_ON_DISK)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

295

if (tree->t_flags & SMB_TREE_SUPPORTS_ACLS)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

298

if ((tree->t_flags & SMB_TREE_CASEINSENSITIVE) == 0)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

301

if (tree->t_flags & SMB_TREE_STREAMS)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

304

if (tree->t_flags & SMB_TREE_QUOTA)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

307

if (tree->t_flags & SMB_TREE_SPARSE)

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

447

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

450

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_fsinfo.c

451

if (!STYPE_ISDSK(tree->t_res_type)) {

usr/src/uts/common/fs/smbsrv/smb_node.c

1158

smb_node_getshrpath(smb_node_t *node, smb_tree_t *tree,

usr/src/uts/common/fs/smbsrv/smb_node.c

1164

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_node.c

1165

ASSERT(tree->t_snode);

usr/src/uts/common/fs/smbsrv/smb_node.c

1167

rc = smb_node_getpath(node, tree->t_snode->vp, buf, buflen);

usr/src/uts/common/fs/smbsrv/smb_odir.c

1022

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

1029

tree = od->d_tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

1030

smb_llist_enter(&tree->t_odir_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb_odir.c

1031

smb_llist_remove(&tree->t_odir_list, od);

usr/src/uts/common/fs/smbsrv/smb_odir.c

1033

smb_idpool_free(&tree->t_odid_pool, od->d_odid);

usr/src/uts/common/fs/smbsrv/smb_odir.c

1034

atomic_dec_32(&tree->t_session->s_dir_cnt);

usr/src/uts/common/fs/smbsrv/smb_odir.c

1035

smb_llist_exit(&tree->t_odir_list);

usr/src/uts/common/fs/smbsrv/smb_odir.c

284

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

296

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

302

tree->t_snode, tree->t_snode, &dnode, pattern);

usr/src/uts/common/fs/smbsrv/smb_odir.c

316

if (smb_idpool_alloc(&tree->t_odid_pool, &odid)) {

usr/src/uts/common/fs/smbsrv/smb_odir.c

455

smb_tree_t *tree = od->d_tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

474

smb_llist_post(&tree->t_odir_list, od,

usr/src/uts/common/fs/smbsrv/smb_odir.c

923

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

932

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

947

od->d_session = tree->t_session;

usr/src/uts/common/fs/smbsrv/smb_odir.c

955

od->d_tree = tree;

usr/src/uts/common/fs/smbsrv/smb_odir.c

966

if (smb_tree_has_feature(tree, SMB_TREE_CASEINSENSITIVE))

usr/src/uts/common/fs/smbsrv/smb_odir.c

968

if (smb_tree_has_feature(tree, SMB_TREE_SHORTNAMES))

usr/src/uts/common/fs/smbsrv/smb_odir.c

970

if (smb_tree_has_feature(tree, SMB_TREE_ACEMASKONACCESS))

usr/src/uts/common/fs/smbsrv/smb_odir.c

980

smb_llist_enter(&tree->t_odir_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb_odir.c

981

smb_llist_insert_tail(&tree->t_odir_list, od);

usr/src/uts/common/fs/smbsrv/smb_odir.c

982

smb_llist_exit(&tree->t_odir_list);

usr/src/uts/common/fs/smbsrv/smb_odir.c

984

atomic_inc_32(&tree->t_session->s_dir_cnt);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1418

smb_tree_t *tree = of->f_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1427

smb_lavl_enter(&tree->t_ofile_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1428

smb_lavl_remove(&tree->t_ofile_list, of);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1429

smb_lavl_exit(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1449

smb_idpool_free(&tree->t_fid_pool, of->f_fid);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1486

smb_tree_t *tree = of->f_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1492

if (tree != NULL) {

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1497

smb_lavl_enter(&tree->t_ofile_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1498

smb_lavl_remove(&tree->t_ofile_list, of);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1499

smb_lavl_exit(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1570

smb_tree_t *tree = of->f_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1577

if (tree != NULL) {

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1579

smb_idpool_free(&tree->t_fid_pool, of->f_fid);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1856

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1864

tree = of->f_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1866

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1880

if (node != tree->t_snode) {

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1881

rc = smb_node_getshrpath(node, tree, path, MAXPATHLEN);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

1886

(void) snprintf(buf, MAXPATHLEN, "%s:%s", tree->t_sharename,

usr/src/uts/common/fs/smbsrv/smb_ofile.c

340

smb_tree_t *tree = sr->tid_tree; /* optional */

usr/src/uts/common/fs/smbsrv/smb_ofile.c

397

if (tree != NULL) {

usr/src/uts/common/fs/smbsrv/smb_ofile.c

398

smb_tree_hold_internal(tree);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

399

of->f_tree = tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

419

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

448

smb_lavl_enter(&tree->t_ofile_list, RW_WRITER);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

449

smb_lavl_insert(&tree->t_ofile_list, of);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

450

smb_lavl_exit(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

451

atomic_inc_32(&tree->t_open_files);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

687

smb_tree_t *tree,

usr/src/uts/common/fs/smbsrv/smb_ofile.c

693

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

694

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

696

la = &tree->t_ofile_list;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

703

ASSERT(of->f_tree == tree);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

865

smb_tree_t *tree = of->f_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

881

ASSERT(tree != NULL);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

884

smb_lavl_post(&tree->t_ofile_list, of,

usr/src/uts/common/fs/smbsrv/smb_ofile.c

893

if (tree == NULL) {

usr/src/uts/common/fs/smbsrv/smb_ofile.c

898

smb_lavl_post(&tree->t_ofile_list, of,

usr/src/uts/common/fs/smbsrv/smb_ofile.c

931

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

937

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

941

lavl = &tree->t_ofile_list;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

978

smb_ofile_lookup_by_uniqid(smb_tree_t *tree, uint32_t uniqid)

usr/src/uts/common/fs/smbsrv/smb_ofile.c

983

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_ofile.c

985

lavl = &tree->t_ofile_list;

usr/src/uts/common/fs/smbsrv/smb_ofile.c

991

ASSERT(of->f_tree == tree);

usr/src/uts/common/fs/smbsrv/smb_query_fileinfo.c

852

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_query_fileinfo.c

859

len = snprintf(buf, buflen, "\\%s", tree->t_sharename);

usr/src/uts/common/fs/smbsrv/smb_query_fileinfo.c

867

if (node == tree->t_snode) {

usr/src/uts/common/fs/smbsrv/smb_query_fileinfo.c

873

rc = smb_node_getshrpath(node, tree, buf, buflen);

usr/src/uts/common/fs/smbsrv/smb_server.c

2081

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_server.c

2091

tree = smb_llist_head(tlist);

usr/src/uts/common/fs/smbsrv/smb_server.c

2093

while (tree != NULL) {

usr/src/uts/common/fs/smbsrv/smb_server.c

2094

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_server.c

2095

rc = smb_tree_enum(tree, svcenum);

usr/src/uts/common/fs/smbsrv/smb_server.c

2096

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_server.c

2101

tree = smb_llist_next(tlist, tree);

usr/src/uts/common/fs/smbsrv/smb_server.c

2174

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_server.c

2185

tree = smb_llist_head(tlist);

usr/src/uts/common/fs/smbsrv/smb_server.c

2187

while ((tree != NULL) && (rc == ENOENT)) {

usr/src/uts/common/fs/smbsrv/smb_server.c

2188

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_server.c

2189

rc = smb_tree_fclose(tree, uniqid);

usr/src/uts/common/fs/smbsrv/smb_server.c

2190

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_server.c

2193

tree = smb_llist_next(tlist, tree);

usr/src/uts/common/fs/smbsrv/smb_server.c

2717

smb_spool_add_doc(smb_tree_t *tree, smb_kspooldoc_t *sp)

usr/src/uts/common/fs/smbsrv/smb_server.c

2720

smb_server_t *sv = tree->t_server;

usr/src/uts/common/fs/smbsrv/smb_session.c

1001

tree = smb_llist_head(&session->s_tree_list);

usr/src/uts/common/fs/smbsrv/smb_session.c

1003

while (tree) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1004

ASSERT3U(tree->t_magic, ==, SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_session.c

1005

ASSERT(tree->t_session == session);

usr/src/uts/common/fs/smbsrv/smb_session.c

1007

if (tree->t_tid == tid) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1008

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1010

return (tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1017

tree = smb_llist_next(&session->s_tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1034

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_session.c

1038

tree = smb_llist_head(tree_list);

usr/src/uts/common/fs/smbsrv/smb_session.c

1039

while (tree) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1040

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1041

smb_tree_close_pid(tree, pid);

usr/src/uts/common/fs/smbsrv/smb_session.c

1042

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1044

tree = smb_llist_next(tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1053

smb_tree_t *tree = arg;

usr/src/uts/common/fs/smbsrv/smb_session.c

1055

smb_tree_disconnect(tree, B_TRUE);

usr/src/uts/common/fs/smbsrv/smb_session.c

1057

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1069

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_session.c

1077

tree = smb_llist_head(tree_list);

usr/src/uts/common/fs/smbsrv/smb_session.c

1078

while (tree) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1079

if ((tree->t_owner == owner) &&

usr/src/uts/common/fs/smbsrv/smb_session.c

1080

smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1088

smb_llist_post(tree_list, tree, smb_session_tree_dtor);

usr/src/uts/common/fs/smbsrv/smb_session.c

1090

tree = smb_llist_next(tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1105

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_session.c

1109

tree = smb_llist_head(tree_list);

usr/src/uts/common/fs/smbsrv/smb_session.c

1110

while (tree) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1111

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1112

smb_llist_post(tree_list, tree,

usr/src/uts/common/fs/smbsrv/smb_session.c

1115

tree = smb_llist_next(tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1129

smb_tree_t *tree = arg;

usr/src/uts/common/fs/smbsrv/smb_session.c

1131

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1133

smb_tree_disconnect(tree, B_TRUE);

usr/src/uts/common/fs/smbsrv/smb_session.c

1134

smb_session_cancel_requests(tree->t_session, tree, NULL);

usr/src/uts/common/fs/smbsrv/smb_session.c

1137

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1150

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_session.c

1157

for (tree = smb_llist_head(ll);

usr/src/uts/common/fs/smbsrv/smb_session.c

1158

tree != NULL;

usr/src/uts/common/fs/smbsrv/smb_session.c

1159

tree = smb_llist_next(ll, tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1161

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_session.c

1162

ASSERT(tree->t_session == session);

usr/src/uts/common/fs/smbsrv/smb_session.c

1164

if (smb_strcasecmp(tree->t_sharename, sharename, 0) != 0)

usr/src/uts/common/fs/smbsrv/smb_session.c

1167

if (smb_tree_hold(tree)) {

usr/src/uts/common/fs/smbsrv/smb_session.c

1168

smb_llist_post(ll, tree,

usr/src/uts/common/fs/smbsrv/smb_session.c

912

smb_tree_t *tree,

usr/src/uts/common/fs/smbsrv/smb_session.c

923

(tree == NULL || sr->tid_tree == tree))

usr/src/uts/common/fs/smbsrv/smb_session.c

996

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1002

smb_tree_t *tree = (smb_tree_t *)arg;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1004

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1005

ASSERT(tree->t_state == SMB_TREE_STATE_DISCONNECTED);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1006

ASSERT(tree->t_refcnt == 0);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1008

smb_server_dec_trees(tree->t_server);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1010

session = tree->t_session;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1012

smb_llist_remove(&session->s_tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1013

smb_idpool_free(&session->s_tid_pool, tree->t_tid);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1024

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1025

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1027

tree->t_magic = (uint32_t)~SMB_TREE_MAGIC;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1029

if (tree->t_snode)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1030

smb_node_release(tree->t_snode);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1032

mutex_destroy(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1033

smb_lavl_destructor(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1034

smb_llist_destructor(&tree->t_odir_list);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1035

smb_idpool_destructor(&tree->t_fid_pool);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1036

smb_idpool_destructor(&tree->t_odid_pool);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1038

SMB_USER_VALID(tree->t_owner);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1039

smb_user_dec_trees(tree->t_owner);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1040

smb_user_release(tree->t_owner);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1042

kmem_cache_free(smb_cache_tree, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1050

smb_tree_is_connected_locked(smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1052

switch (tree->t_state) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

1107

smb_tree_getattr(const smb_kshare_t *si, smb_node_t *node, smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1114

smb_tree_get_creation(node, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1115

smb_tree_get_volname(vfsp, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1124

smb_tree_get_flags(si, realvfsp, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1130

smb_tree_get_flags(si, vfsp, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1133

if (tree->t_session->dialect >= SMB_VERS_3_0)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1134

tree->t_encrypt = si->shr_encrypt;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1136

tree->t_encrypt = SMB_CONFIG_DISABLED;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1145

smb_tree_get_creation(smb_node_t *node, smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1155

tree->t_create_time = attr.sa_crtime;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1162

smb_tree_get_volname(vfs_t *vfsp, smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1166

(void) strlcpy(tree->t_volume, "fake", SMB_VOLNAMELEN);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1176

(void) strlcpy(tree->t_volume, s, SMB_VOLNAMELEN);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1180

name = tree->t_volume;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1197

smb_tree_get_flags(const smb_kshare_t *si, vfs_t *vfsp, smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1199

smb_session_t *ssn = tree->t_session;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1276

(void) strlcpy(tree->t_typename, name, SMB_TYPENAMELEN);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1277

(void) smb_strupr((char *)tree->t_typename);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1300

tree->t_flags = flags;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1351

smb_tree_t *tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1353

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1355

od_list = &tree->t_odir_list;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1384

smb_tree_is_connected(smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1388

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1389

rb = smb_tree_is_connected_locked(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1390

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1402

smb_tree_close_odirs(smb_tree_t *tree, uint32_t pid)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1407

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1408

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1410

od_list = &tree->t_odir_list;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1418

ASSERT(od->d_tree == tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1433

smb_tree_set_execinfo(smb_tree_t *tree, smb_shr_execinfo_t *exec,

usr/src/uts/common/fs/smbsrv/smb_tree.c

1436

exec->e_sharename = tree->t_sharename;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1437

exec->e_winname = tree->t_owner->u_name;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1438

exec->e_userdom = tree->t_owner->u_domain;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1439

exec->e_srv_ipaddr = tree->t_session->local_ipaddr;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1440

exec->e_cli_ipaddr = tree->t_session->ipaddr;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1441

exec->e_cli_netbiosname = tree->t_session->workstation;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1442

exec->e_uid = crgetuid(tree->t_owner->u_cred);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1450

smb_tree_enum_private(smb_tree_t *tree, smb_svcenum_t *svcenum)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1467

rc = smb_tree_netinfo_encode(tree, pb, svcenum->se_bavail, &nbytes);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1482

smb_tree_netinfo_encode(smb_tree_t *tree, uint8_t *buf, size_t buflen,

usr/src/uts/common/fs/smbsrv/smb_tree.c

1488

smb_tree_netinfo_init(tree, &info);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1496

smb_tree_netinfo_username(smb_tree_t *tree, char **namestr, uint32_t *namelen)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1498

smb_user_t *user = tree->t_owner;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1521

smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *info)

usr/src/uts/common/fs/smbsrv/smb_tree.c

1523

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1525

info->ci_id = tree->t_tid;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1526

info->ci_type = tree->t_res_type;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1527

info->ci_numopens = tree->t_open_files;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1528

info->ci_numusers = tree->t_refcnt;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1529

info->ci_time = gethrestime_sec() - tree->t_connect_time;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1531

info->ci_sharelen = strlen(tree->t_sharename) + 1;

usr/src/uts/common/fs/smbsrv/smb_tree.c

1532

info->ci_share = smb_mem_strdup(tree->t_sharename);

usr/src/uts/common/fs/smbsrv/smb_tree.c

1534

smb_tree_netinfo_username(tree, &info->ci_username, &info->ci_namelen);

usr/src/uts/common/fs/smbsrv/smb_tree.c

200

static void smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *);

usr/src/uts/common/fs/smbsrv/smb_tree.c

308

smb_tree_disconnect(smb_tree_t *tree, boolean_t do_exec)

usr/src/uts/common/fs/smbsrv/smb_tree.c

313

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

315

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

316

ASSERT(tree->t_refcnt);

usr/src/uts/common/fs/smbsrv/smb_tree.c

318

if (!smb_tree_is_connected_locked(tree)) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

319

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

326

tree->t_state = SMB_TREE_STATE_DISCONNECTING;

usr/src/uts/common/fs/smbsrv/smb_tree.c

327

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

332

smb_ofile_close_all(tree, 0);

usr/src/uts/common/fs/smbsrv/smb_tree.c

336

smb_tree_close_odirs(tree, 0);

usr/src/uts/common/fs/smbsrv/smb_tree.c

338

if ((tree->t_execflags & SMB_EXEC_UNMAP) != 0) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

339

smb_tree_set_execinfo(tree, &execinfo, SMB_EXEC_UNMAP);

usr/src/uts/common/fs/smbsrv/smb_tree.c

340

(void) smb_kshare_exec(tree->t_server, &execinfo);

usr/src/uts/common/fs/smbsrv/smb_tree.c

349

smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

351

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

353

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

355

if (smb_tree_is_connected_locked(tree)) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

356

tree->t_refcnt++;

usr/src/uts/common/fs/smbsrv/smb_tree.c

357

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

361

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

375

smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

377

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

379

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

380

tree->t_refcnt++;

usr/src/uts/common/fs/smbsrv/smb_tree.c

381

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

392

smb_tree_t *tree)

usr/src/uts/common/fs/smbsrv/smb_tree.c

394

SMB_TREE_VALID(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

397

smb_lavl_flush(&tree->t_ofile_list);

usr/src/uts/common/fs/smbsrv/smb_tree.c

398

smb_llist_flush(&tree->t_odir_list);

usr/src/uts/common/fs/smbsrv/smb_tree.c

400

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

401

ASSERT(tree->t_refcnt);

usr/src/uts/common/fs/smbsrv/smb_tree.c

402

tree->t_refcnt--;

usr/src/uts/common/fs/smbsrv/smb_tree.c

404

switch (tree->t_state) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

406

if (tree->t_refcnt == 0) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

407

smb_session_t *ssn = tree->t_session;

usr/src/uts/common/fs/smbsrv/smb_tree.c

408

tree->t_state = SMB_TREE_STATE_DISCONNECTED;

usr/src/uts/common/fs/smbsrv/smb_tree.c

409

smb_llist_post(&ssn->s_tree_list, tree,

usr/src/uts/common/fs/smbsrv/smb_tree.c

420

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

428

smb_tree_t *tree,

usr/src/uts/common/fs/smbsrv/smb_tree.c

431

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

432

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

434

smb_ofile_close_all(tree, pid);

usr/src/uts/common/fs/smbsrv/smb_tree.c

435

smb_tree_close_odirs(tree, pid);

usr/src/uts/common/fs/smbsrv/smb_tree.c

442

smb_tree_has_feature(smb_tree_t *tree, uint32_t flags)

usr/src/uts/common/fs/smbsrv/smb_tree.c

444

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

445

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

447

return ((tree->t_flags & flags) == flags);

usr/src/uts/common/fs/smbsrv/smb_tree.c

457

smb_tree_enum(smb_tree_t *tree, smb_svcenum_t *svcenum)

usr/src/uts/common/fs/smbsrv/smb_tree.c

464

return (smb_tree_enum_private(tree, svcenum));

usr/src/uts/common/fs/smbsrv/smb_tree.c

466

lavl = &tree->t_ofile_list;

usr/src/uts/common/fs/smbsrv/smb_tree.c

489

smb_tree_fclose(smb_tree_t *tree, uint32_t uniqid)

usr/src/uts/common/fs/smbsrv/smb_tree.c

493

ASSERT(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

494

ASSERT(tree->t_magic == SMB_TREE_MAGIC);

usr/src/uts/common/fs/smbsrv/smb_tree.c

501

if ((of = smb_ofile_lookup_by_uniqid(tree, uniqid)) == NULL)

usr/src/uts/common/fs/smbsrv/smb_tree.c

674

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

750

tree = smb_tree_alloc(sr, si, snode, access, sr->sr_cfg->skc_execflags);

usr/src/uts/common/fs/smbsrv/smb_tree.c

752

if (tree == NULL)

usr/src/uts/common/fs/smbsrv/smb_tree.c

755

if (tree->t_flags & SMB_TREE_SHORTNAMES)

usr/src/uts/common/fs/smbsrv/smb_tree.c

758

if (tree->t_execflags & SMB_EXEC_MAP) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

759

smb_tree_set_execinfo(tree, &execinfo, SMB_EXEC_MAP);

usr/src/uts/common/fs/smbsrv/smb_tree.c

761

rc = smb_kshare_exec(tree->t_server, &execinfo);

usr/src/uts/common/fs/smbsrv/smb_tree.c

763

if ((rc != 0) && (tree->t_execflags & SMB_EXEC_TERM)) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

771

mutex_enter(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

772

tree->t_state = SMB_TREE_STATE_DISCONNECTING;

usr/src/uts/common/fs/smbsrv/smb_tree.c

773

mutex_exit(&tree->t_mutex);

usr/src/uts/common/fs/smbsrv/smb_tree.c

775

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

780

sr->tid_tree = tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

781

sr->smb_tid = tree->t_tid;

usr/src/uts/common/fs/smbsrv/smb_tree.c

803

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

850

tree = smb_tree_alloc(sr, si, snode, access, sr->sr_cfg->skc_execflags);

usr/src/uts/common/fs/smbsrv/smb_tree.c

854

if (tree == NULL)

usr/src/uts/common/fs/smbsrv/smb_tree.c

857

sr->tid_tree = tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

858

sr->smb_tid = tree->t_tid;

usr/src/uts/common/fs/smbsrv/smb_tree.c

872

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

893

tree = smb_tree_alloc(sr, si, NULL, ACE_ALL_PERMS, 0);

usr/src/uts/common/fs/smbsrv/smb_tree.c

894

if (tree == NULL)

usr/src/uts/common/fs/smbsrv/smb_tree.c

897

sr->tid_tree = tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

898

sr->smb_tid = tree->t_tid;

usr/src/uts/common/fs/smbsrv/smb_tree.c

911

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree.c

918

tree = kmem_cache_alloc(smb_cache_tree, KM_SLEEP);

usr/src/uts/common/fs/smbsrv/smb_tree.c

919

bzero(tree, sizeof (smb_tree_t));

usr/src/uts/common/fs/smbsrv/smb_tree.c

921

tree->t_session = session;

usr/src/uts/common/fs/smbsrv/smb_tree.c

922

tree->t_server = session->s_server;

usr/src/uts/common/fs/smbsrv/smb_tree.c

925

if (smb_tree_getattr(si, snode, tree) != 0) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

927

kmem_cache_free(smb_cache_tree, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

932

if (smb_idpool_constructor(&tree->t_fid_pool)) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

934

kmem_cache_free(smb_cache_tree, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

938

if (smb_idpool_constructor(&tree->t_odid_pool)) {

usr/src/uts/common/fs/smbsrv/smb_tree.c

939

smb_idpool_destructor(&tree->t_fid_pool);

usr/src/uts/common/fs/smbsrv/smb_tree.c

941

kmem_cache_free(smb_cache_tree, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

945

smb_lavl_constructor(&tree->t_ofile_list,

usr/src/uts/common/fs/smbsrv/smb_tree.c

949

smb_llist_constructor(&tree->t_odir_list, sizeof (smb_odir_t),

usr/src/uts/common/fs/smbsrv/smb_tree.c

952

(void) strlcpy(tree->t_sharename, si->shr_name,

usr/src/uts/common/fs/smbsrv/smb_tree.c

953

sizeof (tree->t_sharename));

usr/src/uts/common/fs/smbsrv/smb_tree.c

954

(void) strlcpy(tree->t_resource, si->shr_path,

usr/src/uts/common/fs/smbsrv/smb_tree.c

955

sizeof (tree->t_resource));

usr/src/uts/common/fs/smbsrv/smb_tree.c

957

mutex_init(&tree->t_mutex, NULL, MUTEX_DEFAULT, NULL);

usr/src/uts/common/fs/smbsrv/smb_tree.c

959

tree->t_refcnt = 1;

usr/src/uts/common/fs/smbsrv/smb_tree.c

960

tree->t_tid = tid;

usr/src/uts/common/fs/smbsrv/smb_tree.c

961

tree->t_res_type = stype;

usr/src/uts/common/fs/smbsrv/smb_tree.c

962

tree->t_state = SMB_TREE_STATE_CONNECTED;

usr/src/uts/common/fs/smbsrv/smb_tree.c

963

tree->t_magic = SMB_TREE_MAGIC;

usr/src/uts/common/fs/smbsrv/smb_tree.c

964

tree->t_access = access;

usr/src/uts/common/fs/smbsrv/smb_tree.c

965

tree->t_connect_time = gethrestime_sec();

usr/src/uts/common/fs/smbsrv/smb_tree.c

966

tree->t_execflags = execflags;

usr/src/uts/common/fs/smbsrv/smb_tree.c

971

tree->t_owner = sr->uid_user;

usr/src/uts/common/fs/smbsrv/smb_tree.c

974

if (tree->t_flags & SMB_TREE_READONLY)

usr/src/uts/common/fs/smbsrv/smb_tree.c

975

tree->t_access &= ~ACE_ALL_WRITE_PERMS;

usr/src/uts/common/fs/smbsrv/smb_tree.c

979

tree->t_snode = snode;

usr/src/uts/common/fs/smbsrv/smb_tree.c

980

tree->t_acltype = smb_fsop_acltype(snode);

usr/src/uts/common/fs/smbsrv/smb_tree.c

984

smb_llist_insert_head(&session->s_tree_list, tree);

usr/src/uts/common/fs/smbsrv/smb_tree.c

988

return (tree);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

308

smb_tree_t *tree;

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

314

tree = smb_session_lookup_tree(sr->session, sr->smb_tid);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

315

if (tree != NULL) {

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

316

smb_tree_disconnect(tree, B_TRUE);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

317

smb_session_cancel_requests(sr->session, tree, sr);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

318

smb_tree_release(tree);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

327

tree = sr->tid_tree;

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

329

switch (tree->t_res_type & STYPE_MASK) {

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

349

tree->t_typename);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

359

tree->t_typename);

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

367

tree->t_access, /* (l) */

usr/src/uts/common/fs/smbsrv/smb_tree_connect.c

372

tree->t_typename); /* (u) */

usr/src/uts/common/fs/smbsrv/smb_vss.c

346

smb_vss_get_count(smb_tree_t *tree, char *resource_path)

usr/src/uts/common/fs/smbsrv/smb_vss.c

354

rc = smb_kdoor_upcall(tree->t_server, SMB_DR_VSS_GET_COUNT,

usr/src/uts/common/fs/smbsrv/smb_vss.c

371

smb_vss_get_snapshots(smb_tree_t *tree, char *resource_path,

usr/src/uts/common/fs/smbsrv/smb_vss.c

380

(void) smb_kdoor_upcall(tree->t_server, SMB_DR_VSS_GET_SNAPSHOTS,

usr/src/uts/common/fs/smbsrv/smb_vss.c

397

smb_vss_map_gmttoken(smb_tree_t *tree, char *path, char *gmttoken,

usr/src/uts/common/fs/smbsrv/smb_vss.c

410

(void) smb_kdoor_upcall(tree->t_server, SMB_DR_VSS_MAP_GMTTOKEN,

usr/src/uts/common/fs/zfs/btree.c

1005

zfs_btree_verify_poison_at(tree, hdr,

usr/src/uts/common/fs/zfs/btree.c

1010

bt_shift_core(tree, cur, 0, hdr->bth_count, move_count,

usr/src/uts/common/fs/zfs/btree.c

1025

bt_transfer_core(tree, l_neighbor, move_idx, move_count, cur, 0,

usr/src/uts/common/fs/zfs/btree.c

1041

zfs_btree_poison_node(tree, &l_neighbor->btc_hdr);

usr/src/uts/common/fs/zfs/btree.c

1047

tree->bt_bulk = NULL;

usr/src/uts/common/fs/zfs/btree.c

1048

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

1055

zfs_btree_add_idx(zfs_btree_t *tree, const void *value,

usr/src/uts/common/fs/zfs/btree.c

1061

if (tree->bt_bulk != NULL) {

usr/src/uts/common/fs/zfs/btree.c

1062

if (where->bti_node != &tree->bt_bulk->btl_hdr) {

usr/src/uts/common/fs/zfs/btree.c

1063

zfs_btree_bulk_finish(tree);

usr/src/uts/common/fs/zfs/btree.c

1064

VERIFY3P(zfs_btree_find(tree, value, &idx), ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

1069

tree->bt_num_elems++;

usr/src/uts/common/fs/zfs/btree.c

1075

ASSERT3U(tree->bt_num_elems, ==, 1);

usr/src/uts/common/fs/zfs/btree.c

1076

ASSERT3S(tree->bt_height, ==, -1);

usr/src/uts/common/fs/zfs/btree.c

1077

ASSERT3P(tree->bt_root, ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

1080

tree->bt_num_nodes++;

usr/src/uts/common/fs/zfs/btree.c

1083

tree->bt_root = &leaf->btl_hdr;

usr/src/uts/common/fs/zfs/btree.c

1084

tree->bt_height++;

usr/src/uts/common/fs/zfs/btree.c

1090

zfs_btree_poison_node(tree, hdr);

usr/src/uts/common/fs/zfs/btree.c

1092

zfs_btree_insert_into_leaf(tree, leaf, value, 0);

usr/src/uts/common/fs/zfs/btree.c

1093

tree->bt_bulk = leaf;

usr/src/uts/common/fs/zfs/btree.c

1099

zfs_btree_insert_into_leaf(tree,

usr/src/uts/common/fs/zfs/btree.c

1118

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

112

zfs_btree_poison_node_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr,

usr/src/uts/common/fs/zfs/btree.c

1128

VERIFY3P(zfs_btree_first_helper(tree, subtree, &new_idx), !=,

usr/src/uts/common/fs/zfs/btree.c

1132

zfs_btree_insert_into_leaf(tree,

usr/src/uts/common/fs/zfs/btree.c

1136

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

1144

zfs_btree_first(zfs_btree_t *tree, zfs_btree_index_t *where)

usr/src/uts/common/fs/zfs/btree.c

1146

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

1147

ASSERT0(tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

1150

return (zfs_btree_first_helper(tree, tree->bt_root, where));

usr/src/uts/common/fs/zfs/btree.c

116

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

1182

zfs_btree_last(zfs_btree_t *tree, zfs_btree_index_t *where)

usr/src/uts/common/fs/zfs/btree.c

1184

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

1185

ASSERT0(tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

1188

return (zfs_btree_last_helper(tree, tree->bt_root, where));

usr/src/uts/common/fs/zfs/btree.c

1198

zfs_btree_next_helper(zfs_btree_t *tree, const zfs_btree_index_t *idx,

usr/src/uts/common/fs/zfs/btree.c

1203

ASSERT3S(tree->bt_height, ==, -1);

usr/src/uts/common/fs/zfs/btree.c

1225

new_off) * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1233

uint32_t i = zfs_btree_find_parent_idx(tree, prev);

usr/src/uts/common/fs/zfs/btree.c

1235

done_func(tree, prev);

usr/src/uts/common/fs/zfs/btree.c

1243

return (node->btc_elems + i * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1246

done_func(tree, prev);

usr/src/uts/common/fs/zfs/btree.c

1259

return (node->btc_elems + offset * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1267

return (zfs_btree_first_helper(tree, child, out_idx));

usr/src/uts/common/fs/zfs/btree.c

1275

zfs_btree_next(zfs_btree_t *tree, const zfs_btree_index_t *idx,

usr/src/uts/common/fs/zfs/btree.c

1278

return (zfs_btree_next_helper(tree, idx, out_idx, NULL));

usr/src/uts/common/fs/zfs/btree.c

128

ASSERT3U(idx, <=, tree->bt_leaf_cap);

usr/src/uts/common/fs/zfs/btree.c

1286

zfs_btree_prev(zfs_btree_t *tree, const zfs_btree_index_t *idx,

usr/src/uts/common/fs/zfs/btree.c

129

ASSERT3U(idx + count, <=, tree->bt_leaf_cap);

usr/src/uts/common/fs/zfs/btree.c

1290

ASSERT3S(tree->bt_height, ==, -1);

usr/src/uts/common/fs/zfs/btree.c

1311

offset - 1) * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1318

uint32_t i = zfs_btree_find_parent_idx(tree, prev);

usr/src/uts/common/fs/zfs/btree.c

1326

return (node->btc_elems + (i - 1) * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1342

return (zfs_btree_last_helper(tree, child, out_idx));

usr/src/uts/common/fs/zfs/btree.c

1353

zfs_btree_get(zfs_btree_t *tree, zfs_btree_index_t *idx)

usr/src/uts/common/fs/zfs/btree.c

1356

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

1368

zfs_btree_add(zfs_btree_t *tree, const void *node)

usr/src/uts/common/fs/zfs/btree.c

1371

VERIFY3P(zfs_btree_find(tree, node, &where), ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

1372

zfs_btree_add_idx(tree, node, &where);

usr/src/uts/common/fs/zfs/btree.c

1377

zfs_btree_node_destroy(zfs_btree_t *tree, zfs_btree_hdr_t *node)

usr/src/uts/common/fs/zfs/btree.c

1379

tree->bt_num_nodes--;

usr/src/uts/common/fs/zfs/btree.c

138

zfs_btree_verify_poison_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr,

usr/src/uts/common/fs/zfs/btree.c

1384

BTREE_CORE_ELEMS * tree->bt_elem_size);

usr/src/uts/common/fs/zfs/btree.c

1394

zfs_btree_remove_from_node(zfs_btree_t *tree, zfs_btree_core_t *node,

usr/src/uts/common/fs/zfs/btree.c

1397

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

1406

ASSERT3P(tree->bt_root, ==, node);

usr/src/uts/common/fs/zfs/btree.c

1408

tree->bt_root = node->btc_children[0];

usr/src/uts/common/fs/zfs/btree.c

1410

zfs_btree_node_destroy(tree, hdr);

usr/src/uts/common/fs/zfs/btree.c

1411

tree->bt_height--;

usr/src/uts/common/fs/zfs/btree.c

142

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

1432

bt_shift_core_left(tree, node, idx, hdr->bth_count - idx,

usr/src/uts/common/fs/zfs/btree.c

1435

zfs_btree_poison_node_at(tree, hdr, hdr->bth_count, 1);

usr/src/uts/common/fs/zfs/btree.c

1456

uint32_t parent_idx = zfs_btree_find_parent_idx(tree, hdr);

usr/src/uts/common/fs/zfs/btree.c

1469

bt_shift_core_right(tree, node, 0, idx - 1, BSS_TRAPEZOID);

usr/src/uts/common/fs/zfs/btree.c

1489

zfs_btree_poison_node_at(tree, l_hdr, l_hdr->bth_count, 1);

usr/src/uts/common/fs/zfs/btree.c

1504

bt_shift_core_left(tree, node, idx, hdr->bth_count - idx,

usr/src/uts/common/fs/zfs/btree.c

151

ASSERT3U(idx, <, tree->bt_leaf_cap);

usr/src/uts/common/fs/zfs/btree.c

153

if (idx >= tree->bt_leaf_cap - hdr->bth_first)

usr/src/uts/common/fs/zfs/btree.c

1531

bt_shift_core_left(tree, neighbor, 1, r_hdr->bth_count,

usr/src/uts/common/fs/zfs/btree.c

1533

zfs_btree_poison_node_at(tree, r_hdr, r_hdr->bth_count, 1);

usr/src/uts/common/fs/zfs/btree.c

1568

zfs_btree_verify_poison_at(tree, keep_hdr,

usr/src/uts/common/fs/zfs/btree.c

1581

bt_transfer_core(tree, rm, 0, new_rm_hdr->bth_count, keep,

usr/src/uts/common/fs/zfs/btree.c

1595

bt_shift_core_left(tree, keep, new_idx, keep_hdr->bth_count - new_idx,

usr/src/uts/common/fs/zfs/btree.c

1608

zfs_btree_poison_node_at(tree, keep_hdr, keep_hdr->bth_count, 1);

usr/src/uts/common/fs/zfs/btree.c

1611

zfs_btree_remove_from_node(tree, parent, new_rm_hdr);

usr/src/uts/common/fs/zfs/btree.c

1612

zfs_btree_node_destroy(tree, new_rm_hdr);

usr/src/uts/common/fs/zfs/btree.c

1617

zfs_btree_remove_idx(zfs_btree_t *tree, zfs_btree_index_t *where)

usr/src/uts/common/fs/zfs/btree.c

1619

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

1624

if (tree->bt_bulk != NULL) {

usr/src/uts/common/fs/zfs/btree.c

1631

uint8_t *value = zfs_btree_get(tree, where);

usr/src/uts/common/fs/zfs/btree.c

1634

zfs_btree_bulk_finish(tree);

usr/src/uts/common/fs/zfs/btree.c

1635

VERIFY3P(zfs_btree_find(tree, tmp, where), !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

1641

tree->bt_num_elems--;

usr/src/uts/common/fs/zfs/btree.c

1651

void *new_value = zfs_btree_last_helper(tree, left_subtree,

usr/src/uts/common/fs/zfs/btree.c

1671

uint32_t min_count = (tree->bt_leaf_cap / 2) - 1;

usr/src/uts/common/fs/zfs/btree.c

1678

bt_shrink_leaf(tree, leaf, idx, 1);

usr/src/uts/common/fs/zfs/btree.c

1680

ASSERT0(tree->bt_height);

usr/src/uts/common/fs/zfs/btree.c

1682

tree->bt_root = NULL;

usr/src/uts/common/fs/zfs/btree.c

1683

tree->bt_height--;

usr/src/uts/common/fs/zfs/btree.c

1684

zfs_btree_node_destroy(tree, &leaf->btl_hdr);

usr/src/uts/common/fs/zfs/btree.c

1687

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

1706

uint32_t parent_idx = zfs_btree_find_parent_idx(tree, hdr);

usr/src/uts/common/fs/zfs/btree.c

1719

bt_shift_leaf(tree, leaf, 0, idx, 1, BSD_RIGHT);

usr/src/uts/common/fs/zfs/btree.c

1732

bt_shrink_leaf(tree, neighbor, l_hdr->bth_count - 1, 1);

usr/src/uts/common/fs/zfs/btree.c

1733

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

1749

bt_shift_leaf(tree, leaf, idx + 1, hdr->bth_count - idx - 1,

usr/src/uts/common/fs/zfs/btree.c

1763

bt_shrink_leaf(tree, neighbor, 0, 1);

usr/src/uts/common/fs/zfs/btree.c

1764

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

177

zfs_btree_create(zfs_btree_t *tree, int (*compar) (const void *, const void *),

usr/src/uts/common/fs/zfs/btree.c

1797

zfs_btree_verify_poison_at(tree, k_hdr,

usr/src/uts/common/fs/zfs/btree.c

1806

bt_shrink_leaf(tree, leaf, idx, 1);

usr/src/uts/common/fs/zfs/btree.c

1810

bt_grow_leaf(tree, keep, k_count, 1 + rm_hdr->bth_count);

usr/src/uts/common/fs/zfs/btree.c

1819

bt_transfer_leaf(tree, rm, 0, rm_hdr->bth_count, keep, k_count + 1);

usr/src/uts/common/fs/zfs/btree.c

182

bzero(tree, sizeof (*tree));

usr/src/uts/common/fs/zfs/btree.c

1822

zfs_btree_remove_from_node(tree, parent, rm_hdr);

usr/src/uts/common/fs/zfs/btree.c

1823

zfs_btree_node_destroy(tree, rm_hdr);

usr/src/uts/common/fs/zfs/btree.c

1824

zfs_btree_verify(tree);

usr/src/uts/common/fs/zfs/btree.c

1829

zfs_btree_remove(zfs_btree_t *tree, const void *value)

usr/src/uts/common/fs/zfs/btree.c

183

tree->bt_compar = compar;

usr/src/uts/common/fs/zfs/btree.c

1832

VERIFY3P(zfs_btree_find(tree, value, &where), !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

1833

zfs_btree_remove_idx(tree, &where);

usr/src/uts/common/fs/zfs/btree.c

1838

zfs_btree_numnodes(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

184

tree->bt_elem_size = size;

usr/src/uts/common/fs/zfs/btree.c

1840

return (tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

185

tree->bt_leaf_cap = P2ALIGN(BTREE_LEAF_ESIZE / size, 2);

usr/src/uts/common/fs/zfs/btree.c

186

tree->bt_height = -1;

usr/src/uts/common/fs/zfs/btree.c

1862

zfs_btree_destroy_nodes(zfs_btree_t *tree, zfs_btree_index_t **cookie)

usr/src/uts/common/fs/zfs/btree.c

1865

if (tree->bt_height == -1)

usr/src/uts/common/fs/zfs/btree.c

1868

return (zfs_btree_first(tree, *cookie));

usr/src/uts/common/fs/zfs/btree.c

187

tree->bt_bulk = NULL;

usr/src/uts/common/fs/zfs/btree.c

1871

void *rval = zfs_btree_next_helper(tree, *cookie, *cookie,

usr/src/uts/common/fs/zfs/btree.c

1874

tree->bt_root = NULL;

usr/src/uts/common/fs/zfs/btree.c

1875

tree->bt_height = -1;

usr/src/uts/common/fs/zfs/btree.c

1876

tree->bt_num_elems = 0;

usr/src/uts/common/fs/zfs/btree.c

1878

tree->bt_bulk = NULL;

usr/src/uts/common/fs/zfs/btree.c

1884

zfs_btree_clear_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

1889

zfs_btree_clear_helper(tree, btc->btc_children[i]);

usr/src/uts/common/fs/zfs/btree.c

1892

zfs_btree_node_destroy(tree, hdr);

usr/src/uts/common/fs/zfs/btree.c

1896

zfs_btree_clear(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

1898

if (tree->bt_root == NULL) {

usr/src/uts/common/fs/zfs/btree.c

1899

ASSERT0(tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

1903

zfs_btree_clear_helper(tree, tree->bt_root);

usr/src/uts/common/fs/zfs/btree.c

1904

tree->bt_num_elems = 0;

usr/src/uts/common/fs/zfs/btree.c

1905

tree->bt_root = NULL;

usr/src/uts/common/fs/zfs/btree.c

1906

tree->bt_num_nodes = 0;

usr/src/uts/common/fs/zfs/btree.c

1907

tree->bt_height = -1;

usr/src/uts/common/fs/zfs/btree.c

1908

tree->bt_bulk = NULL;

usr/src/uts/common/fs/zfs/btree.c

1912

zfs_btree_destroy(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

1914

ASSERT0(tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

1915

ASSERT3P(tree->bt_root, ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

1920

zfs_btree_verify_pointers_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

1928

zfs_btree_verify_pointers_helper(tree, node->btc_children[i]);

usr/src/uts/common/fs/zfs/btree.c

1934

zfs_btree_verify_pointers(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

1936

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

1937

VERIFY3P(tree->bt_root, ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

194

zfs_btree_find_in_buf(zfs_btree_t *tree, uint8_t *buf, uint32_t nelems,

usr/src/uts/common/fs/zfs/btree.c

1940

VERIFY3P(tree->bt_root->bth_parent, ==, NULL);

usr/src/uts/common/fs/zfs/btree.c

1941

zfs_btree_verify_pointers_helper(tree, tree->bt_root);

usr/src/uts/common/fs/zfs/btree.c

1949

zfs_btree_verify_counts_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

1952

if (tree->bt_root != hdr && tree->bt_bulk &&

usr/src/uts/common/fs/zfs/btree.c

1953

hdr != &tree->bt_bulk->btl_hdr) {

usr/src/uts/common/fs/zfs/btree.c

1954

VERIFY3U(hdr->bth_count, >=, tree->bt_leaf_cap / 2 - 1);

usr/src/uts/common/fs/zfs/btree.c

1962

if (tree->bt_root != hdr && tree->bt_bulk == NULL)

usr/src/uts/common/fs/zfs/btree.c

1965

ret += zfs_btree_verify_counts_helper(tree,

usr/src/uts/common/fs/zfs/btree.c

1978

zfs_btree_verify_counts(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

1980

EQUIV(tree->bt_num_elems == 0, tree->bt_height == -1);

usr/src/uts/common/fs/zfs/btree.c

1981

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

1984

VERIFY3P(zfs_btree_verify_counts_helper(tree, tree->bt_root), ==,

usr/src/uts/common/fs/zfs/btree.c

1985

tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

1993

zfs_btree_verify_height_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr,

usr/src/uts/common/fs/zfs/btree.c

2004

ret += zfs_btree_verify_height_helper(tree,

usr/src/uts/common/fs/zfs/btree.c

201

uint8_t *cur = buf + idx * tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

2015

zfs_btree_verify_height(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

2017

EQUIV(tree->bt_height == -1, tree->bt_root == NULL);

usr/src/uts/common/fs/zfs/btree.c

2018

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

202

int comp = tree->bt_compar(cur, value);

usr/src/uts/common/fs/zfs/btree.c

2022

VERIFY3U(zfs_btree_verify_height_helper(tree, tree->bt_root,

usr/src/uts/common/fs/zfs/btree.c

2023

tree->bt_height), ==, tree->bt_num_nodes);

usr/src/uts/common/fs/zfs/btree.c

2032

zfs_btree_verify_order_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

2034

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

2038

VERIFY3S(tree->bt_compar(leaf->btl_elems +

usr/src/uts/common/fs/zfs/btree.c

2048

VERIFY3S(tree->bt_compar(node->btc_elems + (i - 1) * size,

usr/src/uts/common/fs/zfs/btree.c

2066

int comp = tree->bt_compar(node->btc_elems + i * size,

usr/src/uts/common/fs/zfs/btree.c

2086

comp = tree->bt_compar(node->btc_elems + i * size,

usr/src/uts/common/fs/zfs/btree.c

2095

zfs_btree_verify_order_helper(tree, node->btc_children[i]);

usr/src/uts/common/fs/zfs/btree.c

2100

zfs_btree_verify_order(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

2102

EQUIV(tree->bt_height == -1, tree->bt_root == NULL);

usr/src/uts/common/fs/zfs/btree.c

2103

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

2107

zfs_btree_verify_order_helper(tree, tree->bt_root);

usr/src/uts/common/fs/zfs/btree.c

2113

zfs_btree_verify_poison_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

2115

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

2136

zfs_btree_verify_poison_helper(tree,

usr/src/uts/common/fs/zfs/btree.c

2145

zfs_btree_verify_poison(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

2148

if (tree->bt_height == -1)

usr/src/uts/common/fs/zfs/btree.c

2150

zfs_btree_verify_poison_helper(tree, tree->bt_root);

usr/src/uts/common/fs/zfs/btree.c

2155

zfs_btree_verify(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

2159

zfs_btree_verify_height(tree);

usr/src/uts/common/fs/zfs/btree.c

2162

zfs_btree_verify_pointers(tree);

usr/src/uts/common/fs/zfs/btree.c

2165

zfs_btree_verify_counts(tree);

usr/src/uts/common/fs/zfs/btree.c

2168

zfs_btree_verify_order(tree);

usr/src/uts/common/fs/zfs/btree.c

2172

zfs_btree_verify_poison(tree);

usr/src/uts/common/fs/zfs/btree.c

224

zfs_btree_find(zfs_btree_t *tree, const void *value, zfs_btree_index_t *where)

usr/src/uts/common/fs/zfs/btree.c

226

if (tree->bt_height == -1) {

usr/src/uts/common/fs/zfs/btree.c

231

ASSERT0(tree->bt_num_elems);

usr/src/uts/common/fs/zfs/btree.c

242

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

243

if (tree->bt_bulk != NULL) {

usr/src/uts/common/fs/zfs/btree.c

244

zfs_btree_leaf_t *last_leaf = tree->bt_bulk;

usr/src/uts/common/fs/zfs/btree.c

245

int comp = tree->bt_compar(last_leaf->btl_elems +

usr/src/uts/common/fs/zfs/btree.c

271

if (tree->bt_compar(last_leaf->btl_elems +

usr/src/uts/common/fs/zfs/btree.c

278

void *d = zfs_btree_find_in_buf(tree,

usr/src/uts/common/fs/zfs/btree.c

299

for (node = (zfs_btree_core_t *)tree->bt_root; depth < tree->bt_height;

usr/src/uts/common/fs/zfs/btree.c

302

void *d = zfs_btree_find_in_buf(tree, node->btc_elems,

usr/src/uts/common/fs/zfs/btree.c

321

(zfs_btree_leaf_t *)tree->bt_root : (zfs_btree_leaf_t *)node);

usr/src/uts/common/fs/zfs/btree.c

322

void *d = zfs_btree_find_in_buf(tree, leaf->btl_elems +

usr/src/uts/common/fs/zfs/btree.c

393

bt_shift_core(zfs_btree_t *tree, zfs_btree_core_t *node, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

397

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

420

bt_shift_core_left(zfs_btree_t *tree, zfs_btree_core_t *node, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

423

bt_shift_core(tree, node, idx, count, 1, shape, BSD_LEFT);

usr/src/uts/common/fs/zfs/btree.c

431

bt_shift_core_right(zfs_btree_t *tree, zfs_btree_core_t *node, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

434

bt_shift_core(tree, node, idx, count, 1, shape, BSD_RIGHT);

usr/src/uts/common/fs/zfs/btree.c

443

bt_shift_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *node, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

446

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

462

bt_grow_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

468

uint32_t capacity = tree->bt_leaf_cap;

usr/src/uts/common/fs/zfs/btree.c

476

bt_shift_leaf(tree, leaf, n, idx, n, BSD_LEFT);

usr/src/uts/common/fs/zfs/btree.c

479

bt_shift_leaf(tree, leaf, idx, hdr->bth_count - idx, n,

usr/src/uts/common/fs/zfs/btree.c

486

bt_shift_leaf(tree, leaf, fn, idx, fn, BSD_LEFT);

usr/src/uts/common/fs/zfs/btree.c

487

bt_shift_leaf(tree, leaf, fn + idx, hdr->bth_count - idx,

usr/src/uts/common/fs/zfs/btree.c

497

bt_shrink_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf, uint32_t idx,

usr/src/uts/common/fs/zfs/btree.c

506

bt_shift_leaf(tree, leaf, 0, idx, n, BSD_RIGHT);

usr/src/uts/common/fs/zfs/btree.c

507

zfs_btree_poison_node_at(tree, hdr, 0, n);

usr/src/uts/common/fs/zfs/btree.c

510

bt_shift_leaf(tree, leaf, idx + n, hdr->bth_count - idx - n, n,

usr/src/uts/common/fs/zfs/btree.c

512

zfs_btree_poison_node_at(tree, hdr, hdr->bth_count - n, n);

usr/src/uts/common/fs/zfs/btree.c

522

bt_transfer_core(zfs_btree_t *tree, zfs_btree_core_t *source, uint32_t sidx,

usr/src/uts/common/fs/zfs/btree.c

526

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

540

bt_transfer_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *source, uint32_t sidx,

usr/src/uts/common/fs/zfs/btree.c

543

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

557

zfs_btree_first_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr,

usr/src/uts/common/fs/zfs/btree.c

573

return (&leaf->btl_elems[node->bth_first * tree->bt_elem_size]);

usr/src/uts/common/fs/zfs/btree.c

578

zfs_btree_insert_core_impl(zfs_btree_t *tree, zfs_btree_core_t *parent,

usr/src/uts/common/fs/zfs/btree.c

581

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

587

zfs_btree_verify_poison_at(tree, par_hdr,

usr/src/uts/common/fs/zfs/btree.c

592

bt_shift_core_right(tree, parent, offset, count,

usr/src/uts/common/fs/zfs/btree.c

606

zfs_btree_insert_into_parent(zfs_btree_t *tree, zfs_btree_hdr_t *old_node,

usr/src/uts/common/fs/zfs/btree.c

610

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

619

ASSERT3P(old_node, ==, tree->bt_root);

usr/src/uts/common/fs/zfs/btree.c

620

tree->bt_num_nodes++;

usr/src/uts/common/fs/zfs/btree.c

634

tree->bt_height++;

usr/src/uts/common/fs/zfs/btree.c

635

tree->bt_root = new_root_hdr;

usr/src/uts/common/fs/zfs/btree.c

636

zfs_btree_poison_node(tree, new_root_hdr);

usr/src/uts/common/fs/zfs/btree.c

646

VERIFY3P(zfs_btree_find_in_buf(tree, parent->btc_elems,

usr/src/uts/common/fs/zfs/btree.c

658

zfs_btree_insert_core_impl(tree, parent, offset, new_node, buf);

usr/src/uts/common/fs/zfs/btree.c

680

uint32_t move_count = MAX((BTREE_CORE_ELEMS / (tree->bt_bulk == NULL ?

usr/src/uts/common/fs/zfs/btree.c

684

tree->bt_num_nodes++;

usr/src/uts/common/fs/zfs/btree.c

691

zfs_btree_poison_node(tree, new_par_hdr);

usr/src/uts/common/fs/zfs/btree.c

695

bt_transfer_core(tree, parent, keep_count + 1, move_count, new_parent,

usr/src/uts/common/fs/zfs/btree.c

702

zfs_btree_poison_node(tree, par_hdr);

usr/src/uts/common/fs/zfs/btree.c

706

zfs_btree_insert_core_impl(tree, parent, offset, new_node,

usr/src/uts/common/fs/zfs/btree.c

716

zfs_btree_insert_core_impl(tree, new_parent,

usr/src/uts/common/fs/zfs/btree.c

729

bt_shift_core_right(tree, new_parent, 0, move_count,

usr/src/uts/common/fs/zfs/btree.c

736

zfs_btree_poison_node(tree, par_hdr);

usr/src/uts/common/fs/zfs/btree.c

748

zfs_btree_insert_into_parent(tree, &parent->btc_hdr,

usr/src/uts/common/fs/zfs/btree.c

754

zfs_btree_insert_leaf_impl(zfs_btree_t *tree, zfs_btree_leaf_t *leaf,

usr/src/uts/common/fs/zfs/btree.c

757

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

759

ASSERT3U(leaf->btl_hdr.bth_count, <, tree->bt_leaf_cap);

usr/src/uts/common/fs/zfs/btree.c

762

zfs_btree_verify_poison_at(tree, &leaf->btl_hdr,

usr/src/uts/common/fs/zfs/btree.c

766

bt_grow_leaf(tree, leaf, idx, 1);

usr/src/uts/common/fs/zfs/btree.c

772

zfs_btree_verify_order_helper(zfs_btree_t *tree, zfs_btree_hdr_t *hdr);

usr/src/uts/common/fs/zfs/btree.c

776

zfs_btree_insert_into_leaf(zfs_btree_t *tree, zfs_btree_leaf_t *leaf,

usr/src/uts/common/fs/zfs/btree.c

779

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

780

uint32_t capacity = tree->bt_leaf_cap;

usr/src/uts/common/fs/zfs/btree.c

787

zfs_btree_insert_leaf_impl(tree, leaf, idx, value);

usr/src/uts/common/fs/zfs/btree.c

805

uint32_t move_count = MAX(capacity / (tree->bt_bulk ? 4 : 2), 1) - 1;

usr/src/uts/common/fs/zfs/btree.c

813

tree->bt_num_nodes++;

usr/src/uts/common/fs/zfs/btree.c

818

new_hdr->bth_first = (tree->bt_bulk ? 0 : capacity / 4) +

usr/src/uts/common/fs/zfs/btree.c

821

zfs_btree_poison_node(tree, new_hdr);

usr/src/uts/common/fs/zfs/btree.c

823

if (tree->bt_bulk != NULL && leaf == tree->bt_bulk)

usr/src/uts/common/fs/zfs/btree.c

824

tree->bt_bulk = new_leaf;

usr/src/uts/common/fs/zfs/btree.c

827

bt_transfer_leaf(tree, leaf, keep_count + 1, move_count, new_leaf, 0);

usr/src/uts/common/fs/zfs/btree.c

834

bt_shrink_leaf(tree, leaf, keep_count, 1 + move_count);

usr/src/uts/common/fs/zfs/btree.c

838

zfs_btree_insert_leaf_impl(tree, leaf, idx, value);

usr/src/uts/common/fs/zfs/btree.c

841

zfs_btree_insert_leaf_impl(tree, new_leaf, idx - keep_count -

usr/src/uts/common/fs/zfs/btree.c

848

zfs_btree_insert_leaf_impl(tree, new_leaf, 0, buf);

usr/src/uts/common/fs/zfs/btree.c

856

zfs_btree_insert_into_parent(tree, &leaf->btl_hdr, &new_leaf->btl_hdr,

usr/src/uts/common/fs/zfs/btree.c

862

zfs_btree_find_parent_idx(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

869

hdr->bth_first * tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

87

zfs_btree_poison_node(zfs_btree_t *tree, zfs_btree_hdr_t *hdr)

usr/src/uts/common/fs/zfs/btree.c

873

VERIFY3P(zfs_btree_find_in_buf(tree, parent->btc_elems,

usr/src/uts/common/fs/zfs/btree.c

891

zfs_btree_bulk_finish(zfs_btree_t *tree)

usr/src/uts/common/fs/zfs/btree.c

893

ASSERT3P(tree->bt_bulk, !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

894

ASSERT3P(tree->bt_root, !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

895

zfs_btree_leaf_t *leaf = tree->bt_bulk;

usr/src/uts/common/fs/zfs/btree.c

898

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

899

uint32_t capacity = tree->bt_leaf_cap;

usr/src/uts/common/fs/zfs/btree.c

90

size_t size = tree->bt_elem_size;

usr/src/uts/common/fs/zfs/btree.c

906

tree->bt_bulk = NULL;

usr/src/uts/common/fs/zfs/btree.c

923

VERIFY3P(zfs_btree_prev(tree, &idx, &idx), !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

928

VERIFY3P(zfs_btree_prev(tree, &idx, &idx), !=, NULL);

usr/src/uts/common/fs/zfs/btree.c

938

zfs_btree_verify_poison_at(tree, hdr,

usr/src/uts/common/fs/zfs/btree.c

944

bt_grow_leaf(tree, leaf, 0, move_count);

usr/src/uts/common/fs/zfs/btree.c

956

bt_transfer_leaf(tree, l_neighbor, l_hdr->bth_count -

usr/src/uts/common/fs/zfs/btree.c

967

bt_shrink_leaf(tree, l_neighbor, l_hdr->bth_count - move_count,

usr/src/uts/common/fs/zfs/btree.c

995

uint32_t parent_idx = zfs_btree_find_parent_idx(tree, hdr);

usr/src/uts/common/fs/zfs/refcount.c

241

avl_tree_t tree;

usr/src/uts/common/fs/zfs/refcount.c

248

avl_create(&tree, zfs_refcount_compare, sizeof (reference_t),

usr/src/uts/common/fs/zfs/refcount.c

258

avl_swap(&tree, &src->rc_tree);

usr/src/uts/common/fs/zfs/refcount.c

266

avl_swap(&dst->rc_tree, &tree);

usr/src/uts/common/fs/zfs/refcount.c

267

else while ((ref = avl_destroy_nodes(&tree, &cookie)) != NULL)

usr/src/uts/common/fs/zfs/refcount.c

272

avl_destroy(&tree);

usr/src/uts/common/fs/zfs/spa_errlog.c

114

tree = &spa->spa_errlist_scrub;

usr/src/uts/common/fs/zfs/spa_errlog.c

116

tree = &spa->spa_errlist_last;

usr/src/uts/common/fs/zfs/spa_errlog.c

119

if (avl_find(tree, &search, &where) != NULL) {

usr/src/uts/common/fs/zfs/spa_errlog.c

126

avl_insert(tree, new, where);

usr/src/uts/common/fs/zfs/spa_errlog.c

97

avl_tree_t *tree;

usr/src/uts/common/fs/zfs/sys/btree.h

240

void zfs_btree_destroy(zfs_btree_t *tree);

usr/src/uts/common/fs/zfs/sys/btree.h

243

void zfs_btree_verify(zfs_btree_t *tree);

usr/src/uts/common/fs/zfs/vdev_queue.c

712

avl_tree_t *tree;

usr/src/uts/common/fs/zfs/vdev_queue.c

731

tree = vdev_queue_class_tree(vq, p);

usr/src/uts/common/fs/zfs/vdev_queue.c

734

VERIFY3P(avl_find(tree, &search, &idx), ==, NULL);

usr/src/uts/common/fs/zfs/vdev_queue.c

735

zio = avl_nearest(tree, idx, AVL_AFTER);

usr/src/uts/common/fs/zfs/vdev_queue.c

737

zio = avl_first(tree);

usr/src/uts/common/fs/zfs/vdev_queue.c

853

avl_tree_t *tree;

usr/src/uts/common/fs/zfs/vdev_queue.c

888

tree = vdev_queue_class_tree(vq, zio->io_priority);

usr/src/uts/common/fs/zfs/vdev_queue.c

889

if (avl_find(tree, zio, NULL) == zio) {

usr/src/uts/common/fs/zfs/zfs_rlock.c

143

avl_tree_t *tree = &rl->rl_tree;

usr/src/uts/common/fs/zfs/zfs_rlock.c

169

if (avl_numnodes(tree) == 0) {

usr/src/uts/common/fs/zfs/zfs_rlock.c

170

avl_add(tree, new);

usr/src/uts/common/fs/zfs/zfs_rlock.c

177

lr = avl_find(tree, new, &where);

usr/src/uts/common/fs/zfs/zfs_rlock.c

181

lr = (locked_range_t *)avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/fs/zfs/zfs_rlock.c

186

lr = (locked_range_t *)avl_nearest(tree, where, AVL_BEFORE);

usr/src/uts/common/fs/zfs/zfs_rlock.c

191

avl_insert(tree, new, where);

usr/src/uts/common/fs/zfs/zfs_rlock.c

212

rangelock_proxify(avl_tree_t *tree, locked_range_t *lr)

usr/src/uts/common/fs/zfs/zfs_rlock.c

222

avl_remove(tree, lr);

usr/src/uts/common/fs/zfs/zfs_rlock.c

234

avl_add(tree, proxy);

usr/src/uts/common/fs/zfs/zfs_rlock.c

244

rangelock_split(avl_tree_t *tree, locked_range_t *lr, uint64_t off)

usr/src/uts/common/fs/zfs/zfs_rlock.c

262

locked_range_t *front = rangelock_proxify(tree, lr);

usr/src/uts/common/fs/zfs/zfs_rlock.c

265

avl_insert_here(tree, rear, front, AVL_AFTER);

usr/src/uts/common/fs/zfs/zfs_rlock.c

273

rangelock_new_proxy(avl_tree_t *tree, uint64_t off, uint64_t len)

usr/src/uts/common/fs/zfs/zfs_rlock.c

284

avl_add(tree, lr);

usr/src/uts/common/fs/zfs/zfs_rlock.c

288

rangelock_add_reader(avl_tree_t *tree, locked_range_t *new,

usr/src/uts/common/fs/zfs/zfs_rlock.c

310

prev = rangelock_split(tree, prev, off);

usr/src/uts/common/fs/zfs/zfs_rlock.c

311

prev = AVL_NEXT(tree, prev); /* move to rear range */

usr/src/uts/common/fs/zfs/zfs_rlock.c

319

next = avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/fs/zfs/zfs_rlock.c

323

avl_insert(tree, new, where);

usr/src/uts/common/fs/zfs/zfs_rlock.c

329

rangelock_new_proxy(tree, off, next->lr_offset - off);

usr/src/uts/common/fs/zfs/zfs_rlock.c

339

for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) {

usr/src/uts/common/fs/zfs/zfs_rlock.c

347

rangelock_new_proxy(tree,

usr/src/uts/common/fs/zfs/zfs_rlock.c

354

next = rangelock_proxify(tree, next);

usr/src/uts/common/fs/zfs/zfs_rlock.c

360

next = rangelock_split(tree, next, off + len);

usr/src/uts/common/fs/zfs/zfs_rlock.c

365

next = rangelock_proxify(tree, next);

usr/src/uts/common/fs/zfs/zfs_rlock.c

370

rangelock_new_proxy(tree, prev->lr_offset + prev->lr_length,

usr/src/uts/common/fs/zfs/zfs_rlock.c

380

avl_tree_t *tree = &rl->rl_tree;

usr/src/uts/common/fs/zfs/zfs_rlock.c

390

prev = avl_find(tree, new, &where);

usr/src/uts/common/fs/zfs/zfs_rlock.c

392

prev = (locked_range_t *)avl_nearest(tree, where, AVL_BEFORE);

usr/src/uts/common/fs/zfs/zfs_rlock.c

416

next = AVL_NEXT(tree, prev);

usr/src/uts/common/fs/zfs/zfs_rlock.c

418

next = (locked_range_t *)avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/fs/zfs/zfs_rlock.c

419

for (; next != NULL; next = AVL_NEXT(tree, next)) {

usr/src/uts/common/fs/zfs/zfs_rlock.c

440

rangelock_add_reader(tree, new, prev, where);

usr/src/uts/common/fs/zfs/zfs_rlock.c

489

avl_tree_t *tree = &rl->rl_tree;

usr/src/uts/common/fs/zfs/zfs_rlock.c

500

avl_remove(tree, remove);

usr/src/uts/common/fs/zfs/zfs_rlock.c

518

locked_range_t *lr = avl_find(tree, remove, NULL);

usr/src/uts/common/fs/zfs/zfs_rlock.c

526

next = AVL_NEXT(tree, lr);

usr/src/uts/common/fs/zfs/zfs_rlock.c

535

avl_remove(tree, lr);

usr/src/uts/common/idmap/idmap_cache.c

1000

avl_insert(&kidmap_sid_prefix_store->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

104

struct avl_tree tree;

usr/src/uts/common/idmap/idmap_cache.c

192

avl_create(&sid2pid_hb->tree, kidmap_compare_sid,

usr/src/uts/common/idmap/idmap_cache.c

209

avl_create(&uid2sid_hb->tree, kidmap_compare_pid,

usr/src/uts/common/idmap/idmap_cache.c

223

avl_create(&gid2sid_hb->tree, kidmap_compare_pid,

usr/src/uts/common/idmap/idmap_cache.c

244

while ((sid2pid = avl_destroy_nodes(&sid2pid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

248

avl_destroy(&sid2pid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

257

while ((uid2sid = avl_destroy_nodes(&uid2sid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

261

avl_destroy(&uid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

270

while ((gid2sid = avl_destroy_nodes(&gid2sid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

274

avl_destroy(&gid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

310

*sidbyuid += avl_numnodes(&uid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

318

*sidbygid += avl_numnodes(&gid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

336

while ((sid2pid = avl_destroy_nodes(&sid2pid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

340

avl_destroy(&sid2pid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

341

avl_create(&sid2pid_hb->tree, kidmap_compare_sid,

usr/src/uts/common/idmap/idmap_cache.c

358

while ((uid2sid = avl_destroy_nodes(&uid2sid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

362

avl_destroy(&uid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

363

avl_create(&uid2sid_hb->tree, kidmap_compare_pid,

usr/src/uts/common/idmap/idmap_cache.c

377

while ((gid2sid = avl_destroy_nodes(&gid2sid_hb->tree,

usr/src/uts/common/idmap/idmap_cache.c

381

avl_destroy(&gid2sid_hb->tree);

usr/src/uts/common/idmap/idmap_cache.c

382

avl_create(&gid2sid_hb->tree, kidmap_compare_pid,

usr/src/uts/common/idmap/idmap_cache.c

409

result = avl_find(&sid2pid_hb->tree, &entry, &where);

usr/src/uts/common/idmap/idmap_cache.c

441

result = avl_find(&sid2pid_hb->tree, &entry, &where);

usr/src/uts/common/idmap/idmap_cache.c

473

result = avl_find(&sid2pid_hb->tree, &entry, &where);

usr/src/uts/common/idmap/idmap_cache.c

512

result = avl_find(&uid2sid_hb->tree, &entry, &where);

usr/src/uts/common/idmap/idmap_cache.c

544

result = avl_find(&gid2sid_hb->tree, &entry, &where);

usr/src/uts/common/idmap/idmap_cache.c

582

result = avl_find(&sid2pid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

600

avl_insert(&sid2pid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

603

if ((avl_numnodes(&sid2pid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

625

result = avl_find(&uid2sid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

638

avl_insert(&uid2sid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

641

if ((avl_numnodes(&uid2sid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

675

result = avl_find(&sid2pid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

693

avl_insert(&sid2pid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

696

if ((avl_numnodes(&sid2pid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

718

result = avl_find(&gid2sid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

731

avl_insert(&gid2sid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

734

if ((avl_numnodes(&gid2sid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

767

result = avl_find(&sid2pid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

804

avl_insert(&sid2pid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

807

if ((avl_numnodes(&sid2pid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

831

result = avl_find(&uid2sid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

844

avl_insert(&uid2sid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

847

if ((avl_numnodes(&uid2sid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

862

result = avl_find(&gid2sid_hb->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

875

avl_insert(&gid2sid_hb->tree, new, where);

usr/src/uts/common/idmap/idmap_cache.c

878

if ((avl_numnodes(&gid2sid_hb->tree) >

usr/src/uts/common/idmap/idmap_cache.c

900

while (avl_numnodes(&cache->tree) > limit) {

usr/src/uts/common/idmap/idmap_cache.c

904

avl_remove(&cache->tree, item);

usr/src/uts/common/idmap/idmap_cache.c

923

while (avl_numnodes(&cache->tree) > limit) {

usr/src/uts/common/idmap/idmap_cache.c

927

avl_remove(&cache->tree, item);

usr/src/uts/common/idmap/idmap_cache.c

943

avl_create(&kidmap_sid_prefix_store->tree,

usr/src/uts/common/idmap/idmap_cache.c

955

kidmap_sid_prefix_store->tree.avl_compar =

usr/src/uts/common/idmap/idmap_cache.c

975

result = avl_find(&kidmap_sid_prefix_store->tree, &find, &where);

usr/src/uts/common/idmap/idmap_cache.c

990

result = avl_find(&kidmap_sid_prefix_store->tree,

usr/src/uts/common/idmap/kidmap_priv.h

73

avl_tree_t tree;

usr/src/uts/common/idmap/kidmap_priv.h

84

avl_tree_t tree;

usr/src/uts/common/inet/ip/spd.c

925

ipsec_insert_always(avl_tree_t *tree, void *new_node)

usr/src/uts/common/inet/ip/spd.c

930

node = avl_find(tree, new_node, &where);

usr/src/uts/common/inet/ip/spd.c

932

avl_insert(tree, new_node, where);

usr/src/uts/common/inet/ipnet/ipnet.c

1666

avl_tree_t *tree;

usr/src/uts/common/inet/ipnet/ipnet.c

1669

tree = &ips->ips_avl_by_index;

usr/src/uts/common/inet/ipnet/ipnet.c

1670

for (ipnetif = avl_first(tree); ipnetif != NULL;

usr/src/uts/common/inet/ipnet/ipnet.c

1671

ipnetif = avl_walk(tree, ipnetif, AVL_AFTER)) {

usr/src/uts/common/inet/ipsec_impl.h

925

extern void ipsec_insert_always(avl_tree_t *tree, void *new_node);

usr/src/uts/common/io/mac/mac_protect.c

1436

insert_slaac_ip(avl_tree_t *tree, in6_addr_t *token, slaac_addr_t *addr)

usr/src/uts/common/io/mac/mac_protect.c

1452

if (avl_find(tree, addr, &where) != NULL)

usr/src/uts/common/io/mac/mac_protect.c

1455

avl_insert(tree, addr, where);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2357

local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2359

local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2361

local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2362

local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2376

#define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2380

#define send_code(s, c, tree) \

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2382

send_bits(s, tree[c].Code, tree[c].Len); }

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2594

#define pqremove(s, tree, top) \

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2598

pqdownheap(s, tree, SMALLEST); \

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2606

#define smaller(tree, n, m, depth) \

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2607

(tree[n].Freq < tree[m].Freq || \

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2608

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2617

pqdownheap(s, tree, k)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2619

ct_data *tree; /* the tree to restore */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2627

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2631

if (smaller(tree, v, s->heap[j], s->depth)) break;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2658

ct_data *tree = desc->dyn_tree;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2678

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2682

bits = tree[tree[n].Dad].Len + 1;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2684

tree[n].Len = (ush)bits;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2692

f = tree[n].Freq;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2730

if (tree[m].Len != (unsigned)bits) {

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2732

tree[m].Len, bits));

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2733

s->opt_len += ((long)bits - (long)tree[m].Len)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2734

*(long)tree[m].Freq;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2735

tree[m].Len = (ush)bits;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2752

gen_codes(tree, max_code, bl_count)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2753

ct_data *tree; /* the tree to decorate */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2779

int len = tree[n].Len;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2782

tree[n].Code = bi_reverse(next_code[len]++, len);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2784

Tracecv(tree != static_ltree,

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2786

n, (isgraph(n) ? n : ' '), len, tree[n].Code,

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2805

ct_data *tree = desc->dyn_tree;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2820

if (tree[n].Freq != 0) {

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2824

tree[n].Len = 0;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2837

tree[node].Freq = 1;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2848

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2856

pqremove(s, tree, n); /* n = node of least frequency */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2864

tree[node].Freq = tree[n].Freq + tree[m].Freq;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2866

tree[n].Dad = tree[m].Dad = (ush)node;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2868

if (tree == s->bl_tree) {

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2870

node, tree[node].Freq, n, tree[n].Freq, m,

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2871

tree[m].Freq);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2876

pqdownheap(s, tree, SMALLEST);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2889

gen_codes((ct_data *)tree, max_code, s->bl_count);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2898

scan_tree(s, tree, max_code)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2900

ct_data *tree; /* the tree to be scanned */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2906

int nextlen = tree[0].Len; /* length of next code */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2912

tree[max_code+1].Len = (ush)0xffff; /* guard */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2915

curlen = nextlen; nextlen = tree[n+1].Len;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2945

send_tree(s, tree, max_code)

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2947

ct_data *tree; /* the tree to be scanned */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2953

int nextlen = tree[0].Len; /* length of next code */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

2962

curlen = nextlen; nextlen = tree[n+1].Len;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5282

const inflate_huft *tree; /* pointer into tree */

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5366

c->sub.code.tree = c->ltree;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5372

t = c->sub.code.tree +

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5394

c->sub.code.tree = t + t->base;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5413

c->sub.code.tree = c->dtree;

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5421

t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);

usr/src/uts/common/io/ppp/spppcomp/zlib.c

5432

c->sub.code.tree = t + t->base;

usr/src/uts/common/nfs/rnode.h

82

avl_node_t tree; /* AVL tree links */

usr/src/uts/common/os/contract.c

1185

contract_lookup_common(avl_tree_t *tree, uint64_t zuniqid, ctid_t current)

usr/src/uts/common/os/contract.c

1192

ct = avl_find(tree, &template, &where);

usr/src/uts/common/os/contract.c

1194

ct = avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/os/contract.c

1197

ct = AVL_NEXT(tree, ct);

usr/src/uts/common/os/contract.c

1288

contract_ptr_common(avl_tree_t *tree, ctid_t id, uint64_t zuniqid)

usr/src/uts/common/os/contract.c

1293

ct = avl_find(tree, &template, NULL);

usr/src/uts/common/os/lgrp.c

3575

avl_tree_t *tree;

usr/src/uts/common/os/lgrp.c

3579

tree = NULL;

usr/src/uts/common/os/lgrp.c

3593

tree = shm_locality->loc_tree;

usr/src/uts/common/os/lgrp.c

3600

tree = shm_locality->loc_tree;

usr/src/uts/common/os/lgrp.c

3604

if (tree == NULL)

usr/src/uts/common/os/lgrp.c

3613

policy_seg = avl_find(tree, &off, &where);

usr/src/uts/common/os/lgrp.c

3996

lgrp_shm_policy_tree_destroy(avl_tree_t *tree)

usr/src/uts/common/os/lgrp.c

4001

if (tree == NULL)

usr/src/uts/common/os/lgrp.c

4004

cur = (lgrp_shm_policy_seg_t *)avl_first(tree);

usr/src/uts/common/os/lgrp.c

4006

next = AVL_NEXT(tree, cur);

usr/src/uts/common/os/lgrp.c

4007

avl_remove(tree, cur);

usr/src/uts/common/os/lgrp.c

4011

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/os/lgrp.c

4078

lgrp_shm_policy_concat(avl_tree_t *tree, lgrp_shm_policy_seg_t *seg1,

usr/src/uts/common/os/lgrp.c

4087

avl_remove(tree, seg2);

usr/src/uts/common/os/lgrp.c

4097

lgrp_shm_policy_split(avl_tree_t *tree, lgrp_shm_policy_seg_t *seg,

usr/src/uts/common/os/lgrp.c

4126

(void) avl_find(tree, &off, &where);

usr/src/uts/common/os/lgrp.c

4127

avl_insert(tree, newseg, where);

usr/src/uts/common/os/lgrp.c

4152

avl_tree_t *tree;

usr/src/uts/common/os/lgrp.c

4205

tree = shm_locality->loc_tree;

usr/src/uts/common/os/lgrp.c

4206

if (!tree) {

usr/src/uts/common/os/lgrp.c

4209

tree = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);

usr/src/uts/common/os/lgrp.c

4213

avl_create(tree, lgrp_shm_policy_compar,

usr/src/uts/common/os/lgrp.c

4216

shm_locality->loc_tree = tree;

usr/src/uts/common/os/lgrp.c

4223

kmem_free(tree, sizeof (*tree));

usr/src/uts/common/os/lgrp.c

4224

tree = shm_locality->loc_tree;

usr/src/uts/common/os/lgrp.c

4238

seg = avl_find(tree, &off, &where);

usr/src/uts/common/os/lgrp.c

4251

avl_insert(tree, newseg, where);

usr/src/uts/common/os/lgrp.c

4258

seg = AVL_NEXT(tree, newseg);

usr/src/uts/common/os/lgrp.c

4274

prev = AVL_PREV(tree, newseg);

usr/src/uts/common/os/lgrp.c

4275

next = AVL_NEXT(tree, newseg);

usr/src/uts/common/os/lgrp.c

4276

(void) lgrp_shm_policy_concat(tree, newseg, next);

usr/src/uts/common/os/lgrp.c

4277

(void) lgrp_shm_policy_concat(tree, prev, newseg);

usr/src/uts/common/os/lgrp.c

4320

prev = AVL_PREV(tree, seg);

usr/src/uts/common/os/lgrp.c

4321

next = AVL_NEXT(tree, seg);

usr/src/uts/common/os/lgrp.c

4322

(void) lgrp_shm_policy_concat(tree, seg, next);

usr/src/uts/common/os/lgrp.c

4323

(void) lgrp_shm_policy_concat(tree, prev, seg);

usr/src/uts/common/os/lgrp.c

4336

newseg = lgrp_shm_policy_split(tree, seg, off);

usr/src/uts/common/os/lgrp.c

4346

(void) lgrp_shm_policy_concat(tree,

usr/src/uts/common/os/lgrp.c

4347

newseg, AVL_NEXT(tree, newseg));

usr/src/uts/common/os/lgrp.c

4358

(void) lgrp_shm_policy_split(tree,

usr/src/uts/common/os/lgrp.c

4364

(void) lgrp_shm_policy_split(tree, seg,

usr/src/uts/common/os/lgrp.c

4371

(void) lgrp_shm_policy_concat(tree,

usr/src/uts/common/os/lgrp.c

4372

AVL_PREV(tree, seg), seg);

usr/src/uts/common/os/shm.c

1029

avl_tree_t *tree = NULL;

usr/src/uts/common/os/shm.c

1039

tree = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);

usr/src/uts/common/os/shm.c

1045

avl_create(tree, shm_sacompar, sizeof (segacct_t),

usr/src/uts/common/os/shm.c

1047

pp->p_segacct = tree;

usr/src/uts/common/os/shm.c

1048

} else if (tree) {

usr/src/uts/common/os/shm.c

1049

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/os/shm.c

1102

avl_tree_t *tree;

usr/src/uts/common/os/shm.c

1109

tree = pp->p_segacct;

usr/src/uts/common/os/shm.c

1113

while ((sap = avl_destroy_nodes(tree, &cookie)) != NULL)

usr/src/uts/common/os/shm.c

1116

avl_destroy(tree);

usr/src/uts/common/os/shm.c

1117

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/smbsrv/smb_ktypes.h

1178

#define SMB_TREE_VFS(tree) ((tree)->t_snode->vp->v_vfsp)

usr/src/uts/common/smbsrv/smb_ktypes.h

1179

#define SMB_TREE_FSID(tree) ((tree)->t_snode->vp->v_vfsp->vfs_fsid)

usr/src/uts/common/sys/avl.h

158

extern void avl_create(avl_tree_t *tree,

usr/src/uts/common/sys/avl.h

170

extern void *avl_find(avl_tree_t *tree, const void *node, avl_index_t *where);

usr/src/uts/common/sys/avl.h

178

extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);

usr/src/uts/common/sys/avl.h

191

extern void avl_insert_here(avl_tree_t *tree, void *new_data, void *here,

usr/src/uts/common/sys/avl.h

200

extern void *avl_first(avl_tree_t *tree);

usr/src/uts/common/sys/avl.h

201

extern void *avl_last(avl_tree_t *tree);

usr/src/uts/common/sys/avl.h

211

#define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER)

usr/src/uts/common/sys/avl.h

212

#define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE)

usr/src/uts/common/sys/avl.h

237

extern void *avl_nearest(avl_tree_t *tree, avl_index_t where, int direction);

usr/src/uts/common/sys/avl.h

247

extern void avl_add(avl_tree_t *tree, void *node);

usr/src/uts/common/sys/avl.h

255

extern void avl_remove(avl_tree_t *tree, void *node);

usr/src/uts/common/sys/avl.h

276

extern ulong_t avl_numnodes(avl_tree_t *tree);

usr/src/uts/common/sys/avl.h

281

extern boolean_t avl_is_empty(avl_tree_t *tree);

usr/src/uts/common/sys/avl.h

304

extern void *avl_destroy_nodes(avl_tree_t *tree, void **cookie);

usr/src/uts/common/sys/avl.h

312

extern void avl_destroy(avl_tree_t *tree);

usr/src/uts/common/syscall/sem.c

609

avl_tree_t *tree;

usr/src/uts/common/syscall/sem.c

614

tree = pp->p_semacct;

usr/src/uts/common/syscall/sem.c

618

while (undo = avl_destroy_nodes(tree, &cookie)) {

usr/src/uts/common/syscall/sem.c

646

avl_destroy(tree);

usr/src/uts/common/syscall/sem.c

647

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/syscall/sem.c

811

avl_tree_t *tree = NULL;

usr/src/uts/common/syscall/sem.c

822

tree = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);

usr/src/uts/common/syscall/sem.c

827

if (tree)

usr/src/uts/common/syscall/sem.c

828

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/syscall/sem.c

833

if (tree) {

usr/src/uts/common/syscall/sem.c

835

avl_create(tree, sem_undo_compar,

usr/src/uts/common/syscall/sem.c

838

pp->p_semacct = tree;

usr/src/uts/common/syscall/sem.c

840

kmem_free(tree, sizeof (avl_tree_t));

usr/src/uts/common/vm/vm_usage.c

1008

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

1048

avl_insert_here(tree, tmp, next, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

1068

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

1351

avl_tree_t *tree = &(shared_object->vmo_bounds);

usr/src/uts/common/vm/vm_usage.c

1378

tree,

usr/src/uts/common/vm/vm_usage.c

1384

tree,

usr/src/uts/common/vm/vm_usage.c

1389

vmu_merge_bounds(tree, &first, &last);

usr/src/uts/common/vm/vm_usage.c

1415

&e_last, tree, first, last);

usr/src/uts/common/vm/vm_usage.c

346

avl_tree_t *tree = &(obj->vmo_bounds);

usr/src/uts/common/vm/vm_usage.c

350

while ((bound = avl_destroy_nodes(tree, &cookie)) != NULL)

usr/src/uts/common/vm/vm_usage.c

352

avl_destroy(tree);

usr/src/uts/common/vm/vm_usage.c

667

avl_tree_t *tree = &(ro->vmo_bounds);

usr/src/uts/common/vm/vm_usage.c

681

if (walker = avl_find(tree, tmp, &where)) {

usr/src/uts/common/vm/vm_usage.c

689

walker = avl_nearest(tree, where, AVL_BEFORE);

usr/src/uts/common/vm/vm_usage.c

709

walker = avl_nearest(tree, where, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

720

avl_insert(tree, tmp, where);

usr/src/uts/common/vm/vm_usage.c

740

walker = AVL_NEXT(tree, *last);

usr/src/uts/common/vm/vm_usage.c

748

avl_insert_here(tree, tmp, *last, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

759

avl_insert_here(tree, tmp, *last, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

799

vmu_update_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last,

usr/src/uts/common/vm/vm_usage.c

821

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

834

avl_insert_here(tree, tmp, next, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

846

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

858

vmu_merge_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last)

usr/src/uts/common/vm/vm_usage.c

863

ASSERT(tree != NULL);

usr/src/uts/common/vm/vm_usage.c

869

next = AVL_NEXT(tree, current);

usr/src/uts/common/vm/vm_usage.c

873

avl_remove(tree, next);

usr/src/uts/common/vm/vm_usage.c

879

current = AVL_NEXT(tree, current);

usr/src/uts/common/vm/vm_usage.c

896

vmu_amp_update_incore_bounds(avl_tree_t *tree, struct anon_map *amp,

usr/src/uts/common/vm/vm_usage.c

918

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

961

avl_insert_here(tree, tmp, next, AVL_AFTER);

usr/src/uts/common/vm/vm_usage.c

981

next = AVL_NEXT(tree, next);

usr/src/uts/common/vm/vm_usage.c

991

vmu_vnode_update_incore_bounds(avl_tree_t *tree, vnode_t *vnode,

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

1706

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

1943

ASSERT(bp->tree != NULL);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

1952

rv = drmach_node_walk(bp->tree, &data, drmach_board_find_devices_cb);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2164

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2311

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2353

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2404

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2427

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

2464

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

557

bp->tree = drmach_node_new();

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

560

if (ACPI_FAILURE(acpidev_dr_get_board_handle(bnum, &bp->tree->here))) {

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

566

ASSERT(bp->tree->here != NULL);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

575

if (acpidev_dr_device_is_powered(bp->tree->here)) {

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

583

if (ACPI_SUCCESS(acpica_get_devinfo(bp->tree->here, &dip))) {

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

602

if (bp->tree)

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

603

drmach_node_dispose(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

625

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

730

if (bp->tree == NULL)

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

732

hdl = drmach_node_get_dnode(bp->tree);

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.c

766

switch (acpidev_dr_get_board_type(bp->tree->get_dnode(bp->tree))) {

usr/src/uts/i86pc/io/acpi/drmach_acpi/drmach_acpi.h

134

drmach_node_t *tree;

usr/src/uts/intel/io/vmm/vmm_reservoir.c

222

vmmr_tp_init(vmmr_treepair_t *tree)

usr/src/uts/intel/io/vmm/vmm_reservoir.c

224

avl_create(&tree->by_addr, vmmr_cmp_addr, sizeof (vmmr_span_t),

usr/src/uts/intel/io/vmm/vmm_reservoir.c

226

avl_create(&tree->by_size, vmmr_cmp_size, sizeof (vmmr_span_t),

usr/src/uts/intel/io/vmm/vmm_reservoir.c

231

vmmr_tp_destroy(vmmr_treepair_t *tree)

usr/src/uts/intel/io/vmm/vmm_reservoir.c

236

while (avl_destroy_nodes(&tree->by_addr, &vcp) != NULL) {

usr/src/uts/intel/io/vmm/vmm_reservoir.c

239

while ((span = avl_destroy_nodes(&tree->by_size, &vcp)) != NULL) {

usr/src/uts/intel/io/vmm/vmm_reservoir.c

242

avl_destroy(&tree->by_addr);

usr/src/uts/intel/io/vmm/vmm_reservoir.c

243

avl_destroy(&tree->by_size);

usr/src/uts/intel/io/vmm/vmm_reservoir.c

252

vmmr_tp_insert_concat(vmmr_span_t *to_add, vmmr_treepair_t *tree)

usr/src/uts/intel/io/vmm/vmm_reservoir.c

254

avl_tree_t *by_addr = &tree->by_addr;

usr/src/uts/intel/io/vmm/vmm_reservoir.c

255

avl_tree_t *by_size = &tree->by_size;

usr/src/uts/intel/io/vmm/vmm_reservoir.c

305

vmmr_tp_remove_split(size_t target_sz, vmmr_treepair_t *tree)

usr/src/uts/intel/io/vmm/vmm_reservoir.c

307

avl_tree_t *by_addr = &tree->by_addr;

usr/src/uts/intel/io/vmm/vmm_reservoir.c

308

avl_tree_t *by_size = &tree->by_size;

usr/src/uts/sun4u/opl/io/drmach.c

1050

bp->tree = drmach_node_new();

usr/src/uts/sun4u/opl/io/drmach.c

1074

if (bp->tree)

usr/src/uts/sun4u/opl/io/drmach.c

1075

drmach_node_dispose(bp->tree);

usr/src/uts/sun4u/opl/io/drmach.c

146

drmach_node_t *tree;

usr/src/uts/sun4u/opl/io/drmach.c

1681

if (bp->tree == NULL)

usr/src/uts/sun4u/opl/io/drmach.c

1682

bp->tree = drmach_node_new();

usr/src/uts/sun4u/opl/io/drmach.c

1690

rv = drmach_node_walk(bp->tree, &data, drmach_board_find_devices_cb);

usr/src/uts/sun4u/opl/io/drmach.c

2509

if (bp->tree) {

usr/src/uts/sun4u/opl/io/drmach.c

2510

drmach_node_dispose(bp->tree);

usr/src/uts/sun4u/opl/io/drmach.c

2511

bp->tree = NULL;