Lines Matching full:proximity

66  * CPUs and memory are local to a given proximity domain (NUMA node).  The SLIT
68 * a NUMA node and should correspond to proximity domains in the SRAT). For
100 * - lgrp_plat_node_domain[] Node ID to proximity domain ID mapping
112 * Moreover, it allows for the proximity domain ID to be equal to all of the
113 * above as long as the proximity domains IDs are numbered from 0 to <number of
114 * nodes - 1>. This is done by hashing each proximity domain ID into the range
115 * from 0 to <number of nodes - 1>. Then proximity ID N will hash into node ID
116 * N and proximity domain ID N will be entered into lgrp_plat_node_domain[N]
117 * and be assigned node ID N. If the proximity domain IDs aren't numbered
118 * from 0 to <number of nodes - 1>, then hashing the proximity domain IDs into
119 * lgrp_plat_node_domain[] will still work for assigning proximity domain IDs
120 * to node IDs. However, the proximity domain IDs may not map to the
211 * Hash proximity domain ID into node to domain mapping table "mod" number of
213 * proximity domain be node 0
262 * Node to proximity domain ID mapping structure (only used with SRAT)
304 * Node ID to proximity domain ID mapping table (only used for SRAT)
324 * Lowest proximity domain ID seen in ACPI SRAT
357 * Enable finding and using minimum proximity domain ID when hashing
830 /* Update node to proximity domain mapping */ in lgrp_plat_config()
1352 * Update CPU to node mapping for given CPU and proximity domain.
1366 * Get node number for proximity domain in lgrp_plat_cpu_node_update()
1378 * proximity domain IDs (if they haven't been set already) in lgrp_plat_cpu_node_update()
1403 * Fill in node and proximity domain IDs in lgrp_plat_cpu_node_update()
1459 * Return node number for given proximity domain/system locality
1469 * Hash proximity domain ID into node to domain mapping table (array), in lgrp_plat_domain_to_node()
1470 * search for entry with matching proximity domain ID, and return index in lgrp_plat_domain_to_node()
2168 * Update node to proximity domain mappings for given domain and return node ID
2178 * Hash proximity domain ID into node to domain mapping table (array) in lgrp_plat_node_domain_update()
2184 * Entry doesn't exist yet, so create one for this proximity in lgrp_plat_node_domain_update()
2195 * Entry exists for this proximity domain already, so just in lgrp_plat_node_domain_update()
2211 * Update node memory information for given proximity domain with specified
2223 * Get node number for proximity domain in lgrp_plat_memnode_info_update()
2285 * Entry already exists for this proximity domain in lgrp_plat_memnode_info_update()
2427 * node to proximity domain ID assignments may have been changed above in lgrp_plat_node_sort()
2753 * Latency information for proximity domain is ready. in lgrp_plat_process_sli()
2839 * Determine number of nodes by counting number of proximity in lgrp_plat_process_srat()
3027 * Return number of proximity domains given in ACPI SRAT
3043 * Walk through SRAT to find minimum proximity domain ID in lgrp_plat_srat_domains()
3099 * Keep track of minimum proximity domain ID in lgrp_plat_srat_domains()
3111 * proximity domain ID for each. in lgrp_plat_srat_domains()
3170 * Count and keep track of which proximity domain IDs seen in lgrp_plat_srat_domains()
3176 * Create entry for proximity domain and increment in lgrp_plat_srat_domains()
3177 * count when no entry exists where proximity domain in lgrp_plat_srat_domains()
3189 * Nothing to do when proximity domain seen already in lgrp_plat_srat_domains()
3198 * Entry exists where proximity domain hashed, but for in lgrp_plat_srat_domains()
3199 * different proximity domain so keep search for empty in lgrp_plat_srat_domains()
3208 * proximity domains than supported nodes (:-( in lgrp_plat_srat_domains()
3236 "?lgrp: too many proximity domains (%d), max %d supported, " in lgrp_plat_msct_domains()
3255 * Break out if all proximity domains have been in lgrp_plat_msct_domains()