Lines Matching refs:tp
63 buffer++; // leave the first elem empty so tp-1 is valid ptr
65 tp = &buffer[0];
66 last = tp-1;
110 if ( tp <= last ) // is there any buffered lookahead still to be read?
112 return *tp++; // read buffered lookahead
139 tp = last;
140 return *tp++;
147 /* MR23 */ printMessage(stderr, "rewind(%d)[nm=%d,from=%d,%d.n=%d]\n", pos, num_markers, tp-buffer,pos,test[pos]);
150 tp = &buffer[pos];
162 test[tp-buffer]++;
163 /* MR23 */ printMessage(stderr,"mark(%d)[nm=%d,%d.n=%d]\n",tp-buffer,num_markers+1,tp-buffer,test[tp-buffer]);
166 return tp - buffer;
175 * The tp pointer is left alone as the lookahead has not been advanced
185 // int how_many_more_i_need = (last-tp < 0) ? n : n-(last-tp)-1;
186 int how_many_more_i_need = (tp > last) ? n : n-(last-tp)-1;
202 return tp[n - 1];
237 "before: tp=%d, last=%d, next=%d, threshold=%d\n",tp-buffer,last-buffer,next-buffer,threshold-buffer);
278 tp = &buffer[k-1]; // tp points to what will be filled in next
279 last = tp-1;
282 "after: tp=%d, last=%d, next=%d\n",
283 tp-buffer, last-buffer, next-buffer);
303 int save_last = last-buffer, save_tp = tp-buffer, save_next = next-buffer;
314 buffer++; // leave the first elem empty so tp-1 is valid ptr
316 tp = buffer + save_tp; // put the pointers back to same relative position