Searched refs:toporder (Results 1 - 4 of 4) sorted by relevance

/freebsd-10.1-release/usr.bin/gprof/
H A Ddfn.c120 parentp -> toporder = DFN_BUSY;
137 return ( childp -> toporder != DFN_NAN && childp -> toporder != DFN_BUSY );
147 if ( childp -> toporder == DFN_NAN ) {
304 memberp -> toporder = dfn_counter;
309 printf( " -> toporder = %d\n" , dfn_counter );
H A Darcs.c113 return (*npp1) -> toporder - (*npp2) -> toporder;
144 parentp -> toporder = DFN_NAN;
156 if ( parentp -> toporder == DFN_NAN ) {
188 parentp -> toporder = DFN_NAN;
214 printf( "%d:" , topsortnlp[ index ] -> toporder );
297 if ( parentp -> toporder <= childp -> toporder ) {
298 fprintf( stderr , "[propagate] toporder botches\n" );
302 if ( parentp -> toporder <
[all...]
H A Dgprof.h137 int toporder; /* graph call chain top-sort order */ member in struct:nl
H A Dprintgprof.c387 printf( "{%d} " , selfp -> toporder );

Completed in 50 milliseconds