Lines Matching defs:leaf
44 * machine is represented at least by the root lgroup and some number of leaf
45 * lgroups where the leaf lgroups contain the hardware resources within the
49 * leaf lgroups and the system latency of the root lgroup. Non-leaf lgroups
51 * its children lgroups. Thus, the lgroup hierarchy from a given leaf lgroup
53 * from the leaf lgroup such that each successive ancestor lgroup contains
141 * Configuring CPU0 may create a two-level topology with root and one leaf node
344 * Since the bootstrap toplogy has just the root, and a leaf,
345 * the rset contains just the leaf, and both lpls can use the same rset
774 * topology now that we know how far it is from other leaf
1310 * topology now that we know how far it is from other leaf
1425 * contain leaf lgroup of memory as a memory resource
1631 * Return the leaf lgroup containing the given CPU
1850 /* return if leaf is already present */
1862 /* insert leaf, update counts */
1923 lpl_t *leaf;
1928 /* find leaf in intermediate node */
1934 /* return if leaf not found */
1938 /* prune leaf, compress array */
1947 if ((leaf = lpl_target->lpl_rset[i]) != NULL) {
1948 lpl_target->lpl_id2rset[leaf->lpl_lgrpid] = i;
1955 * supplied leaf lpl. This returns 1 if the lpl is found, 0 if it is not.
1973 * per-cpu counter in every lpl in which our leaf appears.
1995 * Don't adjust if the lgrp isn't there, if we're the leaf lpl
1996 * for the cpu in question, or if the current lgrp and leaf
2166 /* only leaf lgroups keep a cpucnt, only check leaves */
2169 /* verify that lgrp is also a leaf */
2197 /* check to make sure cpu's lpl is leaf lpl */
2217 * Also, check that leaf lpl is contained in all
2218 * intermediate lpls that name the leaf as a descendant
2250 } else { /* non-leaf specific checks */
2253 * Non-leaf lpls should have lpl_cpus == NULL
2262 * verify that the sum of the cpus in the leaf resources
2319 * and home the leaf lpls to the root lpl.
2363 * this is a leaf whose parent was deleted, or
2397 * new leaf into both direct and indirect resource sets in the hierarchy. (Ie,
2398 * those for which the lpl is a leaf as opposed to simply a named equally local
2401 * looking to add the leaf resource where it does not yet exist, additional work
2402 * is necessary to add other leaf resources that may need to exist in the newly
2423 * Don't insert if the lgrp isn't there, if the leaf isn't
2447 * Almost all leaf state was initialized elsewhere. The
2495 * remaining resources, or no longer name a leaf resource in the cpu-partition,
2512 * don't contain our leaf, or from the leaf itself. (We do that
2530 * leaf we've deleted. Any lpls that pass the above checks
2536 * leaf resources, even though we don't yet have a processor
2572 * not exist yet. In this case, it is necessary to build the leaf lpl, and
2574 * resources, if they should exist. The leaf structure is initialized by this
2598 /* only leaf lpls contain cpus */
2621 * We increment ncpu immediately after we create a new leaf
2640 * 1. Removal of the resource in the leaf leaves other resources remaining in
2641 * that leaf. (Another cpu still exists at this level of locality). In this
2649 * out any stranded lpls that do not directly name a leaf resource, and mark the
2669 /* don't delete a leaf that isn't there */
2997 * Choose a suitable leaf lgroup for a kthread. The kthread is assumed not to
3092 * Skip any non-leaf lgroups
3151 * the thread on one of the other leaf lgroups in the thread's
3738 * Return a random leaf lgroup with memory