Lines Matching refs:latest
80 /** Buffer that keeps the time of arrival of the latest packets */
84 spx_int32_t timing[MAX_TIMINGS]; /**< Sorted list of all timings ("latest" packets first) */
157 struct TimingBuffer *timeBuffers[MAX_BUFFERS]; /**< Storing arrival time of latest frames so we can compute some stats */
207 /* Pick the TOP_DELAY "latest" packets (doesn't need to actually be late
213 int latest = 32767;
214 /* Pick latest amoung all sub-windows */
217 if (pos[j] < tb[j].filled && tb[j].timing[pos[j]] < latest)
220 latest = tb[j].timing[pos[j]];
228 worst = latest;
229 best = latest;
230 latest = ROUND_DOWN(latest, jitter->delay_step);
234 cost = -latest + late_factor*late;
235 /*fprintf(stderr, "cost %d = %d + %f * %d\n", cost, -latest, late_factor, late);*/
239 opt = latest;
248 if (latest >= 0 && !penalty_taken)