Compare commits

..

74 Commits

Author SHA1 Message Date
R. Timothy Edwards e1528a797c Corrected the parsing for assignment left-hand-side to allow for
whitespace inside the array declaration, as was (correctly) done
for pin connections.  Previously, "assign x[ 0] = 1'b1" would
fail due to "x[" being parsed as a token by itself.  Now, upon
reading an array opening bracket delimiter, the verilog parser
will continue to read tokens until it finds the closing bracket,
as it does for pin connections.
2026-07-06 10:22:02 -04:00
R. Timothy Edwards 2c94087510 Corrected an error in delimiter parsing, which is due to the lack of
any standard array delimiter character in SPICE.  Often brackets are
used, but just as often angle brackets are used instead, and do not
match the bracket syntax of verilog.  The "matchnocase" function
automatically casts common delimiter characters to a single type to
facilitate matching between names using different delimiters.
However, some code in MatchPins() was assuming square brackets and
breaking this allowance, causing pins to be marked mismatch in spite
of the handling in "matchnocase".  The code has been corrected to
make the same allowance for different delimiter characters everywhere.
2026-06-28 11:44:42 -04:00
R. Timothy Edwards 3eadc8b0dc Corrected some issues in the SPICE parser where a subcircuit name
was checked using "subcktname" before its initialization.  Added
a check for a subcircuit called inside itself, which causes an
immediate failure (see issue tracker issue #106).  If allowed to
continue, netgen will either crash or produce inscrutable output
that doesn't pinpoint the issue.
2026-06-08 14:11:07 -04:00
R. Timothy Edwards 9630670071 The example cited in the last commit is not completely solved by
the code changes in the last commit.  There is still an issue in
which pins should match between name X on one side and X[Y] on
the other side, if there is no X[Z] where Z != Y, specifically if
one or both cells is a black box, since the equivalence cannot
be determined by net matching.

The pin matching has gotten out of hand and really should be
completely redone. . .
2026-05-21 15:35:57 -04:00
R. Timothy Edwards f29452e550 An example found by Leo Moser showed that netgen makes an incorrect
pin assignment when a verilog input file declares a signal "bundle"
with only one signal in it.  The solution is to detect bundles which
have only one component in them, and remove the bundle delimiters
("{...}") so that the pin connection is treated as a simple signal
or vector.
2026-05-21 14:19:24 -04:00
R. Timothy Edwards 8a2bbe0723 Updated version to go along with PR #105 from user jalcim on github. 2026-04-27 09:50:37 -04:00
jalcim a0c49a026a
fix(netcmp): correct signal handler type for K&R declaration
netcmp.c:55 declares oldinthandler with empty parameter list:
    void (*oldinthandler)() = SIG_DFL;

In K&R / pre-C23, this means 'function with unspecified parameters'.
GCC 14+ infers void(*)(void), which is incompatible with signal(2)'s
expected void(*)(int) handler. The signal(SIGINT, oldinthandler) calls
at lines 8777 and 8784 then fail with -Wincompatible-pointer-types
(now a default error in GCC 14+).

This 1-line fix matches the actual usage as a SIGINT handler with int
signum parameter, and restores tclnetgen.so build on Fedora 41+ /
Debian 13+ / Ubuntu 24.04+ (any system with GCC 14+).

Tested: tclnetgen.so now builds successfully and 'netgen -batch lvs'
mode works again.
2026-04-26 22:06:07 +02:00
R. Timothy Edwards 665203bba1 Corrected genhash() after Mitch Bailey pointed out that the function
was no longer hashing on both values passed to the function, as it
is supposed to.
2026-04-03 08:48:34 -04:00
R. Timothy Edwards 0192558d4b Updated version corresponding to the last commit. 2026-04-02 21:30:01 -04:00
R. Timothy Edwards 21d329b22d Modified the hash algorithm used by netgen after a discussion with
ChatGPT about hash implementations.  Switched from SDBM to FNV-1a,
which should be a better/stronger hash algorithm.  Could do
something more sophisticated, but this change can be done in a few
minutes.
2026-04-02 21:29:04 -04:00
R. Timothy Edwards 37b1a2a07d Cleaned up some errors (most minor, some not so minor) in the
code that were surfaced by Stefan Thiede running clang on Mac
OS.  Function prototype warnings have not been fixed yet, as
that is a more involved fix, although it needs to be done.
2026-02-02 20:53:13 -05:00
R. Timothy Edwards 777f7ef095 Found a counting issue with netcmp output that will overrun the
output string buffer if the size of the copied string is just
the wrong amount, due to the use of strcpy() instead of
strncpy() in at least one place.  Just hacked a solution by
allocating more space for the string, but this should be fixed
properly.  Also:  Discovered that the "zero valued resistor"
routine looks for shorted ports in the wrong place, and if it
finds shorted ports it wrongly decides that the device it's
looking at is a zero-valued resistor whether or not it really
is zero-valued.
2026-01-15 16:39:18 -05:00
R. Timothy Edwards 9b4185fe62 Reverted a change from a long time ago regarding removal of zero
valued resistors connecting two ports.  I do not recall exactly
why I put that in but it appears to cause incorrect behavior.
2025-12-28 14:54:07 -05:00
R. Timothy Edwards ddd95c4fe6 Added a few lines to the setup file parser so that if there is a
missing brace in the file (a common error), then the fact that
there is an unevaluated command when the file has finished being
read will trigger an evaluation of the unfinished code and emit
an error.  Previously, the command and anything after the
unterminated brace would just silently get ignored, which was not
helpful for debugging setup syntax errors.
2025-12-11 12:08:31 -05:00
R. Timothy Edwards c0c9993980 Corrected a major error with the verilog parser. The verilog
parser was not assigning the correct file number for the first
input file, which resulted in the effect that if the first
file read sets definitions for the netlist, then those definitions
are wiped out on the following file read.  There has been a workaround
to read from /dev/null on the first file read so that the file number
is set on all subsequent reads.  This fix avoids the need for the
workaround.
2025-12-08 16:45:27 -05:00
R. Timothy Edwards 8a20b90074 Corrected an issue that can cause a segfault in an incorrect run
setup when a cell has no pins.  Didn't really analyze the error
condition, just caught and handled the condition to avoid the
segfault.
2025-12-08 13:09:50 -05:00
R. Timothy Edwards 3392159243 Added some extra code to the verilog parser. It now handles some
additional syntax for wire bundles specified as a pin connection
on an array of instances, and a few other things.  These are not
exhaustive but are solving an immediate problem.  I will go back
and clean up the code to make it work for more general cases
later.
2025-11-29 11:55:26 -05:00
R. Timothy Edwards 24c6eb4cb9 Updated the version to go along with the merge of pull request 2025-11-24 12:26:57 -05:00
Mitch Bailey 9048191486 Allow processing of cellnames with $.
When loading a file, also print cellname on errors

Signed-off-by: Mitch Bailey <d.mitch.bailey@gmail.com>
2025-11-24 12:26:30 -05:00
R. Timothy Edwards 72d7d55bbe Corrected an issue with the "-noflatten" switch to "lvs", which is
also a problem with the underlying "flatten prohibit" command
option;  in one place, the cell's subcircuits were being prohibited
from being flattened, causing issues including a potential infinite
loop.
2025-11-21 15:52:14 -05:00
R. Timothy Edwards 04163aedcc One hopefully final modification to ensure that Tcl_InitStubs()
uses the Tcl version that the program has been compiled to.  This
should work with both Tcl 8.X and Tcl 9.X.
2025-11-12 11:32:18 -05:00
R. Timothy Edwards f7d35f9cca Accidentally changed a file in the last commit which gets
overwritten by "configure".  Moved the modification to the source
file that doesn't get overwritten.
2025-11-12 09:55:29 -05:00
R. Timothy Edwards 601277e539 Updated the revision number for the last set of changes. 2025-11-12 09:19:52 -05:00
R. Timothy Edwards 73344329f8 Made some updates for Tcl 9 compatibility; also changed the
Makefile to pass EXTRA_CFLAGS for testing with "-std=c99" and
"-std=gnu99".  Made some additional corrections to ensure a
clean compile using -std=gnu99.
2025-11-12 09:17:46 -05:00
R. Timothy Edwards 08485d28a7 Changed CONST and CONST84 everywhere in tclnetgen.c to "const".
The capitalized version of this got removed from the Tcl headers
as some point and is no longer valid.  Added an include of
"strings.h" to base/actel.c, which was missing it (uses
strcasecmp() in the code, and needs the function declaration).
2025-11-11 09:59:14 -05:00
R. Timothy Edwards 2ee286efb4 Corrected the pin permutation check for pin matching; previously,
this was not doing the correct cross-check, instead looking in the
same netlist for the permutable pin and checking its node number,
which is useless since the node number is the same by definition
for permutable pins.  This error would result in occasional false
negative results during pin matching, showing matching where pins
are actually not matched.
2025-11-07 14:06:22 -05:00
R. Timothy Edwards dae6919d4f Updating the version to go along with the merge of pull request 2025-10-23 09:54:36 -04:00
D. Mitch Bailey 017bdc6e48 Changed nested to static variable. Otherwise gets reset with each line.
Signed-off-by: D. Mitch Bailey <d.mitch.bailey@gmail.com>
2025-10-23 08:30:08 +00:00
R. Timothy Edwards b371af9235 Corrected an error that was assumed to have been fixed three years
ago (and may have been, but only under limited circumstances).  Do
to several errors, using "-noflatten" on the command line and using
"flatten prohibit" in a script would not prevent cells from being
flattened;  the "-noflatten" list needed to be used to call "flatten
prohibit", and "flatten prohibit" needed to be fixed to flag the
specified cell instead of the top level cell where it exists.
2025-10-22 10:43:00 -04:00
R. Timothy Edwards b5432d139b Corrected a corner-case where a module with no ports in verilog
was creating an implicit net for the stand-in "(no pins)" port.
2025-10-09 10:36:41 -04:00
R. Timothy Edwards 0e958bd45c Corrected an issue in which black-box entries (such as low-level
subcircuit devices) do not output information about mismatched
pins.  This can end up being treated as a non-error but the
mismatch should be noted in the output regardless.
2025-10-08 10:03:35 -04:00
R. Timothy Edwards b59196fa81 Modified the SPICE file read routine to accept the CDL syntax
"*.GLOBAL" as equivalent to ".GLOBAL".  Corrected the property
matching to handle property combination when no "critical"
property is given.  Critical properties exist when one property
must remain constant and equal for other properties to combine,
such as transistor length.  But, for example, capacitors can
combine area without any restriction based on another property.
Also, corrected the property matching code to allow more than
one property to be additive (example:  capacitor area and
perimeter).  Corrected the equation for adding properties in
parallel combination.
2025-10-02 12:33:28 -04:00
R. Timothy Edwards 6e6e9fb73f Added code to catch and print an error in connectivity between a
port and an internal node which can be missed when pin permutations
are present.  Previously, that could produce a situation where
netgen would report a "port error" but otherwise list all ports
as matching.  Because the permutation handling makes this hard to
detect while generating pin correspondence output, the non-matching
pins are listed separately at the end, and only if no mismatch was
detected during output.
2025-09-09 13:45:29 -04:00
R. Timothy Edwards e84700a607 Added a NULL check at one point in the SPICE read routine that
prevents a segfault under some condition (not fully investigated)
involving .include files.  Appears to resolve the problem without
any unintended consequences.
2025-08-31 16:52:35 -04:00
R. Timothy Edwards 0bee21ccc8 Corrected an issue in which a property error in a subcell would not
be reported at the end if there was a port error.  This is important
because port errors often resolve themselves, but the cell should not
be reported clean if the port errors resolved but it had property
errors.  Also:  Added a method to derive area and/or perimeter
properties from length and width, so that capacitors can be combined
in parallel without regard to which dimension is width and which is
length.  This feature has only been lightly tested.
2025-08-26 17:47:46 -04:00
R. Timothy Edwards c269f1de89 Corrected an unexpected corner-case error in which if a newline in
a spice netlist falls exactly on the last non-null position of the
input buffer after the buffer has been expanded to accept more
input data, then the next line gets read in automatically, and
the newline gets treated as whitespace and not a newline.
2025-08-25 10:31:19 -04:00
R. Timothy Edwards 4443826f9e Corrected a place in netcmp.c where a new instance net connection
is created without setting the cell name or instance name.  That
can cause a crash condition when attempting to locate the instance
from the net record.
2025-08-18 10:37:36 -04:00
R. Timothy Edwards a60dac6124 Modified the primary SPICE token reading routine so that the call
to strdtok() can differentiate between reading verilog and reading
SPICE.  Otherwise, SPICE containing the (dubious) syntax of using
backslashes in names will get treated as a verilog name with
verilog backslash notation, with generally undesirable results.
When called from the SPICE reading routine, backslashes are
treated as-is and not as verilog notation.
2025-05-17 20:29:38 -04:00
R. Timothy Edwards bbe645f0ab Corrected an error in which netgen was trying to reduce an
expression in a property that was not necessarily a parameter,
and if it wasn't, then netgen would crash.  Surfaced by an
example using complicated parameters that netgen was apparently
unable to handle (an issue for another day;  the main goal here
was to avoid a segmentation violation).
2025-03-25 17:00:58 -04:00
Tim Edwards 4f315d33d6 Fixed a corner case found by Sylvain Munaut (see github issue
tracker #96) in which a subcircuit with only one port (in this
case, a pad) but which has properties (in this case, "M") will
fail to set the pointer position ahead of the property because
the loop starts after the first pin, so it has already missed
the position that needs to be saved.  Fixed by initializing
the value to the first pin position before starting the loop.
2025-03-09 11:07:58 -04:00
Tim Edwards 4457248ecd Corrected a long-standing issue with permutation, which turned out
to be caused by failing to have a systematic way of determining
which pin's hash value would be used for the hash value of all the
pins.  Because equivalent cells in the two netlists may have pins in
different order, it was possible that they might end up with
different hashes.  This was solved simply by always taking the
larger hash value of the two pins belonging to the permutable pair.
Now permutation works correctly for arbitrary subcircuits.
(Previously it worked for low-level components like MOSFETs because
the pin order is always the same.)
2025-02-09 21:26:54 -05:00
Tim Edwards 021dfa6e8a Made changes to tkcon.tcl to ensure compatibility with Tcl version 9. 2025-01-04 14:18:21 -05:00
Tim Edwards 1d286f9973 Corrected an issue with generating proxy pins that had previously
forced flattening to be done whenever any pin mismatch occurred,
which undermined the whole proxy pin method.  With the proxy pins
fixed, reinstated the method of avoiding flattening when pin
issues can be trivially corrected.  Also:  Added output to the
pin matching for one mismatch case that was being missed.
2025-01-01 13:27:39 -05:00
Tim Edwards 6d2ef396ef After giving the previous code change some more thought, I
decided that it is beneficial to break symmetries by net name;
it's just that net names should not be used before all symmetries
related to pins have been broken.  So I rewrote the compare
routine to take an argument allowing or disallowing net name
matches, and make one call to break symmetries by pin name
followed by another call to break symmetries by net name.  This
still solves the original problem, but does not allow symmetries
to be broken randomly on internal nets if names have been matched
in both netlists.  Otherwise the output may report nets that
appear to be swapped, making the output confusing.
2024-12-27 16:20:00 -05:00
Tim Edwards 2483b7440f Corrected an error in "ResolveAutomorphsByPin" where the code states
to check that the nodes with matching names are pins, but never does.
This results in an attempt to resolve automorphs by matching pin
names AND net names.  However, net names can match without the nets
matching, as pointed out by Andrey Bondar (private communication).
Fixed simply by adding the specified check that the node being name-
matched is actually a pin.
2024-12-26 21:20:24 -05:00
Tim Edwards 49c0de0433 Corrected an error found by Sylvain Munaut and discussed on
open-source-silicon slack on Nov. 3 in which the simple verilog
expression "assign name1 = name2[a:b]";  this revealed an error
where the parsing of "name2" was being incorrectly run with
GetBusTok() which must be called when the token starts with "[".
This problem existed both for the left-hand-side parsing and
the right-hand-side parsing, and has been fixed for both (where
either side may be a subset of a bus and the other a complete
bus).
2024-11-14 21:28:51 -05:00
Tim Edwards 3b9dca0cf2 Implemented the patch from Sylvain Munaut in github PR#90 (issue
that the position in the code has shifted quite a bit and I
don't really trust that git will do a clean merge.
2024-11-14 20:39:19 -05:00
Tim Edwards 7d910b616c Modified the string matching "matchnocase()" routine to compare
a verilog escaped string against an equivalent non-escaped
string (requires that the escaped string differs from the non-
escaped string by having a "\" at the front and " " at the end.
The space character is always maintained as part of the string).
2024-10-19 17:07:09 -04:00
Tim Edwards b1032f846b Refactored code in netcmp.c involved in printing side-by-side
formatted output to make it much cleaner and easier to read.  This
is in preparation of correcting the circuit1<-->circuit2 asymmetry
in the MatchPins() routine.
2024-10-16 20:38:44 -04:00
Tim Edwards 4c546d1472 Corrected an error that prevents property errors from being
printed in detail if a port error is also found.
2024-10-16 09:44:48 -04:00
Tim Edwards e1aa231db1 Corrected another error discovered by Andrei Bondar in which
the critical property (e.g., L for transistors) is required to
match exactly between devices in order to allow the additive
property (e.g., W for transistors) to be summed.  The critical
property should match if all values are within the slop value,
for floating-point values.  Note:  The implementation is still
not rigorous, as the saved critical value may shift from
device to device;  so comparing, e.g., 1.00 to 1.01 to 1.02 to
1.03, etc., can find that all individual comparisons are within
the slop value even though the slop is exceeded across all values.
2024-10-15 20:52:23 -04:00
Tim Edwards df8fa29b2f Fixed an issue with property matching that was preventing the last-
ditch effort of matching based on combining devices with the same
critical property (e.g., adding gate widths together for transistors
of the same gate length, if the property records remain stubbornly
mismatched to the end).  Thanks to Bondar Andrey Renatovich for
surfacing this issue and providing a reproducible example.
2024-10-14 13:24:35 -04:00
Tim Edwards d14bf70f1c Working to get some MatchPins improvements from Mitch Bailey from
a long time ago into the code.  The improvements collided with
intervening changes to the same routines and would not merge
cleanly, which is why they were never merged.  Step 1:  Show the
net name of a matching net that is missing a pin.  Remove output
of missing pins that is redundant (pin names being output twice).
2024-10-07 11:10:33 -04:00
Tim Edwards 5c21000a8b Made a modification to accommodate the situation where a SPICE
instance is matched to a verilog module definition, and the SPICE
instance is read before the verilog definition, forcing a
placeholder cell to be created.  Netgen will now make the
assumption that the verilog ports are in the same order as the
SPICE instance port order.  At the same time, it will output a
warning message that it is making this not-necessarily-warranted
assumption.  If the number of ports don't match or the placeholder
did not come from a SPICE instance, then the placeholder pins are
left alone.
2024-10-03 14:52:42 -04:00
Tim Edwards 05872ca918 Corrected an apparently long-standing error that is responsible for
some errors failing to list in the output while also being responsible
for a number of non-errors showing up in the output.  This fix may
substantially clean up netgen output.  Also:  Added text to the
output noting that pin matching may be incorrect with respect to
symmetries if the nets have failed to match.
2024-10-02 21:20:27 -04:00
Tim Edwards e821381900 Corrected a rather obscure error in which an otherwise unconnected
port-to-port short (formed by "assign" in verilog or zero-valued
resistors in SPICE) does not get checked when counting nodes
before adding a proxy pin to a subcircuit in that cell, causing
the proxy pin to be assigned the same node number and forming an
unintended connection to the port-to-port connecting net.
2024-09-30 22:11:53 -04:00
Tim Edwards 8022e1370f Added a few lines to rebuild the node cache after removing devices
such a zero-ohm resistors or zero-volt sources during the pre-match
phase, since the list of nodes gets changed by merging nets across
the removed devices.  Otherwise, the node-name cache gets
corrupted and random LVS errors occur.
2024-09-27 10:08:37 -04:00
Tim Edwards 2b88d79adc Corrected a rare case where a NULL value propagates in the flattening
routine and is not caught until it causes a segfault.
2024-08-16 19:48:36 -04:00
Tim Edwards bf4112db07 Corrected two statements that can cause a segfault because a
structure variable is not checked for the condition of being NULL
before attempting to read a component of the structure.  These
conditions imply that something is badly wrong in the netlist but
should not be causing a segfault.
2024-05-16 11:49:56 -04:00
Tim Edwards fcee934580 Corrected the parsing of the "model" command, which was failing to
pass the right cell name to the routine which counts the number of
pins.  Using this in a setup file will prevent netgen from spending
time matching low-level devices.
2024-05-14 15:12:41 -04:00
Tim Edwards 2d427aef3c Corrected the bad placement of #ifdef TCL_NETGEN . . . #endif around
critical parts of the netcmp.c code, causing issues with the non-Tcl
build (not that anyone should be doing a non-Tcl build).
2024-05-09 14:11:26 -04:00
Tim Edwards fd0c8c87ea Corrected another error in which, for device sorting, "M" was set
to 1 before the loop over devices in "run", resulting in "M"
taking the value of the previous property record if the following
record did not have an "M" value, instead of setting it to 1.
2024-04-03 21:05:08 -04:00
Tim Edwards 3d180f778d Corrected an error that had previously been corrected in
PropertyMatch() but not corrected symmetrically between circuit1
and circuit2;  this left the possibility that "M=1" in one
circuit vs. no "M" entry in the other would still pop up as a
property error, depending on which circuit (layout or schematic)
was listed first.
2024-04-03 11:01:58 -04:00
Tim Edwards 035fef5c72 Corrected an issue that prevents "cells list <file>" from reporting
empty cells (this does not solve the problem at hand, but is a part
of it).
2024-03-04 21:26:09 -05:00
Tim Edwards 202ea0431f Also updated configure (in addition to configure.in) with the
change to remove the "m4" dependency.
2024-02-19 12:46:20 -05:00
Tim Edwards 94754dbc4e Removed the requirement for package "m4" that is in the configuration
script.  It is not needed and doesn't exist in many OS distributions.
2024-02-19 12:41:08 -05:00
Tim Edwards bf67d3c275 Having been given an example by Kareem Farid where the order of
verilog netlists makes a difference to the matching (or failure
thereof), I applied the same in-circuit pin matching as previously
applied to mixtures of SPICE and verilog netlists.  This is clearly
a more robust way to handle pin order differences between parent
and child than was implemented previously.
2024-02-18 15:22:40 -05:00
Tim Edwards 62feed812e Corrected an issue that arose due to a change made earlier: A
while back, shorted pins were moved into contiguous positions.
When that method was discovered to cause matching issues, it was
abandoned with a note that doing so might have unintended
consequences because other code might depend on the shorted pins
being contiguous.  Such a case was just found, and corrected.
However, it was also found that shorted pins were still not
completely handled correctly in MatchPins();  a solution was
found that adds such pins to the "permutes" list (which needs to
be done if the shorted pins are to be correctly handled in any
higher level of the hierarchy, if there is one), and the
"permutes" list is then checked by MatchPins() to determine if
pins match because they belong to the same group of shorted
pins.
2024-02-09 21:23:28 -05:00
Tim Edwards d1c2848e4b Corrected another error in which some simple expressions are
incorrectly evaluated;  "(w+l)" for example treats "w+l" as
a single string instead of three tokens.  Corrected the code
to watch for a failure of strtod() when parsing the expression
at the "+" sign (also for "-").
2024-02-06 16:27:32 -05:00
Tim Edwards 6b0bd4d97b Found an error with the property sorting in which float values
were not compared for sorting in the same way they are compared
for property matching.  The "slop" value was treated as absolute,
not a percentage, so for example a slop of 0.01 on a dimension
of microns would cause all dimensions to be treated as round-off
error, and no sorting would occur.
2024-02-06 15:02:50 -05:00
Tim Edwards d69fbc23bb Added code to handle the problem in which a verilog netlist is read
before its component cells, and the component cells are read in as
SPICE netlists.  Then the original verilog cell and its instances
need to have pins reordered to match the subcircuit definition in
the SPICE netlist.  Otherwise, when verilog and SPICE netlists are
mixed, the order in which the files are read is critical, and
failures due to reading out-of-order are very obscure and nearly
impossible to debug.
2024-02-03 21:21:09 -05:00
Tim Edwards c7fa0324d9 Added a piece of code that handles implicit pins in verilog by doing
the following:  (1) Checking that the parent cell is verilog,
(2) only running after the two cells themselves have been compared
and matched, then (3) added the missing pin or pins while reordering
pins on instances (note: this may not work if the verilog netlist is
the first passed to netgen;  that case needs to be checked).
2024-02-02 14:51:10 -05:00
Tim Edwards eb27a18ae3 Corrected two different errors:
(1) When a comment line follows a ".subckt" line, and the comment
    line is empty or all whitespace, then the following line would
    be ignored.  This condition appears to be very specific and
    was solved simply by detecting it and handling it.
(2) Occasionally the "M" parameter of a subcircuit will be recorded
    as type double, and this was not being anticipated by the code
    that checks if "M=1" matches a corresponding entry with no "M"
    parameter.  Simple fix to check the condition where the "M"
    parameter is type double.
2024-01-03 21:21:03 -05:00
Tim Edwards 1817f4dd6a Corrected the LDDL_FLAGS setting for Mac OS, which is to replace
"-flat_namespace -undefined suppress -noprebind" to "-undefined
dynamic_lookup" which is what was done in magic, which has a
similar structure to netgen.
2023-12-03 20:32:05 -05:00
20 changed files with 1964 additions and 795 deletions

View File

@ -1 +1 @@
1.5.263 1.5.323

View File

@ -22,6 +22,7 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <stdio.h> #include <stdio.h>
#include <stdarg.h> #include <stdarg.h>
#include <strings.h>
#include <ctype.h> #include <ctype.h>
#ifdef IBMPC #ifdef IBMPC
#include <stdlib.h> /* for strtol on PC */ #include <stdlib.h> /* for strtol on PC */
@ -90,7 +91,7 @@ char *ActelName(char *Name)
/* strip physical-pin information, if it exists */ /* strip physical-pin information, if it exists */
if ((nm = strrchr(name,PHYSICALPIN[0])) != NULL) *nm = '\0'; if ((nm = strrchr(name,PHYSICALPIN[0])) != NULL) *nm = '\0';
if (strlen(name) > 13) { if (strlen(name) > 13) {
ActelIndex = (++ActelIndex) % ACTELNAMESIZE; ActelIndex = (ActelIndex + 1) % ACTELNAMESIZE;
/* format the value of the hashed value of the string */ /* format the value of the hashed value of the string */
sprintf(ActelNames[ActelIndex], "$%lX", ActelNameHash(name)); sprintf(ActelNames[ActelIndex], "$%lX", ActelNameHash(name));
if (Debug) if (Debug)
@ -101,7 +102,7 @@ Printf("ActelNameHash returns %s on name %s\n",ActelNames[ActelIndex], name);
NeedsQuoting = 0; NeedsQuoting = 0;
if (NULL != strpbrk(name, ".,:; \t\"'\n\r")) NeedsQuoting = 1; if (NULL != strpbrk(name, ".,:; \t\"'\n\r")) NeedsQuoting = 1;
ActelIndex = (++ActelIndex) % ACTELNAMESIZE; ActelIndex = (ActelIndex + 1) % ACTELNAMESIZE;
if (!NeedsQuoting) { if (!NeedsQuoting) {
strcpy(ActelNames[ActelIndex], name); strcpy(ActelNames[ActelIndex], name);
return(ActelNames[ActelIndex]); return(ActelNames[ActelIndex]);

View File

@ -300,8 +300,6 @@ int flattenInstancesOf(char *name, int fnum, char *instance)
return 0; return 0;
} }
} }
/* Placeholder cells must not be flattened */
if (ThisCell->flags & CELL_PLACEHOLDER) return 0;
FreeNodeNames(ThisCell); FreeNodeNames(ThisCell);
@ -339,6 +337,10 @@ int flattenInstancesOf(char *name, int fnum, char *instance)
LastObj = ParentParams; LastObj = ParentParams;
continue; continue;
} }
if (ChildCell->flags & CELL_PLACEHOLDER) {
LastObj = ParentParams;
continue; // Placeholder cells must not be flattened
}
if (ChildCell == ThisCell) { if (ChildCell == ThisCell) {
LastObj = ParentParams; LastObj = ParentParams;
continue; // Avoid infinite loop continue; // Avoid infinite loop
@ -600,9 +602,11 @@ int flattenInstancesOf(char *name, int fnum, char *instance)
else break; else break;
/* Put the child cell at the start of ChildObjList */ /* Put the child cell at the start of ChildObjList */
if (ChildEnd) {
ChildEnd->next = ChildObjList; ChildEnd->next = ChildObjList;
ChildObjList = ChildStart; ChildObjList = ChildStart;
} }
}
/* Put the child cell at the start of ChildObjList */ /* Put the child cell at the start of ChildObjList */
if (ChildEnd) { if (ChildEnd) {
@ -1230,6 +1234,10 @@ int UniquePins(char *name, int filenum)
* Removed the code 9/1/2023. But---Not sure if any code depends * Removed the code 9/1/2023. But---Not sure if any code depends
* on shorted pins being adjacent. * on shorted pins being adjacent.
*/ */
/* When two pins are shorted, they are by definition permutable */
PermuteSetup(ThisCell->name, ThisCell->file, ob->name,
firstport[ob->node]->name);
continue; continue;
} }
else { else {
@ -1300,6 +1308,14 @@ int UniquePins(char *name, int filenum)
return 1; return 1;
} }
/* Structure used below for keeping track of node numbers
* belonging to removed nodes.
*/
struct LinkedNum {
int node;
struct LinkedNum *next;
};
/*------------------------------------------------------*/ /*------------------------------------------------------*/
/* Callback function for CleanupPins */ /* Callback function for CleanupPins */
/* Note that if the first pin of the instance is a */ /* Note that if the first pin of the instance is a */
@ -1312,6 +1328,7 @@ struct nlist *cleanuppins(struct hashlist *p, void *clientdata)
struct nlist *ptr; struct nlist *ptr;
struct objlist *ob, *obt, *lob, *nob, *firstpin, *pob; struct objlist *ob, *obt, *lob, *nob, *firstpin, *pob;
struct nlist *tc = (struct nlist *)clientdata; struct nlist *tc = (struct nlist *)clientdata;
struct LinkedNum *newnodenum, *removedNodes = (struct LinkedNum *)NULL;
int pinnum; int pinnum;
char *saveinst = NULL; char *saveinst = NULL;
@ -1367,6 +1384,15 @@ struct nlist *cleanuppins(struct hashlist *p, void *clientdata)
saveinst = ob->instance.name; saveinst = ob->instance.name;
} }
if (ob->model.class != NULL) FREE(ob->model.class); if (ob->model.class != NULL) FREE(ob->model.class);
// Record the net number of the pin being removed, to
// check at the end if the net belonged to a pin that
// got orphaned.
newnodenum = (struct LinkedNum *)MALLOC(sizeof(struct LinkedNum));
newnodenum->node = ob->node;
newnodenum->next = removedNodes;
removedNodes = newnodenum;
FREE(ob); FREE(ob);
} }
else { else {
@ -1410,6 +1436,28 @@ struct nlist *cleanuppins(struct hashlist *p, void *clientdata)
} }
} }
while (removedNodes != NULL) {
int nodenum = removedNodes->node;
struct objlist *ob2;
/* Only concerned with nodes that are in the pin list of ptr->cell */
for (ob = ptr->cell; ob != NULL; ob = ob->next) {
if (ob->type != PORT) break;
if (ob->node == nodenum) break;
}
if (ob && (ob->type == PORT)) {
/* Check if this node number exists only in the port record */
for (nob = ob->next; nob != NULL; nob = nob->next)
if (nob->node == nodenum) break;
if (nob == NULL) {
ob->node = -1; /* This pin is now disconnected */
}
}
newnodenum = removedNodes;
removedNodes = removedNodes->next;
FREE(newnodenum);
}
if (saveinst != NULL) FREE(saveinst); if (saveinst != NULL) FREE(saveinst);
return NULL; /* Keep the search going */ return NULL; /* Keep the search going */
} }
@ -1630,7 +1678,7 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
ECompare *ecomp, *ncomp; ECompare *ecomp, *ncomp;
ECompList *list0X, *listX0; ECompList *list0X, *listX0;
int hascontents1, hascontents2; int hascontents1, hascontents2;
int match, modified = 0; int match, modified1 = 0, modified2 = 0;
int not_top; int not_top;
if (file1 == -1) if (file1 == -1)
@ -1707,16 +1755,26 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)" Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" makes a better match\n", ecomp->cell1->name, " makes a better match\n", ecomp->cell1->name,
name1, file1); name1, file1);
flattenInstancesOf(name1, file1, ecomp->cell1->name); if (flattenInstancesOf(name1, file1, ecomp->cell1->name) > 0)
modified++; modified1++;
}
else if (ecomp->cell1 && (ecomp->num1 > 0)) {
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" would make a better match but is prohibited.\n",
ecomp->cell1->name, name1, file1);
} }
if (ecomp->cell2 && (ecomp->num2 > 0) && if (ecomp->cell2 && (ecomp->num2 > 0) &&
(!(ecomp->cell2->flags & CELL_PLACEHOLDER))) { (!(ecomp->cell2->flags & CELL_PLACEHOLDER))) {
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)" Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" makes a better match\n", ecomp->cell2->name, " makes a better match\n", ecomp->cell2->name,
name2, file2); name2, file2);
flattenInstancesOf(name2, file2, ecomp->cell2->name); if (flattenInstancesOf(name2, file2, ecomp->cell2->name) > 0)
modified++; modified2++;
}
else if (ecomp->cell2 && (ecomp->num2 > 0)) {
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" would make a better match but is prohibited.\n",
ecomp->cell2->name, name2, file2);
} }
} }
@ -1805,8 +1863,13 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)" Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" makes a better match\n", ecomp->cell2->name, " makes a better match\n", ecomp->cell2->name,
name2, file2); name2, file2);
flattenInstancesOf(name2, file2, ecomp->cell2->name); if (flattenInstancesOf(name2, file2, ecomp->cell2->name) > 0)
modified++; modified2++;
}
else if (ecomp->cell2) {
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" would make a better match but is prohibited.\n",
ecomp->cell2->name, name2, file2);
} }
} }
} }
@ -1871,8 +1934,13 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)" Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" makes a better match\n", ecomp->cell1->name, " makes a better match\n", ecomp->cell1->name,
name1, file1); name1, file1);
flattenInstancesOf(name1, file1, ecomp->cell1->name); if (flattenInstancesOf(name1, file1, ecomp->cell1->name) > 0)
modified++; modified1++;
}
else if (ecomp->cell1) {
Fprintf(stdout, "Flattening instances of %s in cell %s (%d)"
" would make a better match but is prohibited.\n",
ecomp->cell1->name, name1, file1);
} }
} }
} }
@ -1950,8 +2018,11 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
break; break;
} }
} }
if (found) break;
}
/* Do NOT remove shorting devices that */ if (found) {
/* Beware remove shorting devices that */
/* connect two ports. Otherwise the */ /* connect two ports. Otherwise the */
/* port lists get screwed up. It is */ /* port lists get screwed up. It is */
/* better in that case to force the */ /* better in that case to force the */
@ -1959,6 +2030,10 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
/* This is ignored for a top-level cell */ /* This is ignored for a top-level cell */
/* because it will just show up as a */ /* because it will just show up as a */
/* port mismatch error as it should. */ /* port mismatch error as it should. */
/* (12/12/2025---disabling this worked; */
/* may need to go back to a failing */
/* example and determine how pin */
/* matching gets scrambled.) */
if ((not_top == TRUE) && if ((not_top == TRUE) &&
(ecomp->cell1->class != CLASS_ISOURCE)) { (ecomp->cell1->class != CLASS_ISOURCE)) {
@ -1971,14 +2046,18 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
else if (ob2->node == node2) else if (ob2->node == node2)
found2 = TRUE; found2 = TRUE;
if (found1 && found2) { if (found1 && found2) {
found = FALSE; Fprintf(stdout, "Warning: "
"zero-valued device connects "
"port %s to another port; pin "
"matching may be affected.\n",
ob2->name);
// found = FALSE;
break; break;
} }
} }
} }
if (found) break;
} }
if (found) { if (found) {
Fprintf(stdout, "Removing zero-valued device " Fprintf(stdout, "Removing zero-valued device "
"%s from cell %s (%d) makes a better " "%s from cell %s (%d) makes a better "
@ -2026,7 +2105,7 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
/* Remove from list */ /* Remove from list */
ecomp->num1--; ecomp->num1--;
modified++; modified1++;
ob1 = lob; ob1 = lob;
} }
@ -2164,8 +2243,8 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
} }
/* Remove from list */ /* Remove from list */
ecomp->num1--; ecomp->num2--;
modified++; modified2++;
ob2 = lob; ob2 = lob;
} }
@ -2199,7 +2278,7 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
// are no other modifications, as this rule is relaxed compared to other // are no other modifications, as this rule is relaxed compared to other
// rules, and the other rules should be exhaustively applied first. // rules, and the other rules should be exhaustively applied first.
if ((listX0 != NULL) && (list0X != NULL) && (modified == 0)) { if ((listX0 != NULL) && (list0X != NULL) && ((modified1 + modified2) == 0)) {
ECompare *ecomp0X, *ecompX0; ECompare *ecomp0X, *ecompX0;
ECompList *elist0X, *elistX0; ECompList *elist0X, *elistX0;
for (elistX0 = listX0; elistX0; elistX0 = elistX0->next) { for (elistX0 = listX0; elistX0; elistX0 = elistX0->next) {
@ -2225,13 +2304,24 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
ecompX0->cell1->file, &compdict); ecompX0->cell1->file, &compdict);
if (dstr) *dstr = '['; if (dstr) *dstr = '[';
if ((ncomp == ecomp0X) && (ecomp0X->num2 <= ecompX0->num1)) { if ((ncomp == ecomp0X) && (ecomp0X->num2 <= ecompX0->num1)) {
Fprintf(stdout, "Flattening instances of %s in cell %s" if (!(ecompX0->cell1->flags & CELL_PLACEHOLDER)) {
"(%d) makes a better match\n", Fprintf(stdout, "Flattening instances of %s in cell"
" %s (%d) makes a better match\n",
ecompX0->cell1->name, name1, file1); ecompX0->cell1->name, name1, file1);
flattenInstancesOf(name1, file1, ecompX0->cell1->name); if (flattenInstancesOf(name1, file1,
ecompX0->cell1->name) > 0) {
ecompX0->num1 = 0; ecompX0->num1 = 0;
ecomp0X->num1 += ecompX0->num1; ecomp0X->num1 += ecompX0->num1;
modified++; modified1++;
}
}
else
{
Fprintf(stdout, "Flattening instances of %s in "
"cell %s (%d) would make a better "
"match but is prohibited.\n",
ecompX0->cell1->name, name1, file1);
}
break; break;
} }
} }
@ -2251,13 +2341,23 @@ PrematchLists(char *name1, int file1, char *name2, int file2)
ecomp0X->cell2->file, &compdict); ecomp0X->cell2->file, &compdict);
if (dstr) *dstr = '['; if (dstr) *dstr = '[';
if ((ncomp == ecompX0) && (ecompX0->num1 <= ecomp0X->num2)) { if ((ncomp == ecompX0) && (ecompX0->num1 <= ecomp0X->num2)) {
Fprintf(stdout, "Flattening instances of %s in cell %s" if (!(ecomp0X->cell2->flags & CELL_PLACEHOLDER)) {
" (%d) makes a better match\n", Fprintf(stdout, "Flattening instances of %s in cell"
" %s (%d) makes a better match\n",
ecomp0X->cell2->name, name2, file2); ecomp0X->cell2->name, name2, file2);
flattenInstancesOf(name2, file2, ecomp0X->cell2->name); if (flattenInstancesOf(name2, file2,
ecomp0X->cell2->name) > 0) {
ecomp0X->num2 = 0; ecomp0X->num2 = 0;
ecompX0->num2 += ecomp0X->num2; ecompX0->num2 += ecomp0X->num2;
modified++; modified2++;
}
}
else {
Fprintf(stdout, "Flattening instances of %s in "
"cell %s (%d) would make a better "
"match but is prohibited.\n",
ecompX0->cell2->name, name2, file2);
}
break; break;
} }
} }
@ -2288,5 +2388,17 @@ done:
FREE(list0X); FREE(list0X);
list0X = nextptr; list0X = nextptr;
} }
return modified;
// If either netlist was modified, rebuild its node cache
if (modified1 > 0) {
FreeNodeNames(tc1);
CacheNodeNames(tc1);
}
if (modified2 > 0) {
FreeNodeNames(tc2);
CacheNodeNames(tc2);
}
return modified1 + modified2;
} }

View File

@ -137,32 +137,39 @@ static unsigned char uppercase[] = {
// horrible things can happen, as, for example, names AOI12 and OAI12 // horrible things can happen, as, for example, names AOI12 and OAI12
// have exactly the same hash result. Lousy for binning and even // have exactly the same hash result. Lousy for binning and even
// lousier for generating class magic numbers. // lousier for generating class magic numbers.
//
// Updated again 4/2/2026 to the FNV-1a hash, which is better than
// SDBM for this application, according to ChatGPT.
unsigned long hashnocase(char *s, int hashsize) unsigned long hashnocase(char *s, int hashsize)
{ {
unsigned long hashval; unsigned long hashval = 2166136261ul;
for (; *s != '\0'; s++) {
for (hashval = 0; *s != '\0'; ) hashval ^= uppercase[*s];
hashval = uppercase[*s++] hashval *= 16777619ul;
+ (hashval << 6) + (hashval << 16) - hashval; }
return (hashsize == 0) ? hashval : (hashval % hashsize); return (hashsize == 0) ? hashval : (hashval % hashsize);
} }
unsigned long hashcase(char *s, int hashsize) unsigned long hashcase(char *s, int hashsize)
{ {
unsigned long hashval; unsigned long hashval = 2166136261ul;
for (; *s != '\0'; s++) {
for (hashval = 0; *s != '\0'; ) hashval ^= (unsigned char)(*s);
hashval = (*s++) + (hashval << 6) + (hashval << 16) - hashval; hashval *= 16777619ul;
}
return (hashsize == 0) ? hashval : (hashval % hashsize); return (hashsize == 0) ? hashval : (hashval % hashsize);
} }
unsigned long genhash(char *s, int c, int hashsize) unsigned long genhash(char *s, int c, int hashsize)
{ {
unsigned long hashval; unsigned long hashval = 2166136261ul;
hashval ^= (unsigned long)c;
for (hashval = (unsigned long)c; *s != '\0'; ) hashval *= 16777619ul;
hashval = (*s++) + (hashval << 6) + (hashval << 16) - hashval; for (; *s != '\0'; s++) {
hashval ^= (unsigned char)(*s);
hashval *= 16777619ul;
}
return (hashsize == 0) ? hashval : (hashval % hashsize); return (hashsize == 0) ? hashval : (hashval % hashsize);
} }

File diff suppressed because it is too large Load Diff

View File

@ -62,7 +62,7 @@ extern void RegroupDataStructures();
extern void FormatIllegalElementClasses(); extern void FormatIllegalElementClasses();
extern void FormatIllegalNodeClasses(); extern void FormatIllegalNodeClasses();
extern int ResolveAutomorphsByProperty(); extern int ResolveAutomorphsByProperty();
extern int ResolveAutomorphsByPin(); extern int ResolveAutomorphsByPin(int match_nets);
extern void SummarizeElementClasses(struct ElementClass *EC); extern void SummarizeElementClasses(struct ElementClass *EC);
extern int remove_group_tags(struct objlist *ob); extern int remove_group_tags(struct objlist *ob);
@ -70,6 +70,8 @@ extern int remove_group_tags(struct objlist *ob);
#ifdef TCL_NETGEN #ifdef TCL_NETGEN
extern int EquivalentNode(); extern int EquivalentNode();
extern int EquivalentElement(); extern int EquivalentElement();
extern void DeriveAreaProperty();
extern void DerivePerimeterProperty();
extern void enable_interrupt(); extern void enable_interrupt();
extern void disable_interrupt(); extern void disable_interrupt();

View File

@ -302,7 +302,7 @@ int GetNextLineNoNewline(char *delimiter)
{ {
char *newbuf; char *newbuf;
int testc; int testc;
int nested = 0; static int nested = 0;
int llen; int llen;
if (feof(infile)) return -1; if (feof(infile)) return -1;
@ -329,6 +329,11 @@ int GetNextLineNoNewline(char *delimiter)
llen = strlen(line); llen = strlen(line);
} }
while (llen == linesize - 1) { while (llen == linesize - 1) {
/* Note that in the rare case where a newline is in the last buffer
* position, we're done.
*/
if (*(line + llen - 1) == '\n') break;
newbuf = (char *)MALLOC(linesize + 501); newbuf = (char *)MALLOC(linesize + 501);
strcpy(newbuf, line); strcpy(newbuf, line);
FREE(line); FREE(line);
@ -587,19 +592,31 @@ void SkipTokNoNewline(char *delimiter)
/* */ /* */
/* Modified 3/30/2015 to include the condition where a comment line is */ /* Modified 3/30/2015 to include the condition where a comment line is */
/* in the middle of a series of continuation lines. */ /* in the middle of a series of continuation lines. */
/* */
/* Modified 1/3/2024 to avoid skipping two lines if a line has only the */
/* comment character '*' followed by a newline. It seems that '\n' is */
/* being ignored in WHITESPACE_DELIMITER, but it's easier to write the */
/* code to find the exception rather than track down the problem in */
/* GetNextLine(). */
/*----------------------------------------------------------------------*/ /*----------------------------------------------------------------------*/
void SpiceTokNoNewline(void) void SpiceTokNoNewline(void)
{ {
int contline; int contline;
if ((nexttok = strdtok(NULL, WHITESPACE_DELIMITER, NULL)) != NULL) return; if ((nexttok = strdtok0(NULL, WHITESPACE_DELIMITER, NULL, FALSE)) != NULL) return;
while (nexttok == NULL) { while (nexttok == NULL) {
contline = getc(infile); contline = getc(infile);
if (contline == '*') { if (contline == '*') {
char testline = ' ';
while ((testline == ' ') || (testline == '\t'))
testline = getc(infile);
if (testline != '\n') {
ungetc(testline, infile);
GetNextLine(WHITESPACE_DELIMITER); GetNextLine(WHITESPACE_DELIMITER);
SkipNewLine(NULL); SkipNewLine(NULL);
}
continue; continue;
} }
else if (contline != '+') { else if (contline != '+') {
@ -668,6 +685,7 @@ void SpiceSkipNewLine(void)
ungetc(contline, infile); ungetc(contline, infile);
} }
#if 0 /* Commented with "#if 0" due to comment characters in the comment */
/*----------------------------------------------------------------------*/ /*----------------------------------------------------------------------*/
/* Function similar to strtok() for token parsing. The difference is */ /* Function similar to strtok() for token parsing. The difference is */
/* that it takes two sets of delimiters. The first is whitespace */ /* that it takes two sets of delimiters. The first is whitespace */
@ -688,8 +706,9 @@ void SpiceSkipNewLine(void)
/* the first character of the delimiter string in addition to marking */ /* the first character of the delimiter string in addition to marking */
/* the boundary between two-character and one-character delimiters. */ /* the boundary between two-character and one-character delimiters. */
/*----------------------------------------------------------------------*/ /*----------------------------------------------------------------------*/
#endif
char *strdtok(char *pstring, char *delim1, char *delim2) char *strdtok0(char *pstring, char *delim1, char *delim2, char isverilog)
{ {
static char *stoken = NULL; static char *stoken = NULL;
static char *sstring = NULL; static char *sstring = NULL;
@ -734,7 +753,7 @@ char *strdtok(char *pstring, char *delim1, char *delim2)
/* should know whether it is parsing SPICE or verilog and handle the syntax */ /* should know whether it is parsing SPICE or verilog and handle the syntax */
/* accordingly (needs to be done). */ /* accordingly (needs to be done). */
if (*s == '\\') { if (isverilog && (*s == '\\')) {
s++; s++;
while (*s != '\0') { while (*s != '\0') {
if ((*s == ' ') || ((*s == '\\') && (*(s + 1) == '\0'))) { if ((*s == ' ') || ((*s == '\\') && (*(s + 1) == '\0'))) {
@ -805,6 +824,17 @@ char *strdtok(char *pstring, char *delim1, char *delim2)
return sstring; return sstring;
} }
/*----------------------------------------------------------------------*/
/* strdtok() is the original string tokenizer. It calls strdtok0() */
/* with isverilog=TRUE, so that tokens are parsed as (potentially) */
/* verilog names, which includes verilog backslash notation. */
/*----------------------------------------------------------------------*/
char *strdtok(char *pstring, char *delim1, char *delim2)
{
return strdtok0(pstring, delim1, delim2, TRUE);
}
/*----------------------------------------------------------------------*/ /*----------------------------------------------------------------------*/
void InputParseError(FILE *f) void InputParseError(FILE *f)

View File

@ -36,6 +36,7 @@ extern struct hashdict *definitions;
extern char *nexttok; extern char *nexttok;
#define SKIPTO(a) do {SkipTok(NULL);} while (!match(nexttok,a)) #define SKIPTO(a) do {SkipTok(NULL);} while (!match(nexttok,a))
extern char *strdtok0(char *pstring, char *delim1, char *delim2, char isverilog);
extern char *strdtok(char *pstring, char *delim1, char *delim2); extern char *strdtok(char *pstring, char *delim1, char *delim2);
extern char *GetLineAtTok(); extern char *GetLineAtTok();
extern void SkipTok(char *delimiter); extern void SkipTok(char *delimiter);

View File

@ -25,6 +25,8 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> /* for strtof() */ #include <stdlib.h> /* for strtof() */
#include <stdarg.h> #include <stdarg.h>
#include <string.h>
#include <strings.h>
#include <ctype.h> /* toupper() */ #include <ctype.h> /* toupper() */
#ifdef IBMPC #ifdef IBMPC
#include <alloc.h> #include <alloc.h>
@ -300,6 +302,8 @@ int ReduceOneExpression(struct valuelist *kv, struct objlist *parprops,
tstr = sstr - 1; tstr = sstr - 1;
numlast = 1; numlast = 1;
} }
/* But might not be. . . */
if ((dval != 0) || (sstr > estr))
break; break;
} }
/* Not a number, so must be arithmetic */ /* Not a number, so must be arithmetic */
@ -320,6 +324,8 @@ int ReduceOneExpression(struct valuelist *kv, struct objlist *parprops,
tstr = sstr - 1; tstr = sstr - 1;
numlast = 1; numlast = 1;
} }
/* But might not be. . . */
if ((dval != 0) || (sstr > estr))
break; break;
} }
/* Not a number, so must be arithmetic */ /* Not a number, so must be arithmetic */
@ -2244,7 +2250,10 @@ int PromoteProperty(struct property *prop, struct valuelist *vl,
if (prop == NULL || vl == NULL) return -1; if (prop == NULL || vl == NULL) return -1;
if (prop->type == vl->type) return 1; /* Nothing to do */ if (prop->type == vl->type) return 1; /* Nothing to do */
result = 0; result = 0;
if (prop->type == PROP_EXPRESSION) { /* If vl is an expression but prop is not, then try to reduce
* the expression in vl.
*/
if (vl->type == PROP_EXPRESSION) {
ReduceOneExpression(vl, ob, tc, FALSE); ReduceOneExpression(vl, ob, tc, FALSE);
} }
switch (prop->type) { switch (prop->type) {
@ -3090,7 +3099,7 @@ void add_balancing_close(struct objlist *ob1, struct objlist *ob2)
for (nob = ob1->next; nob && nob->type != FIRSTPIN; nob = nob->next) for (nob = ob1->next; nob && nob->type != FIRSTPIN; nob = nob->next)
if (nob->type == PROPERTY) if (nob->type == PROPERTY)
break; break;
if (nob->type != PROPERTY) return; // shouldn't happen if (nob == NULL || nob->type != PROPERTY) return; // shouldn't happen
opentags = 0; opentags = 0;
for (; nob->next && nob->next->type == PROPERTY; nob = nob->next) { for (; nob->next && nob->next->type == PROPERTY; nob = nob->next) {
@ -3640,7 +3649,7 @@ int CombineSeries(char *model, int file)
nob->type = PROPERTY; nob->type = PROPERTY;
nob->name = strsave("properties"); nob->name = strsave("properties");
nob->node = -2; /* Don't report as disconnected node */ nob->node = -2; /* Don't report as disconnected node */
nob->model.class = (obp->model.class == NULL) ? NULL : nob->model.class = (obp == NULL || obp->model.class == NULL) ? NULL :
strsave(obp->model.class); strsave(obp->model.class);
nob->instance.props = NewPropValue(2); nob->instance.props = NewPropValue(2);

View File

@ -223,12 +223,35 @@ int matchnocase(char *st1, char *st2)
{ {
char *sp1 = st1; char *sp1 = st1;
char *sp2 = st2; char *sp2 = st2;
char v1 = FALSE, v2 = FALSE;
/* In case of a property that does not exist in one netlist, matchnocase()
* may be passed a null value, so return 0 to indicate a non-match.
* *Both* values null will also be treated as a mismatch (debatable
* behavior).
*/
if (!sp1 || !sp2) return 0;
/* Verilog back-slash escaped names should match an equivalent non-
* back-slashed name. (NOTE: This behavior needs to be added to match().)
*/
if ((*sp1 == '\\') && (*sp2 != '\\')) {
v1 = TRUE;
sp1++;
}
if ((*sp2 == '\\') && (*sp1 != '\\')) {
v2 = TRUE;
sp2++;
}
while (*sp1 != '\0' && *sp2 != '\0') { while (*sp1 != '\0' && *sp2 != '\0') {
if (to_lower[*sp1] != to_lower[*sp2]) break; if (to_lower[*sp1] != to_lower[*sp2]) break;
sp1++; sp1++;
sp2++; sp2++;
} }
if (v1 && (*sp1 == ' ')) sp1++;
if (v2 && (*sp2 == ' ')) sp2++;
if ((*sp1 != '\0') || (*sp2 != '\0')) return 0; if ((*sp1 != '\0') || (*sp2 != '\0')) return 0;
return 1; return 1;
} }
@ -259,6 +282,33 @@ int matchfilenocase(char *st1, char *st2, int f1, int f2)
return 1; return 1;
} }
/* Delimiter matching---Find an opening delimiter in a string. */
/* Return the position of the first opening delimeter in the string, */
/* like strchr(). Place the actual delimeter character in *delim. */
char *get_array_delimiter(char *name, char *delim)
{
char *stest = name;
while (*stest != '\0')
{
if (to_lower[*stest] == '<') {
*delim = *stest;
return stest;
}
stest++;
}
return NULL;
}
/* Delimiter parsing---Check if a character is an opening array delimiter. */
/* Return TRUE if the character is an opening delimiter, FALSE if not. */
int is_delimiter(char testc)
{
return (to_lower[testc] == '<') ? TRUE : FALSE;
}
#ifdef HAVE_MALLINFO #ifdef HAVE_MALLINFO
void PrintMemoryStats(void) void PrintMemoryStats(void)
{ {
@ -426,6 +476,7 @@ int removeshorted(struct hashlist *p, int file)
ob = nob; ob = nob;
} }
} }
return 1;
} }
/* Remove shorted instances of class "class" from the database */ /* Remove shorted instances of class "class" from the database */
@ -516,6 +567,7 @@ int deleteclass(struct hashlist *p, int file)
} }
} }
FREE(checknodes); FREE(checknodes);
return 1;
} }
/* Remove all instances of class "class" from the database */ /* Remove all instances of class "class" from the database */
@ -553,6 +605,7 @@ int renameinstances(struct hashlist *p, int file)
} }
} }
} }
return 1;
} }
void InstanceRename(char *from, char *to, int file) void InstanceRename(char *from, char *to, int file)
@ -575,9 +628,10 @@ int freeprop(struct hashlist *p)
struct property *prop; struct property *prop;
prop = (struct property *)(p->ptr); prop = (struct property *)(p->ptr);
if (prop->type == PROP_STRING) if (prop->type == PROP_STRING) {
if (prop->pdefault.string != NULL) if (prop->pdefault.string != NULL)
FREE(prop->pdefault.string); FREE(prop->pdefault.string);
}
else if (prop->type == PROP_EXPRESSION) { else if (prop->type == PROP_EXPRESSION) {
struct tokstack *stackptr, *nptr; struct tokstack *stackptr, *nptr;
stackptr = prop->pdefault.stack; stackptr = prop->pdefault.stack;
@ -633,7 +687,7 @@ static int PrintCellHashTableElement(struct hashlist *p)
ptr = (struct nlist *)(p->ptr); ptr = (struct nlist *)(p->ptr);
if ((TopFile >= 0) && (ptr->file != TopFile)) return 1; if ((TopFile >= 0) && (ptr->file != TopFile)) return 1;
if (ptr->class != CLASS_SUBCKT) { if ((ptr->class != CLASS_SUBCKT) && (ptr->class != CLASS_MODULE)) {
/* only print primitive cells if Debug is enabled */ /* only print primitive cells if Debug is enabled */
if (Debug == 1) Printf("Cell: %s (instanced %d times); Primitive\n", if (Debug == 1) Printf("Cell: %s (instanced %d times); Primitive\n",
ptr->name, ptr->number); ptr->name, ptr->number);

View File

@ -309,6 +309,8 @@ extern int match(char *, char *);
extern int matchnocase(char *, char *); extern int matchnocase(char *, char *);
extern int matchfile(char *, char *, int, int); extern int matchfile(char *, char *, int, int);
extern int matchfilenocase(char *, char *, int, int); extern int matchfilenocase(char *, char *, int, int);
extern int is_delimiter(char);
extern char *get_array_delimiter(char *, char *);
extern void GarbageCollect(void); extern void GarbageCollect(void);
extern void InitGarbageCollection(void); extern void InitGarbageCollection(void);

View File

@ -319,7 +319,7 @@ void Fanout(char *cell, char *node, int filter)
while (ob != NULL) { while (ob != NULL) {
char *obname = ob->name; char *obname = ob->name;
if (*obname == '/') obname++; if (*obname == '/') obname++;
if (ob->node == nodenum) if (ob->node == nodenum) {
if (filter == ALLOBJECTS) { if (filter == ALLOBJECTS) {
Printf(" %s (", obname); Printf(" %s (", obname);
PrintObjectType(ob->type); PrintObjectType(ob->type);
@ -331,6 +331,7 @@ void Fanout(char *cell, char *node, int filter)
else if (ob->type == filter) { else if (ob->type == filter) {
Printf(" %s\n", obname); Printf(" %s\n", obname);
} }
}
ob = ob->next; ob = ob->next;
} }
} }
@ -933,7 +934,7 @@ static int PrintLeavesInCellHash(struct hashlist *p)
struct nlist *ptr; struct nlist *ptr;
ptr = (struct nlist *)(p->ptr); ptr = (struct nlist *)(p->ptr);
if ((ptr->class == CLASS_SUBCKT)) PrintLeavesInCell(ptr->name, ptr->file); if (ptr->class == CLASS_SUBCKT) PrintLeavesInCell(ptr->name, ptr->file);
return(0); return(0);
} }

View File

@ -21,6 +21,9 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "config.h" #include "config.h"
#include <stdio.h> #include <stdio.h>
#include <string.h>
#include <strings.h>
#include <ctype.h>
#if 0 #if 0
#include <stdarg.h> /* what about varargs, like in pdutils.c ??? */ #include <stdarg.h> /* what about varargs, like in pdutils.c ??? */
#endif #endif
@ -43,6 +46,7 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "print.h" #include "print.h"
#include "query.h" #include "query.h"
#include "objlist.h" #include "objlist.h"
#include "netcmp.h"
// Global storage for parameters from .PARAM // Global storage for parameters from .PARAM
struct hashdict spiceparams; struct hashdict spiceparams;
@ -192,7 +196,7 @@ void SpiceSubCell(struct nlist *tp, int IsSubCell)
if (ob->type == PROPERTY) { if (ob->type == PROPERTY) {
struct valuelist *vl; struct valuelist *vl;
int i; int i;
for (i == 0;; i++) { for (i = 0;; i++) {
vl = &(ob->instance.props[i]); vl = &(ob->instance.props[i]);
if (vl->type == PROP_ENDLIST) break; if (vl->type == PROP_ENDLIST) break;
else if (vl->type == PROP_VALUE) { else if (vl->type == PROP_VALUE) {
@ -212,7 +216,7 @@ void SpiceSubCell(struct nlist *tp, int IsSubCell)
if (ob->type == PROPERTY) { if (ob->type == PROPERTY) {
struct valuelist *vl; struct valuelist *vl;
int i; int i;
for (i == 0;; i++) { for (i = 0;; i++) {
vl = &(ob->instance.props[i]); vl = &(ob->instance.props[i]);
if (vl->type == PROP_ENDLIST) break; if (vl->type == PROP_ENDLIST) break;
else if (vl->type == PROP_VALUE) { else if (vl->type == PROP_VALUE) {
@ -232,7 +236,7 @@ void SpiceSubCell(struct nlist *tp, int IsSubCell)
if (ob->type == PROPERTY) { if (ob->type == PROPERTY) {
struct valuelist *vl; struct valuelist *vl;
int i; int i;
for (i == 0;; i++) { for (i = 0;; i++) {
vl = &(ob->instance.props[i]); vl = &(ob->instance.props[i]);
if (vl->type == PROP_ENDLIST) break; if (vl->type == PROP_ENDLIST) break;
else if (vl->type == PROP_VALUE) { else if (vl->type == PROP_VALUE) {
@ -395,7 +399,7 @@ int renamepins(struct hashlist *p, int file)
ptr = (struct nlist *)(p->ptr); ptr = (struct nlist *)(p->ptr);
if (ptr->file != file) if (ptr->file != file)
return 1; return 0;
for (ob = ptr->cell; ob != NULL; ob = ob->next) { for (ob = ptr->cell; ob != NULL; ob = ob->next) {
if (ob->type == FIRSTPIN) { if (ob->type == FIRSTPIN) {
@ -422,6 +426,7 @@ int renamepins(struct hashlist *p, int file)
} }
} }
} }
return 1;
} }
/* If any pins are marked unconnected, see if there are */ /* If any pins are marked unconnected, see if there are */
@ -519,7 +524,7 @@ void ReadSpiceFile(char *fname, int filenum, struct cellstack **CellStackPtr,
char *eqptr, devtype, in_subckt; char *eqptr, devtype, in_subckt;
struct keyvalue *kvlist = NULL; struct keyvalue *kvlist = NULL;
char inst[MAX_STR_LEN], model[MAX_STR_LEN], instname[MAX_STR_LEN]; char inst[MAX_STR_LEN], model[MAX_STR_LEN], instname[MAX_STR_LEN];
struct nlist *tp; struct nlist *tp, *tpsave;
struct objlist *parent, *sobj, *nobj, *lobj, *pobj; struct objlist *parent, *sobj, *nobj, *lobj, *pobj;
inst[MAX_STR_LEN-1] = '\0'; inst[MAX_STR_LEN-1] = '\0';
@ -531,8 +536,14 @@ void ReadSpiceFile(char *fname, int filenum, struct cellstack **CellStackPtr,
SkipTok(NULL); /* get the next token */ SkipTok(NULL); /* get the next token */
if ((EndParseFile()) && (nexttok == NULL)) break; if ((EndParseFile()) && (nexttok == NULL)) break;
if (nexttok == NULL) break;
if (nexttok[0] == '*') SkipNewLine(NULL); /* Handle comment lines. Note that some variants of CDL format
* use "*." for information that is transparent to SPICE simulators.
* Handle "*.GLOBAL" entries. All others are ignored.
*/
if ((nexttok[0] == '*') && (!matchnocase(nexttok, "*.GLOBAL")))
SkipNewLine(NULL);
else if (matchnocase(nexttok, ".SUBCKT")) { else if (matchnocase(nexttok, ".SUBCKT")) {
SpiceTokNoNewline(); SpiceTokNoNewline();
@ -557,6 +568,7 @@ void ReadSpiceFile(char *fname, int filenum, struct cellstack **CellStackPtr,
snprintf(model, MAX_STR_LEN-1, "%s", nexttok); snprintf(model, MAX_STR_LEN-1, "%s", nexttok);
tp = LookupCellFile(nexttok, filenum); tp = LookupCellFile(nexttok, filenum);
tpsave = NULL;
/* Check for name conflict with duplicate cell names */ /* Check for name conflict with duplicate cell names */
/* This may mean that the cell was used before it was */ /* This may mean that the cell was used before it was */
@ -595,12 +607,47 @@ void ReadSpiceFile(char *fname, int filenum, struct cellstack **CellStackPtr,
tp = LookupCellFile(nexttok, filenum); tp = LookupCellFile(nexttok, filenum);
} }
else if (tp != NULL) { /* Make a new definition for an empty cell */ else if (tp != NULL) { /* Make a new definition for an empty cell */
/* Handle issue with SPICE read after verilog, where a placeholder
* was created from the verilog. (1) If the pin names are "1", "2",
* "3", then this is a SPICE placeholder, and just remove the CellDef
* and re-create it. Otherwise, create new cell "_PLACEHOLDER_".
* (2) After encountering .ends, run MatchPins between the two cells.
* (3) delete the original cell and rename the new cell.
*/
int i = 1;
char pname[10];
for (pobj = tp->cell; pobj && pobj->type == PORT; pobj = pobj->next) {
sprintf(pname, "%d", i);
if (!matchnocase(pobj->name, pname)) break;
i++;
}
if ((pobj == NULL) || (pobj->type != PORT)) {
/* This is a SPICE placeholder created because the cell was instanced
* before it was defined. However, the pins can be assumed to be in
* the correct order, and pin reordering does not need to be done.
*/
FreePorts(nexttok); FreePorts(nexttok);
CellDelete(nexttok, filenum); /* This removes any PLACEHOLDER flag */ CellDelete(nexttok, filenum); /* This removes any PLACEHOLDER flag */
CellDef(model, filenum); CellDef(model, filenum);
tp = LookupCellFile(model, filenum); tp = LookupCellFile(model, filenum);
update = 1; /* Will need to update existing instances */ update = 1; /* Will need to update existing instances */
} }
else {
/* This is (probably) a verilog placeholder created because the
* verilog was read before the (SPICE) definitions. The verilog
* netlist should have named the pins of the parent cell. However,
* there is no guarantee the order of pins is correct. The MatchPins()
* routine from netcmp.c can be used here to match the cell against
* the placeholder, and reorder the pins in all instances to match.
* Note that we cannot just reorder the SPICE pins to match the
* verilog order, because there may be other SPICE netlists which
* instance the cell with the correct SPICE port order.
*/
tpsave = tp;
CellDef("_PLACEHOLDER_", filenum);
tp = LookupCellFile("_PLACEHOLDER_", filenum);
}
}
else if (tp == NULL) { /* Completely new cell, no name conflict */ else if (tp == NULL) { /* Completely new cell, no name conflict */
CellDef(model, filenum); CellDef(model, filenum);
tp = LookupCellFile(model, filenum); tp = LookupCellFile(model, filenum);
@ -691,6 +738,38 @@ skip_ends:
if (*CellStackPtr) PopStack(CellStackPtr); if (*CellStackPtr) PopStack(CellStackPtr);
if (*CellStackPtr) ReopenCellDef((*CellStackPtr)->cellname, filenum); if (*CellStackPtr) ReopenCellDef((*CellStackPtr)->cellname, filenum);
SkipNewLine(NULL); SkipNewLine(NULL);
if (tpsave != NULL) {
struct nlist *tpplace;
char *savename;
/* Handle a placeholder from a verilog file that has been replaced
* by a netlist with pins in a different order. The pins need to
* be matched, corrected in the original cell and all instances,
* and the new cell deleted.
*/
Printf("Verilog placeholder %s replaced by SPICE definition\n",
tpsave->name);
tpplace = LookupCellFile("_PLACEHOLDER_", filenum);
/* MatchPins is part of netcmp and normally Circuit2 is the
* circuit being matched, so set Circuit2 to the original
* verilog black-box cell, and MatchPins() will force its
* pins to be rearranged to match the SPICE definition just
* read.
*/
Circuit2 = tpsave;
MatchPins(tpplace, tpsave, 0);
savename = strsave(tpsave->name);
/* Now the original verilog black-box cell can be removed */
FreePorts(savename);
CellDelete(savename, filenum);
/* And _PLACEHOLDER_ is renamed to the original name of the cell. */
CellRehash("_PLACEHOLDER_", savename, filenum);
tpsave = NULL;
Circuit2 = NULL;
FREE(savename);
}
} }
else if (matchnocase(nexttok, ".MODEL")) { else if (matchnocase(nexttok, ".MODEL")) {
unsigned char class = CLASS_SUBCKT; unsigned char class = CLASS_SUBCKT;
@ -752,7 +831,10 @@ skip_ends:
// Handle some commonly-used cards // Handle some commonly-used cards
else if (matchnocase(nexttok, ".GLOBAL")) { /* .GLOBAL and *.GLOBAL. Note that *.GLOBAL is excepted from comment-line
* handling, above, so any line starting with '*' is "*.GLOBAL".
*/
else if (matchnocase(nexttok, ".GLOBAL") || (nexttok[0] == '*')) {
while (nexttok != NULL) { while (nexttok != NULL) {
int numnodes = 0; int numnodes = 0;
SpiceTokNoNewline(); SpiceTokNoNewline();
@ -1701,10 +1783,19 @@ skip_ends:
if (scan->next != NULL) scan = scan->next; if (scan->next != NULL) scan = scan->next;
tail->next = NULL; tail->next = NULL;
/* Check for class defined inside itself (self-referential loop) */
if (!strcasecmp(model, scan->name)) {
Fprintf(stderr, "Fatal: Class \"%s\" is instanced inside of itself!\n",
scan->name);
InputParseError(stderr);
return;
}
/* Check for ignored class */ /* Check for ignored class */
if ((itype = IsIgnored(subcktname, filenum)) == IGNORE_CLASS) { if ((itype = IsIgnored(scan->name, filenum)) == IGNORE_CLASS) {
Printf("Class '%s' instanced in input but is being ignored.\n", model); Printf("Class '%s' instanced in input but is being ignored.\n", scan->name);
return; return;
} }
@ -1719,7 +1810,7 @@ skip_ends:
break; break;
} }
if (shorted == (unsigned char)1) { if (shorted == (unsigned char)1) {
Printf("Instance of '%s' is shorted, ignoring.\n", subcktname); Printf("Instance of '%s' is shorted, ignoring.\n", scan->name);
while (head) { while (head) {
p = head->next; p = head->next;
FREE(head); FREE(head);

View File

@ -57,6 +57,7 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "netfile.h" #include "netfile.h"
#include "print.h" #include "print.h"
#include "hash.h" #include "hash.h"
#include "netcmp.h"
// See netfile.c for explanation of delimiters. 'X' // See netfile.c for explanation of delimiters. 'X'
// separates single-character delimiters from two-character delimiters. // separates single-character delimiters from two-character delimiters.
@ -75,7 +76,8 @@ struct hashdict verilogparams;
// Global storage for verilog definitions // Global storage for verilog definitions
struct hashdict verilogdefs; struct hashdict verilogdefs;
// Record file pointer that is associated with the hash tables // Record file pointer that is associated with the hash tables
int hashfile = -1; int hashfilep = -1; /* for parameters */
int hashfiled = -1; /* for definitions */
// Global storage for wire buses // Global storage for wire buses
struct hashdict buses; struct hashdict buses;
@ -155,7 +157,8 @@ struct expr_stack {
//------------------------------------------------------------------------- //-------------------------------------------------------------------------
// Evaluate an expression for an array bound. This is much like // Evaluate an expression for an array bound. This is much like
// ReduceOneExpression() in netgen.c, but only handles basic integer // ReduceOneExpression() in netgen.c, but only handles basic integer
// arithmetic (+,-,*,/) and grouping by parentheses. // arithmetic (+,-,*,/), grouping by parentheses, bit shifts, and
// if-else operators.
// //
// Returns 1 if successful, 0 on error. // Returns 1 if successful, 0 on error.
// Evaluated result is placed in the integer pointed to by "valptr". // Evaluated result is placed in the integer pointed to by "valptr".
@ -219,6 +222,39 @@ int EvalExpr(struct expr_stack **stackptr, int *valptr)
} }
} }
/* Reduce (a << b) and (a >> b) */
for (texp = start; texp; texp = texp->next) {
if ((texp->last != NULL) && (texp->next != NULL) && (texp->oper != '\0')) {
if ((texp->last->oper == '\0') && (texp->next->oper == '\0')) {
if (texp->oper == '<') {
/* Left shift */
texp->last->value <<= texp->next->value;
/* Remove two items from the stack */
tmp = texp;
texp = texp->last;
texp->next = tmp->next->next;
if (tmp->next->next) tmp->next->next->last = texp;
FREE(tmp->next);
FREE(tmp);
modified = TRUE;
}
if (texp->oper == '>') {
/* Right shift */
texp->last->value >>= texp->next->value;
/* Remove two items from the stack */
tmp = texp;
texp = texp->last;
texp->next = tmp->next->next;
if (tmp->next->next) tmp->next->next->last = texp;
FREE(tmp->next);
FREE(tmp);
modified = TRUE;
}
}
}
}
/* Reduce (a * b) and (a / b) */ /* Reduce (a * b) and (a / b) */
for (texp = start; texp; texp = texp->next) { for (texp = start; texp; texp = texp->next) {
@ -294,6 +330,39 @@ int EvalExpr(struct expr_stack **stackptr, int *valptr)
} }
} }
/* Reduce (a ? b : c) */
for (texp = start; texp; texp = texp->next) {
/* There must be at least five objects on the stack */
if ((texp->last != NULL) && (texp->next != NULL) && (texp->oper != '\0')
&& (texp->next->next != NULL)
&& (texp->next->next->next != NULL)) {
if ((texp->last->oper == '\0') && (texp->next->oper == '\0')
&& (texp->next->next->next->oper == '\0')) {
if ((texp->oper == '?') && (texp->next->next->oper == ':')) {
/* If-Else conditional */
if (texp->last->value)
texp->last->value = texp->next->value;
else
texp->last->value = texp->next->next->next->value;
/* Remove four items from the stack */
tmp = texp;
texp = texp->last;
texp->next = tmp->next->next->next->next;
if (tmp->next->next->next->next)
tmp->next->next->next->next->last = texp;
FREE(tmp->next->next->next);
FREE(tmp->next->next);
FREE(tmp->next);
FREE(tmp);
modified = TRUE;
}
}
}
}
/* Reduce (a) */ /* Reduce (a) */
for (texp = start; texp; texp = texp->next) { for (texp = start; texp; texp = texp->next) {
@ -372,8 +441,15 @@ int ParseIntegerExpression(char *expr, int *iptr)
if (match(sptr, "+") || match(sptr, "-") if (match(sptr, "+") || match(sptr, "-")
|| match(sptr, "*") || match(sptr, "/") || match(sptr, "*") || match(sptr, "/")
|| match(sptr, "(") || match(sptr, ")")) { || match(sptr, "(") || match(sptr, ")")
|| match(sptr, "<<") || match(sptr, ">>")
|| match(sptr, "?") || match(sptr, ":")) {
newexp = (struct expr_stack *)MALLOC(sizeof(struct expr_stack)); newexp = (struct expr_stack *)MALLOC(sizeof(struct expr_stack));
/* Note that "oper" is one character and that "<<" and ">>"
* become '<' and '>', respectively. The less-than and greater-
* than operators are not (yet) handled but will need to be
* recast to some other character in "oper".
*/
newexp->oper = *sptr; newexp->oper = *sptr;
newexp->value = 0; newexp->value = 0;
newexp->next = NULL; newexp->next = NULL;
@ -388,7 +464,7 @@ int ParseIntegerExpression(char *expr, int *iptr)
if ((result = sscanf(sptr, "%d", &value)) != 1) { if ((result = sscanf(sptr, "%d", &value)) != 1) {
// Is name in the parameter list? // Is name in the parameter list?
kl = (struct property *)HashLookup(nexttok, &verilogparams); kl = (struct property *)HashLookup(sptr, &verilogparams);
if (kl == NULL) { if (kl == NULL) {
Printf("Value %s in expression is not a number or a parameter.\n", Printf("Value %s in expression is not a number or a parameter.\n",
sptr); sptr);
@ -401,27 +477,29 @@ int ParseIntegerExpression(char *expr, int *iptr)
if (result != 1) { if (result != 1) {
Printf("Parameter %s has value %s that cannot be parsed" Printf("Parameter %s has value %s that cannot be parsed"
" as an integer.\n", " as an integer.\n",
nexttok, kl->pdefault.string); sptr, kl->pdefault.string);
value = 0; value = 0;
break; break;
} }
} }
else if (kl->type == PROP_INTEGER) { else if (kl->type == PROP_INTEGER) {
value = kl->pdefault.ival; value = kl->pdefault.ival;
result = 1; // Assert valid result
} }
else if (kl->type == PROP_DOUBLE) { else if (kl->type == PROP_DOUBLE) {
value = (int)kl->pdefault.dval; value = (int)kl->pdefault.dval;
if ((double)value != kl->pdefault.dval) { if ((double)value != kl->pdefault.dval) {
Printf("Parameter %s has value %g that cannot be parsed" Printf("Parameter %s has value %g that cannot be parsed"
" as an integer.\n", " as an integer.\n",
nexttok, kl->pdefault.dval); sptr, kl->pdefault.dval);
value = 0; value = 0;
break; break;
} }
result = 1; // Assert valid result
} }
else { else {
Printf("Parameter %s has unknown type; don't know how" Printf("Parameter %s has unknown type; don't know how"
" to parse.\n", nexttok); " to parse.\n", sptr);
value = 0; value = 0;
break; break;
} }
@ -515,7 +593,8 @@ int GetBusTok(struct bus *wb)
} }
else if (match(nexttok, "+") || match(nexttok, "-") else if (match(nexttok, "+") || match(nexttok, "-")
|| match(nexttok, "*") || match(nexttok, "/") || match(nexttok, "*") || match(nexttok, "/")
|| match(nexttok, "(") || match(nexttok, ")")) { || match(nexttok, "(") || match(nexttok, ")")
|| match(nexttok, "<<") || match(nexttok, ">>")) {
newexp = (struct expr_stack *)MALLOC(sizeof(struct expr_stack)); newexp = (struct expr_stack *)MALLOC(sizeof(struct expr_stack));
newexp->oper = *nexttok; newexp->oper = *nexttok;
newexp->value = 0; newexp->value = 0;
@ -716,10 +795,12 @@ int GetBus(char *astr, struct bus *wb)
return 0; return 0;
} }
//--------------------------------------------------------------------
// Output a Verilog Module. Note that since Verilog does not describe // Output a Verilog Module. Note that since Verilog does not describe
// low-level devices like transistors, capacitors, etc., then this // low-level devices like transistors, capacitors, etc., then this
// format is limited to black-box subcircuits. Cells containing any // format is limited to black-box subcircuits. Cells containing any
// such low-level devices are ignored. // such low-level devices are ignored.
//--------------------------------------------------------------------
void VerilogModule(struct nlist *tp) void VerilogModule(struct nlist *tp)
{ {
@ -1018,7 +1099,7 @@ void ReadVerilogFile(char *fname, int filenum, struct cellstack **CellStackPtr,
char *eqptr, *matchptr; char *eqptr, *matchptr;
struct keyvalue *kvlist = NULL; struct keyvalue *kvlist = NULL;
char inst[MAX_STR_LEN], model[MAX_STR_LEN], portname[MAX_STR_LEN], pkey[MAX_STR_LEN]; char inst[MAX_STR_LEN], model[MAX_STR_LEN], portname[MAX_STR_LEN], pkey[MAX_STR_LEN];
struct nlist *tp; struct nlist *tp, *tpsave;
struct objlist *parent, *sobj, *nobj, *lobj, *pobj, *cref; struct objlist *parent, *sobj, *nobj, *lobj, *pobj, *cref;
inst[MAX_STR_LEN-1] = '\0'; inst[MAX_STR_LEN-1] = '\0';
@ -1152,6 +1233,7 @@ void ReadVerilogFile(char *fname, int filenum, struct cellstack **CellStackPtr,
snprintf(model, MAX_STR_LEN-1, "%s", nexttok); snprintf(model, MAX_STR_LEN-1, "%s", nexttok);
tp = LookupCellFile(nexttok, filenum); tp = LookupCellFile(nexttok, filenum);
tpsave = NULL;
hasports = (char)0; hasports = (char)0;
/* Check for name conflict with duplicate cell names */ /* Check for name conflict with duplicate cell names */
@ -1191,35 +1273,9 @@ void ReadVerilogFile(char *fname, int filenum, struct cellstack **CellStackPtr,
tp = LookupCellFile(nexttok, filenum); tp = LookupCellFile(nexttok, filenum);
} }
else if (tp != NULL) { /* Cell exists, but as a placeholder */ else if (tp != NULL) { /* Cell exists, but as a placeholder */
struct nlist *tptmp = NULL; tpsave = tp;
char ctemp[8]; CellDef("_PLACEHOLDER_", filenum);
int n = 0; tp = LookupCellFile("_PLACEHOLDER_", filenum);
/* This redefines a placeholder module to an unused temporary cell name */
while (1) {
sprintf(ctemp, "%d", n);
tptmp = LookupCellFile(ctemp, filenum);
if (tptmp == NULL) break;
n++;
}
CellRehash(nexttok, ctemp, filenum);
tptmp = LookupCellFile(ctemp, filenum);
/* Create a new module definition */
CellDef(model, filenum);
tp = LookupCellFile(model, filenum);
/* Find an instance of this module in the netlist */
cref = FindInstanceOf(tp);
if ((cref != NULL) && (cref->name != NULL)) {
hasports = (char)1;
/* Copy ports from the original parent cell to the new parent cell */
for (pobj = tptmp->cell; pobj && (pobj->type == PORT); pobj = pobj->next)
Port(pobj->name);
}
/* Remove the original cell definition */
FreePorts(ctemp);
CellDelete(ctemp, filenum); /* This removes any PLACEHOLDER flag */
} }
else if (tp == NULL) { /* Completely new cell, no name conflict */ else if (tp == NULL) { /* Completely new cell, no name conflict */
CellDef(model, filenum); CellDef(model, filenum);
@ -1428,6 +1484,93 @@ skip_endmodule:
if (*CellStackPtr) PopStack(CellStackPtr); if (*CellStackPtr) PopStack(CellStackPtr);
if (*CellStackPtr) ReopenCellDef((*CellStackPtr)->cellname, filenum); if (*CellStackPtr) ReopenCellDef((*CellStackPtr)->cellname, filenum);
SkipNewLine(VLOG_DELIMITERS); SkipNewLine(VLOG_DELIMITERS);
if (tpsave != NULL) {
struct nlist *tpplace;
char *savename;
int lnum, pnum, ltest;
unsigned char valid;
struct objlist *lobj, *pobj;
/* Handle a placeholder from a verilog file that has been replaced
* by a netlist with pins in a different order. The pins need to
* be matched, corrected in the original cell and all instances,
* and the new cell deleted.
*/
Printf("Verilog placeholder module %s replaced by module definition\n",
tpsave->name);
tpplace = LookupCellFile("_PLACEHOLDER_", filenum);
/* If tpsave was generated from an instance in a SPICE netlist that
* did not have a black-box subcircuit definition, then the pins
* will all be labeled 1, 2, 3, etc. If so, then assume that the
* verilog pins are in order, and rename the placeholder pins.
* If the number of pins does not match, or if the pins are not
* labeled as ascending integers, then leave the cell alone.
* In either case, output a warning message.
*/
/* Get the number of ports in the placeholder */
pnum = 0;
for (pobj = tpplace->cell; pobj; pobj = pobj->next) {
if (pobj->type != PORT) break;
pnum++;
}
/* Get the number of ports in the saved cell and make */
/* sure that it equals the number of ports in the */
/* placeholder, and that all of the ports in the saved */
/* cell are integers in ascending order. */
valid = TRUE;
lnum = 0;
for (lobj = tpsave->cell; lobj; lobj = lobj->next) {
if (lobj->type != PORT) break;
lnum++;
if (sscanf(lobj->name, "%d", &ltest) != 1) break;
if (ltest != lnum) break;
}
if ((lobj != NULL) && (lobj->type == PORT))
valid = FALSE; /* Pins are not integers in ascending order */
if (pnum != lnum) valid = FALSE; /* Different number of pins */
if (valid == TRUE) {
Printf("Replacing pins of placeholder cell %s from cell definition.\n",
tpsave->name);
pobj = tpplace->cell;
for (lobj = tpsave->cell; lobj; lobj = lobj->next) {
if (lobj->type != PORT) break;
if (pobj == NULL) break; /* should not happen */
FREE(lobj->name);
lobj->name = (char *)MALLOC(strlen(pobj->name) + 1);
strcpy(lobj->name, pobj->name);
pobj = pobj->next;
}
}
else {
Printf("Placeholder pins of cell %s are not compatible and"
" will be left unchanged\n", tpsave->name);
}
/* MatchPins is part of netcmp and normally Circuit2 is the
* circuit being matched, so set Circuit2 to the original
* verilog black-box cell, and MatchPins() will force its
* pins to be rearranged to match the module definition just
* read.
*/
Circuit2 = tpsave;
MatchPins(tpplace, tpsave, 0);
savename = strsave(tpsave->name);
/* Now the original verilog black-box cell can be removed */
FreePorts(savename);
CellDelete(savename, filenum);
/* And _PLACEHOLDER_ is renamed to the original name of the cell. */
CellRehash("_PLACEHOLDER_", savename, filenum);
tpsave = NULL;
Circuit2 = NULL;
FREE(savename);
}
} }
else if (match(nexttok, "`include")) { else if (match(nexttok, "`include")) {
@ -1770,8 +1913,41 @@ skip_endmodule:
} }
else { /* "assign" */ else { /* "assign" */
SkipTokComments(VLOG_PIN_CHECK_DELIMITERS); SkipTokComments(VLOG_PIN_CHECK_DELIMITERS);
if (GetBusTok(&wb) == 0) {
char *aptr = strvchr(nexttok, '['); char *aptr = strvchr(nexttok, '[');
/* This is a repeat of code to handle reading of pins, and
* makes sure that all input has been read to the closing
* bracket. There needs to be a single routine to do this,
* or (better) rewrite the parser with lex instead of trying
* to enumerate all the syntax cases separately.
*/
if ((aptr != NULL) && (strvchr(nexttok, ']') == NULL))
{
/* If a bus expressions has whitespace, then concatenate
* to the closing ']'.
*/
char *array_expr = (char *)MALLOC(1);
char *new_array_expr = NULL;
*array_expr = '\0';
/* Read to "]" */
while (nexttok) {
new_array_expr = (char *)MALLOC(strlen(array_expr) +
strlen(nexttok) + 1);
/* Roundabout way to do realloc() becase there is no REALLOC() */
strcpy(new_array_expr, array_expr);
strcat(new_array_expr, nexttok);
FREE(array_expr);
array_expr = new_array_expr;
if (strchr(nexttok, ']')) break;
SkipTokComments(VLOG_PIN_CHECK_DELIMITERS);
}
if (!nexttok) {
Printf("Unterminated array in assignment %s\n", array_expr);
}
}
if (((aptr == NULL) && (GetBusTok(&wb) == 0)) ||
((aptr != NULL) && (GetBus(aptr, &wb) == 0))) {
if (aptr != NULL) { if (aptr != NULL) {
*aptr = '\0'; *aptr = '\0';
/* Find object of first net in bus */ /* Find object of first net in bus */
@ -1789,6 +1965,15 @@ skip_endmodule:
} }
else { else {
lhs = LookupObject(nexttok, CurrentCell); lhs = LookupObject(nexttok, CurrentCell);
/* Handle the case in which an assignment is made
* without first declaring a wire for the signal,
* which is considered valid syntax (patch by
* Sylvain Munaut).
*/
if (lhs == NULL) {
Node(nexttok);
lhs = LookupObject(nexttok, CurrentCell);
}
strcpy(noderoot, nexttok); strcpy(noderoot, nexttok);
} }
SkipTokComments(VLOG_DELIMITERS); SkipTokComments(VLOG_DELIMITERS);
@ -1804,7 +1989,8 @@ skip_endmodule:
// Allowed uses of "assign" for netlists: // Allowed uses of "assign" for netlists:
// "assign a = b" joins two nets. // "assign a = b" joins two nets.
// "assign a = {b, c, ...}" creates a bus from components. // "assign a = {b, c, ...}" creates a bus from components.
// "assign" using any boolean arithmetic is not structural verilog. // "assign" using if-else constructs or bit shifts.
// ("assign" using any other boolean arithmetic is not structural verilog.)
// "assign a = {x{b}}" creates a bus by repeating a component. // "assign a = {x{b}}" creates a bus by repeating a component.
if (nexttok && match(nexttok, "=")) { if (nexttok && match(nexttok, "=")) {
@ -1837,8 +2023,9 @@ skip_endmodule:
break; break;
} }
else { else {
if (GetBusTok(&wb2) == 0) {
char *aptr = strvchr(nexttok, '['); char *aptr = strvchr(nexttok, '[');
if (((aptr == NULL) && (GetBusTok(&wb2) == 0)) ||
((aptr != NULL) && (GetBus(aptr, &wb2) == 0))) {
j = wb2.start; j = wb2.start;
if (aptr != NULL) { if (aptr != NULL) {
*aptr = '\0'; *aptr = '\0';
@ -2064,6 +2251,19 @@ nextinst:
} }
SkipTokComments(VLOG_DELIMITERS); SkipTokComments(VLOG_DELIMITERS);
} }
else if (loop.loopvar != NULL) {
/* Instances created within a generate block for loop have an
* implicit array
*/
int loopval;
struct property *klr;
klr = (struct property *)HashLookup(loop.loopvar, &verilogparams);
loopval = klr->pdefault.ival;
arraystart = arrayend = loopval;
sprintf(instancename + strlen(instancename), "[%d]", loopval);
}
if (match(nexttok, "(")) { if (match(nexttok, "(")) {
char savetok = (char)0; char savetok = (char)0;
@ -2126,7 +2326,19 @@ nextinst:
strcat(new_wire_bundle, nexttok); strcat(new_wire_bundle, nexttok);
FREE(wire_bundle); FREE(wire_bundle);
wire_bundle = new_wire_bundle; wire_bundle = new_wire_bundle;
if (!strcmp(nexttok, "}")) break; if (!strcmp(nexttok, "}"))
{
/* If a "bundle" has only one component, then it is
* not really a bundle and should be treated as a
* single wire.
*/
if (strchr(wire_bundle, ',') == NULL) {
int blen = strlen(wire_bundle + 1) - 1;
memmove(wire_bundle, wire_bundle + 1, blen);
*(wire_bundle + blen) = '\0';
}
break;
}
SkipTokComments(VLOG_PIN_CHECK_DELIMITERS); SkipTokComments(VLOG_PIN_CHECK_DELIMITERS);
} }
if (!nexttok) { if (!nexttok) {
@ -2502,6 +2714,7 @@ nextinst:
char *brackptr; char *brackptr;
int j; int j;
char locinst[MAX_STR_LEN]; char locinst[MAX_STR_LEN];
int arraypos = (arraystart > arrayend) ? arraymax - i : i;
if (i != -1) if (i != -1)
sprintf(locinst, "%s[%d]", instancename, i); sprintf(locinst, "%s[%d]", instancename, i);
@ -2538,7 +2751,8 @@ nextinst:
if (scan == NULL) { if (scan == NULL) {
char localnet[MAX_STR_LEN]; char localnet[MAX_STR_LEN];
/* Assume an implicit unconnected pin */ /* Assume an implicit unconnected pin, unless there are no pins */
if (strcmp(obpinname, "(no pins)")) {
sprintf(localnet, "_noconnect_%d_", localcount++); sprintf(localnet, "_noconnect_%d_", localcount++);
Node(localnet); Node(localnet);
join(localnet, obptr->name); join(localnet, obptr->name);
@ -2546,9 +2760,17 @@ nextinst:
"Note: Implicit pin %s in instance %s of %s in cell %s\n", "Note: Implicit pin %s in instance %s of %s in cell %s\n",
obpinname, locinst, modulename, CurrentCell->name); obpinname, locinst, modulename, CurrentCell->name);
} }
}
else if (GetBus(scan->net, &wb) == 0) { else if (GetBus(scan->net, &wb) == 0) {
char *bptr2; char *bptr2;
char *scanroot; char *scanroot;
int isbundle = FALSE;
/* Skip over a bundle delimiter */
if (*scan->net == '{') {
scanroot = strsave(scan->net + 1);
isbundle = TRUE;
}
else
scanroot = strsave(scan->net); scanroot = strsave(scan->net);
brackptr = strvchr(scanroot, '['); brackptr = strvchr(scanroot, '[');
if (brackptr) *brackptr = '\0'; if (brackptr) *brackptr = '\0';
@ -2582,6 +2804,7 @@ nextinst:
else { else {
// Instance must be an array // Instance must be an array
char netname[MAX_STR_LEN]; char netname[MAX_STR_LEN];
char *spos = scanroot;
int slice, portlen, siglen; int slice, portlen, siglen;
/* Get the array size of the port for bit slicing */ /* Get the array size of the port for bit slicing */
@ -2593,6 +2816,26 @@ nextinst:
if (siglen < 0) siglen = -siglen; if (siglen < 0) siglen = -siglen;
siglen++; siglen++;
// If this is a bundle, then count out to the current
// slice and read off the index. NOTE: Need to
// handle multiple bits per bundle entry!
if (isbundle) {
int j;
if (brackptr) *brackptr = '[';
for (j = 0; j < arraypos * portlen; j++) {
spos = strvchr(spos, ',');
if (spos == NULL) break;
spos++;
}
if (spos != NULL) {
brackptr = strvchr(spos, '[');
*brackptr = '\0';
sscanf(brackptr + 1, "%d", &slice);
}
else spos = scanroot; /* should emit an error here */
}
else { /* not a bundle */
// If signal array is smaller than the portlength * // If signal array is smaller than the portlength *
// length of instance array, then the signal wraps. // length of instance array, then the signal wraps.
@ -2612,8 +2855,10 @@ nextinst:
slice = wb.start + (arraystart + i) * portlen; slice = wb.start + (arraystart + i) * portlen;
while (slice > wb2.end) slice -= siglen; while (slice > wb2.end) slice -= siglen;
} }
spos = scanroot;
}
sprintf(netname, "%s[%d]", scanroot, slice); sprintf(netname, "%s[%d]", spos, slice);
if (LookupObject(netname, CurrentCell) == NULL) Node(netname); if (LookupObject(netname, CurrentCell) == NULL) Node(netname);
join(netname, obptr->name); join(netname, obptr->name);
} }
@ -2798,18 +3043,25 @@ char *ReadVerilogTop(char *fname, int *fnum, int blackbox)
hashfunc = hashcase; hashfunc = hashcase;
} }
if ((hashfile != -1) && (hashfile != *fnum)) { if ((hashfilep != -1) && (hashfilep != *fnum)) {
/* Started a new file, so remove all the parameters and definitions */ /* Started a new file, so remove all the parameters */
RecurseHashTable(&verilogparams, freeprop); RecurseHashTable(&verilogparams, freeprop);
HashKill(&verilogparams); HashKill(&verilogparams);
hashfilep = -1;
}
if ((hashfiled != -1) && (hashfiled != *fnum)) {
/* Started a new file, so remove all the definitions */
RecurseHashTable(&verilogdefs, freeprop); RecurseHashTable(&verilogdefs, freeprop);
HashKill(&verilogdefs); HashKill(&verilogdefs);
hashfile = -1; hashfiled = -1;
} }
if (hashfile == -1) { if (hashfilep == -1) {
InitializeHashTable(&verilogparams, OBJHASHSIZE); InitializeHashTable(&verilogparams, OBJHASHSIZE);
hashfilep = filenum;
}
if (hashfiled == -1) {
InitializeHashTable(&verilogdefs, OBJHASHSIZE); InitializeHashTable(&verilogdefs, OBJHASHSIZE);
hashfile = *fnum; hashfiled = filenum;
} }
definitions = &verilogdefs; definitions = &verilogdefs;

53
scripts/configure vendored
View File

@ -668,7 +668,6 @@ XMKMF
HAVE_PYTHON3 HAVE_PYTHON3
EGREP EGREP
GREP GREP
M4
RANLIB RANLIB
INSTALL_DATA INSTALL_DATA
INSTALL_SCRIPT INSTALL_SCRIPT
@ -3702,56 +3701,6 @@ else
fi fi
for ac_prog in gm4 gnum4 m4
do
# Extract the first word of "$ac_prog", so it can be a program name with args.
set dummy $ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_path_M4+:} false; then :
$as_echo_n "(cached) " >&6
else
case $M4 in
[\\/]* | ?:[\\/]*)
ac_cv_path_M4="$M4" # Let the user override the test with a path.
;;
*)
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_path_M4="$as_dir/$ac_word$ac_exec_ext"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
;;
esac
fi
M4=$ac_cv_path_M4
if test -n "$M4"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $M4" >&5
$as_echo "$M4" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$M4" && break
done
test -n "$M4" || M4="no"
if test x$M4 = xno; then
as_fn_error $? "M4 is required" "$LINENO" 5
fi
if test "$CPP" = "$CC -E" ; then if test "$CPP" = "$CC -E" ; then
CPP="$CPP -x c" CPP="$CPP -x c"
@ -6302,7 +6251,7 @@ fi
*darwin*) *darwin*)
SHDLIB_EXT=".dylib" SHDLIB_EXT=".dylib"
LDDL_FLAGS="-dynamiclib -flat_namespace -undefined suppress -noprebind" LDDL_FLAGS="-dynamiclib -undefined dynamic_lookup"
LDFLAGS="${LDFLAGS} ${LIB_SPECS}" LDFLAGS="${LDFLAGS} ${LIB_SPECS}"
CFLAGS="${CFLAGS} ${X_CFLAGS} ${INC_SPECS} -I/sw/include -fno-common" CFLAGS="${CFLAGS} ${X_CFLAGS} ${INC_SPECS} -I/sw/include -fno-common"
;; ;;

View File

@ -26,12 +26,6 @@ AC_ISC_POSIX
AC_PROG_INSTALL AC_PROG_INSTALL
AC_PROG_RANLIB AC_PROG_RANLIB
dnl GNU M4 is preferred due to some of the option switches.
AC_PATH_PROGS([M4], [gm4 gnum4 m4], [no])
if test x$M4 = xno; then
AC_MSG_ERROR([M4 is required])
fi
dnl check size of pointer for correct behavior on 64-bit systems dnl check size of pointer for correct behavior on 64-bit systems
dnl If the C preprocessor is GCC, we need to force the flag to dnl If the C preprocessor is GCC, we need to force the flag to
dnl assert that input files are of type C, or else the preprocessing dnl assert that input files are of type C, or else the preprocessing
@ -1033,7 +1027,7 @@ fi
*darwin*) *darwin*)
SHDLIB_EXT=".dylib" SHDLIB_EXT=".dylib"
LDDL_FLAGS="-dynamiclib -flat_namespace -undefined suppress -noprebind" LDDL_FLAGS="-dynamiclib -undefined dynamic_lookup"
LDFLAGS="${LDFLAGS} ${LIB_SPECS}" LDFLAGS="${LDFLAGS} ${LIB_SPECS}"
CFLAGS="${CFLAGS} ${X_CFLAGS} ${INC_SPECS} -I/sw/include -fno-common" CFLAGS="${CFLAGS} ${X_CFLAGS} ${INC_SPECS} -I/sw/include -fno-common"
;; ;;

View File

@ -68,6 +68,7 @@ LIB_SPECS = @LIB_SPECS@
LIB_SPECS_NOSTUB = @LIB_SPECS_NOSTUB@ LIB_SPECS_NOSTUB = @LIB_SPECS_NOSTUB@
WISH_EXE = @WISH_EXE@ WISH_EXE = @WISH_EXE@
TCL_LIB_DIR = @TCL_LIB_DIR@ TCL_LIB_DIR = @TCL_LIB_DIR@
EXTRA_CFLAGS =
CC = @CC@ CC = @CC@
CPP = @CPP@ CPP = @CPP@
@ -76,7 +77,7 @@ CXX = @CXX@
CPPFLAGS = -I. -I${NETGENDIR} @CPPFLAGS@ CPPFLAGS = -I. -I${NETGENDIR} @CPPFLAGS@
DFLAGS = @extra_defs@ @stub_defs@ @DEFS@ -DSHDLIB_EXT=\"@SHDLIB_EXT@\" -DNDEBUG DFLAGS = @extra_defs@ @stub_defs@ @DEFS@ -DSHDLIB_EXT=\"@SHDLIB_EXT@\" -DNDEBUG
DFLAGS_NOSTUB = @extra_defs@ @DEFS@ -DSHDLIB_EXT=\"@SHDLIB_EXT@\" -DNDEBUG DFLAGS_NOSTUB = @extra_defs@ @DEFS@ -DSHDLIB_EXT=\"@SHDLIB_EXT@\" -DNDEBUG
CFLAGS = @CFLAGS@ @SHLIB_CFLAGS@ @INC_SPECS@ CFLAGS = @CFLAGS@ @SHLIB_CFLAGS@ @INC_SPECS@ ${EXTRA_CFLAGS}
DEPEND_FILE = Depend DEPEND_FILE = Depend
DEPEND_FLAG = @DEPEND_FLAG@ DEPEND_FLAG = @DEPEND_FLAG@

View File

@ -429,7 +429,7 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
set file1 $name1 set file1 $name1
set cell1 $name1 set cell1 $name1
} }
puts stdout "Reading netlist file $file1" puts stdout "Reading netlist file $file1 for $name1"
set fnum1 [netgen::readnet $file1] set fnum1 [netgen::readnet $file1]
} else { } else {
set cell1 [lindex $flist1 0] set cell1 [lindex $flist1 0]
@ -446,7 +446,7 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
set file2 $name2 set file2 $name2
set cell2 $name2 set cell2 $name2
} }
puts stdout "Reading netlist file $file2" puts stdout "Reading netlist file $file2 for $name2"
set fnum2 [netgen::readnet $file2] set fnum2 [netgen::readnet $file2]
} else { } else {
set cell2 [lindex $flist2 0] set cell2 [lindex $flist2 0]
@ -461,7 +461,7 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
} }
set clist1 [cells list $fnum1] set clist1 [cells list $fnum1]
set cidx [lsearch -regexp $clist1 ^$cell1$] set cidx [lsearch -exact $clist1 $cell1]
if {$cidx < 0} { if {$cidx < 0} {
puts stderr "Cannot find cell $cell1 in file $file1" puts stderr "Cannot find cell $cell1 in file $file1"
return return
@ -469,7 +469,7 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
set cell1 [lindex $clist1 $cidx] set cell1 [lindex $clist1 $cidx]
} }
set clist2 [cells list $fnum2] set clist2 [cells list $fnum2]
set cidx [lsearch -regexp $clist2 ^$cell2$] set cidx [lsearch -exact $clist2 $cell2]
if {$cidx < 0} { if {$cidx < 0} {
puts stderr "Cannot find cell $cell2 in file $file2" puts stderr "Cannot find cell $cell2 in file $file2"
return return
@ -477,6 +477,18 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
set cell2 [lindex $clist2 $cidx] set cell2 [lindex $clist2 $cidx]
} }
# The "noflat" list is non-file-specific, so run on each file.
foreach cell $noflat {
set cidx [lsearch -regexp $clist1 ^$cell$]
if {$cidx >= 0} {
netgen::flatten prohibit "$fnum1 $cell"
}
set cidx [lsearch -regexp $clist2 ^$cell$]
if {$cidx >= 0} {
netgen::flatten prohibit "$fnum2 $cell"
}
}
netgen::compare assign "$fnum1 $cell1" "$fnum2 $cell2" netgen::compare assign "$fnum1 $cell1" "$fnum2 $cell2"
if {$setupfile == ""} { if {$setupfile == ""} {
@ -504,6 +516,14 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
} }
} }
close $fsetup close $fsetup
if {$command != {}} {
# Incomplete command. Evaluate it to get a meaningful error message
if {[catch {uplevel 1 [list namespace eval netgen $command]} msg]} {
set msg [string trimright $msg "\n"]
puts stderr "Error $setupfile:$sline (ignoring), $msg"
incr perrors
}
}
} else { } else {
puts stdout "Error: Cannot read the setup file $setupfile" puts stdout "Error: Cannot read the setup file $setupfile"
} }
@ -594,6 +614,9 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
lappend properr [lindex $endval 0] lappend properr [lindex $endval 0]
} elseif {$uresult == -2} { ;# unmatched pins } elseif {$uresult == -2} { ;# unmatched pins
set doCheckFlatten 1 set doCheckFlatten 1
} elseif {$uresult == -4} { ;# unmatched pins and properties
lappend properr [lindex $endval 0]
set doCheckFlatten 1
} }
} else { } else {
# not equivalent # not equivalent
@ -655,6 +678,11 @@ proc netgen::lvs { name1 name2 {setupfile setup.tcl} {logfile comp.out} args} {
} }
} elseif {[netgen::print queue] == {} && $result == 0} { } elseif {[netgen::print queue] == {} && $result == 0} {
set pinMismatch 1 set pinMismatch 1
} else {
# This assumes that proxy pins are added correctly. Previously,
# that was not trusted, and so an initial pin mismatch would
# always force subcells to be flattened.
set doFlatten 0
} }
} }
if {$doFlatten} { if {$doFlatten} {

View File

@ -21,6 +21,8 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> /* for getenv */ #include <stdlib.h> /* for getenv */
#include <string.h> #include <string.h>
#include <strings.h>
#include <stdarg.h> /* for va_list */
#include <tcl.h> #include <tcl.h>
@ -43,14 +45,14 @@ the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#define FALSE 0 #define FALSE 0
#endif #endif
#if TCL_MAJOR_VERSION < 9
typedef int Tcl_Size;
#endif
/*-----------------------*/ /*-----------------------*/
/* Tcl 8.4 compatibility */ /* Tcl 8.4 compatibility */
/*-----------------------*/ /*-----------------------*/
#ifndef CONST84
#define CONST84
#endif
Tcl_Interp *netgeninterp; Tcl_Interp *netgeninterp;
Tcl_Interp *consoleinterp; Tcl_Interp *consoleinterp;
int ColumnBase = 0; int ColumnBase = 0;
@ -60,47 +62,47 @@ extern int PropertyErrorDetected;
/* Function prototypes for all Tcl command callbacks */ /* Function prototypes for all Tcl command callbacks */
int _netgen_readnet(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_readnet(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_readlib(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_readlib(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_canonical(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_canonical(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_writenet(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_writenet(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_flatten(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_flatten(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_nodes(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_nodes(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_elements(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_elements(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_debug(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_debug(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_protochip(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_protochip(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_instances(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_instances(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_contents(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_contents(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_describe(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_describe(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_cells(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_cells(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_ports(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_ports(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_model(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_model(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_leaves(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_leaves(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_quit(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_quit(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_reinit(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_reinit(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netgen_log(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_log(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
#ifdef HAVE_MALLINFO #ifdef HAVE_MALLINFO
int _netgen_printmem(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_printmem(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
#endif #endif
int _netgen_help(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netgen_help(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_matching(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_matching(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_compare(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_compare(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_iterate(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_iterate(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_summary(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_summary(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_print(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_print(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_format(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_format(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_run(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_run(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_verify(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_verify(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_automorphs(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_automorphs(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_equate(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_equate(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_ignore(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_ignore(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_permute(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_permute(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_property(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_property(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_exhaustive(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_exhaustive(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_symmetry(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_symmetry(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_restart(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_restart(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_global(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_global(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
int _netcmp_convert(ClientData, Tcl_Interp *, int, Tcl_Obj *CONST objv[]); int _netcmp_convert(ClientData, Tcl_Interp *, int, Tcl_Obj *const objv[]);
typedef struct _Cmd { typedef struct _Cmd {
char *name; char *name;
@ -287,7 +289,7 @@ GetTopCell(int fnum)
int int
CommonGetFilenameOrFile(Tcl_Interp *interp, Tcl_Obj *fobj, int *fnumptr) CommonGetFilenameOrFile(Tcl_Interp *interp, Tcl_Obj *fobj, int *fnumptr)
{ {
int result, llen; int result;
int fnum, ftest; int fnum, ftest;
char *filename; char *filename;
struct nlist *tp; struct nlist *tp;
@ -370,7 +372,8 @@ CommonParseCell(Tcl_Interp *interp, Tcl_Obj *objv,
struct nlist **tpr, int *fnumptr) struct nlist **tpr, int *fnumptr)
{ {
Tcl_Obj *tobj, *fobj; Tcl_Obj *tobj, *fobj;
int result, llen; int result;
Tcl_Size llen;
int fnum, ftest, index; int fnum, ftest, index;
char *filename, *cellname; char *filename, *cellname;
struct nlist *tp, *tp2; struct nlist *tp, *tp2;
@ -399,7 +402,7 @@ CommonParseCell(Tcl_Interp *interp, Tcl_Obj *objv,
Tcl_ResetResult(interp); Tcl_ResetResult(interp);
/* Is 1st argument a special keyword? */ /* Is 1st argument a special keyword? */
if (Tcl_GetIndexFromObj(interp, tobj, (CONST84 char **)suboptions, if (Tcl_GetIndexFromObj(interp, tobj, (const char **)suboptions,
"special", 0, &index) == TCL_OK) { "special", 0, &index) == TCL_OK) {
switch (index) { switch (index) {
case CIRCUIT1_IDX: case CIRCUIT1_IDX:
@ -455,7 +458,7 @@ CommonParseCell(Tcl_Interp *interp, Tcl_Obj *objv,
/* Check if 2nd item is a reserved keyword */ /* Check if 2nd item is a reserved keyword */
if (Tcl_GetIndexFromObj(interp, fobj, if (Tcl_GetIndexFromObj(interp, fobj,
(CONST84 char **)suboptions, (const char **)suboptions,
"special", 0, &index) == TCL_OK) { "special", 0, &index) == TCL_OK) {
switch (index) { switch (index) {
case CIRCUIT1_IDX: case CIRCUIT1_IDX:
@ -580,7 +583,7 @@ CommonParseCell(Tcl_Interp *interp, Tcl_Obj *objv,
} else { } else {
/* Only one name given; check if it matches subOption */ /* Only one name given; check if it matches subOption */
if (Tcl_GetIndexFromObj(interp, objv, (CONST84 char **)suboptions, if (Tcl_GetIndexFromObj(interp, objv, (const char **)suboptions,
"special", 0, &index) == TCL_OK) { "special", 0, &index) == TCL_OK) {
switch (index) { switch (index) {
@ -665,7 +668,7 @@ CommonParseCell(Tcl_Interp *interp, Tcl_Obj *objv,
int int
_netgen_canonical(ClientData clientData, _netgen_canonical(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
int result; int result;
struct nlist *np; struct nlist *np;
@ -704,7 +707,7 @@ _netgen_canonical(ClientData clientData,
int int
_netgen_readnet(ClientData clientData, _netgen_readnet(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *formats[] = { char *formats[] = {
"automatic", "ext", "extflat", "sim", "prm", "ntk", "spice", "automatic", "ext", "extflat", "sim", "prm", "ntk", "spice",
@ -741,7 +744,7 @@ _netgen_readnet(ClientData clientData,
return TCL_ERROR; return TCL_ERROR;
} }
else if (objc > 1) { else if (objc > 1) {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)formats, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)formats,
"format", 0, &index) != TCL_OK) { "format", 0, &index) != TCL_OK) {
if (objc == 3) if (objc == 3)
@ -850,7 +853,7 @@ _netgen_readnet(ClientData clientData,
int int
_netgen_readlib(ClientData clientData, _netgen_readlib(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *formats[] = { char *formats[] = {
"actel", "spice", "xilinx", NULL "actel", "spice", "xilinx", NULL
@ -883,7 +886,7 @@ _netgen_readlib(ClientData clientData,
Tcl_WrongNumArgs(interp, 1, objv, "format [file]"); Tcl_WrongNumArgs(interp, 1, objv, "format [file]");
return TCL_ERROR; return TCL_ERROR;
} }
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)formats, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)formats,
"format", 0, &index) != TCL_OK) { "format", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -930,7 +933,7 @@ _netgen_readlib(ClientData clientData,
int int
_netgen_writenet(ClientData clientData, _netgen_writenet(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *formats[] = { char *formats[] = {
"ext", "sim", "ntk", "actel", "ext", "sim", "ntk", "actel",
@ -949,7 +952,7 @@ _netgen_writenet(ClientData clientData,
Tcl_WrongNumArgs(interp, 1, objv, "format file"); Tcl_WrongNumArgs(interp, 1, objv, "format file");
return TCL_ERROR; return TCL_ERROR;
} }
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)formats, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)formats,
"format", 0, &index) != TCL_OK) { "format", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -1017,11 +1020,11 @@ _netgen_writenet(ClientData clientData,
int int
_netgen_flatten(ClientData clientData, _netgen_flatten(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr, *file; char *repstr, *file;
int result, llen, filenum; int result, filenum;
struct nlist *tp, *tp2; struct nlist *tp, *tp2, *tptop;
if ((objc < 2) || (objc > 4)) { if ((objc < 2) || (objc > 4)) {
Tcl_WrongNumArgs(interp, 1, objv, "?class? valid_cellname"); Tcl_WrongNumArgs(interp, 1, objv, "?class? valid_cellname");
@ -1035,7 +1038,7 @@ _netgen_flatten(ClientData clientData,
if (objc >= 3) { if (objc >= 3) {
char *argv = Tcl_GetString(objv[1]); char *argv = Tcl_GetString(objv[1]);
if (!strcmp(argv, "class")) { if (!strcmp(argv, "class")) {
tp = GetTopCell(filenum); tptop = GetTopCell(filenum);
if (objc == 4) { if (objc == 4) {
int numflat; int numflat;
@ -1046,7 +1049,7 @@ _netgen_flatten(ClientData clientData,
} }
else { else {
Printf("Flattening instances of %s in cell %s within file %s\n", Printf("Flattening instances of %s in cell %s within file %s\n",
repstr, tp2->name, tp->name); repstr, tp2->name, tptop->name);
numflat = flattenInstancesOf(tp2->name, filenum, repstr); numflat = flattenInstancesOf(tp2->name, filenum, repstr);
if (numflat == 0) { if (numflat == 0) {
Tcl_SetResult(interp, "No instances found to flatten.", NULL); Tcl_SetResult(interp, "No instances found to flatten.", NULL);
@ -1055,16 +1058,20 @@ _netgen_flatten(ClientData clientData,
} }
} }
else { else {
Printf("Flattening instances of %s in file %s\n", repstr, tp->name); Printf("Flattening instances of %s in file %s\n", repstr, tptop->name);
FlattenInstancesOf(repstr, filenum); FlattenInstancesOf(repstr, filenum);
} }
} }
else if (!strcmp(argv, "prohibit") || !strcmp(argv, "deny")) { else if (!strcmp(argv, "prohibit") || !strcmp(argv, "deny")) {
tp = GetTopCell(filenum); tptop = GetTopCell(filenum);
Printf("Will not flatten instances of %s in file %s\n", repstr, tp->name); if (tp == NULL)
Printf("Error: Cell %s does not exist.\n", repstr);
else {
Printf("Will not flatten instances of %s in file %s\n", repstr, tptop->name);
/* Mark cell as placeholder so it will not be flattened */ /* Mark cell as placeholder so it will not be flattened */
tp->flags |= CELL_PLACEHOLDER; tp->flags |= CELL_PLACEHOLDER;
} }
}
else { else {
Tcl_WrongNumArgs(interp, 1, objv, "class valid_cellname"); Tcl_WrongNumArgs(interp, 1, objv, "class valid_cellname");
return TCL_ERROR; return TCL_ERROR;
@ -1087,7 +1094,7 @@ _netgen_flatten(ClientData clientData,
int int
_netgen_nodes(ClientData clientData, _netgen_nodes(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *estr = NULL, *istr = NULL, *cstr, *fstr; char *estr = NULL, *istr = NULL, *cstr, *fstr;
char *optstart; char *optstart;
@ -1205,7 +1212,7 @@ _netgen_nodes(ClientData clientData,
int int
_netgen_elements(ClientData clientData, _netgen_elements(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *nstr = NULL, *cstr; char *nstr = NULL, *cstr;
struct objlist * (*ListSave)(); struct objlist * (*ListSave)();
@ -1300,7 +1307,7 @@ _netgen_elements(ClientData clientData,
int int
_netgen_debug(ClientData clientData, _netgen_debug(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *yesno[] = { char *yesno[] = {
"on", "off", NULL "on", "off", NULL
@ -1314,7 +1321,7 @@ _netgen_debug(ClientData clientData,
if (objc == 1) if (objc == 1)
index = YES_IDX; index = YES_IDX;
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)yesno, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)yesno,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
index = CMD_IDX; index = CMD_IDX;
} }
@ -1349,7 +1356,7 @@ _netgen_debug(ClientData clientData,
int int
_netgen_protochip(ClientData clientData, _netgen_protochip(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -1369,7 +1376,7 @@ _netgen_protochip(ClientData clientData,
int int
_netgen_instances(ClientData clientData, _netgen_instances(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr; char *repstr;
int result; int result;
@ -1399,7 +1406,7 @@ _netgen_instances(ClientData clientData,
int int
_netgen_contents(ClientData clientData, _netgen_contents(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr; char *repstr;
int result; int result;
@ -1428,7 +1435,7 @@ _netgen_contents(ClientData clientData,
int int
_netgen_describe(ClientData clientData, _netgen_describe(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr; char *repstr;
int file = -1; int file = -1;
@ -1458,7 +1465,7 @@ _netgen_describe(ClientData clientData,
int int
_netgen_cells(ClientData clientData, _netgen_cells(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr, *filename = NULL; char *repstr, *filename = NULL;
char *optstart; char *optstart;
@ -1545,7 +1552,7 @@ _netgen_cells(ClientData clientData,
int int
_netgen_model(ClientData clientData, _netgen_model(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
struct nlist *tp, *tp2; struct nlist *tp, *tp2;
char *model, *retclass; char *model, *retclass;
@ -1595,10 +1602,9 @@ _netgen_model(ClientData clientData,
return result; return result;
if (objc == 3) { if (objc == 3) {
model = Tcl_GetString(objv[2]); nports = NumberOfPorts(tp->name, fnum);
nports = NumberOfPorts(model, fnum);
if (Tcl_GetIndexFromObj(interp, objv[2], (CONST84 char **)modelclasses, if (Tcl_GetIndexFromObj(interp, objv[2], (const char **)modelclasses,
"class", 0, &index) != TCL_OK) { "class", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -1768,7 +1774,7 @@ wrongNumPorts:
int int
_netgen_ports(ClientData clientData, _netgen_ports(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr; char *repstr;
int result; int result;
@ -1798,7 +1804,7 @@ _netgen_ports(ClientData clientData,
int int
_netgen_leaves(ClientData clientData, _netgen_leaves(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *repstr; char *repstr;
int result; int result;
@ -1834,7 +1840,7 @@ _netgen_leaves(ClientData clientData,
int int
_netgen_quit(ClientData clientData, _netgen_quit(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -1862,7 +1868,7 @@ _netgen_quit(ClientData clientData,
int int
_netgen_reinit(ClientData clientData, _netgen_reinit(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -1882,7 +1888,7 @@ _netgen_reinit(ClientData clientData,
int int
_netgen_log(ClientData clientData, _netgen_log(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *yesno[] = { char *yesno[] = {
"start", "end", "reset", "suspend", "resume", "file", "echo", "put", NULL "start", "end", "reset", "suspend", "resume", "file", "echo", "put", NULL
@ -1899,7 +1905,7 @@ _netgen_log(ClientData clientData,
index = (LoggingFile) ? RESUME_IDX : START_IDX; index = (LoggingFile) ? RESUME_IDX : START_IDX;
} }
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)yesno, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)yesno,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -2026,7 +2032,7 @@ _netgen_log(ClientData clientData,
int int
_netgen_printmem(ClientData clientData, _netgen_printmem(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -2048,7 +2054,7 @@ _netgen_printmem(ClientData clientData,
int int
_netcmp_format(ClientData clientData, _netcmp_format(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
int col1_width = 41, col2_width = 41; int col1_width = 41, col2_width = 41;
@ -2109,13 +2115,13 @@ _netcmp_format(ClientData clientData,
int int
_netcmp_compare(ClientData clientData, _netcmp_compare(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *name1, *name2, *file1, *file2, *optstart; char *name1, *name2, *file1, *file2, *optstart;
int fnum1, fnum2, dolist = 0; int fnum1, fnum2, dolist = 0;
int dohierarchy = FALSE; int dohierarchy = FALSE;
int assignonly = FALSE; int assignonly = FALSE;
int argstart = 1, qresult, llen, result; int argstart = 1, qresult, result;
int hascontents1, hascontents2; int hascontents1, hascontents2;
struct Correspond *nextcomp; struct Correspond *nextcomp;
struct nlist *tp1 = NULL, *tp2 = NULL; struct nlist *tp1 = NULL, *tp2 = NULL;
@ -2286,7 +2292,7 @@ _netcmp_compare(ClientData clientData,
int int
_netcmp_iterate(ClientData clientData, _netcmp_iterate(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -2310,7 +2316,7 @@ _netcmp_iterate(ClientData clientData,
int int
_netcmp_summary(ClientData clientData, _netcmp_summary(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"nodes", "elements", NULL "nodes", "elements", NULL
@ -2325,7 +2331,7 @@ _netcmp_summary(ClientData clientData,
return TCL_ERROR; return TCL_ERROR;
} }
if (objc == 2) { if (objc == 2) {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -2351,7 +2357,7 @@ _netcmp_summary(ClientData clientData,
int int
_netcmp_print(ClientData clientData, _netcmp_print(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"nodes", "elements", "queue", NULL "nodes", "elements", "queue", NULL
@ -2389,16 +2395,16 @@ _netcmp_print(ClientData clientData,
return TCL_ERROR; return TCL_ERROR;
} }
if (objc >= 2) { if (objc >= 2) {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
if ((objc == 2) && (Tcl_GetIndexFromObj(interp, objv[1], if ((objc == 2) && (Tcl_GetIndexFromObj(interp, objv[1],
(CONST84 char **)classes, "class", 0, &class) != TCL_OK)) { (const char **)classes, "class", 0, &class) != TCL_OK)) {
return TCL_ERROR; return TCL_ERROR;
} }
} }
} }
if (objc == 3 && index != QUEUE_IDX) { if (objc == 3 && index != QUEUE_IDX) {
if (Tcl_GetIndexFromObj(interp, objv[2], (CONST84 char **)classes, if (Tcl_GetIndexFromObj(interp, objv[2], (const char **)classes,
"class", 0, &class) != TCL_OK) { "class", 0, &class) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -2442,7 +2448,7 @@ _netcmp_print(ClientData clientData,
int int
_netcmp_run(ClientData clientData, _netcmp_run(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"converge", "resolve", NULL "converge", "resolve", NULL
@ -2469,7 +2475,7 @@ _netcmp_run(ClientData clientData,
if (objc == 1) if (objc == 1)
index = RESOLVE_IDX; index = RESOLVE_IDX;
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -2513,7 +2519,13 @@ _netcmp_run(ClientData clientData,
if (automorphisms > 0) { if (automorphisms > 0) {
// Next, attempt to resolve automorphisms uniquely by // Next, attempt to resolve automorphisms uniquely by
// using the pin names // using the pin names
automorphisms = ResolveAutomorphsByPin(); automorphisms = ResolveAutomorphsByPin(FALSE);
}
if (automorphisms > 0) {
// Next, attempt to resolve automorphisms uniquely by
// using the net names (should only be done after
// resolving by pin).
automorphisms = ResolveAutomorphsByPin(TRUE);
} }
if (automorphisms > 0) { if (automorphisms > 0) {
// Anything left is truly indistinguishable // Anything left is truly indistinguishable
@ -2523,8 +2535,16 @@ _netcmp_run(ClientData clientData,
if (automorphisms == -1) if (automorphisms == -1)
Fprintf(stdout, "Netlists do not match.\n"); Fprintf(stdout, "Netlists do not match.\n");
else if (automorphisms == -2) else if (automorphisms == -2) {
Fprintf(stdout, "Netlists match uniquely with port errors.\n"); Fprintf(stdout, "Netlists match uniquely with port");
if (PropertyErrorDetected) {
Fprintf(stdout, " and property errors.\n");
PrintPropertyResults(dolist);
}
else {
Fprintf(stdout, " errors.\n");
}
}
else { else {
if (automorphisms == 0) if (automorphisms == 0)
Fprintf(stdout, "Netlists match uniquely"); Fprintf(stdout, "Netlists match uniquely");
@ -2559,6 +2579,7 @@ _netcmp_run(ClientData clientData,
/* 0: not verified */ /* 0: not verified */
/* -1: no elements or nodes */ /* -1: no elements or nodes */
/* -3: verified with property error */ /* -3: verified with property error */
/* -4: verified with property and port errors */
/* equiv option */ /* equiv option */
/* -2: pin mismatch */ /* -2: pin mismatch */
/* */ /* */
@ -2571,7 +2592,7 @@ _netcmp_run(ClientData clientData,
int int
_netcmp_verify(ClientData clientData, _netcmp_verify(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"nodes", "elements", "properties", "only", "all", "equivalent", "unique", NULL "nodes", "elements", "properties", "only", "all", "equivalent", "unique", NULL
@ -2603,7 +2624,7 @@ _netcmp_verify(ClientData clientData,
return TCL_ERROR; return TCL_ERROR;
} }
if (objc == 2) { if (objc == 2) {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -2652,14 +2673,20 @@ _netcmp_verify(ClientData clientData,
disable_interrupt(); disable_interrupt();
if (index == EQUIV_IDX || index == UNIQUE_IDX) if (index == EQUIV_IDX || index == UNIQUE_IDX)
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(0)); Tcl_SetObjResult(interp, Tcl_NewBooleanObj(0));
else else {
Fprintf(stdout, "Netlists do not match.\n"); Fprintf(stdout, "Netlists do not match.\n");
Fprintf(stdout, "Port matching may fail to disambiguate symmetries.\n");
}
} }
else if (automorphisms == -2) { else if (automorphisms == -2) {
if (index == EQUIV_IDX) if (index == EQUIV_IDX)
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(1)); Tcl_SetObjResult(interp, Tcl_NewBooleanObj(1));
else if (index == UNIQUE_IDX) else if (index == UNIQUE_IDX) {
if (PropertyErrorDetected == 0)
Tcl_SetObjResult(interp, Tcl_NewIntObj(-2)); Tcl_SetObjResult(interp, Tcl_NewIntObj(-2));
else
Tcl_SetObjResult(interp, Tcl_NewIntObj(-4));
}
else if (index > 0) else if (index > 0)
Fprintf(stdout, "Circuits match uniquely with port errors.\n"); Fprintf(stdout, "Circuits match uniquely with port errors.\n");
} }
@ -2754,7 +2781,7 @@ _netcmp_verify(ClientData clientData,
int int
_netcmp_automorphs(ClientData clientData, _netcmp_automorphs(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -2775,7 +2802,7 @@ _netcmp_automorphs(ClientData clientData,
int int
_netcmp_convert(ClientData clientData, _netcmp_convert(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *cellname; char *cellname;
int filenum = -1; int filenum = -1;
@ -2805,10 +2832,10 @@ _netcmp_convert(ClientData clientData,
int int
_netcmp_global(ClientData clientData, _netcmp_global(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *filename, *cellname, *pattern; char *filename, *cellname, *pattern;
int numchanged = 0, p, fnum, llen, result; int numchanged = 0, p, fnum, result;
struct nlist *tp; struct nlist *tp;
if (objc < 2) { if (objc < 2) {
@ -2842,7 +2869,7 @@ _netcmp_global(ClientData clientData,
int int
_netcmp_ignore(ClientData clientData, _netcmp_ignore(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"class", "shorted", NULL "class", "shorted", NULL
@ -2856,7 +2883,7 @@ _netcmp_ignore(ClientData clientData,
char *name = NULL, *name2 = NULL; char *name = NULL, *name2 = NULL;
if (objc >= 3) { if (objc >= 3) {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) == TCL_OK) { "option", 0, &index) == TCL_OK) {
objc--; objc--;
objv++; objv++;
@ -2890,7 +2917,7 @@ _netcmp_ignore(ClientData clientData,
int int
_netcmp_equate(ClientData clientData, _netcmp_equate(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"nodes", "elements", "classes", "pins", NULL "nodes", "elements", "classes", "pins", NULL
@ -2905,7 +2932,8 @@ _netcmp_equate(ClientData clientData,
struct ElementClass *saveEclass = NULL; struct ElementClass *saveEclass = NULL;
struct NodeClass *saveNclass = NULL; struct NodeClass *saveNclass = NULL;
int file1, file2; int file1, file2;
int i, l1, l2, ltest, lent, dolist = 0, doforce = 0, dounique = 0; int i, dolist = 0, doforce = 0, dounique = 0;
Tcl_Size l1, l2, lent, ltest;
Tcl_Obj *tobj1, *tobj2, *tobj3; Tcl_Obj *tobj1, *tobj2, *tobj3;
while (objc > 1) { while (objc > 1) {
@ -2935,7 +2963,7 @@ _netcmp_equate(ClientData clientData,
return TCL_ERROR; return TCL_ERROR;
} }
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -3404,22 +3432,31 @@ _netcmp_equate(ClientData clientData,
int int
_netcmp_property(ClientData clientData, _netcmp_property(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
int fnum, i, llen; int fnum, i;
struct nlist *tp; struct nlist *tp;
struct property *kl, *kllast, *klnext; struct property *kl, *kllast, *klnext;
Tcl_Obj *tobj1, *tobj2, *tobj3; Tcl_Obj *tobj1, *tobj2, *tobj3;
Tcl_Size llen;
double dval; double dval;
int ival, argstart; int ival, argstart;
char *topoptions[] = {
"default", "series", "serial", "parallel", "topology", NULL
};
enum TopOptionIdx {
TOP_DEFAULT_IDX, TOP_SERIES_IDX, TOP_SERIAL_IDX, TOP_PARALLEL_IDX,
TOP_TOPOLOGY_IDX
};
char *options[] = { char *options[] = {
"add", "create", "remove", "delete", "tolerance", "merge", "serial", "add", "create", "remove", "delete", "tolerance", "merge", "serial",
"series", "parallel", "associate", "topology", NULL "series", "parallel", "associate", "derive", NULL
}; };
enum OptionIdx { enum OptionIdx {
ADD_IDX, CREATE_IDX, REMOVE_IDX, DELETE_IDX, TOLERANCE_IDX, MERGE_IDX, ADD_IDX, CREATE_IDX, REMOVE_IDX, DELETE_IDX, TOLERANCE_IDX, MERGE_IDX,
SERIAL_IDX, SERIES_IDX, PARALLEL_IDX, ASSOCIATE_IDX, TOPOLOGY_IDX SERIAL_IDX, SERIES_IDX, PARALLEL_IDX, ASSOCIATE_IDX, DERIVE_IDX
}; };
int result, index, idx2; int result, index, idx2;
@ -3454,6 +3491,14 @@ _netcmp_property(ClientData clientData,
COMB_NONE_IDX, COMB_PAR_IDX, COMB_ADD_IDX, COMB_CRITICAL_IDX COMB_NONE_IDX, COMB_PAR_IDX, COMB_ADD_IDX, COMB_CRITICAL_IDX
}; };
char *deriveoptions[] = {
"area", "perimeter", NULL
};
enum DeriveOptionIdx {
AREA_IDX, PERIMETER_IDX
};
char *yesno[] = { char *yesno[] = {
"on", "yes", "true", "enable", "allow", "on", "yes", "true", "enable", "allow",
"off", "no", "false", "disable", "prohibit", NULL "off", "no", "false", "disable", "prohibit", NULL
@ -3468,8 +3513,13 @@ _netcmp_property(ClientData clientData,
"strict", "relaxed", NULL "strict", "relaxed", NULL
}; };
/* Don't need to check return value */
index = -1;
Tcl_GetIndexFromObj(interp, objv[1], (const char **)topoptions,
"option", 0, &index);
/* Check for special command "property default" */ /* Check for special command "property default" */
if ((objc == 2) && (!strcmp(Tcl_GetString(objv[1]), "default"))) { if ((objc == 2) && (index == TOP_DEFAULT_IDX)) {
/* For each FET device, do "merge {w add_critical}" and */ /* For each FET device, do "merge {w add_critical}" and */
/* "remove as ad ps pd". This allows parallel devices */ /* "remove as ad ps pd". This allows parallel devices */
@ -3516,7 +3566,7 @@ _netcmp_property(ClientData clientData,
} }
return TCL_OK; return TCL_OK;
} }
else if ((objc == 3) && (!strcmp(Tcl_GetString(objv[1]), "parallel"))) { else if ((objc == 3) && (index == TOP_PARALLEL_IDX)) {
if (!strcmp(Tcl_GetString(objv[2]), "none")) { if (!strcmp(Tcl_GetString(objv[2]), "none")) {
GlobalParallelNone = TRUE; GlobalParallelNone = TRUE;
SetParallelCombine(FALSE); SetParallelCombine(FALSE);
@ -3538,8 +3588,7 @@ _netcmp_property(ClientData clientData,
} }
return TCL_OK; return TCL_OK;
} }
else if ((objc == 3) && ((!strcmp(Tcl_GetString(objv[1]), "series")) || else if ((objc == 3) && ((index == TOP_SERIES_IDX) || (index == TOP_SERIAL_IDX))) {
(!strcmp(Tcl_GetString(objv[1]), "serial")))) {
if (!strcmp(Tcl_GetString(objv[2]), "none")) { if (!strcmp(Tcl_GetString(objv[2]), "none")) {
SetSeriesCombine(FALSE); SetSeriesCombine(FALSE);
} }
@ -3553,7 +3602,7 @@ _netcmp_property(ClientData clientData,
} }
return TCL_OK; return TCL_OK;
} }
else if ((objc > 1) && (!strcmp(Tcl_GetString(objv[1]), "topology"))) { else if ((objc > 1) && (index == TOP_TOPOLOGY_IDX)) {
if (objc == 2) { if (objc == 2) {
if (ExactTopology) if (ExactTopology)
Tcl_SetResult(interp, "Strict topology property matching.", Tcl_SetResult(interp, "Strict topology property matching.",
@ -3564,7 +3613,7 @@ _netcmp_property(ClientData clientData,
} }
else if (objc == 3) { else if (objc == 3) {
if (Tcl_GetIndexFromObj(interp, objv[2], if (Tcl_GetIndexFromObj(interp, objv[2],
(CONST84 char **)topo, (const char **)topo,
"topology", 0, &idx2) == TCL_OK) { "topology", 0, &idx2) == TCL_OK) {
if (idx2 == 0) if (idx2 == 0)
ExactTopology = TRUE; ExactTopology = TRUE;
@ -3623,7 +3672,7 @@ _netcmp_property(ClientData clientData,
Tcl_SetObjResult(interp, tobj1); Tcl_SetObjResult(interp, tobj1);
} }
else { else {
if (Tcl_GetIndexFromObj(interp, objv[2], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[2], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
index = ADD_IDX; index = ADD_IDX;
argstart = 2; argstart = 2;
@ -3656,7 +3705,7 @@ _netcmp_property(ClientData clientData,
// Each value must be a list of two, or a yes/no answer. // Each value must be a list of two, or a yes/no answer.
if (Tcl_GetIndexFromObj(interp, objv[i], if (Tcl_GetIndexFromObj(interp, objv[i],
(CONST84 char **)yesno, (const char **)yesno,
"combine", 0, &idx2) == TCL_OK) { "combine", 0, &idx2) == TCL_OK) {
if (idx2 <= 4) { /* true, enable, etc. */ if (idx2 <= 4) { /* true, enable, etc. */
if (index == SERIAL_IDX || index == SERIES_IDX) if (index == SERIAL_IDX || index == SERIES_IDX)
@ -3688,7 +3737,7 @@ _netcmp_property(ClientData clientData,
if (result != TCL_OK) return result; if (result != TCL_OK) return result;
result = Tcl_GetIndexFromObj(interp, tobj2, result = Tcl_GetIndexFromObj(interp, tobj2,
(CONST84 char **)combineoptions, (const char **)combineoptions,
"combine_type", 0, &idx2); "combine_type", 0, &idx2);
if (result != TCL_OK) return result; if (result != TCL_OK) return result;
@ -3773,7 +3822,7 @@ _netcmp_property(ClientData clientData,
/* {key, type} or {key, tolerance} duplet */ /* {key, type} or {key, tolerance} duplet */
if (Tcl_GetIndexFromObj(interp, tobj2, if (Tcl_GetIndexFromObj(interp, tobj2,
(CONST84 char **)suboptions, (const char **)suboptions,
"type", 0, &idx2) != TCL_OK) { "type", 0, &idx2) != TCL_OK) {
Tcl_ResetResult(interp); Tcl_ResetResult(interp);
if (Tcl_GetDoubleFromObj(interp, tobj2, &dval) if (Tcl_GetDoubleFromObj(interp, tobj2, &dval)
@ -3817,7 +3866,7 @@ _netcmp_property(ClientData clientData,
/* {key, type, tolerance} triplet */ /* {key, type, tolerance} triplet */
if (Tcl_GetIndexFromObj(interp, tobj2, if (Tcl_GetIndexFromObj(interp, tobj2,
(CONST84 char **)suboptions, (const char **)suboptions,
"type", 0, &idx2) != TCL_OK) "type", 0, &idx2) != TCL_OK)
return TCL_ERROR; return TCL_ERROR;
@ -3960,7 +4009,7 @@ _netcmp_property(ClientData clientData,
if (result != TCL_OK) return result; if (result != TCL_OK) return result;
result = Tcl_GetIndexFromObj(interp, tobj2, result = Tcl_GetIndexFromObj(interp, tobj2,
(CONST84 char **)mergeoptions, (const char **)mergeoptions,
"merge_type", 0, &idx2); "merge_type", 0, &idx2);
if (result != TCL_OK) return result; if (result != TCL_OK) return result;
@ -3999,6 +4048,32 @@ _netcmp_property(ClientData clientData,
} }
break; break;
case DERIVE_IDX:
/* Create a derived property. For now, this just creates
* "area" or "perimeter" properties. There may not (?)
* be enough cause to make other ones. Unlike other
* "property" options, this option causes the whole circuit
* database to be searched for the device in question, and
* the new property is added.
*/
if (objc < 6) {
Tcl_WrongNumArgs(interp, 2, objv, "{area|perimeter width length}");
return TCL_ERROR;
}
result = Tcl_GetIndexFromObj(interp, objv[3],
(const char **)deriveoptions,
"area|perimeter", 0, &idx2);
if (result != TCL_OK) return result;
switch (idx2) {
case AREA_IDX:
DeriveAreaProperty(tp, fnum, Tcl_GetString(objv[4]),
Tcl_GetString(objv[5]));
break;
case PERIMETER_IDX:
DerivePerimeterProperty(tp, fnum, Tcl_GetString(objv[4]),
Tcl_GetString(objv[5]));
break;
}
} }
} }
return TCL_OK; return TCL_OK;
@ -4018,7 +4093,7 @@ _netcmp_property(ClientData clientData,
int int
_netcmp_permute(ClientData clientData, _netcmp_permute(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *model, *pin1, *pin2; char *model, *pin1, *pin2;
char *permuteclass[] = { char *permuteclass[] = {
@ -4039,7 +4114,7 @@ _netcmp_permute(ClientData clientData,
index = DEFLT_IDX; index = DEFLT_IDX;
} }
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)permuteclass, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)permuteclass,
"permute class", 0, &index) != TCL_OK) { "permute class", 0, &index) != TCL_OK) {
if (objc != 4) { if (objc != 4) {
Tcl_WrongNumArgs(interp, 1, objv, "?valid_cellname pin1 pin2?"); Tcl_WrongNumArgs(interp, 1, objv, "?valid_cellname pin1 pin2?");
@ -4159,7 +4234,7 @@ _netcmp_permute(ClientData clientData,
int int
_netcmp_symmetry(ClientData clientData, _netcmp_symmetry(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
Printf("Symmetry breaking method has been deprecated.\n"); Printf("Symmetry breaking method has been deprecated.\n");
return TCL_OK; return TCL_OK;
@ -4175,7 +4250,7 @@ _netcmp_symmetry(ClientData clientData,
int int
_netcmp_exhaustive(ClientData clientData, _netcmp_exhaustive(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *yesno[] = { char *yesno[] = {
"on", "off", NULL "on", "off", NULL
@ -4188,7 +4263,7 @@ _netcmp_exhaustive(ClientData clientData,
if (objc == 1) if (objc == 1)
index = -1; index = -1;
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)yesno, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)yesno,
"option", 0, &index) != TCL_OK) "option", 0, &index) != TCL_OK)
return TCL_ERROR; return TCL_ERROR;
} }
@ -4217,7 +4292,7 @@ _netcmp_exhaustive(ClientData clientData,
int int
_netcmp_restart(ClientData clientData, _netcmp_restart(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
if (objc != 1) { if (objc != 1) {
Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)"); Tcl_WrongNumArgs(interp, 1, objv, "(no arguments)");
@ -4237,7 +4312,7 @@ _netcmp_restart(ClientData clientData,
int int
_netgen_help(ClientData clientData, _netgen_help(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
int n; int n;
@ -4268,7 +4343,7 @@ _netgen_help(ClientData clientData,
int int
_netcmp_matching(ClientData clientData, _netcmp_matching(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
char *options[] = { char *options[] = {
"nodes", "elements", NULL "nodes", "elements", NULL
@ -4290,7 +4365,7 @@ _netcmp_matching(ClientData clientData,
name = Tcl_GetString(objv[1]); name = Tcl_GetString(objv[1]);
} }
else { else {
if (Tcl_GetIndexFromObj(interp, objv[1], (CONST84 char **)options, if (Tcl_GetIndexFromObj(interp, objv[1], (const char **)options,
"option", 0, &index) != TCL_OK) { "option", 0, &index) != TCL_OK) {
return TCL_ERROR; return TCL_ERROR;
} }
@ -4419,14 +4494,14 @@ void tcl_vprintf(FILE *f, const char *fmt, va_list args_in)
void tcl_stdflush(FILE *f) void tcl_stdflush(FILE *f)
{ {
Tcl_SavedResult state; Tcl_InterpState state;
static char stdstr[] = "::flush stdxxx"; static char stdstr[] = "::flush stdxxx";
char *stdptr = stdstr + 11; char *stdptr = stdstr + 11;
Tcl_SaveResult(netgeninterp, &state); state = Tcl_SaveInterpState(netgeninterp, TCL_OK);
strcpy(stdptr, (f == stderr) ? "err" : "out"); strcpy(stdptr, (f == stderr) ? "err" : "out");
Tcl_Eval(netgeninterp, stdstr); Tcl_Eval(netgeninterp, stdstr);
Tcl_RestoreResult(netgeninterp, &state); Tcl_RestoreInterpState(netgeninterp, state);
} }
/*------------------------------------------------------*/ /*------------------------------------------------------*/
@ -4456,7 +4531,7 @@ char *Tcl_Strdup(const char *s)
/*------------------------------------------------------*/ /*------------------------------------------------------*/
int _tkcon_interrupt(ClientData clientData, int _tkcon_interrupt(ClientData clientData,
Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[]) Tcl_Interp *interp, int objc, Tcl_Obj *const objv[])
{ {
InterruptPending = 1; InterruptPending = 1;
return TCL_OK; return TCL_OK;
@ -4495,7 +4570,7 @@ int Tclnetgen_Init(Tcl_Interp *interp)
/* Remember the interpreter */ /* Remember the interpreter */
netgeninterp = interp; netgeninterp = interp;
if (Tcl_InitStubs(interp, "8.5", 0) == NULL) return TCL_ERROR; if (Tcl_InitStubs(interp, TCL_VERSION, 0) == NULL) return TCL_ERROR;
for (n = 0; netgen_cmds[n].name != NULL; n++) { for (n = 0; netgen_cmds[n].name != NULL; n++) {
sprintf(keyword, "netgen::%s", netgen_cmds[n].name); sprintf(keyword, "netgen::%s", netgen_cmds[n].name);
@ -4504,7 +4579,8 @@ int Tclnetgen_Init(Tcl_Interp *interp)
} }
for (n = 0; netcmp_cmds[n].name != NULL; n++) { for (n = 0; netcmp_cmds[n].name != NULL; n++) {
sprintf(keyword, "netgen::%s", netcmp_cmds[n].name); sprintf(keyword, "netgen::%s", netcmp_cmds[n].name);
Tcl_CreateObjCommand(interp, keyword, netcmp_cmds[n].handler, Tcl_CreateObjCommand(interp, keyword,
(Tcl_ObjCmdProc *)netcmp_cmds[n].handler,
(ClientData)NULL, (Tcl_CmdDeleteProc *)NULL); (ClientData)NULL, (Tcl_CmdDeleteProc *)NULL);
} }

View File

@ -44,6 +44,8 @@ exec ${NETGEN_WISH:=wish} "$0" ${1+"$@"}
if {$tcl_version < 8.0} { if {$tcl_version < 8.0} {
return -code error "tkcon requires at least Tcl/Tk8" return -code error "tkcon requires at least Tcl/Tk8"
} else { } else {
# Prevent breaking on version 8.5.2
# package require -exact Tk $tcl_version
package require Tk $tcl_version package require Tk $tcl_version
} }
@ -59,18 +61,6 @@ foreach pkg [info loaded {}] {
} }
catch {unset pkg file name version} catch {unset pkg file name version}
# Tk 8.4 makes previously exposed stuff private.
# FIX: Update tkcon to not rely on the private Tk code.
#
if {![llength [info globals tkPriv]]} {
::tk::unsupported::ExposePrivateVariable tkPriv
}
foreach cmd {SetCursor UpDownLine Transpose ScrollPages} {
if {![llength [info commands tkText$cmd]]} {
::tk::unsupported::ExposePrivateCommand tkText$cmd
}
}
# Initialize the ::tkcon namespace # Initialize the ::tkcon namespace
# #
namespace eval ::tkcon { namespace eval ::tkcon {
@ -196,7 +186,7 @@ proc ::tkcon::Init {} {
tkcon_puts tkcon_gets observe observe_var unalias which what tkcon_puts tkcon_gets observe observe_var unalias which what
} }
version 2.3 version 2.3
RCS {RCS: @(#) $Id: tkcon.tcl,v 1.2 2008/05/23 00:20:17 tim Exp $} RCS {RCS: @(#) $Id: tkcon.tcl,v 1.2 2008/04/18 16:28:13 tim Exp $}
HEADURL {http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/tkcon/tkcon/tkcon.tcl?rev=HEAD} HEADURL {http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/tkcon/tkcon/tkcon.tcl?rev=HEAD}
docs "http://tkcon.sourceforge.net/" docs "http://tkcon.sourceforge.net/"
email {jeff@hobbs.org} email {jeff@hobbs.org}
@ -745,7 +735,7 @@ proc ::tkcon::EvalCmd {w cmd} {
$w tag bind $tag <Leave> \ $w tag bind $tag <Leave> \
[list $w tag configure $tag -underline 0] [list $w tag configure $tag -underline 0]
$w tag bind $tag <ButtonRelease-1> \ $w tag bind $tag <ButtonRelease-1> \
"if {!\[info exists tkPriv(mouseMoved)\] || !\$tkPriv(mouseMoved)} \ "if {!\[info exists ::tk::Priv(mouseMoved)\] || !\$::tk::Priv(mouseMoved)} \
{[list edit -attach [Attach] -type error -- $PRIV(errorInfo)]}" {[list edit -attach [Attach] -type error -- $PRIV(errorInfo)]}"
} else { } else {
$w insert output $res\n stderr $w insert output $res\n stderr
@ -2474,7 +2464,7 @@ proc ::tkcon::ErrorHighlight w {
$w tag configure $tag -foreground $COLOR(stdout) $w tag configure $tag -foreground $COLOR(stdout)
$w tag bind $tag <Enter> [list $w tag configure $tag -underline 1] $w tag bind $tag <Enter> [list $w tag configure $tag -underline 1]
$w tag bind $tag <Leave> [list $w tag configure $tag -underline 0] $w tag bind $tag <Leave> [list $w tag configure $tag -underline 0]
$w tag bind $tag <ButtonRelease-1> "if {!\$tkPriv(mouseMoved)} \ $w tag bind $tag <ButtonRelease-1> "if {!\$::tk::Priv(mouseMoved)} \
{[list edit -attach $app -type proc -find $what -- $cmd]}" {[list edit -attach $app -type proc -find $what -- $cmd]}"
} }
set info [string range $info $c1 end] set info [string range $info $c1 end]
@ -2503,7 +2493,7 @@ proc ::tkcon::ErrorHighlight w {
$w tag configure $tag -foreground $COLOR(proc) $w tag configure $tag -foreground $COLOR(proc)
$w tag bind $tag <Enter> [list $w tag configure $tag -underline 1] $w tag bind $tag <Enter> [list $w tag configure $tag -underline 1]
$w tag bind $tag <Leave> [list $w tag configure $tag -underline 0] $w tag bind $tag <Leave> [list $w tag configure $tag -underline 0]
$w tag bind $tag <ButtonRelease-1> "if {!\$tkPriv(mouseMoved)} \ $w tag bind $tag <ButtonRelease-1> "if {!\$::tk::Priv(mouseMoved)} \
{[list edit -attach $app -type proc -- $cmd]}" {[list edit -attach $app -type proc -- $cmd]}"
} }
} }
@ -2552,8 +2542,8 @@ proc tkcon {cmd args} {
## 'congets' a replacement for [gets stdin] ## 'congets' a replacement for [gets stdin]
# Use the 'gets' alias of 'tkcon_gets' command instead of # Use the 'gets' alias of 'tkcon_gets' command instead of
# calling the *get* methods directly for best compatability # calling the *get* methods directly for best compatability
if {[llength $args]} { if {[llength $args] > 1} {
return -code error "wrong # args: must be \"tkcon congets\"" return -code error "wrong # args: must be \"tkcon congets [pfix]\""
} }
tkcon show tkcon show
set old [bind TkConsole <<TkCon_Eval>>] set old [bind TkConsole <<TkCon_Eval>>]
@ -2561,7 +2551,12 @@ proc tkcon {cmd args} {
set w $::tkcon::PRIV(console) set w $::tkcon::PRIV(console)
# Make sure to move the limit to get the right data # Make sure to move the limit to get the right data
$w mark set insert end $w mark set insert end
if {[llength $args]} {
$w mark set limit insert $w mark set limit insert
$w insert end $args
} else {
$w mark set limit insert
}
$w see end $w see end
vwait ::tkcon::PRIV(wait) vwait ::tkcon::PRIV(wait)
set line [::tkcon::CmdGet $w] set line [::tkcon::CmdGet $w]
@ -2798,13 +2793,19 @@ proc tkcon_puts args {
foreach {arg1 arg2 arg3} $args { break } foreach {arg1 arg2 arg3} $args { break }
if {$len == 1} { if {$len == 1} {
tkcon console insert output "$arg1\n" stdout set sarg $arg1
set nl 1
set farg stdout
} elseif {$len == 2} { } elseif {$len == 2} {
if {![string compare $arg1 -nonewline]} { if {![string compare $arg1 -nonewline]} {
tkcon console insert output $arg2 stdout set sarg $arg2
set farg stdout
set nl 0
} elseif {![string compare $arg1 stdout] \ } elseif {![string compare $arg1 stdout] \
|| ![string compare $arg1 stderr]} { || ![string compare $arg1 stderr]} {
tkcon console insert output "$arg2\n" $arg1 set sarg $arg2
set farg $arg1
set nl 1
} else { } else {
set len 0 set len 0
} }
@ -2812,11 +2813,15 @@ proc tkcon_puts args {
if {![string compare $arg1 -nonewline] \ if {![string compare $arg1 -nonewline] \
&& (![string compare $arg2 stdout] \ && (![string compare $arg2 stdout] \
|| ![string compare $arg2 stderr])} { || ![string compare $arg2 stderr])} {
tkcon console insert output $arg3 $arg2 set sarg $arg3
set farg $arg2
set nl 0
} elseif {(![string compare $arg1 stdout] \ } elseif {(![string compare $arg1 stdout] \
|| ![string compare $arg1 stderr]) \ || ![string compare $arg1 stderr]) \
&& ![string compare $arg3 nonewline]} { && ![string compare $arg3 nonewline]} {
tkcon console insert output $arg2 $arg1 set sarg $arg2
set farg $arg1
set nl 0
} else { } else {
set len 0 set len 0
} }
@ -2826,7 +2831,42 @@ proc tkcon_puts args {
## $len == 0 means it wasn't handled by tkcon above. ## $len == 0 means it wasn't handled by tkcon above.
## ##
if {$len == 0} {
if {$len != 0} {
## "poor man's" \r substitution---erase everything on the output
## line and print from character after the \r
set rpt [string last \r $sarg]
if {$rpt >= 0} {
tkcon console delete "insert linestart" "insert lineend"
set sarg [string range $sarg [expr {$rpt + 1}] end]
}
set bpt [string first \b $sarg]
if {$bpt >= 0} {
set narg [string range $sarg [expr {$bpt + 1}] end]
set sarg [string range $sarg 0 [expr {$bpt - 1}]]
set nl 0
}
if {$nl == 0} {
tkcon console insert output $sarg $farg
} else {
tkcon console insert output "$sarg\n" $farg
}
if {$bpt >= 0} {
tkcon console delete "insert -1 char" insert
if {$nl == 0} {
tkcon_puts $farg $narg nonewline
} else {
tkcon_puts $farg $narg
}
}
} else {
global errorCode errorInfo global errorCode errorInfo
if {[catch "tkcon_tcl_puts $args" msg]} { if {[catch "tkcon_tcl_puts $args" msg]} {
regsub tkcon_tcl_puts $msg puts msg regsub tkcon_tcl_puts $msg puts msg
@ -4106,7 +4146,7 @@ proc ::tkcon::Bindings {} {
global tcl_platform tk_version global tcl_platform tk_version
#----------------------------------------------------------------------- #-----------------------------------------------------------------------
# Elements of tkPriv that are used in this file: # Elements of ::tk::Priv that are used in this file:
# #
# char - Character position on the line; kept in order # char - Character position on the line; kept in order
# to allow moving up or down past short lines while # to allow moving up or down past short lines while
@ -4134,6 +4174,9 @@ proc ::tkcon::Bindings {} {
foreach ev [bind Text] { bind TkConsole $ev [bind Text $ev] } foreach ev [bind Text] { bind TkConsole $ev [bind Text $ev] }
## We really didn't want the newline insertion ## We really didn't want the newline insertion
bind TkConsole <Control-Key-o> {} bind TkConsole <Control-Key-o> {}
## in 8.6b3, the virtual events <<NextLine>> and <<PrevLine>>
# mess up our history feature
bind TkConsole <<NextLine>> {} bind TkConsole <<NextLine>> {}
bind TkConsole <<PrevLine>> {} bind TkConsole <<PrevLine>> {}
@ -4342,9 +4385,9 @@ proc ::tkcon::Bindings {} {
bind TkConsole <Control-a> { bind TkConsole <Control-a> {
if {[%W compare {limit linestart} == {insert linestart}]} { if {[%W compare {limit linestart} == {insert linestart}]} {
tkTextSetCursor %W limit ::tk::TextSetCursor %W limit
} else { } else {
tkTextSetCursor %W {insert linestart} ::tk::TextSetCursor %W {insert linestart}
} }
} }
bind TkConsole <Key-Home> [bind TkConsole <Control-a>] bind TkConsole <Key-Home> [bind TkConsole <Control-a>]
@ -4368,14 +4411,14 @@ proc ::tkcon::Bindings {} {
} }
bind TkConsole <<TkCon_Previous>> { bind TkConsole <<TkCon_Previous>> {
if {[%W compare {insert linestart} != {limit linestart}]} { if {[%W compare {insert linestart} != {limit linestart}]} {
tkTextSetCursor %W [tkTextUpDownLine %W -1] ::tk::TextSetCursor %W [::tk::TextUpDownLine %W -1]
} else { } else {
::tkcon::Event -1 ::tkcon::Event -1
} }
} }
bind TkConsole <<TkCon_Next>> { bind TkConsole <<TkCon_Next>> {
if {[%W compare {insert linestart} != {end-1c linestart}]} { if {[%W compare {insert linestart} != {end-1c linestart}]} {
tkTextSetCursor %W [tkTextUpDownLine %W 1] ::tk::TextSetCursor %W [::tk::TextUpDownLine %W 1]
} else { } else {
::tkcon::Event 1 ::tkcon::Event 1
} }
@ -4390,7 +4433,7 @@ proc ::tkcon::Bindings {} {
} }
bind TkConsole <<TkCon_Transpose>> { bind TkConsole <<TkCon_Transpose>> {
## Transpose current and previous chars ## Transpose current and previous chars
if {[%W compare insert > "limit+1c"]} { tkTextTranspose %W } if {[%W compare insert > "limit+1c"]} { ::tk::TextTranspose %W }
} }
bind TkConsole <<TkCon_ClearLine>> { bind TkConsole <<TkCon_ClearLine>> {
## Clear command line (Unix shell staple) ## Clear command line (Unix shell staple)
@ -4408,10 +4451,10 @@ proc ::tkcon::Bindings {} {
::tkcon::Insert %W $::tkcon::PRIV(tmp) ::tkcon::Insert %W $::tkcon::PRIV(tmp)
%W see end %W see end
} }
catch {bind TkConsole <Key-Page_Up> { tkTextScrollPages %W -1 }} catch {bind TkConsole <Key-Page_Up> { ::tk::TextScrollPages %W -1 }}
catch {bind TkConsole <Key-Prior> { tkTextScrollPages %W -1 }} catch {bind TkConsole <Key-Prior> { ::tk::TextScrollPages %W -1 }}
catch {bind TkConsole <Key-Page_Down> { tkTextScrollPages %W 1 }} catch {bind TkConsole <Key-Page_Down> { ::tk::TextScrollPages %W 1 }}
catch {bind TkConsole <Key-Next> { tkTextScrollPages %W 1 }} catch {bind TkConsole <Key-Next> { ::tk::TextScrollPages %W 1 }}
bind TkConsole <$PRIV(meta)-d> { bind TkConsole <$PRIV(meta)-d> {
if {[%W compare insert >= limit]} { if {[%W compare insert >= limit]} {
%W delete insert {insert wordend} %W delete insert {insert wordend}
@ -4429,7 +4472,7 @@ proc ::tkcon::Bindings {} {
} }
bind TkConsole <ButtonRelease-2> { bind TkConsole <ButtonRelease-2> {
if { if {
(!$tkPriv(mouseMoved) || $tk_strictMotif) && (!$::tk::Priv(mouseMoved) || $tk_strictMotif) &&
![catch {::tkcon::GetSelection %W} ::tkcon::PRIV(tmp)] ![catch {::tkcon::GetSelection %W} ::tkcon::PRIV(tmp)]
} { } {
if {[%W compare @%x,%y < limit]} { if {[%W compare @%x,%y < limit]} {