Lines Matching defs:count
198 int count;
290 for (y = 0; y < state[walk].count; y++)
303 state[walk].c[state[walk].count] = rset[n][m];
305 state[walk].state[state[walk].count] = next;
306 state[walk].count++;
314 state[walk].count = 1;
320 walk += (2 * state[n].count);
331 for (m = 0; m < state[n].count; m++) {
341 if (m == state[n].count - 1)
352 for (m = 0; m < state[n].count; m++) {
409 if (m == state[n].count - 1) {