Skip to content

drt: violation access points take precedent when returning from patterns #11095

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
bnmfw wants to merge 2 commits into
base: master
Choose a base branch
from
Draft

drt: violation access points take precedent when returning from patterns #11095

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c015c4f
drt: violation access points take precedent when returning from patterns
bnmfw Aug 7, 2026
5b642f0
drt: tieh testcase
bnmfw Aug 10, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions src/drt/src/pa/FlexPA_acc_pattern.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -236,6 +236,7 @@ int FlexPA::genPatternsHelper(
used_access_points,
viol_access_points,
max_access_point_size);
// Print entire node graph after DP pass
bool is_valid = false;
if (genPatternsCommit(unique_inst,
nodes,
Expand Down Expand Up @@ -441,12 +442,16 @@ int FlexPA::getEdgeCost(
const std::set<std::pair<int, int>>& viol_access_points,
const int max_access_point_size)
{
int edge_cost = 0;
auto [prev_pin_idx, prev_acc_point_idx] = prev_node->getIdx();
auto [curr_pin_idx, curr_acc_point_idx] = curr_node->getIdx();

if (viol_access_points.contains(prev_node->getIdx())
|| viol_access_points.contains(curr_node->getIdx())) {
return kViolationCost;
}

if (prev_node->isSource() || curr_node->isSink()) {
return edge_cost;
return 0;
}
Comment thread
bnmfw marked this conversation as resolved.

bool has_vio = false;
Expand Down Expand Up @@ -545,11 +550,6 @@ int FlexPA::getEdgeCost(
return kRepeatedApCost;
}

if (viol_access_points.contains(prev_node->getIdx())
|| viol_access_points.contains(curr_node->getIdx())) {
return kViolationCost;
}

const int prev_node_cost = prev_node->getNodeCost();
const int curr_node_cost = curr_node->getNodeCost();
return prev_node_cost + curr_node_cost;
Expand Down
5 changes: 4 additions & 1 deletion src/drt/test/BUILD
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,6 +20,7 @@ COMPULSORY_TESTS = [
"ndr_vias3",
"ndr_no_auto_taper",
"obstruction",
"pa_single_pin",
"single_step",
"ta_ap_aligned",
"ta_pin_aligned",
Expand Down Expand Up @@ -111,7 +112,9 @@ filegroup(
] if test_name in [
"ispd18_sample_incr",
"single_step",
] else []),
] else []) + ([
"gf180/gf180mcu_5LM_1TM_9K_9t_tech.lef",
] if test_name == "pa_single_pin" else []),
)
for test_name in ALL_TESTS
]
Expand Down
1 change: 1 addition & 0 deletions src/drt/test/CMakeLists.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,7 @@ or_integration_tests(
ndr_vias3
ndr_no_auto_taper
obstruction
pa_single_pin
single_step
ta_ap_aligned
ta_pin_aligned
Expand Down
Loading
Loading