6d0d287891
No need to duplicate the same define everywhere. Since the only user is stop-machine and the only provider is s390, we can use a default implementation of cpu_relax_yield() in sched.h. Suggested-by: Russell King <rmk+kernel@armlinux.org.uk> Signed-off-by: Christian Borntraeger <borntraeger@de.ibm.com> Reviewed-by: David Hildenbrand <david@redhat.com> Acked-by: Russell King <rmk+kernel@armlinux.org.uk> Cc: Andrew Morton <akpm@linux-foundation.org> Cc: Catalin Marinas <catalin.marinas@arm.com> Cc: Heiko Carstens <heiko.carstens@de.ibm.com> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Martin Schwidefsky <schwidefsky@de.ibm.com> Cc: Nicholas Piggin <npiggin@gmail.com> Cc: Noam Camus <noamc@ezchip.com> Cc: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: Will Deacon <will.deacon@arm.com> Cc: kvm@vger.kernel.org Cc: linux-arch@vger.kernel.org Cc: linux-s390 <linux-s390@vger.kernel.org> Cc: linuxppc-dev@lists.ozlabs.org Cc: sparclinux@vger.kernel.org Cc: virtualization@lists.linux-foundation.org Cc: xen-devel@lists.xenproject.org Link: http://lkml.kernel.org/r/1479298985-191589-1-git-send-email-borntraeger@de.ibm.com Signed-off-by: Ingo Molnar <mingo@kernel.org>
70 lines
1.8 KiB
C
70 lines
1.8 KiB
C
/*
|
|
* include/asm-cris/processor.h
|
|
*
|
|
* Copyright (C) 2000, 2001 Axis Communications AB
|
|
*
|
|
* Authors: Bjorn Wesen Initial version
|
|
*
|
|
*/
|
|
|
|
#ifndef __ASM_CRIS_PROCESSOR_H
|
|
#define __ASM_CRIS_PROCESSOR_H
|
|
|
|
#include <asm/page.h>
|
|
#include <asm/ptrace.h>
|
|
#include <arch/processor.h>
|
|
#include <arch/system.h>
|
|
|
|
struct task_struct;
|
|
|
|
#define STACK_TOP TASK_SIZE
|
|
#define STACK_TOP_MAX STACK_TOP
|
|
|
|
/* This decides where the kernel will search for a free chunk of vm
|
|
* space during mmap's.
|
|
*/
|
|
#define TASK_UNMAPPED_BASE (PAGE_ALIGN(TASK_SIZE / 3))
|
|
|
|
/* THREAD_SIZE is the size of the thread_info/kernel_stack combo.
|
|
* normally, the stack is found by doing something like p + THREAD_SIZE
|
|
* in CRIS, a page is 8192 bytes, which seems like a sane size
|
|
*/
|
|
#define THREAD_SIZE PAGE_SIZE
|
|
#define THREAD_SIZE_ORDER (0)
|
|
|
|
/*
|
|
* At user->kernel entry, the pt_regs struct is stacked on the top of the kernel-stack.
|
|
* This macro allows us to find those regs for a task.
|
|
* Notice that subsequent pt_regs stackings, like recursive interrupts occurring while
|
|
* we're in the kernel, won't affect this - only the first user->kernel transition
|
|
* registers are reached by this.
|
|
*/
|
|
|
|
#define user_regs(thread_info) (((struct pt_regs *)((unsigned long)(thread_info) + THREAD_SIZE)) - 1)
|
|
|
|
/*
|
|
* Dito but for the currently running task
|
|
*/
|
|
|
|
#define task_pt_regs(task) user_regs(task_thread_info(task))
|
|
|
|
unsigned long get_wchan(struct task_struct *p);
|
|
|
|
#define KSTK_ESP(tsk) ((tsk) == current ? rdusp() : (tsk)->thread.usp)
|
|
|
|
extern unsigned long thread_saved_pc(struct task_struct *tsk);
|
|
|
|
/* Free all resources held by a thread. */
|
|
static inline void release_thread(struct task_struct *dead_task)
|
|
{
|
|
/* Nothing needs to be done. */
|
|
}
|
|
|
|
#define init_stack (init_thread_union.stack)
|
|
|
|
#define cpu_relax() barrier()
|
|
|
|
void default_idle(void);
|
|
|
|
#endif /* __ASM_CRIS_PROCESSOR_H */
|