Linux Audio

Check our new training course

Loading...
v4.10.11
  1/*
  2 * This file handles the architecture dependent parts of process handling.
  3 *
  4 *    Copyright IBM Corp. 1999, 2009
  5 *    Author(s): Martin Schwidefsky <schwidefsky@de.ibm.com>,
  6 *		 Hartmut Penner <hp@de.ibm.com>,
  7 *		 Denis Joseph Barrow,
  8 */
  9
 10#include <linux/elf-randomize.h>
 11#include <linux/compiler.h>
 12#include <linux/cpu.h>
 13#include <linux/sched.h>
 14#include <linux/kernel.h>
 15#include <linux/mm.h>
 16#include <linux/elfcore.h>
 17#include <linux/smp.h>
 18#include <linux/slab.h>
 19#include <linux/interrupt.h>
 20#include <linux/tick.h>
 21#include <linux/personality.h>
 22#include <linux/syscalls.h>
 23#include <linux/compat.h>
 24#include <linux/kprobes.h>
 25#include <linux/random.h>
 26#include <linux/module.h>
 27#include <linux/init_task.h>
 28#include <asm/io.h>
 29#include <asm/processor.h>
 30#include <asm/vtimer.h>
 31#include <asm/exec.h>
 32#include <asm/irq.h>
 33#include <asm/nmi.h>
 34#include <asm/smp.h>
 35#include <asm/switch_to.h>
 36#include <asm/runtime_instr.h>
 37#include "entry.h"
 38
 39asmlinkage void ret_from_fork(void) asm ("ret_from_fork");
 40
 41/*
 42 * Return saved PC of a blocked thread. used in kernel/sched.
 43 * resume in entry.S does not create a new stack frame, it
 44 * just stores the registers %r6-%r15 to the frame given by
 45 * schedule. We want to return the address of the caller of
 46 * schedule, so we have to walk the backchain one time to
 47 * find the frame schedule() store its return address.
 48 */
 49unsigned long thread_saved_pc(struct task_struct *tsk)
 50{
 51	struct stack_frame *sf, *low, *high;
 52
 53	if (!tsk || !task_stack_page(tsk))
 54		return 0;
 55	low = task_stack_page(tsk);
 56	high = (struct stack_frame *) task_pt_regs(tsk);
 57	sf = (struct stack_frame *) tsk->thread.ksp;
 58	if (sf <= low || sf > high)
 59		return 0;
 60	sf = (struct stack_frame *) sf->back_chain;
 61	if (sf <= low || sf > high)
 62		return 0;
 63	return sf->gprs[8];
 64}
 65
 66extern void kernel_thread_starter(void);
 67
 68/*
 69 * Free current thread data structures etc..
 70 */
 71void exit_thread(struct task_struct *tsk)
 72{
 73	if (tsk == current)
 74		exit_thread_runtime_instr();
 
 
 
 
 
 
 
 75}
 76
 77void flush_thread(void)
 78{
 
 
 79}
 80
 81void release_thread(struct task_struct *dead_task)
 82{
 
 83}
 84
 85void arch_release_task_struct(struct task_struct *tsk)
 
 
 
 
 
 86{
 
 87}
 88
 89int arch_dup_task_struct(struct task_struct *dst, struct task_struct *src)
 90{
 91	/*
 92	 * Save the floating-point or vector register state of the current
 93	 * task and set the CIF_FPU flag to lazy restore the FPU register
 94	 * state when returning to user space.
 95	 */
 96	save_fpu_regs();
 97
 98	memcpy(dst, src, arch_task_struct_size);
 99	dst->thread.fpu.regs = dst->thread.fpu.fprs;
100	return 0;
101}
102
103int copy_thread(unsigned long clone_flags, unsigned long new_stackp,
104		unsigned long arg, struct task_struct *p)
105{
 
106	struct fake_frame
107	{
108		struct stack_frame sf;
109		struct pt_regs childregs;
110	} *frame;
111
112	frame = container_of(task_pt_regs(p), struct fake_frame, childregs);
113	p->thread.ksp = (unsigned long) frame;
114	/* Save access registers to new thread structure. */
115	save_access_regs(&p->thread.acrs[0]);
116	/* start new process with ar4 pointing to the correct address space */
117	p->thread.mm_segment = get_fs();
118	/* Don't copy debug registers */
119	memset(&p->thread.per_user, 0, sizeof(p->thread.per_user));
120	memset(&p->thread.per_event, 0, sizeof(p->thread.per_event));
121	clear_tsk_thread_flag(p, TIF_SINGLE_STEP);
 
122	/* Initialize per thread user and system timer values */
123	p->thread.user_timer = 0;
124	p->thread.system_timer = 0;
 
125
126	frame->sf.back_chain = 0;
127	/* new return point is ret_from_fork */
128	frame->sf.gprs[8] = (unsigned long) ret_from_fork;
129	/* fake return stack for resume(), don't go back to schedule */
130	frame->sf.gprs[9] = (unsigned long) frame;
131
132	/* Store access registers to kernel stack of new process. */
133	if (unlikely(p->flags & PF_KTHREAD)) {
134		/* kernel thread */
135		memset(&frame->childregs, 0, sizeof(struct pt_regs));
136		frame->childregs.psw.mask = PSW_KERNEL_BITS | PSW_MASK_DAT |
137				PSW_MASK_IO | PSW_MASK_EXT | PSW_MASK_MCHECK;
138		frame->childregs.psw.addr =
139				(unsigned long) kernel_thread_starter;
140		frame->childregs.gprs[9] = new_stackp; /* function */
141		frame->childregs.gprs[10] = arg;
142		frame->childregs.gprs[11] = (unsigned long) do_exit;
143		frame->childregs.orig_gpr2 = -1;
144
145		return 0;
146	}
147	frame->childregs = *current_pt_regs();
148	frame->childregs.gprs[2] = 0;	/* child returns 0 on fork. */
149	frame->childregs.flags = 0;
150	if (new_stackp)
151		frame->childregs.gprs[15] = new_stackp;
152
153	/* Don't copy runtime instrumentation info */
154	p->thread.ri_cb = NULL;
 
155	frame->childregs.psw.mask &= ~PSW_MASK_RI;
156
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
157	/* Set a new TLS ?  */
158	if (clone_flags & CLONE_SETTLS) {
159		unsigned long tls = frame->childregs.gprs[6];
160		if (is_compat_task()) {
161			p->thread.acrs[0] = (unsigned int)tls;
162		} else {
163			p->thread.acrs[0] = (unsigned int)(tls >> 32);
164			p->thread.acrs[1] = (unsigned int)tls;
165		}
166	}
 
167	return 0;
168}
169
170asmlinkage void execve_tail(void)
171{
172	current->thread.fpu.fpc = 0;
173	asm volatile("sfpc %0" : : "d" (0));
 
174}
175
176/*
177 * fill in the FPU structure for a core dump.
178 */
179int dump_fpu (struct pt_regs * regs, s390_fp_regs *fpregs)
180{
181	save_fpu_regs();
182	fpregs->fpc = current->thread.fpu.fpc;
183	fpregs->pad = 0;
184	if (MACHINE_HAS_VX)
185		convert_vx_to_fp((freg_t *)&fpregs->fprs,
186				 current->thread.fpu.vxrs);
187	else
188		memcpy(&fpregs->fprs, current->thread.fpu.fprs,
189		       sizeof(fpregs->fprs));
 
 
 
190	return 1;
191}
192EXPORT_SYMBOL(dump_fpu);
193
194unsigned long get_wchan(struct task_struct *p)
195{
196	struct stack_frame *sf, *low, *high;
197	unsigned long return_address;
198	int count;
199
200	if (!p || p == current || p->state == TASK_RUNNING || !task_stack_page(p))
201		return 0;
202	low = task_stack_page(p);
203	high = (struct stack_frame *) task_pt_regs(p);
204	sf = (struct stack_frame *) p->thread.ksp;
205	if (sf <= low || sf > high)
206		return 0;
207	for (count = 0; count < 16; count++) {
208		sf = (struct stack_frame *) sf->back_chain;
209		if (sf <= low || sf > high)
210			return 0;
211		return_address = sf->gprs[8];
212		if (!in_sched_functions(return_address))
213			return return_address;
214	}
215	return 0;
216}
217
218unsigned long arch_align_stack(unsigned long sp)
219{
220	if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
221		sp -= get_random_int() & ~PAGE_MASK;
222	return sp & ~0xf;
223}
224
225static inline unsigned long brk_rnd(void)
226{
227	return (get_random_int() & BRK_RND_MASK) << PAGE_SHIFT;
 
 
 
 
228}
229
230unsigned long arch_randomize_brk(struct mm_struct *mm)
231{
232	unsigned long ret;
233
234	ret = PAGE_ALIGN(mm->brk + brk_rnd());
235	return (ret > mm->brk) ? ret : mm->brk;
 
 
 
 
 
 
 
 
 
 
236}
v3.15
  1/*
  2 * This file handles the architecture dependent parts of process handling.
  3 *
  4 *    Copyright IBM Corp. 1999, 2009
  5 *    Author(s): Martin Schwidefsky <schwidefsky@de.ibm.com>,
  6 *		 Hartmut Penner <hp@de.ibm.com>,
  7 *		 Denis Joseph Barrow,
  8 */
  9
 
 10#include <linux/compiler.h>
 11#include <linux/cpu.h>
 12#include <linux/sched.h>
 13#include <linux/kernel.h>
 14#include <linux/mm.h>
 15#include <linux/elfcore.h>
 16#include <linux/smp.h>
 17#include <linux/slab.h>
 18#include <linux/interrupt.h>
 19#include <linux/tick.h>
 20#include <linux/personality.h>
 21#include <linux/syscalls.h>
 22#include <linux/compat.h>
 23#include <linux/kprobes.h>
 24#include <linux/random.h>
 25#include <linux/module.h>
 
 26#include <asm/io.h>
 27#include <asm/processor.h>
 28#include <asm/vtimer.h>
 29#include <asm/exec.h>
 30#include <asm/irq.h>
 31#include <asm/nmi.h>
 32#include <asm/smp.h>
 33#include <asm/switch_to.h>
 34#include <asm/runtime_instr.h>
 35#include "entry.h"
 36
 37asmlinkage void ret_from_fork(void) asm ("ret_from_fork");
 38
 39/*
 40 * Return saved PC of a blocked thread. used in kernel/sched.
 41 * resume in entry.S does not create a new stack frame, it
 42 * just stores the registers %r6-%r15 to the frame given by
 43 * schedule. We want to return the address of the caller of
 44 * schedule, so we have to walk the backchain one time to
 45 * find the frame schedule() store its return address.
 46 */
 47unsigned long thread_saved_pc(struct task_struct *tsk)
 48{
 49	struct stack_frame *sf, *low, *high;
 50
 51	if (!tsk || !task_stack_page(tsk))
 52		return 0;
 53	low = task_stack_page(tsk);
 54	high = (struct stack_frame *) task_pt_regs(tsk);
 55	sf = (struct stack_frame *) (tsk->thread.ksp & PSW_ADDR_INSN);
 56	if (sf <= low || sf > high)
 57		return 0;
 58	sf = (struct stack_frame *) (sf->back_chain & PSW_ADDR_INSN);
 59	if (sf <= low || sf > high)
 60		return 0;
 61	return sf->gprs[8];
 62}
 63
 64void arch_cpu_idle(void)
 
 
 
 
 
 65{
 66	local_mcck_disable();
 67	if (test_thread_flag(TIF_MCCK_PENDING)) {
 68		local_mcck_enable();
 69		local_irq_enable();
 70		return;
 71	}
 72	/* Halt the cpu and keep track of cpu time accounting. */
 73	vtime_stop_cpu();
 74	local_irq_enable();
 75}
 76
 77void arch_cpu_idle_exit(void)
 78{
 79	if (test_thread_flag(TIF_MCCK_PENDING))
 80		s390_handle_mcck();
 81}
 82
 83void arch_cpu_idle_dead(void)
 84{
 85	cpu_die();
 86}
 87
 88extern void __kprobes kernel_thread_starter(void);
 89
 90/*
 91 * Free current thread data structures etc..
 92 */
 93void exit_thread(void)
 94{
 95	exit_thread_runtime_instr();
 96}
 97
 98void flush_thread(void)
 99{
100}
 
 
 
 
 
101
102void release_thread(struct task_struct *dead_task)
103{
 
104}
105
106int copy_thread(unsigned long clone_flags, unsigned long new_stackp,
107		unsigned long arg, struct task_struct *p)
108{
109	struct thread_info *ti;
110	struct fake_frame
111	{
112		struct stack_frame sf;
113		struct pt_regs childregs;
114	} *frame;
115
116	frame = container_of(task_pt_regs(p), struct fake_frame, childregs);
117	p->thread.ksp = (unsigned long) frame;
118	/* Save access registers to new thread structure. */
119	save_access_regs(&p->thread.acrs[0]);
120	/* start new process with ar4 pointing to the correct address space */
121	p->thread.mm_segment = get_fs();
122	/* Don't copy debug registers */
123	memset(&p->thread.per_user, 0, sizeof(p->thread.per_user));
124	memset(&p->thread.per_event, 0, sizeof(p->thread.per_event));
125	clear_tsk_thread_flag(p, TIF_SINGLE_STEP);
126	clear_tsk_thread_flag(p, TIF_PER_TRAP);
127	/* Initialize per thread user and system timer values */
128	ti = task_thread_info(p);
129	ti->user_timer = 0;
130	ti->system_timer = 0;
131
132	frame->sf.back_chain = 0;
133	/* new return point is ret_from_fork */
134	frame->sf.gprs[8] = (unsigned long) ret_from_fork;
135	/* fake return stack for resume(), don't go back to schedule */
136	frame->sf.gprs[9] = (unsigned long) frame;
137
138	/* Store access registers to kernel stack of new process. */
139	if (unlikely(p->flags & PF_KTHREAD)) {
140		/* kernel thread */
141		memset(&frame->childregs, 0, sizeof(struct pt_regs));
142		frame->childregs.psw.mask = PSW_KERNEL_BITS | PSW_MASK_DAT |
143				PSW_MASK_IO | PSW_MASK_EXT | PSW_MASK_MCHECK;
144		frame->childregs.psw.addr = PSW_ADDR_AMODE |
145				(unsigned long) kernel_thread_starter;
146		frame->childregs.gprs[9] = new_stackp; /* function */
147		frame->childregs.gprs[10] = arg;
148		frame->childregs.gprs[11] = (unsigned long) do_exit;
149		frame->childregs.orig_gpr2 = -1;
150
151		return 0;
152	}
153	frame->childregs = *current_pt_regs();
154	frame->childregs.gprs[2] = 0;	/* child returns 0 on fork. */
 
155	if (new_stackp)
156		frame->childregs.gprs[15] = new_stackp;
157
158	/* Don't copy runtime instrumentation info */
159	p->thread.ri_cb = NULL;
160	p->thread.ri_signum = 0;
161	frame->childregs.psw.mask &= ~PSW_MASK_RI;
162
163#ifndef CONFIG_64BIT
164	/*
165	 * save fprs to current->thread.fp_regs to merge them with
166	 * the emulated registers and then copy the result to the child.
167	 */
168	save_fp_ctl(&current->thread.fp_regs.fpc);
169	save_fp_regs(current->thread.fp_regs.fprs);
170	memcpy(&p->thread.fp_regs, &current->thread.fp_regs,
171	       sizeof(s390_fp_regs));
172	/* Set a new TLS ?  */
173	if (clone_flags & CLONE_SETTLS)
174		p->thread.acrs[0] = frame->childregs.gprs[6];
175#else /* CONFIG_64BIT */
176	/* Save the fpu registers to new thread structure. */
177	save_fp_ctl(&p->thread.fp_regs.fpc);
178	save_fp_regs(p->thread.fp_regs.fprs);
179	p->thread.fp_regs.pad = 0;
180	/* Set a new TLS ?  */
181	if (clone_flags & CLONE_SETTLS) {
182		unsigned long tls = frame->childregs.gprs[6];
183		if (is_compat_task()) {
184			p->thread.acrs[0] = (unsigned int)tls;
185		} else {
186			p->thread.acrs[0] = (unsigned int)(tls >> 32);
187			p->thread.acrs[1] = (unsigned int)tls;
188		}
189	}
190#endif /* CONFIG_64BIT */
191	return 0;
192}
193
194asmlinkage void execve_tail(void)
195{
196	current->thread.fp_regs.fpc = 0;
197	if (MACHINE_HAS_IEEE)
198		asm volatile("sfpc %0,%0" : : "d" (0));
199}
200
201/*
202 * fill in the FPU structure for a core dump.
203 */
204int dump_fpu (struct pt_regs * regs, s390_fp_regs *fpregs)
205{
206#ifndef CONFIG_64BIT
207	/*
208	 * save fprs to current->thread.fp_regs to merge them with
209	 * the emulated registers and then copy the result to the dump.
210	 */
211	save_fp_ctl(&current->thread.fp_regs.fpc);
212	save_fp_regs(current->thread.fp_regs.fprs);
213	memcpy(fpregs, &current->thread.fp_regs, sizeof(s390_fp_regs));
214#else /* CONFIG_64BIT */
215	save_fp_ctl(&fpregs->fpc);
216	save_fp_regs(fpregs->fprs);
217#endif /* CONFIG_64BIT */
218	return 1;
219}
220EXPORT_SYMBOL(dump_fpu);
221
222unsigned long get_wchan(struct task_struct *p)
223{
224	struct stack_frame *sf, *low, *high;
225	unsigned long return_address;
226	int count;
227
228	if (!p || p == current || p->state == TASK_RUNNING || !task_stack_page(p))
229		return 0;
230	low = task_stack_page(p);
231	high = (struct stack_frame *) task_pt_regs(p);
232	sf = (struct stack_frame *) (p->thread.ksp & PSW_ADDR_INSN);
233	if (sf <= low || sf > high)
234		return 0;
235	for (count = 0; count < 16; count++) {
236		sf = (struct stack_frame *) (sf->back_chain & PSW_ADDR_INSN);
237		if (sf <= low || sf > high)
238			return 0;
239		return_address = sf->gprs[8] & PSW_ADDR_INSN;
240		if (!in_sched_functions(return_address))
241			return return_address;
242	}
243	return 0;
244}
245
246unsigned long arch_align_stack(unsigned long sp)
247{
248	if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
249		sp -= get_random_int() & ~PAGE_MASK;
250	return sp & ~0xf;
251}
252
253static inline unsigned long brk_rnd(void)
254{
255	/* 8MB for 32bit, 1GB for 64bit */
256	if (is_32bit_task())
257		return (get_random_int() & 0x7ffUL) << PAGE_SHIFT;
258	else
259		return (get_random_int() & 0x3ffffUL) << PAGE_SHIFT;
260}
261
262unsigned long arch_randomize_brk(struct mm_struct *mm)
263{
264	unsigned long ret;
265
266	ret = PAGE_ALIGN(mm->brk + brk_rnd());
267	return (ret > mm->brk) ? ret : mm->brk;
268}
269
270unsigned long randomize_et_dyn(unsigned long base)
271{
272	unsigned long ret;
273
274	if (!(current->flags & PF_RANDOMIZE))
275		return base;
276	ret = PAGE_ALIGN(base + brk_rnd());
277	return (ret > base) ? ret : base;
278}