DPDK  17.11.5
rte_ring.h
Go to the documentation of this file.
1 /*-
2  * BSD LICENSE
3  *
4  * Copyright(c) 2010-2017 Intel Corporation. All rights reserved.
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  * * Redistributions of source code must retain the above copyright
12  * notice, this list of conditions and the following disclaimer.
13  * * Redistributions in binary form must reproduce the above copyright
14  * notice, this list of conditions and the following disclaimer in
15  * the documentation and/or other materials provided with the
16  * distribution.
17  * * Neither the name of Intel Corporation nor the names of its
18  * contributors may be used to endorse or promote products derived
19  * from this software without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32  */
33 
34 /*
35  * Derived from FreeBSD's bufring.h
36  *
37  **************************************************************************
38  *
39  * Copyright (c) 2007-2009 Kip Macy kmacy@freebsd.org
40  * All rights reserved.
41  *
42  * Redistribution and use in source and binary forms, with or without
43  * modification, are permitted provided that the following conditions are met:
44  *
45  * 1. Redistributions of source code must retain the above copyright notice,
46  * this list of conditions and the following disclaimer.
47  *
48  * 2. The name of Kip Macy nor the names of other
49  * contributors may be used to endorse or promote products derived from
50  * this software without specific prior written permission.
51  *
52  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
53  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
56  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
57  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
58  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
59  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
60  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
61  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
62  * POSSIBILITY OF SUCH DAMAGE.
63  *
64  ***************************************************************************/
65 
66 #ifndef _RTE_RING_H_
67 #define _RTE_RING_H_
68 
90 #ifdef __cplusplus
91 extern "C" {
92 #endif
93 
94 #include <stdio.h>
95 #include <stdint.h>
96 #include <sys/queue.h>
97 #include <errno.h>
98 #include <rte_common.h>
99 #include <rte_config.h>
100 #include <rte_memory.h>
101 #include <rte_lcore.h>
102 #include <rte_atomic.h>
103 #include <rte_branch_prediction.h>
104 #include <rte_memzone.h>
105 #include <rte_pause.h>
106 
107 #define RTE_TAILQ_RING_NAME "RTE_RING"
108 
109 enum rte_ring_queue_behavior {
110  RTE_RING_QUEUE_FIXED = 0, /* Enq/Deq a fixed number of items from a ring */
111  RTE_RING_QUEUE_VARIABLE /* Enq/Deq as many items as possible from ring */
112 };
113 
114 #define RTE_RING_MZ_PREFIX "RG_"
115 
116 #define RTE_RING_NAMESIZE (RTE_MEMZONE_NAMESIZE - \
117  sizeof(RTE_RING_MZ_PREFIX) + 1)
118 
119 struct rte_memzone; /* forward declaration, so as not to require memzone.h */
120 
121 #if RTE_CACHE_LINE_SIZE < 128
122 #define PROD_ALIGN (RTE_CACHE_LINE_SIZE * 2)
123 #define CONS_ALIGN (RTE_CACHE_LINE_SIZE * 2)
124 #else
125 #define PROD_ALIGN RTE_CACHE_LINE_SIZE
126 #define CONS_ALIGN RTE_CACHE_LINE_SIZE
127 #endif
128 
129 /* structure to hold a pair of head/tail values and other metadata */
130 struct rte_ring_headtail {
131  volatile uint32_t head;
132  volatile uint32_t tail;
133  uint32_t single;
134 };
135 
146 struct rte_ring {
147  /*
148  * Note: this field kept the RTE_MEMZONE_NAMESIZE size due to ABI
149  * compatibility requirements, it could be changed to RTE_RING_NAMESIZE
150  * next time the ABI changes
151  */
153  int flags;
154  const struct rte_memzone *memzone;
156  uint32_t size;
157  uint32_t mask;
158  uint32_t capacity;
161  struct rte_ring_headtail prod __rte_aligned(PROD_ALIGN);
162 
164  struct rte_ring_headtail cons __rte_aligned(CONS_ALIGN);
165 };
166 
167 #define RING_F_SP_ENQ 0x0001
168 #define RING_F_SC_DEQ 0x0002
177 #define RING_F_EXACT_SZ 0x0004
178 #define RTE_RING_SZ_MASK (0x7fffffffU)
180 /* @internal defines for passing to the enqueue dequeue worker functions */
181 #define __IS_SP 1
182 #define __IS_MP 0
183 #define __IS_SC 1
184 #define __IS_MC 0
185 
200 ssize_t rte_ring_get_memsize(unsigned count);
201 
236 int rte_ring_init(struct rte_ring *r, const char *name, unsigned count,
237  unsigned flags);
238 
278 struct rte_ring *rte_ring_create(const char *name, unsigned count,
279  int socket_id, unsigned flags);
286 void rte_ring_free(struct rte_ring *r);
287 
296 void rte_ring_dump(FILE *f, const struct rte_ring *r);
297 
298 /* the actual enqueue of pointers on the ring.
299  * Placed here since identical code needed in both
300  * single and multi producer enqueue functions */
301 #define ENQUEUE_PTRS(r, ring_start, prod_head, obj_table, n, obj_type) do { \
302  unsigned int i; \
303  const uint32_t size = (r)->size; \
304  uint32_t idx = prod_head & (r)->mask; \
305  obj_type *ring = (obj_type *)ring_start; \
306  if (likely(idx + n < size)) { \
307  for (i = 0; i < (n & ((~(unsigned)0x3))); i+=4, idx+=4) { \
308  ring[idx] = obj_table[i]; \
309  ring[idx+1] = obj_table[i+1]; \
310  ring[idx+2] = obj_table[i+2]; \
311  ring[idx+3] = obj_table[i+3]; \
312  } \
313  switch (n & 0x3) { \
314  case 3: \
315  ring[idx++] = obj_table[i++]; /* fallthrough */ \
316  case 2: \
317  ring[idx++] = obj_table[i++]; /* fallthrough */ \
318  case 1: \
319  ring[idx++] = obj_table[i++]; \
320  } \
321  } else { \
322  for (i = 0; idx < size; i++, idx++)\
323  ring[idx] = obj_table[i]; \
324  for (idx = 0; i < n; i++, idx++) \
325  ring[idx] = obj_table[i]; \
326  } \
327 } while (0)
328 
329 /* the actual copy of pointers on the ring to obj_table.
330  * Placed here since identical code needed in both
331  * single and multi consumer dequeue functions */
332 #define DEQUEUE_PTRS(r, ring_start, cons_head, obj_table, n, obj_type) do { \
333  unsigned int i; \
334  uint32_t idx = cons_head & (r)->mask; \
335  const uint32_t size = (r)->size; \
336  obj_type *ring = (obj_type *)ring_start; \
337  if (likely(idx + n < size)) { \
338  for (i = 0; i < (n & (~(unsigned)0x3)); i+=4, idx+=4) {\
339  obj_table[i] = ring[idx]; \
340  obj_table[i+1] = ring[idx+1]; \
341  obj_table[i+2] = ring[idx+2]; \
342  obj_table[i+3] = ring[idx+3]; \
343  } \
344  switch (n & 0x3) { \
345  case 3: \
346  obj_table[i++] = ring[idx++]; /* fallthrough */ \
347  case 2: \
348  obj_table[i++] = ring[idx++]; /* fallthrough */ \
349  case 1: \
350  obj_table[i++] = ring[idx++]; \
351  } \
352  } else { \
353  for (i = 0; idx < size; i++, idx++) \
354  obj_table[i] = ring[idx]; \
355  for (idx = 0; i < n; i++, idx++) \
356  obj_table[i] = ring[idx]; \
357  } \
358 } while (0)
359 
360 static __rte_always_inline void
361 update_tail(struct rte_ring_headtail *ht, uint32_t old_val, uint32_t new_val,
362  uint32_t single)
363 {
364  /*
365  * If there are other enqueues/dequeues in progress that preceded us,
366  * we need to wait for them to complete
367  */
368  if (!single)
369  while (unlikely(ht->tail != old_val))
370  rte_pause();
371 
372  ht->tail = new_val;
373 }
374 
398 static __rte_always_inline unsigned int
399 __rte_ring_move_prod_head(struct rte_ring *r, unsigned int is_sp,
400  unsigned int n, enum rte_ring_queue_behavior behavior,
401  uint32_t *old_head, uint32_t *new_head,
402  uint32_t *free_entries)
403 {
404  const uint32_t capacity = r->capacity;
405  unsigned int max = n;
406  int success;
407 
408  do {
409  /* Reset n to the initial burst count */
410  n = max;
411 
412  *old_head = r->prod.head;
413 
414  /* add rmb barrier to avoid load/load reorder in weak
415  * memory model. It is noop on x86
416  */
417  rte_smp_rmb();
418 
419  /*
420  * The subtraction is done between two unsigned 32bits value
421  * (the result is always modulo 32 bits even if we have
422  * *old_head > cons_tail). So 'free_entries' is always between 0
423  * and capacity (which is < size).
424  */
425  *free_entries = (capacity + r->cons.tail - *old_head);
426 
427  /* check that we have enough room in ring */
428  if (unlikely(n > *free_entries))
429  n = (behavior == RTE_RING_QUEUE_FIXED) ?
430  0 : *free_entries;
431 
432  if (n == 0)
433  return 0;
434 
435  *new_head = *old_head + n;
436  if (is_sp)
437  r->prod.head = *new_head, success = 1;
438  else
439  success = rte_atomic32_cmpset(&r->prod.head,
440  *old_head, *new_head);
441  } while (unlikely(success == 0));
442  return n;
443 }
444 
465 static __rte_always_inline unsigned int
466 __rte_ring_do_enqueue(struct rte_ring *r, void * const *obj_table,
467  unsigned int n, enum rte_ring_queue_behavior behavior,
468  unsigned int is_sp, unsigned int *free_space)
469 {
470  uint32_t prod_head, prod_next;
471  uint32_t free_entries;
472 
473  n = __rte_ring_move_prod_head(r, is_sp, n, behavior,
474  &prod_head, &prod_next, &free_entries);
475  if (n == 0)
476  goto end;
477 
478  ENQUEUE_PTRS(r, &r[1], prod_head, obj_table, n, void *);
479  rte_smp_wmb();
480 
481  update_tail(&r->prod, prod_head, prod_next, is_sp);
482 end:
483  if (free_space != NULL)
484  *free_space = free_entries - n;
485  return n;
486 }
487 
511 static __rte_always_inline unsigned int
512 __rte_ring_move_cons_head(struct rte_ring *r, unsigned int is_sc,
513  unsigned int n, enum rte_ring_queue_behavior behavior,
514  uint32_t *old_head, uint32_t *new_head,
515  uint32_t *entries)
516 {
517  unsigned int max = n;
518  int success;
519 
520  /* move cons.head atomically */
521  do {
522  /* Restore n as it may change every loop */
523  n = max;
524 
525  *old_head = r->cons.head;
526 
527  /* add rmb barrier to avoid load/load reorder in weak
528  * memory model. It is noop on x86
529  */
530  rte_smp_rmb();
531 
532  /* The subtraction is done between two unsigned 32bits value
533  * (the result is always modulo 32 bits even if we have
534  * cons_head > prod_tail). So 'entries' is always between 0
535  * and size(ring)-1. */
536  *entries = (r->prod.tail - *old_head);
537 
538  /* Set the actual entries for dequeue */
539  if (n > *entries)
540  n = (behavior == RTE_RING_QUEUE_FIXED) ? 0 : *entries;
541 
542  if (unlikely(n == 0))
543  return 0;
544 
545  *new_head = *old_head + n;
546  if (is_sc)
547  r->cons.head = *new_head, success = 1;
548  else
549  success = rte_atomic32_cmpset(&r->cons.head, *old_head,
550  *new_head);
551  } while (unlikely(success == 0));
552  return n;
553 }
554 
575 static __rte_always_inline unsigned int
576 __rte_ring_do_dequeue(struct rte_ring *r, void **obj_table,
577  unsigned int n, enum rte_ring_queue_behavior behavior,
578  unsigned int is_sc, unsigned int *available)
579 {
580  uint32_t cons_head, cons_next;
581  uint32_t entries;
582 
583  n = __rte_ring_move_cons_head(r, (int)is_sc, n, behavior,
584  &cons_head, &cons_next, &entries);
585  if (n == 0)
586  goto end;
587 
588  DEQUEUE_PTRS(r, &r[1], cons_head, obj_table, n, void *);
589  rte_smp_rmb();
590 
591  update_tail(&r->cons, cons_head, cons_next, is_sc);
592 
593 end:
594  if (available != NULL)
595  *available = entries - n;
596  return n;
597 }
598 
617 static __rte_always_inline unsigned int
618 rte_ring_mp_enqueue_bulk(struct rte_ring *r, void * const *obj_table,
619  unsigned int n, unsigned int *free_space)
620 {
621  return __rte_ring_do_enqueue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
622  __IS_MP, free_space);
623 }
624 
640 static __rte_always_inline unsigned int
641 rte_ring_sp_enqueue_bulk(struct rte_ring *r, void * const *obj_table,
642  unsigned int n, unsigned int *free_space)
643 {
644  return __rte_ring_do_enqueue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
645  __IS_SP, free_space);
646 }
647 
667 static __rte_always_inline unsigned int
668 rte_ring_enqueue_bulk(struct rte_ring *r, void * const *obj_table,
669  unsigned int n, unsigned int *free_space)
670 {
671  return __rte_ring_do_enqueue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
672  r->prod.single, free_space);
673 }
674 
689 static __rte_always_inline int
690 rte_ring_mp_enqueue(struct rte_ring *r, void *obj)
691 {
692  return rte_ring_mp_enqueue_bulk(r, &obj, 1, NULL) ? 0 : -ENOBUFS;
693 }
694 
706 static __rte_always_inline int
707 rte_ring_sp_enqueue(struct rte_ring *r, void *obj)
708 {
709  return rte_ring_sp_enqueue_bulk(r, &obj, 1, NULL) ? 0 : -ENOBUFS;
710 }
711 
727 static __rte_always_inline int
728 rte_ring_enqueue(struct rte_ring *r, void *obj)
729 {
730  return rte_ring_enqueue_bulk(r, &obj, 1, NULL) ? 0 : -ENOBUFS;
731 }
732 
751 static __rte_always_inline unsigned int
752 rte_ring_mc_dequeue_bulk(struct rte_ring *r, void **obj_table,
753  unsigned int n, unsigned int *available)
754 {
755  return __rte_ring_do_dequeue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
756  __IS_MC, available);
757 }
758 
775 static __rte_always_inline unsigned int
776 rte_ring_sc_dequeue_bulk(struct rte_ring *r, void **obj_table,
777  unsigned int n, unsigned int *available)
778 {
779  return __rte_ring_do_dequeue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
780  __IS_SC, available);
781 }
782 
802 static __rte_always_inline unsigned int
803 rte_ring_dequeue_bulk(struct rte_ring *r, void **obj_table, unsigned int n,
804  unsigned int *available)
805 {
806  return __rte_ring_do_dequeue(r, obj_table, n, RTE_RING_QUEUE_FIXED,
807  r->cons.single, available);
808 }
809 
825 static __rte_always_inline int
826 rte_ring_mc_dequeue(struct rte_ring *r, void **obj_p)
827 {
828  return rte_ring_mc_dequeue_bulk(r, obj_p, 1, NULL) ? 0 : -ENOENT;
829 }
830 
843 static __rte_always_inline int
844 rte_ring_sc_dequeue(struct rte_ring *r, void **obj_p)
845 {
846  return rte_ring_sc_dequeue_bulk(r, obj_p, 1, NULL) ? 0 : -ENOENT;
847 }
848 
865 static __rte_always_inline int
866 rte_ring_dequeue(struct rte_ring *r, void **obj_p)
867 {
868  return rte_ring_dequeue_bulk(r, obj_p, 1, NULL) ? 0 : -ENOENT;
869 }
870 
879 static inline unsigned
880 rte_ring_count(const struct rte_ring *r)
881 {
882  uint32_t prod_tail = r->prod.tail;
883  uint32_t cons_tail = r->cons.tail;
884  uint32_t count = (prod_tail - cons_tail) & r->mask;
885  return (count > r->capacity) ? r->capacity : count;
886 }
887 
896 static inline unsigned
898 {
899  return r->capacity - rte_ring_count(r);
900 }
901 
911 static inline int
912 rte_ring_full(const struct rte_ring *r)
913 {
914  return rte_ring_free_count(r) == 0;
915 }
916 
926 static inline int
927 rte_ring_empty(const struct rte_ring *r)
928 {
929  return rte_ring_count(r) == 0;
930 }
931 
942 static inline unsigned int
943 rte_ring_get_size(const struct rte_ring *r)
944 {
945  return r->size;
946 }
947 
956 static inline unsigned int
958 {
959  return r->capacity;
960 }
961 
968 void rte_ring_list_dump(FILE *f);
969 
980 struct rte_ring *rte_ring_lookup(const char *name);
981 
1000 static __rte_always_inline unsigned
1001 rte_ring_mp_enqueue_burst(struct rte_ring *r, void * const *obj_table,
1002  unsigned int n, unsigned int *free_space)
1003 {
1004  return __rte_ring_do_enqueue(r, obj_table, n,
1005  RTE_RING_QUEUE_VARIABLE, __IS_MP, free_space);
1006 }
1007 
1023 static __rte_always_inline unsigned
1024 rte_ring_sp_enqueue_burst(struct rte_ring *r, void * const *obj_table,
1025  unsigned int n, unsigned int *free_space)
1026 {
1027  return __rte_ring_do_enqueue(r, obj_table, n,
1028  RTE_RING_QUEUE_VARIABLE, __IS_SP, free_space);
1029 }
1030 
1050 static __rte_always_inline unsigned
1051 rte_ring_enqueue_burst(struct rte_ring *r, void * const *obj_table,
1052  unsigned int n, unsigned int *free_space)
1053 {
1054  return __rte_ring_do_enqueue(r, obj_table, n, RTE_RING_QUEUE_VARIABLE,
1055  r->prod.single, free_space);
1056 }
1057 
1078 static __rte_always_inline unsigned
1079 rte_ring_mc_dequeue_burst(struct rte_ring *r, void **obj_table,
1080  unsigned int n, unsigned int *available)
1081 {
1082  return __rte_ring_do_dequeue(r, obj_table, n,
1083  RTE_RING_QUEUE_VARIABLE, __IS_MC, available);
1084 }
1085 
1103 static __rte_always_inline unsigned
1104 rte_ring_sc_dequeue_burst(struct rte_ring *r, void **obj_table,
1105  unsigned int n, unsigned int *available)
1106 {
1107  return __rte_ring_do_dequeue(r, obj_table, n,
1108  RTE_RING_QUEUE_VARIABLE, __IS_SC, available);
1109 }
1110 
1130 static __rte_always_inline unsigned
1131 rte_ring_dequeue_burst(struct rte_ring *r, void **obj_table,
1132  unsigned int n, unsigned int *available)
1133 {
1134  return __rte_ring_do_dequeue(r, obj_table, n,
1135  RTE_RING_QUEUE_VARIABLE,
1136  r->cons.single, available);
1137 }
1138 
1139 #ifdef __cplusplus
1140 }
1141 #endif
1142 
1143 #endif /* _RTE_RING_H_ */
static void rte_smp_rmb(void)
static int rte_atomic32_cmpset(volatile uint32_t *dst, uint32_t exp, uint32_t src)
#define __rte_always_inline
Definition: rte_common.h:139
const struct rte_memzone * memzone
Definition: rte_ring.h:154
static __rte_always_inline unsigned int rte_ring_enqueue_bulk(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:668
int flags
Definition: rte_ring.h:153
char name [RTE_MEMZONE_NAMESIZE] __rte_cache_aligned
Definition: rte_ring.h:152
static __rte_always_inline int rte_ring_dequeue(struct rte_ring *r, void **obj_p)
Definition: rte_ring.h:866
static __rte_always_inline unsigned rte_ring_mc_dequeue_burst(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:1079
static int rte_ring_empty(const struct rte_ring *r)
Definition: rte_ring.h:927
static __rte_always_inline unsigned rte_ring_mp_enqueue_burst(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:1001
static __rte_always_inline int rte_ring_mc_dequeue(struct rte_ring *r, void **obj_p)
Definition: rte_ring.h:826
void rte_ring_list_dump(FILE *f)
static __rte_always_inline unsigned int rte_ring_mp_enqueue_bulk(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:618
#define unlikely(x)
static __rte_always_inline int rte_ring_sp_enqueue(struct rte_ring *r, void *obj)
Definition: rte_ring.h:707
static __rte_always_inline int rte_ring_mp_enqueue(struct rte_ring *r, void *obj)
Definition: rte_ring.h:690
static unsigned int rte_ring_get_capacity(const struct rte_ring *r)
Definition: rte_ring.h:957
static unsigned int rte_ring_get_size(const struct rte_ring *r)
Definition: rte_ring.h:943
static __rte_always_inline int rte_ring_sc_dequeue(struct rte_ring *r, void **obj_p)
Definition: rte_ring.h:844
uint32_t size
Definition: rte_ring.h:156
void rte_ring_free(struct rte_ring *r)
static void rte_pause(void)
static __rte_always_inline unsigned rte_ring_sp_enqueue_burst(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:1024
static void rte_smp_wmb(void)
static __rte_always_inline unsigned rte_ring_sc_dequeue_burst(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:1104
static __rte_always_inline unsigned rte_ring_dequeue_burst(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:1131
static __rte_always_inline unsigned int rte_ring_sp_enqueue_bulk(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:641
void rte_ring_dump(FILE *f, const struct rte_ring *r)
static unsigned rte_ring_count(const struct rte_ring *r)
Definition: rte_ring.h:880
uint32_t mask
Definition: rte_ring.h:157
struct rte_ring * rte_ring_create(const char *name, unsigned count, int socket_id, unsigned flags)
static __rte_always_inline unsigned int rte_ring_dequeue_bulk(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:803
static __rte_always_inline unsigned int rte_ring_sc_dequeue_bulk(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:776
struct rte_ring * rte_ring_lookup(const char *name)
uint32_t capacity
Definition: rte_ring.h:158
static unsigned rte_ring_free_count(const struct rte_ring *r)
Definition: rte_ring.h:897
static __rte_always_inline int rte_ring_enqueue(struct rte_ring *r, void *obj)
Definition: rte_ring.h:728
static __rte_always_inline unsigned rte_ring_enqueue_burst(struct rte_ring *r, void *const *obj_table, unsigned int n, unsigned int *free_space)
Definition: rte_ring.h:1051
static __rte_always_inline unsigned int rte_ring_mc_dequeue_bulk(struct rte_ring *r, void **obj_table, unsigned int n, unsigned int *available)
Definition: rte_ring.h:752
int rte_ring_init(struct rte_ring *r, const char *name, unsigned count, unsigned flags)
static int rte_ring_full(const struct rte_ring *r)
Definition: rte_ring.h:912
ssize_t rte_ring_get_memsize(unsigned count)
#define __rte_aligned(a)
Definition: rte_common.h:90
#define RTE_MEMZONE_NAMESIZE
Definition: rte_memzone.h:78