luke
/
OpenSTA
mirror of https://github.com/The-OpenROAD-Project/OpenSTA.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

thread_count_ -> size_t 

Signed-off-by: James Cherry <cherry@CerezoBook.local>
This commit is contained in:
James Cherry 2026-07-19 10:28:43 -07:00
parent dc5ccd2d69
commit 4f2c3d4ca5
4 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
graph/Graph.cc
View File

@ -1045,7 +1045,6 @@ Vertex::init(Pin *pin,
slews_ = nullptr; slews_ = nullptr;
paths_ = nullptr; paths_ = nullptr;
tag_group_index_ = tag_group_index_max; tag_group_index_ = tag_group_index_max;
bfs_in_queue_ = 0;
is_bidirect_drvr_ = is_bidirect_drvr; is_bidirect_drvr_ = is_bidirect_drvr;
is_reg_clk_ = is_reg_clk; is_reg_clk_ = is_reg_clk;
has_checks_ = false; has_checks_ = false;
@ -1053,10 +1052,11 @@ Vertex::init(Pin *pin,
has_downstream_clk_pin_ = false; has_downstream_clk_pin_ = false;
visited1_ = false; visited1_ = false;
visited2_ = false; visited2_ = false;
bfs_predecessor_changed_ = false;
has_sim_value_ = false; has_sim_value_ = false;
level_ = 0; level_ = 0;
slew_annotated_ = false; slew_annotated_ = false;
bfs_in_queue_ = 0;
bfs_predecessor_changed_ = false;
} }
Vertex::~Vertex() Vertex::~Vertex()

9
include/sta/Graph.hh
View File

@ -287,15 +287,16 @@ public:
void setIsCheckClk(bool is_check_clk); void setIsCheckClk(bool is_check_clk);
[[nodiscard]] bool hasDownstreamClkPin() const { return has_downstream_clk_pin_; } [[nodiscard]] bool hasDownstreamClkPin() const { return has_downstream_clk_pin_; }
void setHasDownstreamClkPin(bool has_clk_pin); void setHasDownstreamClkPin(bool has_clk_pin);
[[nodiscard]] bool bfsInQueue(BfsIndex index) const;
void setBfsInQueue(BfsIndex index, bool value);
bool bfsPredecessorChanged() const { return bfs_predecessor_changed_; }
void setBfsPredecessorChanged(bool changed);
[[nodiscard]] bool isRegClk() const { return is_reg_clk_; } [[nodiscard]] bool isRegClk() const { return is_reg_clk_; }
// Has sim value in some mode. // Has sim value in some mode.
[[nodiscard]] bool hasSimValue() const { return has_sim_value_; } [[nodiscard]] bool hasSimValue() const { return has_sim_value_; }
void setHasSimValue(bool has_sim); void setHasSimValue(bool has_sim);
[[nodiscard]] bool bfsInQueue(BfsIndex index) const;
void setBfsInQueue(BfsIndex index, bool value);
[[nodiscard]] bool bfsPredecessorChanged() const { return bfs_predecessor_changed_; }
void setBfsPredecessorChanged(bool changed);
// ObjectTable interface. // ObjectTable interface.
[[nodiscard]] ObjectIdx objectIdx() const { return object_idx_; } [[nodiscard]] ObjectIdx objectIdx() const { return object_idx_; }
void setObjectIdx(ObjectIdx idx); void setObjectIdx(ObjectIdx idx);

4
include/sta/StaState.hh
View File

@ -100,7 +100,7 @@ public:
const DelayOps *delayOps() const { return delay_ops_; } const DelayOps *delayOps() const { return delay_ops_; }
Latches *latches() { return latches_; } Latches *latches() { return latches_; }
Latches *latches() const { return latches_; } Latches *latches() const { return latches_; }
unsigned threadCount() const { return thread_count_; } size_t threadCount() const { return thread_count_; }
bool crprActive(const Mode *mode) const; bool crprActive(const Mode *mode) const;
Variables *variables() { return variables_; } Variables *variables() { return variables_; }
const Variables *variables() const { return variables_; } const Variables *variables() const { return variables_; }
@ -139,7 +139,7 @@ protected:
DelayOps *delay_ops_; DelayOps *delay_ops_;
Latches *latches_; Latches *latches_;
Variables *variables_; Variables *variables_;
int thread_count_; size_t thread_count_;
DispatchQueue *dispatch_queue_; DispatchQueue *dispatch_queue_;
}; };

2
search/Bfs.cc
View File

@ -162,7 +162,7 @@ BfsIterator::visitParallel(Level to_level,
else { else {
std::vector<VertexVisitor *> visitors; std::vector<VertexVisitor *> visitors;
visitors.reserve(thread_count_); visitors.reserve(thread_count_);
for (int k = 0; k < thread_count_; k++) for (size_t k = 0; k < thread_count_; k++)
visitors.push_back(visitor->copy()); visitors.push_back(visitor->copy());
while (levelLessOrEqual(first_level_, last_level_) while (levelLessOrEqual(first_level_, last_level_)
&& levelLessOrEqual(first_level_, to_level)) { && levelLessOrEqual(first_level_, to_level)) {