nltype
const nltype **npp1 = (const nltype **)v1;
const nltype **npp2 = (const nltype **)v2;
nltype **
nltype *parentp, **timesortnlp;
topsortnlp = (nltype **) calloc( nname , sizeof(nltype *) );
if ( topsortnlp == (nltype **) 0 )
qsort( topsortnlp , nname , sizeof(nltype *) , topcmp );
timesortnlp = (nltype **) calloc( nname + ncycle , sizeof(nltype *) );
if ( timesortnlp == (nltype **) 0 )
qsort( timesortnlp , nname + ncycle , sizeof(nltype *) , totalcmp );
timepropagate(nltype *parentp)
nltype *childp;
register nltype *nlp;
register nltype *cyclenlp;
nltype *memberp;
cyclenl = (nltype *) calloc( ncycle + 1 , sizeof( nltype ) );
( ncycle + 1 ) * sizeof( nltype ) );
nltype *nlp;
addarc(nltype *parentp, nltype *childp, long count)
descend(nltype *node, arctype **stkstart, arctype **stkp)
nltype *cyclenlp;
nltype *childp;
nltype *childp;
nltype *oldhead;
inheritflags(nltype *childp)
nltype *headp;
nltype *parentp;
nltype *memp;
nltype **topsortnlp;
dfn_pre_visit(nltype *parentp)
dfn_numbered(nltype *childp)
dfn_busy(nltype *childp)
dfn_findcycle(nltype *childp)
nltype *cycleheadp;
nltype *tailp;
dfn_self_cycle(nltype *parentp)
dfn_post_visit(nltype *parentp)
nltype *memberp;
nltype *nlentryp;
dfn(nltype *parentp)
if ((nl = (nltype *)calloc(nname + 1, sizeof(nltype))) == NULL)
qsort(nl, nname, sizeof(nltype), valcmp);
nltype *parentp;
nltype *childp;
register nltype *nlp;
const nltype *p1 = (const nltype *)v1;
const nltype *p2 = (const nltype *)v2;
nltype **timesortnlp;
EXTERN nltype *nl; /* the whole namelist */
EXTERN nltype *npe; /* the virtual end of the namelist */
EXTERN nltype *cyclenl; /* cycle header namelist */
void addarc(nltype *, nltype *, long);
arctype *arclookup(nltype *, nltype *);
bool descend(nltype *, arctype **, arctype **);
void dfn(nltype *);
bool dfn_busy(nltype *);
void dfn_findcycle(nltype *);
bool dfn_numbered(nltype *);
void dfn_post_visit(nltype *);
void dfn_pre_visit(nltype *);
void dfn_self_cycle(nltype *);
nltype **doarcs(void);
void flatprofline(nltype *);
void gprofline(register nltype *);
void inheritflags(nltype *);
int membercmp(nltype *, nltype *);
nltype *nllookup(unsigned long);
void printchildren(nltype *);
void printcycle(nltype *);
void printgprof(nltype **);
void printmembers(nltype *);
void printname(nltype *);
void printparents(nltype *);
void sortchildren(nltype *);
void sortmembers(nltype *);
void sortparents(nltype *);
void timepropagate(nltype *);
if ((nl = (nltype *)calloc(nname + 1, sizeof(nltype))) == NULL)
nltype *
arclookup(nltype *parentp, nltype *childp)
flatprofline(register nltype *np)
gprofline(register nltype *np)
printgprof(nltype **timesortnlp)
nltype *parentp;
const nltype **npp1 = (const nltype **)v1;
const nltype **npp2 = (const nltype **)v2;
register const nltype *np1 = *npp1;
register const nltype *np2 = *npp2;
printparents(nltype *childp)
nltype *parentp;
nltype *cycleheadp;
printchildren(nltype *parentp)
nltype *childp;
printname(nltype *selfp)
sortchildren(nltype *parentp)
sortparents(nltype *childp)
register nltype *np;
nltype **sortednlp;
printcycle(nltype *cyclep)
printmembers(nltype *cyclep)
nltype *memberp;
sortmembers(nltype *cyclep)
nltype *todo;
nltype *doing;
nltype *prev;
sortednlp = (nltype **) calloc( nname , sizeof(nltype *) );
if ( sortednlp == (nltype **) 0 )
membercmp(nltype *this, nltype *that)
nltype *thisparentp = thisp -> arc_parentp;
nltype *thischildp = thisp -> arc_childp;
nltype *thatparentp = thatp -> arc_parentp;
nltype *thatchildp = thatp -> arc_childp;
qsort( sortednlp , nname , sizeof(nltype *) , timecmp );
const nltype **npp1 = (const nltype **)v1;
const nltype **npp2 = (const nltype **)v2;
nltype **namesortnlp;
register nltype *nlp;
namesortnlp = (nltype **) calloc( nname + ncycle , sizeof(nltype *) );
if ( namesortnlp == (nltype **) 0 )
qsort( namesortnlp , nnames , sizeof(nltype *) , namecmp );
const nltype **npp1 = (const nltype **)v1;
const nltype **npp2 = (const nltype **)v2;