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 <asm/page.h> 14#include <asm/ptrace.h> 15#include <arch/processor.h> 16#include <arch/system.h> 17 18struct task_struct; 19 20#define STACK_TOP TASK_SIZE 21#define STACK_TOP_MAX STACK_TOP 22 23/* This decides where the kernel will search for a free chunk of vm 24 * space during mmap's. 25 */ 26#define TASK_UNMAPPED_BASE (PAGE_ALIGN(TASK_SIZE / 3)) 27 28/* THREAD_SIZE is the size of the thread_info/kernel_stack combo. 29 * normally, the stack is found by doing something like p + THREAD_SIZE 30 * in CRIS, a page is 8192 bytes, which seems like a sane size 31 */ 32#define THREAD_SIZE PAGE_SIZE 33#define THREAD_SIZE_ORDER (0) 34 35/* 36 * At user->kernel entry, the pt_regs struct is stacked on the top of the kernel-stack. 37 * This macro allows us to find those regs for a task. 38 * Notice that subsequent pt_regs stackings, like recursive interrupts occurring while 39 * we're in the kernel, won't affect this - only the first user->kernel transition 40 * registers are reached by this. 41 */ 42 43#define user_regs(thread_info) (((struct pt_regs *)((unsigned long)(thread_info) + THREAD_SIZE)) - 1) 44 45/* 46 * Dito but for the currently running task 47 */ 48 49#define task_pt_regs(task) user_regs(task_thread_info(task)) 50 51unsigned long get_wchan(struct task_struct *p); 52 53#define KSTK_ESP(tsk) ((tsk) == current ? rdusp() : (tsk)->thread.usp) 54 55extern unsigned long thread_saved_pc(struct task_struct *tsk); 56 57/* Free all resources held by a thread. */ 58static inline void release_thread(struct task_struct *dead_task) 59{ 60 /* Nothing needs to be done. */ 61} 62 63#define init_stack (init_thread_union.stack) 64 65#define cpu_relax() barrier() 66#define cpu_relax_lowlatency() cpu_relax() 67 68void default_idle(void); 69 70#endif /* __ASM_CRIS_PROCESSOR_H */ 71