Lines Matching defs:cycle

155 	     *	link together nodes on the same cycle
168 printf("[doarcs] pass %ld, cycle(s) %d\n" , pass , ncycle );
175 "to reduce the maximum cycle size to", cyclethreshold );
230 * and cycle headers.
326 * add this share to the parent's cycle header, if any.
352 int cycle;
357 * Count the number of cycles, and initialize the cycle lists
369 * cyclenl is indexed by cycle number:
374 errx( 1 , "no room for %zu bytes of cycle headers" ,
378 * number them, accumulate the data for the cycle
380 cycle = 0;
385 cycle += 1;
386 cyclenlp = &cyclenl[cycle];
399 cyclenlp -> cycleno = cycle; /* internal number of cycle on */
400 cyclenlp -> cyclehead = cyclenlp; /* pointer to head of cycle */
401 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */
408 printf( " is the head of cycle %d\n" , cycle );
412 * link members to cycle header
415 memberp -> cycleno = cycle;
419 * count calls from outside the cycle
420 * and those among cycle members
427 if ( arcp -> arc_parentp -> cycleno == cycle ) {
456 * calculate the size of the cycle, and find nodes that
457 * exit the cycle as they are desirable targets to cut
477 errx( 1, "no room for %zu bytes of cycle stack" ,
481 printf( "[cycleanalyze] starting cycle %d of %d, size %d\n" ,
679 * first choice is edge leading to node with out-of-cycle parent
688 * other in-cycle parent
709 printf( "%s delete %s arc: %s (%ld) -> %s from %u cycle(s)\n" ,
745 printf( "%s <cycle %d>\n" , (*arcpp) -> arc_parentp -> name ,
756 int cycle;
760 for ( cycle = 1 ; cycle <= ncycle ; cycle += 1 ) {
761 cyclenlp = &cyclenl[ cycle ];
794 * if we haven't done this function or cycle,
797 * since we do all members of a cycle (and the cycle itself)
798 * as we hit the first member of the cycle.
873 * (or outside parents of this cycle)
875 * print flag of the child (cycle) appropriately.
915 * its a member of a cycle, look at all parents from
916 * outside the cycle
928 * if the cycle was never actually called