[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20221114112842.38565-1-andriy.shevchenko@linux.intel.com>
Date: Mon, 14 Nov 2022 13:28:39 +0200
From: Andy Shevchenko <andriy.shevchenko@...ux.intel.com>
To: Jakob Koschel <jakobkoschel@...il.com>,
Andy Shevchenko <andriy.shevchenko@...ux.intel.com>,
Greg Kroah-Hartman <gregkh@...uxfoundation.org>,
Mathias Nyman <mathias.nyman@...ux.intel.com>,
linux-usb@...r.kernel.org, linux-kernel@...r.kernel.org
Cc: Kevin Cernekee <cernekee@...il.com>,
Mathias Nyman <mathias.nyman@...el.com>,
Andrew Morton <akpm@...ux-foundation.org>
Subject: [PATCH v1 1/4] list: Introduce list_count() to count existing nodes
Some of the existing users, and definitely will be new ones, want to
count existing nodes in the list. Provide a generic API for that.
Signed-off-by: Andy Shevchenko <andriy.shevchenko@...ux.intel.com>
---
include/linux/list.h | 13 +++++++++++++
1 file changed, 13 insertions(+)
diff --git a/include/linux/list.h b/include/linux/list.h
index 61762054b4be..098eccf8c1b6 100644
--- a/include/linux/list.h
+++ b/include/linux/list.h
@@ -655,6 +655,19 @@ static inline void list_splice_tail_init(struct list_head *list,
!list_is_head(pos, (head)); \
pos = n, n = pos->prev)
+/**
+ * list_count - count nodes in the list
+ * @head: the head for your list.
+ */
+#define list_count(head) \
+({ \
+ struct list_head *__tmp; \
+ size_t __i = 0; \
+ list_for_each(__tmp, head) \
+ __i++; \
+ __i; \
+})
+
/**
* list_entry_is_head - test if the entry points to the head of the list
* @pos: the type * to cursor
--
2.35.1
Powered by blists - more mailing lists