Home
last modified time | relevance | path

Searched refs:parents (Results 1 – 25 of 33) sorted by relevance

12

/dragonfly/contrib/binutils-2.34/gprof/
H A Dbsd_callg_bl.m51 its parents.
54 all of its parents. This is the denominator of
57 parents the name of this parent, with an indication of the
91 * these fields are omitted for parents (or
98 ** static-only parents and children are indicated
H A Dcg_arcs.c148 arc->next_parent = child->cg.parents; in arc_add()
149 child->cg.parents = arc; in arc_add()
333 for (arc = member->cg.parents; arc; arc = arc->next_parent) in cycle_link()
371 for (arc = child->cg.parents; arc; arc = arc->next_parent) in inherit_flags()
401 for (arc = member->cg.parents; arc; arc = arc->next_parent) in inherit_flags()
H A Dfsf_callg_bl.m36 For the function's parents, the fields have the following meanings:
54 If the parents of the function cannot be determined, the word
78 cycle (as parents) and the members of the cycle (as children.)
H A Dsymtab.h96 struct arc *parents; /* List of caller arcs. */ member
H A Dcg_print.c323 for (arc = child->cg.parents; arc; arc = detached) in sort_parents()
339 child->cg.parents = sorted.next_parent; in sort_parents()
355 if (!child->cg.parents) in print_parents()
366 for (arc = child->cg.parents; arc; arc = arc->next_parent) in print_parents()
894 arc = sym->cg.parents; in cg_print_function_ordering()
/dragonfly/contrib/binutils-2.27/gprof/
H A Dbsd_callg_bl.m51 its parents.
54 all of its parents. This is the denominator of
57 parents the name of this parent, with an indication of the
91 * these fields are omitted for parents (or
98 ** static-only parents and children are indicated
H A Dcg_arcs.c148 arc->next_parent = child->cg.parents; in arc_add()
149 child->cg.parents = arc; in arc_add()
333 for (arc = member->cg.parents; arc; arc = arc->next_parent) in cycle_link()
371 for (arc = child->cg.parents; arc; arc = arc->next_parent) in inherit_flags()
401 for (arc = member->cg.parents; arc; arc = arc->next_parent) in inherit_flags()
H A Dfsf_callg_bl.m36 For the function's parents, the fields have the following meanings:
54 If the parents of the function cannot be determined, the word
78 cycle (as parents) and the members of the cycle (as children.)
H A Dsymtab.h96 struct arc *parents; /* List of caller arcs. */ member
H A Dcg_print.c323 for (arc = child->cg.parents; arc; arc = detached) in sort_parents()
339 child->cg.parents = sorted.next_parent; in sort_parents()
355 if (!child->cg.parents) in print_parents()
366 for (arc = child->cg.parents; arc; arc = arc->next_parent) in print_parents()
894 arc = sym->cg.parents; in cg_print_function_ordering()
H A Dgprof.texi162 parents is directly proportional to the number of times that
2149 children are always numbered less than their parents,
2152 order (children appear before parents).
2156 The first pass, from end to beginning (parents to children),
2163 A second pass, from beginning to end (children to parents) actually
2180 the functions with the most use and the most parents are
2203 Details sorting individual parents/children within each call graph entry
/dragonfly/contrib/bmake/
H A Dsuff.c185 SuffixList parents; member
397 Lst_Done(&suff->parents); in Suffix_Free()
471 Lst_Init(&suff->parents); in Suffix_New()
675 srcSuffParents = &srcSuff->parents; in Suff_EndTransform()
1268 Lst_Append(&gn->parents, pgn); in ExpandWildcards()
1282 Lst_Remove(&cgn->parents, Lst_FindDatum(&cgn->parents, pgn)); in ExpandWildcards()
1418 Lst_Append(&gn->parents, pgn); in ExpandChildren()
1436 Lst_Remove(&cgn->parents, Lst_FindDatum(&cgn->parents, pgn)); in ExpandChildren()
1513 Lst_Append(&sgn->parents, tgn); in ApplyTransform()
1630 Lst_Append(&mem->parents, gn); in FindDepsArchive()
[all …]
H A Dmake.c375 for (ln = gn->parents.first; ln != NULL; ln = ln->next) in GNode_IsOODate()
460 Lst_Append(&gn->parents, pgn); in Make_HandleUse()
678 GNodeList *parents; in Make_Update() local
703 if (!Lst_IsEmpty(&cgn->parents)) in Make_Update()
713 parents = &centurion->parents; in Make_Update()
719 for (ln = parents->first; ln != NULL; ln = ln->next) { in Make_Update()
1341 Lst_Append(&cn->parents, wn); in add_wait_dependency()
1371 Lst_Append(&cgn->parents, pgn); in Make_ProcessWait()
H A Dtarg.c190 Lst_Init(&gn->parents); in GNode_New()
229 Lst_Done(&gn->parents); in GNode_Free()
510 PrintNodeNamesLine("parents", &gn->parents); in Targ_PrintNode()
H A Dmake.h465 GNodeList parents; member
H A Darch.c977 for (ln = gn->parents.first; ln != NULL; ln = ln->next) { in Arch_UpdateMemberMTime()
/dragonfly/contrib/gcc-8.0/gcc/cp/
H A Dvtable-class-hierarchy.c421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
424 temp_node->parents[i]->num_processed_children + 1; in vtv_compute_class_hierarchy_transitive_closure()
425 if (!bitmap_bit_p (inserted, temp_node->parents[i]->class_uid)) in vtv_compute_class_hierarchy_transitive_closure()
426 add_to_worklist (&worklist, temp_node->parents[i], inserted); in vtv_compute_class_hierarchy_transitive_closure()
1075 (derived_node->parents).safe_push (base_node); in add_hierarchy_pair()
/dragonfly/contrib/binutils-2.34/binutils/
H A Dprdbg.c73 char *parents; member
404 len = info->stack->parents ? strlen (info->stack->parents) : 0; in append_parent()
405 info->stack->parents = (char *) xrealloc (info->stack->parents, in append_parent()
407 strcpy (info->stack->parents + len, s); in append_parent()
2143 info->stack->parents = NULL; in tg_start_class_type()
2445 fprintf (info->f, "\tinherits:%s", info->stack->parents); in tg_end_class_type()
2446 free (info->stack->parents); in tg_end_class_type()
2692 info->stack->parents = strdup (name); in tg_start_function()
2760 fprintf (info->f, "%s\t%s\t", info->stack->parents, info->filename); in tg_start_block()
2761 free (info->stack->parents); in tg_start_block()
/dragonfly/contrib/binutils-2.27/binutils/
H A Dprdbg.c73 char *parents; member
402 len = info->stack->parents ? strlen (info->stack->parents) : 0; in append_parent()
403 info->stack->parents = (char *) xrealloc (info->stack->parents, in append_parent()
405 strcpy (info->stack->parents + len, s); in append_parent()
2142 info->stack->parents = NULL; in tg_start_class_type()
2444 fprintf (info->f, "\tinherits:%s", info->stack->parents); in tg_end_class_type()
2445 free (info->stack->parents); in tg_end_class_type()
2691 info->stack->parents = strdup (name); in tg_start_function()
2759 fprintf (info->f, "%s\t%s\t", info->stack->parents, info->filename); in tg_start_block()
2760 free (info->stack->parents); in tg_start_block()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dvtable-verify.h86 vec<struct vtv_graph_node *> parents; /* Vector of parents in the graph. */ member
H A Dvtable-verify.c453 (node->class_info->parents).create (4); in find_or_create_vtbl_map_node()
/dragonfly/contrib/ldns/
H A Ddnssec_verify.c463 ldns_dnssec_trust_tree_free(tree->parents[i]); in ldns_dnssec_trust_tree_free()
477 parent = ldns_dnssec_trust_tree_depth(tree->parents[i]); in ldns_dnssec_trust_tree_depth()
565 if (ldns_rr_get_type(tree->parents[i]->rr) == in ldns_dnssec_trust_tree_print_sm_fmt()
567 ldns_rr_get_type(tree->parents[i]->rr) == in ldns_dnssec_trust_tree_print_sm_fmt()
614 tree->parents[i]->rr); in ldns_dnssec_trust_tree_print_sm_fmt()
617 tree->parents[i], in ldns_dnssec_trust_tree_print_sm_fmt()
672 tree->parents[tree->parent_count] = in ldns_dnssec_trust_tree_add_parent()
851 if (cur_parent_rr == new_tree->parents[i]->rr) { in ldns_dnssec_derive_trust_tree_normal_rrset_time()
1071 ldns_dnssec_trust_tree_contains_keys(tree->parents[i], in ldns_dnssec_trust_tree_contains_keys()
/dragonfly/games/quiz/datfiles/
H A Dmurders11 {Mr{.} }{{and }Mrs{.} }Borden|{her }parents:Lizzie{ Borden}
/dragonfly/contrib/ldns/ldns/
H A Ddnssec_verify.h127 ldns_dnssec_trust_tree *parents[LDNS_DNSSEC_TRUST_TREE_MAX_PARENTS]; member
/dragonfly/sbin/init/
H A DNOTES34 inherits children whose parents have terminated without

12