Lines Matching refs:timing
84 int filled; /**< Number of entries occupied in "timing" and "counts"*/
86 spx_int32_t timing[MAX_TIMINGS]; /**< Sorted list of all timings ("latest" packets first) */
96 /* Add the timing of a new packet to the TimingBuffer */
97 static void tb_add(struct TimingBuffer *tb, spx_int16_t timing)
101 if (tb->filled >= MAX_TIMINGS && timing >= tb->timing[tb->filled-1])
107 /* Find where the timing info goes in the sorted list */
110 while (pos<tb->filled && timing >= tb->timing[pos])
123 SPEEX_MOVE(&tb->timing[pos+1], &tb->timing[pos], move_size);
127 tb->timing[pos] = timing;
219 if (pos[j] < tb[j].filled && tb[j].timing[pos[j]] < latest)
222 latest = tb[j].timing[pos[j]];
247 /* For the next timing we will consider, there will be one more late packet to count */
334 /** Take the following timing into consideration for future calculations */
335 static void update_timings(JitterBuffer *jitter, spx_int32_t timing)
337 if (timing < -32767)
338 timing = -32767;
339 if (timing > 32767)
340 timing = 32767;
352 tb_add(jitter->timeBuffers[0], timing);
362 jitter->timeBuffers[i]->timing[j] += amount;
