X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;f=lib%2Flist.c;h=e341d45bd432e5cfe1178260eba1c276629f9b1f;hb=28c5588e8e1a8d091c5d2275232c35f2968a97fa;hp=804a7e56adc10e452f008ffafed9ca2010931ce1;hpb=ebc56baa41db060b8783051e67b6fcbc148ebd60;p=sliver-openvswitch.git diff --git a/lib/list.c b/lib/list.c index 804a7e56a..e341d45bd 100644 --- a/lib/list.c +++ b/lib/list.c @@ -1,5 +1,5 @@ /* - * Copyright (c) 2008, 2009, 2010, 2011, 2012 Nicira, Inc. + * Copyright (c) 2008, 2009, 2010, 2011, 2012, 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. @@ -15,7 +15,6 @@ */ #include #include "list.h" -#include /* Initializes 'list' as an empty list. */ void @@ -47,8 +46,9 @@ list_insert(struct list *before, struct list *elem) void list_splice(struct list *before, struct list *first, struct list *last) { - if (first == last) + if (first == last) { return; + } last = last->prev; /* Cleanly remove 'first'...'last' from its current list. */ @@ -101,6 +101,20 @@ list_moved(struct list *list) list->prev->next = list->next->prev = list; } +/* Initializes 'dst' with the contents of 'src', compensating for moving it + * around in memory. The effect is that, if 'src' was the head of a list, now + * 'dst' is the head of a list containing the same elements. */ +void +list_move(struct list *dst, struct list *src) +{ + if (!list_is_empty(src)) { + *dst = *src; + list_moved(dst); + } else { + list_init(dst); + } +} + /* Removes 'elem' from its list and returns the element that followed it. Undefined behavior if 'elem' is not in a list. */ struct list * @@ -138,7 +152,7 @@ list_front(const struct list *list_) { struct list *list = CONST_CAST(struct list *, list_); - assert(!list_is_empty(list)); + ovs_assert(!list_is_empty(list)); return list->next; } @@ -149,7 +163,7 @@ list_back(const struct list *list_) { struct list *list = CONST_CAST(struct list *, list_); - assert(!list_is_empty(list)); + ovs_assert(!list_is_empty(list)); return list->prev; } @@ -161,8 +175,9 @@ list_size(const struct list *list) const struct list *e; size_t cnt = 0; - for (e = list->next; e != list; e = e->next) + for (e = list->next; e != list; e = e->next) { cnt++; + } return cnt; }