mirror of
https://github.com/neovim/neovim.git
synced 2025-10-05 17:36:29 +00:00
7dffc36e61
Before this change, "static inline" functions in headers needed to have their function attributes specified in a completely different way. The prototype had to be duplicated, and REAL_FATTR_ had to be used instead of the public FUNC_ATTR_ names. TODO: need a check that a "header.h.inline.generated.h" file is not forgotten when the first "static inline" function with attributes is added to a header (they would just be silently missing).
97 lines
2.6 KiB
C
97 lines
2.6 KiB
C
// Queue implemented by circularly-linked list.
|
|
//
|
|
// Adapted from libuv. Simpler and more efficient than klist.h for implementing
|
|
// queues that support arbitrary insertion/removal.
|
|
//
|
|
// Copyright (c) 2013, Ben Noordhuis <info@bnoordhuis.nl>
|
|
//
|
|
// Permission to use, copy, modify, and/or distribute this software for any
|
|
// purpose with or without fee is hereby granted, provided that the above
|
|
// copyright notice and this permission notice appear in all copies.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
#pragma once
|
|
|
|
#include <stddef.h>
|
|
|
|
typedef struct queue {
|
|
struct queue *next;
|
|
struct queue *prev;
|
|
} QUEUE;
|
|
|
|
#ifdef INCLUDE_GENERATED_DECLARATIONS
|
|
# include "lib/queue_defs.h.inline.generated.h"
|
|
#endif
|
|
|
|
// Public macros.
|
|
#define QUEUE_DATA(ptr, type, field) \
|
|
((type *)((char *)(ptr) - offsetof(type, field)))
|
|
|
|
// Important note: the node currently being processed can be safely deleted.
|
|
// otherwise, mutating the list while QUEUE_FOREACH is iterating over its
|
|
// elements results in undefined behavior.
|
|
#define QUEUE_FOREACH(q, h, code) \
|
|
(q) = (h)->next; \
|
|
while ((q) != (h)) { \
|
|
QUEUE *next = q->next; \
|
|
code \
|
|
(q) = next; \
|
|
}
|
|
|
|
// ffi.cdef is unable to swallow `bool` in place of `int` here.
|
|
static inline int QUEUE_EMPTY(const QUEUE *const q)
|
|
FUNC_ATTR_ALWAYS_INLINE FUNC_ATTR_PURE FUNC_ATTR_WARN_UNUSED_RESULT
|
|
{
|
|
return q == q->next;
|
|
}
|
|
|
|
#define QUEUE_HEAD(q) (q)->next
|
|
|
|
static inline void QUEUE_INIT(QUEUE *const q)
|
|
FUNC_ATTR_ALWAYS_INLINE
|
|
{
|
|
q->next = q;
|
|
q->prev = q;
|
|
}
|
|
|
|
static inline void QUEUE_ADD(QUEUE *const h, QUEUE *const n)
|
|
FUNC_ATTR_ALWAYS_INLINE
|
|
{
|
|
h->prev->next = n->next;
|
|
n->next->prev = h->prev;
|
|
h->prev = n->prev;
|
|
h->prev->next = h;
|
|
}
|
|
|
|
static inline void QUEUE_INSERT_HEAD(QUEUE *const h, QUEUE *const q)
|
|
FUNC_ATTR_ALWAYS_INLINE
|
|
{
|
|
q->next = h->next;
|
|
q->prev = h;
|
|
q->next->prev = q;
|
|
h->next = q;
|
|
}
|
|
|
|
static inline void QUEUE_INSERT_TAIL(QUEUE *const h, QUEUE *const q)
|
|
FUNC_ATTR_ALWAYS_INLINE
|
|
{
|
|
q->next = h;
|
|
q->prev = h->prev;
|
|
q->prev->next = q;
|
|
h->prev = q;
|
|
}
|
|
|
|
static inline void QUEUE_REMOVE(QUEUE *const q)
|
|
FUNC_ATTR_ALWAYS_INLINE
|
|
{
|
|
q->prev->next = q->next;
|
|
q->next->prev = q->prev;
|
|
}
|