Lines Matching defs:old
199 * latency and shift its old resources to its parent and its parent's resources
552 lgrp_t *old;
568 old = child->lgrp_parent;
569 new->lgrp_parent = old;
576 if (old) {
577 klgrpset_del(old->lgrp_children, child->lgrp_id);
578 klgrpset_add(old->lgrp_children, new->lgrp_id);
580 klgrpset_add(*changed, old->lgrp_id);
706 * Get latency between new leaf and old leaf whose lineage it is
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
828 * including old and new ones given below
863 * Get latency between old and new leaves, so we can determine
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
936 * Already found where resources of new leaf belong in old
960 * As we work our way from the old leaf to the root lgroup,
1016 lgrp_rsets_print("old parent"