process.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514
  1. /*
  2. * Blackfin architecture-dependent process handling
  3. *
  4. * Copyright 2004-2009 Analog Devices Inc.
  5. *
  6. * Licensed under the GPL-2 or later
  7. */
  8. #include <linux/module.h>
  9. #include <linux/unistd.h>
  10. #include <linux/user.h>
  11. #include <linux/uaccess.h>
  12. #include <linux/slab.h>
  13. #include <linux/sched.h>
  14. #include <linux/tick.h>
  15. #include <linux/fs.h>
  16. #include <linux/err.h>
  17. #include <asm/blackfin.h>
  18. #include <asm/fixed_code.h>
  19. #include <asm/mem_map.h>
  20. #include <asm/irq.h>
  21. asmlinkage void ret_from_fork(void);
  22. /* Points to the SDRAM backup memory for the stack that is currently in
  23. * L1 scratchpad memory.
  24. */
  25. void *current_l1_stack_save;
  26. /* The number of tasks currently using a L1 stack area. The SRAM is
  27. * allocated/deallocated whenever this changes from/to zero.
  28. */
  29. int nr_l1stack_tasks;
  30. /* Start and length of the area in L1 scratchpad memory which we've allocated
  31. * for process stacks.
  32. */
  33. void *l1_stack_base;
  34. unsigned long l1_stack_len;
  35. /*
  36. * Powermanagement idle function, if any..
  37. */
  38. void (*pm_idle)(void) = NULL;
  39. EXPORT_SYMBOL(pm_idle);
  40. void (*pm_power_off)(void) = NULL;
  41. EXPORT_SYMBOL(pm_power_off);
  42. /*
  43. * The idle loop on BFIN
  44. */
  45. #ifdef CONFIG_IDLE_L1
  46. static void default_idle(void)__attribute__((l1_text));
  47. void cpu_idle(void)__attribute__((l1_text));
  48. #endif
  49. /*
  50. * This is our default idle handler. We need to disable
  51. * interrupts here to ensure we don't miss a wakeup call.
  52. */
  53. static void default_idle(void)
  54. {
  55. #ifdef CONFIG_IPIPE
  56. ipipe_suspend_domain();
  57. #endif
  58. hard_local_irq_disable();
  59. if (!need_resched())
  60. idle_with_irq_disabled();
  61. hard_local_irq_enable();
  62. }
  63. /*
  64. * The idle thread. We try to conserve power, while trying to keep
  65. * overall latency low. The architecture specific idle is passed
  66. * a value to indicate the level of "idleness" of the system.
  67. */
  68. void cpu_idle(void)
  69. {
  70. /* endless idle loop with no priority at all */
  71. while (1) {
  72. void (*idle)(void) = pm_idle;
  73. #ifdef CONFIG_HOTPLUG_CPU
  74. if (cpu_is_offline(smp_processor_id()))
  75. cpu_die();
  76. #endif
  77. if (!idle)
  78. idle = default_idle;
  79. tick_nohz_idle_enter();
  80. rcu_idle_enter();
  81. while (!need_resched())
  82. idle();
  83. rcu_idle_exit();
  84. tick_nohz_idle_exit();
  85. schedule_preempt_disabled();
  86. }
  87. }
  88. /*
  89. * This gets run with P1 containing the
  90. * function to call, and R1 containing
  91. * the "args". Note P0 is clobbered on the way here.
  92. */
  93. void kernel_thread_helper(void);
  94. __asm__(".section .text\n"
  95. ".align 4\n"
  96. "_kernel_thread_helper:\n\t"
  97. "\tsp += -12;\n\t"
  98. "\tr0 = r1;\n\t" "\tcall (p1);\n\t" "\tcall _do_exit;\n" ".previous");
  99. /*
  100. * Create a kernel thread.
  101. */
  102. pid_t kernel_thread(int (*fn) (void *), void *arg, unsigned long flags)
  103. {
  104. struct pt_regs regs;
  105. memset(&regs, 0, sizeof(regs));
  106. regs.r1 = (unsigned long)arg;
  107. regs.p1 = (unsigned long)fn;
  108. regs.pc = (unsigned long)kernel_thread_helper;
  109. regs.orig_p0 = -1;
  110. /* Set bit 2 to tell ret_from_fork we should be returning to kernel
  111. mode. */
  112. regs.ipend = 0x8002;
  113. __asm__ __volatile__("%0 = syscfg;":"=da"(regs.syscfg):);
  114. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL,
  115. NULL);
  116. }
  117. EXPORT_SYMBOL(kernel_thread);
  118. /*
  119. * Do necessary setup to start up a newly executed thread.
  120. *
  121. * pass the data segment into user programs if it exists,
  122. * it can't hurt anything as far as I can tell
  123. */
  124. void start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
  125. {
  126. regs->pc = new_ip;
  127. if (current->mm)
  128. regs->p5 = current->mm->start_data;
  129. #ifndef CONFIG_SMP
  130. task_thread_info(current)->l1_task_info.stack_start =
  131. (void *)current->mm->context.stack_start;
  132. task_thread_info(current)->l1_task_info.lowest_sp = (void *)new_sp;
  133. memcpy(L1_SCRATCH_TASK_INFO, &task_thread_info(current)->l1_task_info,
  134. sizeof(*L1_SCRATCH_TASK_INFO));
  135. #endif
  136. wrusp(new_sp);
  137. }
  138. EXPORT_SYMBOL_GPL(start_thread);
  139. void flush_thread(void)
  140. {
  141. }
  142. asmlinkage int bfin_vfork(struct pt_regs *regs)
  143. {
  144. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, rdusp(), regs, 0, NULL,
  145. NULL);
  146. }
  147. asmlinkage int bfin_clone(struct pt_regs *regs)
  148. {
  149. unsigned long clone_flags;
  150. unsigned long newsp;
  151. #ifdef __ARCH_SYNC_CORE_DCACHE
  152. if (current->nr_cpus_allowed == num_possible_cpus())
  153. set_cpus_allowed_ptr(current, cpumask_of(smp_processor_id()));
  154. #endif
  155. /* syscall2 puts clone_flags in r0 and usp in r1 */
  156. clone_flags = regs->r0;
  157. newsp = regs->r1;
  158. if (!newsp)
  159. newsp = rdusp();
  160. else
  161. newsp -= 12;
  162. return do_fork(clone_flags, newsp, regs, 0, NULL, NULL);
  163. }
  164. int
  165. copy_thread(unsigned long clone_flags,
  166. unsigned long usp, unsigned long topstk,
  167. struct task_struct *p, struct pt_regs *regs)
  168. {
  169. struct pt_regs *childregs;
  170. childregs = (struct pt_regs *) (task_stack_page(p) + THREAD_SIZE) - 1;
  171. *childregs = *regs;
  172. childregs->r0 = 0;
  173. p->thread.usp = usp;
  174. p->thread.ksp = (unsigned long)childregs;
  175. p->thread.pc = (unsigned long)ret_from_fork;
  176. return 0;
  177. }
  178. /*
  179. * sys_execve() executes a new program.
  180. */
  181. asmlinkage int sys_execve(const char __user *name,
  182. const char __user *const __user *argv,
  183. const char __user *const __user *envp)
  184. {
  185. int error;
  186. char *filename;
  187. struct pt_regs *regs = (struct pt_regs *)((&name) + 6);
  188. filename = getname(name);
  189. error = PTR_ERR(filename);
  190. if (IS_ERR(filename))
  191. return error;
  192. error = do_execve(filename, argv, envp, regs);
  193. putname(filename);
  194. return error;
  195. }
  196. unsigned long get_wchan(struct task_struct *p)
  197. {
  198. unsigned long fp, pc;
  199. unsigned long stack_page;
  200. int count = 0;
  201. if (!p || p == current || p->state == TASK_RUNNING)
  202. return 0;
  203. stack_page = (unsigned long)p;
  204. fp = p->thread.usp;
  205. do {
  206. if (fp < stack_page + sizeof(struct thread_info) ||
  207. fp >= 8184 + stack_page)
  208. return 0;
  209. pc = ((unsigned long *)fp)[1];
  210. if (!in_sched_functions(pc))
  211. return pc;
  212. fp = *(unsigned long *)fp;
  213. }
  214. while (count++ < 16);
  215. return 0;
  216. }
  217. void finish_atomic_sections (struct pt_regs *regs)
  218. {
  219. int __user *up0 = (int __user *)regs->p0;
  220. switch (regs->pc) {
  221. default:
  222. /* not in middle of an atomic step, so resume like normal */
  223. return;
  224. case ATOMIC_XCHG32 + 2:
  225. put_user(regs->r1, up0);
  226. break;
  227. case ATOMIC_CAS32 + 2:
  228. case ATOMIC_CAS32 + 4:
  229. if (regs->r0 == regs->r1)
  230. case ATOMIC_CAS32 + 6:
  231. put_user(regs->r2, up0);
  232. break;
  233. case ATOMIC_ADD32 + 2:
  234. regs->r0 = regs->r1 + regs->r0;
  235. /* fall through */
  236. case ATOMIC_ADD32 + 4:
  237. put_user(regs->r0, up0);
  238. break;
  239. case ATOMIC_SUB32 + 2:
  240. regs->r0 = regs->r1 - regs->r0;
  241. /* fall through */
  242. case ATOMIC_SUB32 + 4:
  243. put_user(regs->r0, up0);
  244. break;
  245. case ATOMIC_IOR32 + 2:
  246. regs->r0 = regs->r1 | regs->r0;
  247. /* fall through */
  248. case ATOMIC_IOR32 + 4:
  249. put_user(regs->r0, up0);
  250. break;
  251. case ATOMIC_AND32 + 2:
  252. regs->r0 = regs->r1 & regs->r0;
  253. /* fall through */
  254. case ATOMIC_AND32 + 4:
  255. put_user(regs->r0, up0);
  256. break;
  257. case ATOMIC_XOR32 + 2:
  258. regs->r0 = regs->r1 ^ regs->r0;
  259. /* fall through */
  260. case ATOMIC_XOR32 + 4:
  261. put_user(regs->r0, up0);
  262. break;
  263. }
  264. /*
  265. * We've finished the atomic section, and the only thing left for
  266. * userspace is to do a RTS, so we might as well handle that too
  267. * since we need to update the PC anyways.
  268. */
  269. regs->pc = regs->rets;
  270. }
  271. static inline
  272. int in_mem(unsigned long addr, unsigned long size,
  273. unsigned long start, unsigned long end)
  274. {
  275. return addr >= start && addr + size <= end;
  276. }
  277. static inline
  278. int in_mem_const_off(unsigned long addr, unsigned long size, unsigned long off,
  279. unsigned long const_addr, unsigned long const_size)
  280. {
  281. return const_size &&
  282. in_mem(addr, size, const_addr + off, const_addr + const_size);
  283. }
  284. static inline
  285. int in_mem_const(unsigned long addr, unsigned long size,
  286. unsigned long const_addr, unsigned long const_size)
  287. {
  288. return in_mem_const_off(addr, size, 0, const_addr, const_size);
  289. }
  290. #define ASYNC_ENABLED(bnum, bctlnum) \
  291. ({ \
  292. (bfin_read_EBIU_AMGCTL() & 0xe) < ((bnum + 1) << 1) ? 0 : \
  293. bfin_read_EBIU_AMBCTL##bctlnum() & B##bnum##RDYEN ? 0 : \
  294. 1; \
  295. })
  296. /*
  297. * We can't read EBIU banks that aren't enabled or we end up hanging
  298. * on the access to the async space. Make sure we validate accesses
  299. * that cross async banks too.
  300. * 0 - found, but unusable
  301. * 1 - found & usable
  302. * 2 - not found
  303. */
  304. static
  305. int in_async(unsigned long addr, unsigned long size)
  306. {
  307. if (addr >= ASYNC_BANK0_BASE && addr < ASYNC_BANK0_BASE + ASYNC_BANK0_SIZE) {
  308. if (!ASYNC_ENABLED(0, 0))
  309. return 0;
  310. if (addr + size <= ASYNC_BANK0_BASE + ASYNC_BANK0_SIZE)
  311. return 1;
  312. size -= ASYNC_BANK0_BASE + ASYNC_BANK0_SIZE - addr;
  313. addr = ASYNC_BANK0_BASE + ASYNC_BANK0_SIZE;
  314. }
  315. if (addr >= ASYNC_BANK1_BASE && addr < ASYNC_BANK1_BASE + ASYNC_BANK1_SIZE) {
  316. if (!ASYNC_ENABLED(1, 0))
  317. return 0;
  318. if (addr + size <= ASYNC_BANK1_BASE + ASYNC_BANK1_SIZE)
  319. return 1;
  320. size -= ASYNC_BANK1_BASE + ASYNC_BANK1_SIZE - addr;
  321. addr = ASYNC_BANK1_BASE + ASYNC_BANK1_SIZE;
  322. }
  323. if (addr >= ASYNC_BANK2_BASE && addr < ASYNC_BANK2_BASE + ASYNC_BANK2_SIZE) {
  324. if (!ASYNC_ENABLED(2, 1))
  325. return 0;
  326. if (addr + size <= ASYNC_BANK2_BASE + ASYNC_BANK2_SIZE)
  327. return 1;
  328. size -= ASYNC_BANK2_BASE + ASYNC_BANK2_SIZE - addr;
  329. addr = ASYNC_BANK2_BASE + ASYNC_BANK2_SIZE;
  330. }
  331. if (addr >= ASYNC_BANK3_BASE && addr < ASYNC_BANK3_BASE + ASYNC_BANK3_SIZE) {
  332. if (ASYNC_ENABLED(3, 1))
  333. return 0;
  334. if (addr + size <= ASYNC_BANK3_BASE + ASYNC_BANK3_SIZE)
  335. return 1;
  336. return 0;
  337. }
  338. /* not within async bounds */
  339. return 2;
  340. }
  341. int bfin_mem_access_type(unsigned long addr, unsigned long size)
  342. {
  343. int cpu = raw_smp_processor_id();
  344. /* Check that things do not wrap around */
  345. if (addr > ULONG_MAX - size)
  346. return -EFAULT;
  347. if (in_mem(addr, size, FIXED_CODE_START, physical_mem_end))
  348. return BFIN_MEM_ACCESS_CORE;
  349. if (in_mem_const(addr, size, L1_CODE_START, L1_CODE_LENGTH))
  350. return cpu == 0 ? BFIN_MEM_ACCESS_ITEST : BFIN_MEM_ACCESS_IDMA;
  351. if (in_mem_const(addr, size, L1_SCRATCH_START, L1_SCRATCH_LENGTH))
  352. return cpu == 0 ? BFIN_MEM_ACCESS_CORE_ONLY : -EFAULT;
  353. if (in_mem_const(addr, size, L1_DATA_A_START, L1_DATA_A_LENGTH))
  354. return cpu == 0 ? BFIN_MEM_ACCESS_CORE : BFIN_MEM_ACCESS_IDMA;
  355. if (in_mem_const(addr, size, L1_DATA_B_START, L1_DATA_B_LENGTH))
  356. return cpu == 0 ? BFIN_MEM_ACCESS_CORE : BFIN_MEM_ACCESS_IDMA;
  357. #ifdef COREB_L1_CODE_START
  358. if (in_mem_const(addr, size, COREB_L1_CODE_START, COREB_L1_CODE_LENGTH))
  359. return cpu == 1 ? BFIN_MEM_ACCESS_ITEST : BFIN_MEM_ACCESS_IDMA;
  360. if (in_mem_const(addr, size, COREB_L1_SCRATCH_START, L1_SCRATCH_LENGTH))
  361. return cpu == 1 ? BFIN_MEM_ACCESS_CORE_ONLY : -EFAULT;
  362. if (in_mem_const(addr, size, COREB_L1_DATA_A_START, COREB_L1_DATA_A_LENGTH))
  363. return cpu == 1 ? BFIN_MEM_ACCESS_CORE : BFIN_MEM_ACCESS_IDMA;
  364. if (in_mem_const(addr, size, COREB_L1_DATA_B_START, COREB_L1_DATA_B_LENGTH))
  365. return cpu == 1 ? BFIN_MEM_ACCESS_CORE : BFIN_MEM_ACCESS_IDMA;
  366. #endif
  367. if (in_mem_const(addr, size, L2_START, L2_LENGTH))
  368. return BFIN_MEM_ACCESS_CORE;
  369. if (addr >= SYSMMR_BASE)
  370. return BFIN_MEM_ACCESS_CORE_ONLY;
  371. switch (in_async(addr, size)) {
  372. case 0: return -EFAULT;
  373. case 1: return BFIN_MEM_ACCESS_CORE;
  374. case 2: /* fall through */;
  375. }
  376. if (in_mem_const(addr, size, BOOT_ROM_START, BOOT_ROM_LENGTH))
  377. return BFIN_MEM_ACCESS_CORE;
  378. if (in_mem_const(addr, size, L1_ROM_START, L1_ROM_LENGTH))
  379. return BFIN_MEM_ACCESS_DMA;
  380. return -EFAULT;
  381. }
  382. #if defined(CONFIG_ACCESS_CHECK)
  383. #ifdef CONFIG_ACCESS_OK_L1
  384. __attribute__((l1_text))
  385. #endif
  386. /* Return 1 if access to memory range is OK, 0 otherwise */
  387. int _access_ok(unsigned long addr, unsigned long size)
  388. {
  389. int aret;
  390. if (size == 0)
  391. return 1;
  392. /* Check that things do not wrap around */
  393. if (addr > ULONG_MAX - size)
  394. return 0;
  395. if (segment_eq(get_fs(), KERNEL_DS))
  396. return 1;
  397. #ifdef CONFIG_MTD_UCLINUX
  398. if (1)
  399. #else
  400. if (0)
  401. #endif
  402. {
  403. if (in_mem(addr, size, memory_start, memory_end))
  404. return 1;
  405. if (in_mem(addr, size, memory_mtd_end, physical_mem_end))
  406. return 1;
  407. # ifndef CONFIG_ROMFS_ON_MTD
  408. if (0)
  409. # endif
  410. /* For XIP, allow user space to use pointers within the ROMFS. */
  411. if (in_mem(addr, size, memory_mtd_start, memory_mtd_end))
  412. return 1;
  413. } else {
  414. if (in_mem(addr, size, memory_start, physical_mem_end))
  415. return 1;
  416. }
  417. if (in_mem(addr, size, (unsigned long)__init_begin, (unsigned long)__init_end))
  418. return 1;
  419. if (in_mem_const(addr, size, L1_CODE_START, L1_CODE_LENGTH))
  420. return 1;
  421. if (in_mem_const_off(addr, size, _etext_l1 - _stext_l1, L1_CODE_START, L1_CODE_LENGTH))
  422. return 1;
  423. if (in_mem_const_off(addr, size, _ebss_l1 - _sdata_l1, L1_DATA_A_START, L1_DATA_A_LENGTH))
  424. return 1;
  425. if (in_mem_const_off(addr, size, _ebss_b_l1 - _sdata_b_l1, L1_DATA_B_START, L1_DATA_B_LENGTH))
  426. return 1;
  427. #ifdef COREB_L1_CODE_START
  428. if (in_mem_const(addr, size, COREB_L1_CODE_START, COREB_L1_CODE_LENGTH))
  429. return 1;
  430. if (in_mem_const(addr, size, COREB_L1_SCRATCH_START, L1_SCRATCH_LENGTH))
  431. return 1;
  432. if (in_mem_const(addr, size, COREB_L1_DATA_A_START, COREB_L1_DATA_A_LENGTH))
  433. return 1;
  434. if (in_mem_const(addr, size, COREB_L1_DATA_B_START, COREB_L1_DATA_B_LENGTH))
  435. return 1;
  436. #endif
  437. #ifndef CONFIG_EXCEPTION_L1_SCRATCH
  438. if (in_mem_const(addr, size, (unsigned long)l1_stack_base, l1_stack_len))
  439. return 1;
  440. #endif
  441. aret = in_async(addr, size);
  442. if (aret < 2)
  443. return aret;
  444. if (in_mem_const_off(addr, size, _ebss_l2 - _stext_l2, L2_START, L2_LENGTH))
  445. return 1;
  446. if (in_mem_const(addr, size, BOOT_ROM_START, BOOT_ROM_LENGTH))
  447. return 1;
  448. if (in_mem_const(addr, size, L1_ROM_START, L1_ROM_LENGTH))
  449. return 1;
  450. return 0;
  451. }
  452. EXPORT_SYMBOL(_access_ok);
  453. #endif /* CONFIG_ACCESS_CHECK */