- 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-).
* Bug: In Hurricane, in NetlistWidget CTOR, the horizontal header was set
up assuing that there was (at least) three sections (column) in the
model, which was wrong. Now it is done in the setCell() method which
know the exact number of sections.
It was a bug in both Qt 4 & 5, but was showing only under Qt 5.
* Bug: In Hurricane, in Backtrace, under RHEL 6 when the package
<devtoolset-2-binutils-devel> is *not* installed, Backtrace uses the
wrong "bfd.h" from the system instead of the one from the devtoolset2,
causing itself to core.
The Backtrace, then try to create a second Backtrace from this
error, generating an infinite loop. To prevent this situation add a
counter so that only one Backtrace can be created at a any time.
And incidentally display a more meaningful error message along with
* Bug: In Anabatic::GCell, when width and/or heigh is null, do not try to
compute densities as it will trigger a divide by zero (and do not make
much sense anyway).
* Change: In CRL Core, in cmos/alliance.conf, honor the ALLIANCE_TOP variable
if it is found in the user's environement.
* New: In Bootstrap, add cmake detection for libbfd.
* New: In Hurricane, in Backtrace, add BFD support to read debuginfo from
the shared libraries (aka DSO) when compiled with "-g". This avoid the
tedious step of running gdb after generating a core dump. It is also
mandatory in ExceptioWidget to known from where an exception was thrown
as Qt::notify() block all C++ exceptions.
Currently works only under Linux (gcc or clang), may be extended in
the future.
The BFD reading is based on the small utility from:
Don Hatch (hatch@plunk.org)
http://www.plunk.org/~hatch/goodies/backtracefilt.C
And small trinket: adjust the size of the window for high DPI screens.
* New: In CRL Core & Unicorn add link toward libbfd, if needed.
* 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()).
* Bug: In Cumulus, in ClockTree plugin in GaugeConf._rpAccess() do not
create the stack of access VIAs each time the function is called.
Instead maintain a lookup table of the already generated ones.
Was blocking the loading of pre-routed nets in Anabatic.
* Bug: In Hurricane, in tstream (Commons.h), in the *template* overload of
operator<<(), do not use the operator<<() of ostream as it will be
looked up in "stage 1" (template definition) and so will miss all the
overloads added later and built over getString<>(). Instead, make use
of getString<>(), which, as another template will be looked up in
"stage 2" (template instanciation) and at that point will have all the
needed template specialisation of getString<>().
We also need to define new stream manipulators to be able to create
a matching template overload not dependant from the implementation.
To avoid name clashes, we prefix a 't'. For now, only 'tsetw()' is
refined.
As a side effect, we cannot directly print bit-fields into the stream,
we must go through an intermediate variable (happens once in AutoContact).
* 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.
* Change: In Hurricane Commons.h, even when cdebug print nothing, it slow
down the program (three times for Kite!). Create a macro cdebug_log
which calls cdebug *only* if the debug level is active.
* 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.
Jean-Paul Chaput
EricLaoGitHub
Roselyne Chotin-Avot
Gabriel Gouvine