haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Always upgrade to a stronger driver even if the path is longer 

Fixes https://gitlab.com/kicad/code/kicad/-/issues/7492
This commit is contained in:
Jon Evans 2021-02-11 17:25:02 -05:00
parent 8e9b457887
commit 73ea0fc15e
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
eeschema/connection_graph.cpp
View File

@ -1846,12 +1846,14 @@ void CONNECTION_GRAPH::propagateToNeighbors( CONNECTION_SUBGRAPH* aSubgraph )
// Pick a better driving subgraph if it:
// a) has a power pin or global driver
// b) is a strong driver and we're a weak driver
// c) meets or exceeds our priority, is a strong driver, and has a shorter path
// d) matches our strength and is at least as short, and is alphabetically lower
// c) is a higher priority strong driver
// d) matches our priority, is a strong driver, and has a shorter path
// e) matches our strength and is at least as short, and is alphabetically lower
if( ( priority >= CONNECTION_SUBGRAPH::PRIORITY::POWER_PIN ) ||
( !originalStrong && candidateStrong ) ||
( priority >= highest && candidateStrong && shorterPath ) ||
( priority > highest && candidateStrong ) ||
( priority == highest && candidateStrong && shorterPath ) ||
( ( originalStrong == candidateStrong ) && asGoodPath &&
( candidateName < originalName ) ) )
{