Searched defs:nodes (Results 1 - 25 of 29) sorted by relevance

12

/illumos-gate/usr/src/lib/libtecla/common/
H A Dfreelist.c43 char *nodes; /* The array of free-list nodes */ member in struct:FreeListBlock
48 unsigned blocking_factor; /* The number of nodes per block */
49 long nbusy; /* The number of nodes that are in use */
50 long ntotal; /* The total number of nodes in the free list */
52 void *free_list; /* The free-list of nodes */
64 * node_size size_t The size of the free-list nodes to be returned
78 * pointer. This, plus the fact that the array of nodes is obtained via
118 * Add the new list of nodes to the free-list.
120 fl->free_list = fl->block->nodes;
[all...]
/illumos-gate/usr/src/lib/libdtrace/common/
H A Ddt_xlator.c99 const char *name, dt_node_t *members, dt_node_t *nodes)
201 * create member nodes for every member of the output type. Otherwise
210 dxp->dx_nodes = nodes;
97 dt_xlator_create(dtrace_hdl_t *dtp, const dtrace_typeinfo_t *src, const dtrace_typeinfo_t *dst, const char *name, dt_node_t *members, dt_node_t *nodes) argument
/illumos-gate/usr/src/lib/libnsctl/common/
H A Dmachdep.c44 * Internal routine to fetch all the current nodes that are
246 ncall_node_t *nodes; local
253 nodecnt = nsc_getcurrentnodes(&nodes);
258 if (strcmp(name, nodes[slot].nc_nodename) == 0) {
259 *id = nodes[slot].nc_nodeid;
267 free(nodes);
282 ncall_node_t *nodes; local
291 nodecnt = nsc_getcurrentnodes(&nodes);
296 if (nodes[slot].nc_nodeid == id) {
297 foundname = strdup(nodes[slo
[all...]
/illumos-gate/usr/src/cmd/svr4pkg/pkginstall/
H A Ddockspace.c65 #define WRN_NOFILES "The %s filesystem has %llu free file nodes. The " \
66 "current installation requires %llu file nodes, " \
68 "for temporary files. %llu more file nodes " \
357 long blocks, nodes; local
372 blocks = nodes = 0;
378 (void) sscanf(line, "%s %ld %ld", path, &blocks, &nodes);
401 fs_tab->fused += nodes;
/illumos-gate/usr/src/lib/libprtdiag/inc/
H A Dpdevinfo.h138 Prom_node *nodes; member in struct:board_node
161 /* functions for searching for Prom nodes */
/illumos-gate/usr/src/lib/libc/port/i18n/
H A Dplural_parser.h79 struct expr *nodes[3]; /* operands */ member in struct:expr
/illumos-gate/usr/src/cmd/avs/ncall/
H A Dncalladm.c222 ncall_node_t nodeinfo, *nodes; local
368 nodes = getnodelist(fd, &nsize, &mnode);
370 if (nodes == NULL) {
383 nodes[0].nc_nodename);
385 nodes[0].nc_nodeid);
391 if (nodes[i].nc_nodeid == mnode) {
392 mname = nodes[i].nc_nodename;
413 if (nodes[i].nc_nodeid != mnode) {
415 nodes[i].nc_nodename,
416 nodes[
[all...]
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dspace_map.c243 uint64_t size, total, rt_space, nodes; local
281 nodes = avl_numnodes(&rt->rt_root);
330 VERIFY3U(nodes, ==, avl_numnodes(&rt->rt_root));
/illumos-gate/usr/src/uts/common/sys/
H A Dpshot.h111 pshot_minor_t nodes[PSHOT_MAX_MINOR_PERINST]; member in struct:pshot
/illumos-gate/usr/src/uts/sun4u/serengeti/sys/
H A Dsbdp_mem.h47 pnode_t *nodes; member in struct:__anon9950
H A Dsbdp_priv.h156 int nnum; /* number of nodes */
158 pnode_t nodes[SBDP_MAX_MEM_NODES_PER_BOARD]; member in struct:__anon9956
217 pnode_t nodes[SBDP_MAX_NODES]; member in struct:__anon9959
/illumos-gate/usr/src/uts/sun4u/io/
H A Dgptwo_cpu.c153 int nodes = 0; local
183 nodes++;
204 nodes++;
212 nodes++;
214 new_nodes = gptwocfg_allocate_node_list(nodes);
353 * Set properties common to cpu (non-CMP) and core (CMP) nodes.
H A Dgptwocfg.c159 GPTWO_DEBUG1(1, CE_CONT, "gptwocfg_allocate_node_list- %d nodes",
181 GPTWO_DEBUG2(1, CE_CONT, "gptwocfg_free_node_list- %p %d nodes",
377 "No OBP created nodes for ap=0x%lx agent id=0x%x",
543 int i = 0, nodes = 0; local
566 nodes++;
571 GPTWO_DEBUG1(1, CE_CONT, "gptwocfg_get_obp_created_nodes - %d nodes "
572 "found\n", nodes);
574 obp_nodes = gptwocfg_allocate_node_list(nodes);
577 * Then fill in the nodes structure.
580 while ((saf_dev != NULL) && (i < nodes)) {
[all...]
/illumos-gate/usr/src/lib/fm/topo/modules/sun4v/sun4vpi/
H A Dpi_subr.c66 * Search the PRI for MDE nodes using md_scan_dag. Using this routine
70 * The routine returns the number of nodes found, or -1. If the node array
72 * topo_mod_free(mod, nodes, nsize);
77 char *type_str, char *arc_str, mde_cookie_t **nodes, size_t *nsize)
92 *nodes = topo_mod_zalloc(mod, *nsize);
93 if (*nodes == NULL) {
100 result = md_scan_dag(mdp, mde_start, start_cookie, arc_cookie, *nodes);
102 /* No nodes found. Free the node array before returning */
103 topo_mod_free(mod, *nodes, *nsize);
104 *nodes
76 pi_find_mdenodes(topo_mod_t *mod, md_t *mdp, mde_cookie_t mde_start, char *type_str, char *arc_str, mde_cookie_t **nodes, size_t *nsize) argument
236 mde_cookie_t *nodes = NULL; local
[all...]
/illumos-gate/usr/src/lib/libshell/common/bltins/
H A Dshiocmd_solaris.c246 Namval_t *nq,**nodes = (Namval_t**)(dcp+1); local
250 if(!(nq=nodes[n]))
252 nodes[n] = nq = sh_newnode(fp,np);
263 Namval_t *np, **nodes= (Namval_t**)(sp+1); local
275 if(!(np=nodes[i]) && out)
/illumos-gate/usr/src/lib/libv12n/sparc/
H A Dlibv12n.c203 mde_cookie_t *nodes, rootnode; local
213 nodes = malloc(nnodes * sizeof (mde_cookie_t));
214 if (nodes == NULL) {
222 md_find_name(mdp, "fwd"), nodes);
225 (void) md_get_prop_val(mdp, nodes[0], "domaining-enabled",
230 free(nodes);
277 mde_cookie_t *nodes, rootnode; local
282 nodes = malloc(nnodes * sizeof (mde_cookie_t));
283 if (nodes == NULL) {
290 md_find_name(mdp, "fwd"), nodes);
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dradix.c335 rn_newpair(void *v, uint_t b, struct radix_node nodes[2]) argument
337 struct radix_node *tt = nodes, *t = tt + 1;
359 struct radix_node nodes[2])
408 t = rn_newpair(v_arg, b, nodes);
560 * nodes and possibly save time in calculating indices.
358 rn_insert(void* v_arg, struct radix_node_head *head, boolean_t *dupentry, struct radix_node nodes[2]) argument
/illumos-gate/usr/src/cmd/fm/modules/common/fabric-xlate/
H A Dfx_subr.c233 xmlNodeSetPtr nodes; local
246 nodes = xpathObj->nodesetval;
248 if (nodes) {
249 temp = (char *)xmlNodeGetContent(nodes->nodeTab[0]);
370 * Line 1: Look at all nodes with the node name "propval"
395 xmlNodeSetPtr nodes; local
418 * Line 1: Look at all nodes with the node name "propval"
444 nodes = xpathObj->nodesetval;
445 size = (nodes) ? nodes
627 xmlNodeSetPtr nodes; local
890 xmlNodeSetPtr nodes; local
[all...]
/illumos-gate/usr/src/lib/lvm/libmeta/common/
H A Dmeta_metad.c777 md_node_nm_arr_t nodes,
803 (void) strcpy(args->nodes[i], nodes[i]);
1606 * across the nodes.
3302 * Used during reconfig cycle to recover from failed nodes.
3360 * to lock out class 1 messages (metainit, etc) on all nodes when running
3374 * - addition of first disk to diskset (joins all nodes)
3375 * - removal of last disk from diskset (withdraws all nodes)
3616 * information from another host in order to sync up all nodes.
774 clnt_createset( char *hostname, mdsetname_t *sp, md_node_nm_arr_t nodes, md_timeval32_t timestamp, ulong_t genid, md_error_t *ep ) argument
/illumos-gate/usr/src/lib/libshell/common/sh/
H A Dnvtype.c86 char *nodes; member in struct:Namtype
270 static Namval_t *findref(void *nodes, int n) argument
272 Namval_t *tp,*np = nv_namptr(nodes,n);
278 np = nv_namptr(nodes,i);
283 return(nv_namptr(pp->nodes,n-i-1));
291 Namval_t *nq = nv_namptr(dp->nodes,i);
300 nq->nvalue.nrp->np = findref(dp->nodes,i);
302 nq->nvalue.nrp->np = nv_namptr(pp->childfun.ttype->nodes,i);
313 Namval_t *np = nv_namptr(pp->nodes,i);
333 Namval_t *nr = nv_namptr( pp->childfun.ttype->nodes,
822 nv_mktype(Namval_t **nodes, int numnodes) argument
[all...]
H A Dinit.c1435 char *nodes; member in struct:Stats
1447 return(nv_namptr(sp->nodes,sp->current));
1463 nq = nv_namptr(sp->nodes,i);
1511 sp->nodes = (char*)(sp+1);
1516 np = nv_namptr(sp->nodes,i);
H A Dname.c77 Namval_t **nodes; member in struct:sh_type
219 name = (sp->nodes[0])->nvname;
232 nv_delete(sp->nodes[0],root,NV_NOFREE);
234 errormsg(SH_DICT,ERROR_exit(1),e_redef,sp->nodes[0]->nvname);
239 if(np == sp->nodes[i])
244 sp->nodes[i-1] = sp->nodes[i];
255 sp->nodes = (Namval_t**)realloc(sp->nodes,sizeof(Namval_t*)*sp->maxnodes);
257 sp->nodes[s
[all...]
/illumos-gate/usr/src/cmd/beadm/
H A Dbeadm.c360 be_node_list_t *nodes)
366 for (cur_be = nodes; cur_be != NULL; cur_be = cur_be->be_next_node) {
488 struct hdr_info *hdr, be_node_list_t *nodes)
494 for (cur_be = nodes; cur_be != NULL; cur_be = cur_be->be_next_node) {
359 print_be_nodes(const char *be_name, boolean_t parsable, struct hdr_info *hdr, be_node_list_t *nodes) argument
487 print_fmt_nodes(const char *be_name, enum be_fmt be_fmt, boolean_t parsable, struct hdr_info *hdr, be_node_list_t *nodes) argument
/illumos-gate/usr/src/cmd/lvm/rpc.metad/
H A Dmetad_svc_subr.c388 /* Skip nodes not being added */
615 * this instance) is the same across all the nodes in
1047 * Verify nodes are in membership list on THIS node.
1048 * Initiating node has verified that nodes are in membership
1057 /* Verify that all nodes are in member list */
1235 md_node_nm_arr_t nodes,
1265 (void) strcpy(sr->sr_nodes[i], nodes[i]);
1305 * Validate that nodes in set being created are in the
1307 * Initiating node has verified that nodes are in membership
1315 /* Verify that all nodes ar
1233 createset( mdsetname_t *sp, md_node_nm_arr_t nodes, md_timeval32_t timestamp, ulong_t genid, md_error_t *ep ) argument
[all...]
/illumos-gate/usr/src/cmd/awk_xpg4/
H A Dawk3.c95 static NODE nodes[NSNODE]; /* Cache of quick access nodes */ variable
96 static NODE *fnodep = &nodes[0];
115 * (PARM nodes are not acceptable).
375 if (length == 0 && running && fnodep < &nodes[NSNODE]) {
620 * Free all temporary nodes.
629 for (np = &nodes[0]; np < fnodep; np++) {
636 fnodep = &nodes[0];
941 * In the interest of speed, a left recursive tree of CONCAT nodes
1026 * All the rest are non-leaf nodes
[all...]

Completed in 125 milliseconds

12