90 #define	ring_empty(d) (((d)->consume == (d)->supply) && \
92 #define	ring_full(d) (((d)->supply == (d)->consume) && \
108 	ring->supply = ring->consume = ring->bottom = buffer;  in ring_init()
126 	ring->mark = ring_decrement(ring, ring->supply, 1);  in ring_mark()
159 	ring->supply = ring_increment(ring, ring->supply, count);  in ring_supplied()
190 		ring->consume = ring->supply = ring->bottom;  in ring_consumed()
206 		return (ring_subtract(ring, ring->consume, ring->supply));  in ring_empty_count()
214 	if ((ring->consume < ring->supply) || ring_empty(ring)) {  in ring_empty_consecutive()
219 		return (ring_subtract(ring, ring->top, ring->supply));  in ring_empty_consecutive()
224 		return (ring_subtract(ring, ring->consume, ring->supply));  in ring_empty_consecutive()
240 			return (ring_subtract(ring, ring->supply,  in ring_full_count()
256 		if ((ring->supply < ring->consume) || ring_full(ring)) {  in ring_full_consecutive()
259 			return (ring_subtract(ring, ring->supply,  in ring_full_consecutive()
281 		(void) memcpy(ring->supply, buffer, i);  in ring_supply_data()
313 	if (ring_empty(ring) || ring->clearto == ring->supply)  in ring_encrypt()
319 	s = ring->supply;  in ring_encrypt()
327 	ring->clearto = ring->supply;  in ring_encrypt()
334 		ring->clearto = ring->supply;  in ring_clearto()