Lines Matching +refs:val +refs:resource
41 * latency big enough that any hardware resource can at least access any other
42 * hardware resource within that latency. A Uniform Memory Access (UMA)
559 lgrp_config(lgrp_config_flag_t event, uintptr_t resource, uintptr_t where)
573 cp = (cpu_t *)resource;
586 lgrp_plat_config(event, resource);
591 lgrp_plat_config(event, resource);
596 cp = (cpu_t *)resource;
603 lgrp_plat_config(event, resource);
608 cp = (cpu_t *)resource;
616 lgrp_plat_config(event, resource);
621 cp = (cpu_t *)resource;
622 lgrp_part_add_cpu((cpu_t *)resource, (lgrp_id_t)where);
627 lgrp_plat_config(event, resource);
631 cp = (cpu_t *)resource;
632 lgrp_part_del_cpu((cpu_t *)resource);
637 lgrp_plat_config(event, resource);
645 lgrp_mem_init((int)resource, where, B_FALSE);
650 lgrp_mem_fini((int)resource, where, B_FALSE);
658 lgrp_mem_rename((int)resource,
671 lgrp_topo_levels = (int)resource;
673 (void) lgrp_topo_flatten(resource,
681 lgrp_latency_change(LGRP_NULL_HANDLE, (u_longlong_t)resource,
690 lgrp_latency_change((lgrp_handle_t)resource, 0,
724 * This is the first time through if the resource set
726 * initially added to an lgroup, the root's CPU resource
796 * resource
1141 * from each lgroup in its lgroup memory resource set
1327 * Add new lgroup memory resource to existing lgroup
1359 * contain new memory node as a resource
1425 * contain leaf lgroup of memory as a memory resource
1676 lgrp_stat_add(lgrp_id_t lgrpid, lgrp_stat_t stat, int64_t val)
1688 atomic_add_64((uint64_t *)LGRP_STAT_WRITE_PTR(pstats, stat), val);
1694 uint64_t val;
1701 LGRP_STAT_READ(pstats, stat, val);
1702 return (val);
1831 * Add a resource named by lpl_leaf to rset of lpl_target
1834 * resource. It is adjusted here, as this is presently the only place that we
1835 * can be certain a resource addition has succeeded.
1913 * Delete resource lpl_leaf from rset of lpl_target, assuming it's there.
1916 * resource. The values are adjusted here, as this is the only place that we can
1917 * be certain a resource was successfully deleted.
1954 * Check to see if the resource set of the target lpl contains the
2392 * Insert a lpl into the resource hierarchy and create any additional lpls that
2397 * new leaf into both direct and indirect resource sets in the hierarchy. (Ie,
2399 * resource). The one special case that needs additional processing is when a
2401 * looking to add the leaf resource where it does not yet exist, additional work
2404 * only done when the check for more than one overlapping resource succeeds.
2495 * remaining resources, or no longer name a leaf resource in the cpu-partition,
2567 * cpus, and increment the ncpu count of all places where this cpu resource will
2640 * 1. Removal of the resource in the leaf leaves other resources remaining in
2646 * 2. Removal of the resource results in the lpl containing no resources. (It's
2649 * out any stranded lpls that do not directly name a leaf resource, and mark the
2828 * 4) Updates pointers in the resource list of the target to point to the lpls
2891 * Walk over resource set substituting pointers relative to
2919 * with lgrpid 0 and an empty resource set. Iteration over the rset