process.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. /*
  2. * File: arch/blackfin/kernel/process.c
  3. * Based on:
  4. * Author:
  5. *
  6. * Created:
  7. * Description: Blackfin architecture-dependent process handling.
  8. *
  9. * Modified:
  10. * Copyright 2004-2006 Analog Devices Inc.
  11. *
  12. * Bugs: Enter bugs at http://blackfin.uclinux.org/
  13. *
  14. * This program is free software; you can redistribute it and/or modify
  15. * it under the terms of the GNU General Public License as published by
  16. * the Free Software Foundation; either version 2 of the License, or
  17. * (at your option) any later version.
  18. *
  19. * This program is distributed in the hope that it will be useful,
  20. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  21. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  22. * GNU General Public License for more details.
  23. *
  24. * You should have received a copy of the GNU General Public License
  25. * along with this program; if not, see the file COPYING, or write
  26. * to the Free Software Foundation, Inc.,
  27. * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  28. */
  29. #include <linux/module.h>
  30. #include <linux/smp_lock.h>
  31. #include <linux/unistd.h>
  32. #include <linux/user.h>
  33. #include <linux/uaccess.h>
  34. #include <linux/sched.h>
  35. #include <linux/tick.h>
  36. #include <linux/fs.h>
  37. #include <linux/err.h>
  38. #include <asm/blackfin.h>
  39. #include <asm/fixed_code.h>
  40. #include <asm/mem_map.h>
  41. asmlinkage void ret_from_fork(void);
  42. /* Points to the SDRAM backup memory for the stack that is currently in
  43. * L1 scratchpad memory.
  44. */
  45. void *current_l1_stack_save;
  46. /* The number of tasks currently using a L1 stack area. The SRAM is
  47. * allocated/deallocated whenever this changes from/to zero.
  48. */
  49. int nr_l1stack_tasks;
  50. /* Start and length of the area in L1 scratchpad memory which we've allocated
  51. * for process stacks.
  52. */
  53. void *l1_stack_base;
  54. unsigned long l1_stack_len;
  55. /*
  56. * Powermanagement idle function, if any..
  57. */
  58. void (*pm_idle)(void) = NULL;
  59. EXPORT_SYMBOL(pm_idle);
  60. void (*pm_power_off)(void) = NULL;
  61. EXPORT_SYMBOL(pm_power_off);
  62. /*
  63. * The idle loop on BFIN
  64. */
  65. #ifdef CONFIG_IDLE_L1
  66. static void default_idle(void)__attribute__((l1_text));
  67. void cpu_idle(void)__attribute__((l1_text));
  68. #endif
  69. /*
  70. * This is our default idle handler. We need to disable
  71. * interrupts here to ensure we don't miss a wakeup call.
  72. */
  73. static void default_idle(void)
  74. {
  75. #ifdef CONFIG_IPIPE
  76. ipipe_suspend_domain();
  77. #endif
  78. local_irq_disable_hw();
  79. if (!need_resched())
  80. idle_with_irq_disabled();
  81. local_irq_enable_hw();
  82. }
  83. /*
  84. * The idle thread. We try to conserve power, while trying to keep
  85. * overall latency low. The architecture specific idle is passed
  86. * a value to indicate the level of "idleness" of the system.
  87. */
  88. void cpu_idle(void)
  89. {
  90. /* endless idle loop with no priority at all */
  91. while (1) {
  92. void (*idle)(void) = pm_idle;
  93. #ifdef CONFIG_HOTPLUG_CPU
  94. if (cpu_is_offline(smp_processor_id()))
  95. cpu_die();
  96. #endif
  97. if (!idle)
  98. idle = default_idle;
  99. tick_nohz_stop_sched_tick(1);
  100. while (!need_resched())
  101. idle();
  102. tick_nohz_restart_sched_tick();
  103. preempt_enable_no_resched();
  104. schedule();
  105. preempt_disable();
  106. }
  107. }
  108. /* Fill in the fpu structure for a core dump. */
  109. int dump_fpu(struct pt_regs *regs, elf_fpregset_t * fpregs)
  110. {
  111. return 1;
  112. }
  113. /*
  114. * This gets run with P1 containing the
  115. * function to call, and R1 containing
  116. * the "args". Note P0 is clobbered on the way here.
  117. */
  118. void kernel_thread_helper(void);
  119. __asm__(".section .text\n"
  120. ".align 4\n"
  121. "_kernel_thread_helper:\n\t"
  122. "\tsp += -12;\n\t"
  123. "\tr0 = r1;\n\t" "\tcall (p1);\n\t" "\tcall _do_exit;\n" ".previous");
  124. /*
  125. * Create a kernel thread.
  126. */
  127. pid_t kernel_thread(int (*fn) (void *), void *arg, unsigned long flags)
  128. {
  129. struct pt_regs regs;
  130. memset(&regs, 0, sizeof(regs));
  131. regs.r1 = (unsigned long)arg;
  132. regs.p1 = (unsigned long)fn;
  133. regs.pc = (unsigned long)kernel_thread_helper;
  134. regs.orig_p0 = -1;
  135. /* Set bit 2 to tell ret_from_fork we should be returning to kernel
  136. mode. */
  137. regs.ipend = 0x8002;
  138. __asm__ __volatile__("%0 = syscfg;":"=da"(regs.syscfg):);
  139. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL,
  140. NULL);
  141. }
  142. EXPORT_SYMBOL(kernel_thread);
  143. void flush_thread(void)
  144. {
  145. }
  146. asmlinkage int bfin_vfork(struct pt_regs *regs)
  147. {
  148. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, rdusp(), regs, 0, NULL,
  149. NULL);
  150. }
  151. asmlinkage int bfin_clone(struct pt_regs *regs)
  152. {
  153. unsigned long clone_flags;
  154. unsigned long newsp;
  155. #ifdef __ARCH_SYNC_CORE_DCACHE
  156. if (current->rt.nr_cpus_allowed == num_possible_cpus()) {
  157. current->cpus_allowed = cpumask_of_cpu(smp_processor_id());
  158. current->rt.nr_cpus_allowed = 1;
  159. }
  160. #endif
  161. /* syscall2 puts clone_flags in r0 and usp in r1 */
  162. clone_flags = regs->r0;
  163. newsp = regs->r1;
  164. if (!newsp)
  165. newsp = rdusp();
  166. else
  167. newsp -= 12;
  168. return do_fork(clone_flags, newsp, regs, 0, NULL, NULL);
  169. }
  170. int
  171. copy_thread(unsigned long clone_flags,
  172. unsigned long usp, unsigned long topstk,
  173. struct task_struct *p, struct pt_regs *regs)
  174. {
  175. struct pt_regs *childregs;
  176. childregs = (struct pt_regs *) (task_stack_page(p) + THREAD_SIZE) - 1;
  177. *childregs = *regs;
  178. childregs->r0 = 0;
  179. p->thread.usp = usp;
  180. p->thread.ksp = (unsigned long)childregs;
  181. p->thread.pc = (unsigned long)ret_from_fork;
  182. return 0;
  183. }
  184. /*
  185. * sys_execve() executes a new program.
  186. */
  187. asmlinkage int sys_execve(char __user *name, char __user * __user *argv, char __user * __user *envp)
  188. {
  189. int error;
  190. char *filename;
  191. struct pt_regs *regs = (struct pt_regs *)((&name) + 6);
  192. lock_kernel();
  193. filename = getname(name);
  194. error = PTR_ERR(filename);
  195. if (IS_ERR(filename))
  196. goto out;
  197. error = do_execve(filename, argv, envp, regs);
  198. putname(filename);
  199. out:
  200. unlock_kernel();
  201. return error;
  202. }
  203. unsigned long get_wchan(struct task_struct *p)
  204. {
  205. unsigned long fp, pc;
  206. unsigned long stack_page;
  207. int count = 0;
  208. if (!p || p == current || p->state == TASK_RUNNING)
  209. return 0;
  210. stack_page = (unsigned long)p;
  211. fp = p->thread.usp;
  212. do {
  213. if (fp < stack_page + sizeof(struct thread_info) ||
  214. fp >= 8184 + stack_page)
  215. return 0;
  216. pc = ((unsigned long *)fp)[1];
  217. if (!in_sched_functions(pc))
  218. return pc;
  219. fp = *(unsigned long *)fp;
  220. }
  221. while (count++ < 16);
  222. return 0;
  223. }
  224. void finish_atomic_sections (struct pt_regs *regs)
  225. {
  226. int __user *up0 = (int __user *)regs->p0;
  227. if (regs->pc < ATOMIC_SEQS_START || regs->pc >= ATOMIC_SEQS_END)
  228. return;
  229. switch (regs->pc) {
  230. case ATOMIC_XCHG32 + 2:
  231. put_user(regs->r1, up0);
  232. regs->pc += 2;
  233. break;
  234. case ATOMIC_CAS32 + 2:
  235. case ATOMIC_CAS32 + 4:
  236. if (regs->r0 == regs->r1)
  237. put_user(regs->r2, up0);
  238. regs->pc = ATOMIC_CAS32 + 8;
  239. break;
  240. case ATOMIC_CAS32 + 6:
  241. put_user(regs->r2, up0);
  242. regs->pc += 2;
  243. break;
  244. case ATOMIC_ADD32 + 2:
  245. regs->r0 = regs->r1 + regs->r0;
  246. /* fall through */
  247. case ATOMIC_ADD32 + 4:
  248. put_user(regs->r0, up0);
  249. regs->pc = ATOMIC_ADD32 + 6;
  250. break;
  251. case ATOMIC_SUB32 + 2:
  252. regs->r0 = regs->r1 - regs->r0;
  253. /* fall through */
  254. case ATOMIC_SUB32 + 4:
  255. put_user(regs->r0, up0);
  256. regs->pc = ATOMIC_SUB32 + 6;
  257. break;
  258. case ATOMIC_IOR32 + 2:
  259. regs->r0 = regs->r1 | regs->r0;
  260. /* fall through */
  261. case ATOMIC_IOR32 + 4:
  262. put_user(regs->r0, up0);
  263. regs->pc = ATOMIC_IOR32 + 6;
  264. break;
  265. case ATOMIC_AND32 + 2:
  266. regs->r0 = regs->r1 & regs->r0;
  267. /* fall through */
  268. case ATOMIC_AND32 + 4:
  269. put_user(regs->r0, up0);
  270. regs->pc = ATOMIC_AND32 + 6;
  271. break;
  272. case ATOMIC_XOR32 + 2:
  273. regs->r0 = regs->r1 ^ regs->r0;
  274. /* fall through */
  275. case ATOMIC_XOR32 + 4:
  276. put_user(regs->r0, up0);
  277. regs->pc = ATOMIC_XOR32 + 6;
  278. break;
  279. }
  280. }
  281. #if defined(CONFIG_ACCESS_CHECK)
  282. /* Return 1 if access to memory range is OK, 0 otherwise */
  283. int _access_ok(unsigned long addr, unsigned long size)
  284. {
  285. if (size == 0)
  286. return 1;
  287. if (addr > (addr + size))
  288. return 0;
  289. if (segment_eq(get_fs(), KERNEL_DS))
  290. return 1;
  291. #ifdef CONFIG_MTD_UCLINUX
  292. if (addr >= memory_start && (addr + size) <= memory_end)
  293. return 1;
  294. if (addr >= memory_mtd_end && (addr + size) <= physical_mem_end)
  295. return 1;
  296. #ifdef CONFIG_ROMFS_ON_MTD
  297. /* For XIP, allow user space to use pointers within the ROMFS. */
  298. if (addr >= memory_mtd_start && (addr + size) <= memory_mtd_end)
  299. return 1;
  300. #endif
  301. #else
  302. if (addr >= memory_start && (addr + size) <= physical_mem_end)
  303. return 1;
  304. #endif
  305. if (addr >= (unsigned long)__init_begin &&
  306. addr + size <= (unsigned long)__init_end)
  307. return 1;
  308. if (addr >= get_l1_scratch_start()
  309. && addr + size <= get_l1_scratch_start() + L1_SCRATCH_LENGTH)
  310. return 1;
  311. #if L1_CODE_LENGTH != 0
  312. if (addr >= get_l1_code_start() + (_etext_l1 - _stext_l1)
  313. && addr + size <= get_l1_code_start() + L1_CODE_LENGTH)
  314. return 1;
  315. #endif
  316. #if L1_DATA_A_LENGTH != 0
  317. if (addr >= get_l1_data_a_start() + (_ebss_l1 - _sdata_l1)
  318. && addr + size <= get_l1_data_a_start() + L1_DATA_A_LENGTH)
  319. return 1;
  320. #endif
  321. #if L1_DATA_B_LENGTH != 0
  322. if (addr >= get_l1_data_b_start() + (_ebss_b_l1 - _sdata_b_l1)
  323. && addr + size <= get_l1_data_b_start() + L1_DATA_B_LENGTH)
  324. return 1;
  325. #endif
  326. #if L2_LENGTH != 0
  327. if (addr >= L2_START + (_ebss_l2 - _stext_l2)
  328. && addr + size <= L2_START + L2_LENGTH)
  329. return 1;
  330. #endif
  331. return 0;
  332. }
  333. EXPORT_SYMBOL(_access_ok);
  334. #endif /* CONFIG_ACCESS_CHECK */