summaryrefslogtreecommitdiffstats
path: root/src/lib
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib')
-rw-r--r--src/lib/Makefile.mk2
-rw-r--r--src/lib/cbfs.c2
-rw-r--r--src/lib/edid_fill_fb.c2
-rw-r--r--src/lib/list.c38
4 files changed, 2 insertions, 42 deletions
diff --git a/src/lib/Makefile.mk b/src/lib/Makefile.mk
index 2a95be9d10ba..fe24156dad1b 100644
--- a/src/lib/Makefile.mk
+++ b/src/lib/Makefile.mk
@@ -28,8 +28,6 @@ CFLAGS_ramstage += $(CFLAGS_asan)
$(obj)/ramstage/lib/asan.o: CFLAGS_asan =
endif
-all-y += list.c
-
decompressor-y += decompressor.c
$(call src-to-obj,decompressor,$(dir)/decompressor.c): $(objcbfs)/bootblock.lz4
$(call src-to-obj,decompressor,$(dir)/decompressor.c): CCACHE_EXTRAFILES=$(objcbfs)/bootblock.lz4
diff --git a/src/lib/cbfs.c b/src/lib/cbfs.c
index 92a00e44186e..03624bf2d7bd 100644
--- a/src/lib/cbfs.c
+++ b/src/lib/cbfs.c
@@ -6,10 +6,10 @@
#include <cbmem.h>
#include <commonlib/bsd/cbfs_private.h>
#include <commonlib/bsd/compression.h>
+#include <commonlib/list.h>
#include <console/console.h>
#include <fmap.h>
#include <lib.h>
-#include <list.h>
#include <metadata_hash.h>
#include <security/tpm/tspi/crtm.h>
#include <security/vboot/vboot_common.h>
diff --git a/src/lib/edid_fill_fb.c b/src/lib/edid_fill_fb.c
index 1df37e80726b..e4fb08c3fdac 100644
--- a/src/lib/edid_fill_fb.c
+++ b/src/lib/edid_fill_fb.c
@@ -6,7 +6,7 @@
#include <framebuffer_info.h>
#include <string.h>
#include <stdlib.h>
-#include <list.h>
+#include <commonlib/list.h>
struct fb_info {
struct list_node node;
diff --git a/src/lib/list.c b/src/lib/list.c
deleted file mode 100644
index c3f8ee42c86e..000000000000
--- a/src/lib/list.c
+++ /dev/null
@@ -1,38 +0,0 @@
-/* Taken from depthcharge: src/base/list.c */
-/* SPDX-License-Identifier: GPL-2.0-or-later */
-
-#include <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);
-}