treewide: Move list.h to commonlib

It is needed in order to move device_tree.c into commonlib in a
subsequent commit.

Signed-off-by: Maximilian Brune <maximilian.brune@9elements.com>
Change-Id: I16eb7b743fb1d36301f0eda563a62364e7a9cfec
Reviewed-on: https://review.coreboot.org/c/coreboot/+/77968
Reviewed-by: Julius Werner <jwerner@chromium.org>
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>

src/commonlib/Makefile.mk

@@ -53,6 +53,8 @@ romstage-y += bsd/lz4_wrapper.c
 ramstage-y += bsd/lz4_wrapper.c
 postcar-y += bsd/lz4_wrapper.c
 
+all-y += list.c
+
 ramstage-y += sort.c
 
 romstage-y += bsd/elog.c

src/commonlib/include/commonlib/list.h

@@ -0,0 +1,29 @@
+/* Taken from depthcharge: src/base/list.h */
+/* SPDX-License-Identifier: GPL-2.0-or-later */
+
+#ifndef __COMMONLIB_LIST_H__
+#define __COMMONLIB_LIST_H__
+
+#include <commonlib/helpers.h>
+
+struct list_node {
+	struct list_node *next;
+	struct list_node *prev;
+};
+
+// Remove list_node node from the doubly linked list it's a part of.
+void list_remove(struct list_node *node);
+// Insert list_node node after list_node after in a doubly linked list.
+void list_insert_after(struct list_node *node, struct list_node *after);
+// Insert list_node node before list_node before in a doubly linked list.
+void list_insert_before(struct list_node *node, struct list_node *before);
+// Appends the node to the end of the list.
+void list_append(struct list_node *node, struct list_node *head);
+
+#define list_for_each(ptr, head, member)                                      \
+	for ((ptr) = container_of((head).next, typeof(*(ptr)), member);       \
+		(uintptr_t)ptr + (uintptr_t)offsetof(typeof(*(ptr)), member); \
+		(ptr) = container_of((ptr)->member.next,                      \
+			typeof(*(ptr)), member))
+
+#endif /* __COMMONLIB_LIST_H__ */

src/commonlib/list.c

@@ -0,0 +1,38 @@
+/* Taken from depthcharge: src/base/list.c */
+/* SPDX-License-Identifier: GPL-2.0-or-later */
+
+#include <commonlib/list.h>
+
+void list_remove(struct list_node *node)
+{
+	if (node->prev)
+		node->prev->next = node->next;
+	if (node->next)
+		node->next->prev = node->prev;
+}
+
+void list_insert_after(struct list_node *node, struct list_node *after)
+{
+	node->next = after->next;
+	node->prev = after;
+	after->next = node;
+	if (node->next)
+		node->next->prev = node;
+}
+
+void list_insert_before(struct list_node *node, struct list_node *before)
+{
+	node->prev = before->prev;
+	node->next = before;
+	before->prev = node;
+	if (node->prev)
+		node->prev->next = node;
+}
+
+void list_append(struct list_node *node, struct list_node *head)
+{
+	while (head->next)
+		head = head->next;
+
+	list_insert_after(node, head);
+}