Searched refs:nodes (Results 1 - 25 of 35) sorted by relevance

12

/osnet-11/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...]
/osnet-11/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);
365 mde_cookie_t *nodes, rootnode; local
[all...]
/osnet-11/usr/src/lib/libc/port/i18n/
H A Dplural_parser.c144 if (e->nodes[2])
145 freeexpr(e->nodes[2]);
148 if (e->nodes[1])
149 freeexpr(e->nodes[1]);
152 if (e->nodes[0])
153 freeexpr(e->nodes[0]);
231 newitem->nodes[2] = exp3;
234 newitem->nodes[1] = exp2;
237 newitem->nodes[0] = exp1;
874 e1 = plural_eval(exp->nodes[
[all...]
H A Dplural_parser.h79 struct expr *nodes[3]; /* operands */ member in struct:expr
H A Dgettext_util.c577 printexpr(e->nodes[0], level+1);
581 printexpr(e->nodes[0], level+1);
582 printexpr(e->nodes[1], level+1);
587 printexpr(e->nodes[0], level+1);
588 printexpr(e->nodes[1], level+1);
589 printexpr(e->nodes[2], level+1);
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A Dregex_internal.c26 const re_node_set *nodes,
29 const re_node_set *nodes,
1406 /* Add the token TOKEN to dfa->nodes, and return the index of the token.
1428 new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
1431 dfa->nodes = new_nodes;
1445 dfa->nodes[dfa->nodes_len] = token;
1446 dfa->nodes[dfa->nodes_len].constraint = 0;
1450 dfa->nodes[dfa->nodes_len].accept_mb =
1462 calc_state_hash (const re_node_set *nodes, unsigned int context)
1464 re_hashval_t hash = nodes
1459 calc_state_hash(const re_node_set *nodes, unsigned int context) argument
1479 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument
1527 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument
1623 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, re_hashval_t hash) argument
1673 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, re_hashval_t hash) argument
[all...]
H A Dregexec.c152 const re_node_set *nodes)
162 static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
693 if (dfa->init_state->nodes.nelem == 0
694 && dfa->init_state_word->nodes.nelem == 0
695 && (dfa->init_state_nl->nodes.nelem == 0
1147 err = check_subexp_matching_top (mctx, &cur_state->nodes, 0);
1153 err = transit_state_bkref (mctx, &cur_state->nodes);
1251 re_token_type_t type = dfa->nodes[node].type;
1252 unsigned int constraint = dfa->nodes[node].constraint;
1277 for (i = 0; i < state->nodes
2608 transit_state_bkref(re_match_context_t *mctx, const re_node_set *nodes) argument
2806 const re_node_set *nodes; local
2901 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, Idx subexp_idx, int type) argument
[all...]
H A Dregcomp.c317 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
319 Idx node = init_state->nodes.elems[node_cnt];
320 re_token_type_t type = dfa->nodes[node].type;
324 re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
334 *p++ = dfa->nodes[node].opr.c;
336 && dfa->nodes[node].type == CHARACTER
337 && dfa->nodes[node].mb_partial)
338 *p++ = dfa->nodes[node].opr.c;
354 bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
363 re_charset_t *cset = dfa->nodes[nod
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Dnvtype.c90 char *nodes; member in struct:Namtype
276 static Namval_t *findref(void *nodes, int n) argument
278 Namval_t *tp,*np = nv_namptr(nodes,n);
284 np = nv_namptr(nodes,i);
289 return(nv_namptr(pp->nodes,n-i-1));
297 Namval_t *nq = nv_namptr(dp->nodes,i);
306 nq->nvalue.nrp->np = findref(dp->nodes,i);
308 nq->nvalue.nrp->np = nv_namptr(pp->childfun.ttype->nodes,i);
319 Namval_t *np = nv_namptr(pp->nodes,i);
339 Namval_t *nr = nv_namptr( pp->childfun.ttype->nodes,
847 nv_mktype(Namval_t **nodes, int numnodes) argument
[all...]
H A Dname.c83 Namval_t **nodes; member in struct:sh_type
226 name = (sp->nodes[0])->nvname;
239 nv_delete(sp->nodes[0],root,NV_NOFREE);
241 errormsg(SH_DICT,ERROR_exit(1),e_redef,sp->nodes[0]->nvname);
246 if(np == sp->nodes[i])
251 sp->nodes[i-1] = sp->nodes[i];
262 sp->nodes = (Namval_t**)realloc(sp->nodes,sizeof(Namval_t*)*sp->maxnodes);
264 sp->nodes[s
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/
H A DParseUtils.pm383 # collapse whitespace in nodes
631 especially the nodes for hyperlinks.
696 It is intended to hold information about the hyperlink nodes of POD
720 $self->{-nodes} = [] unless(defined $self->{-nodes});
768 =item $cacheitem-E<gt>nodes()
770 Add a node (or a list of nodes) to the document's node list. Note that
772 If no argument is given, the current list of nodes is returned in the
773 same order the nodes have been added.
779 # The POD nodes
780 sub nodes { subroutine
[all...]
H A DChecker.pm324 While checking, this module collects document properties, e.g. the nodes
326 POD translators can use this feature to syntax-check and get the nodes in
569 $self->{_nodes} = []; # stack for =head/=item nodes
672 Add (if argument specified) and retrieve the nodes (as defined by C<=headX>
673 and C<=item>) of the current POD. The nodes are returned in the order of
761 my %nodes;
763 $nodes{$_} = 1;
767 $nodes{$1} ||= 2; # derived node
771 $nodes{$_} = 3; # index node
780 if($node && !$nodes{
[all...]
/osnet-11/usr/src/lib/libprtdiag/common/
H A Dprom.c105 pnode = find_pci_bus(bnode->nodes, 0x1F, 1);
H A Dcpu.c156 for (cpu = dev_find_type(board->nodes, "cpu"); cpu != NULL;
H A Dpdevinfo_funcs.c109 * Read all properties and values from nodes.
382 bnode->nodes = NULL;
658 if (bnode->nodes == NULL)
659 bnode->nodes = pnode;
661 p = bnode->nodes;
681 pnode = dev_find_node(board->nodes, name);
H A Dio.c376 for (fb = dev_find_node_by_type(board->nodes, "device_type", "display");
508 for (sbus = dev_find_node(board->nodes, SBUS_NAME); sbus != NULL;
511 /* Skip failed nodes for now */
799 for (pci = dev_find_node_by_type(board->nodes, "model", "SUNW,psycho");
805 * we are one level below the 'pci' nodes level
828 /* Skip all failed nodes for now */
872 * ebus nodes.
877 D_PRINTF("\nSkip ebus/class-other nodes [%s]",
/osnet-11/usr/src/grub/grub2/grub-core/disk/
H A Dlvm.c518 seg->nodes = grub_zalloc (sizeof (*stripe)
520 stripe = seg->nodes;
570 seg->nodes = grub_zalloc (sizeof (seg->nodes[0])
602 seg->nodes[j].name = lvname;
629 grub_free (seg->nodes);
672 lv1->segments[i].nodes[j].name))
674 lv1->segments[i].nodes[j].pv = pv;
678 if (lv1->segments[i].nodes[j].pv == NULL)
681 lv1->segments[i].nodes[
[all...]
/osnet-11/usr/src/grub/grub2/include/grub/
H A Dlvm.h66 struct grub_lvm_node *nodes; member in struct:grub_lvm_segment
/osnet-11/usr/src/tools/onbld/Scm/
H A DWorkSpace.py350 def colliding_tags(iterable, nodes, local):
352 if nd in nodes:
356 nodes = set(node.hex(ctx.node()) for ctx in self.revs)
360 tags.extend(colliding_tags(fh, nodes, True))
366 tags.extend(colliding_tags(data, nodes, False))
375 nodes = set(node.hex(ctx.node()) for ctx in self.revs)
376 return [t for t in data if t.split(' ', 1)[0] not in nodes]
552 nodes = set(outgoing)
553 ptips = map(lambda x: tipmost_shared(x, nodes), heads)
567 '''Return the base set of outgoing nodes
[all...]
/osnet-11/usr/src/lib/libprtdiag/inc/
H A Dpdevinfo.h135 Prom_node *nodes; member in struct:board_node
158 /* functions for searching for Prom nodes */
/osnet-11/usr/src/lib/fm/topo/modules/sun4v/sun4vpi/common/
H A Dpi_subr.c60 * Search the PRI for MDE nodes using md_scan_dag. Using this routine
64 * The routine returns the number of nodes found, or -1. If the node array
66 * topo_mod_free(mod, nodes, nsize);
71 char *type_str, char *arc_str, mde_cookie_t **nodes, size_t *nsize)
86 *nodes = topo_mod_zalloc(mod, *nsize);
87 if (*nodes == NULL) {
94 result = md_scan_dag(mdp, mde_start, start_cookie, arc_cookie, *nodes);
96 /* No nodes found. Free the node array before returning */
97 topo_mod_free(mod, *nodes, *nsize);
98 *nodes
70 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
262 mde_cookie_t *nodes = NULL; local
[all...]
/osnet-11/usr/src/lib/libprtdiag_psr/sparc/opl/common/
H A Dopl.c119 * its child and sibling nodes.
182 walk_tree_for_pci_devices(bnode->nodes,
313 for (pnode = board->nodes; pnode != NULL; pnode = pnode->sibling) {
344 * cmp->cpu->cpu->cpu->cpu->(next board nodes)
350 * cmp->cpu->cpu->cpu->cpu->cpu->cpu->cpu->cpu->(board nodes)
450 pnode = dev_find_node(bnode->nodes, "pseudo-mc");
866 if (bnode->nodes == NULL)
867 bnode->nodes = pnode;
869 p = bnode->nodes;
/osnet-11/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)
/osnet-11/usr/src/lib/libdtrace/common/
H A Ddt_xlator.c97 const char *name, dt_node_t *members, dt_node_t *nodes)
199 * create member nodes for every member of the output type. Otherwise
208 dxp->dx_nodes = nodes;
95 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
/osnet-11/usr/src/grub/grub2/grub-core/fs/
H A Dsfs.c110 grub_uint16_t nodes; member in struct:grub_sfs_btree
176 for (i = grub_be_to_cpu16 (tree->nodes) - 1; i >= 0; i--)

Completed in 74 milliseconds

12