tlbex.c 45 KB

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