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

minor 

Signed-off-by: James Cherry <cherry@parallaxsw.com>
This commit is contained in:
James Cherry 2022-06-11 16:28:13 -07:00
parent cdf7e4e466
commit eaf41c446e
3 changed files with 30 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
dcalc/GraphDelayCalc1.cc
View File

@ -710,10 +710,9 @@ GraphDelayCalc1::driveCellDefaultFromPort(LibertyCell *cell,
{
LibertyPort *from_port = 0;
int from_port_index = 0;
LibertyCellTimingArcSetIterator set_iter(cell);
LibertyCellTimingArcSetIterator set_iter(cell, nullptr, to_port);
while (set_iter.hasNext()) {
TimingArcSet *arc_set = set_iter.next();
if (arc_set->to() == to_port) {
LibertyPort *set_from_port = arc_set->from();
int set_from_port_index = findPortIndex(cell, set_from_port);
if (from_port == nullptr
@ -722,7 +721,6 @@ GraphDelayCalc1::driveCellDefaultFromPort(LibertyCell *cell,
from_port_index = set_from_port_index;
}
}
}
return from_port;
}
@ -756,11 +754,9 @@ GraphDelayCalc1::findInputDriverDelay(LibertyCell *drvr_cell,
debugPrint(debug_, "delay_calc", 2, " driver cell %s %s",
drvr_cell->name(),
rf->asString());
LibertyCellTimingArcSetIterator set_iter(drvr_cell);
LibertyCellTimingArcSetIterator set_iter(drvr_cell, from_port, to_port);
while (set_iter.hasNext()) {
TimingArcSet *arc_set = set_iter.next();
if (arc_set->from() == from_port
&& arc_set->to() == to_port) {
TimingArcSetArcIterator arc_iter(arc_set);
while (arc_iter.hasNext()) {
TimingArc *arc = arc_iter.next();
@ -772,7 +768,6 @@ GraphDelayCalc1::findInputDriverDelay(LibertyCell *drvr_cell,
}
}
}
}
// Driving cell delay is the load dependent delay, which is the gate
// delay minus the intrinsic delay. Driving cell delays are annotated

1
include/sta/TableModel.hh
View File

@ -428,6 +428,7 @@ public:
float axisValue(size_t index) const { return (*values_)[index]; }
// Find the index for value such that axis[index] <= value < axis[index+1].
size_t findAxisIndex(float value) const;
FloatSeq *values() const { return values_; }
private:
TableAxisVariable variable_;

16
sdc/RiseFallMinMax.cc
View File

@ -26,29 +26,29 @@ RiseFallMinMax::RiseFallMinMax()
void
RiseFallMinMax::clear()
{
for (int tr_index=0; tr_index<RiseFall::index_count; tr_index++) {
for (int rf_index = 0; rf_index<RiseFall::index_count; rf_index++) {
for (int mm_index = 0; mm_index < MinMax::index_count; mm_index++) {
exists_[tr_index][mm_index] = false;
exists_[rf_index][mm_index] = false;
}
}
}
RiseFallMinMax::RiseFallMinMax(float init_value)
{
for (int tr_index=0;tr_index<RiseFall::index_count;tr_index++) {
for (int rf_index = 0 ; rf_index < RiseFall::index_count ; rf_index++) {
for (int mm_index = 0; mm_index < MinMax::index_count; mm_index++) {
values_[tr_index][mm_index] = init_value;
exists_[tr_index][mm_index] = true;
values_[rf_index][mm_index] = init_value;
exists_[rf_index][mm_index] = true;
}
}
}
RiseFallMinMax::RiseFallMinMax(const RiseFallMinMax *rfmm)
{
for (int tr_index=0;tr_index<RiseFall::index_count;tr_index++) {
for (int rf_index = 0 ; rf_index < RiseFall::index_count ; rf_index++) {
for (int mm_index = 0; mm_index < MinMax::index_count; mm_index++) {
values_[tr_index][mm_index] = rfmm->values_[tr_index][mm_index];
exists_[tr_index][mm_index] = rfmm->exists_[tr_index][mm_index];
values_[rf_index][mm_index] = rfmm->values_[rf_index][mm_index];
exists_[rf_index][mm_index] = rfmm->exists_[rf_index][mm_index];
}
}
}