Show More
@@ -1187,7 +1187,7 b' static PyObject *reachableroots2(indexOb' | |||||
1187 | goto bail; |
|
1187 | goto bail; | |
1188 | } |
|
1188 | } | |
1189 | if (!(revstates[revnum + 1] & RS_SEEN)) { |
|
1189 | if (!(revstates[revnum + 1] & RS_SEEN)) { | |
1190 | tovisit[lentovisit++] = revnum; |
|
1190 | tovisit[lentovisit++] = (int)revnum; | |
1191 | revstates[revnum + 1] |= RS_SEEN; |
|
1191 | revstates[revnum + 1] |= RS_SEEN; | |
1192 | } |
|
1192 | } | |
1193 | } |
|
1193 | } | |
@@ -1228,7 +1228,7 b' static PyObject *reachableroots2(indexOb' | |||||
1228 | /* Find all the nodes in between the roots we found and the heads |
|
1228 | /* Find all the nodes in between the roots we found and the heads | |
1229 | * and add them to the reachable set */ |
|
1229 | * and add them to the reachable set */ | |
1230 | if (includepath == 1) { |
|
1230 | if (includepath == 1) { | |
1231 |
|
|
1231 | long minidx = minroot; | |
1232 | if (minidx < 0) |
|
1232 | if (minidx < 0) | |
1233 | minidx = 0; |
|
1233 | minidx = 0; | |
1234 | for (i = minidx; i < len; i++) { |
|
1234 | for (i = minidx; i < len; i++) { |
General Comments 0
You need to be logged in to leave comments.
Login now