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) 2007 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 static int notequal; /* = 0 */
20 static int ignore_memrsv; /* = 0 */
21
22 #define MISMATCH(fmt, ...) \
23 do { \
24 if (notequal) \
25 PASS(); \
26 else \
27 FAIL(fmt, ##__VA_ARGS__); \
28 } while (0)
29
30 #define MATCH() \
31 do { \
32 if (!notequal) \
33 PASS(); \
34 else \
35 FAIL("Trees match which shouldn't"); \
36 } while (0)
37
38 #define CHECK(code) \
39 { \
40 err = (code); \
41 if (err) \
42 FAIL(#code ": %s", fdt_strerror(err)); \
43 }
44
mem_rsv_cmp(const void * p1,const void * p2)45 static int mem_rsv_cmp(const void *p1, const void *p2)
46 {
47 const struct fdt_reserve_entry *re1 = p1;
48 const struct fdt_reserve_entry *re2 = p2;
49
50 if (fdt64_to_cpu(re1->address) < fdt64_to_cpu(re2->address))
51 return -1;
52 else if (fdt64_to_cpu(re1->address) > fdt64_to_cpu(re2->address))
53 return 1;
54
55 if (fdt64_to_cpu(re1->size) < fdt64_to_cpu(re2->size))
56 return -1;
57 else if (fdt64_to_cpu(re1->size) > fdt64_to_cpu(re2->size))
58 return 1;
59
60 return 0;
61 }
62
compare_mem_rsv(void * fdt1,void * fdt2)63 static void compare_mem_rsv(void *fdt1, void *fdt2)
64 {
65 int i;
66 uint64_t addr1, size1, addr2, size2;
67 int err;
68
69 if (fdt_num_mem_rsv(fdt1) != fdt_num_mem_rsv(fdt2))
70 MISMATCH("Trees have different number of reserve entries");
71
72 qsort((char *)fdt1 + fdt_off_mem_rsvmap(fdt1), fdt_num_mem_rsv(fdt1),
73 sizeof(struct fdt_reserve_entry), mem_rsv_cmp);
74 qsort((char *)fdt2 + fdt_off_mem_rsvmap(fdt2), fdt_num_mem_rsv(fdt2),
75 sizeof(struct fdt_reserve_entry), mem_rsv_cmp);
76
77 for (i = 0; i < fdt_num_mem_rsv(fdt1); i++) {
78 CHECK(fdt_get_mem_rsv(fdt1, i, &addr1, &size1));
79 CHECK(fdt_get_mem_rsv(fdt2, i, &addr2, &size2));
80
81 if ((addr1 != addr2) || (size1 != size2))
82 MISMATCH("Mismatch in reserve entry %d: "
83 "(0x%llx, 0x%llx) != (0x%llx, 0x%llx)", i,
84 (unsigned long long)addr1,
85 (unsigned long long)size1,
86 (unsigned long long)addr2,
87 (unsigned long long)size2);
88 }
89 }
90
compare_properties(const void * fdt1,int offset1,const void * fdt2,int offset2)91 static void compare_properties(const void *fdt1, int offset1,
92 const void *fdt2, int offset2)
93 {
94 int offset = offset1;
95
96 /* Check the properties */
97 for (offset = fdt_first_property_offset(fdt1, offset1);
98 offset >= 0;
99 offset = fdt_next_property_offset(fdt1, offset)) {
100 const char *name;
101 int len1, len2;
102 const void *data1, *data2;
103 int i;
104
105 data1 = fdt_getprop_by_offset(fdt1, offset, &name, &len1);
106 if (!data1)
107 FAIL("fdt_getprop_by_offset(): %s\n",
108 fdt_strerror(len1));
109
110 verbose_printf("Property '%s'\n", name);
111
112 data2 = fdt_getprop(fdt2, offset2, name, &len2);
113 if (!data2) {
114 if (len2 == -FDT_ERR_NOTFOUND)
115 MISMATCH("Property '%s' missing\n", name);
116 else
117 FAIL("fdt_get_property(): %s\n",
118 fdt_strerror(len2));
119 }
120
121 verbose_printf("len1=%d data1=", len1);
122 for (i = 0; i < len1; i++)
123 verbose_printf(" %02x", ((const char *)data1)[i]);
124 verbose_printf("\nlen2=%d data2=", len2);
125 for (i = 0; i < len1; i++)
126 verbose_printf(" %02x", ((const char *)data2)[i]);
127 verbose_printf("\n");
128
129 if (len1 != len2)
130 MISMATCH("Property '%s' mismatched length %d vs. %d\n",
131 name, len1, len2);
132 else if (memcmp(data1, data2, len1) != 0)
133 MISMATCH("Property '%s' mismatched value\n", name);
134 }
135 }
136
137 static void compare_node(const void *fdt1, int offset1,
138 const void *fdt2, int offset2);
139
compare_subnodes(const void * fdt1,int offset1,const void * fdt2,int offset2,int recurse)140 static void compare_subnodes(const void *fdt1, int offset1,
141 const void *fdt2, int offset2,
142 int recurse)
143 {
144 int coffset1, coffset2, depth;
145
146 for (depth = 0, coffset1 = offset1;
147 (coffset1 >= 0) && (depth >= 0);
148 coffset1 = fdt_next_node(fdt1, coffset1, &depth))
149 if (depth == 1) {
150 const char *name = fdt_get_name(fdt1, coffset1, NULL);
151
152 verbose_printf("Subnode %s\n", name);
153 coffset2 = fdt_subnode_offset(fdt2, offset2, name);
154 if (coffset2 == -FDT_ERR_NOTFOUND)
155 MISMATCH("Subnode %s missing\n", name);
156 else if (coffset2 < 0)
157 FAIL("fdt_subnode_offset(): %s\n",
158 fdt_strerror(coffset2));
159
160 if (recurse)
161 compare_node(fdt1, coffset1, fdt2, coffset2);
162 }
163 }
164
compare_node(const void * fdt1,int offset1,const void * fdt2,int offset2)165 static void compare_node(const void *fdt1, int offset1,
166 const void *fdt2, int offset2)
167 {
168 int err;
169 char path1[PATH_MAX], path2[PATH_MAX];
170
171 CHECK(fdt_get_path(fdt1, offset1, path1, sizeof(path1)));
172 CHECK(fdt_get_path(fdt2, offset2, path2, sizeof(path2)));
173
174 if (!streq(path1, path2))
175 TEST_BUG("Path mismatch %s vs. %s\n", path1, path2);
176
177 verbose_printf("Checking %s\n", path1);
178
179 compare_properties(fdt1, offset1, fdt2, offset2);
180 compare_properties(fdt2, offset2, fdt1, offset1);
181
182 compare_subnodes(fdt1, offset1, fdt2, offset2, 1);
183 compare_subnodes(fdt2, offset2, fdt1, offset1, 0);
184 }
185
badargs(char ** argv)186 static void badargs(char **argv)
187 {
188 CONFIG("Usage: %s [-n] [-m] <dtb file> <dtb file>", argv[0]);
189 }
190
main(int argc,char * argv[])191 int main(int argc, char *argv[])
192 {
193 void *fdt1, *fdt2;
194 uint32_t cpuid1, cpuid2;
195 char **args;
196 int argsleft;
197
198 test_init(argc, argv);
199
200 args = &argv[1];
201 argsleft = argc - 1;
202
203 while (argsleft > 2) {
204 if (streq(args[0], "-n"))
205 notequal = 1;
206 else if (streq(args[0], "-m"))
207 ignore_memrsv = 1;
208 else
209 badargs(argv);
210 args++;
211 argsleft--;
212 }
213 if (argsleft != 2)
214 badargs(argv);
215
216 fdt1 = load_blob(args[0]);
217 fdt2 = load_blob(args[1]);
218
219 if (!ignore_memrsv)
220 compare_mem_rsv(fdt1, fdt2);
221 compare_node(fdt1, 0, fdt2, 0);
222
223 cpuid1 = fdt_boot_cpuid_phys(fdt1);
224 cpuid2 = fdt_boot_cpuid_phys(fdt2);
225 if (cpuid1 != cpuid2)
226 MISMATCH("boot_cpuid_phys mismatch 0x%x != 0x%x",
227 cpuid1, cpuid2);
228
229 MATCH();
230 }
231