rtbuf/rtbuf/librtbuf/queue.h

• Show log

  Commit

• Hash : adb9e235
  Author : Thomas de Grivel
  Date : 2023-01-14T18:26:30
  

  license
  

Download

• librtbuf/queue.h

• /* rtbuf
   * Copyright 2018-2023 kmx.io <contact@kmx.io>
   *
   * Permission is hereby granted to use this software excepted
   * on Apple computers granted the above copyright notice and
   * this permission paragraph are included in all copies and
   * substantial portions of this software.
   *
   * THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
   * PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
   * AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
   * THIS SOFTWARE.
   */
  #ifndef QUEUE_H
  #define QUEUE_H
  
  /* static queue */
  
  #define QUEUE_TYPE(type, size)  \
    type ## _queue_ ## size
  
  #define QUEUE(type, size)          \
    struct QUEUE_TYPE(type, size) {  \
      unsigned int length;           \
      unsigned int read_index;       \
      unsigned int write_index;      \
      type item[size];               \
    }
  
  #define S_QUEUE_TYPE(type, size)  \
    s_ ## QUEUE_TYPE(type, size)
  
  #define QUEUE_METHOD(type, size, method)  \
    QUEUE_TYPE(type, size) ## _ ## method
  
  #define DEFINE_QUEUE(type, size)                            \
    typedef QUEUE(type, size) S_QUEUE_TYPE(type, size);       \
    static void QUEUE_METHOD(type, size, init)                \
      (S_QUEUE_TYPE(type, size) *q)                           \
    {                                                         \
      bzero(q, sizeof(q));                                    \
    }                                                         \
    static void QUEUE_METHOD(type, size, free)                \
      (S_QUEUE_TYPE(type, size) *q)                           \
    {                                                         \
      bzero(q, sizeof(q));                                    \
    }                                                         \
    static int QUEUE_METHOD(type, size, enqueue)              \
      (S_QUEUE_TYPE(type, size) *q, type item)                \
    {                                                         \
      if (q->length < size) {                                 \
        unsigned int write_index = q->write_index;            \
        q->write_index = (q->write_index + 1) % size;         \
        q->item[write_index] = item;                          \
        q->length++;                                          \
        return 0;                                             \
      }                                                       \
      return -1;                                              \
    }                                                         \
    static int QUEUE_METHOD(type, size, dequeue)              \
      (S_QUEUE_TYPE(type, size) *q, type *ptr)                \
    {                                                         \
      if (q->length > 0) {                                    \
        unsigned int read_index = q->read_index;              \
        q->read_index = (read_index + 1) % size;              \
        *ptr = q->item[read_index];                           \
        q->length--;                                          \
        return 0;                                             \
      }                                                       \
      return -1;                                              \
    }
  
  #endif
  

Download