aboutsummaryrefslogtreecommitdiffstats
path: root/include/asm-cris/processor.h
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
commit1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 (patch)
tree0bba044c4ce775e45a88a51686b5d9f90697ea9d /include/asm-cris/processor.h
Linux-2.6.12-rc2v2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
Diffstat (limited to 'include/asm-cris/processor.h')
-rw-r--r--include/asm-cris/processor.h79
1 files changed, 79 insertions, 0 deletions
diff --git a/include/asm-cris/processor.h b/include/asm-cris/processor.h
new file mode 100644
index 000000000000..623bdf06d911
--- /dev/null
+++ b/include/asm-cris/processor.h
@@ -0,0 +1,79 @@
1/*
2 * include/asm-cris/processor.h
3 *
4 * Copyright (C) 2000, 2001 Axis Communications AB
5 *
6 * Authors: Bjorn Wesen Initial version
7 *
8 */
9
10#ifndef __ASM_CRIS_PROCESSOR_H
11#define __ASM_CRIS_PROCESSOR_H
12
13#include <linux/config.h>
14#include <asm/system.h>
15#include <asm/page.h>
16#include <asm/ptrace.h>
17#include <asm/arch/processor.h>
18
19/* This decides where the kernel will search for a free chunk of vm
20 * space during mmap's.
21 */
22#define TASK_UNMAPPED_BASE (PAGE_ALIGN(TASK_SIZE / 3))
23
24/* THREAD_SIZE is the size of the task_struct/kernel_stack combo.
25 * normally, the stack is found by doing something like p + THREAD_SIZE
26 * in CRIS, a page is 8192 bytes, which seems like a sane size
27 */
28
29#define THREAD_SIZE PAGE_SIZE
30#define KERNEL_STACK_SIZE PAGE_SIZE
31
32/*
33 * At user->kernel entry, the pt_regs struct is stacked on the top of the kernel-stack.
34 * This macro allows us to find those regs for a task.
35 * Notice that subsequent pt_regs stackings, like recursive interrupts occurring while
36 * we're in the kernel, won't affect this - only the first user->kernel transition
37 * registers are reached by this.
38 */
39
40#define user_regs(thread_info) (((struct pt_regs *)((unsigned long)(thread_info) + THREAD_SIZE)) - 1)
41
42/*
43 * Dito but for the currently running task
44 */
45
46#define current_regs() user_regs(current->thread_info)
47
48extern inline void prepare_to_copy(struct task_struct *tsk)
49{
50}
51
52extern int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags);
53
54unsigned long get_wchan(struct task_struct *p);
55
56#define KSTK_ESP(tsk) ((tsk) == current ? rdusp() : (tsk)->thread.usp)
57
58/*
59 * Free current thread data structures etc..
60 */
61
62extern inline void exit_thread(void)
63{
64 /* Nothing needs to be done. */
65}
66
67extern unsigned long thread_saved_pc(struct task_struct *tsk);
68
69/* Free all resources held by a thread. */
70extern inline void release_thread(struct task_struct *dead_task)
71{
72 /* Nothing needs to be done. */
73}
74
75#define init_stack (init_thread_union.stack)
76
77#define cpu_relax() barrier()
78
79#endif /* __ASM_CRIS_PROCESSOR_H */