Lines Matching refs:power
9 populate a tree that describes the hierarchy of power domains in the
13 It would be much simpler for the platform to describe its power domain tree
16 #. The generic PSCI code generates MPIDRs in order to populate the power domain
20 levels in the power domain tree to four.
23 mechanism used to populate the power domain topology tree.
25 #. The current arrangement of the power domain tree requires a binary search
26 over the sibling nodes at a particular level to find a specified power
27 domain node. During a power management operation, the tree is traversed from
28 a 'start' to an 'end' power level. The binary search is required to find the
36 #. The attributes of a core power domain differ from the attributes of power
37 domains at higher levels. For example, only a core power domain can be identified
39 performing a power management operation on the core power domain.
50 Describing a power domain tree
57 #. The first entry in the array specifies the number of power domains at the
58 highest power level implemented in the platform. This caters for platforms
59 where the power domain tree does not have a single root node, for example,
60 the FVP has two cluster power domains at the highest level (1).
62 #. Each subsequent entry corresponds to a power domain and contains the number
63 of power domains that are its direct children.
66 non-leaf power domains.
73 The following example power domain topology tree will be used to describe the
126 power domain. MPIDRs could be allocated in any manner and will not be used to
151 core power domains, for example, Juno and FVPs, the logic to convert an MPIDR to
158 used by the platform is not equal to the number of core power domains.
164 maintaining the relationship described earlier. This means that the power
165 domain tree descriptor will not describe any core power domains which are
170 in the power domain descriptor, that is, the number of core nodes described
175 Traversing through and distinguishing between core and non-core power domains
179 to represent leaf and non-leaf power domain nodes in the tree.
184 * The following two data structures implement the power domain tree. The tree
185 * is used to track the state of all the nodes i.e. power domain instances
186 * described by the platform. The tree consists of nodes that describe CPU power
187 * domains i.e. leaf nodes and all other power domains which are parents of a
188 * CPU power domain i.e. non-leaf nodes.
192 * Index of the first CPU power domain node level 0 which has this node
198 * Number of CPU power domains which are siblings of the domain indexed
204 /* Index of the parent power domain node */
213 /* Index of the parent power domain node */
219 The power domain tree is implemented as a combination of the following data
227 Populating the power domain tree
231 algorithm to parse the power domain descriptor exported by the platform to
241 For the example power domain tree illustrated above, the ``psci_cpu_pd_nodes``
299 the MPIDR before using it to find the corresponding core node. The non-core power