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

mutateTag cleanup 

Signed-off-by: James Cherry <cherry@parallaxsw.com>
This commit is contained in:
James Cherry 2022-08-09 14:48:39 -07:00
parent 254115c06b
commit c7debe5463
3 changed files with 44 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
include/sta/Sdc.hh
View File

@ -946,11 +946,10 @@ public:
ExceptionStateSet *&states) const;
// Return hierarchical -thru exceptions that start between
// from_pin and to_pin.
void exceptionThruStates(const Pin *from_pin,
const Pin *to_pin,
const RiseFall *to_rf,
const MinMax *min_max,
ExceptionStateSet *&states) const;
ExceptionStateSet *exceptionThruStates(const Pin *from_pin,
const Pin *to_pin,
const RiseFall *to_rf,
const MinMax *min_max) const;
// Find the highest priority exception with first exception pt at
// pin/clk end.
void exceptionTo(ExceptionPathType type,

7
sdc/Sdc.cc
View File

@ -5467,13 +5467,13 @@ Sdc::filterRegQStates(const Pin *to_pin,
}
}
void
ExceptionStateSet *
Sdc::exceptionThruStates(const Pin *from_pin,
const Pin *to_pin,
const RiseFall *to_rf,
const MinMax *min_max,
ExceptionStateSet *&states) const
const MinMax *min_max) const
{
ExceptionStateSet *states = nullptr;
if (first_thru_pin_exceptions_)
exceptionThruStates(first_thru_pin_exceptions_->findKey(to_pin),
to_rf, min_max, states);
@ -5489,6 +5489,7 @@ Sdc::exceptionThruStates(const Pin *from_pin,
exceptionThruStates(first_thru_inst_exceptions_->findKey(to_inst),
to_rf, min_max, states);
}
return states;
}
void

70
search/Search.cc
View File

@ -2552,35 +2552,40 @@ Search::mutateTag(Tag *from_tag,
bool state_change = false;
for (auto state : *from_states) {
ExceptionPath *exception = state->exception();
if (state->isComplete()
&& exception->isFalse()
&& !from_is_clk)
// Don't propagate a completed false path -thru unless it is a
// clock (which ignores exceptions).
return nullptr;
if (state->matchesNextThru(from_pin,to_pin,to_rf,min_max,network_)) {
// Found a -thru that we've been waiting for.
if (state->nextState()->isComplete()
&& exception->isLoop())
// to_pin/edge completes a loop path.
return nullptr;
// One edge may traverse multiple hierarchical thru pins.
while (state->matchesNextThru(from_pin,to_pin,to_rf,min_max,network_)) {
// Found a -thru that we've been waiting for.
state = state->nextState();
state_change = true;
break;
break;
}
if (state_change)
break;
// Don't propagate a completed false path -thru unless it is a
// clock. Clocks carry the completed false path to disable
// downstream paths that use the clock as data.
if ((state->isComplete()
&& exception->isFalse()
&& !from_is_clk)
// to_pin/edge completes a loop path.
|| (exception->isLoop()
&& state->isComplete()))
return nullptr;
// Kill path delay tags past the -to pin.
if ((exception->isPathDelay()
&& sdc_->isCompleteTo(state, from_pin, from_rf, min_max))
// Kill loop tags at register clock pins.
|| (to_is_reg_clk
&& exception->isLoop())) {
|| (exception->isLoop()
&& to_is_reg_clk)) {
state_change = true;
break;
break;
}
}
// Get the set of -thru exceptions starting at to_pin/edge.
sdc_->exceptionThruStates(from_pin, to_pin, to_rf, min_max, new_states);
new_states = sdc_->exceptionThruStates(from_pin, to_pin, to_rf, min_max);
if (new_states || state_change) {
// Second pass to apply state changes and add updated existing
// states to new states.
@ -2588,26 +2593,23 @@ Search::mutateTag(Tag *from_tag,
new_states = new ExceptionStateSet;
for (auto state : *from_states) {
ExceptionPath *exception = state->exception();
if (state->isComplete()
&& exception->isFalse()
&& !from_is_clk) {
// Don't propagate a completed false path -thru unless it is a
// clock. Clocks carry the completed false path to disable
// downstream paths that use the clock as data.
delete new_states;
return nullptr;
}
// One edge may traverse multiple hierarchical thru pins.
while (state->matchesNextThru(from_pin,to_pin,to_rf,min_max,network_))
// Found a -thru that we've been waiting for.
state = state->nextState();
if (state->isComplete()
&& exception->isLoop()) {
// to_pin/edge completes a loop path.
delete new_states;
return nullptr;
}
// Don't propagate a completed false path -thru unless it is a
// clock. Clocks carry the completed false path to disable
// downstream paths that use the clock as data.
if ((state->isComplete()
&& exception->isFalse()
&& !from_is_clk)
// to_pin/edge completes a loop path.
|| (exception->isLoop()
&& state->isComplete())) {
delete new_states;
return nullptr;
}
// Kill path delay tags past the -to pin.
if (!((exception->isPathDelay()
@ -2621,7 +2623,7 @@ Search::mutateTag(Tag *from_tag,
}
else
// Get the set of -thru exceptions starting at to_pin/edge.
sdc_->exceptionThruStates(from_pin, to_pin, to_rf, min_max, new_states);
new_states = sdc_->exceptionThruStates(from_pin, to_pin, to_rf, min_max);
if (new_states)
return findTag(to_rf, path_ap, to_clk_info, to_is_clk,