blob: 8430f45daea6bce566cc0980db85f0d0b213af72 [file] [log] [blame]
Chris Metcalf867e3592010-05-28 23:09:12 -04001/*
2 * Copyright 2010 Tilera Corporation. All Rights Reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation, version 2.
7 *
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
11 * NON INFRINGEMENT. See the GNU General Public License for
12 * more details.
13 */
14
15#include <linux/sched.h>
16#include <linux/preempt.h>
17#include <linux/module.h>
18#include <linux/fs.h>
19#include <linux/kprobes.h>
20#include <linux/elfcore.h>
21#include <linux/tick.h>
22#include <linux/init.h>
23#include <linux/mm.h>
24#include <linux/compat.h>
25#include <linux/hardirq.h>
26#include <linux/syscalls.h>
Chris Metcalf0707ad32010-06-25 17:04:17 -040027#include <linux/kernel.h>
Chris Metcalf867e3592010-05-28 23:09:12 -040028#include <asm/system.h>
29#include <asm/stack.h>
30#include <asm/homecache.h>
Chris Metcalf0707ad32010-06-25 17:04:17 -040031#include <asm/syscalls.h>
32#ifdef CONFIG_HARDWALL
33#include <asm/hardwall.h>
34#endif
Chris Metcalf867e3592010-05-28 23:09:12 -040035#include <arch/chip.h>
36#include <arch/abi.h>
37
38
39/*
40 * Use the (x86) "idle=poll" option to prefer low latency when leaving the
41 * idle loop over low power while in the idle loop, e.g. if we have
42 * one thread per core and we want to get threads out of futex waits fast.
43 */
44static int no_idle_nap;
45static int __init idle_setup(char *str)
46{
47 if (!str)
48 return -EINVAL;
49
50 if (!strcmp(str, "poll")) {
Chris Metcalf0707ad32010-06-25 17:04:17 -040051 pr_info("using polling idle threads.\n");
Chris Metcalf867e3592010-05-28 23:09:12 -040052 no_idle_nap = 1;
53 } else if (!strcmp(str, "halt"))
54 no_idle_nap = 0;
55 else
56 return -1;
57
58 return 0;
59}
60early_param("idle", idle_setup);
61
62/*
63 * The idle thread. There's no useful work to be
64 * done, so just try to conserve power and have a
65 * low exit latency (ie sit in a loop waiting for
66 * somebody to say that they'd like to reschedule)
67 */
68void cpu_idle(void)
69{
Chris Metcalf867e3592010-05-28 23:09:12 -040070 int cpu = smp_processor_id();
71
72
73 current_thread_info()->status |= TS_POLLING;
74
75 if (no_idle_nap) {
76 while (1) {
77 while (!need_resched())
78 cpu_relax();
79 schedule();
80 }
81 }
82
83 /* endless idle loop with no priority at all */
84 while (1) {
85 tick_nohz_stop_sched_tick(1);
86 while (!need_resched()) {
87 if (cpu_is_offline(cpu))
88 BUG(); /* no HOTPLUG_CPU */
89
90 local_irq_disable();
91 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
92 current_thread_info()->status &= ~TS_POLLING;
93 /*
94 * TS_POLLING-cleared state must be visible before we
95 * test NEED_RESCHED:
96 */
97 smp_mb();
98
99 if (!need_resched())
100 _cpu_idle();
101 else
102 local_irq_enable();
103 current_thread_info()->status |= TS_POLLING;
104 }
105 tick_nohz_restart_sched_tick();
106 preempt_enable_no_resched();
107 schedule();
108 preempt_disable();
109 }
110}
111
112struct thread_info *alloc_thread_info(struct task_struct *task)
113{
114 struct page *page;
Chris Metcalf0707ad32010-06-25 17:04:17 -0400115 gfp_t flags = GFP_KERNEL;
Chris Metcalf867e3592010-05-28 23:09:12 -0400116
117#ifdef CONFIG_DEBUG_STACK_USAGE
118 flags |= __GFP_ZERO;
119#endif
120
121 page = alloc_pages(flags, THREAD_SIZE_ORDER);
122 if (!page)
Chris Metcalf0707ad32010-06-25 17:04:17 -0400123 return NULL;
Chris Metcalf867e3592010-05-28 23:09:12 -0400124
125 return (struct thread_info *)page_address(page);
126}
127
128/*
129 * Free a thread_info node, and all of its derivative
130 * data structures.
131 */
132void free_thread_info(struct thread_info *info)
133{
134 struct single_step_state *step_state = info->step_state;
135
Chris Metcalf0707ad32010-06-25 17:04:17 -0400136#ifdef CONFIG_HARDWALL
137 /*
138 * We free a thread_info from the context of the task that has
139 * been scheduled next, so the original task is already dead.
140 * Calling deactivate here just frees up the data structures.
141 * If the task we're freeing held the last reference to a
142 * hardwall fd, it would have been released prior to this point
143 * anyway via exit_files(), and "hardwall" would be NULL by now.
144 */
145 if (info->task->thread.hardwall)
146 hardwall_deactivate(info->task);
147#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400148
149 if (step_state) {
150
151 /*
152 * FIXME: we don't munmap step_state->buffer
153 * because the mm_struct for this process (info->task->mm)
154 * has already been zeroed in exit_mm(). Keeping a
155 * reference to it here seems like a bad move, so this
156 * means we can't munmap() the buffer, and therefore if we
157 * ptrace multiple threads in a process, we will slowly
158 * leak user memory. (Note that as soon as the last
159 * thread in a process dies, we will reclaim all user
160 * memory including single-step buffers in the usual way.)
161 * We should either assign a kernel VA to this buffer
162 * somehow, or we should associate the buffer(s) with the
163 * mm itself so we can clean them up that way.
164 */
165 kfree(step_state);
166 }
167
168 free_page((unsigned long)info);
169}
170
171static void save_arch_state(struct thread_struct *t);
172
Chris Metcalf867e3592010-05-28 23:09:12 -0400173int copy_thread(unsigned long clone_flags, unsigned long sp,
174 unsigned long stack_size,
175 struct task_struct *p, struct pt_regs *regs)
176{
177 struct pt_regs *childregs;
178 unsigned long ksp;
179
180 /*
181 * When creating a new kernel thread we pass sp as zero.
182 * Assign it to a reasonable value now that we have the stack.
183 */
184 if (sp == 0 && regs->ex1 == PL_ICS_EX1(KERNEL_PL, 0))
185 sp = KSTK_TOP(p);
186
187 /*
188 * Do not clone step state from the parent; each thread
189 * must make its own lazily.
190 */
191 task_thread_info(p)->step_state = NULL;
192
193 /*
194 * Start new thread in ret_from_fork so it schedules properly
195 * and then return from interrupt like the parent.
196 */
197 p->thread.pc = (unsigned long) ret_from_fork;
198
199 /* Save user stack top pointer so we can ID the stack vm area later. */
200 p->thread.usp0 = sp;
201
202 /* Record the pid of the process that created this one. */
203 p->thread.creator_pid = current->pid;
204
205 /*
206 * Copy the registers onto the kernel stack so the
207 * return-from-interrupt code will reload it into registers.
208 */
209 childregs = task_pt_regs(p);
210 *childregs = *regs;
211 childregs->regs[0] = 0; /* return value is zero */
212 childregs->sp = sp; /* override with new user stack pointer */
213
214 /*
215 * Copy the callee-saved registers from the passed pt_regs struct
216 * into the context-switch callee-saved registers area.
Chris Metcalfd6f0f222010-10-14 14:42:58 -0400217 * This way when we start the interrupt-return sequence, the
218 * callee-save registers will be correctly in registers, which
219 * is how we assume the compiler leaves them as we start doing
220 * the normal return-from-interrupt path after calling C code.
Chris Metcalf867e3592010-05-28 23:09:12 -0400221 * Zero out the C ABI save area to mark the top of the stack.
222 */
223 ksp = (unsigned long) childregs;
224 ksp -= C_ABI_SAVE_AREA_SIZE; /* interrupt-entry save area */
225 ((long *)ksp)[0] = ((long *)ksp)[1] = 0;
226 ksp -= CALLEE_SAVED_REGS_COUNT * sizeof(unsigned long);
227 memcpy((void *)ksp, &regs->regs[CALLEE_SAVED_FIRST_REG],
228 CALLEE_SAVED_REGS_COUNT * sizeof(unsigned long));
229 ksp -= C_ABI_SAVE_AREA_SIZE; /* __switch_to() save area */
230 ((long *)ksp)[0] = ((long *)ksp)[1] = 0;
231 p->thread.ksp = ksp;
232
233#if CHIP_HAS_TILE_DMA()
234 /*
235 * No DMA in the new thread. We model this on the fact that
236 * fork() clears the pending signals, alarms, and aio for the child.
237 */
238 memset(&p->thread.tile_dma_state, 0, sizeof(struct tile_dma_state));
239 memset(&p->thread.dma_async_tlb, 0, sizeof(struct async_tlb));
240#endif
241
242#if CHIP_HAS_SN_PROC()
243 /* Likewise, the new thread is not running static processor code. */
244 p->thread.sn_proc_running = 0;
245 memset(&p->thread.sn_async_tlb, 0, sizeof(struct async_tlb));
246#endif
247
248#if CHIP_HAS_PROC_STATUS_SPR()
249 /* New thread has its miscellaneous processor state bits clear. */
250 p->thread.proc_status = 0;
251#endif
252
Chris Metcalf0707ad32010-06-25 17:04:17 -0400253#ifdef CONFIG_HARDWALL
254 /* New thread does not own any networks. */
255 p->thread.hardwall = NULL;
256#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400257
258
259 /*
260 * Start the new thread with the current architecture state
261 * (user interrupt masks, etc.).
262 */
263 save_arch_state(&p->thread);
264
265 return 0;
266}
267
268/*
269 * Return "current" if it looks plausible, or else a pointer to a dummy.
270 * This can be helpful if we are just trying to emit a clean panic.
271 */
272struct task_struct *validate_current(void)
273{
274 static struct task_struct corrupt = { .comm = "<corrupt>" };
275 struct task_struct *tsk = current;
276 if (unlikely((unsigned long)tsk < PAGE_OFFSET ||
277 (void *)tsk > high_memory ||
278 ((unsigned long)tsk & (__alignof__(*tsk) - 1)) != 0)) {
Chris Metcalf0707ad32010-06-25 17:04:17 -0400279 pr_err("Corrupt 'current' %p (sp %#lx)\n", tsk, stack_pointer);
Chris Metcalf867e3592010-05-28 23:09:12 -0400280 tsk = &corrupt;
281 }
282 return tsk;
283}
284
285/* Take and return the pointer to the previous task, for schedule_tail(). */
286struct task_struct *sim_notify_fork(struct task_struct *prev)
287{
288 struct task_struct *tsk = current;
289 __insn_mtspr(SPR_SIM_CONTROL, SIM_CONTROL_OS_FORK_PARENT |
290 (tsk->thread.creator_pid << _SIM_CONTROL_OPERATOR_BITS));
291 __insn_mtspr(SPR_SIM_CONTROL, SIM_CONTROL_OS_FORK |
292 (tsk->pid << _SIM_CONTROL_OPERATOR_BITS));
293 return prev;
294}
295
296int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
297{
298 struct pt_regs *ptregs = task_pt_regs(tsk);
299 elf_core_copy_regs(regs, ptregs);
300 return 1;
301}
302
303#if CHIP_HAS_TILE_DMA()
304
305/* Allow user processes to access the DMA SPRs */
306void grant_dma_mpls(void)
307{
Chris Metcalfa78c9422010-10-14 16:23:03 -0400308#if CONFIG_KERNEL_PL == 2
309 __insn_mtspr(SPR_MPL_DMA_CPL_SET_1, 1);
310 __insn_mtspr(SPR_MPL_DMA_NOTIFY_SET_1, 1);
311#else
Chris Metcalf867e3592010-05-28 23:09:12 -0400312 __insn_mtspr(SPR_MPL_DMA_CPL_SET_0, 1);
313 __insn_mtspr(SPR_MPL_DMA_NOTIFY_SET_0, 1);
Chris Metcalfa78c9422010-10-14 16:23:03 -0400314#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400315}
316
317/* Forbid user processes from accessing the DMA SPRs */
318void restrict_dma_mpls(void)
319{
Chris Metcalfa78c9422010-10-14 16:23:03 -0400320#if CONFIG_KERNEL_PL == 2
321 __insn_mtspr(SPR_MPL_DMA_CPL_SET_2, 1);
322 __insn_mtspr(SPR_MPL_DMA_NOTIFY_SET_2, 1);
323#else
Chris Metcalf867e3592010-05-28 23:09:12 -0400324 __insn_mtspr(SPR_MPL_DMA_CPL_SET_1, 1);
325 __insn_mtspr(SPR_MPL_DMA_NOTIFY_SET_1, 1);
Chris Metcalfa78c9422010-10-14 16:23:03 -0400326#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400327}
328
329/* Pause the DMA engine, then save off its state registers. */
330static void save_tile_dma_state(struct tile_dma_state *dma)
331{
332 unsigned long state = __insn_mfspr(SPR_DMA_USER_STATUS);
333 unsigned long post_suspend_state;
334
335 /* If we're running, suspend the engine. */
336 if ((state & DMA_STATUS_MASK) == SPR_DMA_STATUS__RUNNING_MASK)
337 __insn_mtspr(SPR_DMA_CTR, SPR_DMA_CTR__SUSPEND_MASK);
338
339 /*
340 * Wait for the engine to idle, then save regs. Note that we
341 * want to record the "running" bit from before suspension,
342 * and the "done" bit from after, so that we can properly
343 * distinguish a case where the user suspended the engine from
344 * the case where the kernel suspended as part of the context
345 * swap.
346 */
347 do {
348 post_suspend_state = __insn_mfspr(SPR_DMA_USER_STATUS);
349 } while (post_suspend_state & SPR_DMA_STATUS__BUSY_MASK);
350
351 dma->src = __insn_mfspr(SPR_DMA_SRC_ADDR);
352 dma->src_chunk = __insn_mfspr(SPR_DMA_SRC_CHUNK_ADDR);
353 dma->dest = __insn_mfspr(SPR_DMA_DST_ADDR);
354 dma->dest_chunk = __insn_mfspr(SPR_DMA_DST_CHUNK_ADDR);
355 dma->strides = __insn_mfspr(SPR_DMA_STRIDE);
356 dma->chunk_size = __insn_mfspr(SPR_DMA_CHUNK_SIZE);
357 dma->byte = __insn_mfspr(SPR_DMA_BYTE);
358 dma->status = (state & SPR_DMA_STATUS__RUNNING_MASK) |
359 (post_suspend_state & SPR_DMA_STATUS__DONE_MASK);
360}
361
362/* Restart a DMA that was running before we were context-switched out. */
363static void restore_tile_dma_state(struct thread_struct *t)
364{
365 const struct tile_dma_state *dma = &t->tile_dma_state;
366
367 /*
368 * The only way to restore the done bit is to run a zero
369 * length transaction.
370 */
371 if ((dma->status & SPR_DMA_STATUS__DONE_MASK) &&
372 !(__insn_mfspr(SPR_DMA_USER_STATUS) & SPR_DMA_STATUS__DONE_MASK)) {
373 __insn_mtspr(SPR_DMA_BYTE, 0);
374 __insn_mtspr(SPR_DMA_CTR, SPR_DMA_CTR__REQUEST_MASK);
375 while (__insn_mfspr(SPR_DMA_USER_STATUS) &
376 SPR_DMA_STATUS__BUSY_MASK)
377 ;
378 }
379
380 __insn_mtspr(SPR_DMA_SRC_ADDR, dma->src);
381 __insn_mtspr(SPR_DMA_SRC_CHUNK_ADDR, dma->src_chunk);
382 __insn_mtspr(SPR_DMA_DST_ADDR, dma->dest);
383 __insn_mtspr(SPR_DMA_DST_CHUNK_ADDR, dma->dest_chunk);
384 __insn_mtspr(SPR_DMA_STRIDE, dma->strides);
385 __insn_mtspr(SPR_DMA_CHUNK_SIZE, dma->chunk_size);
386 __insn_mtspr(SPR_DMA_BYTE, dma->byte);
387
388 /*
389 * Restart the engine if we were running and not done.
390 * Clear a pending async DMA fault that we were waiting on return
391 * to user space to execute, since we expect the DMA engine
392 * to regenerate those faults for us now. Note that we don't
393 * try to clear the TIF_ASYNC_TLB flag, since it's relatively
394 * harmless if set, and it covers both DMA and the SN processor.
395 */
396 if ((dma->status & DMA_STATUS_MASK) == SPR_DMA_STATUS__RUNNING_MASK) {
397 t->dma_async_tlb.fault_num = 0;
398 __insn_mtspr(SPR_DMA_CTR, SPR_DMA_CTR__REQUEST_MASK);
399 }
400}
401
402#endif
403
404static void save_arch_state(struct thread_struct *t)
405{
406#if CHIP_HAS_SPLIT_INTR_MASK()
407 t->interrupt_mask = __insn_mfspr(SPR_INTERRUPT_MASK_0_0) |
408 ((u64)__insn_mfspr(SPR_INTERRUPT_MASK_0_1) << 32);
409#else
410 t->interrupt_mask = __insn_mfspr(SPR_INTERRUPT_MASK_0);
411#endif
412 t->ex_context[0] = __insn_mfspr(SPR_EX_CONTEXT_0_0);
413 t->ex_context[1] = __insn_mfspr(SPR_EX_CONTEXT_0_1);
414 t->system_save[0] = __insn_mfspr(SPR_SYSTEM_SAVE_0_0);
415 t->system_save[1] = __insn_mfspr(SPR_SYSTEM_SAVE_0_1);
416 t->system_save[2] = __insn_mfspr(SPR_SYSTEM_SAVE_0_2);
417 t->system_save[3] = __insn_mfspr(SPR_SYSTEM_SAVE_0_3);
418 t->intctrl_0 = __insn_mfspr(SPR_INTCTRL_0_STATUS);
419#if CHIP_HAS_PROC_STATUS_SPR()
420 t->proc_status = __insn_mfspr(SPR_PROC_STATUS);
421#endif
Chris Metcalfa802fc62010-09-15 11:16:10 -0400422#if !CHIP_HAS_FIXED_INTVEC_BASE()
423 t->interrupt_vector_base = __insn_mfspr(SPR_INTERRUPT_VECTOR_BASE_0);
424#endif
425#if CHIP_HAS_TILE_RTF_HWM()
426 t->tile_rtf_hwm = __insn_mfspr(SPR_TILE_RTF_HWM);
427#endif
428#if CHIP_HAS_DSTREAM_PF()
429 t->dstream_pf = __insn_mfspr(SPR_DSTREAM_PF);
430#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400431}
432
433static void restore_arch_state(const struct thread_struct *t)
434{
435#if CHIP_HAS_SPLIT_INTR_MASK()
436 __insn_mtspr(SPR_INTERRUPT_MASK_0_0, (u32) t->interrupt_mask);
437 __insn_mtspr(SPR_INTERRUPT_MASK_0_1, t->interrupt_mask >> 32);
438#else
439 __insn_mtspr(SPR_INTERRUPT_MASK_0, t->interrupt_mask);
440#endif
441 __insn_mtspr(SPR_EX_CONTEXT_0_0, t->ex_context[0]);
442 __insn_mtspr(SPR_EX_CONTEXT_0_1, t->ex_context[1]);
443 __insn_mtspr(SPR_SYSTEM_SAVE_0_0, t->system_save[0]);
444 __insn_mtspr(SPR_SYSTEM_SAVE_0_1, t->system_save[1]);
445 __insn_mtspr(SPR_SYSTEM_SAVE_0_2, t->system_save[2]);
446 __insn_mtspr(SPR_SYSTEM_SAVE_0_3, t->system_save[3]);
447 __insn_mtspr(SPR_INTCTRL_0_STATUS, t->intctrl_0);
448#if CHIP_HAS_PROC_STATUS_SPR()
449 __insn_mtspr(SPR_PROC_STATUS, t->proc_status);
450#endif
Chris Metcalfa802fc62010-09-15 11:16:10 -0400451#if !CHIP_HAS_FIXED_INTVEC_BASE()
452 __insn_mtspr(SPR_INTERRUPT_VECTOR_BASE_0, t->interrupt_vector_base);
453#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400454#if CHIP_HAS_TILE_RTF_HWM()
Chris Metcalfa802fc62010-09-15 11:16:10 -0400455 __insn_mtspr(SPR_TILE_RTF_HWM, t->tile_rtf_hwm);
456#endif
457#if CHIP_HAS_DSTREAM_PF()
458 __insn_mtspr(SPR_DSTREAM_PF, t->dstream_pf);
Chris Metcalf867e3592010-05-28 23:09:12 -0400459#endif
460}
461
462
463void _prepare_arch_switch(struct task_struct *next)
464{
465#if CHIP_HAS_SN_PROC()
466 int snctl;
467#endif
468#if CHIP_HAS_TILE_DMA()
469 struct tile_dma_state *dma = &current->thread.tile_dma_state;
470 if (dma->enabled)
471 save_tile_dma_state(dma);
472#endif
473#if CHIP_HAS_SN_PROC()
474 /*
475 * Suspend the static network processor if it was running.
476 * We do not suspend the fabric itself, just like we don't
477 * try to suspend the UDN.
478 */
479 snctl = __insn_mfspr(SPR_SNCTL);
480 current->thread.sn_proc_running =
481 (snctl & SPR_SNCTL__FRZPROC_MASK) == 0;
482 if (current->thread.sn_proc_running)
483 __insn_mtspr(SPR_SNCTL, snctl | SPR_SNCTL__FRZPROC_MASK);
484#endif
485}
486
487
Chris Metcalf867e3592010-05-28 23:09:12 -0400488struct task_struct *__sched _switch_to(struct task_struct *prev,
489 struct task_struct *next)
490{
491 /* DMA state is already saved; save off other arch state. */
492 save_arch_state(&prev->thread);
493
494#if CHIP_HAS_TILE_DMA()
495 /*
496 * Restore DMA in new task if desired.
497 * Note that it is only safe to restart here since interrupts
498 * are disabled, so we can't take any DMATLB miss or access
499 * interrupts before we have finished switching stacks.
500 */
501 if (next->thread.tile_dma_state.enabled) {
502 restore_tile_dma_state(&next->thread);
503 grant_dma_mpls();
504 } else {
505 restrict_dma_mpls();
506 }
507#endif
508
509 /* Restore other arch state. */
510 restore_arch_state(&next->thread);
511
512#if CHIP_HAS_SN_PROC()
513 /*
514 * Restart static network processor in the new process
515 * if it was running before.
516 */
517 if (next->thread.sn_proc_running) {
518 int snctl = __insn_mfspr(SPR_SNCTL);
519 __insn_mtspr(SPR_SNCTL, snctl & ~SPR_SNCTL__FRZPROC_MASK);
520 }
521#endif
522
Chris Metcalf0707ad32010-06-25 17:04:17 -0400523#ifdef CONFIG_HARDWALL
524 /* Enable or disable access to the network registers appropriately. */
525 if (prev->thread.hardwall != NULL) {
526 if (next->thread.hardwall == NULL)
527 restrict_network_mpls();
528 } else if (next->thread.hardwall != NULL) {
529 grant_network_mpls();
530 }
531#endif
Chris Metcalf867e3592010-05-28 23:09:12 -0400532
533 /*
534 * Switch kernel SP, PC, and callee-saved registers.
535 * In the context of the new task, return the old task pointer
536 * (i.e. the task that actually called __switch_to).
Chris Metcalfa78c9422010-10-14 16:23:03 -0400537 * Pass the value to use for SYSTEM_SAVE_K_0 when we reset our sp.
Chris Metcalf867e3592010-05-28 23:09:12 -0400538 */
539 return __switch_to(prev, next, next_current_ksp0(next));
540}
541
Chris Metcalfd929b6a2010-10-14 14:34:33 -0400542SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
543 void __user *, parent_tidptr, void __user *, child_tidptr,
544 struct pt_regs *, regs)
Chris Metcalf867e3592010-05-28 23:09:12 -0400545{
546 if (!newsp)
547 newsp = regs->sp;
548 return do_fork(clone_flags, newsp, regs, 0,
549 parent_tidptr, child_tidptr);
550}
551
Chris Metcalf867e3592010-05-28 23:09:12 -0400552/*
553 * sys_execve() executes a new program.
554 */
Chris Metcalfd929b6a2010-10-14 14:34:33 -0400555SYSCALL_DEFINE4(execve, const char __user *, path,
556 const char __user *const __user *, argv,
557 const char __user *const __user *, envp,
558 struct pt_regs *, regs)
Chris Metcalf867e3592010-05-28 23:09:12 -0400559{
Chris Metcalf0707ad32010-06-25 17:04:17 -0400560 long error;
Chris Metcalf867e3592010-05-28 23:09:12 -0400561 char *filename;
562
563 filename = getname(path);
564 error = PTR_ERR(filename);
565 if (IS_ERR(filename))
566 goto out;
567 error = do_execve(filename, argv, envp, regs);
568 putname(filename);
569out:
570 return error;
571}
572
573#ifdef CONFIG_COMPAT
Chris Metcalfd929b6a2010-10-14 14:34:33 -0400574long compat_sys_execve(const char __user *path,
575 const compat_uptr_t __user *argv,
576 const compat_uptr_t __user *envp,
577 struct pt_regs *regs)
Chris Metcalf867e3592010-05-28 23:09:12 -0400578{
Chris Metcalf0707ad32010-06-25 17:04:17 -0400579 long error;
Chris Metcalf867e3592010-05-28 23:09:12 -0400580 char *filename;
581
582 filename = getname(path);
583 error = PTR_ERR(filename);
584 if (IS_ERR(filename))
585 goto out;
586 error = compat_do_execve(filename, argv, envp, regs);
587 putname(filename);
588out:
589 return error;
590}
591#endif
592
593unsigned long get_wchan(struct task_struct *p)
594{
595 struct KBacktraceIterator kbt;
596
597 if (!p || p == current || p->state == TASK_RUNNING)
598 return 0;
599
600 for (KBacktraceIterator_init(&kbt, p, NULL);
601 !KBacktraceIterator_end(&kbt);
602 KBacktraceIterator_next(&kbt)) {
603 if (!in_sched_functions(kbt.it.pc))
604 return kbt.it.pc;
605 }
606
607 return 0;
608}
609
610/*
611 * We pass in lr as zero (cleared in kernel_thread) and the caller
612 * part of the backtrace ABI on the stack also zeroed (in copy_thread)
613 * so that backtraces will stop with this function.
614 * Note that we don't use r0, since copy_thread() clears it.
615 */
616static void start_kernel_thread(int dummy, int (*fn)(int), int arg)
617{
618 do_exit(fn(arg));
619}
620
621/*
622 * Create a kernel thread
623 */
624int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
625{
626 struct pt_regs regs;
627
628 memset(&regs, 0, sizeof(regs));
629 regs.ex1 = PL_ICS_EX1(KERNEL_PL, 0); /* run at kernel PL, no ICS */
630 regs.pc = (long) start_kernel_thread;
631 regs.flags = PT_FLAGS_CALLER_SAVES; /* need to restore r1 and r2 */
632 regs.regs[1] = (long) fn; /* function pointer */
633 regs.regs[2] = (long) arg; /* parameter register */
634
635 /* Ok, create the new process.. */
636 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs,
637 0, NULL, NULL);
638}
639EXPORT_SYMBOL(kernel_thread);
640
641/* Flush thread state. */
642void flush_thread(void)
643{
644 /* Nothing */
645}
646
647/*
648 * Free current thread data structures etc..
649 */
650void exit_thread(void)
651{
652 /* Nothing */
653}
654
Chris Metcalf867e3592010-05-28 23:09:12 -0400655void show_regs(struct pt_regs *regs)
656{
657 struct task_struct *tsk = validate_current();
Chris Metcalf0707ad32010-06-25 17:04:17 -0400658 int i;
659
660 pr_err("\n");
661 pr_err(" Pid: %d, comm: %20s, CPU: %d\n",
Chris Metcalf867e3592010-05-28 23:09:12 -0400662 tsk->pid, tsk->comm, smp_processor_id());
Chris Metcalf0707ad32010-06-25 17:04:17 -0400663#ifdef __tilegx__
664 for (i = 0; i < 51; i += 3)
665 pr_err(" r%-2d: "REGFMT" r%-2d: "REGFMT" r%-2d: "REGFMT"\n",
666 i, regs->regs[i], i+1, regs->regs[i+1],
667 i+2, regs->regs[i+2]);
668 pr_err(" r51: "REGFMT" r52: "REGFMT" tp : "REGFMT"\n",
669 regs->regs[51], regs->regs[52], regs->tp);
670 pr_err(" sp : "REGFMT" lr : "REGFMT"\n", regs->sp, regs->lr);
671#else
Chris Metcalf7040dea2010-09-15 11:17:05 -0400672 for (i = 0; i < 52; i += 4)
Chris Metcalf0707ad32010-06-25 17:04:17 -0400673 pr_err(" r%-2d: "REGFMT" r%-2d: "REGFMT
674 " r%-2d: "REGFMT" r%-2d: "REGFMT"\n",
675 i, regs->regs[i], i+1, regs->regs[i+1],
676 i+2, regs->regs[i+2], i+3, regs->regs[i+3]);
677 pr_err(" r52: "REGFMT" tp : "REGFMT" sp : "REGFMT" lr : "REGFMT"\n",
678 regs->regs[52], regs->tp, regs->sp, regs->lr);
679#endif
680 pr_err(" pc : "REGFMT" ex1: %ld faultnum: %ld\n",
Chris Metcalf867e3592010-05-28 23:09:12 -0400681 regs->pc, regs->ex1, regs->faultnum);
682
683 dump_stack_regs(regs);
684}