process.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461
  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/a.out.h>
  34. #include <linux/uaccess.h>
  35. #include <linux/fs.h>
  36. #include <linux/err.h>
  37. #include <asm/blackfin.h>
  38. #include <asm/fixed_code.h>
  39. #define LED_ON 0
  40. #define LED_OFF 1
  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. * We are using a different LED from the one used to indicate timer interrupt.
  64. */
  65. #if defined(CONFIG_BFIN_IDLE_LED)
  66. static inline void leds_switch(int flag)
  67. {
  68. unsigned short tmp = 0;
  69. tmp = bfin_read_CONFIG_BFIN_IDLE_LED_PORT();
  70. SSYNC();
  71. if (flag == LED_ON)
  72. tmp &= ~CONFIG_BFIN_IDLE_LED_PIN; /* light on */
  73. else
  74. tmp |= CONFIG_BFIN_IDLE_LED_PIN; /* light off */
  75. bfin_write_CONFIG_BFIN_IDLE_LED_PORT(tmp);
  76. SSYNC();
  77. }
  78. #else
  79. static inline void leds_switch(int flag)
  80. {
  81. }
  82. #endif
  83. /*
  84. * The idle loop on BFIN
  85. */
  86. #ifdef CONFIG_IDLE_L1
  87. void default_idle(void)__attribute__((l1_text));
  88. void cpu_idle(void)__attribute__((l1_text));
  89. #endif
  90. void default_idle(void)
  91. {
  92. while (!need_resched()) {
  93. leds_switch(LED_OFF);
  94. local_irq_disable();
  95. if (likely(!need_resched()))
  96. idle_with_irq_disabled();
  97. local_irq_enable();
  98. leds_switch(LED_ON);
  99. }
  100. }
  101. void (*idle)(void) = default_idle;
  102. /*
  103. * The idle thread. There's no useful work to be
  104. * done, so just try to conserve power and have a
  105. * low exit latency (ie sit in a loop waiting for
  106. * somebody to say that they'd like to reschedule)
  107. */
  108. void cpu_idle(void)
  109. {
  110. /* endless idle loop with no priority at all */
  111. while (1) {
  112. idle();
  113. preempt_enable_no_resched();
  114. schedule();
  115. preempt_disable();
  116. }
  117. }
  118. void machine_restart(char *__unused)
  119. {
  120. #if defined(CONFIG_BLKFIN_CACHE)
  121. bfin_write_IMEM_CONTROL(0x01);
  122. SSYNC();
  123. #endif
  124. bfin_reset();
  125. /* Dont do anything till the reset occurs */
  126. while (1) {
  127. SSYNC();
  128. }
  129. }
  130. void machine_halt(void)
  131. {
  132. for (;;)
  133. asm volatile ("idle");
  134. }
  135. void machine_power_off(void)
  136. {
  137. for (;;)
  138. asm volatile ("idle");
  139. }
  140. void show_regs(struct pt_regs *regs)
  141. {
  142. printk(KERN_NOTICE "\n");
  143. printk(KERN_NOTICE
  144. "PC: %08lu Status: %04lu SysStatus: %04lu RETS: %08lu\n",
  145. regs->pc, regs->astat, regs->seqstat, regs->rets);
  146. printk(KERN_NOTICE
  147. "A0.x: %08lx A0.w: %08lx A1.x: %08lx A1.w: %08lx\n",
  148. regs->a0x, regs->a0w, regs->a1x, regs->a1w);
  149. printk(KERN_NOTICE "P0: %08lx P1: %08lx P2: %08lx P3: %08lx\n",
  150. regs->p0, regs->p1, regs->p2, regs->p3);
  151. printk(KERN_NOTICE "P4: %08lx P5: %08lx\n", regs->p4, regs->p5);
  152. printk(KERN_NOTICE "R0: %08lx R1: %08lx R2: %08lx R3: %08lx\n",
  153. regs->r0, regs->r1, regs->r2, regs->r3);
  154. printk(KERN_NOTICE "R4: %08lx R5: %08lx R6: %08lx R7: %08lx\n",
  155. regs->r4, regs->r5, regs->r6, regs->r7);
  156. if (!regs->ipend)
  157. printk(KERN_NOTICE "USP: %08lx\n", rdusp());
  158. }
  159. /* Fill in the fpu structure for a core dump. */
  160. int dump_fpu(struct pt_regs *regs, elf_fpregset_t * fpregs)
  161. {
  162. return 1;
  163. }
  164. /*
  165. * This gets run with P1 containing the
  166. * function to call, and R1 containing
  167. * the "args". Note P0 is clobbered on the way here.
  168. */
  169. void kernel_thread_helper(void);
  170. __asm__(".section .text\n"
  171. ".align 4\n"
  172. "_kernel_thread_helper:\n\t"
  173. "\tsp += -12;\n\t"
  174. "\tr0 = r1;\n\t" "\tcall (p1);\n\t" "\tcall _do_exit;\n" ".previous");
  175. /*
  176. * Create a kernel thread.
  177. */
  178. pid_t kernel_thread(int (*fn) (void *), void *arg, unsigned long flags)
  179. {
  180. struct pt_regs regs;
  181. memset(&regs, 0, sizeof(regs));
  182. regs.r1 = (unsigned long)arg;
  183. regs.p1 = (unsigned long)fn;
  184. regs.pc = (unsigned long)kernel_thread_helper;
  185. regs.orig_p0 = -1;
  186. /* Set bit 2 to tell ret_from_fork we should be returning to kernel
  187. mode. */
  188. regs.ipend = 0x8002;
  189. __asm__ __volatile__("%0 = syscfg;":"=da"(regs.syscfg):);
  190. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL,
  191. NULL);
  192. }
  193. void flush_thread(void)
  194. {
  195. }
  196. asmlinkage int bfin_vfork(struct pt_regs *regs)
  197. {
  198. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, rdusp(), regs, 0, NULL,
  199. NULL);
  200. }
  201. asmlinkage int bfin_clone(struct pt_regs *regs)
  202. {
  203. unsigned long clone_flags;
  204. unsigned long newsp;
  205. /* syscall2 puts clone_flags in r0 and usp in r1 */
  206. clone_flags = regs->r0;
  207. newsp = regs->r1;
  208. if (!newsp)
  209. newsp = rdusp();
  210. else
  211. newsp -= 12;
  212. return do_fork(clone_flags, newsp, regs, 0, NULL, NULL);
  213. }
  214. int
  215. copy_thread(int nr, unsigned long clone_flags,
  216. unsigned long usp, unsigned long topstk,
  217. struct task_struct *p, struct pt_regs *regs)
  218. {
  219. struct pt_regs *childregs;
  220. childregs = (struct pt_regs *) (task_stack_page(p) + THREAD_SIZE) - 1;
  221. *childregs = *regs;
  222. childregs->r0 = 0;
  223. p->thread.usp = usp;
  224. p->thread.ksp = (unsigned long)childregs;
  225. p->thread.pc = (unsigned long)ret_from_fork;
  226. return 0;
  227. }
  228. /*
  229. * fill in the user structure for a core dump..
  230. */
  231. void dump_thread(struct pt_regs *regs, struct user *dump)
  232. {
  233. dump->magic = CMAGIC;
  234. dump->start_code = 0;
  235. dump->start_stack = rdusp() & ~(PAGE_SIZE - 1);
  236. dump->u_tsize = ((unsigned long)current->mm->end_code) >> PAGE_SHIFT;
  237. dump->u_dsize = ((unsigned long)(current->mm->brk +
  238. (PAGE_SIZE - 1))) >> PAGE_SHIFT;
  239. dump->u_dsize -= dump->u_tsize;
  240. dump->u_ssize = 0;
  241. if (dump->start_stack < TASK_SIZE)
  242. dump->u_ssize =
  243. ((unsigned long)(TASK_SIZE -
  244. dump->start_stack)) >> PAGE_SHIFT;
  245. dump->u_ar0 = (struct user_regs_struct *)((int)&dump->regs - (int)dump);
  246. dump->regs.r0 = regs->r0;
  247. dump->regs.r1 = regs->r1;
  248. dump->regs.r2 = regs->r2;
  249. dump->regs.r3 = regs->r3;
  250. dump->regs.r4 = regs->r4;
  251. dump->regs.r5 = regs->r5;
  252. dump->regs.r6 = regs->r6;
  253. dump->regs.r7 = regs->r7;
  254. dump->regs.p0 = regs->p0;
  255. dump->regs.p1 = regs->p1;
  256. dump->regs.p2 = regs->p2;
  257. dump->regs.p3 = regs->p3;
  258. dump->regs.p4 = regs->p4;
  259. dump->regs.p5 = regs->p5;
  260. dump->regs.orig_p0 = regs->orig_p0;
  261. dump->regs.a0w = regs->a0w;
  262. dump->regs.a1w = regs->a1w;
  263. dump->regs.a0x = regs->a0x;
  264. dump->regs.a1x = regs->a1x;
  265. dump->regs.rets = regs->rets;
  266. dump->regs.astat = regs->astat;
  267. dump->regs.pc = regs->pc;
  268. }
  269. /*
  270. * sys_execve() executes a new program.
  271. */
  272. asmlinkage int sys_execve(char *name, char **argv, char **envp)
  273. {
  274. int error;
  275. char *filename;
  276. struct pt_regs *regs = (struct pt_regs *)((&name) + 6);
  277. lock_kernel();
  278. filename = getname(name);
  279. error = PTR_ERR(filename);
  280. if (IS_ERR(filename))
  281. goto out;
  282. error = do_execve(filename, argv, envp, regs);
  283. putname(filename);
  284. out:
  285. unlock_kernel();
  286. return error;
  287. }
  288. unsigned long get_wchan(struct task_struct *p)
  289. {
  290. unsigned long fp, pc;
  291. unsigned long stack_page;
  292. int count = 0;
  293. if (!p || p == current || p->state == TASK_RUNNING)
  294. return 0;
  295. stack_page = (unsigned long)p;
  296. fp = p->thread.usp;
  297. do {
  298. if (fp < stack_page + sizeof(struct thread_info) ||
  299. fp >= 8184 + stack_page)
  300. return 0;
  301. pc = ((unsigned long *)fp)[1];
  302. if (!in_sched_functions(pc))
  303. return pc;
  304. fp = *(unsigned long *)fp;
  305. }
  306. while (count++ < 16);
  307. return 0;
  308. }
  309. void finish_atomic_sections (struct pt_regs *regs)
  310. {
  311. if (regs->pc < ATOMIC_SEQS_START || regs->pc >= ATOMIC_SEQS_END)
  312. return;
  313. switch (regs->pc) {
  314. case ATOMIC_XCHG32 + 2:
  315. put_user(regs->r1, (int *)regs->p0);
  316. regs->pc += 2;
  317. break;
  318. case ATOMIC_CAS32 + 2:
  319. case ATOMIC_CAS32 + 4:
  320. if (regs->r0 == regs->r1)
  321. put_user(regs->r2, (int *)regs->p0);
  322. regs->pc = ATOMIC_CAS32 + 8;
  323. break;
  324. case ATOMIC_CAS32 + 6:
  325. put_user(regs->r2, (int *)regs->p0);
  326. regs->pc += 2;
  327. break;
  328. case ATOMIC_ADD32 + 2:
  329. regs->r0 = regs->r1 + regs->r0;
  330. /* fall through */
  331. case ATOMIC_ADD32 + 4:
  332. put_user(regs->r0, (int *)regs->p0);
  333. regs->pc = ATOMIC_ADD32 + 6;
  334. break;
  335. case ATOMIC_SUB32 + 2:
  336. regs->r0 = regs->r1 - regs->r0;
  337. /* fall through */
  338. case ATOMIC_SUB32 + 4:
  339. put_user(regs->r0, (int *)regs->p0);
  340. regs->pc = ATOMIC_SUB32 + 6;
  341. break;
  342. case ATOMIC_IOR32 + 2:
  343. regs->r0 = regs->r1 | regs->r0;
  344. /* fall through */
  345. case ATOMIC_IOR32 + 4:
  346. put_user(regs->r0, (int *)regs->p0);
  347. regs->pc = ATOMIC_IOR32 + 6;
  348. break;
  349. case ATOMIC_AND32 + 2:
  350. regs->r0 = regs->r1 & regs->r0;
  351. /* fall through */
  352. case ATOMIC_AND32 + 4:
  353. put_user(regs->r0, (int *)regs->p0);
  354. regs->pc = ATOMIC_AND32 + 6;
  355. break;
  356. case ATOMIC_XOR32 + 2:
  357. regs->r0 = regs->r1 ^ regs->r0;
  358. /* fall through */
  359. case ATOMIC_XOR32 + 4:
  360. put_user(regs->r0, (int *)regs->p0);
  361. regs->pc = ATOMIC_XOR32 + 6;
  362. break;
  363. }
  364. }
  365. #if defined(CONFIG_ACCESS_CHECK)
  366. int _access_ok(unsigned long addr, unsigned long size)
  367. {
  368. if (addr > (addr + size))
  369. return 0;
  370. if (segment_eq(get_fs(), KERNEL_DS))
  371. return 1;
  372. #ifdef CONFIG_MTD_UCLINUX
  373. if (addr >= memory_start && (addr + size) <= memory_end)
  374. return 1;
  375. if (addr >= memory_mtd_end && (addr + size) <= physical_mem_end)
  376. return 1;
  377. #else
  378. if (addr >= memory_start && (addr + size) <= physical_mem_end)
  379. return 1;
  380. #endif
  381. if (addr >= (unsigned long)__init_begin &&
  382. addr + size <= (unsigned long)__init_end)
  383. return 1;
  384. if (addr >= L1_SCRATCH_START
  385. && addr + size <= L1_SCRATCH_START + L1_SCRATCH_LENGTH)
  386. return 1;
  387. #if L1_CODE_LENGTH != 0
  388. if (addr >= L1_CODE_START + (_etext_l1 - _stext_l1)
  389. && addr + size <= L1_CODE_START + L1_CODE_LENGTH)
  390. return 1;
  391. #endif
  392. #if L1_DATA_A_LENGTH != 0
  393. if (addr >= L1_DATA_A_START + (_ebss_l1 - _sdata_l1)
  394. && addr + size <= L1_DATA_A_START + L1_DATA_A_LENGTH)
  395. return 1;
  396. #endif
  397. #if L1_DATA_B_LENGTH != 0
  398. if (addr >= L1_DATA_B_START
  399. && addr + size <= L1_DATA_B_START + L1_DATA_B_LENGTH)
  400. return 1;
  401. #endif
  402. return 0;
  403. }
  404. EXPORT_SYMBOL(_access_ok);
  405. #endif /* CONFIG_ACCESS_CHECK */