OpenSTA/sdc/ClockInsertion.cc

90 lines
2.2 KiB
C++
Raw Normal View History

2018-09-28 17:54:21 +02:00
// OpenSTA, Static Timing Analyzer
2019-01-01 21:26:11 +01:00
// Copyright (c) 2019, Parallax Software, Inc.
2018-09-28 17:54:21 +02:00
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
#include "Machine.hh"
#include "ClockInsertion.hh"
namespace sta {
2019-07-18 15:19:00 +02:00
ClockInsertion::ClockInsertion(const Clock *clk,
const Pin *pin) :
2018-09-28 17:54:21 +02:00
clk_(clk),
pin_(pin)
{
}
void
ClockInsertion::setDelay(const TransRiseFallBoth *tr,
const MinMaxAll *min_max,
2019-07-18 15:19:00 +02:00
const EarlyLateAll *early_late,
float delay)
2018-09-28 17:54:21 +02:00
{
2019-07-18 15:19:00 +02:00
for (auto el_index : early_late->rangeIndex())
delays_[el_index].setValue(tr, min_max, delay);
2018-09-28 17:54:21 +02:00
}
float
2019-07-18 15:19:00 +02:00
ClockInsertion::delay(const TransRiseFall *tr,
const MinMax *min_max,
2018-09-28 17:54:21 +02:00
const EarlyLate *early_late)
{
float insertion;
bool exists;
delays_[early_late->index()].value(tr, min_max, insertion, exists);
if (exists)
return insertion;
else
return 0.0;
}
void
2019-07-18 15:19:00 +02:00
ClockInsertion::delay(const TransRiseFall *tr,
const MinMax *min_max,
2018-09-28 17:54:21 +02:00
const EarlyLate *early_late,
// Return values.
2019-07-18 15:19:00 +02:00
float &insertion,
bool &exists)
2018-09-28 17:54:21 +02:00
{
delays_[early_late->index()].value(tr, min_max, insertion, exists);
if (!exists)
insertion = 0.0;
}
void
ClockInsertion::setDelay(const TransRiseFall *tr,
const MinMax *min_max,
2019-07-18 15:19:00 +02:00
const EarlyLate *early_late,
float delay)
2018-09-28 17:54:21 +02:00
{
delays_[early_late->index()].setValue(tr, min_max, delay);
}
void
ClockInsertion::setDelays(RiseFallMinMax *delays)
{
2019-07-18 15:19:00 +02:00
for (auto el_index : EarlyLate::rangeIndex())
delays_[el_index].setValues(delays);
2018-09-28 17:54:21 +02:00
}
RiseFallMinMax *
ClockInsertion::delays(const EarlyLate *early_late)
{
return &delays_[early_late->index()];
}
} // namespace