Home
last modified time | relevance | path

Searched refs:numpathsG (Results 1 – 11 of 11) sorted by relevance

/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twmc/
H A Dpaths.c239 fprintf( fp, "Number of active paths :%5d\n", numpathsG ) ; in print_paths()
300 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
365 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
410 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
474 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
505 path_set_arrayS=(PSETPTR *)Ysafe_malloc((numpathsG+1)*sizeof(PSETPTR)); in init_path_set()
506 for( i=0;i<=numpathsG;i++ ){ in init_path_set()
518 if( path >= 1 || path <= numpathsG ){ in add2path_set()
619 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) { in dcalc_full_penalty()
H A Dinitnets.c81 numpathsG = 0 ; in init_nets()
186 numpathsG++ ; /* increment number of active paths */
H A Dfindcost.c218 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) { in findcost()
H A Dcustom.h452 EXTERN INT numpathsG ; variable
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twsc/
H A Dpaths.c266 fprintf( fp, "Number of active paths :%5d\n", numpathsG ) ; in print_paths()
326 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
391 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
434 ASSERTNCONT( path_num > 0 && path_num <= numpathsG,
495 ASSERTNCONT( pathlist->path > 0 && pathlist->path <= numpathsG, in update_time2()
525 path_set_arrayS=(PSETPTR *)Ysafe_malloc((numpathsG+1)*sizeof(PSETPTR)); in init_path_set()
526 for( i=0;i<=numpathsG;i++ ){ in init_path_set()
538 if( path >= 1 && path <= numpathsG ){ in add2path_set()
640 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) {
H A Dreadnets.c294 numpathsG = 0 ;
419 numpathsG++ ; /* increment number of active paths */
H A Dstandard.h313 EXTERN INT numpathsG ; variable
H A Dfindcostf.c558 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) { in recompute_timecost()
H A Dglobe.c1580 if( numpathsG ){
1734 if( numpathsG ){ in cell_rotate()
H A Dfindcost.c660 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) { in findcost()
H A Dfindunlap.c269 for( pathcount = 1 ; pathcount <= numpathsG ; pathcount++ ) {