mirror of
git://sourceware.org/git/lvm2.git
synced 2024-12-21 13:34:40 +03:00
73 lines
1.3 KiB
C
73 lines
1.3 KiB
C
/*
|
|
* Copyright (C) 2001 Sistina Software
|
|
*
|
|
* This file is released under the LGPL.
|
|
*/
|
|
|
|
#ifndef _LVM_LIST_H
|
|
#define _LVM_LIST_H
|
|
|
|
#include <assert.h>
|
|
|
|
struct list {
|
|
struct list *n, *p;
|
|
};
|
|
|
|
static inline void list_init(struct list *head) {
|
|
head->n = head->p = head;
|
|
}
|
|
|
|
static inline void list_add(struct list *head, struct list *elem) {
|
|
assert(head->n);
|
|
|
|
elem->n = head;
|
|
elem->p = head->p;
|
|
|
|
head->p->n = elem;
|
|
head->p = elem;
|
|
}
|
|
|
|
static inline void list_add_h(struct list *head, struct list *elem) {
|
|
assert(head->n);
|
|
|
|
elem->n = head->n;
|
|
elem->p = head;
|
|
|
|
head->n->p = elem;
|
|
head->n = elem;
|
|
}
|
|
|
|
static inline void list_del(struct list *elem) {
|
|
elem->n->p = elem->p;
|
|
elem->p->n = elem->n;
|
|
}
|
|
|
|
static inline int list_empty(struct list *head) {
|
|
return head->n == head;
|
|
}
|
|
|
|
#define list_iterate(v, head) \
|
|
for (v = (head)->n; v != head; v = v->n)
|
|
|
|
#define list_iterate_safe(v, t, head) \
|
|
for (v = (head)->n, t = v->n; v != head; v = t, t = v->n)
|
|
|
|
static inline int list_size(struct list *head) {
|
|
int s = 0;
|
|
struct list *v;
|
|
|
|
list_iterate(v, head)
|
|
s++;
|
|
|
|
return s;
|
|
}
|
|
|
|
#define list_item(v, t) \
|
|
((t *)((uintptr_t)(v) - (uintptr_t)&((t *) 0)->list))
|
|
|
|
/* Given a known element in a known structure, locate the struct list */
|
|
#define list_head(v, t, e) \
|
|
(((t *)((uintptr_t)(v) - (uintptr_t)&((t *) 0)->e))->list)
|
|
|
|
#endif
|