diff options
| author | Patrick Rudolph <patrick.rudolph@9elements.com> | 2018-04-03 09:57:33 +0200 |
|---|---|---|
| committer | Patrick Georgi <pgeorgi@google.com> | 2018-04-30 09:33:32 +0000 |
| commit | 666c172d385823eefdfeb99ae3a4c20fd1b711f9 (patch) | |
| tree | 8d21e2083f19171688181d20baea09a6b78b6bd8 /src/lib/list.c | |
| parent | 67aca3e7dc05f0f982a50c7e8edb91a03d573687 (diff) | |
| download | coreboot-666c172d385823eefdfeb99ae3a4c20fd1b711f9.tar.gz coreboot-666c172d385823eefdfeb99ae3a4c20fd1b711f9.tar.bz2 coreboot-666c172d385823eefdfeb99ae3a4c20fd1b711f9.zip | |
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 <patrick.rudolph@9elements.com>
Reviewed-on: https://review.coreboot.org/25523
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Julius Werner <jwerner@chromium.org>
Diffstat (limited to 'src/lib/list.c')
| -rw-r--r-- | src/lib/list.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/lib/list.c b/src/lib/list.c index ea7eff44f734..06d422d30eb5 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 <list.h> -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; |