Lines Matching refs:chk
301 chk = reallocate_integer_array (chk, current_max_xpairs);
303 zero_out ((char *) (chk + old_max),
320 * chk) able to accommodate the state
331 * consecutive unused records in the chk and nxt arrays.
338 * nxt and chk.
342 * chk/nxt, which should be 1.
348 * chk/nxt arrays.
369 if (chk[i - 1] == 0) {
371 if (chk[i] == 0)
396 /* Check to see if all elements in chk (and therefore nxt)
401 ptr_to_last_entry_in_state = &chk[i + numecs + 1];
403 for (chk_ptr = &chk[i + 1];
420 * all "chk" entries to be zero.
426 zero_out ((char *) chk,
467 chk[tblend] = jamstate;
471 chk[tblend + i] = jamstate;
484 /* mkentry - create base/def and nxt/chk entries for transition array
542 * table at the end of the nxt/chk tables, we must make sure that we
558 for (++baseaddr; chk[baseaddr] != 0; ++baseaddr) ;
567 chk[baseaddr + i - minec] != 0) { /* baseaddr unsuitable - find another */
570 chk[baseaddr] != 0; ++baseaddr) ;
604 chk[tblbase + i] = statenum;
609 for (++firstfree; chk[firstfree] != 0; ++firstfree) ;
625 while (chk[firstfree] != 0)
631 chk[firstfree] = state;
773 * find_table_space() knows that this position in chk/nxt is taken
777 chk[position - 1] = 1;
782 chk[position] = 1;
784 /* Place the state into chk and nxt. */
789 chk[position + i] = i;