| /onnv/onnv-gate/usr/src/cmd/fm/eversholt/common/ |
| check.h | 44 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 *lhs, struct node *rhs, void *arg)
[all...] |
| tree.h | 27 * 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 *arglist
[all...] |
| /onnv/onnv-gate/usr/src/cmd/fm/modules/common/eversholt/ |
| iexpr.h | 39 struct node *iexpr(struct node *np);
40 int iexpr_cached(struct node *np);
41 void iexpr_free(struct node *np);
|
| eval.h | 43 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[],
|
| /onnv/onnv-gate/usr/src/psm/promif/ieee1275/common/ |
| prom_boot.c | 36 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 == OBP_NONODE) || (node == OBP_BADNODE)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/fs/smbsrv/ |
| smb_node.c | 26 * SMB Node State Machine
62 * This transition occurs in smb_node_lookup(). If the node looked for is
63 * not found in the has table a new node is created. The reference count is
101 * reference count will be given out for that node.
110 * The reason the smb node has 2 states is the following synchronization
113 * There's a mutex embedded in the node used to protect its fields and
114 * there's a lock embedded in the bucket of the hash table the node belongs
116 * entered. To insert the node into the bucket and to remove it from the
121 * reference count drops to zero and triggers the deletion of the node, the
123 * remove the node). This creates a window during which the node that i
217 smb_node_t *node; local
278 smb_node_t *node; local
607 smb_node_t *node; local
954 smb_node_t *node; local
[all...] |
| smb_oplock.c | 33 * the smb node, the oplock of which needs to be broken, is also exited before
144 smb_oplock_acquire(smb_node_t *node, smb_ofile_t *of, open_param_t *op)
150 SMB_NODE_VALID(node);
153 ASSERT(node == SMB_OFILE_GET_NODE(of));
163 ol = &node->n_oplock;
166 mutex_enter(&node->n_mutex);
168 switch (node->n_state) {
171 mutex_exit(&node->n_mutex);
185 smb_oplock_wait(node);
187 if (node->n_state == SMB_NODE_STATE_AVAILABLE)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libxcurses/src/libc/xcurses/ |
| keypad.c | 58 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->key = 0
[all...] |
| /onnv/onnv-gate/usr/src/lib/libxcurses2/src/libc/xcurses/ |
| keypad.c | 60 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->key = 0
[all...] |
| /onnv/onnv-gate/usr/src/lib/libinetutil/common/ |
| tq.c | 65 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)
90 * find the node to insert this new node "after". we do thi
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...] |
| /onnv/onnv-gate/usr/src/lib/libtecla/common/ |
| stringrp.c | 133 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 of the list of string segments * local
289 StringSegment *node; \/* A node in the list of string segments *\/ local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnsctl/common/ |
| hash.c | 47 hash_node_t *node; local
49 node = (hash_node_t *)malloc(sizeof (hash_node_t));
50 if (!node) {
53 node->key = strdup(key);
54 node->data = data;
61 node->next = hash[ index ];
62 hash[ index ] = node;
71 * Searches the hash to find a node.
75 * pointer to node if found.
81 hash_node_t *node; local
97 hash_node_t *node, *prev; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libshell/common/tests/ |
| treemove.sh | 51 # 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"
|
| sun_solaris_cr_6805792_varmovetest1.sh | 33 # The following attempt to move a local node into an associative array
43 # typeset -C node
45 # node.one="hello"
46 # node.two="world"
49 # typeset -m tr.subtree["a_node"]=node
99 # add node to tree which uses "typeset -m" to move a local variable
107 compound node
109 node.one="dummy1"
110 node.two="dummy2"
114 # still reference "node" which was renamed
[all...] |
| /onnv/onnv-gate/usr/src/lib/fm/topo/libtopo/common/ |
| topo_node.c | 35 * may access node data safely without locks. The exception to this rule
36 * is data associated with node properties (topo_prop.c). Properties
41 * scope of operation: the parent node passed into the enumeration op or those
47 * node property data, and contruct or destroy child nodes for the node
49 * the node for which the method operation is called. This permits
53 * Node Interfaces
57 * node instances with topo_node_range_create(). topo_node_range_create()
58 * does not allocate any node resources but creates the infrastruture
63 * the node be bound
390 tnode_t *node; local
448 tnode_t *node; local
534 tnode_t *node; local
[all...] |
| topo_protocol.c | 41 topo_node_asru(tnode_t *node, nvlist_t **asru, nvlist_t *priv, int *err)
45 if (topo_prop_getprop(node, TOPO_PGROUP_PROTOCOL,
50 topo_hdl_nvdup(node->tn_hdl, ap, asru) < 0) {
62 topo_node_fru(tnode_t *node, nvlist_t **fru, nvlist_t *priv, int *err)
66 if (topo_prop_getprop(node, TOPO_PGROUP_PROTOCOL, TOPO_PROP_FRU,
71 topo_hdl_nvdup(node->tn_hdl, fp, fru) < 0) {
83 topo_node_resource(tnode_t *node, nvlist_t **resource, int *err)
86 return (topo_prop_get_fmri(node, TOPO_PGROUP_PROTOCOL,
91 topo_node_label(tnode_t *node, char **label, int *err)
94 return (topo_prop_get_string(node, TOPO_PGROUP_PROTOCOL
[all...] |
| /onnv/onnv-gate/usr/src/cmd/awk_xpg4/ |
| awk.y | 48 static NODE * fliplist ANSI((NODE *np));
52 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 PRINT
[all...] |
| /onnv/onnv-gate/usr/src/psm/stand/boot/sparcv9/sun4u/ |
| machdep.c | 56 visit(pnode_t node)
67 if (prom_getproplen(node, "name") != sizeof (ultrasparc))
69 (void) prom_getprop(node, "name", name);
73 if (prom_getproplen(node, manufacturer) != sizeof (int))
75 (void) prom_getprop(node, manufacturer, (caddr_t)&manu);
80 if (prom_getproplen(node, implementation) != sizeof (int))
82 (void) prom_getprop(node, implementation, (caddr_t)&impl);
87 return (node);
91 * visit each node in the device tree, until we get a non-null answer
94 walk(pnode_t node)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libhotplug/common/ |
| libhotplug.h | 37 * 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...] |
| /onnv/onnv-gate/usr/src/psm/stand/boot/sparc/common/ |
| sun4dep.c | 46 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 = prom_parentnode(node)) != OBP_NONODE &
[all...] |
| /onnv/onnv-gate/usr/src/common/avl/ |
| avl.c | 33 * any given node, the left and right subtrees are allowed to differ in height
61 * - The left/right children pointers of a node are in an array.
71 * int left_heavy; // -1 when left subtree is taller at some node,
86 * pointer) is set to indicate if that the new node has a value greater
112 * Walk from one node to the previous valued node (ie. an infix walk
113 * towards the left). At any given node we do one of 2 things:
121 * otherwise next node
127 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local
135 if (node == NULL
173 avl_node_t *node; local
192 avl_node_t *node; local
217 avl_node_t *node = AVL_INDEX2NODE(where); local
245 avl_node_t *node; local
472 avl_node_t *node; local
566 avl_node_t *node; local
667 avl_node_t *node; local
942 avl_node_t *node; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/devfsadm/sparc/ |
| misc_link_sparc.c | 38 static int ddi_other(di_minor_t minor, di_node_t node);
39 static int diskette(di_minor_t minor, di_node_t node);
40 static int ecpp_create(di_minor_t minor, di_node_t node);
41 static int mc_node(di_minor_t minor, di_node_t node);
42 static int starcat_sbbc_node(di_minor_t minor, di_node_t node);
43 static int lom(di_minor_t minor, di_node_t node);
44 static int ntwdt_create(di_minor_t minor, di_node_t node);
45 static int bmc(di_minor_t minor, di_node_t node);
78 * Handles minor node type "ddi_other"
83 ddi_other(di_minor_t minor, di_node_t node)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/filebench/common/ |
| fb_avl.c | 35 * any given node, the left and right subtrees are allowed to differ in height
63 * - The left/right children pointers of a node are in an array.
73 * int left_heavy; // -1 when left subtree is taller at some node,
88 * pointer) is set to indicate if that the new node has a value greater
111 * Walk from one node to the previous valued node (ie. an infix walk
112 * towards the left). At any given node we do one of 2 things:
120 * otherwise next node
126 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local
134 if (node == NULL
172 avl_node_t *node; local
191 avl_node_t *node; local
216 avl_node_t *node = AVL_INDEX2NODE(where); local
246 avl_node_t *node; local
475 avl_node_t *node; local
581 avl_node_t *node; local
657 avl_node_t *node; local
960 avl_node_t *node; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/comstar/port/pppt/ |
| pppt.conf | 29 pppt-node-id=0;
|
| /onnv/onnv-gate/usr/src/cmd/rcm_daemon/common/ |
| bridge_rcm.c | 186 * rcm_register_interest() for each node before we free it, but the
236 link_cache_t *node; local
243 node = cache_head.vc_next;
244 while (node != &cache_tail) {
245 retv = rcm_unregister_interest(hd, node->vc_resource, 0);
248 cache_remove(node);
249 node_free(node);
250 node = cache_head.vc_next;
255 _("Bridge: failed to unregister %s\n"), node->vc_resource);
285 link_cache_t *node; local
332 link_cache_t *node; local
384 link_cache_t *node; local
449 link_cache_t *node; local
595 link_cache_t *node; local
673 link_cache_t *node; local
740 link_cache_t *node, *nnode; local
806 link_cache_t *node; local
865 link_cache_t *node; local
[all...] |
