Lines Matching full:next
107 int next;
158 int rc, x, next, i;
208 tokens[eob][0].next = default_eob;
212 next = eob;
226 error0 = tokens[next][0].error;
227 error1 = tokens[next][1].error;
229 rate0 = tokens[next][0].rate;
230 rate1 = tokens[next][1].rate;
233 if (next < default_eob) {
238 [tokens[next][0].token];
241 [tokens[next][1].token];
251 tokens[i][0].next = next;
257 rate0 = tokens[next][0].rate;
258 rate1 = tokens[next][1].rate;
277 t0 = tokens[next][0].token == DCT_EOB_TOKEN ?
279 t1 = tokens[next][1].token == DCT_EOB_TOKEN ?
284 if (next < default_eob) {
289 [tokens[next][0].token];
294 [tokens[next][1].token];
309 tokens[i][1].next = next;
314 next = i;
321 t0 = tokens[next][0].token;
322 t1 = tokens[next][1].token;
325 tokens[next][0].rate +=
327 tokens[next][0].token = ZERO_TOKEN;
330 tokens[next][1].rate +=
332 tokens[next][1].token = ZERO_TOKEN;
335 /* Don't update next, because we didn't add a new node. */
342 rate0 = tokens[next][0].rate;
343 rate1 = tokens[next][1].rate;
344 error0 = tokens[next][0].error;
345 error1 = tokens[next][1].error;
346 t0 = tokens[next][0].token;
347 t1 = tokens[next][1].token;
355 for (i = next; i < eob; i = next) {
364 next = tokens[i][best].next;
