|
|
1.1 ! root 1: .TH REWORK 10.1 UCDS ! 2: .SH NAME ! 3: rework \- diff two wirelists ! 4: .SH SYNOPSIS ! 5: .B rework ! 6: [ ! 7: .B -e ! 8: ] [ ! 9: .B -q ! 10: ] [ ! 11: .B -v ! 12: ] [ ! 13: .B -s ! 14: ] [ ! 15: .B -o ! 16: ] [ ! 17: .BI -d net ! 18: ] ! 19: .I old new ! 20: .SH DESCRIPTION ! 21: .I Rework ! 22: takes two wirelists (the output of ! 23: .IR "fizz wrap" (10.1)) ! 24: and produces three wirelists: ! 25: .BR UN.wr , ! 26: .BR RE.wr, ! 27: and ! 28: .BR NEW.wr. ! 29: .B NEW.wr ! 30: describes the result of removing the wires in ! 31: .B UN.wr ! 32: from ! 33: .I old ! 34: and then adding the wires in ! 35: .BR RE.wr . ! 36: The list ! 37: .B NEW.wr ! 38: is electrically equivalent to ! 39: .IR new . ! 40: Typically, the file ! 41: .I new ! 42: is generated by ! 43: .IR "fizz wrap" (10.1) ! 44: and ! 45: .I old ! 46: is the ! 47: .B NEW.wr ! 48: produced in the last rework. ! 49: .PP ! 50: The various options are ! 51: .TP 7 ! 52: .BI -d net ! 53: produce detailed debugging output. ! 54: The optional netname ! 55: .I net ! 56: confines debugging to just that net. ! 57: .TP 7 ! 58: .B -e ! 59: like ! 60: .B -v ! 61: except that input nets need not be connected. ! 62: .TP 7 ! 63: .B -o ! 64: the nets in ! 65: .B NEW.wr ! 66: will be ordered. ! 67: Normally unchanged nets are just copied. ! 68: .TP 7 ! 69: .B -q ! 70: try to minimise the number of wires for the rework. ! 71: Currently, this is only useful when the new net is strictly larger ! 72: than the old net. ! 73: .TP 7 ! 74: .B -s ! 75: print some statistics of the inputs. ! 76: .TP 7 ! 77: .B -v ! 78: print a terse summary of the differences on standard output. ! 79: .BR UN.wr , ! 80: .BR RE.wr , ! 81: and ! 82: .B NEW.wr ! 83: will be unchanged. ! 84: .PP ! 85: .I Rework ! 86: ignores the start ! 87: .RB ( 04 ) ! 88: and stop ! 89: .RB ( 08 ) ! 90: bits in its input; it assumes all the wires for one net are ! 91: sequential in the input. ! 92: .SH BUGS ! 93: .SH SEE ALSO ! 94: .IR wrap (10.1)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.