luke
/
OpenSTA
mirror of https://github.com/The-OpenROAD-Project/OpenSTA.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

do not check slew limits on ideal clk nets

This commit is contained in:
James Cherry 2020-03-01 13:10:00 -08:00
parent 9cacb0cfd9
commit 1dbae09fb7
3 changed files with 58 additions and 55 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
dcalc/GraphDelayCalc.hh
View File

@ -101,6 +101,7 @@ public:
virtual float ceff(Edge *edge,
TimingArc *arc,
const DcalcAnalysisPt *dcalc_ap);
virtual bool isIdealClk(const Vertex *vertex) = 0;
// Precedence:
// SDF annotation
// Liberty library

2
dcalc/GraphDelayCalc1.hh
View File

@ -197,7 +197,7 @@ protected:
bool setIdealClks(const Vertex *vertex,
ClockSet *clks);
ClockSet *idealClks(const Vertex *vertex);
bool isIdealClk(const Vertex *vertex);
virtual bool isIdealClk(const Vertex *vertex);
Slew idealClkSlew(const Vertex *vertex,
const RiseFall *rf,
const MinMax *min_max);

110
search/CheckSlewLimits.cc
View File

@ -23,6 +23,7 @@
#include "StaState.hh"
#include "DcalcAnalysisPt.hh"
#include "Corner.hh"
#include "GraphDelayCalc.hh"
#include "PathVertex.hh"
#include "Search.hh"
#include "CheckSlewLimits.hh"
@ -173,66 +174,40 @@ CheckSlewLimits::findLimit(const Pin *pin,
// Return values.
float &limit,
bool &exists) const
{
exists = false;
const Network *network = sta_->network();
Sdc *sdc = sta_->sdc();
bool is_clk = sta_->search()->isClock(vertex);
// Look for clock slew limits.
ClockSet clks;
clockDomains(vertex, clks);
ClockSet::Iterator clk_iter(clks);
while (clk_iter.hasNext()) {
Clock *clk = clk_iter.next();
PathClkOrData clk_data = is_clk ? PathClkOrData::clk : PathClkOrData::data;
float clk_limit;
bool clk_limit_exists;
sdc->slewLimit(clk, rf, clk_data, min_max,
clk_limit, clk_limit_exists);
if (clk_limit_exists
&& (!exists
|| min_max->compare(limit, clk_limit))) {
// Use the tightest clock limit.
limit = clk_limit;
exists = true;
}
}
if (!exists) {
// Default to top ("design") limit.
exists = top_limit_exists_;
limit = top_limit_;
if (network->isTopLevelPort(pin)) {
Port *port = network->port(pin);
float port_limit;
bool port_limit_exists;
sdc->slewLimit(port, min_max, port_limit, port_limit_exists);
// Use the tightest limit.
if (port_limit_exists
if (!sta_->graphDelayCalc()->isIdealClk(vertex)) {
const Network *network = sta_->network();
Sdc *sdc = sta_->sdc();
bool is_clk = sta_->search()->isClock(vertex);
// Look for clock slew limits.
ClockSet clks;
clockDomains(vertex, clks);
ClockSet::Iterator clk_iter(clks);
while (clk_iter.hasNext()) {
Clock *clk = clk_iter.next();
PathClkOrData clk_data = is_clk ? PathClkOrData::clk : PathClkOrData::data;
float clk_limit;
bool clk_limit_exists;
sdc->slewLimit(clk, rf, clk_data, min_max,
clk_limit, clk_limit_exists);
if (clk_limit_exists
&& (!exists
|| min_max->compare(limit, port_limit))) {
limit = port_limit;
|| min_max->compare(limit, clk_limit))) {
// Use the tightest clock limit.
limit = clk_limit;
exists = true;
}
}
else {
float pin_limit;
bool pin_limit_exists;
sdc->slewLimit(pin, min_max,
pin_limit, pin_limit_exists);
// Use the tightest limit.
if (pin_limit_exists
&& (!exists
|| min_max->compare(limit, pin_limit))) {
limit = pin_limit;
exists = true;
}
float port_limit;
bool port_limit_exists;
LibertyPort *port = network->libertyPort(pin);
if (port) {
port->slewLimit(min_max, port_limit, port_limit_exists);
if (!exists) {
// Default to top ("design") limit.
exists = top_limit_exists_;
limit = top_limit_;
if (network->isTopLevelPort(pin)) {
Port *port = network->port(pin);
float port_limit;
bool port_limit_exists;
sdc->slewLimit(port, min_max, port_limit, port_limit_exists);
// Use the tightest limit.
if (port_limit_exists
&& (!exists
@ -241,6 +216,33 @@ CheckSlewLimits::findLimit(const Pin *pin,
exists = true;
}
}
else {
float pin_limit;
bool pin_limit_exists;
sdc->slewLimit(pin, min_max,
pin_limit, pin_limit_exists);
// Use the tightest limit.
if (pin_limit_exists
&& (!exists
|| min_max->compare(limit, pin_limit))) {
limit = pin_limit;
exists = true;
}
float port_limit;
bool port_limit_exists;
LibertyPort *port = network->libertyPort(pin);
if (port) {
port->slewLimit(min_max, port_limit, port_limit_exists);
// Use the tightest limit.
if (port_limit_exists
&& (!exists
|| min_max->compare(limit, port_limit))) {
limit = port_limit;
exists = true;
}
}
}
}
}
}