ceph/src/pmdk/src/common/vecq.h

   1 /* SPDX-License-Identifier: BSD-3-Clause */
   2 /* Copyright 2018-2020, Intel Corporation */
   3
   4 /*
   5  * vecq.h -- vector queue (FIFO) interface
   6  */
   7
   8 #ifndef PMDK_VECQ_H
   9 #define PMDK_VECQ_H 1
  10
  11 #include <stddef.h>
  12 #include "util.h"
  13 #include "out.h"
  14 #include "alloc.h"
  15
  16 #ifdef __cplusplus
  17 extern "C" {
  18 #endif
  19
  20 #define VECQ_INIT_SIZE (64)
  21
  22 #define VECQ(name, type)\
  23 struct name {\
  24         type *buffer;\
  25         size_t capacity;\
  26         size_t front;\
  27         size_t back;\
  28 }
  29
  30 #define VECQ_INIT(vec) do {\
  31         (vec)->buffer = NULL;\
  32         (vec)->capacity = 0;\
  33         (vec)->front = 0;\
  34         (vec)->back = 0;\
  35 } while (0)
  36
  37 #define VECQ_REINIT(vec) do {\
  38         VALGRIND_ANNOTATE_NEW_MEMORY((vec), sizeof(*vec));\
  39         VALGRIND_ANNOTATE_NEW_MEMORY((vec)->buffer,\
  40                 (sizeof(*(vec)->buffer) * ((vec)->capacity)));\
  41         (vec)->front = 0;\
  42         (vec)->back = 0;\
  43 } while (0)
  44
  45 #define VECQ_FRONT_POS(vec)\
  46 ((vec)->front & ((vec)->capacity - 1))
  47
  48 #define VECQ_BACK_POS(vec)\
  49 ((vec)->back & ((vec)->capacity - 1))
  50
  51 #define VECQ_FRONT(vec)\
  52 (vec)->buffer[VECQ_FRONT_POS(vec)]
  53
  54 #define VECQ_BACK(vec)\
  55 (vec)->buffer[VECQ_BACK_POS(vec)]
  56
  57 #define VECQ_DEQUEUE(vec)\
  58 ((vec)->buffer[(((vec)->front++) & ((vec)->capacity - 1))])
  59
  60 #define VECQ_SIZE(vec)\
  61 ((vec)->back - (vec)->front)
  62
  63 static inline int
  64 realloc_set(void **buf, size_t s)
  65 {
  66         void *tbuf = Realloc(*buf, s);
  67         if (tbuf == NULL) {
  68                 ERR("!Realloc");
  69                 return -1;
  70         }
  71         *buf = tbuf;
  72         return 0;
  73 }
  74
  75 #define VECQ_NCAPACITY(vec)\
  76 ((vec)->capacity == 0 ? VECQ_INIT_SIZE : (vec)->capacity * 2)
  77 #define VECQ_GROW(vec)\
  78 (realloc_set((void **)&(vec)->buffer,\
  79                 VECQ_NCAPACITY(vec) * sizeof(*(vec)->buffer)) ? -1 :\
  80         (memcpy((vec)->buffer + (vec)->capacity, (vec)->buffer,\
  81                 VECQ_FRONT_POS(vec) * sizeof(*(vec)->buffer)),\
  82         (vec)->front = VECQ_FRONT_POS(vec),\
  83         (vec)->back = (vec)->front + (vec)->capacity,\
  84         (vec)->capacity = VECQ_NCAPACITY(vec),\
  85         0\
  86 ))
  87
  88 #define VECQ_INSERT(vec, element)\
  89 (VECQ_BACK(vec) = element, (vec)->back += 1, 0)
  90
  91 #define VECQ_ENQUEUE(vec, element)\
  92 ((vec)->capacity == VECQ_SIZE(vec) ?\
  93         (VECQ_GROW(vec) == 0 ? VECQ_INSERT(vec, element) : -1) :\
  94 VECQ_INSERT(vec, element))
  95
  96 #define VECQ_CAPACITY(vec)\
  97 ((vec)->capacity)
  98
  99 #define VECQ_FOREACH(el, vec)\
 100 for (size_t _vec_i = 0;\
 101         _vec_i < VECQ_SIZE(vec) &&\
 102         (((el) = (vec)->buffer[_vec_i & ((vec)->capacity - 1)]), 1);\
 103         ++_vec_i)
 104
 105 #define VECQ_FOREACH_REVERSE(el, vec)\
 106 for (size_t _vec_i = VECQ_SIZE(vec);\
 107         _vec_i > 0 &&\
 108         (((el) = (vec)->buffer[(_vec_i - 1) & ((vec)->capacity - 1)]), 1);\
 109         --_vec_i)
 110
 111 #define VECQ_CLEAR(vec) do {\
 112         (vec)->front = 0;\
 113         (vec)->back = 0;\
 114 } while (0)
 115
 116 #define VECQ_DELETE(vec) do {\
 117         Free((vec)->buffer);\
 118         (vec)->buffer = NULL;\
 119         (vec)->capacity = 0;\
 120         (vec)->front = 0;\
 121         (vec)->back = 0;\
 122 } while (0)
 123
 124 #ifdef __cplusplus
 125 }
 126 #endif
 127
 128 #endif /* PMDK_VECQ_H */