Module: wine
Branch: master
Commit: 4dc61069a611af7bd14a107f5e19112f5f5b7bb6
URL: http://source.winehq.org/git/wine.git/?a=commit;h=4dc61069a611af7bd14a107f5…
Author: Alexandre Julliard <julliard(a)winehq.org>
Date: Mon Jan 22 12:16:17 2007 +0100
wine/list.h: Add list_count function. Make some parameters const.
---
include/wine/list.h | 19 ++++++++++++++-----
1 files changed, 14 insertions(+), 5 deletions(-)
diff --git a/include/wine/list.h b/include/wine/list.h
index a0b37cc..1b4f017 100644
--- a/include/wine/list.h
+++ b/include/wine/list.h
@@ -100,7 +100,7 @@ inline static void list_remove( struct l
}
/* get the next element */
-inline static struct list *list_next( struct list *list, struct list *elem )
+inline static struct list *list_next( const struct list *list, const struct list *elem )
{
struct list *ret = elem->next;
if (elem->next == list) ret = NULL;
@@ -108,7 +108,7 @@ inline static struct list *list_next( st
}
/* get the previous element */
-inline static struct list *list_prev( struct list *list, struct list *elem )
+inline static struct list *list_prev( const struct list *list, const struct list *elem )
{
struct list *ret = elem->prev;
if (elem->prev == list) ret = NULL;
@@ -116,19 +116,19 @@ inline static struct list *list_prev( st
}
/* get the first element */
-inline static struct list *list_head( struct list *list )
+inline static struct list *list_head( const struct list *list )
{
return list_next( list, list );
}
/* get the last element */
-inline static struct list *list_tail( struct list *list )
+inline static struct list *list_tail( const struct list *list )
{
return list_prev( list, list );
}
/* check if a list is empty */
-inline static int list_empty( struct list *list )
+inline static int list_empty( const struct list *list )
{
return list->next == list;
}
@@ -139,6 +139,15 @@ inline static void list_init( struct lis
list->next = list->prev = list;
}
+/* count the elements of a list */
+inline static unsigned int list_count( const struct list *list )
+{
+ unsigned count = 0;
+ const struct list *ptr;
+ for (ptr = list->next; ptr != list; ptr = ptr->next) count++;
+ return count;
+}
+
/* move all elements from src to the tail of dst */
inline static void list_move_tail( struct list *dst, struct list *src )
{