The algorithm is to run without exhaustive subdivision until the last step because this is much faster. The final iteration must be run with exhaustive subdivision on, or else it is possible to have cells with swapped pins matching. The routines that resolve automorphisms were setting exhaustive subdivision for the final iteration. But simple "run converge" and "run resolve" were not. |
||
|---|---|---|
| .. | ||
| Depend | ||
| Makefile | ||
| console.tcl | ||
| netgen.sh.in | ||
| netgen.tcl.in | ||
| netgenexec.c | ||
| tclnetgen.c | ||
| tkcon.tcl | ||
| tmp.out | ||