smp.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /*
  2. * This program is free software; you can redistribute it and/or
  3. * modify it under the terms of the GNU General Public License
  4. * as published by the Free Software Foundation; either version 2
  5. * of the License, or (at your option) any later version.
  6. *
  7. * This program is distributed in the hope that it will be useful,
  8. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. * GNU General Public License for more details.
  11. *
  12. * You should have received a copy of the GNU General Public License
  13. * along with this program; if not, write to the Free Software
  14. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  15. *
  16. * Copyright (C) 2000, 2001 Kanoj Sarcar
  17. * Copyright (C) 2000, 2001 Ralf Baechle
  18. * Copyright (C) 2000, 2001 Silicon Graphics, Inc.
  19. * Copyright (C) 2000, 2001, 2003 Broadcom Corporation
  20. */
  21. #include <linux/cache.h>
  22. #include <linux/delay.h>
  23. #include <linux/init.h>
  24. #include <linux/interrupt.h>
  25. #include <linux/spinlock.h>
  26. #include <linux/threads.h>
  27. #include <linux/module.h>
  28. #include <linux/time.h>
  29. #include <linux/timex.h>
  30. #include <linux/sched.h>
  31. #include <linux/cpumask.h>
  32. #include <asm/atomic.h>
  33. #include <asm/cpu.h>
  34. #include <asm/processor.h>
  35. #include <asm/system.h>
  36. #include <asm/mmu_context.h>
  37. #include <asm/smp.h>
  38. cpumask_t phys_cpu_present_map; /* Bitmask of available CPUs */
  39. volatile cpumask_t cpu_callin_map; /* Bitmask of started secondaries */
  40. cpumask_t cpu_online_map; /* Bitmask of currently online CPUs */
  41. int __cpu_number_map[NR_CPUS]; /* Map physical to logical */
  42. int __cpu_logical_map[NR_CPUS]; /* Map logical to physical */
  43. EXPORT_SYMBOL(phys_cpu_present_map);
  44. EXPORT_SYMBOL(cpu_online_map);
  45. static void smp_tune_scheduling (void)
  46. {
  47. struct cache_desc *cd = &current_cpu_data.scache;
  48. unsigned long cachesize; /* kB */
  49. unsigned long bandwidth = 350; /* MB/s */
  50. unsigned long cpu_khz;
  51. /*
  52. * Crude estimate until we actually meassure ...
  53. */
  54. cpu_khz = loops_per_jiffy * 2 * HZ / 1000;
  55. /*
  56. * Rough estimation for SMP scheduling, this is the number of
  57. * cycles it takes for a fully memory-limited process to flush
  58. * the SMP-local cache.
  59. *
  60. * (For a P5 this pretty much means we will choose another idle
  61. * CPU almost always at wakeup time (this is due to the small
  62. * L1 cache), on PIIs it's around 50-100 usecs, depending on
  63. * the cache size)
  64. */
  65. if (!cpu_khz)
  66. return;
  67. cachesize = cd->linesz * cd->sets * cd->ways;
  68. }
  69. extern void __init calibrate_delay(void);
  70. extern ATTRIB_NORET void cpu_idle(void);
  71. /*
  72. * First C code run on the secondary CPUs after being started up by
  73. * the master.
  74. */
  75. asmlinkage void start_secondary(void)
  76. {
  77. unsigned int cpu = smp_processor_id();
  78. cpu_probe();
  79. cpu_report();
  80. per_cpu_trap_init();
  81. prom_init_secondary();
  82. /*
  83. * XXX parity protection should be folded in here when it's converted
  84. * to an option instead of something based on .cputype
  85. */
  86. calibrate_delay();
  87. cpu_data[cpu].udelay_val = loops_per_jiffy;
  88. prom_smp_finish();
  89. cpu_set(cpu, cpu_callin_map);
  90. cpu_idle();
  91. }
  92. DEFINE_SPINLOCK(smp_call_lock);
  93. struct call_data_struct *call_data;
  94. /*
  95. * Run a function on all other CPUs.
  96. * <func> The function to run. This must be fast and non-blocking.
  97. * <info> An arbitrary pointer to pass to the function.
  98. * <retry> If true, keep retrying until ready.
  99. * <wait> If true, wait until function has completed on other CPUs.
  100. * [RETURNS] 0 on success, else a negative status code.
  101. *
  102. * Does not return until remote CPUs are nearly ready to execute <func>
  103. * or are or have executed.
  104. *
  105. * You must not call this function with disabled interrupts or from a
  106. * hardware interrupt handler or from a bottom half handler.
  107. */
  108. int smp_call_function (void (*func) (void *info), void *info, int retry,
  109. int wait)
  110. {
  111. struct call_data_struct data;
  112. int i, cpus = num_online_cpus() - 1;
  113. int cpu = smp_processor_id();
  114. if (!cpus)
  115. return 0;
  116. /* Can deadlock when called with interrupts disabled */
  117. WARN_ON(irqs_disabled());
  118. data.func = func;
  119. data.info = info;
  120. atomic_set(&data.started, 0);
  121. data.wait = wait;
  122. if (wait)
  123. atomic_set(&data.finished, 0);
  124. spin_lock(&smp_call_lock);
  125. call_data = &data;
  126. mb();
  127. /* Send a message to all other CPUs and wait for them to respond */
  128. for (i = 0; i < NR_CPUS; i++)
  129. if (cpu_online(i) && i != cpu)
  130. core_send_ipi(i, SMP_CALL_FUNCTION);
  131. /* Wait for response */
  132. /* FIXME: lock-up detection, backtrace on lock-up */
  133. while (atomic_read(&data.started) != cpus)
  134. barrier();
  135. if (wait)
  136. while (atomic_read(&data.finished) != cpus)
  137. barrier();
  138. spin_unlock(&smp_call_lock);
  139. return 0;
  140. }
  141. void smp_call_function_interrupt(void)
  142. {
  143. void (*func) (void *info) = call_data->func;
  144. void *info = call_data->info;
  145. int wait = call_data->wait;
  146. /*
  147. * Notify initiating CPU that I've grabbed the data and am
  148. * about to execute the function.
  149. */
  150. mb();
  151. atomic_inc(&call_data->started);
  152. /*
  153. * At this point the info structure may be out of scope unless wait==1.
  154. */
  155. irq_enter();
  156. (*func)(info);
  157. irq_exit();
  158. if (wait) {
  159. mb();
  160. atomic_inc(&call_data->finished);
  161. }
  162. }
  163. static void stop_this_cpu(void *dummy)
  164. {
  165. /*
  166. * Remove this CPU:
  167. */
  168. cpu_clear(smp_processor_id(), cpu_online_map);
  169. local_irq_enable(); /* May need to service _machine_restart IPI */
  170. for (;;); /* Wait if available. */
  171. }
  172. void smp_send_stop(void)
  173. {
  174. smp_call_function(stop_this_cpu, NULL, 1, 0);
  175. }
  176. void __init smp_cpus_done(unsigned int max_cpus)
  177. {
  178. prom_cpus_done();
  179. }
  180. /* called from main before smp_init() */
  181. void __init smp_prepare_cpus(unsigned int max_cpus)
  182. {
  183. cpu_data[0].udelay_val = loops_per_jiffy;
  184. init_new_context(current, &init_mm);
  185. current_thread_info()->cpu = 0;
  186. smp_tune_scheduling();
  187. prom_prepare_cpus(max_cpus);
  188. }
  189. /* preload SMP state for boot cpu */
  190. void __devinit smp_prepare_boot_cpu(void)
  191. {
  192. /*
  193. * This assumes that bootup is always handled by the processor
  194. * with the logic and physical number 0.
  195. */
  196. __cpu_number_map[0] = 0;
  197. __cpu_logical_map[0] = 0;
  198. cpu_set(0, phys_cpu_present_map);
  199. cpu_set(0, cpu_online_map);
  200. cpu_set(0, cpu_callin_map);
  201. }
  202. /*
  203. * Startup the CPU with this logical number
  204. */
  205. static int __init do_boot_cpu(int cpu)
  206. {
  207. struct task_struct *idle;
  208. /*
  209. * The following code is purely to make sure
  210. * Linux can schedule processes on this slave.
  211. */
  212. idle = fork_idle(cpu);
  213. if (IS_ERR(idle))
  214. panic("failed fork for CPU %d\n", cpu);
  215. prom_boot_secondary(cpu, idle);
  216. /* XXXKW timeout */
  217. while (!cpu_isset(cpu, cpu_callin_map))
  218. udelay(100);
  219. cpu_set(cpu, cpu_online_map);
  220. return 0;
  221. }
  222. /*
  223. * Called once for each "cpu_possible(cpu)". Needs to spin up the cpu
  224. * and keep control until "cpu_online(cpu)" is set. Note: cpu is
  225. * physical, not logical.
  226. */
  227. int __devinit __cpu_up(unsigned int cpu)
  228. {
  229. int ret;
  230. /* Processor goes to start_secondary(), sets online flag */
  231. ret = do_boot_cpu(cpu);
  232. if (ret < 0)
  233. return ret;
  234. return 0;
  235. }
  236. /* Not really SMP stuff ... */
  237. int setup_profiling_timer(unsigned int multiplier)
  238. {
  239. return 0;
  240. }
  241. static void flush_tlb_all_ipi(void *info)
  242. {
  243. local_flush_tlb_all();
  244. }
  245. void flush_tlb_all(void)
  246. {
  247. on_each_cpu(flush_tlb_all_ipi, 0, 1, 1);
  248. }
  249. static void flush_tlb_mm_ipi(void *mm)
  250. {
  251. local_flush_tlb_mm((struct mm_struct *)mm);
  252. }
  253. /*
  254. * The following tlb flush calls are invoked when old translations are
  255. * being torn down, or pte attributes are changing. For single threaded
  256. * address spaces, a new context is obtained on the current cpu, and tlb
  257. * context on other cpus are invalidated to force a new context allocation
  258. * at switch_mm time, should the mm ever be used on other cpus. For
  259. * multithreaded address spaces, intercpu interrupts have to be sent.
  260. * Another case where intercpu interrupts are required is when the target
  261. * mm might be active on another cpu (eg debuggers doing the flushes on
  262. * behalf of debugees, kswapd stealing pages from another process etc).
  263. * Kanoj 07/00.
  264. */
  265. void flush_tlb_mm(struct mm_struct *mm)
  266. {
  267. preempt_disable();
  268. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  269. smp_call_function(flush_tlb_mm_ipi, (void *)mm, 1, 1);
  270. } else {
  271. int i;
  272. for (i = 0; i < num_online_cpus(); i++)
  273. if (smp_processor_id() != i)
  274. cpu_context(i, mm) = 0;
  275. }
  276. local_flush_tlb_mm(mm);
  277. preempt_enable();
  278. }
  279. struct flush_tlb_data {
  280. struct vm_area_struct *vma;
  281. unsigned long addr1;
  282. unsigned long addr2;
  283. };
  284. static void flush_tlb_range_ipi(void *info)
  285. {
  286. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  287. local_flush_tlb_range(fd->vma, fd->addr1, fd->addr2);
  288. }
  289. void flush_tlb_range(struct vm_area_struct *vma, unsigned long start, unsigned long end)
  290. {
  291. struct mm_struct *mm = vma->vm_mm;
  292. preempt_disable();
  293. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  294. struct flush_tlb_data fd;
  295. fd.vma = vma;
  296. fd.addr1 = start;
  297. fd.addr2 = end;
  298. smp_call_function(flush_tlb_range_ipi, (void *)&fd, 1, 1);
  299. } else {
  300. int i;
  301. for (i = 0; i < num_online_cpus(); i++)
  302. if (smp_processor_id() != i)
  303. cpu_context(i, mm) = 0;
  304. }
  305. local_flush_tlb_range(vma, start, end);
  306. preempt_enable();
  307. }
  308. static void flush_tlb_kernel_range_ipi(void *info)
  309. {
  310. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  311. local_flush_tlb_kernel_range(fd->addr1, fd->addr2);
  312. }
  313. void flush_tlb_kernel_range(unsigned long start, unsigned long end)
  314. {
  315. struct flush_tlb_data fd;
  316. fd.addr1 = start;
  317. fd.addr2 = end;
  318. on_each_cpu(flush_tlb_kernel_range_ipi, (void *)&fd, 1, 1);
  319. }
  320. static void flush_tlb_page_ipi(void *info)
  321. {
  322. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  323. local_flush_tlb_page(fd->vma, fd->addr1);
  324. }
  325. void flush_tlb_page(struct vm_area_struct *vma, unsigned long page)
  326. {
  327. preempt_disable();
  328. if ((atomic_read(&vma->vm_mm->mm_users) != 1) || (current->mm != vma->vm_mm)) {
  329. struct flush_tlb_data fd;
  330. fd.vma = vma;
  331. fd.addr1 = page;
  332. smp_call_function(flush_tlb_page_ipi, (void *)&fd, 1, 1);
  333. } else {
  334. int i;
  335. for (i = 0; i < num_online_cpus(); i++)
  336. if (smp_processor_id() != i)
  337. cpu_context(i, vma->vm_mm) = 0;
  338. }
  339. local_flush_tlb_page(vma, page);
  340. preempt_enable();
  341. }
  342. static void flush_tlb_one_ipi(void *info)
  343. {
  344. unsigned long vaddr = (unsigned long) info;
  345. local_flush_tlb_one(vaddr);
  346. }
  347. void flush_tlb_one(unsigned long vaddr)
  348. {
  349. smp_call_function(flush_tlb_one_ipi, (void *) vaddr, 1, 1);
  350. local_flush_tlb_one(vaddr);
  351. }
  352. EXPORT_SYMBOL(flush_tlb_page);
  353. EXPORT_SYMBOL(flush_tlb_one);
  354. EXPORT_SYMBOL(cpu_data);
  355. EXPORT_SYMBOL(synchronize_irq);