1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
#include <common.h>
#include <environment.h>
#include <fdt.h>
#include <of.h>
#include <command.h>
#include <fs.h>
#include <malloc.h>
#include <linux/ctype.h>
#include <asm/byteorder.h>
#include <errno.h>
#include <getopt.h>
#include <init.h>
#include <boot.h>
#define MAX_LEVEL 32 /* how deeply nested we will go */
static int is_printable_string(const void *data, int len)
{
const char *s = data;
/* zero length is not */
if (len == 0)
return 0;
/* must terminate with zero */
if (s[len - 1] != '\0')
return 0;
/* printable or a null byte (concatenated strings) */
while (((*s == '\0') || isprint(*s)) && (len > 0)) {
/*
* If we see a null, there are three possibilities:
* 1) If len == 1, it is the end of the string, printable
* 2) Next character also a null, not printable.
* 3) Next character not a null, continue to check.
*/
if (s[0] == '\0') {
if (len == 1)
return 1;
if (s[1] == '\0')
return 0;
}
s++;
len--;
}
/* Not the null termination, or not done yet: not printable */
if (*s != '\0' || (len != 0))
return 0;
return 1;
}
/*
* Print the property in the best format, a heuristic guess. Print as
* a string, concatenated strings, a byte, word, double word, or (if all
* else fails) it is printed as a stream of bytes.
*/
void of_print_property(const void *data, int len)
{
int j;
/* no data, don't print */
if (len == 0)
return;
/*
* It is a string, but it may have multiple strings (embedded '\0's).
*/
if (is_printable_string(data, len)) {
puts("\"");
j = 0;
while (j < len) {
if (j > 0)
puts("\", \"");
puts(data);
j += strlen(data) + 1;
data += strlen(data) + 1;
}
puts("\"");
return;
}
if ((len % 4) == 0) {
const u32 *p;
printf("<");
for (j = 0, p = data; j < len/4; j ++)
printf("0x%x%s", fdt32_to_cpu(p[j]), j < (len/4 - 1) ? " " : "");
printf(">");
} else { /* anything else... hexdump */
const u8 *s;
printf("[");
for (j = 0, s = data; j < len; j++)
printf("%02x%s", s[j], j < len - 1 ? " " : "");
printf("]");
}
}
void of_print_cmdline(struct device_node *root)
{
struct device_node *node = of_find_node_by_path_from(root, "/chosen");
const char *cmdline;
if (!node) {
printf("commandline: no /chosen node\n");
return;
}
cmdline = of_get_property(node, "bootargs", NULL);
printf("commandline: %s\n", cmdline);
}
static int of_fixup_bootargs(struct device_node *root, void *unused)
{
struct device_node *node;
const char *str;
int err;
str = linux_bootargs_get();
if (!str)
return 0;
node = of_create_node(root, "/chosen");
if (!node)
return -ENOMEM;
err = of_set_property(node, "bootargs", str, strlen(str) + 1, 1);
return err;
}
static int of_register_bootargs_fixup(void)
{
return of_register_fixup(of_fixup_bootargs, NULL);
}
late_initcall(of_register_bootargs_fixup);
struct of_fixup {
int (*fixup)(struct device_node *, void *);
void *context;
struct list_head list;
};
static LIST_HEAD(of_fixup_list);
int of_register_fixup(int (*fixup)(struct device_node *, void *), void *context)
{
struct of_fixup *of_fixup = xzalloc(sizeof(*of_fixup));
of_fixup->fixup = fixup;
of_fixup->context = context;
list_add_tail(&of_fixup->list, &of_fixup_list);
return 0;
}
/*
* Apply registered fixups for the given fdt. The fdt must have
* enough free space to apply the fixups.
*/
int of_fix_tree(struct device_node *node)
{
struct of_fixup *of_fixup;
int ret;
list_for_each_entry(of_fixup, &of_fixup_list, list) {
ret = of_fixup->fixup(node, of_fixup->context);
if (ret)
return ret;
}
return 0;
}
/*
* Get the fixed fdt. This function uses the fdt input pointer
* if provided or the barebox internal devicetree if not.
* It increases the size of the tree and applies the registered
* fixups.
*/
struct fdt_header *of_get_fixed_tree(struct device_node *node)
{
int ret;
struct fdt_header *fdt;
if (!node) {
node = of_get_root_node();
if (!node)
return NULL;
}
ret = of_fix_tree(node);
if (ret)
return NULL;
fdt = of_flatten_dtb(node);
if (!fdt)
return NULL;
return fdt;
}
|
