The branch, master has been updated
via ec34fde7e5ca02e97d22039260d0ee69236e859b (commit)
from 359a02cfe25e32aec7d2985c8f368fbfdcd954fa (commit)
Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.
=========
Summary
=========
src/autoroute.c | 6 +++---
1 files changed, 3 insertions(+), 3 deletions(-)
=================
Commit Messages
=================
commit ec34fde7e5ca02e97d22039260d0ee69236e859b
Author: Peter Clifton <pcjc2@xxxxxxxxx>
Commit: Peter Clifton <pcjc2@xxxxxxxxx>
Fix auto-router - we need to actually increment the dir variable!
Was broken accidentally in commit 5f0f788dc12a10a3c01ade7cf00d5ed63922ca47
(Initial C++ compatibility patch)
:100644 100644 b2cbab4... cecf9c0... M src/autoroute.c
=========
Changes
=========
commit ec34fde7e5ca02e97d22039260d0ee69236e859b
Author: Peter Clifton <pcjc2@xxxxxxxxx>
Commit: Peter Clifton <pcjc2@xxxxxxxxx>
Fix auto-router - we need to actually increment the dir variable!
Was broken accidentally in commit 5f0f788dc12a10a3c01ade7cf00d5ed63922ca47
(Initial C++ compatibility patch)
diff --git a/src/autoroute.c b/src/autoroute.c
index b2cbab4..cecf9c0 100644
--- a/src/autoroute.c
+++ b/src/autoroute.c
@@ -2817,7 +2817,7 @@ BreakManyEdges (struct routeone_state * s, rtree_t * targets, rtree_t * tree,
* in clockwise order, which allows finding corners that can
* be expanded.
*/
- for (dir = NORTH; dir <= WEST; directionIncrement(dir))
+ for (dir = NORTH; dir <= WEST; dir = directionIncrement(dir))
{
/* don't break the edge we came from */
if (e->expand_dir != ((dir + 2) % 4))
@@ -2894,7 +2894,7 @@ BreakManyEdges (struct routeone_state * s, rtree_t * targets, rtree_t * tree,
* moveable as possible.
*/
first = last = -1;
- for (dir = NORTH; dir <= WEST; directionIncrement(dir))
+ for (dir = NORTH; dir <= WEST; dir = directionIncrement(dir))
{
if (heap[dir] && !heap_is_empty (heap[dir]))
{
@@ -3057,7 +3057,7 @@ BreakManyEdges (struct routeone_state * s, rtree_t * targets, rtree_t * tree,
}
}
/* done with all expansion edges of this box */
- for (dir = NORTH; dir <= WEST; directionIncrement(dir))
+ for (dir = NORTH; dir <= WEST; dir = directionIncrement(dir))
{
if (heap[dir])
heap_destroy (&heap[dir]);
_______________________________________________
geda-cvs mailing list
geda-cvs@xxxxxxxxxxxxxx
http://www.seul.org/cgi-bin/mailman/listinfo/geda-cvs