2018-09-28 17:54:21 +02:00
|
|
|
// OpenSTA, Static Timing Analyzer
|
2025-01-22 02:54:33 +01:00
|
|
|
// Copyright (c) 2025, 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
|
2022-01-04 18:17:08 +01:00
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2018-09-28 17:54:21 +02:00
|
|
|
// GNU General Public License for more details.
|
|
|
|
|
//
|
|
|
|
|
// You should have received a copy of the GNU General Public License
|
2022-01-04 18:17:08 +01:00
|
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
2025-01-22 02:54:33 +01:00
|
|
|
//
|
|
|
|
|
// 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.
|
2018-09-28 17:54:21 +02:00
|
|
|
|
2020-02-16 01:13:16 +01:00
|
|
|
#pragma once
|
2018-09-28 17:54:21 +02:00
|
|
|
|
2020-04-05 23:53:44 +02:00
|
|
|
#include "MinMax.hh"
|
|
|
|
|
#include "NetworkClass.hh"
|
|
|
|
|
#include "SdcClass.hh"
|
|
|
|
|
#include "RiseFallMinMax.hh"
|
|
|
|
|
#include "Transition.hh"
|
2018-09-28 17:54:21 +02:00
|
|
|
|
|
|
|
|
namespace sta {
|
|
|
|
|
|
|
|
|
|
class ClockInsertion
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
ClockInsertion(const Clock *clk, const Pin *pin);
|
|
|
|
|
const Clock *clock() const { return clk_; }
|
|
|
|
|
const Pin *pin() const { return pin_; }
|
2019-11-11 23:30:19 +01:00
|
|
|
float delay(const RiseFall *rf, const MinMax *min_max,
|
2018-09-28 17:54:21 +02:00
|
|
|
const EarlyLate *early_late);
|
2019-11-11 23:30:19 +01:00
|
|
|
void delay(const RiseFall *rf, const MinMax *min_max,
|
2018-09-28 17:54:21 +02:00
|
|
|
const EarlyLate *early_late,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &insertion, bool &exists);
|
|
|
|
|
RiseFallMinMax *delays(const EarlyLate *early_late);
|
2019-11-11 23:30:19 +01:00
|
|
|
void setDelay(const RiseFall *rf, const MinMax *min_max,
|
2018-09-28 17:54:21 +02:00
|
|
|
const EarlyLate *early_late, float delay);
|
2019-11-11 23:30:19 +01:00
|
|
|
void setDelay(const RiseFallBoth *rf, const MinMaxAll *min_max,
|
2018-09-28 17:54:21 +02:00
|
|
|
const EarlyLateAll *early_late, float delay);
|
|
|
|
|
void setDelays(RiseFallMinMax *delays);
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
const Clock *clk_;
|
|
|
|
|
const Pin *pin_;
|
|
|
|
|
RiseFallMinMax delays_[EarlyLate::index_count];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
} // namespace
|