2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static char sccsid[] = "@(#)arcs.c 8.1 (Berkeley) 6/6/93";
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
50 * add (or just increment) an arc
53 addarc( parentp , childp , count )
61 if ( debug & TALLYDEBUG ) {
62 printf( "[addarc] %ld arcs from %s to %s\n" ,
63 count , parentp -> name , childp -> name );
66 arcp = arclookup( parentp , childp );
69 * a hit: just increment the count.
72 if ( debug & TALLYDEBUG ) {
73 printf( "[tally] hit %ld += %ld\n" ,
74 arcp -> arc_count , count );
77 arcp -> arc_count += count;
80 arcp = (arctype *)calloc( 1 , sizeof *arcp );
82 errx( 1 , "malloc failed" );
83 arcp -> arc_parentp = parentp;
84 arcp -> arc_childp = childp;
85 arcp -> arc_count = count;
87 * prepend this child to the children of this parent
89 arcp -> arc_childlist = parentp -> children;
90 parentp -> children = arcp;
92 * prepend this parent to the parents of this child
94 arcp -> arc_parentlist = childp -> parents;
95 childp -> parents = arcp;
99 * the code below topologically sorts the graph (collapsing cycles),
100 * and propagates time bottom up and flags top down.
104 * the topologically sorted name list pointers
109 topcmp( npp1 , npp2 )
113 return (*npp1) -> toporder - (*npp2) -> toporder;
119 nltype *parentp, **timesortnlp;
125 * initialize various things:
126 * zero out child times.
127 * count self-recursive calls.
128 * indicate that nothing is on cycles.
130 for ( parentp = nl ; parentp < npe ; parentp++ ) {
131 parentp -> childtime = 0.0;
132 arcp = arclookup( parentp , parentp );
134 parentp -> ncall -= arcp -> arc_count;
135 parentp -> selfcalls = arcp -> arc_count;
137 parentp -> selfcalls = 0;
139 parentp -> npropcall = parentp -> ncall;
140 parentp -> propfraction = 0.0;
141 parentp -> propself = 0.0;
142 parentp -> propchild = 0.0;
143 parentp -> printflag = FALSE;
144 parentp -> toporder = DFN_NAN;
145 parentp -> cycleno = 0;
146 parentp -> cyclehead = parentp;
147 parentp -> cnext = 0;
149 for ( pass = 1 ; ; pass++ ) {
151 * topologically order things
152 * if any node is unnumbered,
153 * number it and any of its descendents.
155 for ( dfn_init() , parentp = nl ; parentp < npe ; parentp++ ) {
156 if ( parentp -> toporder == DFN_NAN ) {
161 * link together nodes on the same cycle
165 * if no cycles to break up, proceed
170 * analyze cycles to determine breakup
173 if ( debug & BREAKCYCLE ) {
174 printf("[doarcs] pass %ld, cycle(s) %d\n" , pass , ncycle );
178 printf( "\n\n%s %s\n%s %d:\n" ,
179 "The following arcs were deleted" ,
180 "from the propagation calculation" ,
181 "to reduce the maximum cycle size to", cyclethreshold );
183 if ( cycleanalyze() )
187 for ( parentp = nl ; parentp < npe ; parentp++ ) {
188 parentp -> toporder = DFN_NAN;
189 parentp -> cycleno = 0;
190 parentp -> cyclehead = parentp;
191 parentp -> cnext = 0;
197 printf( "\tNone\n\n" );
200 * Sort the symbol table in reverse topological order
202 topsortnlp = (nltype **) calloc( nname , sizeof(nltype *) );
203 if ( topsortnlp == (nltype **) 0 )
204 errx( 1 , "[doarcs] ran out of memory for topo sorting" );
205 for ( index = 0 ; index < nname ; index += 1 ) {
206 topsortnlp[ index ] = &nl[ index ];
208 qsort( topsortnlp , nname , sizeof(nltype *) , topcmp );
210 if ( debug & DFNDEBUG ) {
211 printf( "[doarcs] topological sort listing\n" );
212 for ( index = 0 ; index < nname ; index += 1 ) {
213 printf( "[doarcs] " );
214 printf( "%d:" , topsortnlp[ index ] -> toporder );
215 printname( topsortnlp[ index ] );
221 * starting from the topological top,
222 * propagate print flags to children.
223 * also, calculate propagation fractions.
224 * this happens before time propagation
225 * since time propagation uses the fractions.
229 * starting from the topological bottom,
230 * propagate children times up to parents.
234 * Now, sort by propself + propchild.
235 * sorting both the regular function names
238 timesortnlp = (nltype **) calloc( nname + ncycle , sizeof(nltype *) );
239 if ( timesortnlp == (nltype **) 0 )
240 errx( 1 , "ran out of memory for sorting" );
241 for ( index = 0 ; index < nname ; index++ ) {
242 timesortnlp[index] = &nl[index];
244 for ( index = 1 ; index <= ncycle ; index++ ) {
245 timesortnlp[nname+index-1] = &cyclenl[index];
247 qsort( timesortnlp , nname + ncycle , sizeof(nltype *) , totalcmp );
248 for ( index = 0 ; index < nname + ncycle ; index++ ) {
249 timesortnlp[ index ] -> index = index + 1;
251 return( timesortnlp );
260 for ( index = 0 ; index < nname ; index += 1 ) {
261 timepropagate( topsortnlp[ index ] );
266 timepropagate( parentp )
274 if ( parentp -> propfraction == 0.0 ) {
278 * gather time from children of this parent.
280 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
281 childp = arcp -> arc_childp;
282 if ( arcp -> arc_flags & DEADARC ) {
285 if ( arcp -> arc_count == 0 ) {
288 if ( childp == parentp ) {
291 if ( childp -> propfraction == 0.0 ) {
294 if ( childp -> cyclehead != childp ) {
295 if ( parentp -> cycleno == childp -> cycleno ) {
298 if ( parentp -> toporder <= childp -> toporder ) {
299 fprintf( stderr , "[propagate] toporder botches\n" );
301 childp = childp -> cyclehead;
303 if ( parentp -> toporder <= childp -> toporder ) {
304 fprintf( stderr , "[propagate] toporder botches\n" );
308 if ( childp -> npropcall == 0 ) {
312 * distribute time for this arc
314 arcp -> arc_time = childp -> time
315 * ( ( (double) arcp -> arc_count ) /
316 ( (double) childp -> npropcall ) );
317 arcp -> arc_childtime = childp -> childtime
318 * ( ( (double) arcp -> arc_count ) /
319 ( (double) childp -> npropcall ) );
320 share = arcp -> arc_time + arcp -> arc_childtime;
321 parentp -> childtime += share;
323 * ( 1 - propfraction ) gets lost along the way
325 propshare = parentp -> propfraction * share;
327 * fix things for printing
329 parentp -> propchild += propshare;
330 arcp -> arc_time *= parentp -> propfraction;
331 arcp -> arc_childtime *= parentp -> propfraction;
333 * add this share to the parent's cycle header, if any.
335 if ( parentp -> cyclehead != parentp ) {
336 parentp -> cyclehead -> childtime += share;
337 parentp -> cyclehead -> propchild += propshare;
340 if ( debug & PROPDEBUG ) {
341 printf( "[dotime] child \t" );
343 printf( " with %f %f %ld/%ld\n" ,
344 childp -> time , childp -> childtime ,
345 arcp -> arc_count , childp -> npropcall );
346 printf( "[dotime] parent\t" );
347 printname( parentp );
348 printf( "\n[dotime] share %f\n" , share );
357 register nltype *nlp;
358 register nltype *cyclenlp;
364 * Count the number of cycles, and initialize the cycle lists
367 for ( nlp = nl ; nlp < npe ; nlp++ ) {
369 * this is how you find unattached cycles
371 if ( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) {
376 * cyclenl is indexed by cycle number:
377 * i.e. it is origin 1, not origin 0.
379 cyclenl = (nltype *) calloc( ncycle + 1 , sizeof( nltype ) );
381 errx( 1 , "no room for %zu bytes of cycle headers" ,
382 ( ncycle + 1 ) * sizeof( nltype ) );
384 * now link cycles to true cycleheads,
385 * number them, accumulate the data for the cycle
388 for ( nlp = nl ; nlp < npe ; nlp++ ) {
389 if ( !( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) ) {
393 cyclenlp = &cyclenl[cycle];
394 cyclenlp -> name = 0; /* the name */
395 cyclenlp -> value = 0; /* the pc entry point */
396 cyclenlp -> time = 0.0; /* ticks in this routine */
397 cyclenlp -> childtime = 0.0; /* cumulative ticks in children */
398 cyclenlp -> ncall = 0; /* how many times called */
399 cyclenlp -> selfcalls = 0; /* how many calls to self */
400 cyclenlp -> propfraction = 0.0; /* what % of time propagates */
401 cyclenlp -> propself = 0.0; /* how much self time propagates */
402 cyclenlp -> propchild = 0.0; /* how much child time propagates */
403 cyclenlp -> printflag = TRUE; /* should this be printed? */
404 cyclenlp -> index = 0; /* index in the graph list */
405 cyclenlp -> toporder = DFN_NAN; /* graph call chain top-sort order */
406 cyclenlp -> cycleno = cycle; /* internal number of cycle on */
407 cyclenlp -> cyclehead = cyclenlp; /* pointer to head of cycle */
408 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */
409 cyclenlp -> parents = 0; /* list of caller arcs */
410 cyclenlp -> children = 0; /* list of callee arcs */
412 if ( debug & CYCLEDEBUG ) {
413 printf( "[cyclelink] " );
415 printf( " is the head of cycle %d\n" , cycle );
419 * link members to cycle header
421 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) {
422 memberp -> cycleno = cycle;
423 memberp -> cyclehead = cyclenlp;
426 * count calls from outside the cycle
427 * and those among cycle members
429 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) {
430 for ( arcp=memberp->parents ; arcp ; arcp=arcp->arc_parentlist ) {
431 if ( arcp -> arc_parentp == memberp ) {
434 if ( arcp -> arc_parentp -> cycleno == cycle ) {
435 cyclenlp -> selfcalls += arcp -> arc_count;
437 cyclenlp -> npropcall += arcp -> arc_count;
445 * analyze cycles to determine breakup
450 arctype **cyclestack;
463 * calculate the size of the cycle, and find nodes that
464 * exit the cycle as they are desirable targets to cut
465 * some of their parents
467 for ( done = TRUE , cycleno = 1 ; cycleno <= ncycle ; cycleno++ ) {
469 for (nlp = cyclenl[ cycleno ] . cnext; nlp; nlp = nlp -> cnext) {
471 nlp -> parentcnt = 0;
472 nlp -> flags &= ~HASCYCLEXIT;
473 for ( arcp = nlp -> parents; arcp; arcp = arcp -> arc_parentlist ) {
474 nlp -> parentcnt += 1;
475 if ( arcp -> arc_parentp -> cycleno != cycleno )
476 nlp -> flags |= HASCYCLEXIT;
479 if ( size <= cyclethreshold )
482 cyclestack = (arctype **) calloc( size + 1 , sizeof( arctype *) );
483 if ( cyclestack == 0 )
484 errx( 1, "no room for %zu bytes of cycle stack" ,
485 ( size + 1 ) * sizeof( arctype * ) );
487 if ( debug & BREAKCYCLE ) {
488 printf( "[cycleanalyze] starting cycle %d of %d, size %d\n" ,
489 cycleno , ncycle , size );
492 for ( nlp = cyclenl[ cycleno ] . cnext ; nlp ; nlp = nlp -> cnext ) {
493 stkp = &cyclestack[0];
494 nlp -> flags |= CYCLEHEAD;
495 ret = descend ( nlp , cyclestack , stkp );
496 nlp -> flags &= ~CYCLEHEAD;
501 if ( cyclecnt > 0 ) {
503 for ( clp = cyclehead ; clp ; ) {
504 endlist = &clp -> list[ clp -> size ];
505 for ( arcpp = clp -> list ; arcpp < endlist ; arcpp++ )
506 (*arcpp) -> arc_cyclecnt--;
515 if ( debug & BREAKCYCLE ) {
516 printf("%s visited %d, viable %d, newcycle %d, oldcycle %d\n",
517 "[doarcs]" , visited , viable , newcycle , oldcycle);
524 descend( node , stkstart , stkp )
532 for ( arcp = node -> children ; arcp ; arcp = arcp -> arc_childlist ) {
536 if ( arcp -> arc_childp -> cycleno != node -> cycleno
537 || ( arcp -> arc_childp -> flags & VISITED )
538 || ( arcp -> arc_flags & DEADARC ) )
544 if ( arcp -> arc_childp -> flags & CYCLEHEAD ) {
545 if ( addcycle( stkstart , stkp ) == FALSE )
549 arcp -> arc_childp -> flags |= VISITED;
550 ret = descend( arcp -> arc_childp , stkstart , stkp + 1 );
551 arcp -> arc_childp -> flags &= ~VISITED;
559 addcycle( stkstart , stkend )
572 size = stkend - stkstart + 1;
575 for ( arcpp = stkstart , minarc = *arcpp ; arcpp <= stkend ; arcpp++ ) {
576 if ( *arcpp > minarc )
581 for ( clp = cyclehead ; clp ; clp = clp -> next ) {
582 if ( clp -> size != size )
585 endlist = &clp -> list[ size ];
586 for ( arcpp = clp -> list ; arcpp < endlist ; arcpp++ ) {
587 if ( *stkp++ != *arcpp )
592 if ( arcpp == endlist ) {
600 calloc( 1 , sizeof ( cltype ) + ( size - 1 ) * sizeof( arctype * ) );
602 warnx( "no room for %zu bytes of subcycle storage" ,
603 sizeof ( cltype ) + ( size - 1 ) * sizeof( arctype * ) );
607 endlist = &clp -> list[ size ];
608 for ( arcpp = clp -> list ; arcpp < endlist ; arcpp++ ) {
609 arcp = *arcpp = *stkp++;
612 arcp -> arc_cyclecnt++;
613 if ( ( arcp -> arc_flags & ONLIST ) == 0 ) {
614 arcp -> arc_flags |= ONLIST;
615 arcp -> arc_next = archead;
620 clp -> next = cyclehead;
624 if ( debug & SUBCYCLELIST ) {
625 printsubcycle( clp );
629 if ( cyclecnt >= CYCLEMAX )
643 arctype *maxexitarcp;
644 arctype *maxwithparentarcp;
645 arctype *maxnoparentarcp;
647 int maxwithparentcnt;
654 maxwithparentcnt = 0;
656 for ( endlist = &archead , arcp = archead ; arcp ; ) {
657 if ( arcp -> arc_cyclecnt == 0 ) {
658 arcp -> arc_flags &= ~ONLIST;
659 *endlist = arcp -> arc_next;
660 arcp -> arc_next = 0;
664 if ( arcp -> arc_childp -> flags & HASCYCLEXIT ) {
665 if ( arcp -> arc_cyclecnt > maxexitcnt ||
666 ( arcp -> arc_cyclecnt == maxexitcnt &&
667 arcp -> arc_cyclecnt < maxexitarcp -> arc_count ) ) {
668 maxexitcnt = arcp -> arc_cyclecnt;
671 } else if ( arcp -> arc_childp -> parentcnt > 1 ) {
672 if ( arcp -> arc_cyclecnt > maxwithparentcnt ||
673 ( arcp -> arc_cyclecnt == maxwithparentcnt &&
674 arcp -> arc_cyclecnt < maxwithparentarcp -> arc_count ) ) {
675 maxwithparentcnt = arcp -> arc_cyclecnt;
676 maxwithparentarcp = arcp;
679 if ( arcp -> arc_cyclecnt > maxnoparentcnt ||
680 ( arcp -> arc_cyclecnt == maxnoparentcnt &&
681 arcp -> arc_cyclecnt < maxnoparentarcp -> arc_count ) ) {
682 maxnoparentcnt = arcp -> arc_cyclecnt;
683 maxnoparentarcp = arcp;
686 endlist = &arcp -> arc_next;
687 arcp = arcp -> arc_next;
689 if ( maxexitcnt > 0 ) {
691 * first choice is edge leading to node with out-of-cycle parent
693 maxarcp = maxexitarcp;
697 } else if ( maxwithparentcnt > 0 ) {
699 * second choice is edge leading to node with at least one
700 * other in-cycle parent
702 maxarcp = maxwithparentarcp;
708 * last choice is edge leading to node with only this arc as
709 * a parent (as it will now be orphaned)
711 maxarcp = maxnoparentarcp;
716 maxarcp -> arc_flags |= DEADARC;
717 maxarcp -> arc_childp -> parentcnt -= 1;
718 maxarcp -> arc_childp -> npropcall -= maxarcp -> arc_count;
720 if ( debug & BREAKCYCLE ) {
721 printf( "%s delete %s arc: %s (%ld) -> %s from %u cycle(s)\n" ,
722 "[compresslist]" , type , maxarcp -> arc_parentp -> name ,
723 maxarcp -> arc_count , maxarcp -> arc_childp -> name ,
724 maxarcp -> arc_cyclecnt );
727 printf( "\t%s to %s with %ld calls\n" , maxarcp -> arc_parentp -> name ,
728 maxarcp -> arc_childp -> name , maxarcp -> arc_count );
730 for ( clp = cyclehead ; clp ; ) {
731 endlist = &clp -> list[ clp -> size ];
732 for ( arcpp = clp -> list ; arcpp < endlist ; arcpp++ )
733 if ( (*arcpp) -> arc_flags & DEADARC )
735 if ( arcpp == endlist ) {
740 for ( arcpp = clp -> list ; arcpp < endlist ; arcpp++ )
741 (*arcpp) -> arc_cyclecnt--;
758 printf( "%s <cycle %d>\n" , (*arcpp) -> arc_parentp -> name ,
759 (*arcpp) -> arc_parentp -> cycleno ) ;
760 for ( endlist = &clp -> list[ clp -> size ]; arcpp < endlist ; arcpp++ )
761 printf( "\t(%ld) -> %s\n" , (*arcpp) -> arc_count ,
762 (*arcpp) -> arc_childp -> name ) ;
773 for ( cycle = 1 ; cycle <= ncycle ; cycle += 1 ) {
774 cyclenlp = &cyclenl[ cycle ];
775 for ( childp = cyclenlp -> cnext ; childp ; childp = childp -> cnext ) {
776 if ( childp -> propfraction == 0.0 ) {
778 * all members have the same propfraction except those
779 * that were excluded with -E
783 cyclenlp -> time += childp -> time;
785 cyclenlp -> propself = cyclenlp -> propfraction * cyclenlp -> time;
790 * in one top to bottom pass over the topologically sorted namelist
792 * printflag as the union of parents' printflags
793 * propfraction as the sum of fractional parents' propfractions
794 * and while we're here, sum time for functions.
804 for ( index = nname-1 ; index >= 0 ; index -= 1 ) {
805 childp = topsortnlp[ index ];
807 * if we haven't done this function or cycle,
808 * inherit things from parent.
809 * this way, we are linear in the number of arcs
810 * since we do all members of a cycle (and the cycle itself)
811 * as we hit the first member of the cycle.
813 if ( childp -> cyclehead != oldhead ) {
814 oldhead = childp -> cyclehead;
815 inheritflags( childp );
818 if ( debug & PROPDEBUG ) {
819 printf( "[doflags] " );
821 printf( " inherits printflag %d and propfraction %f\n" ,
822 childp -> printflag , childp -> propfraction );
825 if ( ! childp -> printflag ) {
828 * it gets turned on by
830 * or there not being any -f list and not being on -e list.
832 if ( onlist( flist , childp -> name )
833 || ( !fflag && !onlist( elist , childp -> name ) ) ) {
834 childp -> printflag = TRUE;
838 * this function has printing parents:
839 * maybe someone wants to shut it up
840 * by putting it on -e list. (but favor -f over -e)
842 if ( ( !onlist( flist , childp -> name ) )
843 && onlist( elist , childp -> name ) ) {
844 childp -> printflag = FALSE;
847 if ( childp -> propfraction == 0.0 ) {
849 * no parents to pass time to.
850 * collect time from children if
852 * or there isn't any -F list and its not on -E list.
854 if ( onlist( Flist , childp -> name )
855 || ( !Fflag && !onlist( Elist , childp -> name ) ) ) {
856 childp -> propfraction = 1.0;
860 * it has parents to pass time to,
861 * but maybe someone wants to shut it up
862 * by putting it on -E list. (but favor -F over -E)
864 if ( !onlist( Flist , childp -> name )
865 && onlist( Elist , childp -> name ) ) {
866 childp -> propfraction = 0.0;
869 childp -> propself = childp -> time * childp -> propfraction;
870 printtime += childp -> propself;
872 if ( debug & PROPDEBUG ) {
873 printf( "[doflags] " );
875 printf( " ends up with printflag %d and propfraction %f\n" ,
876 childp -> printflag , childp -> propfraction );
877 printf( "time %f propself %f printtime %f\n" ,
878 childp -> time , childp -> propself , printtime );
885 * check if any parent of this child
886 * (or outside parents of this cycle)
887 * have their print flags on and set the
888 * print flag of the child (cycle) appropriately.
889 * similarly, deal with propagation fractions from parents.
892 inheritflags( childp )
900 headp = childp -> cyclehead;
901 if ( childp == headp ) {
903 * just a regular child, check its parents
905 childp -> printflag = FALSE;
906 childp -> propfraction = 0.0;
907 for (arcp = childp -> parents ; arcp ; arcp = arcp -> arc_parentlist) {
908 parentp = arcp -> arc_parentp;
909 if ( childp == parentp ) {
912 childp -> printflag |= parentp -> printflag;
914 * if the child was never actually called
915 * (e.g. this arc is static (and all others are, too))
916 * no time propagates along this arc.
918 if ( arcp -> arc_flags & DEADARC ) {
921 if ( childp -> npropcall ) {
922 childp -> propfraction += parentp -> propfraction
923 * ( ( (double) arcp -> arc_count )
924 / ( (double) childp -> npropcall ) );
929 * its a member of a cycle, look at all parents from
932 headp -> printflag = FALSE;
933 headp -> propfraction = 0.0;
934 for ( memp = headp -> cnext ; memp ; memp = memp -> cnext ) {
935 for (arcp = memp->parents ; arcp ; arcp = arcp->arc_parentlist) {
936 if ( arcp -> arc_parentp -> cyclehead == headp ) {
939 parentp = arcp -> arc_parentp;
940 headp -> printflag |= parentp -> printflag;
942 * if the cycle was never actually called
943 * (e.g. this arc is static (and all others are, too))
944 * no time propagates along this arc.
946 if ( arcp -> arc_flags & DEADARC ) {
949 if ( headp -> npropcall ) {
950 headp -> propfraction += parentp -> propfraction
951 * ( ( (double) arcp -> arc_count )
952 / ( (double) headp -> npropcall ) );
956 for ( memp = headp ; memp ; memp = memp -> cnext ) {
957 memp -> printflag = headp -> printflag;
958 memp -> propfraction = headp -> propfraction;