* New: Occurrence_Contains filter that tells if an instance is part of
an Occurrence. Checks for two cases:
- The Instance is part of the *path* of the Occurrence.
- The Instance is the associated entity itself.
* New: In Cell::flattenNets() adds a new parameter Instance* to
allow partial flatten of one instance only.
* Bug: In Anabatic::Disjstra::_materialize() check that the
NetRoutingState exists before trying to access it...
in Dijkstra.cpp/.h, Edge.cpp/.h, GCell.cpp/.h:
*Change: GlobalRouting wires can have different wires' width. One Net's wires has one width only.
in NetRoutingProperty.cpp/.h, PyNetRoutingProperty.cpp/.h:
*New: A wire width parameter is added. It can be set through python script.
* Bug: In Anabatic::Dijsktra, correct the indentation in cdebug calls
(lots of them causing a big shift right).
* New: In Anabatic::TrackSegment, new helper structure SideStack to
manage a set of aligned GCells and their various sides sizes.
* Change: In Anabatic::TrackSegment::computeOptimal(), more accurate
computation of attractors from global segments and variable size
GCells using SideStack.
* Change: In Katana::DataSymmetric::checkPairing(), increase the tolerance
for misaligned symmetrics from 2 to 5 tracks (should be enough for our
narrow channel routing).
* New: In Katana::TrackSegment, add a first flag to enable locking of
priority. If it is set, calls to either "computePriority()" or
"forcePriority()" will have no effect. Added the uint32_t flags
paraphernalia.
* New: In ::computeNetPriority(), overall function to control the call
of TrackSegment::computeAlignedPriority(). The call is done from
NegociateWindow::run().
* New: Katana::TrackSegment::computeAlignedPriority(), order the
TrackSegments aligneds through doglegs to the one with the highest
priority is routed first and others progressively from him. Done by
forcing an ever decreasing priority on the aligneds ones.
The amount of decrease is small so the aligned segments got routed
(ordered) in close, if not contiguous, sequence. Priority is locked
for the order to remain.
* Bug: In Katana::TrackSegment::computePriority(), correct computation
of the priority when there is more than 10 free tracks
(a DbU::toLambda() call was missing, leading to very big priorities).
* Change: In katana::TrackCost CTOR, do not compute a distance to fixed
in the case of analog segments, this is backfiring.
Slight change of the compare function when delta differs. Seems
to improve a little.
* New: In Anabatic_AutoSegments collection, added a Flag to the constructors
to allow different behavior between digital and analog modes.
For "Aligneds" and "Perpandiculars" collections, now manage a new
Flag WithDoglegs to follow aligned globals through local doglegs
(for analog nets).
Adjust the log level of collections to 144 (formerly 145).
* New: In Anabatic::AutoSegment, new flag SegAnalog for segments that are
part of an analog net.
Note that with this flag, we reach the 32 bits limit...
* Change: In Anabatic::Constants, Flags are now declared as BaseFlags
objects and *not* uint64_t. This avoids overload resolution problems with
arithmetical overload of the operators.
The BaseFlags/Flags types are now completly "isolated" from the
uint64_t, it has the advantage of showing where unwanted previous implicit
conversions where occuring.
* Change: In Katana::Constants, Flags values are now of BaseFlags type instead
of uint64_t.
* Change: In Anabatic::Dijkstra, lots of log cleanup.
* Change: In Anabatic::GCell::getSide(), make the "shrink" parameter visible
to allow to substract the topmost and rightmost track for axis span
computation in AutoSegment::computeOptimal(). Used for analog mode.
* Change: In NetRoutingState, added a flag for analog mode. Use uint32_t
for the flags type.
* New: In Isobar, export the NetRoutingState and NetRoutingExtension objects.
* Change: In Anabatic::AutoSegments collections, change the type of all
the flags that where in "unsigned int" (32 bits) to Flags (uint64_t)
as there is now more than 32 flags for functions.
* New: In Ababatic::Constants, added new flag Flags::WithPerpands, which
makes the number of flags tip over 32 bits, thus making mandatory
to uses Flags and not unsigned int.
* New: In Anabatic::AutoSegments_Perpandiculars, manage a new flag
Flags::WithDoglegs to allow to propagate through global segments that
are connecteds via doglegs on local segments. Meaning that there is
a good chance that they could be aligned.
Slighly change the way we propagate on aligned segments: no longer
check for VTee or HTee, but only for same direction and layer as
master.
* New: In Anabatic & Katana, replace all the "int", "long" and their
variants by the less implementation ambiguous "int32_t", "int64_t"
(and variant). This should help to better detect bit trucation in
flags.
Use the type to give a hint about the flags kind:
- Type "Flags", for flags shared among Anabatic & Katana
functions/methods (may also appear in some objects states).
- Type "uint32_t" for flags belonging to an object internal
state of from Hurricane functions flags (those should be
grouped in a Flag subclass in a perfect world).
- Data management concerning Analog GCells optimized
- Improvements of analog paths estimation:
- Save intervals to memorize paths
- Handle equal distance paths
- GlobalRouting takes into account self symmetries and symmetries in pair of nets according to an axis. Self symmetries are symmetries considering one net symmetric to an axis. During the materialize step, they are routed symmetrically according to the axis. Symmetries in pair of nets follow the same principle but with 2 nets.
In LocalGlobalRouting.cpp:
- Minor bug fixed
- Verbose commented
in NetRoutingProperty.cpp/.h:
- Some flags methods methods added
- [Modified] Minor bug fixed
in Dijkstra:
- [Add]: Global routing for analog circuits is enhanced by intervals definition to estimate more precise wirelengh and wire positions. The distance calculation for analog cases has been moved to the horus tool in AnalogGlobalRoute.h.
* New: In Anabatic::AutoSegment, introduce a the kind (associated to a
flag) "LongLocal". Analog GCells can be very wide, so at least some
carefuly choosen long local segments must be took into account as
attractors in the computation of the optimal axis.
* New: In Anabatic::AutoSegment::computeOptimal(), take LongLocal into
account as attractors.
* Change: In ::GCellTopology constructors compare the layers of the
RoutingPads using layer masks instead of Layer pointers. Allows to
find both "METALx" (symbolic) and "metalX" (real).
* Change: In ::GCellTopology::_doHChannel(), _doChannel(), _doStrut()
and _doDevice(), tag long locals as "LongLocal". This need to be
reviewed as it as bind done a bit too quickly.
* Change: In Anabatic::AutoSegment, due too a much bigger span of the
analogic GCells the _optimalMin & _optimalMax bitfields must use
16 bits instead of 8 (they where overflowed).
* New: In Katana, reorganisation of the initialization procedure to fit
both digital and analogic cases. Create an analogInit() method.
* Change: In Katana::RoutingEvent, the _tracksNb and _tracksFree bitfields
where too short for the Analog GCell size, now uses 16 bits instead of
6.
* Bug: In Katana::GraphicKatanEngine::drawGCell(), skip drawing of a
GCell if *both* width and height are under 150 pixels.
* New: In Katana::Session, add a new isOpen() method.
Restriction on vertex are now correctly done.
* Change: Constants
There is only one type of Strut.
* New: LoadGlobalRouting
Detailed Routing can be performed for analog circuits.
The router does not take into account analog constraints yet.
Warnings on "metal2" should be corrected in the future.
Types of GCell considered by the router are: Device, VChannel/HChannel and Strut.
The analog circuit MUST be organized in a slicing structure.
* Bug: In Dijkstra::_materialize(), in some special case a connex component
can is reached by two (or more) vertexes. But of course it will be
connected only through one, all others must be discarteds. The right
one will have it's connex id set, all the others will stay to -1.
So stop any backtrack when the first neighbor of a starting point
has it's connex id *not* set.
- Modified: Matrix is now correctly updated for irregular floorplans.
Dijkstra:
- Modified: Source and Target contacts are now correctly chosen in _materialize.
* Bug: In Hurricane, in StaticObservable::getObserver(), if the slot
pointer is NULL, do not try to access the owner. Returns NULL, so
the caller can be aware of the situation...
* Change: In Hurricane, in BreakpointWidget & ExceptionWidget some
cosmetic changes (fonts and window sizes).
* Bug: In Anabatic, In AutoHorizontal::getConstraints(), take into account
the constraints from the source AutoContact, as it holds the constraints
transmitted by the RoutingPads and sets up by propageConstraintsFromRp().
It is likely to be a bug affecting the original Katabatic as well.
* Change: In Anabatic, in RawGCellsUnder(), check that the segment is not
completly oustside the cell abutment box and truncate the coordinates
to the part that is inside. Use the "shrink" if we reach the east/north
border.
* Change: In Anabatic, in Configuration, no more decorator because we will
use a true derived relationship. Katana *derives* from *Anabatic* and do
not *decorate* it, so the Configuration can do the same. It also implies
that we directly create a Katana engine, not an Anabatic one.
* Change: In Anabatic, in Session, do not allow the opening of the Session
in a standalone fashion (with a static method). Instead it must be opened
using the relevant method of the Anabatic/Katana engine. This ensure we
are opening the right Session type.
* Change: In Anabatic, in AutoSegment_Aligneds() collection the seed segment
is not part of the collection by default, but will be included if the
Flags::WithSelf is set.
* Change: In Configuration, all the flags value are now defined in two steps.
Declared in the header and initialized in the module. This is to prevent
the fact that on some cases, in relation with the Python "extern C" part
modules, we need a true allocated variable. It was causing weird linking
problems.
A side effect is that they can no longer be used as entry is switches,
have to replace them by if/else.
* New: In Anabatic, new GCell::getNeighborAt() utility function.
* Bug: In Anabatic, in GCell::doGrid(), tag all the GCells of the grid with
the grid type... Back annote all the edges capacity (north & east) with
the reserved local capacity.
* New: Complete portage of Kite over Anabatic. The new engine is christened
"Katana" for Kite-Analogic. When it's capabilities and performances
will be on a part with Kite, it is to completly replace it (and take
back the "Kite" name). Preliminary tests seems to show that, contrary
to intuition (because built on a more complex/slower grid), it is even
slightly faster than Kite 8-).
* New: In Anabatic:
- In AnabaticEngine, create a new NetData information for storing
the static ordering of nets (for the global routing). The order
is the half perimeter of the search area divided by the number
of RoutingPads. The order is static once it as been computed in
the first place (even through ripup stages).
* Change: In Anabatic:
- Long wires, going straight accross multiple GCells were splitted
into a long sequence of segment+contact, one for each gone-through
GCell. It was memory-consuming and algorithmically inefficient.
Now there is only one straight wire.
As a consequence, Edges now store the list of all segments
going through them. That way we do not need to load a Net into
Dijkstra before riping up some of it's segment. The ripup mechanims
can now be implemented right at AnabaticEngine level, without
dependencies over Dijkstra. Note that long wires are automatically
broken in two if we need to attach a new branch on it (breakAt()).
And fused back into one if a branch is removed (unify()).
* New: In Anabatic:
- In AnabaticEngine, keep track of overflowed edges.
- In AnabaticEngine, getNetsFromedge() to lookup all nets going
through an Edge.
- In Configuration, read the Kite "reserved local" parameter to
decrease the Edge capacity (it's a guessing of the cost of the
local routing).
- In Edge, add an attribute to know if there is an associated
segment of the current net (set by Dijkstra::_traceback()).
Transparently manage the overflowed edges.
- In GCell_Edges, correct a filtering bug when not all sides are
selecteds.
- New GCell::getEdgeTo() to find the edge between two adjacent
GCells.
- New GCell::unrefContact() to automatically removes global contacts
no longer used by any global segments (used during the ripup
step).
- In Dijkstra::load(), now able to "reload" and already partially
or completly routed net (look for Contact of "gcontact" layer
and their attached segments).
- In Dijkstra, keep the last net loaded until the next one is.
Put the cleanup operations in an isolated function "_cleanup()".
- In Dijkstra::_selectFirstsource() and run(), load first source
component made of multiple vertexes.
- In Dijkstra::_trackback(), link the Net segments to the Edges.
- New Dijkstra::ripup(), Dijkstra::_propagateRipup() to perform
the ripup of one edge of a Net (must be loaded in Dijkstra first).
Dijkstra::_tagConnecteds() setup the connexId of a set of Vertexes
- that are connecteds through edges *with* segments.
- In GraphicAnabaticengine & GlobalRoute.cpp, embryo of a global
routing tool with ripup & reroute.
- (Add) HurricaneAMS includes
in Dijkstra:
- (Add+Modify) Handle restriction rules in Vertex for analog devices
in GCell:
- (Add) Check neighboring cells (North/South/East/West)
* Change: In Anabatic:
- In Dijkstra, replace _toWires() by _trackback() which is called
immediatly on reaching a target.
- In Constants & GCell, added flags for typing the GCells. We now
have:
* DeviceGCell, for analogic devices.
* ChannelGCell, for resizable routing channels.
* StrutGCell, for fixed spaces in analog designs.
* MatrixGCell, for square tile in digital designs.
* Bug: In Anabatic:
- In _propagate(), on reaching a target, forgot to remove it from
the queue before pushing it back with the new distance. It also
simplificate the core algorithm as target as treated normal nodes.
* New: In Anabatic:
- Update cdebug to use the fastest macro version.
- More readable drawings of GCells and Edges.
- Added timer support.
- The distance is now computed in DbU::Unit (aka long) and not in
normalized float.
- The distance function is now a callback (std::function<>) that
can be changed (a default is provided at initialization).
- New concept of branch in the agglomerated connex component.
Each trace back part create a "branch" (tagged with a "branchId").
When a node is reached with the same distance, but from two
different branches, choose the the branch that was lastly created.
This create a slightly different tree which grows outward from
the newest branches.
- Makes the horizontal edges *slightly* longer than the vertical ones
to skew the tree to use vertical edges, as it is usually less
congested than the horiontal one (due to metal1 cell terminals).
It is also my understanding that it is useful to reduce the
number of vias, whithout introducing a via cost.
* New: In Bootstrap:
- Script sprof.py to perform sprof & demangle libraries execution
profile.
* ToDo: In Anabatic:
- Corner optimization. Sometimes when two corners are possible, the
wrong one is choosen. That is, one of it's edge cannot be used for
further grow of the tree.
* Bug: In Anabatic:
- Activate the searchArea to limit the area explored by the Dijkstra.
Uses the bounding boxes of the vertexes/gcells instead of the ones
the RoutingPads.
- Always detach contacts from the rings in load(), even if the vertex
is already marked as target.
- On reaching a target (non-negative connexId), do not forget to update
the distance to source.
- In Edges locator, added support for side selection (needed by the
monotonic feature).
* New: In Anabatic:
- Hide the atomic Dijkstra methods (made private).
- Implementation of the monotonic mode in Dijkstra (for bipoints only).
- Added a separate function for distance computation between two vertexes,
now take account of the VIAs costs.
* Bug: In Anabatic:
- In Dijktra::load(), do not create Contact while looping over the Net's
components (for RoutingPads).
- In Dijkstra::propagate(), reset the connexId of reached Vertexes
on updating the stamp to avoid using connexId from previous runs.
Push the vertexes on the queue while backtracking (with a distance
of 0.0). Do not reset the "_from" as we need it in Dijkstra::toWires()
to know how were the routing is.
- In Edge::getDistance(), convert to float more early so the normalisation
do not always end up in zero.
- In GCell::_add(), when the axis of the new edge is equal to one already
on the given side, adds it *after* the existing edge and not before.
(to be coherent with the way GCells are split in two)
- In GCell::hcut() and GCell::vcut(), create an Edge if is equal to X/Y Max,
*but* the new chunk is flat. The new chunk is then expected to expand
"below".
- In GraphicsAnabaticEngine::drawGCell(), display the id of the GCell in
a small box at the center of it's bounding box. Nothing displayed for
flat GCells, to avoid cluttering.
* Bug: In Anabatic:
- In Dijkstra/Vertex, use the new Observer for fast access from the GCells.
- In Dijktra::propagate() loop detection.
- In Dijkstra, reset the "_from" of vertexes between two propagates on
the same Net (otherwise: loops...).
- In Matrix, there must be two different way of calculating an index from
a position. One for the min, which is rounded to superior. And one for
the max which is rounded to inferior.
- In Matrix::updateArea(), checks for invalid indexes.
* Bug: In Anabatic:
- In Edge, materialize was done before the Edge get it's final position.
Must be invalidated afterwards for the UpdateSession to put him in
the correct QuadTree.
- Functional (debugged) Dijkstra skeleton.
EricLaoGitHub
Jean-Paul Chaput