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