binutils/gprof/cg_print.c

218 /* Compare two arcs to/from the same child/parent.
231   Sym *left_parent = left->parent;
233   Sym *right_parent = right->parent;
352   Sym *parent;
374       parent = arc->parent;
375       if (child == parent || (child->cg.cyc.num != 0
376 			      && parent->cg.cyc.num == child->cg.cyc.num))
384 	  print_name (parent);
389 	  /* Regular parent of child.  */
396 	  print_name (parent);
404 sort_children (parent)
405      Sym *parent;
409   /* Unlink children from parent, then insertion sort back on to
417   for (arc = parent->cg.children; arc; arc = detached)
432   /* Reattach sorted children to parent.  */
433   parent->cg.children = sorted.next_child;
438 print_children (parent)
439      Sym *parent;
444   sort_children (parent);
445   arc = parent->cg.children;
447   for (arc = parent->cg.children; arc; arc = arc->next_child)
450       if (child == parent || (child->cg.cyc.num != 0
451 			      && child->cg.cyc.num == parent->cg.cyc.num))
463 	  /* Regular child of parent.  */
516   Sym *parent;
525       parent = timesortsym[index];
527       if ((ignore_zeros && parent->ncalls == 0
528 	   && parent->cg.self_calls == 0 && parent->cg.prop.self == 0
529 	   && parent->cg.prop.child == 0)
530 	  || !parent->cg.print_flag
531 	  || (line_granularity && ! parent->is_func))
534       if (!parent->name && parent->cg.cyc.num != 0)
537 	  print_cycle (parent);
538 	  print_members (parent);
542 	  print_parents (parent);
543 	  print_line (parent);
544 	  print_children (parent);
741 	are made to handle high usage arcs where the parent and/or
764 	to the same parent/child should be combined, then resort the
868       /* Count how many times each parent and child are used up
907 	  if (arc->parent != arc->child)
917 	  if (arc->parent != arc->child)
940 	  && arc->parent->has_been_placed)
947 	  arc->parent->has_been_placed = 0;
1038       Sym *child, *parent;
1047       parent = the_arcs[index]->parent;
1051 	 if both the parent and child of this arc have been placed.  */
1053 	  || child->has_been_placed || parent->has_been_placed)
1059       /* If all slots in the parent and child are full, then there isn't
1063       if (parent->next && parent->prev && child->next && child->prev)
1069       /* If the parent is unattached, then find the closest
1072       if (!parent->next && !parent->prev)
1099 	  Sym *prev = parent;
1100 	  Sym *next = parent;
1114 	  parent = prev_count < next_count ? prev : next;
1125       sym1 = parent;
1142 	  && sym2 == parent)
1149       if (parent->next)
1151 	  /* Must attach to the parent's prev field.  */
1154 	      /* parent-prev and child-next */
1155 	      parent->prev = child;
1156 	      child->next = parent;
1160       else if (parent->prev)
1162 	  /* Must attach to the parent's next field.  */
1165 	      /* parent-next and child-prev */
1166 	      parent->next = child;
1167 	      child->prev = parent;
1173 	  /* Can attach to either field in the parent, depends
1177 	      /* parent-prev and child-next.  */
1178 	      parent->prev = child;
1179 	      child->next = parent;
1184 	      /* parent-next and child-prev.  */
1185 	      parent->next = child;
1186 	      child->prev = parent;
1196       if (the_arcs[index]->parent->has_been_placed
1200       sym = the_arcs[index]->parent;
1229 	if (the_arcs[index]->parent->has_been_placed
1233 	sym = the_arcs[index]->parent;
1256       if (! arcs[index]->parent->mapped