The-OpenROAD-Project/OpenSTA
1
0
Fork 0
mirror of https://github.com/The-OpenROAD-Project/OpenSTA.git synced 2026-05-30 00:24:12 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

rel 3.0

Browse Source 
Signed-off-by: James Cherry <cherry@parallaxsw.com>
This commit is contained in:
James Cherry
2026-01-03 16:59:35 -08:00
parent 7f65853afa
commit d42b821c00
384 changed files with 33435 additions and 32562 deletions
Download Patch File Download Diff File Expand all files Collapse all files

67
include/sta/SearchClass.hh
View File

@@ -25,11 +25,10 @@
#pragma once
#include <limits>
#include <vector>
#include <map>
#include "Vector.hh"
#include "Set.hh"
#include "Map.hh"
#include "UnorderedMap.hh"
#include "VectorMap.hh"
#include "StringSet.hh"
#include "MinMaxValues.hh"
#include "Delay.hh"
@@ -39,7 +38,7 @@
namespace sta {
class Search;
class Corner;
class Scene;
class Path;
class PathEnd;
class PathGroup;
@@ -56,8 +55,6 @@ class ClkInfo;
class ClkInfoHash;
class ClkInfoEqual;
class VertexPathIterator;
class PathAnalysisPt;
class PathAnalysisPtIterator;
class MinPulseWidthCheck;
class MinPeriodCheck;
class MaxSkewCheck;
@@ -70,10 +67,10 @@ class ClkDelays;
class TagMatchLess
{
public:
explicit TagMatchLess(bool match_crpr_clk_pin,
const StaState *sta);
TagMatchLess(bool match_crpr_clk_pin,
const StaState *sta);
bool operator()(const Tag *tag1,
const Tag *tag2) const;
const Tag *tag2) const;
protected:
bool match_crpr_clk_pin_;
@@ -84,7 +81,7 @@ class TagMatchHash
{
public:
TagMatchHash(bool match_crpr_clk_pin,
const StaState *sta);
const StaState *sta);
size_t operator()(const Tag *tag) const;
protected:
@@ -96,46 +93,42 @@ class TagMatchEqual
{
public:
TagMatchEqual(bool match_crpr_clk_pin,
const StaState *sta);
const StaState *sta);
bool operator()(const Tag *tag1,
const Tag *tag2) const;
const Tag *tag2) const;
protected:
bool match_crpr_clk_pin_;
const StaState *sta_;
};
typedef int PathAPIndex;
typedef uint32_t TagIndex;
typedef Vector<Tag*> TagSeq;
typedef Vector<MinPulseWidthCheck*> MinPulseWidthCheckSeq;
typedef Vector<MinPeriodCheck*> MinPeriodCheckSeq;
typedef Vector<MaxSkewCheck*> MaxSkewCheckSeq;
typedef StringSet PathGroupNameSet;
typedef Vector<PathEnd*> PathEndSeq;
typedef Vector<Arrival> ArrivalSeq;
typedef Map<Vertex*, size_t> VertexPathCountMap;
typedef Map<Tag*, size_t, TagMatchLess> PathIndexMap;
typedef Vector<Slack> SlackSeq;
typedef Delay Crpr;
typedef Vector<Path*> PathSeq;
typedef std::vector<const Path*> ConstPathSeq;
using PathAPIndex = int;
using TagIndex = uint32_t;
using TagSeq = std::vector<Tag*>;
using PathEndSeq = std::vector<PathEnd*>;
using ArrivalSeq = std::vector<Arrival>;
using VertexPathCountMap = std::map<Vertex*, size_t>;
using PathIndexMap = VectorMap<Tag*, size_t, TagMatchLess>;
using SlackSeq = std::vector<Slack>;
using Crpr = Delay;
using PathSeq = std::vector<Path*>;
using ConstPathSeq = std::vector<const Path*>;
enum class ReportPathFormat { full,
full_clock,
full_clock_expanded,
shorter,
endpoint,
summary,
slack_only,
json
full_clock,
full_clock_expanded,
shorter,
endpoint,
summary,
slack_only,
json
};
static const TagIndex tag_index_bit_count = 28;
static const TagIndex tag_index_max = (1 << tag_index_bit_count) - 1;
static const TagIndex tag_index_null = tag_index_max;
static const int path_ap_index_bit_count = 8;
// One path analysis point per corner min/max.
static const int corner_count_max = (1 << path_ap_index_bit_count) / 2;
// One path analysis point per scene min/max.
static const int scene_count_max = (1 << path_ap_index_bit_count) / 2;
} // namespace