OpenSTA/include/sta/PathAnalysisPt.hh

62 lines
2.0 KiB
C++
Raw Normal View History

2018-09-28 17:54:21 +02:00
// OpenSTA, Static Timing Analyzer
2020-03-07 03:50:37 +01:00
// Copyright (c) 2020, 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/>.
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 "DisallowCopyAssign.hh"
#include "Iterator.hh"
#include "MinMax.hh"
#include "SdcClass.hh"
#include "SearchClass.hh"
2018-09-28 17:54:21 +02:00
namespace sta {
class MinMax;
class DcalcAnalysisPt;
class Corner;
class PathAnalysisPt
{
public:
PathAnalysisPt(Corner *corner,
PathAPIndex index,
const MinMax *path_min_max,
DcalcAnalysisPt *dcalc_ap);
Corner *corner() const { return corner_; }
PathAPIndex index() const { return index_; }
const MinMax *pathMinMax() const { return path_min_max_; }
// Converging path arrival merging.
const MinMax *mergeMinMax() const { return path_min_max_; }
// Path analysis point for timing check target clock arrivals.
PathAnalysisPt *tgtClkAnalysisPt() const { return tgt_clk_ap_; }
void setTgtClkAnalysisPt(PathAnalysisPt *path_ap);
DcalcAnalysisPt *dcalcAnalysisPt() const { return dcalc_ap_; }
PathAnalysisPt *insertionAnalysisPt(const EarlyLate *early_late) const;
void setInsertionAnalysisPt(const EarlyLate *early_late, PathAnalysisPt *ap);
private:
DISALLOW_COPY_AND_ASSIGN(PathAnalysisPt);
Corner *corner_;
PathAPIndex index_;
const MinMax *path_min_max_;
PathAnalysisPt *tgt_clk_ap_;
PathAnalysisPt *insertion_aps_[EarlyLate::index_count];
DcalcAnalysisPt *dcalc_ap_;
};
} // namespace