Lines Matching refs:nq
147 dfs (struct graph *g, int *qs, int nq, int *qt, bool forward)
164 for (i = 0; i < nq; i++)
278 int nq, depth;
337 nq = 0;
340 queue1[nq++] = BB_REPR (act);
344 queue1[nq++] = LOOP_REPR (loops->parray[i]);
345 dfs (g, queue1, nq, queue2, false);
346 for (i = 0; i < nq; i++)
347 queue1[i] = queue2[nq - i - 1];
348 dfs (g, queue1, nq, NULL, true);