Annotation of libelwix/src/ring.c, revision 1.4.4.2
1.2 misho 1: /*************************************************************************
2: * (C) 2025 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org>
3: * by Michael Pounov <misho@elwix.org>
4: *
5: * $Author: misho $
1.4.4.2 ! misho 6: * $Id: ring.c,v 1.4.4.1 2026/02/10 15:49:08 misho Exp $
1.2 misho 7: *
8: **************************************************************************
9: The ELWIX and AITNET software is distributed under the following
10: terms:
11:
12: All of the documentation and software included in the ELWIX and AITNET
13: Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
14:
1.4.4.1 misho 15: Copyright 2004 - 2026
1.2 misho 16: by Michael Pounov <misho@elwix.org>. All rights reserved.
17:
18: Redistribution and use in source and binary forms, with or without
19: modification, are permitted provided that the following conditions
20: are met:
21: 1. Redistributions of source code must retain the above copyright
22: notice, this list of conditions and the following disclaimer.
23: 2. Redistributions in binary form must reproduce the above copyright
24: notice, this list of conditions and the following disclaimer in the
25: documentation and/or other materials provided with the distribution.
26: 3. All advertising materials mentioning features or use of this software
27: must display the following acknowledgement:
28: This product includes software developed by Michael Pounov <misho@elwix.org>
29: ELWIX - Embedded LightWeight unIX and its contributors.
30: 4. Neither the name of AITNET nor the names of its contributors
31: may be used to endorse or promote products derived from this software
32: without specific prior written permission.
33:
34: THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
35: ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37: ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
38: FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39: DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40: OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42: LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43: OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44: SUCH DAMAGE.
45: */
46: #include "global.h"
47:
48:
49: /*
50: * rbuf_init() - Init ring buffer
51: *
52: * @rbuf = Ring buffer
53: * @num = Number of elements in buffer
54: * return: -1 error or 0 ok
55: */
56: int
57: rbuf_init(ringbuf_t *rbuf, int num)
58: {
59: if (!rbuf)
60: return -1;
61:
1.3 misho 62: atomic_store_explicit((atomic_int*) &rbuf->rb_head, 0, memory_order_relaxed);
63: atomic_store_explicit((atomic_int*) &rbuf->rb_tail, 0, memory_order_relaxed);
1.2 misho 64:
65: rbuf->rb_buffer = e_calloc(num, sizeof(struct iovec));
66: if (!rbuf->rb_buffer)
67: return -1;
68: else
69: rbuf->rb_bufnum = num;
70: memset(rbuf->rb_buffer, 0, num * sizeof(struct iovec));
71:
72: return 0;
73: }
74:
75: /*
76: * rbuf_free() - Free ring buffer
77: *
78: * @rbuf = Ring buffer
79: * return: none
80: */
81: void
82: rbuf_free(ringbuf_t *rbuf)
83: {
84: if (!rbuf)
85: return;
86:
87: if (rbuf->rb_buffer) {
88: e_free(rbuf->rb_buffer);
89: rbuf->rb_buffer = NULL;
90: rbuf->rb_bufnum = 0;
91: }
92:
1.3 misho 93: atomic_store_explicit((atomic_int*) &rbuf->rb_head, 0, memory_order_relaxed);
94: atomic_store_explicit((atomic_int*) &rbuf->rb_tail, 0, memory_order_relaxed);
1.2 misho 95: }
96:
97: /*
98: * rbuf_purge() - Purge all buffer
99: *
100: * @rbuf = Ring buffer
101: * return: none
102: */
103: void
104: rbuf_purge(ringbuf_t *rbuf)
105: {
106: if (!rbuf)
107: return;
108:
109: if (rbuf->rb_buffer)
110: memset(rbuf->rb_buffer, 0, rbuf->rb_bufnum * sizeof(struct iovec));
111:
1.3 misho 112: atomic_store_explicit((atomic_int*) &rbuf->rb_head, 0, memory_order_relaxed);
113: atomic_store_explicit((atomic_int*) &rbuf->rb_tail, 0, memory_order_relaxed);
1.2 misho 114: }
115:
116: /*
117: * rbuf_isempty() - Check buffer is empty
118: *
119: * @rbuf = Ring buffer
120: * return: -1 error, 0 it isn't empty
121: */
122: int
123: rbuf_isempty(ringbuf_t *rbuf)
124: {
125: if (!rbuf)
126: return -1;
127:
1.3 misho 128: return (atomic_load_explicit((atomic_int*) &rbuf->rb_head, memory_order_acquire) ==
129: atomic_load_explicit((atomic_int*) &rbuf->rb_tail, memory_order_acquire));
1.2 misho 130: }
131:
132: /*
133: * rbuf_isfull() - Check buffer is full
134: *
135: * @rbuf = Ring buffer
136: * return: -1 error or 0 it isn't full
137: */
138: int
139: rbuf_isfull(ringbuf_t *rbuf)
140: {
1.4.4.1 misho 141: int h, t;
142:
1.2 misho 143: if (!rbuf)
144: return -1;
145: if (!rbuf->rb_bufnum)
146: return 1;
147:
1.4.4.1 misho 148: t = atomic_load_explicit((atomic_int*) &rbuf->rb_tail, memory_order_acquire);
149: h = atomic_load_explicit((atomic_int*) &rbuf->rb_head, memory_order_relaxed) + 1;
150: if (h >= rbuf->rb_bufnum)
151: h ^= h;
152:
153: return (h == t);
1.2 misho 154: }
155:
156: /*
157: * rbuf_enqueue() - Enqueue data to buffer
158: *
159: * @rbuf = Ring buffer
160: * @data = Data
161: * @len = Length
162: * return: -1 error, 1 buffer is full or 0 ok
163: */
164: int
165: rbuf_enqueue(ringbuf_t *rbuf, void *data, size_t len)
166: {
167: int h, t, n;
168: struct iovec *iov;
169:
170: if (!rbuf || !rbuf->rb_buffer)
171: return -1;
172: if (!rbuf->rb_bufnum)
173: return 1;
174:
1.3 misho 175: h = atomic_load_explicit((atomic_int*) &rbuf->rb_head, memory_order_relaxed);
176: t = atomic_load_explicit((atomic_int*) &rbuf->rb_tail, memory_order_acquire);
1.2 misho 177: n = (h + 1) % rbuf->rb_bufnum;
178:
179: if (n == t)
180: return 1;
181:
182: iov = rbuf->rb_buffer + h;
183: iov->iov_len = len;
184: iov->iov_base = data;
185:
1.3 misho 186: atomic_store_explicit((atomic_int*) &rbuf->rb_head, n, memory_order_release);
1.2 misho 187: return 0;
188: }
189:
190: /*
191: * rbuf_dequeue() - Dequeue data from buffer
192: *
193: * @rbuf = Ring buffer
194: * @out = Data, if =NULL, just dequeue data
195: * return: -1 error, 1 buffer is empty or 0 ok
196: */
197: int
1.4 misho 198: rbuf_dequeue(ringbuf_t *rbuf, struct iovec **out)
1.2 misho 199: {
200: int h, t, n;
201:
202: if (!rbuf || !rbuf->rb_buffer)
203: return -1;
204: if (!rbuf->rb_bufnum)
205: return 1;
206:
1.3 misho 207: h = atomic_load_explicit((atomic_int*) &rbuf->rb_head, memory_order_acquire);
208: t = atomic_load_explicit((atomic_int*) &rbuf->rb_tail, memory_order_relaxed);
1.2 misho 209: n = (t + 1) % rbuf->rb_bufnum;
210:
211: if (h == t)
212: return 1;
213:
214: if (out)
1.4 misho 215: *out = rbuf->rb_buffer + t;
1.2 misho 216:
1.3 misho 217: atomic_store_explicit((atomic_int*) &rbuf->rb_tail, n, memory_order_release);
1.2 misho 218: return 0;
219: }
1.4.4.1 misho 220:
221:
222: /*
223: * lrb_init() - Init linear ring buffer
224: *
225: * @lrb = Linear ring buffer
226: * @size = Size of ring buffer
227: * return: -1 error or 0 ok
228: */
229: int
230: lrb_init(lrbuf_t *lrb, u_int size)
231: {
232: if (!lrb)
233: return -1;
234:
235: atomic_store_explicit((atomic_int*) &lrb->lrb_head, 0, memory_order_relaxed);
236: atomic_store_explicit((atomic_int*) &lrb->lrb_tail, 0, memory_order_relaxed);
237:
238: lrb->lrb_data = e_malloc(size);
239: if (!lrb->lrb_data)
240: return -1;
241: else
242: lrb->lrb_size = size;
243: memset(lrb->lrb_data, 0, lrb->lrb_size);
244:
245: return 0;
246: }
247:
248: /*
249: * lrb_free() - Free linear ring buffer
250: *
251: * @lrb = Linear ring buffer
252: * return: none
253: */
254: void
255: lrb_free(lrbuf_t *lrb)
256: {
257: if (!lrb)
258: return;
259:
260: if (lrb->lrb_data) {
261: e_free(lrb->lrb_data);
262: lrb->lrb_data = NULL;
263: lrb->lrb_size = 0;
264: }
265:
266: atomic_store_explicit((atomic_int*) &lrb->lrb_head, 0, memory_order_relaxed);
267: atomic_store_explicit((atomic_int*) &lrb->lrb_tail, 0, memory_order_relaxed);
268: }
269:
270: /*
271: * lrb_purge() - Purge all buffer
272: *
273: * @lrb = Linear ring buffer
274: * return: none
275: */
276: void
277: lrb_purge(lrbuf_t *lrb)
278: {
279: if (!lrb)
280: return;
281:
282: if (lrb->lrb_data)
283: memset(lrb->lrb_data, 0, lrb->lrb_size);
284:
285: atomic_store_explicit((atomic_int*) &lrb->lrb_head, 0, memory_order_relaxed);
286: atomic_store_explicit((atomic_int*) &lrb->lrb_tail, 0, memory_order_relaxed);
287: }
288:
289: /*
290: * lrb_isempty() - Check buffer is empty
291: *
292: * @lrb = Linear ring buffer
293: * return: -1 error, 0 it isn't empty
294: */
295: int
296: lrb_isempty(lrbuf_t *lrb)
297: {
298: if (!lrb)
299: return -1;
300:
1.4.4.2 ! misho 301: return (!atomic_load_explicit((atomic_int*) &lrb->lrb_full, memory_order_acquire) &&
! 302: (atomic_load_explicit((atomic_int*) &lrb->lrb_head, memory_order_acquire) ==
! 303: atomic_load_explicit((atomic_int*) &lrb->lrb_tail, memory_order_acquire)));
1.4.4.1 misho 304: }
305:
306: /*
307: * lrb_isfull() - Check buffer is full
308: *
309: * @lrb = Linear ring buffer
310: * return: -1 error or 0 it isn't full
311: */
312: int
313: lrb_isfull(lrbuf_t *lrb)
314: {
315: int h, t;
316:
317: if (!lrb)
318: return -1;
319: if (!lrb->lrb_size)
320: return 1;
321:
1.4.4.2 ! misho 322: if (!atomic_load_explicit((atomic_int*) &lrb->lrb_full, memory_order_acquire))
! 323: return 0;
! 324:
1.4.4.1 misho 325: t = atomic_load_explicit((atomic_int*) &lrb->lrb_tail, memory_order_acquire);
326: h = atomic_load_explicit((atomic_int*) &lrb->lrb_head, memory_order_relaxed) + 1;
327: if (h >= lrb->lrb_size)
328: h ^= h;
329:
330: return (h == t);
331: }
332:
333: /*
334: * lrb_enqueue() - Enqueue data to buffer
335: *
336: * @lrb = Linear ring buffer
337: * @data = Data
338: * @len = Length
339: * @lost = Permit to lost data
340: * return: -1 error, 1 buffer is full or 0 ok
341: */
342: int
343: lrb_enqueue(lrbuf_t *lrb, void *data, size_t len, int lost)
344: {
345: int h, t, n, t2, unused, drop = 0;
346:
347: if (!lrb || !lrb->lrb_data)
348: return -1;
349: if (!lrb->lrb_size || lrb->lrb_size <= len)
350: return 1;
351:
352: lrb_unused(lrb, unused);
353: if (!lost) {
354: if (len > unused)
355: return 1;
356: } else {
357: drop = len - unused;
358: if(drop < 0)
359: drop ^= drop;
360: }
361:
362: if (drop > 0) {
363: t = atomic_load_explicit((atomic_int*) &lrb->lrb_tail, memory_order_acquire);
364: t2 = (t + drop) % lrb->lrb_size;
365: }
366: h = atomic_load_explicit((atomic_int*) &lrb->lrb_head, memory_order_relaxed);
367: n = lrb->lrb_size - h;
368: if (len < n) {
369: memcpy(lrb->lrb_data + h, data, len);
370: n = h + len;
371: } else {
372: memcpy(lrb->lrb_data + h, data, n);
373: memcpy(lrb->lrb_data, data + n, len - n);
374: n = len - n;
375: }
376:
1.4.4.2 ! misho 377: h = n;
! 378: atomic_store_explicit((atomic_int*) &lrb->lrb_head, h, memory_order_release);
1.4.4.1 misho 379: if (drop > 0)
380: while (42) {
381: n = t;
382: if (atomic_compare_exchange_weak_explicit((atomic_int*) &lrb->lrb_tail,
383: &n, t2, memory_order_release, memory_order_relaxed))
384: break;
385: t = n;
386: t2 = (t + drop) % lrb->lrb_size;
387: }
1.4.4.2 ! misho 388: else
! 389: t2 = atomic_load_explicit((atomic_int*) &lrb->lrb_tail, memory_order_acquire);
! 390: atomic_store_explicit((atomic_int*) &lrb->lrb_full, (h == t2), memory_order_release);
1.4.4.1 misho 391: return 0;
392: }
393:
394: /*
395: * lrb_dequeue() - Dequeue data from buffer
396: *
397: * @lrb = Linear ring buffer
398: * @data = Data, if =NULL, just dequeue data
399: * @len = Length of data
400: * return: -1 error, 0 buffer is empty or >0 stored data bytes
401: */
402: int
403: lrb_dequeue(lrbuf_t *lrb, void *data, size_t len)
404: {
405: int h, t, t2, n, l;
406:
407: if (!lrb)
408: return -1;
409: if (!lrb->lrb_size || !len || lrb_isempty(lrb))
410: return 0;
411: if (lrb->lrb_size <= len)
412: len = lrb->lrb_size - 1;
413:
414: while (42) {
415: t = atomic_load_explicit((atomic_int*) &lrb->lrb_tail, memory_order_acquire);
416: h = atomic_load_explicit((atomic_int*) &lrb->lrb_head, memory_order_acquire);
417:
418: l = h - t;
419: if (l < 0)
420: l += lrb->lrb_size;
421: if (!l)
422: return 0;
423: if (l > len)
424: l = len;
425:
426: n = lrb->lrb_size - t;
427: if (l < n) {
428: if (data)
429: memcpy(data, lrb->lrb_data + t, l);
430: t2 = t + l;
431: } else {
432: if (data) {
433: memcpy(data, lrb->lrb_data + t, n);
434: memcpy(data + n, lrb->lrb_data, l - n);
435: }
436: t2 = l - n;
437: }
438:
439: n = t;
440: if (atomic_compare_exchange_weak_explicit((atomic_int*) &lrb->lrb_tail,
1.4.4.2 ! misho 441: &n, t2, memory_order_release, memory_order_relaxed)) {
! 442: atomic_store_explicit((atomic_int*) &lrb->lrb_full, 0, memory_order_release);
1.4.4.1 misho 443: return l;
1.4.4.2 ! misho 444: }
1.4.4.1 misho 445: }
446:
447: return 0;
448: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to ring.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / libelwix / src