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