2018-09-28 17:54:21 +02:00
|
|
|
// OpenSTA, Static Timing Analyzer
|
2024-01-12 01:34:49 +01:00
|
|
|
// Copyright (c) 2024, 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/>.
|
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
|
|
|
|
2023-11-19 18:04:45 +01:00
|
|
|
#include <vector>
|
2024-02-01 01:14:07 +01:00
|
|
|
#include <mutex>
|
2023-11-19 18:04:45 +01:00
|
|
|
|
2023-11-11 20:33:55 +01:00
|
|
|
#include "Map.hh"
|
|
|
|
|
#include "NetworkClass.hh"
|
2020-04-05 23:53:44 +02:00
|
|
|
#include "GraphClass.hh"
|
2023-11-11 20:33:55 +01:00
|
|
|
#include "SearchClass.hh"
|
2020-04-05 23:53:44 +02:00
|
|
|
#include "DcalcAnalysisPt.hh"
|
|
|
|
|
#include "StaState.hh"
|
2023-11-11 20:33:55 +01:00
|
|
|
#include "Delay.hh"
|
2024-01-07 21:44:04 +01:00
|
|
|
#include "ArcDelayCalc.hh"
|
2018-09-28 17:54:21 +02:00
|
|
|
|
|
|
|
|
namespace sta {
|
|
|
|
|
|
2023-11-19 18:04:45 +01:00
|
|
|
using std::vector;
|
2024-01-07 21:44:04 +01:00
|
|
|
using std::map;
|
2023-11-19 18:04:45 +01:00
|
|
|
|
2018-09-28 17:54:21 +02:00
|
|
|
class DelayCalcObserver;
|
2023-11-11 20:33:55 +01:00
|
|
|
class MultiDrvrNet;
|
|
|
|
|
class FindVertexDelays;
|
2023-11-19 18:04:45 +01:00
|
|
|
class NetCaps;
|
2018-09-28 17:54:21 +02:00
|
|
|
|
2023-11-11 20:33:55 +01:00
|
|
|
typedef Map<const Vertex*, MultiDrvrNet*> MultiDrvrNetMap;
|
|
|
|
|
|
|
|
|
|
// This class traverses the graph calling the arc delay calculator and
|
|
|
|
|
// annotating delays on graph edges.
|
2018-09-28 17:54:21 +02:00
|
|
|
class GraphDelayCalc : public StaState
|
|
|
|
|
{
|
|
|
|
|
public:
|
2023-11-11 20:33:55 +01:00
|
|
|
GraphDelayCalc(StaState *sta);
|
|
|
|
|
virtual ~GraphDelayCalc();
|
|
|
|
|
virtual void copyState(const StaState *sta);
|
|
|
|
|
// Set the observer for edge delay changes.
|
|
|
|
|
virtual void setObserver(DelayCalcObserver *observer);
|
2018-09-28 17:54:21 +02:00
|
|
|
// Invalidate all delays/slews.
|
2023-11-11 20:33:55 +01:00
|
|
|
virtual void delaysInvalid();
|
2018-09-28 17:54:21 +02:00
|
|
|
// Invalidate vertex and downstream delays/slews.
|
2023-11-11 20:33:55 +01:00
|
|
|
virtual void delayInvalid(Vertex *vertex);
|
|
|
|
|
virtual void delayInvalid(const Pin *pin);
|
|
|
|
|
virtual void deleteVertexBefore(Vertex *vertex);
|
2018-09-28 17:54:21 +02:00
|
|
|
// Reset to virgin state.
|
2023-11-11 20:33:55 +01:00
|
|
|
virtual void clear();
|
|
|
|
|
// Find arc delays and vertex slews thru level.
|
|
|
|
|
virtual void findDelays(Level level);
|
|
|
|
|
// Find and annotate drvr_vertex gate and load delays/slews.
|
|
|
|
|
virtual void findDelays(Vertex *drvr_vertex);
|
2018-09-28 17:54:21 +02:00
|
|
|
// Returned string is owned by the caller.
|
2023-11-19 18:04:45 +01:00
|
|
|
virtual string reportDelayCalc(const Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
2023-03-24 23:15:57 +01:00
|
|
|
const Corner *corner,
|
|
|
|
|
const MinMax *min_max,
|
|
|
|
|
int digits);
|
2018-09-28 17:54:21 +02:00
|
|
|
// Percentage (0.0:1.0) change in delay that causes downstream
|
|
|
|
|
// delays to be recomputed during incremental delay calculation.
|
|
|
|
|
virtual float incrementalDelayTolerance();
|
2023-11-11 20:33:55 +01:00
|
|
|
virtual void setIncrementalDelayTolerance(float tol);
|
2024-02-08 21:54:52 +01:00
|
|
|
|
|
|
|
|
float loadCap(const Pin *drvr_pin,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap) const;
|
2023-11-19 18:04:45 +01:00
|
|
|
float loadCap(const Pin *drvr_pin,
|
2024-02-08 21:54:52 +01:00
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap) const;
|
|
|
|
|
void loadCap(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &pin_cap,
|
|
|
|
|
float &wire_cap) const;
|
|
|
|
|
void netCaps(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &pin_cap,
|
|
|
|
|
float &wire_cap,
|
|
|
|
|
float &fanout,
|
|
|
|
|
bool &has_set_load) const;
|
2024-01-07 21:44:04 +01:00
|
|
|
LoadPinIndexMap makeLoadPinIndexMap(Vertex *drvr_vertex);
|
|
|
|
|
void findDriverArcDelays(Vertex *drvr_vertex,
|
|
|
|
|
Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
2018-09-28 17:54:21 +02:00
|
|
|
// Precedence:
|
|
|
|
|
// SDF annotation
|
|
|
|
|
// Liberty library
|
|
|
|
|
// (ignores set_min_pulse_width constraint)
|
|
|
|
|
void minPulseWidth(const Pin *pin,
|
2019-11-11 23:30:19 +01:00
|
|
|
const RiseFall *hi_low,
|
2018-09-28 17:54:21 +02:00
|
|
|
DcalcAPIndex ap_index,
|
|
|
|
|
const MinMax *min_max,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &min_width,
|
|
|
|
|
bool &exists);
|
|
|
|
|
// Precedence:
|
|
|
|
|
// SDF annotation
|
|
|
|
|
// Liberty library
|
|
|
|
|
void minPeriod(const Pin *pin,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &min_period,
|
|
|
|
|
bool &exists);
|
2023-11-11 20:33:55 +01:00
|
|
|
|
2023-11-19 18:04:45 +01:00
|
|
|
Slew edgeFromSlew(const Vertex *from_vertex,
|
|
|
|
|
const RiseFall *from_rf,
|
|
|
|
|
const Edge *edge,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
|
|
|
|
|
2023-11-11 20:33:55 +01:00
|
|
|
protected:
|
|
|
|
|
void seedInvalidDelays();
|
|
|
|
|
void initSlew(Vertex *vertex);
|
|
|
|
|
void seedRootSlew(Vertex *vertex,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void seedRootSlews();
|
|
|
|
|
void seedDrvrSlew(Vertex *vertex,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void seedNoDrvrSlew(Vertex *drvr_vertex,
|
|
|
|
|
const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void seedNoDrvrCellSlew(Vertex *drvr_vertex,
|
|
|
|
|
const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
InputDrive *drive,
|
|
|
|
|
DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void seedLoadSlew(Vertex *vertex);
|
|
|
|
|
void setInputPortWireDelays(Vertex *vertex);
|
|
|
|
|
void findInputDriverDelay(const LibertyCell *drvr_cell,
|
|
|
|
|
const Pin *drvr_pin,
|
|
|
|
|
Vertex *drvr_vertex,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const LibertyPort *from_port,
|
|
|
|
|
float *from_slews,
|
|
|
|
|
const LibertyPort *to_port,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
|
|
|
|
LibertyPort *driveCellDefaultFromPort(const LibertyCell *cell,
|
|
|
|
|
const LibertyPort *to_port);
|
|
|
|
|
int findPortIndex(const LibertyCell *cell,
|
|
|
|
|
const LibertyPort *port);
|
2023-11-19 18:04:45 +01:00
|
|
|
void findInputArcDelay(const Pin *drvr_pin,
|
2023-11-11 20:33:55 +01:00
|
|
|
Vertex *drvr_vertex,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
float from_slew,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
|
|
|
|
bool findDriverDelays(Vertex *drvr_vertex,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
2024-02-01 01:14:07 +01:00
|
|
|
MultiDrvrNet *multiDrvrNet(const Vertex *drvr_vertex) const;
|
2023-11-19 18:04:45 +01:00
|
|
|
MultiDrvrNet *findMultiDrvrNet(Vertex *drvr_pin);
|
2024-02-01 01:14:07 +01:00
|
|
|
MultiDrvrNet *makeMultiDrvrNet(Vertex *drvr_vertex);
|
|
|
|
|
bool hasMultiDrvrs(Vertex *drvr_vertex);
|
|
|
|
|
Vertex *firstLoad(Vertex *drvr_vertex);
|
2023-11-11 20:33:55 +01:00
|
|
|
bool findDriverDelays1(Vertex *drvr_vertex,
|
|
|
|
|
MultiDrvrNet *multi_drvr,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
2023-11-13 02:39:02 +01:00
|
|
|
void initLoadSlews(Vertex *drvr_vertex);
|
2024-01-07 21:44:04 +01:00
|
|
|
bool findDriverEdgeDelays(Vertex *drvr_vertex,
|
2023-11-19 18:04:45 +01:00
|
|
|
const MultiDrvrNet *multi_drvr,
|
2023-11-11 20:33:55 +01:00
|
|
|
Edge *edge,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
2024-01-07 21:44:04 +01:00
|
|
|
bool findDriverArcDelays(Vertex *drvr_vertex,
|
|
|
|
|
const MultiDrvrNet *multi_drvr,
|
|
|
|
|
Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
LoadPinIndexMap &load_pin_index_map,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
ArcDcalcArgSeq makeArcDcalcArgs(Vertex *drvr_vertex,
|
|
|
|
|
const MultiDrvrNet *multi_drvr,
|
|
|
|
|
Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void findParallelEdge(Vertex *vertex,
|
|
|
|
|
Edge *drvr_edge,
|
|
|
|
|
const TimingArc *drvr_arc,
|
|
|
|
|
// Return values.
|
|
|
|
|
Edge *&edge,
|
|
|
|
|
const TimingArc *&arc);
|
2023-11-13 02:39:02 +01:00
|
|
|
void initWireDelays(Vertex *drvr_vertex);
|
2023-11-11 20:33:55 +01:00
|
|
|
void initRootSlews(Vertex *vertex);
|
|
|
|
|
void zeroSlewAndWireDelays(Vertex *drvr_vertex);
|
|
|
|
|
void findVertexDelay(Vertex *vertex,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc,
|
|
|
|
|
bool propagate);
|
|
|
|
|
void enqueueTimingChecksEdges(Vertex *vertex);
|
2024-01-07 21:44:04 +01:00
|
|
|
bool annotateDelaysSlews(Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
ArcDcalcResult &dcalc_result,
|
|
|
|
|
LoadPinIndexMap &load_pin_index_map,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
|
|
|
|
|
|
|
|
|
bool annotateDelaySlew(Edge *edge,
|
|
|
|
|
const TimingArc *arc,
|
|
|
|
|
ArcDelay &gate_delay,
|
|
|
|
|
Slew &gate_slew,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
2023-11-11 20:33:55 +01:00
|
|
|
void annotateLoadDelays(Vertex *drvr_vertex,
|
2024-01-07 21:44:04 +01:00
|
|
|
const RiseFall *drvr_rf,
|
|
|
|
|
ArcDcalcResult &dcalc_result,
|
|
|
|
|
LoadPinIndexMap &load_pin_index_map,
|
|
|
|
|
const ArcDelay &extra_delay,
|
|
|
|
|
bool merge,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
2023-11-11 20:33:55 +01:00
|
|
|
void findLatchEdgeDelays(Edge *edge);
|
|
|
|
|
void findCheckEdgeDelays(Edge *edge,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc);
|
|
|
|
|
void deleteMultiDrvrNets();
|
|
|
|
|
Slew checkEdgeClkSlew(const Vertex *from_vertex,
|
|
|
|
|
const RiseFall *from_rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap);
|
|
|
|
|
bool bidirectDrvrSlewFromLoad(const Vertex *vertex) const;
|
2024-02-08 21:54:52 +01:00
|
|
|
float loadCap(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc) const;
|
|
|
|
|
void parasiticLoad(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
const MultiDrvrNet *multi_drvr,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &cap,
|
|
|
|
|
const Parasitic *¶sitic) const;
|
|
|
|
|
void parasiticLoad(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
const MultiDrvrNet *multi_drvr,
|
|
|
|
|
ArcDelayCalc *arc_delay_calc,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &pin_cap,
|
|
|
|
|
float &wire_cap,
|
|
|
|
|
const Parasitic *¶sitic) const;
|
|
|
|
|
void netCaps(const Pin *drvr_pin,
|
|
|
|
|
const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
const MultiDrvrNet *multi_drvr,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &pin_cap,
|
|
|
|
|
float &wire_cap,
|
|
|
|
|
float &fanout,
|
|
|
|
|
bool &has_net_load) const;
|
2023-11-11 20:33:55 +01:00
|
|
|
|
|
|
|
|
// Observer for edge delay changes.
|
|
|
|
|
DelayCalcObserver *observer_;
|
|
|
|
|
bool delays_seeded_;
|
|
|
|
|
bool incremental_;
|
|
|
|
|
bool delays_exist_;
|
|
|
|
|
// Vertices with invalid -to delays.
|
|
|
|
|
VertexSet *invalid_delays_;
|
|
|
|
|
// Timing check edges with invalid delays.
|
|
|
|
|
EdgeSet invalid_check_edges_;
|
|
|
|
|
// Latch D->Q edges with invalid delays.
|
|
|
|
|
EdgeSet invalid_latch_edges_;
|
|
|
|
|
// shared by invalid_check_edges_ and invalid_latch_edges_
|
|
|
|
|
std::mutex invalid_edge_lock_;
|
|
|
|
|
SearchPred *search_pred_;
|
|
|
|
|
SearchPred *search_non_latch_pred_;
|
|
|
|
|
SearchPred *clk_pred_;
|
|
|
|
|
BfsFwdIterator *iter_;
|
|
|
|
|
MultiDrvrNetMap multi_drvr_net_map_;
|
2024-02-01 01:14:07 +01:00
|
|
|
std::mutex multi_drvr_lock_;
|
2023-11-11 20:33:55 +01:00
|
|
|
// Percentage (0.0:1.0) change in delay that causes downstream
|
|
|
|
|
// delays to be recomputed during incremental delay calculation.
|
|
|
|
|
float incremental_delay_tolerance_;
|
|
|
|
|
|
|
|
|
|
friend class FindVertexDelays;
|
|
|
|
|
friend class MultiDrvrNet;
|
2018-09-28 17:54:21 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// Abstract base class for edge delay change observer.
|
|
|
|
|
class DelayCalcObserver
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
DelayCalcObserver() {}
|
|
|
|
|
virtual ~DelayCalcObserver() {}
|
|
|
|
|
virtual void delayChangedFrom(Vertex *vertex) = 0;
|
|
|
|
|
virtual void delayChangedTo(Vertex *vertex) = 0;
|
|
|
|
|
virtual void checkDelayChangedTo(Vertex *vertex) = 0;
|
|
|
|
|
};
|
|
|
|
|
|
2023-11-19 18:04:45 +01:00
|
|
|
// Nets with multiple drivers (tristate, bidirect or output).
|
|
|
|
|
// Cache net caps to prevent N^2 net pin walk.
|
|
|
|
|
class MultiDrvrNet
|
|
|
|
|
{
|
|
|
|
|
public:
|
2024-02-01 01:14:07 +01:00
|
|
|
MultiDrvrNet();
|
|
|
|
|
VertexSeq &drvrs() { return drvrs_; }
|
|
|
|
|
const VertexSeq &drvrs() const { return drvrs_; }
|
2023-11-19 18:04:45 +01:00
|
|
|
bool parallelGates(const Network *network) const;
|
|
|
|
|
Vertex *dcalcDrvr() const { return dcalc_drvr_; }
|
|
|
|
|
void setDcalcDrvr(Vertex *drvr);
|
|
|
|
|
void netCaps(const RiseFall *rf,
|
|
|
|
|
const DcalcAnalysisPt *dcalc_ap,
|
|
|
|
|
// Return values.
|
|
|
|
|
float &pin_cap,
|
|
|
|
|
float &wire_cap,
|
|
|
|
|
float &fanout,
|
|
|
|
|
bool &has_net_load) const;
|
|
|
|
|
void findCaps(const Sdc *sdc);
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
// Driver that triggers delay calculation for all the drivers on the net.
|
|
|
|
|
Vertex *dcalc_drvr_;
|
2024-02-01 01:14:07 +01:00
|
|
|
VertexSeq drvrs_;
|
2023-11-19 18:04:45 +01:00
|
|
|
// [drvr_rf->index][dcalc_ap->index]
|
|
|
|
|
vector<NetCaps> net_caps_;
|
|
|
|
|
};
|
|
|
|
|
|
2018-09-28 17:54:21 +02:00
|
|
|
} // namespace
|