#ifndef lint
    static	char *sccsid = "@(#)arcs.c	1.1 (Berkeley) 10/15/81";
#endif lint

#include "dprof.h"

topcmp( npp1 , npp2 )
    nltype	**npp1;
    nltype	**npp2;
{
    return (*npp1) -> toporder - (*npp2) -> toporder;
}

    /*
     *	sort by decreasing total time (time+childtime)
     *	if times are equal, but one is a cycle header,
     *	say that's first (e.g. less)
     */
int
totalcmp( npp1 , npp2 )
    nltype	**npp1;
    nltype	**npp2;
{
    register nltype	*np1 = *npp1;
    register nltype	*np2 = *npp2;
    double		diff;

    diff =    ( np1 -> time + np1 -> childtime )
	    - ( np2 -> time + np2 -> childtime );
    if ( diff < 0.0 )
	    return 1;
    if ( diff > 0.0 )
	    return -1;
    if ( np1 -> name == 0 && np1 -> cycleno != 0 ) 
	return -1;
    if ( np2 -> name == 0 && np1 -> cycleno != 0 )
	return 1;
    return 0;
}

doarcs()
{
    nltype	*parentp;
    arctype	*arcp;
    nltype	**topsortnlp;
    long	index;
    nltype	*childp;
    double	share;

	/*
	 *	initialize various things:
	 *	    zero out child times.
	 *	    count self-recursive calls.
	 *	    indicate that nothing is on cycles.
	 */
    for ( parentp = nl ; parentp < npe ; parentp++ ) {
	parentp -> childtime = 0.0;
	arcp = arclookup( parentp , parentp );
	if ( arcp != 0 ) {
	    parentp -> ncall -= arcp -> arc_count;
	    parentp -> selfcalls = arcp -> arc_count;
	} else {
	    parentp -> selfcalls = 0;
	}
	parentp -> toporder = 0;
	parentp -> cycleno = 0;
	parentp -> cyclehead = parentp;
	parentp -> cnext = 0;
    }
	/*
	 *	topologically order things
	 *	from each of the roots of the call graph
	 */
    for ( parentp = nl ; parentp < npe ; parentp++ ) {
	if ( parentp -> parents == 0 ) {
	    dfn( parentp );
	}
    }
	/*
	 *	link together nodes on the same cycle
	 */
    cyclelink();
	/*
	 *	Sort the symbol table in reverse topological order
	 */
    topsortnlp = (nltype **) calloc( nname , sizeof(nltype *) );
    if ( topsortnlp == (nltype **) 0 ) {
	fprintf( stderr , "[doarcs] ran out of memory for topo sorting\n" );
    }
    for ( index = 0 ; index < nname ; index += 1 ) {
	topsortnlp[ index ] = &nl[ index ];
    }
    qsort( topsortnlp , nname , sizeof(nltype *) , topcmp );
#   ifdef DEBUG
	if ( debug & DFNDEBUG ) {
	    printf( "[doarcs] topological sort listing\n" );
	    for ( index = 0 ; index < nname ; index += 1 ) {
		printf( "[doarcs] " );
		printf( "%d:" , topsortnlp[ index ] -> toporder );
		printname( topsortnlp[ index ] );
		printf( "\n" );
	    }
	}
#   endif DEBUG
	/*
	 *	starting from the topological bottom, 
	 *	propogate children times
	 */
    for ( index = 0 ; index < nname ; index += 1 ) {
	parentp = topsortnlp[ index ];
	for ( arcp = parentp->children ; arcp ; arcp = arcp->arc_childlist ) {
	    childp = arcp -> arc_childp;
#	    ifdef DEBUG
		if ( debug & ARCDEBUG ) {
			printf( "[doarcs] " );
			printname( parentp );
			printf( " calls " );
			printname( childp );
			printf( " %d (%d) times\n" ,
				arcp -> arc_count , childp -> ncall );
		}
#	    endif DEBUG
	    if ( arcp -> arc_count == 0 ) {
		continue;
	    }
	    if ( childp -> ncall == 0 ) {
		continue;
	    }
	    if ( childp == parentp ) {
		continue;
	    }
	    if ( childp -> cyclehead != childp ) {
		if ( parentp -> cycleno == childp -> cycleno ) {
		    continue;
		}
#		ifdef DEBUG
		    if ( debug & ARCDEBUG ) {
			printf( "[doarcs]\t it's a call into cycle %d\n" ,
				childp -> cycleno );
		    }
#		endif DEBUG
		if ( parentp -> toporder <= childp -> toporder ) {
		    fprintf( stderr , "[doarcs] toporder botches\n" );
		}
		childp = childp -> cyclehead;
	    } else {
		if ( parentp -> toporder <= childp -> toporder ) {
		    fprintf( stderr , "[doarcs] toporder botches\n" );
		    continue;
		}
	    }
		/*
		 *	distribute time for this arc
		 */
	    arcp -> arc_time = childp -> time *
				( ( (double) arcp -> arc_count ) /
				( (double) childp -> ncall ) );
	    arcp -> arc_childtime = childp -> childtime *
				( ( (double) arcp -> arc_count ) /
				( (double) childp -> ncall ) );
	    share = arcp -> arc_time + arcp -> arc_childtime;
#	    ifdef DEBUG
		if ( debug & ARCDEBUG ) {
		    printf( "[doarcs]\t " );
		    printname( childp );
		    printf( " time %8.2f + childtime %8.2f\n" ,
			childp -> time , childp -> childtime );
		    printf( "[doarcs]\t this is %d arcs of the %d calls\n",
			arcp -> arc_count , childp -> ncall );
		    printf( "[doarcs]\t so this gives %8.2f+%8.2f to %s\n" ,
			arcp -> arc_time , arcp -> arc_childtime ,
			parentp -> name );
		}
#	    endif DEBUG
	    parentp -> childtime += share;
		/*
		 *	add this share to the cycle header, if any
		 */
	    if ( parentp -> cyclehead != parentp ) {
#		ifdef DEBUG
		    if ( debug & ARCDEBUG ) {
			printf( "[doarcs]\t and to cycle %d\n" ,
				parentp -> cycleno );
		    }
#		endif DEBUG
		parentp -> cyclehead -> childtime += share;
	    }
	}
    }
    printdprof();
}

cyclelink()
{
    register nltype	*nlp;
    register nltype	*parentp;
    register nltype	*childp;
    register nltype	*cyclenlp;
    int			cycle;
    arctype		*arcp;
    long		ncall;
    double		time;
    long		callsamong;

	/*
	 *	Count the number of cycles, and initialze the cycle lists
	 */
    cyclemax = 0;
    for ( nlp = nl ; nlp < npe ; nlp++ ) {
	    /*
	     *	this is how you find unattached cycles
	     */
	if ( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) {
	    cyclemax += 1;
	}
    }
    if ( cyclemax > ncycles ) {
	fprintf( stderr , "prof: %d cycles in %d names exceeds %f%%\n" ,
		cyclemax , nname , CYCLEFRACTION * 100.0 );
	exit( 1 );
    }
	/*
	 *	now link cycles to true cycleheads,
	 *	number them, accumulate the data for the cycle
	 */
    cycle = 0;
    for ( nlp = nl ; nlp < npe ; nlp++ ) {
	if ( nlp -> cyclehead != nlp || nlp -> cnext == 0 ) {
	    continue;
	}
	cycle += 1;
	cyclenlp = &nl[nname+cycle];
	cyclenlp -> cycleno = cycle;
	cyclenlp -> cyclehead = cyclenlp;
	cyclenlp -> cnext = nlp;
#	ifdef DEBUG
	    if ( debug & CYCLEDEBUG ) {
		printf( "[cyclelink] " );
		printname( nlp );
		printf( " is the head of cycle %d\n" , cycle );
	    }
#	endif DEBUG
	    /*
	     *	n-squaredly (in the size of the cycle)
	     *	find all the call within the cycle 
	     *	(including self-recursive calls)
	     *	and remove them, thus making the cycle into
	     *	`node' with calls only from the outside.
	     *	note: that this doesn't deal with
	     *	self-recursive calls outside cycles (sigh).
	     */
	callsamong = 0;
	for ( parentp = nlp ; parentp ; parentp = parentp -> cnext ) {
	    parentp -> cycleno = cycle;
	    parentp -> cyclehead = cyclenlp;
	    for ( childp = nlp ; childp ; childp = childp -> cnext ) {
		if ( parentp == childp ) {
		    continue;
		}
		arcp = arclookup( parentp , childp );
		if ( arcp != 0 ) {
		    callsamong += arcp -> arc_count;
#		    ifdef DEBUG
			if ( debug & CYCLEDEBUG ) {
			    printf("[cyclelink] %s calls sibling %s %d times\n",
				parentp -> name , childp -> name ,
				arcp -> arc_count );
			}
#		    endif DEBUG
		}
	    }
	}
	    /*
	     *	collect calls and time around the cycle,
	     *	and save it in the cycle header.
	     */
	ncall = -callsamong;
	time = 0.0;
	for ( parentp = nlp ; parentp ; parentp = parentp -> cnext ) {
	    ncall += parentp -> ncall;
	    time += parentp -> time;
	}
#	ifdef DEBUG
	    if ( debug & CYCLEDEBUG ) {
		printf( "[cyclelink] cycle %d %f ticks in %d (%d) calls\n" ,
			cycle , time , ncall , callsamong );
	    }
#	endif DEBUG
	cyclenlp -> ncall = ncall;
	cyclenlp -> selfcalls = callsamong;
	cyclenlp -> time = time;
	cyclenlp -> childtime = 0.0;
    }
}