31 	struct ringbuffer *rb;  in ringbuffer_init()  local
33 	rb = malloc(sizeof(*rb) + size);  in ringbuffer_init()
34 	if (!rb) {  in ringbuffer_init()
38 	memset(rb, 0, sizeof(*rb));  in ringbuffer_init()
39 	rb->size = size;  in ringbuffer_init()
40 	rb->buf = (void *)(rb + 1);  in ringbuffer_init()
42 	return rb;  in ringbuffer_init()
45 void ringbuffer_fini(struct ringbuffer *rb)  in ringbuffer_fini()  argument
47 	while (rb->n_consumers) {  in ringbuffer_fini()
48 		ringbuffer_consumer_unregister(rb->consumers[0]);  in ringbuffer_fini()
50 	free(rb);  in ringbuffer_fini()
54 ringbuffer_consumer_register(struct ringbuffer *rb, ringbuffer_poll_fn_t fn,  in ringbuffer_consumer_register()  argument
61 	rbc->rb = rb;  in ringbuffer_consumer_register()
64 	rbc->pos = rb->tail;  in ringbuffer_consumer_register()
66 	n = rb->n_consumers++;  in ringbuffer_consumer_register()
72 	rb->consumers = reallocarray(rb->consumers, rb->n_consumers,  in ringbuffer_consumer_register()
73 				     sizeof(*rb->consumers));  in ringbuffer_consumer_register()
75 	rb->consumers[n] = rbc;  in ringbuffer_consumer_register()
82 	struct ringbuffer *rb = rbc->rb;  in ringbuffer_consumer_unregister()  local
85 	for (i = 0; i < rb->n_consumers; i++) {  in ringbuffer_consumer_unregister()
86 		if (rb->consumers[i] == rbc) {  in ringbuffer_consumer_unregister()
91 	assert(i < rb->n_consumers);  in ringbuffer_consumer_unregister()
93 	rb->n_consumers--;  in ringbuffer_consumer_unregister()
99 	memmove(&rb->consumers[i], &rb->consumers[i + 1],  in ringbuffer_consumer_unregister()
101 		sizeof(*rb->consumers) * (rb->n_consumers - i));  in ringbuffer_consumer_unregister()
103 	if (rb->n_consumers == 0) {  in ringbuffer_consumer_unregister()
104 		free(rb->consumers);  in ringbuffer_consumer_unregister()
105 		rb->consumers = NULL;  in ringbuffer_consumer_unregister()
107 		rb->consumers = reallocarray(  in ringbuffer_consumer_unregister()
108 			rb->consumers, rb->n_consumers,  in ringbuffer_consumer_unregister()
110 			sizeof(*rb->consumers));  in ringbuffer_consumer_unregister()
118 	if (rbc->pos <= rbc->rb->tail) {  in ringbuffer_len()
119 		return rbc->rb->tail - rbc->pos;  in ringbuffer_len()
121 	return rbc->rb->tail + rbc->rb->size - rbc->pos;  in ringbuffer_len()
126 	return rbc->rb->size - ringbuffer_len(rbc) - 1;  in ringbuffer_space()
149 int ringbuffer_queue(struct ringbuffer *rb, uint8_t *data, size_t len)  in ringbuffer_queue()  argument
156 	if (len >= rb->size) {  in ringbuffer_queue()
169 	for (i = 0; i < rb->n_consumers; i++) {  in ringbuffer_queue()
170 		rbc = rb->consumers[i];  in ringbuffer_queue()
183 	wlen = min(len, rb->size - rb->tail);  in ringbuffer_queue()
184 	memcpy(rb->buf + rb->tail, data, wlen);  in ringbuffer_queue()
185 	rb->tail = (rb->tail + wlen) % rb->size;  in ringbuffer_queue()
189 	memcpy(rb->buf, data, len);  in ringbuffer_queue()
190 	rb->tail += len;  in ringbuffer_queue()
194 	for (i = 0; i < rb->n_consumers; i++) {  in ringbuffer_queue()
197 		rbc = rb->consumers[i];  in ringbuffer_queue()
211 	struct ringbuffer *rb = rbc->rb;  in ringbuffer_dequeue_peek()  local
219 	pos = (rbc->pos + offset) % rb->size;  in ringbuffer_dequeue_peek()
220 	if (pos <= rb->tail) {  in ringbuffer_dequeue_peek()
221 		len = rb->tail - pos;  in ringbuffer_dequeue_peek()
223 		len = rb->size - pos;  in ringbuffer_dequeue_peek()
226 	*data = rb->buf + pos;  in ringbuffer_dequeue_peek()
233 	rbc->pos = (rbc->pos + len) % rbc->rb->size;  in ringbuffer_dequeue_commit()