From e81bd8de02a987063ef82077bb98bd20f7973bbf Mon Sep 17 00:00:00 2001 From: Julien Danjou Date: Fri, 7 Mar 2008 11:26:21 +0100 Subject: [PATCH] Add a #prefix_list_next() function to lists functions That may seem useless, but it's not. --- common/list.h | 225 ++++++++++++++++++++++++++------------------------ 1 file changed, 115 insertions(+), 110 deletions(-) diff --git a/common/list.h b/common/list.h index 157aeb372..724b41a9d 100644 --- a/common/list.h +++ b/common/list.h @@ -23,116 +23,121 @@ #ifndef AWESOME_COMMON_LIST_H #define AWESOME_COMMON_LIST_H -#define DO_SLIST(type, prefix, dtor) \ - static inline type *prefix##_list_pop(type **list) \ - { \ - if (*list) \ - { \ - type *res = *list; \ - *list = res->next; \ - res->next = NULL; \ - return res; \ - } \ - return NULL; \ - } \ - static inline void prefix##_list_push(type **list, type *item) \ - { \ - item->next = *list; \ - *list = item; \ - } \ - \ - static inline type **prefix##_list_last(type **list) \ - { \ - while (*list && (*list)->next) \ - list = &(*list)->next; \ - return list; \ - } \ - \ - static inline void prefix##_list_append(type **list, type *item) \ - { \ - if(*(list = prefix##_list_last(list))) \ - (*list)->next = item; \ - else \ - (*list) = item; \ - } \ - static inline type *prefix##_list_rev(type *list) \ - { \ - type *l = NULL; \ - while (list) \ - prefix##_list_push(&l, prefix##_list_pop(&list)); \ - return l; \ - } \ - \ - static inline type **prefix##_list_init(type **list) \ - { \ - *list = NULL; \ - return list; \ - } \ - static inline void prefix##_list_wipe(type **list) \ - { \ - while (*list) \ - { \ - type *item = prefix##_list_pop(list); \ - dtor(&item); \ - } \ - } \ - static inline type *prefix##_list_prev(type **list, type *item) \ - { \ - type *tmp; \ - if(*list == item) return NULL; \ - for(tmp = *list; tmp && tmp->next != item; tmp = tmp->next); \ - return tmp; \ - } \ - static inline void prefix##_list_swap(type **list, type *item1, \ - type *item2) \ - { \ - if(!item1 || !item2) return; \ - \ - type *i1n = item1->next; \ - type *i2n = item2->next; \ - type * i1p = prefix##_list_prev(list, item1); \ - type * i2p = prefix##_list_prev(list, item2); \ - item1->next = i2n == item1 ? item2 : i2n; \ - item2->next = i1n == item2 ? item1 : i1n; \ - \ - \ - if(i1p && i1p != item2) \ - i1p->next = item2; \ - if(i2p && i2p != item1) \ - i2p->next = item1; \ - \ - if(*list == item1) \ - *list = item2; \ - else if(*list == item2) \ - *list = item1; \ - } \ - static inline type *prefix##_list_prev_cycle(type **list, type *item) \ - { \ - type *tmp = prefix##_list_prev(list, item); \ - if(!tmp) \ - tmp = *prefix##_list_last(list); \ - return tmp; \ - } \ - static inline type *prefix##_list_next_cycle(type **list, type *item) \ - { \ - if(item) \ - { \ - if(item->next) \ - return item->next; \ - else \ - return *list; \ - } \ - return NULL; \ - } \ - static inline void prefix##_list_detach(type **list, type *item) \ - { \ - type *prev = prefix##_list_prev(list, item); \ - if(prev) \ - prev->next = item->next; \ - if(item == *list) \ - *list = item->next; \ - item->next = NULL; \ - } \ +#define DO_SLIST(type, prefix, dtor) \ + static inline type *prefix##_list_next(type **list __attribute__ ((unused)), \ + type *item) \ + { \ + return item->next; \ + } \ + static inline type *prefix##_list_pop(type **list) \ + { \ + if (*list) \ + { \ + type *res = *list; \ + *list = res->next; \ + res->next = NULL; \ + return res; \ + } \ + return NULL; \ + } \ + static inline void prefix##_list_push(type **list, type *item) \ + { \ + item->next = *list; \ + *list = item; \ + } \ + \ + static inline type **prefix##_list_last(type **list) \ + { \ + while (*list && (*list)->next) \ + list = &(*list)->next; \ + return list; \ + } \ + \ + static inline void prefix##_list_append(type **list, type *item) \ + { \ + if(*(list = prefix##_list_last(list))) \ + (*list)->next = item; \ + else \ + (*list) = item; \ + } \ + static inline type *prefix##_list_rev(type *list) \ + { \ + type *l = NULL; \ + while (list) \ + prefix##_list_push(&l, prefix##_list_pop(&list)); \ + return l; \ + } \ + \ + static inline type **prefix##_list_init(type **list) \ + { \ + *list = NULL; \ + return list; \ + } \ + static inline void prefix##_list_wipe(type **list) \ + { \ + while (*list) \ + { \ + type *item = prefix##_list_pop(list); \ + dtor(&item); \ + } \ + } \ + static inline type *prefix##_list_prev(type **list, type *item) \ + { \ + type *tmp; \ + if(*list == item) return NULL; \ + for(tmp = *list; tmp && tmp->next != item; tmp = tmp->next); \ + return tmp; \ + } \ + static inline void prefix##_list_swap(type **list, type *item1, \ + type *item2) \ + { \ + if(!item1 || !item2) return; \ + \ + type *i1n = item1->next; \ + type *i2n = item2->next; \ + type * i1p = prefix##_list_prev(list, item1); \ + type * i2p = prefix##_list_prev(list, item2); \ + item1->next = i2n == item1 ? item2 : i2n; \ + item2->next = i1n == item2 ? item1 : i1n; \ + \ + \ + if(i1p && i1p != item2) \ + i1p->next = item2; \ + if(i2p && i2p != item1) \ + i2p->next = item1; \ + \ + if(*list == item1) \ + *list = item2; \ + else if(*list == item2) \ + *list = item1; \ + } \ + static inline type *prefix##_list_prev_cycle(type **list, type *item) \ + { \ + type *tmp = prefix##_list_prev(list, item); \ + if(!tmp) \ + tmp = *prefix##_list_last(list); \ + return tmp; \ + } \ + static inline type *prefix##_list_next_cycle(type **list, type *item) \ + { \ + if(item) \ + { \ + if(item->next) \ + return item->next; \ + else \ + return *list; \ + } \ + return NULL; \ + } \ + static inline void prefix##_list_detach(type **list, type *item) \ + { \ + type *prev = prefix##_list_prev(list, item); \ + if(prev) \ + prev->next = item->next; \ + if(item == *list) \ + *list = item->next; \ + item->next = NULL; \ + } \ #endif // vim: filetype=c:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=80