1214501Srpaulo/* 2214501Srpaulo * Doubly-linked list 3346981Scy * Copyright (c) 2009-2019, Jouni Malinen <j@w1.fi> 4214501Srpaulo * 5252726Srpaulo * This software may be distributed under the terms of the BSD license. 6252726Srpaulo * See README for more details. 7214501Srpaulo */ 8214501Srpaulo 9214501Srpaulo#ifndef LIST_H 10214501Srpaulo#define LIST_H 11214501Srpaulo 12214501Srpaulo/** 13214501Srpaulo * struct dl_list - Doubly-linked list 14214501Srpaulo */ 15214501Srpaulostruct dl_list { 16214501Srpaulo struct dl_list *next; 17214501Srpaulo struct dl_list *prev; 18214501Srpaulo}; 19214501Srpaulo 20281806Srpaulo#define DL_LIST_HEAD_INIT(l) { &(l), &(l) } 21281806Srpaulo 22214501Srpaulostatic inline void dl_list_init(struct dl_list *list) 23214501Srpaulo{ 24214501Srpaulo list->next = list; 25214501Srpaulo list->prev = list; 26214501Srpaulo} 27214501Srpaulo 28214501Srpaulostatic inline void dl_list_add(struct dl_list *list, struct dl_list *item) 29214501Srpaulo{ 30214501Srpaulo item->next = list->next; 31214501Srpaulo item->prev = list; 32214501Srpaulo list->next->prev = item; 33214501Srpaulo list->next = item; 34214501Srpaulo} 35214501Srpaulo 36214501Srpaulostatic inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item) 37214501Srpaulo{ 38214501Srpaulo dl_list_add(list->prev, item); 39214501Srpaulo} 40214501Srpaulo 41214501Srpaulostatic inline void dl_list_del(struct dl_list *item) 42214501Srpaulo{ 43214501Srpaulo item->next->prev = item->prev; 44214501Srpaulo item->prev->next = item->next; 45214501Srpaulo item->next = NULL; 46214501Srpaulo item->prev = NULL; 47214501Srpaulo} 48214501Srpaulo 49214501Srpaulostatic inline int dl_list_empty(struct dl_list *list) 50214501Srpaulo{ 51214501Srpaulo return list->next == list; 52214501Srpaulo} 53214501Srpaulo 54214501Srpaulostatic inline unsigned int dl_list_len(struct dl_list *list) 55214501Srpaulo{ 56214501Srpaulo struct dl_list *item; 57214501Srpaulo int count = 0; 58214501Srpaulo for (item = list->next; item != list; item = item->next) 59214501Srpaulo count++; 60214501Srpaulo return count; 61214501Srpaulo} 62214501Srpaulo 63214501Srpaulo#ifndef offsetof 64214501Srpaulo#define offsetof(type, member) ((long) &((type *) 0)->member) 65214501Srpaulo#endif 66214501Srpaulo 67214501Srpaulo#define dl_list_entry(item, type, member) \ 68214501Srpaulo ((type *) ((char *) item - offsetof(type, member))) 69214501Srpaulo 70214501Srpaulo#define dl_list_first(list, type, member) \ 71214501Srpaulo (dl_list_empty((list)) ? NULL : \ 72214501Srpaulo dl_list_entry((list)->next, type, member)) 73214501Srpaulo 74252726Srpaulo#define dl_list_last(list, type, member) \ 75252726Srpaulo (dl_list_empty((list)) ? NULL : \ 76252726Srpaulo dl_list_entry((list)->prev, type, member)) 77252726Srpaulo 78214501Srpaulo#define dl_list_for_each(item, list, type, member) \ 79346981Scy for (item = dl_list_first((list), type, member); \ 80346981Scy item && item != dl_list_entry((list), type, member); \ 81214501Srpaulo item = dl_list_entry(item->member.next, type, member)) 82214501Srpaulo 83214501Srpaulo#define dl_list_for_each_safe(item, n, list, type, member) \ 84214501Srpaulo for (item = dl_list_entry((list)->next, type, member), \ 85214501Srpaulo n = dl_list_entry(item->member.next, type, member); \ 86214501Srpaulo &item->member != (list); \ 87214501Srpaulo item = n, n = dl_list_entry(n->member.next, type, member)) 88214501Srpaulo 89252726Srpaulo#define dl_list_for_each_reverse(item, list, type, member) \ 90252726Srpaulo for (item = dl_list_entry((list)->prev, type, member); \ 91252726Srpaulo &item->member != (list); \ 92252726Srpaulo item = dl_list_entry(item->member.prev, type, member)) 93252726Srpaulo 94252726Srpaulo#define DEFINE_DL_LIST(name) \ 95252726Srpaulo struct dl_list name = { &(name), &(name) } 96252726Srpaulo 97214501Srpaulo#endif /* LIST_H */ 98