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

typos/format 

Signed-off-by: James Cherry <cherry@CerezoBook.local>
This commit is contained in:
James Cherry 2026-06-17 18:27:48 -07:00
parent 832c62b579
commit 9a11f094b9
3 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
search/Latches.cc
View File

@ -359,7 +359,7 @@ Latches::latchOutArrival(const Path *data_path,
arc_delay = search_->deratedDelay(data_vertex, d_q_arc, d_q_edge, arc_delay = search_->deratedDelay(data_vertex, d_q_arc, d_q_edge,
false, min_max, dcalc_ap, sdc); false, min_max, dcalc_ap, sdc);
q_arrival = delaySum(data_path->arrival(), arc_delay, this); q_arrival = delaySum(data_path->arrival(), arc_delay, this);
// Copy the data tag but remove the drprClkPath. // Copy the data tag but remove the crprClkPath.
// Levelization does not traverse latch D->Q edges, so in some cases // Levelization does not traverse latch D->Q edges, so in some cases
// level(Q) < level(D) // level(Q) < level(D)
// Note that // Note that
@ -368,7 +368,7 @@ Latches::latchOutArrival(const Path *data_path,
// level(crprClkPath(data)) == level(Q) // level(crprClkPath(data)) == level(Q)
// or some other downstream vertex. // or some other downstream vertex.
// This can lead to data races when finding arrivals at the same level // This can lead to data races when finding arrivals at the same level
// use multiple threads. // with multiple threads.
// Kill the crprClklPath to be safe. // Kill the crprClklPath to be safe.
const ClkInfo *data_clk_info = data_path->clkInfo(this); const ClkInfo *data_clk_info = data_path->clkInfo(this);
const ClkInfo *q_clk_info = const ClkInfo *q_clk_info =

3
search/PathEnum.cc
View File

@ -381,7 +381,8 @@ PathEnumFaninVisitor::visitEdge(const Pin *from_pin,
Path *from_path = from_iter.next(); Path *from_path = from_iter.next();
const Mode *mode = from_path->mode(this); const Mode *mode = from_path->mode(this);
const Sdc *sdc = mode->sdc(); const Sdc *sdc = mode->sdc();
if (pred_->searchFrom(from_vertex, mode) && pred_->searchThru(edge, mode) if (pred_->searchFrom(from_vertex, mode)
&& pred_->searchThru(edge, mode)
&& pred_->searchTo(to_vertex, mode) && pred_->searchTo(to_vertex, mode)
// Fanin paths are broken by path delay internal pin startpoints. // Fanin paths are broken by path delay internal pin startpoints.
&& !sdc->isPathDelayInternalFromBreak(to_pin)) { && !sdc->isPathDelayInternalFromBreak(to_pin)) {

6
search/Search.cc
View File

@ -95,9 +95,9 @@ EvalPred::searchThru(Edge *edge,
{ {
const TimingRole *role = edge->role(); const TimingRole *role = edge->role();
return SearchPred0::searchThru(edge, mode) return SearchPred0::searchThru(edge, mode)
&& (sta_->variables()->dynamicLoopBreaking() || !edge->isDisabledLoop()) && (sta_->variables()->dynamicLoopBreaking() || !edge->isDisabledLoop())
&& (search_thru_latches_ || role->isLatchDtoQ() && (search_thru_latches_ || role->isLatchDtoQ()
|| sta_->latches()->latchDtoQState(edge, mode) == LatchEnableState::open); || sta_->latches()->latchDtoQState(edge, mode) == LatchEnableState::open);
} }
bool bool