summaryrefslogtreecommitdiff
path: root/include/libfdt.h
diff options
context:
space:
mode:
authorSimon Glass <sjg@chromium.org>2015-06-23 15:38:26 -0600
committerSimon Glass <sjg@chromium.org>2015-07-21 17:39:20 -0600
commit8f6e2e1ee17bb1ecce03518b8eceda6965617477 (patch)
tree0c227e0e9daf32f4879f8a331e0a1062d80c0c2b /include/libfdt.h
parent5b9d44df2307fc882b2ae666fd28fb2c7c2d5b11 (diff)
downloadu-boot-imx-8f6e2e1ee17bb1ecce03518b8eceda6965617477.zip
u-boot-imx-8f6e2e1ee17bb1ecce03518b8eceda6965617477.tar.gz
u-boot-imx-8f6e2e1ee17bb1ecce03518b8eceda6965617477.tar.bz2
fdt: Add a function to remove unused strings from a device tree
Property names are stored in a string table. When a node property is removed, the string table is not updated since other nodes may have a property with the same name. Thus it is possible for the string table to build up a number of unused strings. Add a function to remove these. This works by building a new device tree from the old one, adding strings one by one as needed. Signed-off-by: Simon Glass <sjg@chromium.org>
Diffstat (limited to 'include/libfdt.h')
-rw-r--r--include/libfdt.h17
1 files changed, 17 insertions, 0 deletions
diff --git a/include/libfdt.h b/include/libfdt.h
index 421d64f..d0017d8 100644
--- a/include/libfdt.h
+++ b/include/libfdt.h
@@ -1646,6 +1646,23 @@ int fdt_del_node(void *fdt, int nodeoffset);
const char *fdt_strerror(int errval);
+/**
+ * fdt_remove_unused_strings() - Remove any unused strings from an FDT
+ *
+ * This creates a new device tree in @new with unused strings removed. The
+ * called can then use fdt_pack() to minimise the space consumed.
+ *
+ * @old: Old device tree blog
+ * @new: Place to put new device tree blob, which must be as large as
+ * @old
+ * @return
+ * 0, on success
+ * -FDT_ERR_BADOFFSET, corrupt device tree
+ * -FDT_ERR_NOSPACE, out of space, which should not happen unless there
+ * is something very wrong with the device tree input
+ */
+int fdt_remove_unused_strings(const void *old, void *new);
+
struct fdt_region {
int offset;
int size;