3 # Copyright (C) 2016 Google, Inc
4 # Written by Simon Glass <sjg@chromium.org>
6 # SPDX-License-Identifier: GPL-2.0+
15 # This deals with a device tree, presenting it as an assortment of Node and
16 # Prop objects, representing nodes and properties, respectively. This file
17 # contains the base classes and defines the high-level API. You can use
18 # FdtScan() as a convenience function to create and scan an Fdt.
20 # This implementation uses a libfdt Python library to access the device tree,
21 # so it is fairly efficient.
23 # A list of types we support
24 (TYPE_BYTE, TYPE_INT, TYPE_STRING, TYPE_BOOL, TYPE_INT64) = range(5)
26 def CheckErr(errnum, msg):
28 raise ValueError('Error %d: %s: %s' %
29 (errnum, libfdt.fdt_strerror(errnum), msg))
32 """A device tree property
35 name: Property name (as per the device tree)
36 value: Property value as a string of bytes, or a list of strings of
40 def __init__(self, node, offset, name, bytes):
45 self.bytes = str(bytes)
50 self.type, self.value = self.BytesToValue(bytes)
53 """Get a (single) phandle value from a property
55 Gets the phandle valuie from a property and returns it as an integer
57 return fdt_util.fdt32_to_cpu(self.value[:4])
59 def Widen(self, newprop):
60 """Figure out which property type is more general
62 Given a current property and a new property, this function returns the
63 one that is less specific as to type. The less specific property will
64 be ble to represent the data in the more specific property. This is
76 He we want to use an int array for 'value'. The first property
77 suggests that a single int is enough, but the second one shows that
78 it is not. Calling this function with these two propertes would
79 update the current property to be like the second, since it is less
82 if newprop.type < self.type:
83 self.type = newprop.type
85 if type(newprop.value) == list and type(self.value) != list:
86 self.value = [self.value]
88 if type(self.value) == list and len(newprop.value) > len(self.value):
89 val = self.GetEmpty(self.type)
90 while len(self.value) < len(newprop.value):
91 self.value.append(val)
93 def BytesToValue(self, bytes):
94 """Converts a string of bytes into a type and value
97 A string containing bytes
102 Data, either a single element or a list of elements. Each element
104 TYPE_STRING: string value from the property
105 TYPE_INT: a byte-swapped integer stored as a 4-byte string
106 TYPE_BYTE: a byte stored as a single-byte string
110 strings = bytes.split('\0')
112 count = len(strings) - 1
113 if count > 0 and not strings[-1]:
114 for string in strings[:-1]:
119 if ch < ' ' or ch > '~':
126 return TYPE_STRING, strings[0]
128 return TYPE_STRING, strings[:-1]
131 return TYPE_BYTE, bytes[0]
133 return TYPE_BYTE, list(bytes)
135 for i in range(0, size, 4):
136 val.append(bytes[i:i + 4])
138 return TYPE_INT, val[0]
142 def GetEmpty(self, type):
143 """Get an empty / zero value of the given type
146 A single value of the given type
148 if type == TYPE_BYTE:
150 elif type == TYPE_INT:
151 return struct.pack('<I', 0);
152 elif type == TYPE_STRING:
158 """Get the offset of a property
161 The offset of the property (struct fdt_property) within the file
163 return self._node._fdt.GetStructOffset(self._offset)
166 """A device tree node
169 offset: Integer offset in the device tree
170 name: Device tree node tname
171 path: Full path to node, along with the node name itself
172 _fdt: Device tree object
173 subnodes: A list of subnodes for this node, each a Node object
174 props: A dict of properties for this node, each a Prop object.
175 Keyed by property name
177 def __init__(self, fdt, parent, offset, name, path):
180 self._offset = offset
186 def _FindNode(self, name):
187 """Find a node given its name
190 name: Node name to look for
192 Node object if found, else None
194 for subnode in self.subnodes:
195 if subnode.name == name:
200 """Returns the offset of a node, after checking the cache
202 This should be used instead of self._offset directly, to ensure that
203 the cache does not contain invalid offsets.
205 self._fdt.CheckCache()
209 """Scan a node's properties and subnodes
211 This fills in the props and subnodes properties, recursively
212 searching into subnodes so that the entire tree is built.
214 self.props = self._fdt.GetProps(self)
216 offset = libfdt.fdt_first_subnode(self._fdt.GetFdt(), self.Offset())
218 sep = '' if self.path[-1] == '/' else '/'
219 name = self._fdt._fdt_obj.get_name(offset)
220 path = self.path + sep + name
221 node = Node(self._fdt, self, offset, name, path)
222 self.subnodes.append(node)
225 offset = libfdt.fdt_next_subnode(self._fdt.GetFdt(), offset)
227 def Refresh(self, my_offset):
228 """Fix up the _offset for each node, recursively
230 Note: This does not take account of property offsets - these will not
233 if self._offset != my_offset:
234 #print '%s: %d -> %d\n' % (self.path, self._offset, my_offset)
235 self._offset = my_offset
236 offset = libfdt.fdt_first_subnode(self._fdt.GetFdt(), self._offset)
237 for subnode in self.subnodes:
238 subnode.Refresh(offset)
239 offset = libfdt.fdt_next_subnode(self._fdt.GetFdt(), offset)
241 def DeleteProp(self, prop_name):
242 """Delete a property of a node
244 The property is deleted and the offset cache is invalidated.
247 prop_name: Name of the property to delete
249 ValueError if the property does not exist
251 CheckErr(libfdt.fdt_delprop(self._fdt.GetFdt(), self.Offset(), prop_name),
252 "Node '%s': delete property: '%s'" % (self.path, prop_name))
253 del self.props[prop_name]
254 self._fdt.Invalidate()
257 """Provides simple access to a flat device tree blob using libfdts.
260 fname: Filename of fdt
261 _root: Root of device tree (a Node object)
263 def __init__(self, fname):
265 self._cached_offsets = False
267 self._fname = fdt_util.EnsureCompiled(self._fname)
269 with open(self._fname) as fd:
270 self._fdt = bytearray(fd.read())
271 self._fdt_obj = libfdt.Fdt(self._fdt)
273 def Scan(self, root='/'):
274 """Scan a device tree, building up a tree of Node objects
276 This fills in the self._root property
281 TODO(sjg@chromium.org): Implement the 'root' parameter
283 self._root = self.Node(self, None, 0, '/', '/')
287 """Get the root Node of the device tree
294 def GetNode(self, path):
295 """Look up a node from its path
298 path: Path to look up, e.g. '/microcode/update@0'
300 Node object, or None if not found
303 for part in path.split('/')[1:]:
304 node = node._FindNode(part)
310 """Flush device tree changes back to the file
312 If the device tree has changed in memory, write it back to the file.
314 with open(self._fname, 'wb') as fd:
318 """Pack the device tree down to its minimum size
320 When nodes and properties shrink or are deleted, wasted space can
321 build up in the device tree binary.
323 CheckErr(libfdt.fdt_pack(self._fdt), 'pack')
324 fdt_len = libfdt.fdt_totalsize(self._fdt)
325 del self._fdt[fdt_len:]
328 """Get the contents of the FDT
331 The FDT contents as a string of bytes
335 def CheckErr(errnum, msg):
337 raise ValueError('Error %d: %s: %s' %
338 (errnum, libfdt.fdt_strerror(errnum), msg))
341 def GetProps(self, node):
342 """Get all properties from a node.
345 node: Full path to node name to look in.
348 A dictionary containing all the properties, indexed by node name.
349 The entries are Prop objects.
352 ValueError: if the node does not exist.
355 poffset = libfdt.fdt_first_property_offset(self._fdt, node._offset)
357 p = self._fdt_obj.get_property_by_offset(poffset)
358 prop = Prop(node, poffset, p.name, p.value)
359 props_dict[prop.name] = prop
361 poffset = libfdt.fdt_next_property_offset(self._fdt, poffset)
364 def Invalidate(self):
365 """Mark our offset cache as invalid"""
366 self._cached_offsets = False
368 def CheckCache(self):
369 """Refresh the offset cache if needed"""
370 if self._cached_offsets:
373 self._cached_offsets = True
376 """Refresh the offset cache"""
377 self._root.Refresh(0)
379 def GetStructOffset(self, offset):
380 """Get the file offset of a given struct offset
383 offset: Offset within the 'struct' region of the device tree
385 Position of @offset within the device tree binary
387 return libfdt.fdt_off_dt_struct(self._fdt) + offset
390 def Node(self, fdt, parent, offset, name, path):
393 This is used by Fdt.Scan() to create a new node using the correct
398 parent: Parent node, or None if this is the root node
399 offset: Offset of node
401 path: Full path to node
403 node = Node(fdt, parent, offset, name, path)
407 """Returns a new Fdt object from the implementation we are using"""