Lines Matching defs:leaf
464 * or leaf lgroup, or this isn't a target lgroup
488 * lgroup or leaf (which shouldn't have dups), or this
601 * Proprogate resources of new leaf into parent lgroup of given child
624 * Don't proprogate new leaf resources to parent if it already
638 * Add leaf resources to parent lgroup
668 * Split parent lgroup of given child if child's leaf decendant (oldleaf) has
669 * different latency to new leaf lgroup (newleaf) than leaf lgroups of given
706 * Get latency between new leaf and old leaf whose lineage it is
714 * latency to new leaf
724 * Skip non-existent lgroups, old leaf, and any lgroups that
748 * make new parent for old leaf with same latency and same
824 * Add resources of new leaf to old leaf's lineage
829 * - New leaf lgroup has been created and does not need to have its resources
831 * - Latencies have been set for root and leaf lgroups
864 * where the new leaf fits in the old leaf's lineage
870 * Determine height of lgroup topology from old leaf to root lgroup,
882 * Can't add new leaf to old leaf's lineage if we haven't
894 * Lineage of old leaf is basically a sorted list of the other leaves
895 * from closest to farthest, so find where to add new leaf to the
915 * than one leaf, but all its leaves don't have latency to new
916 * leaf within the parent lgroup's latency
936 * Already found where resources of new leaf belong in old
937 * leaf's lineage, so proprogate resources of new leaf up
960 * As we work our way from the old leaf to the root lgroup,
961 * new leaf resources should go in between two lgroups or into
968 * New leaf resources should go in between current
996 * Don't proprogate new leaf resources
1024 * leaf + child resources since new leaf is
1067 * New leaf resources should go into parent
1121 * Add leaf lgroup to lgroup topology
1124 lgrp_leaf_add(lgrp_t *leaf, lgrp_t **lgrps, int lgrp_count,
1138 (void *)leaf, leaf->lgrp_id, (void *)lgrps, lgrp_count,
1147 * Initialize parent of leaf lgroup to root
1149 if (leaf->lgrp_parent == NULL) {
1150 leaf->lgrp_parent = lgrp_root;
1152 klgrpset_add(lgrp_root->lgrp_children, leaf->lgrp_id);
1154 klgrpset_or(lgrp_root->lgrp_leaves, leaf->lgrp_leaves);
1155 lgrp_rsets_add(leaf->lgrp_set, lgrp_root->lgrp_set);
1165 klgrpset_add(*changed, leaf->lgrp_id);
1171 * Can't add leaf lgroup to rest of topology (and vice versa) unless
1174 latency = lgrp_plat_latency(leaf->lgrp_plathand, leaf->lgrp_plathand);
1185 * Make sure that root and leaf lgroup latencies are set
1189 leaf->lgrp_latency = latency;
1192 * Add leaf to lineage of other leaves and vice versa
1201 * Skip non-existent lgroups, new leaf lgroup, and
1202 * non-leaf lgroups
1204 if (!LGRP_EXISTS(lgrp) || lgrp == leaf ||
1219 leaf->lgrp_id, (void *)leaf, lgrp->lgrp_id,
1223 count += lgrp_lineage_add(leaf, lgrp, &changes);
1227 count += lgrp_lineage_add(lgrp, leaf, &changes);
1243 * Remove resources of leaf from lgroup hierarchy
1246 lgrp_leaf_delete(lgrp_t *leaf, lgrp_t **lgrps, int lgrp_count,
1264 * Nothing to do if no leaf given
1266 if (leaf == NULL)
1272 (void *)leaf, leaf->lgrp_id, (void *)lgrps, lgrp_count,
1277 * Remove leaf from any lgroups containing its resources
1282 !lgrp_rsets_member(lgrp->lgrp_set, leaf->lgrp_id))
1287 prom_printf("lgrp_leaf_delete: remove leaf from"
1291 lgrp_rsets_delete(lgrp, leaf->lgrp_id, 0);
1292 klgrpset_del(lgrp->lgrp_leaves, leaf->lgrp_id);
1299 * Remove leaf and its ancestors that don't have any other children
1303 prom_printf("lgrp_leaf_delete: remove leaf and ancestors\n");
1306 count += lgrp_ancestor_delete(leaf, &changes);
1308 klgrpset_add(collapse, leaf->lgrp_id);
1310 lgrp_destroy(leaf);
1355 * Look for non-leaf lgroups to remove and leaf lgroups to reparent
1377 * Remove non-leaf lgroup from lgroup topology
1393 * Reparent leaf lgroup to root
1472 * resources. The root lgrp should also name itself as its own leaf
1486 * Look for any leaf lgroup without its latency set, finish adding it
1495 * Skip non-existent and non-leaf lgroups and any lgroup