mariadb/newbrt/list.h

85 lines
2.3 KiB
C
Raw Normal View History

#ifndef _TOKUDB_LIST_H
#define _TOKUDB_LIST_H
#ident "Copyright (c) 2007, 2008 Tokutek Inc. All rights reserved."
//TODO: #1378 This is not threadsafe. Make sure when splitting locks
//that we protect these calls.
// This list is intended to be embedded in other data structures.
struct list {
struct list *next, *prev;
};
static inline void list_init(struct list *head) {
head->next = head->prev = head;
}
static inline int list_empty(struct list *head) {
return head->next == head;
}
static inline struct list *list_head(struct list *head) {
return head->next;
}
static inline struct list *list_tail(struct list *head) {
return head->prev;
}
static inline void list_insert_between(struct list *a, struct list *list, struct list *b) {
list->next = a->next;
list->prev = b->prev;
a->next = b->prev = list;
}
static inline void list_push(struct list *head, struct list *list) {
list_insert_between(head->prev, list, head);
}
static inline void list_push_head(struct list *head, struct list *list) {
list_insert_between(head, list, head->next);
}
static inline void list_remove(struct list *list) {
struct list *prev = list->prev;
struct list *next = list->next;
next->prev = prev;
prev->next = next;
list_init(list); // Set the list element to be empty
}
static inline struct list *list_pop(struct list *head) {
struct list *list = head->prev;
list_remove(list);
return list;
}
static inline struct list *list_pop_head(struct list *head) {
struct list *list = head->next;
list_remove(list);
return list;
}
static inline void list_move(struct list *newhead, struct list *oldhead) {
struct list *first = oldhead->next;
struct list *last = oldhead->prev;
// assert(!list_empty(oldhead));
newhead->next = first;
newhead->prev = last;
last->next = first->prev = newhead;
list_init(oldhead);
}
// Note: Need the extra level of parens in these macros so that
// list_struct(h, foo, b)->zot
// will work right. Otherwise the type cast will try to include ->zot, and it will be all messed up.
#if defined(__GNUC__) && __GNUC__ >= 4
#define list_struct(p, t, f) ((t*)((char*)(p) - __builtin_offsetof(t, f)))
#else
#define list_struct(p, t, f) ((t*)((char*)(p) - ((char*)&((t*)0)->f)))
#endif
#endif