X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;f=lib%2Flist.h;h=0da082e51ba467823ababbce60303a39b381b23b;hb=28c5588e8e1a8d091c5d2275232c35f2968a97fa;hp=845aab20b4917cbc6abce6e655c2f6491e1841bb;hpb=02dd3123a0e312f1d33403e744af52dd6096f12d;p=sliver-openvswitch.git diff --git a/lib/list.h b/lib/list.h index 845aab20b..0da082e51 100644 --- a/lib/list.h +++ b/lib/list.h @@ -1,5 +1,5 @@ /* - * Copyright (c) 2008, 2009, 2010 Nicira Networks. + * Copyright (c) 2008, 2009, 2010, 2011, 2013 Nicira, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -31,6 +31,7 @@ struct list { #define LIST_INITIALIZER(LIST) { LIST, LIST } void list_init(struct list *); +void list_poison(struct list *); /* List insertion. */ void list_insert(struct list *, struct list *); @@ -39,6 +40,7 @@ void list_push_front(struct list *, struct list *); void list_push_back(struct list *, struct list *); void list_replace(struct list *, const struct list *); void list_moved(struct list *); +void list_move(struct list *dst, struct list *src); /* List removal. */ struct list *list_remove(struct list *); @@ -46,25 +48,36 @@ struct list *list_pop_front(struct list *); struct list *list_pop_back(struct list *); /* List elements. */ -struct list *list_front(struct list *); -struct list *list_back(struct list *); +struct list *list_front(const struct list *); +struct list *list_back(const struct list *); /* List properties. */ size_t list_size(const struct list *); bool list_is_empty(const struct list *); +bool list_is_singleton(const struct list *); +bool list_is_short(const struct list *); -#define LIST_FOR_EACH(ITER, STRUCT, MEMBER, LIST) \ - for (ITER = CONTAINER_OF((LIST)->next, STRUCT, MEMBER); \ - &(ITER)->MEMBER != (LIST); \ - ITER = CONTAINER_OF((ITER)->MEMBER.next, STRUCT, MEMBER)) -#define LIST_FOR_EACH_REVERSE(ITER, STRUCT, MEMBER, LIST) \ - for (ITER = CONTAINER_OF((LIST)->prev, STRUCT, MEMBER); \ - &(ITER)->MEMBER != (LIST); \ - ITER = CONTAINER_OF((ITER)->MEMBER.prev, STRUCT, MEMBER)) -#define LIST_FOR_EACH_SAFE(ITER, NEXT, STRUCT, MEMBER, LIST) \ - for (ITER = CONTAINER_OF((LIST)->next, STRUCT, MEMBER); \ - (NEXT = CONTAINER_OF((ITER)->MEMBER.next, STRUCT, MEMBER), \ - &(ITER)->MEMBER != (LIST)); \ - ITER = NEXT) +#define LIST_FOR_EACH(ITER, MEMBER, LIST) \ + for (ASSIGN_CONTAINER(ITER, (LIST)->next, MEMBER); \ + &(ITER)->MEMBER != (LIST); \ + ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.next, MEMBER)) +#define LIST_FOR_EACH_CONTINUE(ITER, MEMBER, LIST) \ + for (ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.next, MEMBER); \ + &(ITER)->MEMBER != (LIST); \ + ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.next, MEMBER)) +#define LIST_FOR_EACH_REVERSE(ITER, MEMBER, LIST) \ + for (ASSIGN_CONTAINER(ITER, (LIST)->prev, MEMBER); \ + &(ITER)->MEMBER != (LIST); \ + ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.prev, MEMBER)) +#define LIST_FOR_EACH_REVERSE_CONTINUE(ITER, MEMBER, LIST) \ + for (ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.prev, MEMBER); \ + &(ITER)->MEMBER != (LIST); \ + ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.prev, MEMBER)) +#define LIST_FOR_EACH_SAFE(ITER, NEXT, MEMBER, LIST) \ + for (ASSIGN_CONTAINER(ITER, (LIST)->next, MEMBER); \ + (&(ITER)->MEMBER != (LIST) \ + ? ASSIGN_CONTAINER(NEXT, (ITER)->MEMBER.next, MEMBER), 1 \ + : 0); \ + (ITER) = (NEXT)) #endif /* list.h */