/usr/include/libHX/list.h is in libhx-dev 3.21-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 | #ifndef _LIBHX_LIST_H
#define _LIBHX_LIST_H 1
#ifdef __cplusplus
# include <cstddef>
#else
# include <stdbool.h>
# include <stddef.h>
#endif
#include <libHX/defs.h>
#ifdef __cplusplus
extern "C" {
#endif
#define HXlist_entry(ptr, type, member) containerof((ptr), type, member)
struct HXlist_head {
struct HXlist_head *next, *prev;
};
#define HXLIST_HEAD_INIT(name) {&(name), &(name)}
#define HXLIST_HEAD(name) \
struct HXlist_head name = HXLIST_HEAD_INIT(name)
static __inline__ void HXlist_init(struct HXlist_head *list)
{
list->next = list->prev = list;
}
static __inline__ void __HXlist_add(struct HXlist_head *nu,
struct HXlist_head *prev, struct HXlist_head *next)
{
nu->next = next;
nu->prev = prev;
next->prev = nu;
prev->next = nu;
}
static __inline__ void
HXlist_add(struct HXlist_head *head, struct HXlist_head *entry)
{
__HXlist_add(entry, head, head->next);
}
static __inline__ void
HXlist_add_tail(struct HXlist_head *head, struct HXlist_head *entry)
{
__HXlist_add(entry, head->prev, head);
}
static __inline__ void HXlist_del(struct HXlist_head *entry)
{
entry->prev->next = entry->next;
entry->next->prev = entry->prev;
entry->next = NULL;
entry->prev = NULL;
}
static __inline__ bool HXlist_empty(const struct HXlist_head *head)
{
return head->next == head;
}
#define HXlist_for_each(pos, head) \
for ((pos) = (head)->next; (pos) != (void *)(head); \
(pos) = (pos)->next)
#define HXlist_for_each_rev(pos, head) \
for ((pos) = (head)->prev; (pos) != (void *)(head); \
(pos) = (pos)->prev)
#define HXlist_for_each_safe(pos, n, head) \
for ((pos) = (head)->next, (n) = (pos)->next; (pos) != (void *)(head); \
(pos) = (n), (n) = (pos)->next)
#define HXlist_for_each_rev_safe(pos, n, head) \
for ((pos) = (head)->prev, (n) = (pos)->prev; (pos) != (void *)(head); \
(pos) = (n), (n) = (pos)->prev)
#define HXlist_for_each_entry(pos, head, member) \
for ((pos) = HXlist_entry((head)->next, __typeof__(*(pos)), member); \
&(pos)->member != (void *)(head); \
(pos) = HXlist_entry((pos)->member.next, __typeof__(*(pos)), member))
#define HXlist_for_each_entry_rev(pos, head, member) \
for ((pos) = HXlist_entry((head)->prev, __typeof__(*(pos)), member); \
&(pos)->member != (void *)(head); \
(pos) = HXlist_entry((pos)->member.prev, __typeof__(*(pos)), member))
#define HXlist_for_each_entry_safe(pos, n, head, member) \
for ((pos) = HXlist_entry((head)->next, __typeof__(*(pos)), member), \
(n) = HXlist_entry((pos)->member.next, __typeof__(*(pos)), member); \
&(pos)->member != (void *)(head); \
(pos) = (n), (n) = HXlist_entry((n)->member.next, __typeof__(*(n)), \
member))
struct HXclist_head {
union {
struct HXlist_head list;
struct {
struct HXlist_head *next, *prev;
};
};
unsigned int items;
};
#define HXCLIST_HEAD_INIT(name) {{{&(name).list, &(name).list}}, 0}
#define HXCLIST_HEAD(name) \
struct HXclist_head name = HXCLIST_HEAD_INIT(name)
static __inline__ void HXclist_init(struct HXclist_head *head)
{
head->list.next = head->list.prev = &head->list;
head->items = 0;
}
static __inline__ void
HXclist_del(struct HXclist_head *head, struct HXlist_head *node)
{
--head->items;
HXlist_del(node);
}
static __inline__ void
HXclist_unshift(struct HXclist_head *head, struct HXlist_head *nu)
{
++head->items;
__HXlist_add(nu, &head->list, head->list.next);
}
static __inline__ void
HXclist_push(struct HXclist_head *head, struct HXlist_head *nu)
{
++head->items;
__HXlist_add(nu, head->list.prev, &head->list);
}
static __inline__ struct HXlist_head *__HXclist_pop(struct HXclist_head *head)
{
struct HXlist_head *p;
if ((const void *)head == head->list.next)
return NULL;
p = head->list.prev;
HXlist_del(p);
--head->items;
return p;
}
#define HXclist_pop(head, type, member) \
HXlist_entry(__HXclist_pop(head), type, member)
static __inline__ struct HXlist_head *
__HXclist_shift(struct HXclist_head *head)
{
struct HXlist_head *p;
if ((const void *)head == head->list.next)
return NULL;
p = head->list.next;
HXlist_del(p);
--head->items;
return p;
}
#define HXclist_shift(head, type, member) \
HXlist_entry(__HXclist_shift(head), type, member)
#ifdef __cplusplus
} /* extern "C" */
#endif
#endif /* _LIBHX_LIST_H */
|