blob: c3c75a234f506a71b815251f1575135ead5cd0c9 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
4 * for more details.
5 *
6 * Synthesize TLB refill handlers at runtime.
7 *
8 * Copyright (C) 2004,2005 by Thiemo Seufer
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00009 * Copyright (C) 2005 Maciej W. Rozycki
Linus Torvalds1da177e2005-04-16 15:20:36 -070010 */
11
12#include <stdarg.h>
13
14#include <linux/config.h>
15#include <linux/mm.h>
16#include <linux/kernel.h>
17#include <linux/types.h>
18#include <linux/string.h>
19#include <linux/init.h>
20
21#include <asm/pgtable.h>
22#include <asm/cacheflush.h>
23#include <asm/mmu_context.h>
24#include <asm/inst.h>
25#include <asm/elf.h>
26#include <asm/smp.h>
27#include <asm/war.h>
28
29/* #define DEBUG_TLB */
30
31static __init int __attribute__((unused)) r45k_bvahwbug(void)
32{
33 /* XXX: We should probe for the presence of this bug, but we don't. */
34 return 0;
35}
36
37static __init int __attribute__((unused)) r4k_250MHZhwbug(void)
38{
39 /* XXX: We should probe for the presence of this bug, but we don't. */
40 return 0;
41}
42
43static __init int __attribute__((unused)) bcm1250_m3_war(void)
44{
45 return BCM1250_M3_WAR;
46}
47
48static __init int __attribute__((unused)) r10000_llsc_war(void)
49{
50 return R10000_LLSC_WAR;
51}
52
53/*
54 * A little micro-assembler, intended for TLB refill handler
55 * synthesizing. It is intentionally kept simple, does only support
56 * a subset of instructions, and does not try to hide pipeline effects
57 * like branch delay slots.
58 */
59
60enum fields
61{
62 RS = 0x001,
63 RT = 0x002,
64 RD = 0x004,
65 RE = 0x008,
66 SIMM = 0x010,
67 UIMM = 0x020,
68 BIMM = 0x040,
69 JIMM = 0x080,
70 FUNC = 0x100,
71};
72
73#define OP_MASK 0x2f
74#define OP_SH 26
75#define RS_MASK 0x1f
76#define RS_SH 21
77#define RT_MASK 0x1f
78#define RT_SH 16
79#define RD_MASK 0x1f
80#define RD_SH 11
81#define RE_MASK 0x1f
82#define RE_SH 6
83#define IMM_MASK 0xffff
84#define IMM_SH 0
85#define JIMM_MASK 0x3ffffff
86#define JIMM_SH 0
87#define FUNC_MASK 0x2f
88#define FUNC_SH 0
89
90enum opcode {
91 insn_invalid,
92 insn_addu, insn_addiu, insn_and, insn_andi, insn_beq,
93 insn_beql, insn_bgez, insn_bgezl, insn_bltz, insn_bltzl,
94 insn_bne, insn_daddu, insn_daddiu, insn_dmfc0, insn_dmtc0,
Thiemo Seufer1b3a6e92005-04-01 14:07:13 +000095 insn_dsll, insn_dsll32, insn_dsra, insn_dsrl,
Linus Torvalds1da177e2005-04-16 15:20:36 -070096 insn_dsubu, insn_eret, insn_j, insn_jal, insn_jr, insn_ld,
97 insn_ll, insn_lld, insn_lui, insn_lw, insn_mfc0, insn_mtc0,
98 insn_ori, insn_rfe, insn_sc, insn_scd, insn_sd, insn_sll,
99 insn_sra, insn_srl, insn_subu, insn_sw, insn_tlbp, insn_tlbwi,
100 insn_tlbwr, insn_xor, insn_xori
101};
102
103struct insn {
104 enum opcode opcode;
105 u32 match;
106 enum fields fields;
107};
108
109/* This macro sets the non-variable bits of an instruction. */
110#define M(a, b, c, d, e, f) \
111 ((a) << OP_SH \
112 | (b) << RS_SH \
113 | (c) << RT_SH \
114 | (d) << RD_SH \
115 | (e) << RE_SH \
116 | (f) << FUNC_SH)
117
118static __initdata struct insn insn_table[] = {
119 { insn_addiu, M(addiu_op,0,0,0,0,0), RS | RT | SIMM },
120 { insn_addu, M(spec_op,0,0,0,0,addu_op), RS | RT | RD },
121 { insn_and, M(spec_op,0,0,0,0,and_op), RS | RT | RD },
122 { insn_andi, M(andi_op,0,0,0,0,0), RS | RT | UIMM },
123 { insn_beq, M(beq_op,0,0,0,0,0), RS | RT | BIMM },
124 { insn_beql, M(beql_op,0,0,0,0,0), RS | RT | BIMM },
125 { insn_bgez, M(bcond_op,0,bgez_op,0,0,0), RS | BIMM },
126 { insn_bgezl, M(bcond_op,0,bgezl_op,0,0,0), RS | BIMM },
127 { insn_bltz, M(bcond_op,0,bltz_op,0,0,0), RS | BIMM },
128 { insn_bltzl, M(bcond_op,0,bltzl_op,0,0,0), RS | BIMM },
129 { insn_bne, M(bne_op,0,0,0,0,0), RS | RT | BIMM },
130 { insn_daddiu, M(daddiu_op,0,0,0,0,0), RS | RT | SIMM },
131 { insn_daddu, M(spec_op,0,0,0,0,daddu_op), RS | RT | RD },
132 { insn_dmfc0, M(cop0_op,dmfc_op,0,0,0,0), RT | RD },
133 { insn_dmtc0, M(cop0_op,dmtc_op,0,0,0,0), RT | RD },
134 { insn_dsll, M(spec_op,0,0,0,0,dsll_op), RT | RD | RE },
135 { insn_dsll32, M(spec_op,0,0,0,0,dsll32_op), RT | RD | RE },
136 { insn_dsra, M(spec_op,0,0,0,0,dsra_op), RT | RD | RE },
137 { insn_dsrl, M(spec_op,0,0,0,0,dsrl_op), RT | RD | RE },
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 { insn_dsubu, M(spec_op,0,0,0,0,dsubu_op), RS | RT | RD },
139 { insn_eret, M(cop0_op,cop_op,0,0,0,eret_op), 0 },
140 { insn_j, M(j_op,0,0,0,0,0), JIMM },
141 { insn_jal, M(jal_op,0,0,0,0,0), JIMM },
142 { insn_jr, M(spec_op,0,0,0,0,jr_op), RS },
143 { insn_ld, M(ld_op,0,0,0,0,0), RS | RT | SIMM },
144 { insn_ll, M(ll_op,0,0,0,0,0), RS | RT | SIMM },
145 { insn_lld, M(lld_op,0,0,0,0,0), RS | RT | SIMM },
146 { insn_lui, M(lui_op,0,0,0,0,0), RT | SIMM },
147 { insn_lw, M(lw_op,0,0,0,0,0), RS | RT | SIMM },
148 { insn_mfc0, M(cop0_op,mfc_op,0,0,0,0), RT | RD },
149 { insn_mtc0, M(cop0_op,mtc_op,0,0,0,0), RT | RD },
150 { insn_ori, M(ori_op,0,0,0,0,0), RS | RT | UIMM },
151 { insn_rfe, M(cop0_op,cop_op,0,0,0,rfe_op), 0 },
152 { insn_sc, M(sc_op,0,0,0,0,0), RS | RT | SIMM },
153 { insn_scd, M(scd_op,0,0,0,0,0), RS | RT | SIMM },
154 { insn_sd, M(sd_op,0,0,0,0,0), RS | RT | SIMM },
155 { insn_sll, M(spec_op,0,0,0,0,sll_op), RT | RD | RE },
156 { insn_sra, M(spec_op,0,0,0,0,sra_op), RT | RD | RE },
157 { insn_srl, M(spec_op,0,0,0,0,srl_op), RT | RD | RE },
158 { insn_subu, M(spec_op,0,0,0,0,subu_op), RS | RT | RD },
159 { insn_sw, M(sw_op,0,0,0,0,0), RS | RT | SIMM },
160 { insn_tlbp, M(cop0_op,cop_op,0,0,0,tlbp_op), 0 },
161 { insn_tlbwi, M(cop0_op,cop_op,0,0,0,tlbwi_op), 0 },
162 { insn_tlbwr, M(cop0_op,cop_op,0,0,0,tlbwr_op), 0 },
163 { insn_xor, M(spec_op,0,0,0,0,xor_op), RS | RT | RD },
164 { insn_xori, M(xori_op,0,0,0,0,0), RS | RT | UIMM },
165 { insn_invalid, 0, 0 }
166};
167
168#undef M
169
170static __init u32 build_rs(u32 arg)
171{
172 if (arg & ~RS_MASK)
173 printk(KERN_WARNING "TLB synthesizer field overflow\n");
174
175 return (arg & RS_MASK) << RS_SH;
176}
177
178static __init u32 build_rt(u32 arg)
179{
180 if (arg & ~RT_MASK)
181 printk(KERN_WARNING "TLB synthesizer field overflow\n");
182
183 return (arg & RT_MASK) << RT_SH;
184}
185
186static __init u32 build_rd(u32 arg)
187{
188 if (arg & ~RD_MASK)
189 printk(KERN_WARNING "TLB synthesizer field overflow\n");
190
191 return (arg & RD_MASK) << RD_SH;
192}
193
194static __init u32 build_re(u32 arg)
195{
196 if (arg & ~RE_MASK)
197 printk(KERN_WARNING "TLB synthesizer field overflow\n");
198
199 return (arg & RE_MASK) << RE_SH;
200}
201
202static __init u32 build_simm(s32 arg)
203{
204 if (arg > 0x7fff || arg < -0x8000)
205 printk(KERN_WARNING "TLB synthesizer field overflow\n");
206
207 return arg & 0xffff;
208}
209
210static __init u32 build_uimm(u32 arg)
211{
212 if (arg & ~IMM_MASK)
213 printk(KERN_WARNING "TLB synthesizer field overflow\n");
214
215 return arg & IMM_MASK;
216}
217
218static __init u32 build_bimm(s32 arg)
219{
220 if (arg > 0x1ffff || arg < -0x20000)
221 printk(KERN_WARNING "TLB synthesizer field overflow\n");
222
223 if (arg & 0x3)
224 printk(KERN_WARNING "Invalid TLB synthesizer branch target\n");
225
226 return ((arg < 0) ? (1 << 15) : 0) | ((arg >> 2) & 0x7fff);
227}
228
229static __init u32 build_jimm(u32 arg)
230{
231 if (arg & ~((JIMM_MASK) << 2))
232 printk(KERN_WARNING "TLB synthesizer field overflow\n");
233
234 return (arg >> 2) & JIMM_MASK;
235}
236
237static __init u32 build_func(u32 arg)
238{
239 if (arg & ~FUNC_MASK)
240 printk(KERN_WARNING "TLB synthesizer field overflow\n");
241
242 return arg & FUNC_MASK;
243}
244
245/*
246 * The order of opcode arguments is implicitly left to right,
247 * starting with RS and ending with FUNC or IMM.
248 */
249static void __init build_insn(u32 **buf, enum opcode opc, ...)
250{
251 struct insn *ip = NULL;
252 unsigned int i;
253 va_list ap;
254 u32 op;
255
256 for (i = 0; insn_table[i].opcode != insn_invalid; i++)
257 if (insn_table[i].opcode == opc) {
258 ip = &insn_table[i];
259 break;
260 }
261
262 if (!ip)
263 panic("Unsupported TLB synthesizer instruction %d", opc);
264
265 op = ip->match;
266 va_start(ap, opc);
267 if (ip->fields & RS) op |= build_rs(va_arg(ap, u32));
268 if (ip->fields & RT) op |= build_rt(va_arg(ap, u32));
269 if (ip->fields & RD) op |= build_rd(va_arg(ap, u32));
270 if (ip->fields & RE) op |= build_re(va_arg(ap, u32));
271 if (ip->fields & SIMM) op |= build_simm(va_arg(ap, s32));
272 if (ip->fields & UIMM) op |= build_uimm(va_arg(ap, u32));
273 if (ip->fields & BIMM) op |= build_bimm(va_arg(ap, s32));
274 if (ip->fields & JIMM) op |= build_jimm(va_arg(ap, u32));
275 if (ip->fields & FUNC) op |= build_func(va_arg(ap, u32));
276 va_end(ap);
277
278 **buf = op;
279 (*buf)++;
280}
281
282#define I_u1u2u3(op) \
283 static inline void i##op(u32 **buf, unsigned int a, \
284 unsigned int b, unsigned int c) \
285 { \
286 build_insn(buf, insn##op, a, b, c); \
287 }
288
289#define I_u2u1u3(op) \
290 static inline void i##op(u32 **buf, unsigned int a, \
291 unsigned int b, unsigned int c) \
292 { \
293 build_insn(buf, insn##op, b, a, c); \
294 }
295
296#define I_u3u1u2(op) \
297 static inline void i##op(u32 **buf, unsigned int a, \
298 unsigned int b, unsigned int c) \
299 { \
300 build_insn(buf, insn##op, b, c, a); \
301 }
302
303#define I_u1u2s3(op) \
304 static inline void i##op(u32 **buf, unsigned int a, \
305 unsigned int b, signed int c) \
306 { \
307 build_insn(buf, insn##op, a, b, c); \
308 }
309
310#define I_u2s3u1(op) \
311 static inline void i##op(u32 **buf, unsigned int a, \
312 signed int b, unsigned int c) \
313 { \
314 build_insn(buf, insn##op, c, a, b); \
315 }
316
317#define I_u2u1s3(op) \
318 static inline void i##op(u32 **buf, unsigned int a, \
319 unsigned int b, signed int c) \
320 { \
321 build_insn(buf, insn##op, b, a, c); \
322 }
323
324#define I_u1u2(op) \
325 static inline void i##op(u32 **buf, unsigned int a, \
326 unsigned int b) \
327 { \
328 build_insn(buf, insn##op, a, b); \
329 }
330
331#define I_u1s2(op) \
332 static inline void i##op(u32 **buf, unsigned int a, \
333 signed int b) \
334 { \
335 build_insn(buf, insn##op, a, b); \
336 }
337
338#define I_u1(op) \
339 static inline void i##op(u32 **buf, unsigned int a) \
340 { \
341 build_insn(buf, insn##op, a); \
342 }
343
344#define I_0(op) \
345 static inline void i##op(u32 **buf) \
346 { \
347 build_insn(buf, insn##op); \
348 }
349
350I_u2u1s3(_addiu);
351I_u3u1u2(_addu);
352I_u2u1u3(_andi);
353I_u3u1u2(_and);
354I_u1u2s3(_beq);
355I_u1u2s3(_beql);
356I_u1s2(_bgez);
357I_u1s2(_bgezl);
358I_u1s2(_bltz);
359I_u1s2(_bltzl);
360I_u1u2s3(_bne);
361I_u1u2(_dmfc0);
362I_u1u2(_dmtc0);
363I_u2u1s3(_daddiu);
364I_u3u1u2(_daddu);
365I_u2u1u3(_dsll);
366I_u2u1u3(_dsll32);
367I_u2u1u3(_dsra);
368I_u2u1u3(_dsrl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369I_u3u1u2(_dsubu);
370I_0(_eret);
371I_u1(_j);
372I_u1(_jal);
373I_u1(_jr);
374I_u2s3u1(_ld);
375I_u2s3u1(_ll);
376I_u2s3u1(_lld);
377I_u1s2(_lui);
378I_u2s3u1(_lw);
379I_u1u2(_mfc0);
380I_u1u2(_mtc0);
381I_u2u1u3(_ori);
382I_0(_rfe);
383I_u2s3u1(_sc);
384I_u2s3u1(_scd);
385I_u2s3u1(_sd);
386I_u2u1u3(_sll);
387I_u2u1u3(_sra);
388I_u2u1u3(_srl);
389I_u3u1u2(_subu);
390I_u2s3u1(_sw);
391I_0(_tlbp);
392I_0(_tlbwi);
393I_0(_tlbwr);
394I_u3u1u2(_xor)
395I_u2u1u3(_xori);
396
397/*
398 * handling labels
399 */
400
401enum label_id {
402 label_invalid,
403 label_second_part,
404 label_leave,
405 label_vmalloc,
406 label_vmalloc_done,
407 label_tlbw_hazard,
408 label_split,
409 label_nopage_tlbl,
410 label_nopage_tlbs,
411 label_nopage_tlbm,
412 label_smp_pgtable_change,
413 label_r3000_write_probe_fail,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414};
415
416struct label {
417 u32 *addr;
418 enum label_id lab;
419};
420
421static __init void build_label(struct label **lab, u32 *addr,
422 enum label_id l)
423{
424 (*lab)->addr = addr;
425 (*lab)->lab = l;
426 (*lab)++;
427}
428
429#define L_LA(lb) \
430 static inline void l##lb(struct label **lab, u32 *addr) \
431 { \
432 build_label(lab, addr, label##lb); \
433 }
434
435L_LA(_second_part)
436L_LA(_leave)
437L_LA(_vmalloc)
438L_LA(_vmalloc_done)
439L_LA(_tlbw_hazard)
440L_LA(_split)
441L_LA(_nopage_tlbl)
442L_LA(_nopage_tlbs)
443L_LA(_nopage_tlbm)
444L_LA(_smp_pgtable_change)
445L_LA(_r3000_write_probe_fail)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446
447/* convenience macros for instructions */
Ralf Baechle875d43e2005-09-03 15:56:16 -0700448#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449# define i_LW(buf, rs, rt, off) i_ld(buf, rs, rt, off)
450# define i_SW(buf, rs, rt, off) i_sd(buf, rs, rt, off)
451# define i_SLL(buf, rs, rt, sh) i_dsll(buf, rs, rt, sh)
452# define i_SRA(buf, rs, rt, sh) i_dsra(buf, rs, rt, sh)
453# define i_SRL(buf, rs, rt, sh) i_dsrl(buf, rs, rt, sh)
454# define i_MFC0(buf, rt, rd) i_dmfc0(buf, rt, rd)
455# define i_MTC0(buf, rt, rd) i_dmtc0(buf, rt, rd)
456# define i_ADDIU(buf, rs, rt, val) i_daddiu(buf, rs, rt, val)
457# define i_ADDU(buf, rs, rt, rd) i_daddu(buf, rs, rt, rd)
458# define i_SUBU(buf, rs, rt, rd) i_dsubu(buf, rs, rt, rd)
459# define i_LL(buf, rs, rt, off) i_lld(buf, rs, rt, off)
460# define i_SC(buf, rs, rt, off) i_scd(buf, rs, rt, off)
461#else
462# define i_LW(buf, rs, rt, off) i_lw(buf, rs, rt, off)
463# define i_SW(buf, rs, rt, off) i_sw(buf, rs, rt, off)
464# define i_SLL(buf, rs, rt, sh) i_sll(buf, rs, rt, sh)
465# define i_SRA(buf, rs, rt, sh) i_sra(buf, rs, rt, sh)
466# define i_SRL(buf, rs, rt, sh) i_srl(buf, rs, rt, sh)
467# define i_MFC0(buf, rt, rd) i_mfc0(buf, rt, rd)
468# define i_MTC0(buf, rt, rd) i_mtc0(buf, rt, rd)
469# define i_ADDIU(buf, rs, rt, val) i_addiu(buf, rs, rt, val)
470# define i_ADDU(buf, rs, rt, rd) i_addu(buf, rs, rt, rd)
471# define i_SUBU(buf, rs, rt, rd) i_subu(buf, rs, rt, rd)
472# define i_LL(buf, rs, rt, off) i_ll(buf, rs, rt, off)
473# define i_SC(buf, rs, rt, off) i_sc(buf, rs, rt, off)
474#endif
475
476#define i_b(buf, off) i_beq(buf, 0, 0, off)
477#define i_beqz(buf, rs, off) i_beq(buf, rs, 0, off)
478#define i_beqzl(buf, rs, off) i_beql(buf, rs, 0, off)
479#define i_bnez(buf, rs, off) i_bne(buf, rs, 0, off)
480#define i_bnezl(buf, rs, off) i_bnel(buf, rs, 0, off)
481#define i_move(buf, a, b) i_ADDU(buf, a, 0, b)
482#define i_nop(buf) i_sll(buf, 0, 0, 0)
483#define i_ssnop(buf) i_sll(buf, 0, 0, 1)
484#define i_ehb(buf) i_sll(buf, 0, 0, 3)
485
Ralf Baechle875d43e2005-09-03 15:56:16 -0700486#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487static __init int __attribute__((unused)) in_compat_space_p(long addr)
488{
489 /* Is this address in 32bit compat space? */
Ralf Baechle3ef33e62005-07-08 20:10:17 +0000490 return (((addr) & 0xffffffff00000000L) == 0xffffffff00000000L);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491}
492
493static __init int __attribute__((unused)) rel_highest(long val)
494{
495 return ((((val + 0x800080008000L) >> 48) & 0xffff) ^ 0x8000) - 0x8000;
496}
497
498static __init int __attribute__((unused)) rel_higher(long val)
499{
500 return ((((val + 0x80008000L) >> 32) & 0xffff) ^ 0x8000) - 0x8000;
501}
502#endif
503
504static __init int rel_hi(long val)
505{
506 return ((((val + 0x8000L) >> 16) & 0xffff) ^ 0x8000) - 0x8000;
507}
508
509static __init int rel_lo(long val)
510{
511 return ((val & 0xffff) ^ 0x8000) - 0x8000;
512}
513
514static __init void i_LA_mostly(u32 **buf, unsigned int rs, long addr)
515{
Yoichi Yuasa766160c2005-09-03 15:56:22 -0700516#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700517 if (!in_compat_space_p(addr)) {
518 i_lui(buf, rs, rel_highest(addr));
519 if (rel_higher(addr))
520 i_daddiu(buf, rs, rs, rel_higher(addr));
521 if (rel_hi(addr)) {
522 i_dsll(buf, rs, rs, 16);
523 i_daddiu(buf, rs, rs, rel_hi(addr));
524 i_dsll(buf, rs, rs, 16);
525 } else
526 i_dsll32(buf, rs, rs, 0);
527 } else
528#endif
529 i_lui(buf, rs, rel_hi(addr));
530}
531
532static __init void __attribute__((unused)) i_LA(u32 **buf, unsigned int rs,
533 long addr)
534{
535 i_LA_mostly(buf, rs, addr);
536 if (rel_lo(addr))
537 i_ADDIU(buf, rs, rs, rel_lo(addr));
538}
539
540/*
541 * handle relocations
542 */
543
544struct reloc {
545 u32 *addr;
546 unsigned int type;
547 enum label_id lab;
548};
549
550static __init void r_mips_pc16(struct reloc **rel, u32 *addr,
551 enum label_id l)
552{
553 (*rel)->addr = addr;
554 (*rel)->type = R_MIPS_PC16;
555 (*rel)->lab = l;
556 (*rel)++;
557}
558
559static inline void __resolve_relocs(struct reloc *rel, struct label *lab)
560{
561 long laddr = (long)lab->addr;
562 long raddr = (long)rel->addr;
563
564 switch (rel->type) {
565 case R_MIPS_PC16:
566 *rel->addr |= build_bimm(laddr - (raddr + 4));
567 break;
568
569 default:
570 panic("Unsupported TLB synthesizer relocation %d",
571 rel->type);
572 }
573}
574
575static __init void resolve_relocs(struct reloc *rel, struct label *lab)
576{
577 struct label *l;
578
579 for (; rel->lab != label_invalid; rel++)
580 for (l = lab; l->lab != label_invalid; l++)
581 if (rel->lab == l->lab)
582 __resolve_relocs(rel, l);
583}
584
585static __init void move_relocs(struct reloc *rel, u32 *first, u32 *end,
586 long off)
587{
588 for (; rel->lab != label_invalid; rel++)
589 if (rel->addr >= first && rel->addr < end)
590 rel->addr += off;
591}
592
593static __init void move_labels(struct label *lab, u32 *first, u32 *end,
594 long off)
595{
596 for (; lab->lab != label_invalid; lab++)
597 if (lab->addr >= first && lab->addr < end)
598 lab->addr += off;
599}
600
601static __init void copy_handler(struct reloc *rel, struct label *lab,
602 u32 *first, u32 *end, u32 *target)
603{
604 long off = (long)(target - first);
605
606 memcpy(target, first, (end - first) * sizeof(u32));
607
608 move_relocs(rel, first, end, off);
609 move_labels(lab, first, end, off);
610}
611
612static __init int __attribute__((unused)) insn_has_bdelay(struct reloc *rel,
613 u32 *addr)
614{
615 for (; rel->lab != label_invalid; rel++) {
616 if (rel->addr == addr
617 && (rel->type == R_MIPS_PC16
618 || rel->type == R_MIPS_26))
619 return 1;
620 }
621
622 return 0;
623}
624
625/* convenience functions for labeled branches */
626static void __attribute__((unused)) il_bltz(u32 **p, struct reloc **r,
627 unsigned int reg, enum label_id l)
628{
629 r_mips_pc16(r, *p, l);
630 i_bltz(p, reg, 0);
631}
632
633static void __attribute__((unused)) il_b(u32 **p, struct reloc **r,
634 enum label_id l)
635{
636 r_mips_pc16(r, *p, l);
637 i_b(p, 0);
638}
639
640static void il_beqz(u32 **p, struct reloc **r, unsigned int reg,
641 enum label_id l)
642{
643 r_mips_pc16(r, *p, l);
644 i_beqz(p, reg, 0);
645}
646
647static void __attribute__((unused))
648il_beqzl(u32 **p, struct reloc **r, unsigned int reg, enum label_id l)
649{
650 r_mips_pc16(r, *p, l);
651 i_beqzl(p, reg, 0);
652}
653
654static void il_bnez(u32 **p, struct reloc **r, unsigned int reg,
655 enum label_id l)
656{
657 r_mips_pc16(r, *p, l);
658 i_bnez(p, reg, 0);
659}
660
661static void il_bgezl(u32 **p, struct reloc **r, unsigned int reg,
662 enum label_id l)
663{
664 r_mips_pc16(r, *p, l);
665 i_bgezl(p, reg, 0);
666}
667
668/* The only general purpose registers allowed in TLB handlers. */
669#define K0 26
670#define K1 27
671
672/* Some CP0 registers */
673#define C0_INDEX 0
674#define C0_ENTRYLO0 2
675#define C0_ENTRYLO1 3
676#define C0_CONTEXT 4
677#define C0_BADVADDR 8
678#define C0_ENTRYHI 10
679#define C0_EPC 14
680#define C0_XCONTEXT 20
681
Ralf Baechle875d43e2005-09-03 15:56:16 -0700682#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683# define GET_CONTEXT(buf, reg) i_MFC0(buf, reg, C0_XCONTEXT)
684#else
685# define GET_CONTEXT(buf, reg) i_MFC0(buf, reg, C0_CONTEXT)
686#endif
687
688/* The worst case length of the handler is around 18 instructions for
689 * R3000-style TLBs and up to 63 instructions for R4000-style TLBs.
690 * Maximum space available is 32 instructions for R3000 and 64
691 * instructions for R4000.
692 *
693 * We deliberately chose a buffer size of 128, so we won't scribble
694 * over anything important on overflow before we panic.
695 */
696static __initdata u32 tlb_handler[128];
697
698/* simply assume worst case size for labels and relocs */
699static __initdata struct label labels[128];
700static __initdata struct reloc relocs[128];
701
702/*
703 * The R3000 TLB handler is simple.
704 */
705static void __init build_r3000_tlb_refill_handler(void)
706{
707 long pgdc = (long)pgd_current;
708 u32 *p;
709
710 memset(tlb_handler, 0, sizeof(tlb_handler));
711 p = tlb_handler;
712
713 i_mfc0(&p, K0, C0_BADVADDR);
714 i_lui(&p, K1, rel_hi(pgdc)); /* cp0 delay */
715 i_lw(&p, K1, rel_lo(pgdc), K1);
716 i_srl(&p, K0, K0, 22); /* load delay */
717 i_sll(&p, K0, K0, 2);
718 i_addu(&p, K1, K1, K0);
719 i_mfc0(&p, K0, C0_CONTEXT);
720 i_lw(&p, K1, 0, K1); /* cp0 delay */
721 i_andi(&p, K0, K0, 0xffc); /* load delay */
722 i_addu(&p, K1, K1, K0);
723 i_lw(&p, K0, 0, K1);
724 i_nop(&p); /* load delay */
725 i_mtc0(&p, K0, C0_ENTRYLO0);
726 i_mfc0(&p, K1, C0_EPC); /* cp0 delay */
727 i_tlbwr(&p); /* cp0 delay */
728 i_jr(&p, K1);
729 i_rfe(&p); /* branch delay */
730
731 if (p > tlb_handler + 32)
732 panic("TLB refill handler space exceeded");
733
Maciej W. Rozycki41986a62005-06-29 10:24:21 +0000734 printk("Synthesized TLB refill handler (%u instructions).\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735 (unsigned int)(p - tlb_handler));
736#ifdef DEBUG_TLB
737 {
738 int i;
739
740 for (i = 0; i < (p - tlb_handler); i++)
741 printk("%08x\n", tlb_handler[i]);
742 }
743#endif
744
745 memcpy((void *)CAC_BASE, tlb_handler, 0x80);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746}
747
748/*
749 * The R4000 TLB handler is much more complicated. We have two
750 * consecutive handler areas with 32 instructions space each.
751 * Since they aren't used at the same time, we can overflow in the
752 * other one.To keep things simple, we first assume linear space,
753 * then we relocate it to the final handler layout as needed.
754 */
755static __initdata u32 final_handler[64];
756
757/*
758 * Hazards
759 *
760 * From the IDT errata for the QED RM5230 (Nevada), processor revision 1.0:
761 * 2. A timing hazard exists for the TLBP instruction.
762 *
763 * stalling_instruction
764 * TLBP
765 *
766 * The JTLB is being read for the TLBP throughout the stall generated by the
767 * previous instruction. This is not really correct as the stalling instruction
768 * can modify the address used to access the JTLB. The failure symptom is that
769 * the TLBP instruction will use an address created for the stalling instruction
770 * and not the address held in C0_ENHI and thus report the wrong results.
771 *
772 * The software work-around is to not allow the instruction preceding the TLBP
773 * to stall - make it an NOP or some other instruction guaranteed not to stall.
774 *
775 * Errata 2 will not be fixed. This errata is also on the R5000.
776 *
777 * As if we MIPS hackers wouldn't know how to nop pipelines happy ...
778 */
779static __init void __attribute__((unused)) build_tlb_probe_entry(u32 **p)
780{
781 switch (current_cpu_data.cputype) {
782 case CPU_R5000:
783 case CPU_R5000A:
784 case CPU_NEVADA:
785 i_nop(p);
786 i_tlbp(p);
787 break;
788
789 default:
790 i_tlbp(p);
791 break;
792 }
793}
794
795/*
796 * Write random or indexed TLB entry, and care about the hazards from
797 * the preceeding mtc0 and for the following eret.
798 */
799enum tlb_write_entry { tlb_random, tlb_indexed };
800
801static __init void build_tlb_write_entry(u32 **p, struct label **l,
802 struct reloc **r,
803 enum tlb_write_entry wmode)
804{
805 void(*tlbw)(u32 **) = NULL;
806
807 switch (wmode) {
808 case tlb_random: tlbw = i_tlbwr; break;
809 case tlb_indexed: tlbw = i_tlbwi; break;
810 }
811
812 switch (current_cpu_data.cputype) {
813 case CPU_R4000PC:
814 case CPU_R4000SC:
815 case CPU_R4000MC:
816 case CPU_R4400PC:
817 case CPU_R4400SC:
818 case CPU_R4400MC:
819 /*
820 * This branch uses up a mtc0 hazard nop slot and saves
821 * two nops after the tlbw instruction.
822 */
823 il_bgezl(p, r, 0, label_tlbw_hazard);
824 tlbw(p);
825 l_tlbw_hazard(l, *p);
826 i_nop(p);
827 break;
828
829 case CPU_R4600:
830 case CPU_R4700:
831 case CPU_R5000:
832 case CPU_R5000A:
Maciej W. Rozycki2c93e122005-06-30 10:51:01 +0000833 i_nop(p);
834 tlbw(p);
835 i_nop(p);
836 break;
837
838 case CPU_R4300:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700839 case CPU_5KC:
840 case CPU_TX49XX:
841 case CPU_AU1000:
842 case CPU_AU1100:
843 case CPU_AU1500:
844 case CPU_AU1550:
Pete Popove3ad1c22005-03-01 06:33:16 +0000845 case CPU_AU1200:
Pete Popovbdf21b12005-07-14 17:47:57 +0000846 case CPU_PR4450:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847 i_nop(p);
848 tlbw(p);
849 break;
850
851 case CPU_R10000:
852 case CPU_R12000:
853 case CPU_4KC:
854 case CPU_SB1:
855 case CPU_4KSC:
856 case CPU_20KC:
857 case CPU_25KF:
858 tlbw(p);
859 break;
860
861 case CPU_NEVADA:
862 i_nop(p); /* QED specifies 2 nops hazard */
863 /*
864 * This branch uses up a mtc0 hazard nop slot and saves
865 * a nop after the tlbw instruction.
866 */
867 il_bgezl(p, r, 0, label_tlbw_hazard);
868 tlbw(p);
869 l_tlbw_hazard(l, *p);
870 break;
871
872 case CPU_RM7000:
873 i_nop(p);
874 i_nop(p);
875 i_nop(p);
876 i_nop(p);
877 tlbw(p);
878 break;
879
880 case CPU_4KEC:
881 case CPU_24K:
Ralf Baechlebbc7f222005-07-12 16:12:05 +0000882 case CPU_34K:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883 i_ehb(p);
884 tlbw(p);
885 break;
886
887 case CPU_RM9000:
888 /*
889 * When the JTLB is updated by tlbwi or tlbwr, a subsequent
890 * use of the JTLB for instructions should not occur for 4
891 * cpu cycles and use for data translations should not occur
892 * for 3 cpu cycles.
893 */
894 i_ssnop(p);
895 i_ssnop(p);
896 i_ssnop(p);
897 i_ssnop(p);
898 tlbw(p);
899 i_ssnop(p);
900 i_ssnop(p);
901 i_ssnop(p);
902 i_ssnop(p);
903 break;
904
905 case CPU_VR4111:
906 case CPU_VR4121:
907 case CPU_VR4122:
908 case CPU_VR4181:
909 case CPU_VR4181A:
910 i_nop(p);
911 i_nop(p);
912 tlbw(p);
913 i_nop(p);
914 i_nop(p);
915 break;
916
917 case CPU_VR4131:
918 case CPU_VR4133:
919 i_nop(p);
920 i_nop(p);
921 tlbw(p);
922 break;
923
924 default:
925 panic("No TLB refill handler yet (CPU type: %d)",
926 current_cpu_data.cputype);
927 break;
928 }
929}
930
Ralf Baechle875d43e2005-09-03 15:56:16 -0700931#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700932/*
933 * TMP and PTR are scratch.
934 * TMP will be clobbered, PTR will hold the pmd entry.
935 */
936static __init void
937build_get_pmde64(u32 **p, struct label **l, struct reloc **r,
938 unsigned int tmp, unsigned int ptr)
939{
940 long pgdc = (long)pgd_current;
941
942 /*
943 * The vmalloc handling is not in the hotpath.
944 */
945 i_dmfc0(p, tmp, C0_BADVADDR);
946 il_bltz(p, r, tmp, label_vmalloc);
947 /* No i_nop needed here, since the next insn doesn't touch TMP. */
948
949#ifdef CONFIG_SMP
Thiemo Seufer1b3a6e92005-04-01 14:07:13 +0000950# ifdef CONFIG_BUILD_ELF64
Linus Torvalds1da177e2005-04-16 15:20:36 -0700951 /*
Thiemo Seufer1b3a6e92005-04-01 14:07:13 +0000952 * 64 bit SMP running in XKPHYS has smp_processor_id() << 3
Linus Torvalds1da177e2005-04-16 15:20:36 -0700953 * stored in CONTEXT.
954 */
Thiemo Seufer1b3a6e92005-04-01 14:07:13 +0000955 i_dmfc0(p, ptr, C0_CONTEXT);
956 i_dsrl(p, ptr, ptr, 23);
957 i_LA_mostly(p, tmp, pgdc);
958 i_daddu(p, ptr, ptr, tmp);
959 i_dmfc0(p, tmp, C0_BADVADDR);
960 i_ld(p, ptr, rel_lo(pgdc), ptr);
961# else
962 /*
963 * 64 bit SMP running in compat space has the lower part of
964 * &pgd_current[smp_processor_id()] stored in CONTEXT.
965 */
966 if (!in_compat_space_p(pgdc))
967 panic("Invalid page directory address!");
968
969 i_dmfc0(p, ptr, C0_CONTEXT);
970 i_dsra(p, ptr, ptr, 23);
971 i_ld(p, ptr, 0, ptr);
972# endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700973#else
974 i_LA_mostly(p, ptr, pgdc);
975 i_ld(p, ptr, rel_lo(pgdc), ptr);
976#endif
977
978 l_vmalloc_done(l, *p);
979 i_dsrl(p, tmp, tmp, PGDIR_SHIFT-3); /* get pgd offset in bytes */
980 i_andi(p, tmp, tmp, (PTRS_PER_PGD - 1)<<3);
981 i_daddu(p, ptr, ptr, tmp); /* add in pgd offset */
982 i_dmfc0(p, tmp, C0_BADVADDR); /* get faulting address */
983 i_ld(p, ptr, 0, ptr); /* get pmd pointer */
984 i_dsrl(p, tmp, tmp, PMD_SHIFT-3); /* get pmd offset in bytes */
985 i_andi(p, tmp, tmp, (PTRS_PER_PMD - 1)<<3);
986 i_daddu(p, ptr, ptr, tmp); /* add in pmd offset */
987}
988
989/*
990 * BVADDR is the faulting address, PTR is scratch.
991 * PTR will hold the pgd for vmalloc.
992 */
993static __init void
994build_get_pgd_vmalloc64(u32 **p, struct label **l, struct reloc **r,
995 unsigned int bvaddr, unsigned int ptr)
996{
997 long swpd = (long)swapper_pg_dir;
998
999 l_vmalloc(l, *p);
1000 i_LA(p, ptr, VMALLOC_START);
1001 i_dsubu(p, bvaddr, bvaddr, ptr);
1002
1003 if (in_compat_space_p(swpd) && !rel_lo(swpd)) {
1004 il_b(p, r, label_vmalloc_done);
1005 i_lui(p, ptr, rel_hi(swpd));
1006 } else {
1007 i_LA_mostly(p, ptr, swpd);
1008 il_b(p, r, label_vmalloc_done);
1009 i_daddiu(p, ptr, ptr, rel_lo(swpd));
1010 }
1011}
1012
Ralf Baechle875d43e2005-09-03 15:56:16 -07001013#else /* !CONFIG_64BIT */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001014
1015/*
1016 * TMP and PTR are scratch.
1017 * TMP will be clobbered, PTR will hold the pgd entry.
1018 */
1019static __init void __attribute__((unused))
1020build_get_pgde32(u32 **p, unsigned int tmp, unsigned int ptr)
1021{
1022 long pgdc = (long)pgd_current;
1023
1024 /* 32 bit SMP has smp_processor_id() stored in CONTEXT. */
1025#ifdef CONFIG_SMP
1026 i_mfc0(p, ptr, C0_CONTEXT);
1027 i_LA_mostly(p, tmp, pgdc);
1028 i_srl(p, ptr, ptr, 23);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029 i_addu(p, ptr, tmp, ptr);
1030#else
1031 i_LA_mostly(p, ptr, pgdc);
1032#endif
1033 i_mfc0(p, tmp, C0_BADVADDR); /* get faulting address */
1034 i_lw(p, ptr, rel_lo(pgdc), ptr);
1035 i_srl(p, tmp, tmp, PGDIR_SHIFT); /* get pgd only bits */
1036 i_sll(p, tmp, tmp, PGD_T_LOG2);
1037 i_addu(p, ptr, ptr, tmp); /* add in pgd offset */
1038}
1039
Ralf Baechle875d43e2005-09-03 15:56:16 -07001040#endif /* !CONFIG_64BIT */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001041
1042static __init void build_adjust_context(u32 **p, unsigned int ctx)
1043{
1044 unsigned int shift = 4 - (PTE_T_LOG2 + 1);
1045 unsigned int mask = (PTRS_PER_PTE / 2 - 1) << (PTE_T_LOG2 + 1);
1046
1047 switch (current_cpu_data.cputype) {
1048 case CPU_VR41XX:
1049 case CPU_VR4111:
1050 case CPU_VR4121:
1051 case CPU_VR4122:
1052 case CPU_VR4131:
1053 case CPU_VR4181:
1054 case CPU_VR4181A:
1055 case CPU_VR4133:
1056 shift += 2;
1057 break;
1058
1059 default:
1060 break;
1061 }
1062
1063 if (shift)
1064 i_SRL(p, ctx, ctx, shift);
1065 i_andi(p, ctx, ctx, mask);
1066}
1067
1068static __init void build_get_ptep(u32 **p, unsigned int tmp, unsigned int ptr)
1069{
1070 /*
1071 * Bug workaround for the Nevada. It seems as if under certain
1072 * circumstances the move from cp0_context might produce a
1073 * bogus result when the mfc0 instruction and its consumer are
1074 * in a different cacheline or a load instruction, probably any
1075 * memory reference, is between them.
1076 */
1077 switch (current_cpu_data.cputype) {
1078 case CPU_NEVADA:
1079 i_LW(p, ptr, 0, ptr);
1080 GET_CONTEXT(p, tmp); /* get context reg */
1081 break;
1082
1083 default:
1084 GET_CONTEXT(p, tmp); /* get context reg */
1085 i_LW(p, ptr, 0, ptr);
1086 break;
1087 }
1088
1089 build_adjust_context(p, tmp);
1090 i_ADDU(p, ptr, ptr, tmp); /* add in offset */
1091}
1092
1093static __init void build_update_entries(u32 **p, unsigned int tmp,
1094 unsigned int ptep)
1095{
1096 /*
1097 * 64bit address support (36bit on a 32bit CPU) in a 32bit
1098 * Kernel is a special case. Only a few CPUs use it.
1099 */
1100#ifdef CONFIG_64BIT_PHYS_ADDR
1101 if (cpu_has_64bits) {
1102 i_ld(p, tmp, 0, ptep); /* get even pte */
1103 i_ld(p, ptep, sizeof(pte_t), ptep); /* get odd pte */
1104 i_dsrl(p, tmp, tmp, 6); /* convert to entrylo0 */
1105 i_mtc0(p, tmp, C0_ENTRYLO0); /* load it */
1106 i_dsrl(p, ptep, ptep, 6); /* convert to entrylo1 */
1107 i_mtc0(p, ptep, C0_ENTRYLO1); /* load it */
1108 } else {
1109 int pte_off_even = sizeof(pte_t) / 2;
1110 int pte_off_odd = pte_off_even + sizeof(pte_t);
1111
1112 /* The pte entries are pre-shifted */
1113 i_lw(p, tmp, pte_off_even, ptep); /* get even pte */
1114 i_mtc0(p, tmp, C0_ENTRYLO0); /* load it */
1115 i_lw(p, ptep, pte_off_odd, ptep); /* get odd pte */
1116 i_mtc0(p, ptep, C0_ENTRYLO1); /* load it */
1117 }
1118#else
1119 i_LW(p, tmp, 0, ptep); /* get even pte */
1120 i_LW(p, ptep, sizeof(pte_t), ptep); /* get odd pte */
1121 if (r45k_bvahwbug())
1122 build_tlb_probe_entry(p);
1123 i_SRL(p, tmp, tmp, 6); /* convert to entrylo0 */
1124 if (r4k_250MHZhwbug())
1125 i_mtc0(p, 0, C0_ENTRYLO0);
1126 i_mtc0(p, tmp, C0_ENTRYLO0); /* load it */
1127 i_SRL(p, ptep, ptep, 6); /* convert to entrylo1 */
1128 if (r45k_bvahwbug())
1129 i_mfc0(p, tmp, C0_INDEX);
1130 if (r4k_250MHZhwbug())
1131 i_mtc0(p, 0, C0_ENTRYLO1);
1132 i_mtc0(p, ptep, C0_ENTRYLO1); /* load it */
1133#endif
1134}
1135
1136static void __init build_r4000_tlb_refill_handler(void)
1137{
1138 u32 *p = tlb_handler;
1139 struct label *l = labels;
1140 struct reloc *r = relocs;
1141 u32 *f;
1142 unsigned int final_len;
1143
1144 memset(tlb_handler, 0, sizeof(tlb_handler));
1145 memset(labels, 0, sizeof(labels));
1146 memset(relocs, 0, sizeof(relocs));
1147 memset(final_handler, 0, sizeof(final_handler));
1148
1149 /*
1150 * create the plain linear handler
1151 */
1152 if (bcm1250_m3_war()) {
1153 i_MFC0(&p, K0, C0_BADVADDR);
1154 i_MFC0(&p, K1, C0_ENTRYHI);
1155 i_xor(&p, K0, K0, K1);
1156 i_SRL(&p, K0, K0, PAGE_SHIFT + 1);
1157 il_bnez(&p, &r, K0, label_leave);
1158 /* No need for i_nop */
1159 }
1160
Ralf Baechle875d43e2005-09-03 15:56:16 -07001161#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001162 build_get_pmde64(&p, &l, &r, K0, K1); /* get pmd in K1 */
1163#else
1164 build_get_pgde32(&p, K0, K1); /* get pgd in K1 */
1165#endif
1166
1167 build_get_ptep(&p, K0, K1);
1168 build_update_entries(&p, K0, K1);
1169 build_tlb_write_entry(&p, &l, &r, tlb_random);
1170 l_leave(&l, p);
1171 i_eret(&p); /* return from trap */
1172
Ralf Baechle875d43e2005-09-03 15:56:16 -07001173#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001174 build_get_pgd_vmalloc64(&p, &l, &r, K0, K1);
1175#endif
1176
1177 /*
1178 * Overflow check: For the 64bit handler, we need at least one
1179 * free instruction slot for the wrap-around branch. In worst
1180 * case, if the intended insertion point is a delay slot, we
1181 * need three, with the the second nop'ed and the third being
1182 * unused.
1183 */
Ralf Baechle875d43e2005-09-03 15:56:16 -07001184#ifdef CONFIG_32BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001185 if ((p - tlb_handler) > 64)
1186 panic("TLB refill handler space exceeded");
1187#else
1188 if (((p - tlb_handler) > 63)
1189 || (((p - tlb_handler) > 61)
1190 && insn_has_bdelay(relocs, tlb_handler + 29)))
1191 panic("TLB refill handler space exceeded");
1192#endif
1193
1194 /*
1195 * Now fold the handler in the TLB refill handler space.
1196 */
Ralf Baechle875d43e2005-09-03 15:56:16 -07001197#ifdef CONFIG_32BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001198 f = final_handler;
1199 /* Simplest case, just copy the handler. */
1200 copy_handler(relocs, labels, tlb_handler, p, f);
1201 final_len = p - tlb_handler;
Ralf Baechle875d43e2005-09-03 15:56:16 -07001202#else /* CONFIG_64BIT */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203 f = final_handler + 32;
1204 if ((p - tlb_handler) <= 32) {
1205 /* Just copy the handler. */
1206 copy_handler(relocs, labels, tlb_handler, p, f);
1207 final_len = p - tlb_handler;
1208 } else {
1209 u32 *split = tlb_handler + 30;
1210
1211 /*
1212 * Find the split point.
1213 */
1214 if (insn_has_bdelay(relocs, split - 1))
1215 split--;
1216
1217 /* Copy first part of the handler. */
1218 copy_handler(relocs, labels, tlb_handler, split, f);
1219 f += split - tlb_handler;
1220
1221 /* Insert branch. */
1222 l_split(&l, final_handler);
1223 il_b(&f, &r, label_split);
1224 if (insn_has_bdelay(relocs, split))
1225 i_nop(&f);
1226 else {
1227 copy_handler(relocs, labels, split, split + 1, f);
1228 move_labels(labels, f, f + 1, -1);
1229 f++;
1230 split++;
1231 }
1232
1233 /* Copy the rest of the handler. */
1234 copy_handler(relocs, labels, split, p, final_handler);
1235 final_len = (f - (final_handler + 32)) + (p - split);
1236 }
Ralf Baechle875d43e2005-09-03 15:56:16 -07001237#endif /* CONFIG_64BIT */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001238
1239 resolve_relocs(relocs, labels);
1240 printk("Synthesized TLB refill handler (%u instructions).\n",
1241 final_len);
1242
1243#ifdef DEBUG_TLB
1244 {
1245 int i;
1246
Maciej W. Rozycki4c0a2d42005-06-29 10:43:51 +00001247 f = final_handler;
1248#ifdef CONFIG_64BIT
1249 if (final_len > 32)
1250 final_len = 64;
1251 else
1252 f = final_handler + 32;
1253#endif /* CONFIG_64BIT */
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001254 for (i = 0; i < final_len; i++)
Maciej W. Rozycki4c0a2d42005-06-29 10:43:51 +00001255 printk("%08x\n", f[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256 }
1257#endif
1258
1259 memcpy((void *)CAC_BASE, final_handler, 0x100);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001260}
1261
1262/*
1263 * TLB load/store/modify handlers.
1264 *
1265 * Only the fastpath gets synthesized at runtime, the slowpath for
1266 * do_page_fault remains normal asm.
1267 */
1268extern void tlb_do_page_fault_0(void);
1269extern void tlb_do_page_fault_1(void);
1270
1271#define __tlb_handler_align \
1272 __attribute__((__aligned__(1 << CONFIG_MIPS_L1_CACHE_SHIFT)))
1273
1274/*
1275 * 128 instructions for the fastpath handler is generous and should
1276 * never be exceeded.
1277 */
1278#define FASTPATH_SIZE 128
1279
1280u32 __tlb_handler_align handle_tlbl[FASTPATH_SIZE];
1281u32 __tlb_handler_align handle_tlbs[FASTPATH_SIZE];
1282u32 __tlb_handler_align handle_tlbm[FASTPATH_SIZE];
1283
1284static void __init
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001285iPTE_LW(u32 **p, struct label **l, unsigned int pte, unsigned int ptr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001286{
1287#ifdef CONFIG_SMP
1288# ifdef CONFIG_64BIT_PHYS_ADDR
1289 if (cpu_has_64bits)
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001290 i_lld(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001291 else
1292# endif
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001293 i_LL(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001294#else
1295# ifdef CONFIG_64BIT_PHYS_ADDR
1296 if (cpu_has_64bits)
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001297 i_ld(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001298 else
1299# endif
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001300 i_LW(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001301#endif
1302}
1303
1304static void __init
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001305iPTE_SW(u32 **p, struct reloc **r, unsigned int pte, unsigned int ptr,
1306 unsigned int mode)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001307{
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001308#ifdef CONFIG_64BIT_PHYS_ADDR
1309 unsigned int hwmode = mode & (_PAGE_VALID | _PAGE_DIRTY);
1310#endif
1311
1312 i_ori(p, pte, pte, mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001313#ifdef CONFIG_SMP
1314# ifdef CONFIG_64BIT_PHYS_ADDR
1315 if (cpu_has_64bits)
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001316 i_scd(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001317 else
1318# endif
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001319 i_SC(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001320
1321 if (r10000_llsc_war())
1322 il_beqzl(p, r, pte, label_smp_pgtable_change);
1323 else
1324 il_beqz(p, r, pte, label_smp_pgtable_change);
1325
1326# ifdef CONFIG_64BIT_PHYS_ADDR
1327 if (!cpu_has_64bits) {
1328 /* no i_nop needed */
1329 i_ll(p, pte, sizeof(pte_t) / 2, ptr);
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001330 i_ori(p, pte, pte, hwmode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331 i_sc(p, pte, sizeof(pte_t) / 2, ptr);
1332 il_beqz(p, r, pte, label_smp_pgtable_change);
1333 /* no i_nop needed */
1334 i_lw(p, pte, 0, ptr);
1335 } else
1336 i_nop(p);
1337# else
1338 i_nop(p);
1339# endif
1340#else
1341# ifdef CONFIG_64BIT_PHYS_ADDR
1342 if (cpu_has_64bits)
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001343 i_sd(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001344 else
1345# endif
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001346 i_SW(p, pte, 0, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001347
1348# ifdef CONFIG_64BIT_PHYS_ADDR
1349 if (!cpu_has_64bits) {
1350 i_lw(p, pte, sizeof(pte_t) / 2, ptr);
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001351 i_ori(p, pte, pte, hwmode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001352 i_sw(p, pte, sizeof(pte_t) / 2, ptr);
1353 i_lw(p, pte, 0, ptr);
1354 }
1355# endif
1356#endif
1357}
1358
1359/*
1360 * Check if PTE is present, if not then jump to LABEL. PTR points to
1361 * the page table where this PTE is located, PTE will be re-loaded
1362 * with it's original value.
1363 */
1364static void __init
1365build_pte_present(u32 **p, struct label **l, struct reloc **r,
1366 unsigned int pte, unsigned int ptr, enum label_id lid)
1367{
1368 i_andi(p, pte, pte, _PAGE_PRESENT | _PAGE_READ);
1369 i_xori(p, pte, pte, _PAGE_PRESENT | _PAGE_READ);
1370 il_bnez(p, r, pte, lid);
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001371 iPTE_LW(p, l, pte, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001372}
1373
1374/* Make PTE valid, store result in PTR. */
1375static void __init
1376build_make_valid(u32 **p, struct reloc **r, unsigned int pte,
1377 unsigned int ptr)
1378{
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001379 unsigned int mode = _PAGE_VALID | _PAGE_ACCESSED;
1380
1381 iPTE_SW(p, r, pte, ptr, mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001382}
1383
1384/*
1385 * Check if PTE can be written to, if not branch to LABEL. Regardless
1386 * restore PTE with value from PTR when done.
1387 */
1388static void __init
1389build_pte_writable(u32 **p, struct label **l, struct reloc **r,
1390 unsigned int pte, unsigned int ptr, enum label_id lid)
1391{
1392 i_andi(p, pte, pte, _PAGE_PRESENT | _PAGE_WRITE);
1393 i_xori(p, pte, pte, _PAGE_PRESENT | _PAGE_WRITE);
1394 il_bnez(p, r, pte, lid);
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001395 iPTE_LW(p, l, pte, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001396}
1397
1398/* Make PTE writable, update software status bits as well, then store
1399 * at PTR.
1400 */
1401static void __init
1402build_make_write(u32 **p, struct reloc **r, unsigned int pte,
1403 unsigned int ptr)
1404{
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001405 unsigned int mode = (_PAGE_ACCESSED | _PAGE_MODIFIED | _PAGE_VALID
1406 | _PAGE_DIRTY);
1407
1408 iPTE_SW(p, r, pte, ptr, mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001409}
1410
1411/*
1412 * Check if PTE can be modified, if not branch to LABEL. Regardless
1413 * restore PTE with value from PTR when done.
1414 */
1415static void __init
1416build_pte_modifiable(u32 **p, struct label **l, struct reloc **r,
1417 unsigned int pte, unsigned int ptr, enum label_id lid)
1418{
1419 i_andi(p, pte, pte, _PAGE_WRITE);
1420 il_beqz(p, r, pte, lid);
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001421 iPTE_LW(p, l, pte, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001422}
1423
1424/*
1425 * R3000 style TLB load/store/modify handlers.
1426 */
1427
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001428/*
1429 * This places the pte into ENTRYLO0 and writes it with tlbwi.
1430 * Then it returns.
1431 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001432static void __init
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001433build_r3000_pte_reload_tlbwi(u32 **p, unsigned int pte, unsigned int tmp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001434{
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001435 i_mtc0(p, pte, C0_ENTRYLO0); /* cp0 delay */
1436 i_mfc0(p, tmp, C0_EPC); /* cp0 delay */
1437 i_tlbwi(p);
1438 i_jr(p, tmp);
1439 i_rfe(p); /* branch delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001440}
1441
1442/*
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001443 * This places the pte into ENTRYLO0 and writes it with tlbwi
1444 * or tlbwr as appropriate. This is because the index register
1445 * may have the probe fail bit set as a result of a trap on a
1446 * kseg2 access, i.e. without refill. Then it returns.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001447 */
1448static void __init
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001449build_r3000_tlb_reload_write(u32 **p, struct label **l, struct reloc **r,
1450 unsigned int pte, unsigned int tmp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001451{
1452 i_mfc0(p, tmp, C0_INDEX);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001453 i_mtc0(p, pte, C0_ENTRYLO0); /* cp0 delay */
1454 il_bltz(p, r, tmp, label_r3000_write_probe_fail); /* cp0 delay */
1455 i_mfc0(p, tmp, C0_EPC); /* branch delay */
1456 i_tlbwi(p); /* cp0 delay */
1457 i_jr(p, tmp);
1458 i_rfe(p); /* branch delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001459 l_r3000_write_probe_fail(l, *p);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001460 i_tlbwr(p); /* cp0 delay */
1461 i_jr(p, tmp);
1462 i_rfe(p); /* branch delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001463}
1464
1465static void __init
1466build_r3000_tlbchange_handler_head(u32 **p, unsigned int pte,
1467 unsigned int ptr)
1468{
1469 long pgdc = (long)pgd_current;
1470
1471 i_mfc0(p, pte, C0_BADVADDR);
1472 i_lui(p, ptr, rel_hi(pgdc)); /* cp0 delay */
1473 i_lw(p, ptr, rel_lo(pgdc), ptr);
1474 i_srl(p, pte, pte, 22); /* load delay */
1475 i_sll(p, pte, pte, 2);
1476 i_addu(p, ptr, ptr, pte);
1477 i_mfc0(p, pte, C0_CONTEXT);
1478 i_lw(p, ptr, 0, ptr); /* cp0 delay */
1479 i_andi(p, pte, pte, 0xffc); /* load delay */
1480 i_addu(p, ptr, ptr, pte);
1481 i_lw(p, pte, 0, ptr);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001482 i_tlbp(p); /* load delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001483}
1484
1485static void __init build_r3000_tlb_load_handler(void)
1486{
1487 u32 *p = handle_tlbl;
1488 struct label *l = labels;
1489 struct reloc *r = relocs;
1490
1491 memset(handle_tlbl, 0, sizeof(handle_tlbl));
1492 memset(labels, 0, sizeof(labels));
1493 memset(relocs, 0, sizeof(relocs));
1494
1495 build_r3000_tlbchange_handler_head(&p, K0, K1);
1496 build_pte_present(&p, &l, &r, K0, K1, label_nopage_tlbl);
Maciej W. Rozyckid925c262005-06-13 20:12:01 +00001497 i_nop(&p); /* load delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001498 build_make_valid(&p, &r, K0, K1);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001499 build_r3000_tlb_reload_write(&p, &l, &r, K0, K1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500
1501 l_nopage_tlbl(&l, p);
1502 i_j(&p, (unsigned long)tlb_do_page_fault_0 & 0x0fffffff);
1503 i_nop(&p);
1504
1505 if ((p - handle_tlbl) > FASTPATH_SIZE)
1506 panic("TLB load handler fastpath space exceeded");
1507
1508 resolve_relocs(relocs, labels);
1509 printk("Synthesized TLB load handler fastpath (%u instructions).\n",
1510 (unsigned int)(p - handle_tlbl));
1511
1512#ifdef DEBUG_TLB
1513 {
1514 int i;
1515
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001516 for (i = 0; i < (p - handle_tlbl); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001517 printk("%08x\n", handle_tlbl[i]);
1518 }
1519#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001520}
1521
1522static void __init build_r3000_tlb_store_handler(void)
1523{
1524 u32 *p = handle_tlbs;
1525 struct label *l = labels;
1526 struct reloc *r = relocs;
1527
1528 memset(handle_tlbs, 0, sizeof(handle_tlbs));
1529 memset(labels, 0, sizeof(labels));
1530 memset(relocs, 0, sizeof(relocs));
1531
1532 build_r3000_tlbchange_handler_head(&p, K0, K1);
1533 build_pte_writable(&p, &l, &r, K0, K1, label_nopage_tlbs);
Maciej W. Rozyckid925c262005-06-13 20:12:01 +00001534 i_nop(&p); /* load delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001535 build_make_write(&p, &r, K0, K1);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001536 build_r3000_tlb_reload_write(&p, &l, &r, K0, K1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001537
1538 l_nopage_tlbs(&l, p);
1539 i_j(&p, (unsigned long)tlb_do_page_fault_1 & 0x0fffffff);
1540 i_nop(&p);
1541
1542 if ((p - handle_tlbs) > FASTPATH_SIZE)
1543 panic("TLB store handler fastpath space exceeded");
1544
1545 resolve_relocs(relocs, labels);
1546 printk("Synthesized TLB store handler fastpath (%u instructions).\n",
1547 (unsigned int)(p - handle_tlbs));
1548
1549#ifdef DEBUG_TLB
1550 {
1551 int i;
1552
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001553 for (i = 0; i < (p - handle_tlbs); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001554 printk("%08x\n", handle_tlbs[i]);
1555 }
1556#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001557}
1558
1559static void __init build_r3000_tlb_modify_handler(void)
1560{
1561 u32 *p = handle_tlbm;
1562 struct label *l = labels;
1563 struct reloc *r = relocs;
1564
1565 memset(handle_tlbm, 0, sizeof(handle_tlbm));
1566 memset(labels, 0, sizeof(labels));
1567 memset(relocs, 0, sizeof(relocs));
1568
1569 build_r3000_tlbchange_handler_head(&p, K0, K1);
1570 build_pte_modifiable(&p, &l, &r, K0, K1, label_nopage_tlbm);
Maciej W. Rozyckid925c262005-06-13 20:12:01 +00001571 i_nop(&p); /* load delay */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001572 build_make_write(&p, &r, K0, K1);
Maciej W. Rozyckifded2e52005-06-13 20:24:00 +00001573 build_r3000_pte_reload_tlbwi(&p, K0, K1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001574
1575 l_nopage_tlbm(&l, p);
1576 i_j(&p, (unsigned long)tlb_do_page_fault_1 & 0x0fffffff);
1577 i_nop(&p);
1578
1579 if ((p - handle_tlbm) > FASTPATH_SIZE)
1580 panic("TLB modify handler fastpath space exceeded");
1581
1582 resolve_relocs(relocs, labels);
1583 printk("Synthesized TLB modify handler fastpath (%u instructions).\n",
1584 (unsigned int)(p - handle_tlbm));
1585
1586#ifdef DEBUG_TLB
1587 {
1588 int i;
1589
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001590 for (i = 0; i < (p - handle_tlbm); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001591 printk("%08x\n", handle_tlbm[i]);
1592 }
1593#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001594}
1595
1596/*
1597 * R4000 style TLB load/store/modify handlers.
1598 */
1599static void __init
1600build_r4000_tlbchange_handler_head(u32 **p, struct label **l,
1601 struct reloc **r, unsigned int pte,
1602 unsigned int ptr)
1603{
Ralf Baechle875d43e2005-09-03 15:56:16 -07001604#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001605 build_get_pmde64(p, l, r, pte, ptr); /* get pmd in ptr */
1606#else
1607 build_get_pgde32(p, pte, ptr); /* get pgd in ptr */
1608#endif
1609
1610 i_MFC0(p, pte, C0_BADVADDR);
1611 i_LW(p, ptr, 0, ptr);
1612 i_SRL(p, pte, pte, PAGE_SHIFT + PTE_ORDER - PTE_T_LOG2);
1613 i_andi(p, pte, pte, (PTRS_PER_PTE - 1) << PTE_T_LOG2);
1614 i_ADDU(p, ptr, ptr, pte);
1615
1616#ifdef CONFIG_SMP
1617 l_smp_pgtable_change(l, *p);
1618# endif
Thiemo Seufer63b2d2f2005-04-28 08:52:57 +00001619 iPTE_LW(p, l, pte, ptr); /* get even pte */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001620 build_tlb_probe_entry(p);
1621}
1622
1623static void __init
1624build_r4000_tlbchange_handler_tail(u32 **p, struct label **l,
1625 struct reloc **r, unsigned int tmp,
1626 unsigned int ptr)
1627{
1628 i_ori(p, ptr, ptr, sizeof(pte_t));
1629 i_xori(p, ptr, ptr, sizeof(pte_t));
1630 build_update_entries(p, tmp, ptr);
1631 build_tlb_write_entry(p, l, r, tlb_indexed);
1632 l_leave(l, *p);
1633 i_eret(p); /* return from trap */
1634
Ralf Baechle875d43e2005-09-03 15:56:16 -07001635#ifdef CONFIG_64BIT
Linus Torvalds1da177e2005-04-16 15:20:36 -07001636 build_get_pgd_vmalloc64(p, l, r, tmp, ptr);
1637#endif
1638}
1639
1640static void __init build_r4000_tlb_load_handler(void)
1641{
1642 u32 *p = handle_tlbl;
1643 struct label *l = labels;
1644 struct reloc *r = relocs;
1645
1646 memset(handle_tlbl, 0, sizeof(handle_tlbl));
1647 memset(labels, 0, sizeof(labels));
1648 memset(relocs, 0, sizeof(relocs));
1649
1650 if (bcm1250_m3_war()) {
1651 i_MFC0(&p, K0, C0_BADVADDR);
1652 i_MFC0(&p, K1, C0_ENTRYHI);
1653 i_xor(&p, K0, K0, K1);
1654 i_SRL(&p, K0, K0, PAGE_SHIFT + 1);
1655 il_bnez(&p, &r, K0, label_leave);
1656 /* No need for i_nop */
1657 }
1658
1659 build_r4000_tlbchange_handler_head(&p, &l, &r, K0, K1);
1660 build_pte_present(&p, &l, &r, K0, K1, label_nopage_tlbl);
1661 build_make_valid(&p, &r, K0, K1);
1662 build_r4000_tlbchange_handler_tail(&p, &l, &r, K0, K1);
1663
1664 l_nopage_tlbl(&l, p);
1665 i_j(&p, (unsigned long)tlb_do_page_fault_0 & 0x0fffffff);
1666 i_nop(&p);
1667
1668 if ((p - handle_tlbl) > FASTPATH_SIZE)
1669 panic("TLB load handler fastpath space exceeded");
1670
1671 resolve_relocs(relocs, labels);
1672 printk("Synthesized TLB load handler fastpath (%u instructions).\n",
1673 (unsigned int)(p - handle_tlbl));
1674
1675#ifdef DEBUG_TLB
1676 {
1677 int i;
1678
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001679 for (i = 0; i < (p - handle_tlbl); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001680 printk("%08x\n", handle_tlbl[i]);
1681 }
1682#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001683}
1684
1685static void __init build_r4000_tlb_store_handler(void)
1686{
1687 u32 *p = handle_tlbs;
1688 struct label *l = labels;
1689 struct reloc *r = relocs;
1690
1691 memset(handle_tlbs, 0, sizeof(handle_tlbs));
1692 memset(labels, 0, sizeof(labels));
1693 memset(relocs, 0, sizeof(relocs));
1694
1695 build_r4000_tlbchange_handler_head(&p, &l, &r, K0, K1);
1696 build_pte_writable(&p, &l, &r, K0, K1, label_nopage_tlbs);
1697 build_make_write(&p, &r, K0, K1);
1698 build_r4000_tlbchange_handler_tail(&p, &l, &r, K0, K1);
1699
1700 l_nopage_tlbs(&l, p);
1701 i_j(&p, (unsigned long)tlb_do_page_fault_1 & 0x0fffffff);
1702 i_nop(&p);
1703
1704 if ((p - handle_tlbs) > FASTPATH_SIZE)
1705 panic("TLB store handler fastpath space exceeded");
1706
1707 resolve_relocs(relocs, labels);
1708 printk("Synthesized TLB store handler fastpath (%u instructions).\n",
1709 (unsigned int)(p - handle_tlbs));
1710
1711#ifdef DEBUG_TLB
1712 {
1713 int i;
1714
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001715 for (i = 0; i < (p - handle_tlbs); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001716 printk("%08x\n", handle_tlbs[i]);
1717 }
1718#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001719}
1720
1721static void __init build_r4000_tlb_modify_handler(void)
1722{
1723 u32 *p = handle_tlbm;
1724 struct label *l = labels;
1725 struct reloc *r = relocs;
1726
1727 memset(handle_tlbm, 0, sizeof(handle_tlbm));
1728 memset(labels, 0, sizeof(labels));
1729 memset(relocs, 0, sizeof(relocs));
1730
1731 build_r4000_tlbchange_handler_head(&p, &l, &r, K0, K1);
1732 build_pte_modifiable(&p, &l, &r, K0, K1, label_nopage_tlbm);
1733 /* Present and writable bits set, set accessed and dirty bits. */
1734 build_make_write(&p, &r, K0, K1);
1735 build_r4000_tlbchange_handler_tail(&p, &l, &r, K0, K1);
1736
1737 l_nopage_tlbm(&l, p);
1738 i_j(&p, (unsigned long)tlb_do_page_fault_1 & 0x0fffffff);
1739 i_nop(&p);
1740
1741 if ((p - handle_tlbm) > FASTPATH_SIZE)
1742 panic("TLB modify handler fastpath space exceeded");
1743
1744 resolve_relocs(relocs, labels);
1745 printk("Synthesized TLB modify handler fastpath (%u instructions).\n",
1746 (unsigned int)(p - handle_tlbm));
1747
1748#ifdef DEBUG_TLB
1749 {
1750 int i;
1751
Maciej W. Rozycki9678e282005-06-13 20:09:32 +00001752 for (i = 0; i < (p - handle_tlbm); i++)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001753 printk("%08x\n", handle_tlbm[i]);
1754 }
1755#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001756}
1757
1758void __init build_tlb_refill_handler(void)
1759{
1760 /*
1761 * The refill handler is generated per-CPU, multi-node systems
1762 * may have local storage for it. The other handlers are only
1763 * needed once.
1764 */
1765 static int run_once = 0;
1766
1767 switch (current_cpu_data.cputype) {
1768 case CPU_R2000:
1769 case CPU_R3000:
1770 case CPU_R3000A:
1771 case CPU_R3081E:
1772 case CPU_TX3912:
1773 case CPU_TX3922:
1774 case CPU_TX3927:
1775 build_r3000_tlb_refill_handler();
1776 if (!run_once) {
1777 build_r3000_tlb_load_handler();
1778 build_r3000_tlb_store_handler();
1779 build_r3000_tlb_modify_handler();
1780 run_once++;
1781 }
1782 break;
1783
1784 case CPU_R6000:
1785 case CPU_R6000A:
1786 panic("No R6000 TLB refill handler yet");
1787 break;
1788
1789 case CPU_R8000:
1790 panic("No R8000 TLB refill handler yet");
1791 break;
1792
1793 default:
1794 build_r4000_tlb_refill_handler();
1795 if (!run_once) {
1796 build_r4000_tlb_load_handler();
1797 build_r4000_tlb_store_handler();
1798 build_r4000_tlb_modify_handler();
1799 run_once++;
1800 }
1801 }
1802}
Ralf Baechle1d40cfc2005-07-15 15:23:23 +00001803
1804void __init flush_tlb_handlers(void)
1805{
1806 flush_icache_range((unsigned long)handle_tlbl,
1807 (unsigned long)handle_tlbl + sizeof(handle_tlbl));
1808 flush_icache_range((unsigned long)handle_tlbs,
1809 (unsigned long)handle_tlbs + sizeof(handle_tlbs));
1810 flush_icache_range((unsigned long)handle_tlbm,
1811 (unsigned long)handle_tlbm + sizeof(handle_tlbm));
1812}