smp.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428
  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 cpu_khz;
  50. /*
  51. * Crude estimate until we actually meassure ...
  52. */
  53. cpu_khz = loops_per_jiffy * 2 * HZ / 1000;
  54. /*
  55. * Rough estimation for SMP scheduling, this is the number of
  56. * cycles it takes for a fully memory-limited process to flush
  57. * the SMP-local cache.
  58. *
  59. * (For a P5 this pretty much means we will choose another idle
  60. * CPU almost always at wakeup time (this is due to the small
  61. * L1 cache), on PIIs it's around 50-100 usecs, depending on
  62. * the cache size)
  63. */
  64. if (!cpu_khz)
  65. return;
  66. cachesize = cd->linesz * cd->sets * cd->ways;
  67. }
  68. extern void __init calibrate_delay(void);
  69. extern ATTRIB_NORET void cpu_idle(void);
  70. /*
  71. * First C code run on the secondary CPUs after being started up by
  72. * the master.
  73. */
  74. asmlinkage void start_secondary(void)
  75. {
  76. unsigned int cpu = smp_processor_id();
  77. cpu_probe();
  78. cpu_report();
  79. per_cpu_trap_init();
  80. prom_init_secondary();
  81. /*
  82. * XXX parity protection should be folded in here when it's converted
  83. * to an option instead of something based on .cputype
  84. */
  85. calibrate_delay();
  86. cpu_data[cpu].udelay_val = loops_per_jiffy;
  87. prom_smp_finish();
  88. cpu_set(cpu, cpu_callin_map);
  89. cpu_idle();
  90. }
  91. DEFINE_SPINLOCK(smp_call_lock);
  92. struct call_data_struct *call_data;
  93. /*
  94. * Run a function on all other CPUs.
  95. * <func> The function to run. This must be fast and non-blocking.
  96. * <info> An arbitrary pointer to pass to the function.
  97. * <retry> If true, keep retrying until ready.
  98. * <wait> If true, wait until function has completed on other CPUs.
  99. * [RETURNS] 0 on success, else a negative status code.
  100. *
  101. * Does not return until remote CPUs are nearly ready to execute <func>
  102. * or are or have executed.
  103. *
  104. * You must not call this function with disabled interrupts or from a
  105. * hardware interrupt handler or from a bottom half handler:
  106. *
  107. * CPU A CPU B
  108. * Disable interrupts
  109. * smp_call_function()
  110. * Take call_lock
  111. * Send IPIs
  112. * Wait for all cpus to acknowledge IPI
  113. * CPU A has not responded, spin waiting
  114. * for cpu A to respond, holding call_lock
  115. * smp_call_function()
  116. * Spin waiting for call_lock
  117. * Deadlock Deadlock
  118. */
  119. int smp_call_function (void (*func) (void *info), void *info, int retry,
  120. int wait)
  121. {
  122. struct call_data_struct data;
  123. int i, cpus = num_online_cpus() - 1;
  124. int cpu = smp_processor_id();
  125. /*
  126. * Can die spectacularly if this CPU isn't yet marked online
  127. */
  128. BUG_ON(!cpu_online(cpu));
  129. if (!cpus)
  130. return 0;
  131. /* Can deadlock when called with interrupts disabled */
  132. WARN_ON(irqs_disabled());
  133. data.func = func;
  134. data.info = info;
  135. atomic_set(&data.started, 0);
  136. data.wait = wait;
  137. if (wait)
  138. atomic_set(&data.finished, 0);
  139. spin_lock(&smp_call_lock);
  140. call_data = &data;
  141. mb();
  142. /* Send a message to all other CPUs and wait for them to respond */
  143. for (i = 0; i < NR_CPUS; i++)
  144. if (cpu_online(i) && i != cpu)
  145. core_send_ipi(i, SMP_CALL_FUNCTION);
  146. /* Wait for response */
  147. /* FIXME: lock-up detection, backtrace on lock-up */
  148. while (atomic_read(&data.started) != cpus)
  149. barrier();
  150. if (wait)
  151. while (atomic_read(&data.finished) != cpus)
  152. barrier();
  153. spin_unlock(&smp_call_lock);
  154. return 0;
  155. }
  156. void smp_call_function_interrupt(void)
  157. {
  158. void (*func) (void *info) = call_data->func;
  159. void *info = call_data->info;
  160. int wait = call_data->wait;
  161. /*
  162. * Notify initiating CPU that I've grabbed the data and am
  163. * about to execute the function.
  164. */
  165. mb();
  166. atomic_inc(&call_data->started);
  167. /*
  168. * At this point the info structure may be out of scope unless wait==1.
  169. */
  170. irq_enter();
  171. (*func)(info);
  172. irq_exit();
  173. if (wait) {
  174. mb();
  175. atomic_inc(&call_data->finished);
  176. }
  177. }
  178. static void stop_this_cpu(void *dummy)
  179. {
  180. /*
  181. * Remove this CPU:
  182. */
  183. cpu_clear(smp_processor_id(), cpu_online_map);
  184. local_irq_enable(); /* May need to service _machine_restart IPI */
  185. for (;;); /* Wait if available. */
  186. }
  187. void smp_send_stop(void)
  188. {
  189. smp_call_function(stop_this_cpu, NULL, 1, 0);
  190. }
  191. void __init smp_cpus_done(unsigned int max_cpus)
  192. {
  193. prom_cpus_done();
  194. }
  195. /* called from main before smp_init() */
  196. void __init smp_prepare_cpus(unsigned int max_cpus)
  197. {
  198. init_new_context(current, &init_mm);
  199. current_thread_info()->cpu = 0;
  200. smp_tune_scheduling();
  201. prom_prepare_cpus(max_cpus);
  202. }
  203. /* preload SMP state for boot cpu */
  204. void __devinit smp_prepare_boot_cpu(void)
  205. {
  206. /*
  207. * This assumes that bootup is always handled by the processor
  208. * with the logic and physical number 0.
  209. */
  210. __cpu_number_map[0] = 0;
  211. __cpu_logical_map[0] = 0;
  212. cpu_set(0, phys_cpu_present_map);
  213. cpu_set(0, cpu_online_map);
  214. cpu_set(0, cpu_callin_map);
  215. }
  216. /*
  217. * Called once for each "cpu_possible(cpu)". Needs to spin up the cpu
  218. * and keep control until "cpu_online(cpu)" is set. Note: cpu is
  219. * physical, not logical.
  220. */
  221. int __devinit __cpu_up(unsigned int cpu)
  222. {
  223. struct task_struct *idle;
  224. /*
  225. * Processor goes to start_secondary(), sets online flag
  226. * The following code is purely to make sure
  227. * Linux can schedule processes on this slave.
  228. */
  229. idle = fork_idle(cpu);
  230. if (IS_ERR(idle))
  231. panic(KERN_ERR "Fork failed for CPU %d", cpu);
  232. prom_boot_secondary(cpu, idle);
  233. /*
  234. * Trust is futile. We should really have timeouts ...
  235. */
  236. while (!cpu_isset(cpu, cpu_callin_map))
  237. udelay(100);
  238. cpu_set(cpu, cpu_online_map);
  239. return 0;
  240. }
  241. /* Not really SMP stuff ... */
  242. int setup_profiling_timer(unsigned int multiplier)
  243. {
  244. return 0;
  245. }
  246. static void flush_tlb_all_ipi(void *info)
  247. {
  248. local_flush_tlb_all();
  249. }
  250. void flush_tlb_all(void)
  251. {
  252. on_each_cpu(flush_tlb_all_ipi, 0, 1, 1);
  253. }
  254. static void flush_tlb_mm_ipi(void *mm)
  255. {
  256. local_flush_tlb_mm((struct mm_struct *)mm);
  257. }
  258. /*
  259. * The following tlb flush calls are invoked when old translations are
  260. * being torn down, or pte attributes are changing. For single threaded
  261. * address spaces, a new context is obtained on the current cpu, and tlb
  262. * context on other cpus are invalidated to force a new context allocation
  263. * at switch_mm time, should the mm ever be used on other cpus. For
  264. * multithreaded address spaces, intercpu interrupts have to be sent.
  265. * Another case where intercpu interrupts are required is when the target
  266. * mm might be active on another cpu (eg debuggers doing the flushes on
  267. * behalf of debugees, kswapd stealing pages from another process etc).
  268. * Kanoj 07/00.
  269. */
  270. void flush_tlb_mm(struct mm_struct *mm)
  271. {
  272. preempt_disable();
  273. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  274. smp_call_function(flush_tlb_mm_ipi, (void *)mm, 1, 1);
  275. } else {
  276. int i;
  277. for (i = 0; i < num_online_cpus(); i++)
  278. if (smp_processor_id() != i)
  279. cpu_context(i, mm) = 0;
  280. }
  281. local_flush_tlb_mm(mm);
  282. preempt_enable();
  283. }
  284. struct flush_tlb_data {
  285. struct vm_area_struct *vma;
  286. unsigned long addr1;
  287. unsigned long addr2;
  288. };
  289. static void flush_tlb_range_ipi(void *info)
  290. {
  291. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  292. local_flush_tlb_range(fd->vma, fd->addr1, fd->addr2);
  293. }
  294. void flush_tlb_range(struct vm_area_struct *vma, unsigned long start, unsigned long end)
  295. {
  296. struct mm_struct *mm = vma->vm_mm;
  297. preempt_disable();
  298. if ((atomic_read(&mm->mm_users) != 1) || (current->mm != mm)) {
  299. struct flush_tlb_data fd;
  300. fd.vma = vma;
  301. fd.addr1 = start;
  302. fd.addr2 = end;
  303. smp_call_function(flush_tlb_range_ipi, (void *)&fd, 1, 1);
  304. } else {
  305. int i;
  306. for (i = 0; i < num_online_cpus(); i++)
  307. if (smp_processor_id() != i)
  308. cpu_context(i, mm) = 0;
  309. }
  310. local_flush_tlb_range(vma, start, end);
  311. preempt_enable();
  312. }
  313. static void flush_tlb_kernel_range_ipi(void *info)
  314. {
  315. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  316. local_flush_tlb_kernel_range(fd->addr1, fd->addr2);
  317. }
  318. void flush_tlb_kernel_range(unsigned long start, unsigned long end)
  319. {
  320. struct flush_tlb_data fd;
  321. fd.addr1 = start;
  322. fd.addr2 = end;
  323. on_each_cpu(flush_tlb_kernel_range_ipi, (void *)&fd, 1, 1);
  324. }
  325. static void flush_tlb_page_ipi(void *info)
  326. {
  327. struct flush_tlb_data *fd = (struct flush_tlb_data *)info;
  328. local_flush_tlb_page(fd->vma, fd->addr1);
  329. }
  330. void flush_tlb_page(struct vm_area_struct *vma, unsigned long page)
  331. {
  332. preempt_disable();
  333. if ((atomic_read(&vma->vm_mm->mm_users) != 1) || (current->mm != vma->vm_mm)) {
  334. struct flush_tlb_data fd;
  335. fd.vma = vma;
  336. fd.addr1 = page;
  337. smp_call_function(flush_tlb_page_ipi, (void *)&fd, 1, 1);
  338. } else {
  339. int i;
  340. for (i = 0; i < num_online_cpus(); i++)
  341. if (smp_processor_id() != i)
  342. cpu_context(i, vma->vm_mm) = 0;
  343. }
  344. local_flush_tlb_page(vma, page);
  345. preempt_enable();
  346. }
  347. static void flush_tlb_one_ipi(void *info)
  348. {
  349. unsigned long vaddr = (unsigned long) info;
  350. local_flush_tlb_one(vaddr);
  351. }
  352. void flush_tlb_one(unsigned long vaddr)
  353. {
  354. smp_call_function(flush_tlb_one_ipi, (void *) vaddr, 1, 1);
  355. local_flush_tlb_one(vaddr);
  356. }
  357. EXPORT_SYMBOL(flush_tlb_page);
  358. EXPORT_SYMBOL(flush_tlb_one);
  359. EXPORT_SYMBOL(cpu_data);
  360. EXPORT_SYMBOL(synchronize_irq);