smp.c 11 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. * CPU A CPU B
  109. * Disable interrupts
  110. * smp_call_function()
  111. * Take call_lock
  112. * Send IPIs
  113. * Wait for all cpus to acknowledge IPI
  114. * CPU A has not responded, spin waiting
  115. * for cpu A to respond, holding call_lock
  116. * smp_call_function()
  117. * Spin waiting for call_lock
  118. * Deadlock Deadlock
  119. */
  120. int smp_call_function (void (*func) (void *info), void *info, int retry,
  121. int wait)
  122. {
  123. struct call_data_struct data;
  124. int i, cpus = num_online_cpus() - 1;
  125. int cpu = smp_processor_id();
  126. if (!cpus)
  127. return 0;
  128. /* Can deadlock when called with interrupts disabled */
  129. WARN_ON(irqs_disabled());
  130. data.func = func;
  131. data.info = info;
  132. atomic_set(&data.started, 0);
  133. data.wait = wait;
  134. if (wait)
  135. atomic_set(&data.finished, 0);
  136. spin_lock(&smp_call_lock);
  137. call_data = &data;
  138. mb();
  139. /* Send a message to all other CPUs and wait for them to respond */
  140. for (i = 0; i < NR_CPUS; i++)
  141. if (cpu_online(i) && i != cpu)
  142. core_send_ipi(i, SMP_CALL_FUNCTION);
  143. /* Wait for response */
  144. /* FIXME: lock-up detection, backtrace on lock-up */
  145. while (atomic_read(&data.started) != cpus)
  146. barrier();
  147. if (wait)
  148. while (atomic_read(&data.finished) != cpus)
  149. barrier();
  150. spin_unlock(&smp_call_lock);
  151. return 0;
  152. }
  153. void smp_call_function_interrupt(void)
  154. {
  155. void (*func) (void *info) = call_data->func;
  156. void *info = call_data->info;
  157. int wait = call_data->wait;
  158. /*
  159. * Notify initiating CPU that I've grabbed the data and am
  160. * about to execute the function.
  161. */
  162. mb();
  163. atomic_inc(&call_data->started);
  164. /*
  165. * At this point the info structure may be out of scope unless wait==1.
  166. */
  167. irq_enter();
  168. (*func)(info);
  169. irq_exit();
  170. if (wait) {
  171. mb();
  172. atomic_inc(&call_data->finished);
  173. }
  174. }
  175. static void stop_this_cpu(void *dummy)
  176. {
  177. /*
  178. * Remove this CPU:
  179. */
  180. cpu_clear(smp_processor_id(), cpu_online_map);
  181. local_irq_enable(); /* May need to service _machine_restart IPI */
  182. for (;;); /* Wait if available. */
  183. }
  184. void smp_send_stop(void)
  185. {
  186. smp_call_function(stop_this_cpu, NULL, 1, 0);
  187. }
  188. void __init smp_cpus_done(unsigned int max_cpus)
  189. {
  190. prom_cpus_done();
  191. }
  192. /* called from main before smp_init() */
  193. void __init smp_prepare_cpus(unsigned int max_cpus)
  194. {
  195. cpu_data[0].udelay_val = loops_per_jiffy;
  196. init_new_context(current, &init_mm);
  197. current_thread_info()->cpu = 0;
  198. smp_tune_scheduling();
  199. prom_prepare_cpus(max_cpus);
  200. }
  201. /* preload SMP state for boot cpu */
  202. void __devinit smp_prepare_boot_cpu(void)
  203. {
  204. /*
  205. * This assumes that bootup is always handled by the processor
  206. * with the logic and physical number 0.
  207. */
  208. __cpu_number_map[0] = 0;
  209. __cpu_logical_map[0] = 0;
  210. cpu_set(0, phys_cpu_present_map);
  211. cpu_set(0, cpu_online_map);
  212. cpu_set(0, cpu_callin_map);
  213. }
  214. /*
  215. * Called once for each "cpu_possible(cpu)". Needs to spin up the cpu
  216. * and keep control until "cpu_online(cpu)" is set. Note: cpu is
  217. * physical, not logical.
  218. */
  219. int __devinit __cpu_up(unsigned int cpu)
  220. {
  221. struct task_struct *idle;
  222. /*
  223. * Processor goes to start_secondary(), sets online flag
  224. * The following code is purely to make sure
  225. * Linux can schedule processes on this slave.
  226. */
  227. idle = fork_idle(cpu);
  228. if (IS_ERR(idle))
  229. panic(KERN_ERR "Fork failed for CPU %d", cpu);
  230. prom_boot_secondary(cpu, idle);
  231. /*
  232. * Trust is futile. We should really have timeouts ...
  233. */
  234. while (!cpu_isset(cpu, cpu_callin_map))
  235. udelay(100);
  236. cpu_set(cpu, cpu_online_map);
  237. return 0;
  238. }
  239. /* Not really SMP stuff ... */
  240. int setup_profiling_timer(unsigned int multiplier)
  241. {
  242. return 0;
  243. }
  244. static void flush_tlb_all_ipi(void *info)
  245. {
  246. local_flush_tlb_all();
  247. }
  248. void flush_tlb_all(void)
  249. {
  250. on_each_cpu(flush_tlb_all_ipi, 0, 1, 1);
  251. }
  252. static void flush_tlb_mm_ipi(void *mm)
  253. {
  254. local_flush_tlb_mm((struct mm_struct *)mm);
  255. }
  256. /*
  257. * The following tlb flush calls are invoked when old translations are
  258. * being torn down, or pte attributes are changing. For single threaded
  259. * address spaces, a new context is obtained on the current cpu, and tlb
  260. * context on other cpus are invalidated to force a new context allocation
  261. * at switch_mm time, should the mm ever be used on other cpus. For
  262. * multithreaded address spaces, intercpu interrupts have to be sent.
  263. * Another case where intercpu interrupts are required is when the target
  264. * mm might be active on another cpu (eg debuggers doing the flushes on
  265. * behalf of debugees, kswapd stealing pages from another process etc).
  266. * Kanoj 07/00.
  267. */
  268. void flush_tlb_mm(struct mm_struct *mm)
  269. {
  270. preempt_disable();
  271. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  272. smp_call_function(flush_tlb_mm_ipi, (void *)mm, 1, 1);
  273. } else {
  274. int i;
  275. for (i = 0; i < num_online_cpus(); i++)
  276. if (smp_processor_id() != i)
  277. cpu_context(i, mm) = 0;
  278. }
  279. local_flush_tlb_mm(mm);
  280. preempt_enable();
  281. }
  282. struct flush_tlb_data {
  283. struct vm_area_struct *vma;
  284. unsigned long addr1;
  285. unsigned long addr2;
  286. };
  287. static void flush_tlb_range_ipi(void *info)
  288. {
  289. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  290. local_flush_tlb_range(fd->vma, fd->addr1, fd->addr2);
  291. }
  292. void flush_tlb_range(struct vm_area_struct *vma, unsigned long start, unsigned long end)
  293. {
  294. struct mm_struct *mm = vma->vm_mm;
  295. preempt_disable();
  296. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  297. struct flush_tlb_data fd;
  298. fd.vma = vma;
  299. fd.addr1 = start;
  300. fd.addr2 = end;
  301. smp_call_function(flush_tlb_range_ipi, (void *)&fd, 1, 1);
  302. } else {
  303. int i;
  304. for (i = 0; i < num_online_cpus(); i++)
  305. if (smp_processor_id() != i)
  306. cpu_context(i, mm) = 0;
  307. }
  308. local_flush_tlb_range(vma, start, end);
  309. preempt_enable();
  310. }
  311. static void flush_tlb_kernel_range_ipi(void *info)
  312. {
  313. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  314. local_flush_tlb_kernel_range(fd->addr1, fd->addr2);
  315. }
  316. void flush_tlb_kernel_range(unsigned long start, unsigned long end)
  317. {
  318. struct flush_tlb_data fd;
  319. fd.addr1 = start;
  320. fd.addr2 = end;
  321. on_each_cpu(flush_tlb_kernel_range_ipi, (void *)&fd, 1, 1);
  322. }
  323. static void flush_tlb_page_ipi(void *info)
  324. {
  325. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  326. local_flush_tlb_page(fd->vma, fd->addr1);
  327. }
  328. void flush_tlb_page(struct vm_area_struct *vma, unsigned long page)
  329. {
  330. preempt_disable();
  331. if ((atomic_read(&vma->vm_mm->mm_users) != 1) || (current->mm != vma->vm_mm)) {
  332. struct flush_tlb_data fd;
  333. fd.vma = vma;
  334. fd.addr1 = page;
  335. smp_call_function(flush_tlb_page_ipi, (void *)&fd, 1, 1);
  336. } else {
  337. int i;
  338. for (i = 0; i < num_online_cpus(); i++)
  339. if (smp_processor_id() != i)
  340. cpu_context(i, vma->vm_mm) = 0;
  341. }
  342. local_flush_tlb_page(vma, page);
  343. preempt_enable();
  344. }
  345. static void flush_tlb_one_ipi(void *info)
  346. {
  347. unsigned long vaddr = (unsigned long) info;
  348. local_flush_tlb_one(vaddr);
  349. }
  350. void flush_tlb_one(unsigned long vaddr)
  351. {
  352. smp_call_function(flush_tlb_one_ipi, (void *) vaddr, 1, 1);
  353. local_flush_tlb_one(vaddr);
  354. }
  355. EXPORT_SYMBOL(flush_tlb_page);
  356. EXPORT_SYMBOL(flush_tlb_one);
  357. EXPORT_SYMBOL(cpu_data);
  358. EXPORT_SYMBOL(synchronize_irq);