Searched refs:parents (Results 1 - 17 of 17) sorted by relevance

/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gprof/
H A Dsymtab.h97 struct arc *parents; /* List of caller arcs. */
96 struct arc *parents; /* List of caller arcs. */ member in struct:sym::__anon3327
H A Dcg_arcs.c147 /* prepend this parent to the parents of this child: */
148 arc->next_parent = child->cg.parents;
149 child->cg.parents = arc;
333 for (arc = member->cg.parents; arc; arc = arc->next_parent)
354 * Check if any parent of this child (or outside parents of this
357 * fractions from parents.
368 /* just a regular child, check its parents: */
371 for (arc = child->cg.parents; arc; arc = arc->next_parent)
394 * Its a member of a cycle, look at all parents from outside
401 for (arc = member->cg.parents; ar
[all...]
H A Dcg_print.c97 "", "", "", "", _("called"), _("total"), _("parents"));
313 /* Unlink parents from child, then insertion sort back on to
314 sorted's parents.
321 for (arc = child->cg.parents; arc; arc = detached)
337 child->cg.parents = sorted.next_parent;
353 if (!child->cg.parents)
364 for (arc = child->cg.parents; arc; arc = arc->next_parent)
714 the total arc count) for functions which have several parents.
892 arc = sym->cg.parents;
/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/lib/
H A Dregexec.c44 int *parents; local
83 parents = submatch_data[i].parents;
84 if (parents != NULL)
85 for (j = 0; parents[j] >= 0; j++)
87 DPRINT(("pmatch[%d] parent %d\n", i, parents[j]));
88 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so
89 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo)
H A Dtre-compile.c158 int *parents; /* Stack of submatches the current submatch is local
176 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1));
177 if (parents == NULL)
182 parents[0] = -1;
188 xfree(parents);
220 /* Pop this submatch from the parents stack. */
221 for (i = 0; parents[i] >= 0; i++);
222 parents[i - 1] = -1;
242 for (i = 0; parents[
[all...]
H A Dtre-internal.h222 int *parents; member in struct:tre_submatch_data
/netbsd-6-1-5-RELEASE/usr.bin/make/
H A Dsuff.c166 Lst parents; /* Suffixes we have a transformation to */ member in struct:_Suff
445 Lst_Destroy(s->parents, NULL);
726 SuffInsert(s->parents, t);
747 * If the node has no commands or children, the children and parents
777 * Store s->parents because s could be deleted in SuffRemove
779 p = s->parents;
792 * Remove the target from the source's parents list
849 SuffInsert(s->parents, s2);
876 SuffInsert(s2->parents, s);
937 SuffInsert(s->parents,
[all...]
H A Dmake.c95 * Make_Update Update all parents of a given child. Performs
211 * The mtime field of the node and the cmgn field of its parents
342 * If the target isn't out-of-date, the parents need to know its
345 * have their mtime stay below their children's mtime to keep parents from
349 Lst_ForEach(gn->parents, MakeTimeStamp, gn);
501 (void)Lst_AtEnd(gn->parents, pgn);
656 * Perform update on the parents of a node. Used by JobFinish once
674 * set the FORCE flag on the parents.
689 LstNode ln; /* Element in parents and iParents lists */
692 Lst parents;
688 Lst parents; local
[all...]
H A Dtarg.c256 gn->parents = Lst_Init(FALSE);
303 Lst_Destroy(gn->parents, NULL);
661 fprintf(debug_file, "# implicit parents: ");
669 if (!Lst_IsEmpty (gn->parents)) {
670 fprintf(debug_file, "# parents: ");
671 Lst_ForEach(gn->parents, TargPrintName, NULL);
H A Darch.c1119 if (Lst_Open(gn->parents) != SUCCESS) {
1123 while ((ln = Lst_Next(gn->parents)) != NULL) {
1131 * child. We keep searching its parents in case some other
1151 Lst_Close(gn->parents);
H A Dmake.h137 * 10) a list of nodes for which this is a source (parents)
141 * 13) a list of ancestor nodes, which includes parents, iParents,
142 * and recursive parents of parents
196 Lst iParents; /* Links to parents for which this is an
199 Lst parents; /* Nodes that depend on this one */ member in struct:GNode
239 #define OP_USE 0x00000010 /* Use associated commands for parents */
258 #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents.
259 * I.e. it doesn't show up in the parents's
H A Dparse.c825 * New elements are added to the parents list of cgn and the
840 (void)Lst_AtEnd(cgn->parents, pgn);
893 * and the new instance is linked to all parents of the initial
907 * other variables. True, parents of this target won't tend to do
1028 * from a special target or link it to its parents, as
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/binutils/
H A Dprdbg.c74 char *parents; member in struct:pr_stack
75 /* How many parents contains parents. */
394 /* Append a string to the parents on the top of the type stack. */
406 len = info->stack->parents ? strlen (info->stack->parents) : 0;
407 info->stack->parents = (char *) xrealloc (info->stack->parents,
409 strcpy (info->stack->parents + len, s);
2136 info->stack->parents
[all...]
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/cmd/zfs/
H A Dzfs_main.c487 boolean_t parents = B_FALSE; local
506 parents = B_TRUE;
538 if (parents && zfs_name_valid(argv[1], ZFS_TYPE_FILESYSTEM |
604 boolean_t parents = B_FALSE; local
638 parents = B_TRUE;
731 if (parents && zfs_name_valid(argv[0], type)) {
2143 boolean_t parents = B_FALSE; local
2149 parents = B_TRUE;
2181 if (recurse && parents) {
2193 if ((zhp = zfs_open(g_zfs, argv[0], parents
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/pcc/dist/pcc/mip/
H A Doptim2.c710 SLIST_INIT(&bb->parents);
815 SLIST_INSERT_LAST(&cnode->bblock->parents, pnode, cfgelem);
827 SLIST_INSERT_LAST(&cnode->bblock->parents, pnode, cfgelem);
835 SLIST_INSERT_LAST(&cnode->bblock->parents, pnode, cfgelem);
894 printf("Basic block %d, parents: ", bbb->dfnum);
895 SLIST_FOREACH(ccnode, &bbb->parents, cfgelem) {
908 SLIST_FOREACH(cnode, &bb->parents, cfgelem) {
1137 SLIST_FOREACH(cnode, &y->parents, cfgelem)
1282 SLIST_FOREACH(cfgn2, &(*cn)->bblock->parents, cfgelem) {
1336 SLIST_FOREACH(cfgn, &bb->parents, cfgele
[all...]
H A Dpass2.h464 SLIST_HEAD(, cfgnode) parents; /* CFG - parents to this node */ member in struct:basicblock
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dtommath.tex108 continue the project. Definitely my parents were there for me by providing room and board during the many months of work in 2003.

Completed in 239 milliseconds