97 lines
2.5 KiB
C++
97 lines
2.5 KiB
C++
// OpenSTA, Static Timing Analyzer
|
|
// Copyright (c) 2025, Parallax Software, Inc.
|
|
//
|
|
// 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/>.
|
|
//
|
|
// The origin of this software must not be misrepresented; you must not
|
|
// claim that you wrote the original software.
|
|
//
|
|
// Altered source versions must be plainly marked as such, and must not be
|
|
// misrepresented as being the original software.
|
|
//
|
|
// This notice may not be removed or altered from any source distribution.
|
|
|
|
#include "ClockInsertion.hh"
|
|
|
|
namespace sta {
|
|
|
|
ClockInsertion::ClockInsertion(const Clock *clk,
|
|
const Pin *pin) :
|
|
clk_(clk),
|
|
pin_(pin)
|
|
{
|
|
}
|
|
|
|
void
|
|
ClockInsertion::setDelay(const RiseFallBoth *rf,
|
|
const MinMaxAll *min_max,
|
|
const EarlyLateAll *early_late,
|
|
float delay)
|
|
{
|
|
for (auto el_index : early_late->rangeIndex())
|
|
delays_[el_index].setValue(rf, min_max, delay);
|
|
}
|
|
|
|
float
|
|
ClockInsertion::delay(const RiseFall *rf,
|
|
const MinMax *min_max,
|
|
const EarlyLate *early_late)
|
|
{
|
|
float insertion;
|
|
bool exists;
|
|
delays_[early_late->index()].value(rf, min_max, insertion, exists);
|
|
if (exists)
|
|
return insertion;
|
|
else
|
|
return 0.0;
|
|
}
|
|
|
|
void
|
|
ClockInsertion::delay(const RiseFall *rf,
|
|
const MinMax *min_max,
|
|
const EarlyLate *early_late,
|
|
// Return values.
|
|
float &insertion,
|
|
bool &exists)
|
|
|
|
{
|
|
delays_[early_late->index()].value(rf, min_max, insertion, exists);
|
|
if (!exists)
|
|
insertion = 0.0;
|
|
}
|
|
|
|
void
|
|
ClockInsertion::setDelay(const RiseFall *rf,
|
|
const MinMax *min_max,
|
|
const EarlyLate *early_late,
|
|
float delay)
|
|
{
|
|
delays_[early_late->index()].setValue(rf, min_max, delay);
|
|
}
|
|
|
|
void
|
|
ClockInsertion::setDelays(RiseFallMinMax *delays)
|
|
{
|
|
for (auto el_index : EarlyLate::rangeIndex())
|
|
delays_[el_index].setValues(delays);
|
|
}
|
|
|
|
RiseFallMinMax *
|
|
ClockInsertion::delays(const EarlyLate *early_late)
|
|
{
|
|
return &delays_[early_late->index()];
|
|
}
|
|
|
|
} // namespace
|