diff options
author | Patrick Rudolph <patrick.rudolph@9elements.com> | 2018-04-12 11:44:43 +0200 |
---|---|---|
committer | Patrick Georgi <pgeorgi@google.com> | 2018-04-30 09:33:21 +0000 |
commit | 67aca3e7dc05f0f982a50c7e8edb91a03d573687 (patch) | |
tree | e86142946741ad048fb614cb2e03f5e5d80be631 /src/lib/list.c | |
parent | 4c81d4464f73f2d188e3d79a6a2ec6af6c256551 (diff) | |
download | coreboot-67aca3e7dc05f0f982a50c7e8edb91a03d573687.tar.xz |
lib: Raw import FDT devicetree from depthcharge
Import from https://chromium.googlesource.com/chromiumos/platform/depthcharge
Required for general devicetree patching and FIT support.
Coding style and coreboot integration will be done in a separate commit.
Change-Id: Ida75d4786eae38d84bfc71bf53573dafca8eda40
Signed-off-by: Patrick Rudolph <patrick.rudolph@9elements.com>
Reviewed-on: https://review.coreboot.org/25632
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 | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/src/lib/list.c b/src/lib/list.c new file mode 100644 index 0000000000..ea7eff44f7 --- /dev/null +++ b/src/lib/list.c @@ -0,0 +1,44 @@ +/* + * Copyright 2012 Google Inc. + * + * See file CREDITS for list of people who contributed to this + * project. + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License as + * published by the Free Software Foundation; either version 2 of + * the License, or (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but without any warranty; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "base/list.h" + +void list_remove(ListNode *node) +{ + if (node->prev) + node->prev->next = node->next; + if (node->next) + node->next->prev = node->prev; +} + +void list_insert_after(ListNode *node, ListNode *after) +{ + node->next = after->next; + node->prev = after; + after->next = node; + if (node->next) + node->next->prev = node; +} + +void list_insert_before(ListNode *node, ListNode *before) +{ + node->prev = before->prev; + node->next = before; + before->prev = node; + if (node->prev) + node->prev->next = node; +} |