dist/gprof/cg_arcs.c

184       if (child->cg.cyc.head != child)
186 	  if (parent->cg.cyc.num == child->cg.cyc.num)
194 	  child = child->cg.cyc.head;
226       if (parent->cg.cyc.head != parent)
228 	  parent->cg.cyc.head->cg.child_time += share;
229 	  parent->cg.cyc.head->cg.prop.child += prop_share;
250   Sym *member, *cyc;
252   for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc)
254       for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next)
264 	  cyc->hist.time += member->hist.time;
266       cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time;
274   Sym *sym, *cyc, *member;
284       if (sym->cg.cyc.head == sym && sym->cg.cyc.next)
301   cyc = cycle_header;
304       if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0))
309       ++cyc;
310       sym_init (cyc);
311       cyc->cg.print_flag = TRUE;	/* should this be printed? */
312       cyc->cg.top_order = DFN_NAN;	/* graph call chain top-sort order */
313       cyc->cg.cyc.num = num;	/* internal number of cycle on */
314       cyc->cg.cyc.head = cyc;	/* pointer to head of cycle */
315       cyc->cg.cyc.next = sym;	/* pointer to next member of cycle */
321       for (member = sym; member; member = member->cg.cyc.next)
323 	  member->cg.cyc.num = num;
324 	  member->cg.cyc.head = cyc;
331       for (member = sym; member; member = member->cg.cyc.next)
339 	      if (arc->parent->cg.cyc.num == num)
341 		  cyc->cg.self_calls += arc->count;
345 		  cyc->ncalls += arc->count;
365   head = child->cg.cyc.head;
399       for (member = head->cg.cyc.next; member; member = member->cg.cyc.next)
403 	      if (arc->parent->cg.cyc.head == head)
421       for (member = head; member; member = member->cg.cyc.next)
453       if (child->cg.cyc.head != old_head)
455 	  old_head = child->cg.cyc.head;
554   if (!left->name && left->cg.cyc.num != 0)
558   if (!right->name && right->cg.cyc.num != 0)
622       parent->cg.cyc.num = 0;
623       parent->cg.cyc.head = parent;
624       parent->cg.cyc.next = 0;