Lines Matching refs:text_buf
79 u_int8_t text_buf[N + F - 1];
98 u_int8_t text_buf[N + F - 1];
107 text_buf[i] = ' ';
118 text_buf[r++] = c;
126 c = text_buf[(i + k) & (N - 1)];
128 text_buf[r++] = c;
153 sp->text_buf[i] = ' ';
161 * Inserts string of length F, text_buf[r..r+F-1], into one of the trees
162 * (text_buf[r]'th tree) and returns the longest-match position and length
174 key = &sp->text_buf[r];
197 if ((cmp = key[i] - sp->text_buf[p + i]) != 0)
288 sp->text_buf[r + len] = *src++;
312 code_buf[code_buf_ptr++] = sp->text_buf[r]; /* Send uncoded. */
334 sp->text_buf[s] = c; /* read new bytes */
341 sp->text_buf[s + N] = c;
347 /* Register the string in text_buf[r..r+F-1] */