Lines Matching refs:child
125 100 * (cyc->cg.prop.self + cyc->cg.prop.child) / print_time,
126 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls);
137 CG.PROP.SELF+CG.PROP.CHILD, secondary key is NCALLS+CG.SELF_CALLS. */
142 double left_time = left->cg.prop.self + left->cg.prop.child;
143 double right_time = right->cg.prop.self + right->cg.prop.child;
203 "", "", member->cg.prop.self / hz, member->cg.prop.child / hz,
217 /* Compare two arcs to/from the same child/parent.
229 Sym *left_child = left->child;
231 Sym *right_child = right->child;
312 sort_parents (Sym * child)
316 /* Unlink parents from child, then insertion sort back on to
324 for (arc = child->cg.parents; arc; arc = detached)
339 /* Reattach sorted arcs to child. */
340 child->cg.parents = sorted.next_parent;
345 print_parents (Sym *child)
351 if (child->cg.cyc.head != 0)
352 cycle_head = child->cg.cyc.head;
354 cycle_head = child;
356 if (!child->cg.parents)
365 sort_parents (child);
367 for (arc = child->cg.parents; arc; arc = arc->next_parent)
370 if (child == parent || (child->cg.cyc.num != 0
371 && parent->cg.cyc.num == child->cg.cyc.num))
384 /* Regular parent of child. */
434 Sym *child;
442 child = arc->child;
443 if (child == parent || (child->cg.cyc.num != 0
444 && child->cg.cyc.num == parent->cg.cyc.num))
451 print_name (child);
456 /* Regular child of parent. */
462 arc->count, child->cg.cyc.head->ncalls);
463 print_name (child);
479 100 * (np->cg.prop.self + np->cg.prop.child) / print_time,
480 np->cg.prop.self / hz, np->cg.prop.child / hz);
520 && parent->cg.prop.child == 0)
727 child has already been placed.
749 to the same parent/child should be combined, then resort the
850 /* Count how many times each parent and child are used up
855 arcs[arc_index]->child->nuses++;
889 if (arc->parent != arc->child)
899 if (arc->parent != arc->child)
921 if (arc->child->has_been_placed
928 arc->child->has_been_placed = 0;
1020 Sym *child, *parent;
1028 child = the_arcs[arc_index]->child;
1033 if both the parent and child of this arc have been placed. */
1035 || child->has_been_placed || parent->has_been_placed)
1041 /* If all slots in the parent and child are full, then there isn't
1045 if (parent->next && parent->prev && child->next && child->prev)
1052 place to attach it onto child's chain. Similarly
1058 Sym *prev = child;
1059 Sym *next = child;
1061 /* Walk to the beginning and end of the child's chain. */
1075 child = next_count < prev_count ? next : prev;
1077 else if (! child->next && !child->prev)
1115 sym2 = child;
1123 if (sym1 == child
1134 if (! child->next)
1136 /* parent-prev and child-next */
1137 parent->prev = child;
1138 child->next = parent;
1145 if (! child->prev)
1147 /* parent-next and child-prev */
1148 parent->next = child;
1149 child->prev = parent;
1156 on where we've got space in the child. */
1157 if (child->prev)
1159 /* parent-prev and child-next. */
1160 parent->prev = child;
1161 child->next = parent;
1166 /* parent-next and child-prev. */
1167 parent->next = child;
1168 child->prev = parent;
1179 || the_arcs[arc_index]->child->has_been_placed)
1212 || the_arcs[arc_index]->child->has_been_placed)
1251 || ! arcs[arc_index]->child->mapped)
