Lines Matching defs:tail
53 uint32_t tail;
95 * tail" with it. Elements behind the "oldest tail" are freed and recycled for
96 * new head content. Elements after the "oldest tail" are still waiting to be
99 * If the oldest tail moved on from before, check if it created enough space
102 * Mark connections that are at the oldest tail as being on a 3s timeout to
107 * You can skip calling this if on your connection, before processing, the tail
108 * was not equal to the current worst, ie, if the tail you will work on is !=
109 * lws_ring_get_oldest_tail(ring) then no need to call this when the tail
125 &pss->tail);
128 worst_tail = pss->tail;
140 * The oldest tail did move on. Check if we should re-enable rx flow
153 * The guy(s) with the oldest tail block the ringbuffer from recycling
159 if (pss->tail == worst_tail)
288 pss->tail = lws_ring_get_oldest_tail(mi->ring);
314 * going away may have had the oldest tail, reconfirm
316 * tail. If the oldest tail moves on, this call also
368 update_worst = oldest_tail == pss->tail;
372 msg = lws_ring_get_element(pss->mi->ring, &pss->tail);
378 " pss->tail = %d\n", __func__,
379 oldest_tail, pss->tail);
380 if (lws_ring_consume(pss->mi->ring, &pss->tail,
394 lws_ring_consume(pss->mi->ring, &pss->tail, NULL, 1);
400 &pss->tail))
407 * We are no longer holding the oldest tail (since we sent
409 * oldest tail.