aboutsummaryrefslogtreecommitdiffstats
path: root/arch/sh/kernel/process_32.c
diff options
context:
space:
mode:
authorGiuseppe CAVALLARO <peppe.cavallaro@st.com>2009-07-07 10:25:10 -0400
committerPaul Mundt <lethal@linux-sh.org>2009-11-24 02:23:38 -0500
commita0458b07c17a10ea316e6ae65ab15b78bf5f44ee (patch)
tree16211bec010bd65fe08f818ecb94075bec4d988e /arch/sh/kernel/process_32.c
parenta8a8a669ea13d792296737505adc43ccacf3a648 (diff)
sh: add sleazy FPU optimization
sh port of the sLeAZY-fpu feature currently implemented for some architectures such us i386. Right now the SH kernel has a 100% lazy fpu behaviour. This is of course great for applications that have very sporadic or no FPU use. However for very frequent FPU users... you take an extra trap every context switch. The patch below adds a simple heuristic to this code: after 5 consecutive context switches of FPU use, the lazy behavior is disabled and the context gets restored every context switch. After 256 switches, this is reset and the 100% lazy behavior is returned. Tests with LMbench showed no regression. I saw a little improvement due to the prefetching (~2%). The tests below also show that, with this sLeazy patch, indeed, the number of FPU exceptions is reduced. To test this. I hacked the lat_ctx LMBench to use the FPU a little more. sLeasy implementation =========================================== switch_to calls | 79326 sleasy calls | 42577 do_fpu_state_restore calls| 59232 restore_fpu calls | 59032 Exceptions: 0x800 (FPU disabled ): 16604 100% Leazy (default implementation) =========================================== switch_to calls | 79690 do_fpu_state_restore calls | 53299 restore_fpu calls | 53101 Exceptions: 0x800 (FPU disabled ): 53273 Signed-off-by: Giuseppe Cavallaro <peppe.cavallaro@st.com> Signed-off-by: Stuart Menefy <stuart.menefy@st.com> Signed-off-by: Paul Mundt <lethal@linux-sh.org>
Diffstat (limited to 'arch/sh/kernel/process_32.c')
-rw-r--r--arch/sh/kernel/process_32.c16
1 files changed, 16 insertions, 0 deletions
diff --git a/arch/sh/kernel/process_32.c b/arch/sh/kernel/process_32.c
index 0673c4746be3..aff5fe02e393 100644
--- a/arch/sh/kernel/process_32.c
+++ b/arch/sh/kernel/process_32.c
@@ -288,8 +288,14 @@ static void ubc_set_tracing(int asid, unsigned long pc)
288__notrace_funcgraph struct task_struct * 288__notrace_funcgraph struct task_struct *
289__switch_to(struct task_struct *prev, struct task_struct *next) 289__switch_to(struct task_struct *prev, struct task_struct *next)
290{ 290{
291 struct thread_struct *next_t = &next->thread;
292
291#if defined(CONFIG_SH_FPU) 293#if defined(CONFIG_SH_FPU)
292 unlazy_fpu(prev, task_pt_regs(prev)); 294 unlazy_fpu(prev, task_pt_regs(prev));
295
296 /* we're going to use this soon, after a few expensive things */
297 if (next->fpu_counter > 5)
298 prefetch(&next_t->fpu.hard);
293#endif 299#endif
294 300
295#ifdef CONFIG_MMU 301#ifdef CONFIG_MMU
@@ -321,6 +327,16 @@ __switch_to(struct task_struct *prev, struct task_struct *next)
321#endif 327#endif
322 } 328 }
323 329
330#if defined(CONFIG_SH_FPU)
331 /* If the task has used fpu the last 5 timeslices, just do a full
332 * restore of the math state immediately to avoid the trap; the
333 * chances of needing FPU soon are obviously high now
334 */
335 if (next->fpu_counter > 5) {
336 fpu_state_restore(task_pt_regs(next));
337 }
338#endif
339
324 return prev; 340 return prev;
325} 341}
326 342