Lines Matching refs:cycle

161 	     *	link together nodes on the same cycle
174 printf("[doarcs] pass %ld, cycle(s) %d\n" , pass , ncycle );
181 "to reduce the maximum cycle size to", cyclethreshold );
236 * and cycle headers.
332 * add this share to the parent's cycle header, if any.
358 int cycle;
363 * Count the number of cycles, and initialize the cycle lists
375 * cyclenl is indexed by cycle number:
380 errx( 1 , "no room for %zu bytes of cycle headers" ,
384 * number them, accumulate the data for the cycle
386 cycle = 0;
391 cycle += 1;
392 cyclenlp = &cyclenl[cycle];
405 cyclenlp -> cycleno = cycle; /* internal number of cycle on */
406 cyclenlp -> cyclehead = cyclenlp; /* pointer to head of cycle */
407 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */
414 printf( " is the head of cycle %d\n" , cycle );
418 * link members to cycle header
421 memberp -> cycleno = cycle;
425 * count calls from outside the cycle
426 * and those among cycle members
433 if ( arcp -> arc_parentp -> cycleno == cycle ) {
462 * calculate the size of the cycle, and find nodes that
463 * exit the cycle as they are desirable targets to cut
483 errx( 1, "no room for %zu bytes of cycle stack" ,
487 printf( "[cycleanalyze] starting cycle %d of %d, size %d\n" ,
685 * first choice is edge leading to node with out-of-cycle parent
694 * other in-cycle parent
715 printf( "%s delete %s arc: %s (%ld) -> %s from %u cycle(s)\n" ,
751 printf( "%s <cycle %d>\n" , (*arcpp) -> arc_parentp -> name ,
762 int cycle;
766 for ( cycle = 1 ; cycle <= ncycle ; cycle += 1 ) {
767 cyclenlp = &cyclenl[ cycle ];
800 * if we haven't done this function or cycle,
803 * since we do all members of a cycle (and the cycle itself)
804 * as we hit the first member of the cycle.
879 * (or outside parents of this cycle)
881 * print flag of the child (cycle) appropriately.
921 * its a member of a cycle, look at all parents from
922 * outside the cycle
934 * if the cycle was never actually called