Lines Matching refs:latest
82 /** Buffer that keeps the time of arrival of the latest packets */
86 spx_int32_t timing[MAX_TIMINGS]; /**< Sorted list of all timings ("latest" packets first) */
159 struct TimingBuffer *timeBuffers[MAX_BUFFERS]; /**< Storing arrival time of latest frames so we can compute some stats */
209 /* Pick the TOP_DELAY "latest" packets (doesn't need to actually be late
215 int latest = 32767;
216 /* Pick latest amoung all sub-windows */
219 if (pos[j] < tb[j].filled && tb[j].timing[pos[j]] < latest)
222 latest = tb[j].timing[pos[j]];
230 worst = latest;
231 best = latest;
232 latest = ROUND_DOWN(latest, jitter->delay_step);
236 cost = -latest + late_factor*late;
237 /*fprintf(stderr, "cost %d = %d + %f * %d\n", cost, -latest, late_factor, late);*/
241 opt = latest;
250 if (latest >= 0 && !penalty_taken)
