1 /* $NetBSD: dtb_reverse.c,v 1.1.1.3 2019/12/22 12:34:06 skrll Exp $ */
2
3 // SPDX-License-Identifier: LGPL-2.1-or-later
4 /*
5 * libfdt - Flat Device Tree manipulation
6 * Tests if two given dtbs are structurally equal (including order)
7 * Copyright (C) 2010 David Gibson, IBM Corporation.
8 */
9
10 #include <stdlib.h>
11 #include <stdio.h>
12 #include <string.h>
13 #include <stdint.h>
14 #include <limits.h>
15
16 #include <libfdt.h>
17
18 #include "tests.h"
19 #include "testdata.h"
20
21 #define CHECK(code) \
22 { \
23 err = (code); \
24 if (err) \
25 FAIL(#code ": %s", fdt_strerror(err)); \
26 }
27
reverse_reservemap(void * in,void * out,int n)28 static void reverse_reservemap(void *in, void *out, int n)
29 {
30 int err;
31 uint64_t addr, size;
32
33 verbose_printf("reverse_reservemap(): %d/%d\n",
34 n, fdt_num_mem_rsv(in));
35
36 if (n < (fdt_num_mem_rsv(in)-1))
37 reverse_reservemap(in, out, n+1);
38
39 CHECK(fdt_get_mem_rsv(in, n, &addr, &size));
40 CHECK(fdt_add_reservemap_entry(out, addr, size));
41 verbose_printf("Added entry 0x%llx 0x%llx\n",
42 (unsigned long long)addr, (unsigned long long)size);
43 }
44
reverse_properties(void * in,void * out,int offset)45 static void reverse_properties(void *in, void *out, int offset)
46 {
47 int err;
48 int len;
49 const char *name;
50 const void *data;
51
52 data = fdt_getprop_by_offset(in, offset, &name, &len);
53 if (!data)
54 FAIL("fdt_getprop_by_offset(): %s\n", fdt_strerror(len));
55
56 verbose_printf("reverse_properties(): offset=%d name=%s\n",
57 offset, name);
58
59 offset = fdt_next_property_offset(in, offset);
60 if (offset >= 0)
61 reverse_properties(in, out, offset);
62 else if (offset != -FDT_ERR_NOTFOUND)
63 FAIL("fdt_next_property_offset(): %s\n", fdt_strerror(offset));
64
65 CHECK(fdt_property(out, name, data, len));
66 verbose_printf(" -> output property %s\n", name);
67 }
68
69 static void reverse_node(void *in, void *out, int nodeoffset);
70
reverse_children(void * in,void * out,int offset)71 static void reverse_children(void *in, void *out, int offset)
72 {
73 int err;
74 int nextoffset = offset;
75 int depth = 1;
76
77 do {
78 char path[PATH_MAX];
79
80 CHECK(fdt_get_path(in, nextoffset, path, sizeof(path)));
81 verbose_printf("reverse_children() offset=%d nextoffset=%d [%s]"
82 " depth=%d\n", offset, nextoffset, path, depth);
83
84 nextoffset = fdt_next_node(in, nextoffset, &depth);
85 } while ((depth >= 0) && (depth != 1));
86
87 if (depth == 1)
88 reverse_children(in, out, nextoffset);
89
90 reverse_node(in, out, offset);
91 }
92
reverse_node(void * in,void * out,int nodeoffset)93 static void reverse_node(void *in, void *out, int nodeoffset)
94 {
95 const char *name = fdt_get_name(in, nodeoffset, NULL);
96 char path[PATH_MAX];
97 int err;
98 int offset;
99 int depth = 0;
100
101 CHECK(fdt_get_path(in, nodeoffset, path, sizeof(path)));
102 verbose_printf("reverse_node(): nodeoffset=%d [%s]\n",
103 nodeoffset, path);
104
105 CHECK(fdt_begin_node(out, name));
106
107 offset = fdt_first_property_offset(in, nodeoffset);
108 if (offset >= 0)
109 reverse_properties(in, out, offset);
110 else if (offset != -FDT_ERR_NOTFOUND)
111 FAIL("fdt_first_property(): %s\n", fdt_strerror(offset));
112
113 offset = fdt_next_node(in, nodeoffset, &depth);
114
115 if (depth == 1)
116 reverse_children(in, out, offset);
117
118 CHECK(fdt_end_node(out));
119 }
120
main(int argc,char * argv[])121 int main(int argc, char *argv[])
122 {
123 void *in, *out;
124 char outname[PATH_MAX];
125 int bufsize;
126 int err;
127
128 test_init(argc, argv);
129 if (argc != 2)
130 CONFIG("Usage: %s <dtb file>", argv[0]);
131
132 in = load_blob(argv[1]);
133 sprintf(outname, "%s.reversed.test.dtb", argv[1]);
134
135 bufsize = fdt_totalsize(in);
136 out = xmalloc(bufsize);
137
138 CHECK(fdt_create(out, bufsize));
139
140 fdt_set_boot_cpuid_phys(out, fdt_boot_cpuid_phys(in));
141
142 reverse_reservemap(in, out, 0);
143 CHECK(fdt_finish_reservemap(out));
144
145 reverse_node(in, out, 0);
146
147 CHECK(fdt_finish(out));
148
149 save_blob(outname, out);
150
151 PASS();
152 }
153