From 666c172d385823eefdfeb99ae3a4c20fd1b711f9 Mon Sep 17 00:00:00 2001 From: Patrick Rudolph Date: Tue, 3 Apr 2018 09:57:33 +0200 Subject: lib/devicetree: Integrate flattened devicetree support * Adapt to coreboot coding style. * Use coreboot's endian conversion functions. * Fix header and header guards. * Get rid of unused functions. * Add Kconfig to build it on ramstage. * Replace size32 with ALIGN_UP and DIV_ROUND_UP. * Add NULL pointer checks * Convert constants to defines Required for Cavium's BDK and uImage FIT support. Change-Id: I6e6cd9f78fb402bd54d684097326d26eb78d552a Signed-off-by: Patrick Rudolph Reviewed-on: https://review.coreboot.org/25523 Tested-by: build bot (Jenkins) Reviewed-by: Julius Werner --- src/lib/list.c | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'src/lib/list.c') diff --git a/src/lib/list.c b/src/lib/list.c index ea7eff44f7..06d422d30e 100644 --- a/src/lib/list.c +++ b/src/lib/list.c @@ -1,8 +1,8 @@ /* * Copyright 2012 Google Inc. + * Copyright 2018-present Facebook, Inc. * - * See file CREDITS for list of people who contributed to this - * project. + * Taken from depthcharge: src/base/list.c * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as @@ -15,9 +15,9 @@ * GNU General Public License for more details. */ -#include "base/list.h" +#include -void list_remove(ListNode *node) +void list_remove(struct list_node *node) { if (node->prev) node->prev->next = node->next; @@ -25,7 +25,7 @@ void list_remove(ListNode *node) node->next->prev = node->prev; } -void list_insert_after(ListNode *node, ListNode *after) +void list_insert_after(struct list_node *node, struct list_node *after) { node->next = after->next; node->prev = after; @@ -34,7 +34,7 @@ void list_insert_after(ListNode *node, ListNode *after) node->next->prev = node; } -void list_insert_before(ListNode *node, ListNode *before) +void list_insert_before(struct list_node *node, struct list_node *before) { node->prev = before->prev; node->next = before; -- cgit v1.2.3