Lines Matching defs:walk
333 int walk;
353 walk = 0;
359 if (state[walk].state[code_bit(n, m)] != 0xffff) {
361 walk = state[walk].state[code_bit(n, m)];
367 state[walk].state[code_bit(n, m)] = next;
368 walk = next++;
373 state[walk].terminal = n++;
374 state[walk].state[0] = 0; /* terminal marker */
377 walk = 0;
379 state[n].bytepos = walk;
380 walk += (2 * 2);
386 walk = 0;
394 walk ++;
401 walk = 0;
433 walk++;
456 walk++;
464 for (n = 0; n < (walk + 7) / 8; n++) {
476 walk = 0;
483 prev = walk;
484 walk = lextable_decode(walk, code_bit(n, m));
486 if (walk == 0xffff) {
491 if (walk & 0x8000) {
492 y = walk & 0x7fff;