312 trj_visit(struct trj_data *trj, Id node)  in trj_visit()  argument
314   Id *low = trj->low;  in trj_visit()
315   Pool *pool = trj->pool;  in trj_visit()
316   Queue *plist = trj->plist;  in trj_visit()
322   low[node] = myidx = trj->idx++;  in trj_visit()
323   trj->stack[(stackstart = trj->nstack++)] = node;  in trj_visit()
351 			      trj->idx++;  in trj_visit()
355 			  trj_visit(trj, i);  in trj_visit()
360 		      if (l < trj->firstidx)  in trj_visit()
367 			      if (low[trj->stack[k]] == l)  in trj_visit()
368 				low[trj->stack[k]] = -1;  in trj_visit()
384       if (myidx != trj->firstidx)  in trj_visit()
386       for (i = stackstart; i < trj->nstack; i++)  in trj_visit()
387 	low[trj->stack[i]] = myidx;  in trj_visit()
388       trj->nstack = stackstart;	/* empty stack */  in trj_visit()
400   struct trj_data trj;  in prune_obsoleted()  local
411   trj.pool = pool;  in prune_obsoleted()
412   trj.plist = plist;  in prune_obsoleted()
413   trj.low = data;  in prune_obsoleted()
414   trj.idx = 1;  in prune_obsoleted()
415   trj.stack = data + plist->count - 1;	/* -1 so we can index with idx (which starts with 1) */  in prune_obsoleted()
418       if (trj.low[i])  in prune_obsoleted()
423 	  trj.firstidx = trj.nstack = trj.idx;  in prune_obsoleted()
424           trj_visit(&trj, i);  in prune_obsoleted()
428           Id myidx = trj.idx++;  in prune_obsoleted()
429           trj.low[i] = myidx;  in prune_obsoleted()
430           trj.stack[myidx] = i;  in prune_obsoleted()
434     if (trj.low[i] >= 0)  in prune_obsoleted()