Home | History | Annotate | Download | only in libspeex

Lines Matching refs:late

48   + late
146 spx_uint32_t arrival[SPEEX_JITTER_MAX_BUFFER_SIZE]; /**< Packet arrival time (0 means it was late, even though it's a valid timestamp) */
154 int late_cutoff; /**< How late must a packet be for it not to be considered at all */
160 int window_size; /**< Total window over which the late frames are counted */
162 int max_late_rate; /**< Absolute maximum amount of late packets tolerable (in percent) */
171 cost = delay + late_factor*[number of frames that would be late if we used that delay]
173 @param late_factor Equivalent cost of a late frame (in timestamp units)
180 int late = 0;
209 /* Pick the TOP_DELAY "latest" packets (doesn't need to actually be late
236 cost = -latest + late_factor*late;
237 /*fprintf(stderr, "cost %d = %d + %f * %d\n", cost, -latest, late_factor, late);*/
247 /* For the next timing we will consider, there will be one more late packet to count */
248 late++;
249 /* Two-frame penalty if we're going to increase the amount of late frames (hysteresis) */
253 late+=4;
371 int late;
379 /* Make sure we don't discard a "just-late" packet in case we want to play it next (if we interpolate). */
393 /* Check if packet is late (could still be useful though) */
397 late = 1;
399 late = 0;
409 /* Only insert the packet if it's not hopelessly late (i.e. totally useless) */
455 if (jitter->reset_state || late)