OpenSTA/include/sta/StaState.hh

140 lines
4.6 KiB
C++
Raw Normal View History

2018-09-28 17:54:21 +02:00
// OpenSTA, Static Timing Analyzer
// 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
// 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
// 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.
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
namespace sta {
class Report;
class Debug;
class Units;
class Network;
class NetworkEdit;
class NetworkReader;
class Sdc;
class Corners;
class Graph;
class Edge;
2018-09-28 17:54:21 +02:00
class Levelize;
class Sim;
class Search;
class Parasitics;
class ArcDelayCalc;
class GraphDelayCalc;
class Latches;
2020-08-09 03:44:19 +02:00
class ClkNetwork;
2019-11-11 16:48:27 +01:00
class DispatchQueue;
class Variables;
2018-09-28 17:54:21 +02:00
// Most STA components use functionality in other components.
// This class simplifies the process of copying pointers to the
// components. It is deliberately simple to minimize circular
// dependencies between the it and the components.
class StaState
{
public:
// Make an empty state.
StaState();
StaState(const StaState *sta);
2018-09-28 17:54:21 +02:00
// Copy the state from sta. This is virtual so that a component
// can notify sub-components.
virtual void copyState(const StaState *sta);
virtual ~StaState() {}
Report *report() { return report_; }
Report *report() const { return report_; }
2019-10-25 17:51:59 +02:00
void setReport(Report *report);
2018-09-28 17:54:21 +02:00
Debug *debug() { return debug_; }
Debug *debug() const { return debug_; }
2019-10-25 17:51:59 +02:00
void setDebug(Debug *debug);
2018-09-28 17:54:21 +02:00
Units *units() { return units_; }
Units *units() const { return units_; }
2020-02-12 17:19:36 +01:00
void copyUnits(const Units *units);
2018-09-28 17:54:21 +02:00
Network *network() { return network_; }
Network *network() const { return network_; }
NetworkEdit *networkEdit();
NetworkEdit *networkEdit() const;
NetworkReader *networkReader();
NetworkReader *networkReader() const;
Network *sdcNetwork() { return sdc_network_; }
Network *sdcNetwork() const { return sdc_network_; }
// Command network uses the SDC namespace.
Network *cmdNetwork() { return cmd_network_; }
Network *cmdNetwork() const { return cmd_network_; }
Sdc *sdc() { return sdc_; }
Sdc *sdc() const { return sdc_; }
Corners *corners() { return corners_; }
Corners *corners() const { return corners_; }
Graph *graph() { return graph_; }
Graph *graph() const { return graph_; }
Levelize *levelize() { return levelize_; }
Levelize *levelize() const { return levelize_; }
Parasitics *parasitics() { return parasitics_; }
Parasitics *parasitics() const { return parasitics_; }
ArcDelayCalc *arcDelayCalc() { return arc_delay_calc_; }
ArcDelayCalc *arcDelayCalc() const { return arc_delay_calc_; }
GraphDelayCalc *graphDelayCalc() { return graph_delay_calc_; }
GraphDelayCalc *graphDelayCalc() const { return graph_delay_calc_; }
Sim *sim() { return sim_; }
Sim *sim() const { return sim_; }
Search *search() { return search_; }
Search *search() const { return search_; }
Latches *latches() { return latches_; }
Latches *latches() const { return latches_; }
2020-08-10 07:33:32 +02:00
ClkNetwork *clkNetwork() { return clk_network_; }
ClkNetwork *clkNetwork() const { return clk_network_; }
2018-09-28 17:54:21 +02:00
unsigned threadCount() const { return thread_count_; }
2019-03-13 01:25:53 +01:00
float sigmaFactor() const { return sigma_factor_; }
bool crprActive() const;
Variables *variables() { return variables_; }
const Variables *variables() const { return variables_; }
// Edge is default cond disabled by timing_disable_cond_default_arcs var.
bool isDisabledCondDefault(Edge *edge) const;
2018-09-28 17:54:21 +02:00
protected:
Report *report_;
Debug *debug_;
Units *units_;
Network *network_;
Network *sdc_network_;
// Network used by command interpreter (SdcNetwork).
Network *cmd_network_;
Sdc *sdc_;
Corners *corners_;
Graph *graph_;
Levelize *levelize_;
Parasitics *parasitics_;
ArcDelayCalc *arc_delay_calc_;
GraphDelayCalc *graph_delay_calc_;
Sim *sim_;
Search *search_;
Latches *latches_;
2020-08-09 03:44:19 +02:00
ClkNetwork *clk_network_;
Variables *variables_;
2018-09-28 17:54:21 +02:00
int thread_count_;
2019-11-11 16:48:27 +01:00
DispatchQueue *dispatch_queue_;
2019-03-13 01:25:53 +01:00
float sigma_factor_;
2018-09-28 17:54:21 +02:00
};
} // namespace