Searched refs:tree (Results 76 - 100 of 142) sorted by relevance

123456

/illumos-gate/usr/src/tools/scripts/
H A DInstall.sh339 # Unpack the crypto tarball into the given tree, then massage the
340 # tree so that the binaries are all in objNN or debugNN directories.
345 [ -d "$ctop" ] || fail "Can't create tree for crypto modules."
693 for tree in $srctrees; do
695 $tree/cmd/mdb/$isadir/$b64srcdir \
697 kmdb_copy_karchkmods $tree/cmd/mdb/$KARCH \
710 for tree in $srctrees; do
712 $tree/cmd/mdb/$isadir/$b32srcdir \
714 kmdb_copy_karchkmods $tree/cmd/mdb/$KARCH \
/illumos-gate/usr/src/lib/libshell/common/sh/
H A Dexpand.c217 * scan tree and add each name that matches the given pattern
219 static int scantree(Dt_t *tree, const char *pattern, struct argnod **arghead) argument
225 np = (Namval_t*)dtfirst(tree);
226 for(;np && !nv_isnull(np);(np = (Namval_t*)dtnext(tree,np)))
/illumos-gate/usr/src/lib/libshare/common/
H A Dlibshare_impl.h109 xmlNodePtr tree; member in struct:sa_handle_impl
H A Dlibshare.c38 #include <libxml/tree.h>
932 * It is essential that the document tree and
936 * tree is the combination of handle->doc and
937 * handle->tree. This allows searches,
939 * tree.
942 handle->tree = xmlNewNode(NULL,
945 handle->tree != NULL) {
947 handle->tree);
948 err = add_handle_for_root(handle->tree,
953 handle->tree, handl
[all...]
/illumos-gate/usr/src/lib/libshell/common/scripts/
H A Dsimplefileattributetree1.sh29 # simplefileattributetree1 - build a simple file tree (including file attributes)
129 # tree base
154 [+NAME?simplefileattributetree1 - generate compound variable tree which contains file names and their attributes]
155 [+DESCRIPTION?\bsimplefileattributetree1\b is a simple variable tree
156 demo which builds a compound variable tree based on the output
159 [b:benchmark?Print time needed to generate the tree.]
160 [c:includecontent?Include the file\'s content in the tree, split into 1kb blocks.]
199 print -u2 -f "# building tree...\n"
210 # add node to tree and return it's absolute name in "treenodename"
213 # merge parsed "find -ls" output into tree nod
[all...]
/illumos-gate/usr/src/lib/libkmf/include/
H A Dkmfpolicy.h28 #include <libxml/tree.h>
/illumos-gate/usr/src/uts/i86pc/io/acpi/drmach_acpi/
H A Ddrmach_acpi.c302 /* save the handle, it will be modified when walking the tree. */
323 /* restore the handle to original value after walking the tree. */
553 bp->tree = drmach_node_new();
556 if (ACPI_FAILURE(acpidev_dr_get_board_handle(bnum, &bp->tree->here))) {
562 ASSERT(bp->tree->here != NULL);
571 if (acpidev_dr_device_is_powered(bp->tree->here)) {
579 if (ACPI_SUCCESS(acpica_get_devinfo(bp->tree->here, &dip))) {
598 if (bp->tree)
599 drmach_node_dispose(bp->tree);
621 hdl = drmach_node_get_dnode(bp->tree);
[all...]
H A Ddrmach_acpi.h134 drmach_node_t *tree; member in struct:__anon9358
/illumos-gate/usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/
H A Dfcal_leds_thread.c106 * In the case of disk ready, locate platform tree node for the disk
195 * cannot be found in the platform tree, we have probably
355 * located in the device tree. A check is applied that any node found has
410 di_node_t tree = di_init("/", DINFOCPYALL); local
411 if (tree == DI_NODE_NIL) {
416 r = walk_disks(tree, dtls);
417 if (tree != DI_NODE_NIL)
418 di_fini(tree);
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dvdev_queue.c650 avl_tree_t *tree; local
669 tree = vdev_queue_class_tree(vq, p);
672 VERIFY3P(avl_find(tree, &search, &idx), ==, NULL);
673 zio = avl_nearest(tree, idx, AVL_AFTER);
675 zio = avl_first(tree);
/illumos-gate/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/
H A Dldap_principal2.c89 unsigned int tree=0, ntrees=1, princlen=0; local
137 for (tree=0; tree < ntrees && *nentries == 0; ++tree) {
139 LDAP_SEARCH(subtree[tree], ldap_context->lrparams->search_scope, filter, principal_attributes);
168 } /* for (tree=0 ... */
522 int tree = 0, princlen = 0, numlentries = 0; local
552 for (tree = 0; found_entry == FALSE && tree < ntrees; ++tree) {
[all...]
/illumos-gate/usr/src/lib/libshell/common/tests/
H A Dcomvar.sh498 typeset -C tree
510 f1 tree
512 [[ $tree == "$expected" ]] || err_exit 'move of compound local variable to global variable not working'
/illumos-gate/usr/src/cmd/unpack/
H A Dunpack.c76 static char *tree[25]; variable
104 * set tree[i] to point to leaves for level i
140 tree[i] = eof;
204 p = &tree[lev][j];
/illumos-gate/usr/src/cmd/sgs/lex/common/
H A Dsub1.c679 error("Parse tree too big %s",
726 error("Parse tree too big %s",
769 error("Parse tree too big %s",
/illumos-gate/usr/src/cmd/fs.d/ufs/fsck/
H A Ddup_avl.c32 * The duplicates are kept in a binary tree to attempt to minimize
64 * (pfn) and has the root of the tree of the associated claimants. It
126 * For DB_INCR, returns true if the dup was added to the tree.
127 * For DB_DECR, returns true if the dup was in the tree.
181 * What we have is a tree of duplicates indexed by physical
281 * Given a tree of fragment_ts, each element of which has an integral
282 * sub-tree of claimant_ts, produce a tree of inode_dup_ts, each element
283 * of which has an integral sub-tree of reference_ts.
347 * Discard memory associated with the inverted fragments tree create
351 free_invert_frags(avl_tree_t *tree) argument
[all...]
/illumos-gate/usr/src/uts/common/fs/smbsrv/
H A Dsmb_oplock.c119 * If oplocks are not supported on the tree, or node, grant NONE.
141 smb_tree_t *tree; local
151 tree = SMB_OFILE_GET_TREE(ofile);
181 !smb_tree_has_feature(tree, SMB_TREE_OPLOCKS) ||
410 * oplock break on it. (Also hold the tree and user.)
H A Dsmb_query_fileinfo.c876 smb_tree_t *tree = sr->tid_tree; local
883 len = snprintf(buf, buflen, "\\%s", tree->t_sharename);
891 if (node == tree->t_snode) {
897 rc = smb_node_getshrpath(node, tree, buf, buflen);
H A Dsmb_find.c230 smb_tree_t *tree; local
263 tree = sr->tid_tree;
268 (void) strncpy(name, tree->t_volume, sizeof (name));
/illumos-gate/usr/src/uts/common/fs/smbclnt/smbfs/
H A Dsmbfs_node.h72 avl_node_t tree; /* AVL tree links */ member in struct:rddir_cache
103 * fields used to link nodes in the AVL tree, and those
108 * The AVL tree is mntinfo.smi_hash_avl,
113 * Our linkage in the node cache AVL tree.
134 * Now using an AVL tree instead of hash lists, but kept the
136 * One AVL tree per mount replaces the global hash buckets.
154 * "hash" AVL tree and free list locks):
173 * The following members are protected by the AVL tree rwlock:
193 /* Our linkage in the node cache AVL tree (se
[all...]
/illumos-gate/usr/src/lib/libprtdiag/common/
H A Dmemory.c88 display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats, argument
113 display_memoryconf(Sys_tree *tree, struct grp_info *grps) argument
/illumos-gate/usr/src/lib/libresolv2/
H A DMakefile.com63 movefile.o tree.o
/illumos-gate/usr/src/cmd/du/
H A Ddu.c98 static avl_tree_t *tree = NULL; variable
363 if ((rc = add_tnode(&tree, stb.st_dev, stb.st_ino)) != 1) {
373 * node to the tree.
/illumos-gate/usr/src/cmd/nscd/
H A Dcache.h241 avl_tree_t tree; member in struct:nsc_db
/illumos-gate/usr/src/uts/common/nfs/
H A Drnode.h82 avl_node_t tree; /* AVL tree links */ member in struct:rddir_cache
/illumos-gate/usr/src/lib/smbsrv/libmlsvc/common/
H A Dsrvsvc_svc.c227 * List tree connections made to a share on this server or all tree
426 smb_netconnectinfo_t *tree; local
439 tree = &item->nsi_un.nsi_tree;
443 ci0->coni0_id = tree->ci_id;
448 ci1->coni1_id = tree->ci_id;
449 ci1->coni1_type = tree->ci_type;
450 ci1->coni1_num_opens = tree->ci_numopens;
451 ci1->coni1_num_users = tree->ci_numusers;
452 ci1->coni1_time = tree
[all...]

Completed in 103 milliseconds

123456