X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=lib%2Flist.h;h=8ffa797dbc12889e216042aa7fd74680caaa05f7;hb=a359d5ad700c7175c75134cce3cee8d87d19d67c;hp=0481477ae0934a4f32c6302e6282a25137f94811;hpb=4e8e4213a815a30216e855a805a8bcd5b8c5a886;p=openvswitch diff --git a/lib/list.h b/lib/list.h index 0481477a..8ffa797d 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 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 *); @@ -46,25 +47,28 @@ 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, MEMBER, LIST) \ - for (ITER = OBJECT_CONTAINING((LIST)->next, ITER, MEMBER); \ + for (ASSIGN_CONTAINER(ITER, (LIST)->next, MEMBER); \ &(ITER)->MEMBER != (LIST); \ - ITER = OBJECT_CONTAINING((ITER)->MEMBER.next, ITER, MEMBER)) + ASSIGN_CONTAINER(ITER, (ITER)->MEMBER.next, MEMBER)) #define LIST_FOR_EACH_REVERSE(ITER, MEMBER, LIST) \ - for (ITER = OBJECT_CONTAINING((LIST)->prev, ITER, MEMBER); \ + for (ASSIGN_CONTAINER(ITER, (LIST)->prev, MEMBER); \ &(ITER)->MEMBER != (LIST); \ - ITER = OBJECT_CONTAINING((ITER)->MEMBER.prev, ITER, MEMBER)) -#define LIST_FOR_EACH_SAFE(ITER, NEXT, MEMBER, LIST) \ - for (ITER = OBJECT_CONTAINING((LIST)->next, ITER, MEMBER); \ - (NEXT = OBJECT_CONTAINING((ITER)->MEMBER.next, ITER, MEMBER), \ - &(ITER)->MEMBER != (LIST)); \ - ITER = NEXT) + 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) \ + : 0); \ + (ITER) = (NEXT)) #endif /* list.h */