[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20241028034949.95322-3-ole0811sch@gmail.com>
Date: Mon, 28 Oct 2024 04:49:40 +0100
From: Ole Schuerks <ole0811sch@...il.com>
To: linux-kbuild@...r.kernel.org
Cc: ole0811sch@...il.com,
jude.gyimah@....de,
thorsten.berger@....de,
deltaone@...ian.org,
jan.sollmann@....de,
mcgrof@...nel.org,
masahiroy@...nel.org,
linux-kernel@...r.kernel.org,
nathan@...nel.org,
nicolas@...sle.eu
Subject: [PATCH v6 02/11] kbuild: Add list_size, list_at_index, list_for_each_from
list_size counts the number of entries. list_at_index retrieves the
entry at an index. list_for_each_from iterates over a list from some
entry to the end.
Signed-off-by: Ole Schuerks <ole0811sch@...il.com>
---
scripts/include/list.h | 49 ++++++++++++++++++++++++++++++++++++++++++
1 file changed, 49 insertions(+)
diff --git a/scripts/include/list.h b/scripts/include/list.h
index 8bdcaadca709..0c50774606c2 100644
--- a/scripts/include/list.h
+++ b/scripts/include/list.h
@@ -219,6 +219,21 @@ static inline int list_empty(const struct list_head *head)
return head->next == head;
}
+/**
+ * list_size - counts the number of entries in a list
+ * @head: the list whose entries are counted
+ */
+static inline size_t list_size(const struct list_head *head)
+{
+ size_t ret = 0;
+
+ for (struct list_head *curr = head->next; curr != head;
+ curr = curr->next)
+ ++ret;
+
+ return ret;
+}
+
/**
* list_entry - get the struct for this entry
* @ptr: the &struct list_head pointer.
@@ -310,6 +325,40 @@ static inline int list_empty(const struct list_head *head)
!list_entry_is_head(pos, head, member); \
pos = n, n = list_next_entry(n, member))
+/**
+ * list_for_each_entry_from - iterate over list of given type starting at a given node
+ * @pos: the type * to use as a loop cursor.
+ * @start: the node to start iterating at
+ * @head: the head for your list.
+ * @member: the name of the list_head within the struct.
+ */
+#define list_for_each_entry_from(pos, start, head, member) \
+ for (pos = list_entry(start, typeof(*pos), member); \
+ !list_entry_is_head(pos, head, member); \
+ pos = list_next_entry(pos, member))
+
+/**
+ * list_at_index - retrieve the entry at index i in O(n)
+ * @i: index of entry to retrieve.
+ * @head: the head for your list.
+ * @type: the type of the struct the entries are embedded in.
+ * @member: the name of the list_head within the struct.
+ */
+#define list_at_index(i, head, type, member) \
+ ({ \
+ type *__pos; \
+ size_t __counter = 0; \
+ list_for_each_entry(__pos, head, member) { \
+ if (__counter++ == i) \
+ break; \
+ if (__pos->member.next == head) { \
+ __pos = NULL; \
+ break; \
+ } \
+ } \
+ __pos; \
+ })
+
/*
* Double linked lists with a single pointer list head.
* Mostly useful for hash tables where the two pointer list head is
--
2.39.5
Powered by blists - more mailing lists