blob: 168203c0c3164b0417ce9b2eaeafb71204769893 [file] [log] [blame]
Thomas Gleixner3367e562008-01-30 13:30:38 +01001/*
2 * Written by: Matthew Dobson, IBM Corporation
3 *
4 * Copyright (C) 2002, IBM Corp.
5 *
6 * All rights reserved.
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
16 * NON INFRINGEMENT. See the GNU General Public License for more
17 * details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 *
23 * Send feedback to <colpatch@us.ibm.com>
24 */
H. Peter Anvin1965aae2008-10-22 22:26:29 -070025#ifndef _ASM_X86_TOPOLOGY_H
26#define _ASM_X86_TOPOLOGY_H
Thomas Gleixner3367e562008-01-30 13:30:38 +010027
Vaidyanathan Srinivasan5c3a1212008-05-05 19:22:15 +053028#ifdef CONFIG_X86_32
29# ifdef CONFIG_X86_HT
30# define ENABLE_TOPO_DEFINES
31# endif
32#else
33# ifdef CONFIG_SMP
34# define ENABLE_TOPO_DEFINES
35# endif
36#endif
37
Mike Travis23ca4bb2008-05-12 21:21:12 +020038/* Node not present */
39#define NUMA_NO_NODE (-1)
40
Thomas Gleixner3367e562008-01-30 13:30:38 +010041#ifdef CONFIG_NUMA
42#include <linux/cpumask.h>
43#include <asm/mpspec.h>
44
travis@sgi.com834beda12008-01-30 13:33:21 +010045#ifdef CONFIG_X86_32
travis@sgi.com834beda12008-01-30 13:33:21 +010046
Mike Travis23ca4bb2008-05-12 21:21:12 +020047/* Mappings between node number and cpus on that node. */
Thomas Gleixner3367e562008-01-30 13:30:38 +010048extern cpumask_t node_to_cpumask_map[];
49
Mike Travis23ca4bb2008-05-12 21:21:12 +020050/* Mappings between logical cpu number and node number */
51extern int cpu_to_node_map[];
travis@sgi.comdf3825c2008-01-30 13:33:11 +010052
Thomas Gleixner3367e562008-01-30 13:30:38 +010053/* Returns the number of the node containing CPU 'cpu' */
54static inline int cpu_to_node(int cpu)
55{
travis@sgi.com834beda12008-01-30 13:33:21 +010056 return cpu_to_node_map[cpu];
57}
Mike Travis23ca4bb2008-05-12 21:21:12 +020058#define early_cpu_to_node(cpu) cpu_to_node(cpu)
travis@sgi.com834beda12008-01-30 13:33:21 +010059
Mike Travis6a2f47c2008-06-27 10:10:13 -070060/* Returns a bitmask of CPUs on Node 'node'.
61 *
62 * Side note: this function creates the returned cpumask on the stack
63 * so with a high NR_CPUS count, excessive stack space is used. The
Rusty Russell393d68f2008-12-26 22:23:38 +103064 * cpumask_of_node function should be used whenever possible.
Mike Travis6a2f47c2008-06-27 10:10:13 -070065 */
Mike Travis9f248bd2008-05-12 21:21:12 +020066static inline cpumask_t node_to_cpumask(int node)
67{
68 return node_to_cpumask_map[node];
69}
70
Rusty Russell393d68f2008-12-26 22:23:38 +103071/* Returns a bitmask of CPUs on Node 'node'. */
72static inline const struct cpumask *cpumask_of_node(int node)
73{
74 return &node_to_cpumask_map[node];
75}
76
travis@sgi.com834beda12008-01-30 13:33:21 +010077#else /* CONFIG_X86_64 */
Mike Travisb447a462008-03-25 15:06:51 -070078
Mike Travis23ca4bb2008-05-12 21:21:12 +020079/* Mappings between node number and cpus on that node. */
Mike Travis9f248bd2008-05-12 21:21:12 +020080extern cpumask_t *node_to_cpumask_map;
travis@sgi.comdf3825c2008-01-30 13:33:11 +010081
Mike Travis23ca4bb2008-05-12 21:21:12 +020082/* Mappings between logical cpu number and node number */
83DECLARE_EARLY_PER_CPU(int, x86_cpu_to_node_map);
Thomas Gleixner3367e562008-01-30 13:30:38 +010084
Mike Travis23ca4bb2008-05-12 21:21:12 +020085/* Returns the number of the current Node. */
Mike Travis7891a242008-05-12 21:21:12 +020086#define numa_node_id() read_pda(nodenumber)
Mike Travis23ca4bb2008-05-12 21:21:12 +020087
88#ifdef CONFIG_DEBUG_PER_CPU_MAPS
89extern int cpu_to_node(int cpu);
90extern int early_cpu_to_node(int cpu);
Rusty Russell393d68f2008-12-26 22:23:38 +103091extern const cpumask_t *cpumask_of_node(int node);
Mike Travis23ca4bb2008-05-12 21:21:12 +020092extern cpumask_t node_to_cpumask(int node);
93
94#else /* !CONFIG_DEBUG_PER_CPU_MAPS */
95
96/* Returns the number of the node containing CPU 'cpu' */
travis@sgi.com834beda12008-01-30 13:33:21 +010097static inline int cpu_to_node(int cpu)
98{
Mike Travisb447a462008-03-25 15:06:51 -070099 return per_cpu(x86_cpu_to_node_map, cpu);
travis@sgi.com834beda12008-01-30 13:33:21 +0100100}
Mike Travisaa6b5442008-03-31 08:41:55 -0700101
Mike Travis23ca4bb2008-05-12 21:21:12 +0200102/* Same function but used if called before per_cpu areas are setup */
103static inline int early_cpu_to_node(int cpu)
104{
105 if (early_per_cpu_ptr(x86_cpu_to_node_map))
106 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
107
108 return per_cpu(x86_cpu_to_node_map, cpu);
109}
Mike Travisaa6b5442008-03-31 08:41:55 -0700110
111/* Returns a pointer to the cpumask of CPUs on Node 'node'. */
Rusty Russell393d68f2008-12-26 22:23:38 +1030112static inline const cpumask_t *cpumask_of_node(int node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200113{
114 return &node_to_cpumask_map[node];
115}
Thomas Gleixner3367e562008-01-30 13:30:38 +0100116
117/* Returns a bitmask of CPUs on Node 'node'. */
118static inline cpumask_t node_to_cpumask(int node)
119{
120 return node_to_cpumask_map[node];
121}
122
Mike Travis23ca4bb2008-05-12 21:21:12 +0200123#endif /* !CONFIG_DEBUG_PER_CPU_MAPS */
Mike Travis23ca4bb2008-05-12 21:21:12 +0200124
Rusty Russell393d68f2008-12-26 22:23:38 +1030125/*
126 * Replace default node_to_cpumask_ptr with optimized version
127 * Deprecated: use "const struct cpumask *mask = cpumask_of_node(node)"
128 */
Mike Travis23ca4bb2008-05-12 21:21:12 +0200129#define node_to_cpumask_ptr(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030130 const cpumask_t *v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200131
132#define node_to_cpumask_ptr_next(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030133 v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200134
Mike Travis9f248bd2008-05-12 21:21:12 +0200135#endif /* CONFIG_X86_64 */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100136
Mike Travis23ca4bb2008-05-12 21:21:12 +0200137/*
138 * Returns the number of the node containing Node 'node'. This
139 * architecture is flat, so it is a pretty simple function!
140 */
141#define parent_node(node) (node)
142
Thomas Gleixner3367e562008-01-30 13:30:38 +0100143#define pcibus_to_node(bus) __pcibus_to_node(bus)
144#define pcibus_to_cpumask(bus) __pcibus_to_cpumask(bus)
145
Thomas Gleixner96a388d2007-10-11 11:20:03 +0200146#ifdef CONFIG_X86_32
Thomas Gleixner3367e562008-01-30 13:30:38 +0100147extern unsigned long node_start_pfn[];
148extern unsigned long node_end_pfn[];
149extern unsigned long node_remap_size[];
150#define node_has_online_mem(nid) (node_start_pfn[nid] != node_end_pfn[nid])
151
Thomas Gleixner3367e562008-01-30 13:30:38 +0100152# define SD_CACHE_NICE_TRIES 1
153# define SD_IDLE_IDX 1
154# define SD_NEWIDLE_IDX 2
155# define SD_FORKEXEC_IDX 0
156
Thomas Gleixner96a388d2007-10-11 11:20:03 +0200157#else
Thomas Gleixner3367e562008-01-30 13:30:38 +0100158
Thomas Gleixner3367e562008-01-30 13:30:38 +0100159# define SD_CACHE_NICE_TRIES 2
160# define SD_IDLE_IDX 2
Hidetoshi Seto1d3504f2008-04-15 14:04:23 +0900161# define SD_NEWIDLE_IDX 2
Thomas Gleixner3367e562008-01-30 13:30:38 +0100162# define SD_FORKEXEC_IDX 1
163
164#endif
165
Ingo Molnar9fcd18c2008-11-05 16:52:08 +0100166/* sched_domains SD_NODE_INIT for NUMA machines */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100167#define SD_NODE_INIT (struct sched_domain) { \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100168 .min_interval = 8, \
169 .max_interval = 32, \
170 .busy_factor = 32, \
171 .imbalance_pct = 125, \
172 .cache_nice_tries = SD_CACHE_NICE_TRIES, \
173 .busy_idx = 3, \
174 .idle_idx = SD_IDLE_IDX, \
175 .newidle_idx = SD_NEWIDLE_IDX, \
176 .wake_idx = 1, \
177 .forkexec_idx = SD_FORKEXEC_IDX, \
178 .flags = SD_LOAD_BALANCE \
179 | SD_BALANCE_EXEC \
180 | SD_BALANCE_FORK \
Ingo Molnar9fcd18c2008-11-05 16:52:08 +0100181 | SD_WAKE_AFFINE \
182 | SD_WAKE_BALANCE \
183 | SD_SERIALIZE, \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100184 .last_balance = jiffies, \
185 .balance_interval = 1, \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100186}
187
188#ifdef CONFIG_X86_64_ACPI_NUMA
189extern int __node_distance(int, int);
190#define node_distance(a, b) __node_distance(a, b)
191#endif
192
Mike Travis23ca4bb2008-05-12 21:21:12 +0200193#else /* !CONFIG_NUMA */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100194
Mike Travis23ca4bb2008-05-12 21:21:12 +0200195#define numa_node_id() 0
196#define cpu_to_node(cpu) 0
197#define early_cpu_to_node(cpu) 0
198
Rusty Russell393d68f2008-12-26 22:23:38 +1030199static inline const cpumask_t *cpumask_of_node(int node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200200{
201 return &cpu_online_map;
202}
203static inline cpumask_t node_to_cpumask(int node)
204{
205 return cpu_online_map;
206}
207static inline int node_to_first_cpu(int node)
208{
209 return first_cpu(cpu_online_map);
210}
211
Rusty Russell393d68f2008-12-26 22:23:38 +1030212/*
213 * Replace default node_to_cpumask_ptr with optimized version
214 * Deprecated: use "const struct cpumask *mask = cpumask_of_node(node)"
215 */
Mike Travis23ca4bb2008-05-12 21:21:12 +0200216#define node_to_cpumask_ptr(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030217 const cpumask_t *v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200218
219#define node_to_cpumask_ptr_next(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030220 v = cpumask_of_node(node)
Thomas Gleixner3367e562008-01-30 13:30:38 +0100221#endif
222
Mike Travisaa6b5442008-03-31 08:41:55 -0700223#include <asm-generic/topology.h>
224
Mike Travis9f248bd2008-05-12 21:21:12 +0200225#ifdef CONFIG_NUMA
226/* Returns the number of the first CPU on Node 'node'. */
227static inline int node_to_first_cpu(int node)
228{
Rusty Russell393d68f2008-12-26 22:23:38 +1030229 return cpumask_first(cpumask_of_node(node));
Mike Travis9f248bd2008-05-12 21:21:12 +0200230}
231#endif
232
Thomas Gleixner3367e562008-01-30 13:30:38 +0100233extern cpumask_t cpu_coregroup_map(int cpu);
Rusty Russell030bb202008-12-26 22:23:41 +1030234extern const struct cpumask *cpu_coregroup_mask(int cpu);
Thomas Gleixner3367e562008-01-30 13:30:38 +0100235
236#ifdef ENABLE_TOPO_DEFINES
237#define topology_physical_package_id(cpu) (cpu_data(cpu).phys_proc_id)
238#define topology_core_id(cpu) (cpu_data(cpu).cpu_core_id)
239#define topology_core_siblings(cpu) (per_cpu(cpu_core_map, cpu))
240#define topology_thread_siblings(cpu) (per_cpu(cpu_sibling_map, cpu))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200241
242/* indicates that pointers to the topology cpumask_t maps are valid */
243#define arch_provides_topology_pointers yes
Thomas Gleixner3367e562008-01-30 13:30:38 +0100244#endif
245
Alex Chiangfe086a72008-04-29 15:05:29 -0700246static inline void arch_fix_phys_package_id(int num, u32 slot)
247{
248}
249
Yinghai Lu30a18d62008-02-19 03:21:20 -0800250struct pci_bus;
251void set_pci_bus_resources_arch_default(struct pci_bus *b);
252
Thomas Gleixner3367e562008-01-30 13:30:38 +0100253#ifdef CONFIG_SMP
Mahesh Salgaonkar43714532008-11-29 16:50:12 +0530254#define mc_capable() (cpus_weight(per_cpu(cpu_core_map, 0)) != nr_cpu_ids)
Thomas Gleixner3367e562008-01-30 13:30:38 +0100255#define smt_capable() (smp_num_siblings > 1)
256#endif
257
Yinghai Lu871d5f82008-02-19 03:20:09 -0800258#ifdef CONFIG_NUMA
259extern int get_mp_bus_to_node(int busnum);
260extern void set_mp_bus_to_node(int busnum, int node);
261#else
262static inline int get_mp_bus_to_node(int busnum)
263{
264 return 0;
265}
266static inline void set_mp_bus_to_node(int busnum, int node)
267{
268}
269#endif
270
H. Peter Anvin1965aae2008-10-22 22:26:29 -0700271#endif /* _ASM_X86_TOPOLOGY_H */