lib/librte_reorder/rte_reorder.c

   1 /* SPDX-License-Identifier: BSD-3-Clause
   2  * Copyright(c) 2010-2014 Intel Corporation
   3  */
   4
   5 #include <inttypes.h>
   6 #include <string.h>
   7
   8 #include <rte_string_fns.h>
   9 #include <rte_log.h>
  10 #include <rte_mbuf.h>
  11 #include <rte_eal_memconfig.h>
  12 #include <rte_errno.h>
  13 #include <rte_malloc.h>
  14
  15 #include "rte_reorder.h"
  16
  17 TAILQ_HEAD(rte_reorder_list, rte_tailq_entry);
  18
  19 static struct rte_tailq_elem rte_reorder_tailq = {
  20         .name = "RTE_REORDER",
  21 };
  22 EAL_REGISTER_TAILQ(rte_reorder_tailq)
  23
  24 #define NO_FLAGS 0
  25 #define RTE_REORDER_PREFIX "RO_"
  26 #define RTE_REORDER_NAMESIZE 32
  27
  28 /* Macros for printing using RTE_LOG */
  29 #define RTE_LOGTYPE_REORDER     RTE_LOGTYPE_USER1
  30
  31 /* A generic circular buffer */
  32 struct cir_buffer {
  33         unsigned int size;   /**< Number of entries that can be stored */
  34         unsigned int mask;   /**< [buffer_size - 1]: used for wrap-around */
  35         unsigned int head;   /**< insertion point in buffer */
  36         unsigned int tail;   /**< extraction point in buffer */
  37         struct rte_mbuf **entries;
  38 } __rte_cache_aligned;
  39
  40 /* The reorder buffer data structure itself */
  41 struct rte_reorder_buffer {
  42         char name[RTE_REORDER_NAMESIZE];
  43         uint32_t min_seqn;  /**< Lowest seq. number that can be in the buffer */
  44         unsigned int memsize; /**< memory area size of reorder buffer */
  45         struct cir_buffer ready_buf; /**< temp buffer for dequeued entries */
  46         struct cir_buffer order_buf; /**< buffer used to reorder entries */
  47         int is_initialized;
  48 } __rte_cache_aligned;
  49
  50 static void
  51 rte_reorder_free_mbufs(struct rte_reorder_buffer *b);
  52
  53 struct rte_reorder_buffer *
  54 rte_reorder_init(struct rte_reorder_buffer *b, unsigned int bufsize,
  55                 const char *name, unsigned int size)
  56 {
  57         const unsigned int min_bufsize = sizeof(*b) +
  58                                         (2 * size * sizeof(struct rte_mbuf *));
  59
  60         if (b == NULL) {
  61                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer parameter:"
  62                                         " NULL\n");
  63                 rte_errno = EINVAL;
  64                 return NULL;
  65         }
  66         if (!rte_is_power_of_2(size)) {
  67                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer size"
  68                                 " - Not a power of 2\n");
  69                 rte_errno = EINVAL;
  70                 return NULL;
  71         }
  72         if (name == NULL) {
  73                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer name ptr:"
  74                                         " NULL\n");
  75                 rte_errno = EINVAL;
  76                 return NULL;
  77         }
  78         if (bufsize < min_bufsize) {
  79                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer memory size: %u, "
  80                         "minimum required: %u\n", bufsize, min_bufsize);
  81                 rte_errno = EINVAL;
  82                 return NULL;
  83         }
  84
  85         memset(b, 0, bufsize);
  86         strlcpy(b->name, name, sizeof(b->name));
  87         b->memsize = bufsize;
  88         b->order_buf.size = b->ready_buf.size = size;
  89         b->order_buf.mask = b->ready_buf.mask = size - 1;
  90         b->ready_buf.entries = (void *)&b[1];
  91         b->order_buf.entries = RTE_PTR_ADD(&b[1],
  92                         size * sizeof(b->ready_buf.entries[0]));
  93
  94         return b;
  95 }
  96
  97 struct rte_reorder_buffer*
  98 rte_reorder_create(const char *name, unsigned socket_id, unsigned int size)
  99 {
 100         struct rte_reorder_buffer *b = NULL;
 101         struct rte_tailq_entry *te;
 102         struct rte_reorder_list *reorder_list;
 103         const unsigned int bufsize = sizeof(struct rte_reorder_buffer) +
 104                                         (2 * size * sizeof(struct rte_mbuf *));
 105
 106         reorder_list = RTE_TAILQ_CAST(rte_reorder_tailq.head, rte_reorder_list);
 107
 108         /* Check user arguments. */
 109         if (!rte_is_power_of_2(size)) {
 110                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer size"
 111                                 " - Not a power of 2\n");
 112                 rte_errno = EINVAL;
 113                 return NULL;
 114         }
 115         if (name == NULL) {
 116                 RTE_LOG(ERR, REORDER, "Invalid reorder buffer name ptr:"
 117                                         " NULL\n");
 118                 rte_errno = EINVAL;
 119                 return NULL;
 120         }
 121
 122         rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
 123
 124         /* guarantee there's no existing */
 125         TAILQ_FOREACH(te, reorder_list, next) {
 126                 b = (struct rte_reorder_buffer *) te->data;
 127                 if (strncmp(name, b->name, RTE_REORDER_NAMESIZE) == 0)
 128                         break;
 129         }
 130         if (te != NULL)
 131                 goto exit;
 132
 133         /* allocate tailq entry */
 134         te = rte_zmalloc("REORDER_TAILQ_ENTRY", sizeof(*te), 0);
 135         if (te == NULL) {
 136                 RTE_LOG(ERR, REORDER, "Failed to allocate tailq entry\n");
 137                 rte_errno = ENOMEM;
 138                 b = NULL;
 139                 goto exit;
 140         }
 141
 142         /* Allocate memory to store the reorder buffer structure. */
 143         b = rte_zmalloc_socket("REORDER_BUFFER", bufsize, 0, socket_id);
 144         if (b == NULL) {
 145                 RTE_LOG(ERR, REORDER, "Memzone allocation failed\n");
 146                 rte_errno = ENOMEM;
 147                 rte_free(te);
 148         } else {
 149                 rte_reorder_init(b, bufsize, name, size);
 150                 te->data = (void *)b;
 151                 TAILQ_INSERT_TAIL(reorder_list, te, next);
 152         }
 153
 154 exit:
 155         rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
 156         return b;
 157 }
 158
 159 void
 160 rte_reorder_reset(struct rte_reorder_buffer *b)
 161 {
 162         char name[RTE_REORDER_NAMESIZE];
 163
 164         rte_reorder_free_mbufs(b);
 165         strlcpy(name, b->name, sizeof(name));
 166         /* No error checking as current values should be valid */
 167         rte_reorder_init(b, b->memsize, name, b->order_buf.size);
 168 }
 169
 170 static void
 171 rte_reorder_free_mbufs(struct rte_reorder_buffer *b)
 172 {
 173         unsigned i;
 174
 175         /* Free up the mbufs of order buffer & ready buffer */
 176         for (i = 0; i < b->order_buf.size; i++) {
 177                 if (b->order_buf.entries[i])
 178                         rte_pktmbuf_free(b->order_buf.entries[i]);
 179                 if (b->ready_buf.entries[i])
 180                         rte_pktmbuf_free(b->ready_buf.entries[i]);
 181         }
 182 }
 183
 184 void
 185 rte_reorder_free(struct rte_reorder_buffer *b)
 186 {
 187         struct rte_reorder_list *reorder_list;
 188         struct rte_tailq_entry *te;
 189
 190         /* Check user arguments. */
 191         if (b == NULL)
 192                 return;
 193
 194         reorder_list = RTE_TAILQ_CAST(rte_reorder_tailq.head, rte_reorder_list);
 195
 196         rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
 197
 198         /* find our tailq entry */
 199         TAILQ_FOREACH(te, reorder_list, next) {
 200                 if (te->data == (void *) b)
 201                         break;
 202         }
 203         if (te == NULL) {
 204                 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
 205                 return;
 206         }
 207
 208         TAILQ_REMOVE(reorder_list, te, next);
 209
 210         rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
 211
 212         rte_reorder_free_mbufs(b);
 213
 214         rte_free(b);
 215         rte_free(te);
 216 }
 217
 218 struct rte_reorder_buffer *
 219 rte_reorder_find_existing(const char *name)
 220 {
 221         struct rte_reorder_buffer *b = NULL;
 222         struct rte_tailq_entry *te;
 223         struct rte_reorder_list *reorder_list;
 224
 225         reorder_list = RTE_TAILQ_CAST(rte_reorder_tailq.head, rte_reorder_list);
 226
 227         rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
 228         TAILQ_FOREACH(te, reorder_list, next) {
 229                 b = (struct rte_reorder_buffer *) te->data;
 230                 if (strncmp(name, b->name, RTE_REORDER_NAMESIZE) == 0)
 231                         break;
 232         }
 233         rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
 234
 235         if (te == NULL) {
 236                 rte_errno = ENOENT;
 237                 return NULL;
 238         }
 239
 240         return b;
 241 }
 242
 243 static unsigned
 244 rte_reorder_fill_overflow(struct rte_reorder_buffer *b, unsigned n)
 245 {
 246         /*
 247          * 1. Move all ready entries that fit to the ready_buf
 248          * 2. check if we meet the minimum needed (n).
 249          * 3. If not, then skip any gaps and keep moving.
 250          * 4. If at any point the ready buffer is full, stop
 251          * 5. Return the number of positions the order_buf head has moved
 252          */
 253
 254         struct cir_buffer *order_buf = &b->order_buf,
 255                         *ready_buf = &b->ready_buf;
 256
 257         unsigned int order_head_adv = 0;
 258
 259         /*
 260          * move at least n packets to ready buffer, assuming ready buffer
 261          * has room for those packets.
 262          */
 263         while (order_head_adv < n &&
 264                         ((ready_buf->head + 1) & ready_buf->mask) != ready_buf->tail) {
 265
 266                 /* if we are blocked waiting on a packet, skip it */
 267                 if (order_buf->entries[order_buf->head] == NULL) {
 268                         order_buf->head = (order_buf->head + 1) & order_buf->mask;
 269                         order_head_adv++;
 270                 }
 271
 272                 /* Move all ready entries that fit to the ready_buf */
 273                 while (order_buf->entries[order_buf->head] != NULL) {
 274                         ready_buf->entries[ready_buf->head] =
 275                                         order_buf->entries[order_buf->head];
 276
 277                         order_buf->entries[order_buf->head] = NULL;
 278                         order_head_adv++;
 279
 280                         order_buf->head = (order_buf->head + 1) & order_buf->mask;
 281
 282                         if (((ready_buf->head + 1) & ready_buf->mask) == ready_buf->tail)
 283                                 break;
 284
 285                         ready_buf->head = (ready_buf->head + 1) & ready_buf->mask;
 286                 }
 287         }
 288
 289         b->min_seqn += order_head_adv;
 290         /* Return the number of positions the order_buf head has moved */
 291         return order_head_adv;
 292 }
 293
 294 int
 295 rte_reorder_insert(struct rte_reorder_buffer *b, struct rte_mbuf *mbuf)
 296 {
 297         uint32_t offset, position;
 298         struct cir_buffer *order_buf = &b->order_buf;
 299
 300         if (!b->is_initialized) {
 301                 b->min_seqn = mbuf->seqn;
 302                 b->is_initialized = 1;
 303         }
 304
 305         /*
 306          * calculate the offset from the head pointer we need to go.
 307          * The subtraction takes care of the sequence number wrapping.
 308          * For example (using 16-bit for brevity):
 309          *      min_seqn  = 0xFFFD
 310          *      mbuf_seqn = 0x0010
 311          *      offset    = 0x0010 - 0xFFFD = 0x13
 312          */
 313         offset = mbuf->seqn - b->min_seqn;
 314
 315         /*
 316          * action to take depends on offset.
 317          * offset < buffer->size: the mbuf fits within the current window of
 318          *    sequence numbers we can reorder. EXPECTED CASE.
 319          * offset > buffer->size: the mbuf is outside the current window. There
 320          *    are a number of cases to consider:
 321          *    1. The packet sequence is just outside the window, then we need
 322          *       to see about shifting the head pointer and taking any ready
 323          *       to return packets out of the ring. If there was a delayed
 324          *       or dropped packet preventing drains from shifting the window
 325          *       this case will skip over the dropped packet instead, and any
 326          *       packets dequeued here will be returned on the next drain call.
 327          *    2. The packet sequence number is vastly outside our window, taken
 328          *       here as having offset greater than twice the buffer size. In
 329          *       this case, the packet is probably an old or late packet that
 330          *       was previously skipped, so just enqueue the packet for
 331          *       immediate return on the next drain call, or else return error.
 332          */
 333         if (offset < b->order_buf.size) {
 334                 position = (order_buf->head + offset) & order_buf->mask;
 335                 order_buf->entries[position] = mbuf;
 336         } else if (offset < 2 * b->order_buf.size) {
 337                 if (rte_reorder_fill_overflow(b, offset + 1 - order_buf->size)
 338                                 < (offset + 1 - order_buf->size)) {
 339                         /* Put in handling for enqueue straight to output */
 340                         rte_errno = ENOSPC;
 341                         return -1;
 342                 }
 343                 offset = mbuf->seqn - b->min_seqn;
 344                 position = (order_buf->head + offset) & order_buf->mask;
 345                 order_buf->entries[position] = mbuf;
 346         } else {
 347                 /* Put in handling for enqueue straight to output */
 348                 rte_errno = ERANGE;
 349                 return -1;
 350         }
 351         return 0;
 352 }
 353
 354 unsigned int
 355 rte_reorder_drain(struct rte_reorder_buffer *b, struct rte_mbuf **mbufs,
 356                 unsigned max_mbufs)
 357 {
 358         unsigned int drain_cnt = 0;
 359
 360         struct cir_buffer *order_buf = &b->order_buf,
 361                         *ready_buf = &b->ready_buf;
 362
 363         /* Try to fetch requested number of mbufs from ready buffer */
 364         while ((drain_cnt < max_mbufs) && (ready_buf->tail != ready_buf->head)) {
 365                 mbufs[drain_cnt++] = ready_buf->entries[ready_buf->tail];
 366                 ready_buf->tail = (ready_buf->tail + 1) & ready_buf->mask;
 367         }
 368
 369         /*
 370          * If requested number of buffers not fetched from ready buffer, fetch
 371          * remaining buffers from order buffer
 372          */
 373         while ((drain_cnt < max_mbufs) &&
 374                         (order_buf->entries[order_buf->head] != NULL)) {
 375                 mbufs[drain_cnt++] = order_buf->entries[order_buf->head];
 376                 order_buf->entries[order_buf->head] = NULL;
 377                 b->min_seqn++;
 378                 order_buf->head = (order_buf->head + 1) & order_buf->mask;
 379         }
 380
 381         return drain_cnt;
 382 }