erebion/coreboot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

treewide: Move list.h to commonlib

Browse source 
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
commit a99b580c75
13 changed files with 25 additions and 17 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/include/device_tree.h
View file

@ -6,7 +6,7 @@
#include <stddef.h>
#include <stdint.h>
#include <list.h>
#include <commonlib/list.h>
/*
* Flattened device tree structures/constants.

6
src/include/fit.h
View file

@ -4,11 +4,11 @@
#ifndef __LIB_FIT_H__
#define __LIB_FIT_H__
#include <commonlib/list.h>
#include <device_tree.h>
#include <program_loading.h>
#include <stddef.h>
#include <stdint.h>
#include <device_tree.h>
#include <list.h>
#include <program_loading.h>
struct fit_image_node {
const char *name;

27
src/include/list.h
View file

@ -1,27 +0,0 @@
/* Taken from depthcharge: src/base/list.h */
/* SPDX-License-Identifier: GPL-2.0-or-later */
#ifndef __LIST_H__
#define __LIST_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 /* __LIST_H__ */