Lines Matching defs:walk
242 int walk;
279 walk = 0;
290 for (y = 0; y < state[walk].count; y++)
291 if (state[walk].c[y] == rset[n][m]) {
293 walk = state[walk].state[y];
303 state[walk].c[state[walk].count] = rset[n][m];
305 state[walk].state[state[walk].count] = next;
306 state[walk].count++;
307 walk = next++;
312 state[walk].c[0] = n++;
313 state[walk].state[0] = 0; /* terminal marker */
314 state[walk].count = 1;
317 walk = 0;
319 state[n].bytepos = walk;
320 walk += (2 * state[n].count);
326 walk = 0;
337 walk) == 2)
345 walk += 2;
349 walk = 0;
375 walk += 2;
386 if ((state[saw].bytepos - walk) == 2) {
390 walk += 2;
416 walk += 2;
429 walk = 0;
439 walk = lextable_decode(version, walk, rset[n][m]);
440 if (walk < 0) {
445 if (lextable[version][walk] < FAIL_CHAR) {
446 y = (lextable[version][walk] << 8) +
447 lextable[version][walk + 1];