Lines Matching refs:parent

12  * parent node is a virtual description of the aggregation of the
105 struct dtpm *parent = dtpm->parent;
107 while (parent) {
108 parent->power_min -= dtpm->power_min;
109 parent->power_max -= dtpm->power_max;
110 parent->power_limit -= dtpm->power_limit;
111 parent = parent->parent;
117 struct dtpm *parent = dtpm->parent;
119 while (parent) {
120 parent->power_min += dtpm->power_min;
121 parent->power_max += dtpm->power_max;
122 parent->power_limit += dtpm->power_limit;
123 parent = parent->parent;
172 struct dtpm *parent = dtpm->parent;
177 if (parent)
347 * @parent: a pointer to a dtpm structure corresponding to the parent node
349 * Create a dtpm node in the tree. If no parent is specified, the node
360 * -EINVAL: * there is no root node yet and @parent is specified
362 * * parent have ops which are reserved for leaves
365 int dtpm_register(const char *name, struct dtpm *dtpm, struct dtpm *parent)
372 if (root && !parent)
375 if (!root && parent)
378 if (parent && parent->ops)
391 parent ? &parent->zone : NULL,
397 if (parent) {
398 list_add_tail(&dtpm->sibling, &parent->children);
399 dtpm->parent = parent;
416 struct dtpm *parent)
426 ret = dtpm_register(hierarchy->name, dtpm, parent);
438 struct dtpm *parent)
454 ret = dtpm_subsys[i]->setup(parent, np);
479 const struct dtpm_node *it, struct dtpm *parent)
486 if (hierarchy[i].parent != it)
489 dtpm = dtpm_node_callback[hierarchy[i].type](&hierarchy[i], parent);
535 * [1] { .name = "package", .type = DTPM_NODE_VIRTUAL, .parent = &hierarchy[0] },
536 * [2] { .name = "/cpus/cpu0", .type = DTPM_NODE_DT, .parent = &hierarchy[1] },
537 * [3] { .name = "/cpus/cpu1", .type = DTPM_NODE_DT, .parent = &hierarchy[1] },
538 * [4] { .name = "/cpus/cpu2", .type = DTPM_NODE_DT, .parent = &hierarchy[1] },
539 * [5] { .name = "/cpus/cpu3", .type = DTPM_NODE_DT, .parent = &hierarchy[1] },