Lines Matching refs:cyc
175 if (child->cg.cyc.head != child)
177 if (parent->cg.cyc.num == child->cg.cyc.num)
185 child = child->cg.cyc.head;
217 if (parent->cg.cyc.head != parent)
219 parent->cg.cyc.head->cg.child_time += share;
220 parent->cg.cyc.head->cg.prop.child += prop_share;
241 Sym *member, *cyc;
243 for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc)
245 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next)
255 cyc->hist.time += member->hist.time;
257 cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time;
265 Sym *sym, *cyc, *member;
276 if (sym->cg.cyc.head == sym && sym->cg.cyc.next)
293 cyc = cycle_header;
296 if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0))
301 ++cyc;
302 sym_init (cyc);
303 cyc->cg.print_flag = true; /* should this be printed? */
304 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */
305 cyc->cg.cyc.num = num; /* internal number of cycle on */
306 cyc->cg.cyc.head = cyc; /* pointer to head of cycle */
307 cyc->cg.cyc.next = sym; /* pointer to next member of cycle */
313 for (member = sym; member; member = member->cg.cyc.next)
315 member->cg.cyc.num = num;
316 member->cg.cyc.head = cyc;
323 for (member = sym; member; member = member->cg.cyc.next)
331 if (arc->parent->cg.cyc.num == num)
333 cyc->cg.self_calls += arc->count;
337 cyc->ncalls += arc->count;
357 head = child->cg.cyc.head;
391 for (member = head->cg.cyc.next; member; member = member->cg.cyc.next)
395 if (arc->parent->cg.cyc.head == head)
413 for (member = head; member; member = member->cg.cyc.next)
446 if (child->cg.cyc.head != old_head)
448 old_head = child->cg.cyc.head;
547 if (!left->name && left->cg.cyc.num != 0)
551 if (!right->name && right->cg.cyc.num != 0)
616 parent->cg.cyc
617 parent->cg.cyc.head = parent;
618 parent->cg.cyc.next = 0;