Lines Matching defs:parent
71 * parent, child and sibling hierarchy relationships.
73 * each PG can have at most one parent, and siblings are the group of PGs
74 * sharing the same parent.
321 * Promote PG above it's current parent.
323 * parent.
333 pg_cmt_t *parent;
344 parent = pg->cmt_parent;
345 if (parent == NULL) {
352 ASSERT(PG_NUM_CPUS((pg_t *)pg) >= PG_NUM_CPUS((pg_t *)parent));
361 * If necessary, update the parent's sibling set, replacing parent
364 if (parent->cmt_siblings) {
365 if (group_remove(parent->cmt_siblings, parent, GRP_NORESIZE)
367 r = group_add(parent->cmt_siblings, pg, GRP_NORESIZE);
373 * If the parent is at the top of the hierarchy, replace it's entry
376 if (parent->cmt_parent == NULL &&
377 parent->cmt_siblings != &cmt_root->cl_pgs) {
378 if (group_remove(&cmt_root->cl_pgs, parent, GRP_NORESIZE)
387 * only child of it's parent. Update the parent's children set
388 * replacing PG's entry with the parent (since the parent is becoming
389 * the child). Then have PG and the parent swap children sets and
392 ASSERT(GROUP_SIZE(parent->cmt_children) <= 1);
393 if (group_remove(parent->cmt_children, pg, GRP_NORESIZE) != -1) {
394 r = group_add(parent->cmt_children, parent, GRP_NORESIZE);
399 pg->cmt_children = parent->cmt_children;
400 parent->cmt_children = children;
403 pg->cmt_nchildren = parent->cmt_nchildren;
404 parent->cmt_nchildren = nchildren;
407 * Update the sibling references for PG and it's parent
409 pg->cmt_siblings = parent->cmt_siblings;
410 parent->cmt_siblings = pg->cmt_children;
433 * of the PG being promoted, since they have a new parent.
438 cpu_pg->cmt_parent = parent;
456 ASSERT(GROUP_ACCESS(&pgd->cmt_pgs, idx - 1) == parent);
459 * Have the child and the parent swap places in the CPU's
464 err = group_add_at(&pgd->cmt_pgs, parent, idx);
479 * Update the parent references for PG and it's parent
481 pg->cmt_parent = parent->cmt_parent;
482 parent->cmt_parent = pg;
652 * For existing PGs in the lineage, verify that the parent is
682 * it to it's parent and siblings.
716 * A good parent keeps track of their children.
717 * The parent's children group is also the PG's
1285 * will dominate. So promote the power domain above it's parent if both
1286 * PG and it's parent have the same CPUs to ensure it's policy
1292 * If the power domain is an only child to a parent
1294 * above the parent to activate the policy.
1586 * Move PG's children from it's children set to it's parent's
1587 * children set. Note that the parent's children set, and PG's
1592 * children to the parent's children set, and once we are done
1644 * parent and siblings set.
1700 * a PG must be subset of its parent (if it has one).
1744 pg_cmt_t *pg, *pg_next, *pg_bad, *pg_tmp, *parent;
1782 * need to check whether the PG's existing parent (if any) is
1786 * parent (and other ancestors not in the same lineage) and
1792 parent = pg->cmt_parent;
1793 while (parent != NULL) {
1795 * Determine if the parent/ancestor is in this lineage
1798 for (j = 0; (j < size) && (pg_tmp != parent); j++) {
1801 if (pg_tmp == parent) {
1816 if (PG_NUM_CPUS((pg_t *)parent) >=
1819 * Not a proper subset if the parent/ancestor
1825 parent = parent->cmt_parent;
1923 * not found in the parent, and it is an untrusted enumeration,