bulletproofing against incremental updates with missing liberty
Signed-off-by: James Cherry <cherry@parallaxsw.com>
This commit is contained in:
parent
5a765a7606
commit
41706e0db6
|
|
@ -344,12 +344,14 @@ Graph::makeWireEdge(Pin *from_pin,
|
||||||
Vertex *from_vertex, *from_bidirect_drvr_vertex;
|
Vertex *from_vertex, *from_bidirect_drvr_vertex;
|
||||||
pinVertices(from_pin, from_vertex, from_bidirect_drvr_vertex);
|
pinVertices(from_pin, from_vertex, from_bidirect_drvr_vertex);
|
||||||
Vertex *to_vertex = pinLoadVertex(to_pin);
|
Vertex *to_vertex = pinLoadVertex(to_pin);
|
||||||
|
if (from_vertex && to_vertex) {
|
||||||
// From and/or to can be bidirect, but edge is always from driver to load.
|
// From and/or to can be bidirect, but edge is always from driver to load.
|
||||||
if (from_bidirect_drvr_vertex)
|
if (from_bidirect_drvr_vertex)
|
||||||
makeEdge(from_bidirect_drvr_vertex, to_vertex, arc_set);
|
makeEdge(from_bidirect_drvr_vertex, to_vertex, arc_set);
|
||||||
else
|
else
|
||||||
makeEdge(from_vertex, to_vertex, arc_set);
|
makeEdge(from_vertex, to_vertex, arc_set);
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
////////////////////////////////////////////////////////////////
|
////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -897,6 +897,8 @@ public:
|
||||||
// loops until the arrivals converge.
|
// loops until the arrivals converge.
|
||||||
// If full=false update arrivals incrementally.
|
// If full=false update arrivals incrementally.
|
||||||
// If full=true update all arrivals from scratch.
|
// If full=true update all arrivals from scratch.
|
||||||
|
// There is rarely any reason to call updateTiming directly because
|
||||||
|
// arrival/required/slack functions implicitly update timing incrementally.
|
||||||
void updateTiming(bool full);
|
void updateTiming(bool full);
|
||||||
// Invalidate all delay calculations. Arrivals also invalidated.
|
// Invalidate all delay calculations. Arrivals also invalidated.
|
||||||
void delaysInvalid();
|
void delaysInvalid();
|
||||||
|
|
|
||||||
|
|
@ -4122,6 +4122,7 @@ Sta::connectPinAfter(Pin *pin)
|
||||||
else {
|
else {
|
||||||
Vertex *vertex, *bidir_drvr_vertex;
|
Vertex *vertex, *bidir_drvr_vertex;
|
||||||
graph_->pinVertices(pin, vertex, bidir_drvr_vertex);
|
graph_->pinVertices(pin, vertex, bidir_drvr_vertex);
|
||||||
|
if (vertex) {
|
||||||
search_->arrivalInvalid(vertex);
|
search_->arrivalInvalid(vertex);
|
||||||
search_->requiredInvalid(vertex);
|
search_->requiredInvalid(vertex);
|
||||||
if (bidir_drvr_vertex) {
|
if (bidir_drvr_vertex) {
|
||||||
|
|
@ -4142,6 +4143,7 @@ Sta::connectPinAfter(Pin *pin)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
sdc_->connectPinAfter(pin);
|
sdc_->connectPinAfter(pin);
|
||||||
sim_->connectPinAfter(pin);
|
sim_->connectPinAfter(pin);
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue