Searched refs:trj (Results 1 – 2 of 2) sorted by relevance
312 trj_visit(struct trj_data *trj, Id node) in trj_visit() argument314 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()[all …]
3447 trj_visit(struct trj_data *trj, Id node) in trj_visit() argument3449 Id *low = trj->low; in trj_visit()3450 Queue *edges = trj->edges; in trj_visit()3454 low[node] = myidx = trj->idx++; in trj_visit()3455 low[(stackstart = trj->nstack++)] = node; in trj_visit()3463 trj->idx++; in trj_visit()3467 trj_visit(trj, nnode); in trj_visit()3472 if (l < trj->firstidx) in trj_visit()3483 if (myidx != trj->firstidx) in trj_visit()3485 for (i = stackstart; i < trj->nstack; i++) in trj_visit()[all …]