- int d;
- int i;
- d = SEARCH_FAILED;
- for (i = 0; i < n; i++) {
- d = stack_depth(new_pc[i], search-1);
- if (d != SEARCH_FAILED)
+ int i, j, d;
+
+ i = 0;
+ while (i < n) {
+ d = stack_depth(new_pc[i], search-1, ntrace);
+ if (d == SEARCH_LOOP) {
+ for (j = i; j < n-1; j++)
+ new_pc[j] = new_pc[j+1];
+ n--;
+ continue;
+ }
+ if (d != SEARCH_EXPIRED) {
+ DPC(("success %d\n", d + change));