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>
This commit is contained in:
Maximilian Brune
2023-09-16 19:56:45 +02:00
committed by Jakub Czapiga
parent 366ceeef0f
commit a99b580c75
13 changed files with 25 additions and 17 deletions

View File

@@ -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

View File

@@ -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>

View File

@@ -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;

View File

@@ -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);
}