Searched refs:node (Results 1 - 25 of 770) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/tools/smatch/src/
H A Dast-inspect.h7 void inspect_symbol(AstNode *node);
8 void inspect_symbol_list(AstNode *node);
10 void inspect_statement(AstNode *node);
11 void inspect_statement_list(AstNode *node);
13 void inspect_expression(AstNode *node);
14 void inspect_expression_list(AstNode *node);
H A Davl.c30 static void freeNode(AvlNode *node);
32 static AvlNode *lookup(const struct stree *avl, AvlNode *node, const struct sm_state *sm);
41 static bool checkBalances(AvlNode *node, int *height);
43 static size_t countNode(AvlNode *node);
154 AvlNode *node = NULL; local
164 remove_sm(*avl, &(*avl)->root, sm, &node);
169 if (node == NULL) {
172 free(node);
179 AvlNode *node = malloc(sizeof(*node)); local
190 freeNode(AvlNode *node) argument
199 lookup(const struct stree *avl, AvlNode *node, const struct sm_state *sm) argument
227 AvlNode *node = *p; local
255 AvlNode *node = *p; local
315 AvlNode *node = *p; local
357 AvlNode *node = *p, local
405 checkBalances(AvlNode *node, int *height) argument
442 countNode(AvlNode *node) argument
455 AvlNode *node; local
478 AvlNode *node = iter->node; local
[all...]
H A Dast-model.c44 void inspect_child_node(AstNode *node) argument
46 if (node->inspect) {
47 node->inspect(node);
48 node->inspect = NULL;
54 AstNode* ast_nth_child(AstNode *node, int n) argument
56 if (!node)
59 inspect_child_node(node);
61 if (n >= node->childnodes->len)
63 return g_array_index(node
68 ast_set_iter(GtkTreeIter *iter, AstNode *node) argument
177 ast_init(AstNode *node) argument
264 AstNode *node; local
292 AstNode *node = AST_NODE(iter->user_data); local
316 AstNode *node = iter->user_data; local
341 AstNode *node = iter->user_data; local
382 AstNode *node = iter->user_data; local
404 AstNode *node = iter ? iter->user_data local
429 AstNode *node = parent ? parent->user_data : (AstNode*) tree_model; local
451 AstNode *node = (AstNode *) child->user_data; local
460 AstNode *node = (AstNode*) g_object_new (AST_TYPE_NODE, NULL); local
[all...]
/illumos-gate/usr/src/cmd/fm/eversholt/common/
H A Dcheck.h44 void check_report_combination(struct node *np);
45 void check_arrow(struct node *np);
46 void check_stmt_required_properties(struct node *stmtnp);
48 struct node *nvpairnp, struct lut *lutp);
49 void check_propnames(enum nodetype t, struct node *np, int from, int to);
50 void check_propscope(struct node *np);
51 void check_proplists(enum nodetype t, struct node *np);
52 void check_upset_engine(struct node *lhs, struct node *rhs, void *arg);
53 void check_refcount(struct node *lh
[all...]
H A Dtree.h27 * the parse tree is made up of struct node's. the struct is
29 * related to the node, and then type-specific node data.
41 struct node { struct
93 * regardless of the type of node, filename and line number
100 * the variant part of a struct node...
144 struct node *child;
145 struct node *next;
146 struct node *last;
201 struct node *arglis
[all...]
/illumos-gate/usr/src/cmd/fm/modules/common/eversholt/
H A Diexpr.h39 struct node *iexpr(struct node *np);
40 int iexpr_cached(struct node *np);
41 void iexpr_free(struct node *np);
H A Deval.h43 NODEPTR /* (struct node *) */
52 int eval_potential(struct node *np, struct lut *ex, struct node *events[],
53 struct node **newc, struct config *croot);
54 int eval_expr(struct node *np, struct lut *ex, struct node *events[],
/illumos-gate/usr/src/psm/promif/ieee1275/common/
H A Dprom_boot.c36 pnode_t node; local
43 node = prom_chosennode();
44 if ((node == OBP_NONODE) || (node == OBP_BADNODE))
45 node = prom_rootnode();
46 length = prom_getproplen(node, name);
51 (void) prom_bounded_getprop(node, name, bootargs, length);
68 pnode_t node; local
74 node = prom_chosennode();
75 if ((node
[all...]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c58 t_decode *node, *saved; local
70 /* First node of tree. */
71 node = (t_decode *) malloc(sizeof *node);
72 if (node == (t_decode *) 0)
75 *root = saved = node;
77 node->child = node->sibling = (t_decode *) 0;
78 node->ch = *str++;
79 node
[all...]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c60 t_decode *node, *saved; local
72 /* First node of tree. */
73 node = (t_decode *) malloc(sizeof (*node));
74 if (node == NULL)
77 *root = saved = node;
79 node->child = node->sibling = NULL;
80 node->ch = *str++;
81 node
[all...]
/illumos-gate/usr/src/lib/libinetutil/common/
H A Dtq.c65 iu_timer_node_t *node, *next_node; local
67 for (node = tq->iutq_head; node != NULL; node = next_node) {
68 next_node = node->iutn_next;
69 destroy_timer(tq, node);
76 * insert_timer(): inserts a timer node into a tq's timer list
79 * iu_timer_node_t *: the timer node to insert into the list
85 insert_timer(iu_tq_t *tq, iu_timer_node_t *node, uint64_t msec) argument
90 * find the node t
128 remove_timer(iu_tq_t *tq, iu_timer_node_t *node) argument
147 destroy_timer(iu_tq_t *tq, iu_timer_node_t *node) argument
196 iu_timer_node_t *node = calloc(1, sizeof (iu_timer_node_t)); local
227 iu_timer_node_t *node; local
256 iu_timer_node_t *node; local
317 iu_timer_node_t *node, *next_node; local
[all...]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dstringrp.c133 StringSegment *node; local
137 for(node=sg->head; node; node=node->next) {
138 if(node->block)
139 free(node->block);
140 node->block = NULL;
230 StringSegment *node; /* A node o local
289 StringSegment *node; /* A node in the list of string segments */ local
[all...]
/illumos-gate/usr/src/uts/common/fs/smbsrv/
H A Dsmb_node.c53 * This transition occurs in smb_node_lookup(). If the node looked for is
54 * not found in the has table a new node is created. The reference count is
61 * reference count will be given out for that node.
70 * The reason the smb node has 2 states is the following synchronization
73 * There's a mutex embedded in the node used to protect its fields and
74 * there's a lock embedded in the bucket of the hash table the node belongs
76 * entered. To insert the node into the bucket and to remove it from the
81 * reference count drops to zero and triggers the deletion of the node, the
83 * remove the node). This creates a window during which the node tha
139 smb_node_t *node; local
193 smb_node_t *node; local
258 smb_node_t *node; local
429 smb_node_ref(smb_node_t *node) argument
469 smb_node_release(smb_node_t *node) argument
518 smb_node_delete_on_close(smb_node_t *node) argument
672 smb_node_set_delete_on_close(smb_node_t *node, cred_t *cr, uint32_t flags) argument
712 smb_node_reset_delete_on_close(smb_node_t *node) argument
734 smb_node_open_check(smb_node_t *node, uint32_t desired_access, uint32_t share_access) argument
768 smb_node_rename_check(smb_node_t *node) argument
800 smb_node_delete_check(smb_node_t *node) argument
844 smb_node_share_check(smb_node_t *node) argument
865 smb_node_fcn_subscribe(smb_node_t *node) argument
876 smb_node_fcn_unsubscribe(smb_node_t *node) argument
887 smb_node_notify_change(smb_node_t *node, uint_t action, const char *name) argument
954 smb_node_start_crit(smb_node_t *node, krw_t mode) argument
966 smb_node_end_crit(smb_node_t *node) argument
973 smb_node_in_crit(smb_node_t *node) argument
979 smb_node_rdlock(smb_node_t *node) argument
985 smb_node_wrlock(smb_node_t *node) argument
991 smb_node_unlock(smb_node_t *node) argument
997 smb_node_add_ofile(smb_node_t *node, smb_ofile_t *of) argument
1007 smb_node_rem_ofile(smb_node_t *node, smb_ofile_t *of) argument
1020 smb_node_inc_open_ofiles(smb_node_t *node) argument
1031 smb_node_dec_open_ofiles(smb_node_t *node) argument
1041 smb_node_inc_opening_count(smb_node_t *node) argument
1051 smb_node_dec_opening_count(smb_node_t *node) argument
1061 smb_node_getmntpath(smb_node_t *node, char *buf, uint32_t buflen) argument
1095 smb_node_getshrpath(smb_node_t *node, smb_tree_t *tree, char *buf, uint32_t buflen) argument
1124 smb_node_getpath(smb_node_t *node, vnode_t *rootvp, char *buf, uint32_t buflen) argument
1173 smb_node_t *node; local
1215 smb_node_free(smb_node_t *node) argument
1281 smb_node_create_audit_buf(smb_node_t *node, int kmflags) argument
1296 smb_node_destroy_audit_buf(smb_node_t *node) argument
1311 smb_node_audit(smb_node_t *node) argument
1344 smb_node_is_file(smb_node_t *node) argument
1351 smb_node_is_dir(smb_node_t *node) argument
1359 smb_node_is_symlink(smb_node_t *node) argument
1367 smb_node_is_dfslink(smb_node_t *node) argument
1375 smb_node_is_reparse(smb_node_t *node) argument
1383 smb_node_is_vfsroot(smb_node_t *node) argument
1390 smb_node_is_system(smb_node_t *node) argument
1405 smb_node_file_is_readonly(smb_node_t *node) argument
1471 smb_node_setattr(smb_request_t *sr, smb_node_t *node, cred_t *cr, smb_ofile_t *of, smb_attr_t *attr) argument
1630 smb_node_getattr(smb_request_t *sr, smb_node_t *node, cred_t *cr, smb_ofile_t *of, smb_attr_t *attr) argument
1735 smb_node_init_reparse(smb_node_t *node, smb_attr_t *attr) argument
1779 smb_node_init_system(smb_node_t *node) argument
[all...]
/illumos-gate/usr/src/lib/smbsrv/libfksmbsrv/common/
H A Dfksmb_fem.c41 smb_fem_fcn_install(smb_node_t *node) argument
48 smb_fem_fcn_uninstall(smb_node_t *node) argument
54 smb_fem_oplock_install(smb_node_t *node) argument
61 smb_fem_oplock_uninstall(smb_node_t *node) argument
/illumos-gate/usr/src/lib/libshell/common/tests/
H A Dtreemove.sh51 # add node to tree which uses "typeset -m" to move a local variable
57 typeset -C node
58 node.one="hello"
59 node.two="world"
62 typeset -m tr.subtree["a_node"]=node
71 nameref node=tr.subtree["a_node"]
72 node.one="hello"
73 node.two="world"
H A Dsun_solaris_cr_6805792_varmovetest1.sh32 # The following attempt to move a local node into an associative array
42 # typeset -C node
44 # node.one="hello"
45 # node.two="world"
48 # typeset -m tr.subtree["a_node"]=node
98 # add node to tree which uses "typeset -m" to move a local variable
106 compound node
108 node.one="dummy1"
109 node.two="dummy2"
113 # still reference "node" whic
[all...]
/illumos-gate/usr/src/lib/libdtrace/common/
H A Ddlink_audit.c72 obj_list_t *node; local
75 * If we can't allocate the next node in our list, we'll try to emit a
78 if ((node = malloc(sizeof (obj_list_t))) == NULL) {
82 node->ol_next = list;
83 node->ol_name = strdup(lmp->l_name);
84 node->ol_addr = lmp->l_addr;
85 node->ol_lmid = lmid;
86 list = node;
111 obj_list_t *node = list; local
112 char *name = node
[all...]
/illumos-gate/usr/src/cmd/devfsadm/i386/
H A Dmisc_link_i386.c39 static int lp(di_minor_t minor, di_node_t node);
40 static int serial_dialout(di_minor_t minor, di_node_t node);
41 static int serial(di_minor_t minor, di_node_t node);
42 static int diskette(di_minor_t minor, di_node_t node);
43 static int vt00(di_minor_t minor, di_node_t node);
44 static int kdmouse(di_minor_t minor, di_node_t node);
45 static int ipmi(di_minor_t minor, di_node_t node);
46 static int smbios(di_minor_t minor, di_node_t node);
47 static int mc_node(di_minor_t minor, di_node_t node);
48 static int xsvc(di_minor_t minor, di_node_t node);
129 vt00(di_minor_t minor, di_node_t node) argument
142 diskette(di_minor_t minor, di_node_t node) argument
188 lp(di_minor_t minor, di_node_t node) argument
235 serial(di_minor_t minor, di_node_t node) argument
267 serial_dialout(di_minor_t minor, di_node_t node) argument
291 kdmouse(di_minor_t minor, di_node_t node) argument
298 ipmi(di_minor_t minor, di_node_t node) argument
309 smbios(di_minor_t minor, di_node_t node) argument
319 mc_node(di_minor_t minor, di_node_t node) argument
353 xsvc(di_minor_t minor, di_node_t node) argument
372 srn(di_minor_t minor, di_node_t node) argument
391 ucode(di_minor_t minor, di_node_t node) argument
[all...]
/illumos-gate/usr/src/test/zfs-tests/tests/functional/acl/nontrivial/
H A Dzfs_acl_chmod_001_neg.ksh52 function err_opts #node
59 log_mustnot usr_exec chmod ${A}owner@:read_data:allow $node
60 log_mustnot usr_exec chmod A+ asd owner@:execute:deny $node
65 log_mustnot usr_exec chmod A+$tp:read_data:deny $node
71 function del_all_ACE #node
73 typeset node=$1
76 cnt=$(count_ACE $node)
79 log_mustnot chmod A0- $node
81 log_must chmod A0- $node
90 function exceed_max_ACE #node
[all...]
H A Dzfs_acl_chmod_rwacl_001_pos.ksh58 function read_ACL #<node> <user1> <user2> ...
60 typeset node=$1
66 chgusr_exec $user ls -vd $node > /dev/null 2>&1
76 function write_ACL #<node> <user1> <user2> ...
78 typeset node=$1
84 before_cnt=$(count_ACE $node)
88 chgusr_exec $user chmod A0+owner@:read_data:allow $node
92 after_cnt=$(count_ACE $node)
96 chgusr_exec $user chmod A0- $node
110 function check_owner #<node>
[all...]
H A Dzfs_acl_chmod_rwx_004_pos.ksh47 function check_access #log user node access rflag
51 typeset node=$3
56 rwx_node $user $node $access
63 log_note "SUCCESS: rwx_node $user $node $access"
65 log_fail "FAIL: rwx_node $user $node $access"
68 $log rwx_node $user $node $access
72 function verify_explicit_ACL_rule #node access flag
74 typeset node=$1
90 log_must usr_exec chmod A+everyone@:$access:$flag $node
91 log_must usr_exec chmod A+user:$ZFS_ACL_OTHER1:$access:$rflag $node
[all...]
/illumos-gate/usr/src/cmd/awk_xpg4/
H A Dawk.y52 NODE *node;
64 %token <node> PARM ARRAY UFUNC FIELD IN INDEX CONCAT
65 %token <node> NOT AND OR EXP QUEST
66 %token <node> EQ NE GE LE GT LT
67 %token <node> ADD SUB MUL DIV REM INC DEC PRE_INC PRE_DEC
68 %token <node> GETLINE CALLFUNC RE TILDE NRE
74 %token <node> PRINT PRINTF
75 %token <node> EXIT RETURN BREAK CONTINUE NEXT
76 %token <node> DELETE WHILE DO FOR FORIN IF
82 %token <node> CONSTAN
[all...]
/illumos-gate/usr/src/lib/libhotplug/common/
H A Dlibhotplug.h37 * Define node types in hotplug snapshot.
81 int hp_type(hp_node_t node);
82 char *hp_name(hp_node_t node);
83 char *hp_usage(hp_node_t node);
84 int hp_state(hp_node_t node);
85 char *hp_description(hp_node_t node);
86 time_t hp_last_change(hp_node_t node);
87 hp_node_t hp_parent(hp_node_t node);
88 hp_node_t hp_child(hp_node_t node);
89 hp_node_t hp_sibling(hp_node_t node);
[all...]
/illumos-gate/usr/src/psm/stand/boot/sparc/common/
H A Dsun4dep.c46 pnode_t node; local
54 node = prom_findnode_bydevtype(prom_rootnode(), OBP_CPU);
55 if (node != OBP_NONODE && node != OBP_BADNODE) {
58 if ((nlen = prom_getproplen(node, OBP_NAME)) <= 0 ||
60 prom_getprop(node, OBP_NAME, cpubuf) <= 0)
61 prom_panic("no name in cpu node");
67 * node for the compatible property.
69 if ((clen = prom_getproplen(node, OBP_COMPATIBLE)) > 0 ||
70 ((node
[all...]
/illumos-gate/usr/src/common/avl/
H A Davl.c38 * any given node, the left and right subtrees are allowed to differ in height
66 * - The left/right children pointers of a node are in an array.
76 * int left_heavy; // -1 when left subtree is taller at some node,
91 * pointer) is set to indicate if that the new node has a value greater
123 * Walk from one node to the previous valued node (ie. an infix walk
124 * towards the left). At any given node we do one of 2 things:
133 * otherwise next node
139 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local
147 if (node
185 avl_node_t *node; local
204 avl_node_t *node; local
229 avl_node_t *node = AVL_INDEX2NODE(where); local
257 avl_node_t *node; local
303 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument
484 avl_node_t *node; local
578 avl_node_t *node; local
682 avl_node_t *node; local
975 avl_node_t *node; local
[all...]

Completed in 164 milliseconds

1234567891011>>