blob: fa4aa42e976d45490a70867bc434c69d4d9cd961 [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.com834beda2008-01-30 13:33:21 +010045#ifdef CONFIG_X86_32
travis@sgi.com834beda2008-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.com834beda2008-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.com834beda2008-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
Brian Gerst6470aff2009-01-27 12:56:47 +090077static inline void setup_node_to_cpumask_map(void) { }
78
travis@sgi.com834beda2008-01-30 13:33:21 +010079#else /* CONFIG_X86_64 */
Mike Travisb447a462008-03-25 15:06:51 -070080
Mike Travis23ca4bb2008-05-12 21:21:12 +020081/* Mappings between node number and cpus on that node. */
Mike Travis9f248bd2008-05-12 21:21:12 +020082extern cpumask_t *node_to_cpumask_map;
travis@sgi.comdf3825c2008-01-30 13:33:11 +010083
Mike Travis23ca4bb2008-05-12 21:21:12 +020084/* Mappings between logical cpu number and node number */
85DECLARE_EARLY_PER_CPU(int, x86_cpu_to_node_map);
Thomas Gleixner3367e562008-01-30 13:30:38 +010086
Mike Travis23ca4bb2008-05-12 21:21:12 +020087/* Returns the number of the current Node. */
Brian Gerste7a22c12009-01-19 00:38:59 +090088DECLARE_PER_CPU(int, node_number);
89#define numa_node_id() percpu_read(node_number)
Mike Travis23ca4bb2008-05-12 21:21:12 +020090
91#ifdef CONFIG_DEBUG_PER_CPU_MAPS
92extern int cpu_to_node(int cpu);
93extern int early_cpu_to_node(int cpu);
Rusty Russell393d68f2008-12-26 22:23:38 +103094extern const cpumask_t *cpumask_of_node(int node);
Mike Travis23ca4bb2008-05-12 21:21:12 +020095extern cpumask_t node_to_cpumask(int node);
96
97#else /* !CONFIG_DEBUG_PER_CPU_MAPS */
98
99/* Returns the number of the node containing CPU 'cpu' */
travis@sgi.com834beda2008-01-30 13:33:21 +0100100static inline int cpu_to_node(int cpu)
101{
Mike Travisb447a462008-03-25 15:06:51 -0700102 return per_cpu(x86_cpu_to_node_map, cpu);
travis@sgi.com834beda2008-01-30 13:33:21 +0100103}
Mike Travisaa6b5442008-03-31 08:41:55 -0700104
Mike Travis23ca4bb2008-05-12 21:21:12 +0200105/* Same function but used if called before per_cpu areas are setup */
106static inline int early_cpu_to_node(int cpu)
107{
Tejun Heof10fcd42009-01-13 20:41:34 +0900108 return early_per_cpu(x86_cpu_to_node_map, cpu);
Mike Travis23ca4bb2008-05-12 21:21:12 +0200109}
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
Brian Gerst6470aff2009-01-27 12:56:47 +0900125extern void setup_node_to_cpumask_map(void);
126
Rusty Russell393d68f2008-12-26 22:23:38 +1030127/*
128 * Replace default node_to_cpumask_ptr with optimized version
129 * Deprecated: use "const struct cpumask *mask = cpumask_of_node(node)"
130 */
Mike Travis23ca4bb2008-05-12 21:21:12 +0200131#define node_to_cpumask_ptr(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030132 const cpumask_t *v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200133
134#define node_to_cpumask_ptr_next(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030135 v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200136
Mike Travis9f248bd2008-05-12 21:21:12 +0200137#endif /* CONFIG_X86_64 */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100138
Mike Travis23ca4bb2008-05-12 21:21:12 +0200139/*
140 * Returns the number of the node containing Node 'node'. This
141 * architecture is flat, so it is a pretty simple function!
142 */
143#define parent_node(node) (node)
144
Thomas Gleixner3367e562008-01-30 13:30:38 +0100145#define pcibus_to_node(bus) __pcibus_to_node(bus)
Thomas Gleixner3367e562008-01-30 13:30:38 +0100146
Thomas Gleixner96a388d2007-10-11 11:20:03 +0200147#ifdef CONFIG_X86_32
Thomas Gleixner3367e562008-01-30 13:30:38 +0100148extern unsigned long node_start_pfn[];
149extern unsigned long node_end_pfn[];
150extern unsigned long node_remap_size[];
151#define node_has_online_mem(nid) (node_start_pfn[nid] != node_end_pfn[nid])
152
Thomas Gleixner3367e562008-01-30 13:30:38 +0100153# define SD_CACHE_NICE_TRIES 1
154# define SD_IDLE_IDX 1
155# define SD_NEWIDLE_IDX 2
156# define SD_FORKEXEC_IDX 0
157
Thomas Gleixner96a388d2007-10-11 11:20:03 +0200158#else
Thomas Gleixner3367e562008-01-30 13:30:38 +0100159
Thomas Gleixner3367e562008-01-30 13:30:38 +0100160# define SD_CACHE_NICE_TRIES 2
161# define SD_IDLE_IDX 2
Hidetoshi Seto1d3504f2008-04-15 14:04:23 +0900162# define SD_NEWIDLE_IDX 2
Thomas Gleixner3367e562008-01-30 13:30:38 +0100163# define SD_FORKEXEC_IDX 1
164
165#endif
166
Ingo Molnar9fcd18c2008-11-05 16:52:08 +0100167/* sched_domains SD_NODE_INIT for NUMA machines */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100168#define SD_NODE_INIT (struct sched_domain) { \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100169 .min_interval = 8, \
170 .max_interval = 32, \
171 .busy_factor = 32, \
172 .imbalance_pct = 125, \
173 .cache_nice_tries = SD_CACHE_NICE_TRIES, \
174 .busy_idx = 3, \
175 .idle_idx = SD_IDLE_IDX, \
176 .newidle_idx = SD_NEWIDLE_IDX, \
177 .wake_idx = 1, \
178 .forkexec_idx = SD_FORKEXEC_IDX, \
179 .flags = SD_LOAD_BALANCE \
180 | SD_BALANCE_EXEC \
181 | SD_BALANCE_FORK \
Ingo Molnar9fcd18c2008-11-05 16:52:08 +0100182 | SD_WAKE_AFFINE \
183 | SD_WAKE_BALANCE \
184 | SD_SERIALIZE, \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100185 .last_balance = jiffies, \
186 .balance_interval = 1, \
Thomas Gleixner3367e562008-01-30 13:30:38 +0100187}
188
189#ifdef CONFIG_X86_64_ACPI_NUMA
190extern int __node_distance(int, int);
191#define node_distance(a, b) __node_distance(a, b)
192#endif
193
Mike Travis23ca4bb2008-05-12 21:21:12 +0200194#else /* !CONFIG_NUMA */
Thomas Gleixner3367e562008-01-30 13:30:38 +0100195
Mike Travisf2a08272009-01-15 09:19:32 -0800196static inline int numa_node_id(void)
197{
198 return 0;
199}
200
201static inline int cpu_to_node(int cpu)
202{
203 return 0;
204}
205
206static inline int early_cpu_to_node(int cpu)
207{
208 return 0;
209}
Mike Travis23ca4bb2008-05-12 21:21:12 +0200210
Rusty Russell393d68f2008-12-26 22:23:38 +1030211static inline const cpumask_t *cpumask_of_node(int node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200212{
213 return &cpu_online_map;
214}
215static inline cpumask_t node_to_cpumask(int node)
216{
217 return cpu_online_map;
218}
219static inline int node_to_first_cpu(int node)
220{
221 return first_cpu(cpu_online_map);
222}
223
Brian Gerst6470aff2009-01-27 12:56:47 +0900224static inline void setup_node_to_cpumask_map(void) { }
225
Rusty Russell393d68f2008-12-26 22:23:38 +1030226/*
227 * Replace default node_to_cpumask_ptr with optimized version
228 * Deprecated: use "const struct cpumask *mask = cpumask_of_node(node)"
229 */
Mike Travis23ca4bb2008-05-12 21:21:12 +0200230#define node_to_cpumask_ptr(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030231 const cpumask_t *v = cpumask_of_node(node)
Mike Travis23ca4bb2008-05-12 21:21:12 +0200232
233#define node_to_cpumask_ptr_next(v, node) \
Rusty Russell393d68f2008-12-26 22:23:38 +1030234 v = cpumask_of_node(node)
Thomas Gleixner3367e562008-01-30 13:30:38 +0100235#endif
236
Mike Travisaa6b5442008-03-31 08:41:55 -0700237#include <asm-generic/topology.h>
238
Mike Travis9f248bd2008-05-12 21:21:12 +0200239#ifdef CONFIG_NUMA
240/* Returns the number of the first CPU on Node 'node'. */
241static inline int node_to_first_cpu(int node)
242{
Rusty Russell393d68f2008-12-26 22:23:38 +1030243 return cpumask_first(cpumask_of_node(node));
Mike Travis9f248bd2008-05-12 21:21:12 +0200244}
245#endif
246
Rusty Russell030bb202008-12-26 22:23:41 +1030247extern const struct cpumask *cpu_coregroup_mask(int cpu);
Thomas Gleixner3367e562008-01-30 13:30:38 +0100248
249#ifdef ENABLE_TOPO_DEFINES
250#define topology_physical_package_id(cpu) (cpu_data(cpu).phys_proc_id)
251#define topology_core_id(cpu) (cpu_data(cpu).cpu_core_id)
Rusty Russell7ad728f2009-03-13 14:49:50 +1030252#define topology_core_cpumask(cpu) (per_cpu(cpu_core_map, cpu))
253#define topology_thread_cpumask(cpu) (per_cpu(cpu_sibling_map, cpu))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200254
255/* indicates that pointers to the topology cpumask_t maps are valid */
256#define arch_provides_topology_pointers yes
Thomas Gleixner3367e562008-01-30 13:30:38 +0100257#endif
258
Alex Chiangfe086a72008-04-29 15:05:29 -0700259static inline void arch_fix_phys_package_id(int num, u32 slot)
260{
261}
262
Yinghai Lu30a18d62008-02-19 03:21:20 -0800263struct pci_bus;
264void set_pci_bus_resources_arch_default(struct pci_bus *b);
265
Thomas Gleixner3367e562008-01-30 13:30:38 +0100266#ifdef CONFIG_SMP
Rusty Russell7ad728f2009-03-13 14:49:50 +1030267#define mc_capable() (cpumask_weight(cpu_core_mask(0)) != nr_cpu_ids)
Thomas Gleixner3367e562008-01-30 13:30:38 +0100268#define smt_capable() (smp_num_siblings > 1)
269#endif
270
Yinghai Lu871d5f82008-02-19 03:20:09 -0800271#ifdef CONFIG_NUMA
272extern int get_mp_bus_to_node(int busnum);
273extern void set_mp_bus_to_node(int busnum, int node);
274#else
275static inline int get_mp_bus_to_node(int busnum)
276{
277 return 0;
278}
279static inline void set_mp_bus_to_node(int busnum, int node)
280{
281}
282#endif
283
H. Peter Anvin1965aae2008-10-22 22:26:29 -0700284#endif /* _ASM_X86_TOPOLOGY_H */