page.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692
  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. * Copyright (C) 2003, 04, 05 Ralf Baechle (ralf@linux-mips.org)
  7. * Copyright (C) 2007 Maciej W. Rozycki
  8. * Copyright (C) 2008 Thiemo Seufer
  9. * Copyright (C) 2012 MIPS Technologies, Inc.
  10. */
  11. #include <linux/kernel.h>
  12. #include <linux/sched.h>
  13. #include <linux/smp.h>
  14. #include <linux/mm.h>
  15. #include <linux/proc_fs.h>
  16. #include <asm/bugs.h>
  17. #include <asm/cacheops.h>
  18. #include <asm/cpu-type.h>
  19. #include <asm/inst.h>
  20. #include <asm/io.h>
  21. #include <asm/page.h>
  22. #include <asm/pgtable.h>
  23. #include <asm/prefetch.h>
  24. #include <asm/bootinfo.h>
  25. #include <asm/mipsregs.h>
  26. #include <asm/mmu_context.h>
  27. #include <asm/cpu.h>
  28. #include <asm/war.h>
  29. #ifdef CONFIG_SIBYTE_DMA_PAGEOPS
  30. #include <asm/sibyte/sb1250.h>
  31. #include <asm/sibyte/sb1250_regs.h>
  32. #include <asm/sibyte/sb1250_dma.h>
  33. #endif
  34. #include <asm/uasm.h>
  35. /* Registers used in the assembled routines. */
  36. #define ZERO 0
  37. #define AT 2
  38. #define A0 4
  39. #define A1 5
  40. #define A2 6
  41. #define T0 8
  42. #define T1 9
  43. #define T2 10
  44. #define T3 11
  45. #define T9 25
  46. #define RA 31
  47. /* Handle labels (which must be positive integers). */
  48. enum label_id {
  49. label_clear_nopref = 1,
  50. label_clear_pref,
  51. label_copy_nopref,
  52. label_copy_pref_both,
  53. label_copy_pref_store,
  54. };
  55. UASM_L_LA(_clear_nopref)
  56. UASM_L_LA(_clear_pref)
  57. UASM_L_LA(_copy_nopref)
  58. UASM_L_LA(_copy_pref_both)
  59. UASM_L_LA(_copy_pref_store)
  60. /* We need one branch and therefore one relocation per target label. */
  61. static struct uasm_label labels[5];
  62. static struct uasm_reloc relocs[5];
  63. #define cpu_is_r4600_v1_x() ((read_c0_prid() & 0xfffffff0) == 0x00002010)
  64. #define cpu_is_r4600_v2_x() ((read_c0_prid() & 0xfffffff0) == 0x00002020)
  65. /*
  66. * R6 has a limited offset of the pref instruction.
  67. * Skip it if the offset is more than 9 bits.
  68. */
  69. #define _uasm_i_pref(a, b, c, d) \
  70. do { \
  71. if (cpu_has_mips_r6) { \
  72. if (c <= 0xff && c >= -0x100) \
  73. uasm_i_pref(a, b, c, d);\
  74. } else { \
  75. uasm_i_pref(a, b, c, d); \
  76. } \
  77. } while(0)
  78. static int pref_bias_clear_store;
  79. static int pref_bias_copy_load;
  80. static int pref_bias_copy_store;
  81. static u32 pref_src_mode;
  82. static u32 pref_dst_mode;
  83. static int clear_word_size;
  84. static int copy_word_size;
  85. static int half_clear_loop_size;
  86. static int half_copy_loop_size;
  87. static int cache_line_size;
  88. #define cache_line_mask() (cache_line_size - 1)
  89. static inline void
  90. pg_addiu(u32 **buf, unsigned int reg1, unsigned int reg2, unsigned int off)
  91. {
  92. if (cpu_has_64bit_gp_regs && DADDI_WAR && r4k_daddiu_bug()) {
  93. if (off > 0x7fff) {
  94. uasm_i_lui(buf, T9, uasm_rel_hi(off));
  95. uasm_i_addiu(buf, T9, T9, uasm_rel_lo(off));
  96. } else
  97. uasm_i_addiu(buf, T9, ZERO, off);
  98. uasm_i_daddu(buf, reg1, reg2, T9);
  99. } else {
  100. if (off > 0x7fff) {
  101. uasm_i_lui(buf, T9, uasm_rel_hi(off));
  102. uasm_i_addiu(buf, T9, T9, uasm_rel_lo(off));
  103. UASM_i_ADDU(buf, reg1, reg2, T9);
  104. } else
  105. UASM_i_ADDIU(buf, reg1, reg2, off);
  106. }
  107. }
  108. static void set_prefetch_parameters(void)
  109. {
  110. if (cpu_has_64bit_gp_regs || cpu_has_64bit_zero_reg)
  111. clear_word_size = 8;
  112. else
  113. clear_word_size = 4;
  114. if (cpu_has_64bit_gp_regs)
  115. copy_word_size = 8;
  116. else
  117. copy_word_size = 4;
  118. /*
  119. * The pref's used here are using "streaming" hints, which cause the
  120. * copied data to be kicked out of the cache sooner. A page copy often
  121. * ends up copying a lot more data than is commonly used, so this seems
  122. * to make sense in terms of reducing cache pollution, but I've no real
  123. * performance data to back this up.
  124. */
  125. if (cpu_has_prefetch) {
  126. /*
  127. * XXX: Most prefetch bias values in here are based on
  128. * guesswork.
  129. */
  130. cache_line_size = cpu_dcache_line_size();
  131. switch (current_cpu_type()) {
  132. case CPU_R5500:
  133. case CPU_TX49XX:
  134. /* These processors only support the Pref_Load. */
  135. pref_bias_copy_load = 256;
  136. break;
  137. case CPU_R10000:
  138. case CPU_R12000:
  139. case CPU_R14000:
  140. case CPU_R16000:
  141. /*
  142. * Those values have been experimentally tuned for an
  143. * Origin 200.
  144. */
  145. pref_bias_clear_store = 512;
  146. pref_bias_copy_load = 256;
  147. pref_bias_copy_store = 256;
  148. pref_src_mode = Pref_LoadStreamed;
  149. pref_dst_mode = Pref_StoreStreamed;
  150. break;
  151. case CPU_SB1:
  152. case CPU_SB1A:
  153. pref_bias_clear_store = 128;
  154. pref_bias_copy_load = 128;
  155. pref_bias_copy_store = 128;
  156. /*
  157. * SB1 pass1 Pref_LoadStreamed/Pref_StoreStreamed
  158. * hints are broken.
  159. */
  160. if (current_cpu_type() == CPU_SB1 &&
  161. (current_cpu_data.processor_id & 0xff) < 0x02) {
  162. pref_src_mode = Pref_Load;
  163. pref_dst_mode = Pref_Store;
  164. } else {
  165. pref_src_mode = Pref_LoadStreamed;
  166. pref_dst_mode = Pref_StoreStreamed;
  167. }
  168. break;
  169. case CPU_LOONGSON3:
  170. /* Loongson-3 only support the Pref_Load/Pref_Store. */
  171. pref_bias_clear_store = 128;
  172. pref_bias_copy_load = 128;
  173. pref_bias_copy_store = 128;
  174. pref_src_mode = Pref_Load;
  175. pref_dst_mode = Pref_Store;
  176. break;
  177. default:
  178. pref_bias_clear_store = 128;
  179. pref_bias_copy_load = 256;
  180. pref_bias_copy_store = 128;
  181. pref_src_mode = Pref_LoadStreamed;
  182. if (cpu_has_mips_r6)
  183. /*
  184. * Bit 30 (Pref_PrepareForStore) has been
  185. * removed from MIPS R6. Use bit 5
  186. * (Pref_StoreStreamed).
  187. */
  188. pref_dst_mode = Pref_StoreStreamed;
  189. else
  190. pref_dst_mode = Pref_PrepareForStore;
  191. break;
  192. }
  193. } else {
  194. if (cpu_has_cache_cdex_s)
  195. cache_line_size = cpu_scache_line_size();
  196. else if (cpu_has_cache_cdex_p)
  197. cache_line_size = cpu_dcache_line_size();
  198. }
  199. /*
  200. * Too much unrolling will overflow the available space in
  201. * clear_space_array / copy_page_array.
  202. */
  203. half_clear_loop_size = min(16 * clear_word_size,
  204. max(cache_line_size >> 1,
  205. 4 * clear_word_size));
  206. half_copy_loop_size = min(16 * copy_word_size,
  207. max(cache_line_size >> 1,
  208. 4 * copy_word_size));
  209. }
  210. static void build_clear_store(u32 **buf, int off)
  211. {
  212. if (cpu_has_64bit_gp_regs || cpu_has_64bit_zero_reg) {
  213. uasm_i_sd(buf, ZERO, off, A0);
  214. } else {
  215. uasm_i_sw(buf, ZERO, off, A0);
  216. }
  217. }
  218. static inline void build_clear_pref(u32 **buf, int off)
  219. {
  220. if (off & cache_line_mask())
  221. return;
  222. if (pref_bias_clear_store) {
  223. _uasm_i_pref(buf, pref_dst_mode, pref_bias_clear_store + off,
  224. A0);
  225. } else if (cache_line_size == (half_clear_loop_size << 1)) {
  226. if (cpu_has_cache_cdex_s) {
  227. uasm_i_cache(buf, Create_Dirty_Excl_SD, off, A0);
  228. } else if (cpu_has_cache_cdex_p) {
  229. if (R4600_V1_HIT_CACHEOP_WAR && cpu_is_r4600_v1_x()) {
  230. uasm_i_nop(buf);
  231. uasm_i_nop(buf);
  232. uasm_i_nop(buf);
  233. uasm_i_nop(buf);
  234. }
  235. if (R4600_V2_HIT_CACHEOP_WAR && cpu_is_r4600_v2_x())
  236. uasm_i_lw(buf, ZERO, ZERO, AT);
  237. uasm_i_cache(buf, Create_Dirty_Excl_D, off, A0);
  238. }
  239. }
  240. }
  241. extern u32 __clear_page_start;
  242. extern u32 __clear_page_end;
  243. extern u32 __copy_page_start;
  244. extern u32 __copy_page_end;
  245. void build_clear_page(void)
  246. {
  247. int off;
  248. u32 *buf = &__clear_page_start;
  249. struct uasm_label *l = labels;
  250. struct uasm_reloc *r = relocs;
  251. int i;
  252. static atomic_t run_once = ATOMIC_INIT(0);
  253. if (atomic_xchg(&run_once, 1)) {
  254. return;
  255. }
  256. memset(labels, 0, sizeof(labels));
  257. memset(relocs, 0, sizeof(relocs));
  258. set_prefetch_parameters();
  259. /*
  260. * This algorithm makes the following assumptions:
  261. * - The prefetch bias is a multiple of 2 words.
  262. * - The prefetch bias is less than one page.
  263. */
  264. BUG_ON(pref_bias_clear_store % (2 * clear_word_size));
  265. BUG_ON(PAGE_SIZE < pref_bias_clear_store);
  266. off = PAGE_SIZE - pref_bias_clear_store;
  267. if (off > 0xffff || !pref_bias_clear_store)
  268. pg_addiu(&buf, A2, A0, off);
  269. else
  270. uasm_i_ori(&buf, A2, A0, off);
  271. if (R4600_V2_HIT_CACHEOP_WAR && cpu_is_r4600_v2_x())
  272. uasm_i_lui(&buf, AT, uasm_rel_hi(0xa0000000));
  273. off = cache_line_size ? min(8, pref_bias_clear_store / cache_line_size)
  274. * cache_line_size : 0;
  275. while (off) {
  276. build_clear_pref(&buf, -off);
  277. off -= cache_line_size;
  278. }
  279. uasm_l_clear_pref(&l, buf);
  280. do {
  281. build_clear_pref(&buf, off);
  282. build_clear_store(&buf, off);
  283. off += clear_word_size;
  284. } while (off < half_clear_loop_size);
  285. pg_addiu(&buf, A0, A0, 2 * off);
  286. off = -off;
  287. do {
  288. build_clear_pref(&buf, off);
  289. if (off == -clear_word_size)
  290. uasm_il_bne(&buf, &r, A0, A2, label_clear_pref);
  291. build_clear_store(&buf, off);
  292. off += clear_word_size;
  293. } while (off < 0);
  294. if (pref_bias_clear_store) {
  295. pg_addiu(&buf, A2, A0, pref_bias_clear_store);
  296. uasm_l_clear_nopref(&l, buf);
  297. off = 0;
  298. do {
  299. build_clear_store(&buf, off);
  300. off += clear_word_size;
  301. } while (off < half_clear_loop_size);
  302. pg_addiu(&buf, A0, A0, 2 * off);
  303. off = -off;
  304. do {
  305. if (off == -clear_word_size)
  306. uasm_il_bne(&buf, &r, A0, A2,
  307. label_clear_nopref);
  308. build_clear_store(&buf, off);
  309. off += clear_word_size;
  310. } while (off < 0);
  311. }
  312. uasm_i_jr(&buf, RA);
  313. uasm_i_nop(&buf);
  314. BUG_ON(buf > &__clear_page_end);
  315. uasm_resolve_relocs(relocs, labels);
  316. pr_debug("Synthesized clear page handler (%u instructions).\n",
  317. (u32)(buf - &__clear_page_start));
  318. pr_debug("\t.set push\n");
  319. pr_debug("\t.set noreorder\n");
  320. for (i = 0; i < (buf - &__clear_page_start); i++)
  321. pr_debug("\t.word 0x%08x\n", (&__clear_page_start)[i]);
  322. pr_debug("\t.set pop\n");
  323. }
  324. static void build_copy_load(u32 **buf, int reg, int off)
  325. {
  326. if (cpu_has_64bit_gp_regs) {
  327. uasm_i_ld(buf, reg, off, A1);
  328. } else {
  329. uasm_i_lw(buf, reg, off, A1);
  330. }
  331. }
  332. static void build_copy_store(u32 **buf, int reg, int off)
  333. {
  334. if (cpu_has_64bit_gp_regs) {
  335. uasm_i_sd(buf, reg, off, A0);
  336. } else {
  337. uasm_i_sw(buf, reg, off, A0);
  338. }
  339. }
  340. static inline void build_copy_load_pref(u32 **buf, int off)
  341. {
  342. if (off & cache_line_mask())
  343. return;
  344. if (pref_bias_copy_load)
  345. _uasm_i_pref(buf, pref_src_mode, pref_bias_copy_load + off, A1);
  346. }
  347. static inline void build_copy_store_pref(u32 **buf, int off)
  348. {
  349. if (off & cache_line_mask())
  350. return;
  351. if (pref_bias_copy_store) {
  352. _uasm_i_pref(buf, pref_dst_mode, pref_bias_copy_store + off,
  353. A0);
  354. } else if (cache_line_size == (half_copy_loop_size << 1)) {
  355. if (cpu_has_cache_cdex_s) {
  356. uasm_i_cache(buf, Create_Dirty_Excl_SD, off, A0);
  357. } else if (cpu_has_cache_cdex_p) {
  358. if (R4600_V1_HIT_CACHEOP_WAR && cpu_is_r4600_v1_x()) {
  359. uasm_i_nop(buf);
  360. uasm_i_nop(buf);
  361. uasm_i_nop(buf);
  362. uasm_i_nop(buf);
  363. }
  364. if (R4600_V2_HIT_CACHEOP_WAR && cpu_is_r4600_v2_x())
  365. uasm_i_lw(buf, ZERO, ZERO, AT);
  366. uasm_i_cache(buf, Create_Dirty_Excl_D, off, A0);
  367. }
  368. }
  369. }
  370. void build_copy_page(void)
  371. {
  372. int off;
  373. u32 *buf = &__copy_page_start;
  374. struct uasm_label *l = labels;
  375. struct uasm_reloc *r = relocs;
  376. int i;
  377. static atomic_t run_once = ATOMIC_INIT(0);
  378. if (atomic_xchg(&run_once, 1)) {
  379. return;
  380. }
  381. memset(labels, 0, sizeof(labels));
  382. memset(relocs, 0, sizeof(relocs));
  383. set_prefetch_parameters();
  384. /*
  385. * This algorithm makes the following assumptions:
  386. * - All prefetch biases are multiples of 8 words.
  387. * - The prefetch biases are less than one page.
  388. * - The store prefetch bias isn't greater than the load
  389. * prefetch bias.
  390. */
  391. BUG_ON(pref_bias_copy_load % (8 * copy_word_size));
  392. BUG_ON(pref_bias_copy_store % (8 * copy_word_size));
  393. BUG_ON(PAGE_SIZE < pref_bias_copy_load);
  394. BUG_ON(pref_bias_copy_store > pref_bias_copy_load);
  395. off = PAGE_SIZE - pref_bias_copy_load;
  396. if (off > 0xffff || !pref_bias_copy_load)
  397. pg_addiu(&buf, A2, A0, off);
  398. else
  399. uasm_i_ori(&buf, A2, A0, off);
  400. if (R4600_V2_HIT_CACHEOP_WAR && cpu_is_r4600_v2_x())
  401. uasm_i_lui(&buf, AT, uasm_rel_hi(0xa0000000));
  402. off = cache_line_size ? min(8, pref_bias_copy_load / cache_line_size) *
  403. cache_line_size : 0;
  404. while (off) {
  405. build_copy_load_pref(&buf, -off);
  406. off -= cache_line_size;
  407. }
  408. off = cache_line_size ? min(8, pref_bias_copy_store / cache_line_size) *
  409. cache_line_size : 0;
  410. while (off) {
  411. build_copy_store_pref(&buf, -off);
  412. off -= cache_line_size;
  413. }
  414. uasm_l_copy_pref_both(&l, buf);
  415. do {
  416. build_copy_load_pref(&buf, off);
  417. build_copy_load(&buf, T0, off);
  418. build_copy_load_pref(&buf, off + copy_word_size);
  419. build_copy_load(&buf, T1, off + copy_word_size);
  420. build_copy_load_pref(&buf, off + 2 * copy_word_size);
  421. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  422. build_copy_load_pref(&buf, off + 3 * copy_word_size);
  423. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  424. build_copy_store_pref(&buf, off);
  425. build_copy_store(&buf, T0, off);
  426. build_copy_store_pref(&buf, off + copy_word_size);
  427. build_copy_store(&buf, T1, off + copy_word_size);
  428. build_copy_store_pref(&buf, off + 2 * copy_word_size);
  429. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  430. build_copy_store_pref(&buf, off + 3 * copy_word_size);
  431. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  432. off += 4 * copy_word_size;
  433. } while (off < half_copy_loop_size);
  434. pg_addiu(&buf, A1, A1, 2 * off);
  435. pg_addiu(&buf, A0, A0, 2 * off);
  436. off = -off;
  437. do {
  438. build_copy_load_pref(&buf, off);
  439. build_copy_load(&buf, T0, off);
  440. build_copy_load_pref(&buf, off + copy_word_size);
  441. build_copy_load(&buf, T1, off + copy_word_size);
  442. build_copy_load_pref(&buf, off + 2 * copy_word_size);
  443. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  444. build_copy_load_pref(&buf, off + 3 * copy_word_size);
  445. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  446. build_copy_store_pref(&buf, off);
  447. build_copy_store(&buf, T0, off);
  448. build_copy_store_pref(&buf, off + copy_word_size);
  449. build_copy_store(&buf, T1, off + copy_word_size);
  450. build_copy_store_pref(&buf, off + 2 * copy_word_size);
  451. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  452. build_copy_store_pref(&buf, off + 3 * copy_word_size);
  453. if (off == -(4 * copy_word_size))
  454. uasm_il_bne(&buf, &r, A2, A0, label_copy_pref_both);
  455. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  456. off += 4 * copy_word_size;
  457. } while (off < 0);
  458. if (pref_bias_copy_load - pref_bias_copy_store) {
  459. pg_addiu(&buf, A2, A0,
  460. pref_bias_copy_load - pref_bias_copy_store);
  461. uasm_l_copy_pref_store(&l, buf);
  462. off = 0;
  463. do {
  464. build_copy_load(&buf, T0, off);
  465. build_copy_load(&buf, T1, off + copy_word_size);
  466. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  467. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  468. build_copy_store_pref(&buf, off);
  469. build_copy_store(&buf, T0, off);
  470. build_copy_store_pref(&buf, off + copy_word_size);
  471. build_copy_store(&buf, T1, off + copy_word_size);
  472. build_copy_store_pref(&buf, off + 2 * copy_word_size);
  473. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  474. build_copy_store_pref(&buf, off + 3 * copy_word_size);
  475. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  476. off += 4 * copy_word_size;
  477. } while (off < half_copy_loop_size);
  478. pg_addiu(&buf, A1, A1, 2 * off);
  479. pg_addiu(&buf, A0, A0, 2 * off);
  480. off = -off;
  481. do {
  482. build_copy_load(&buf, T0, off);
  483. build_copy_load(&buf, T1, off + copy_word_size);
  484. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  485. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  486. build_copy_store_pref(&buf, off);
  487. build_copy_store(&buf, T0, off);
  488. build_copy_store_pref(&buf, off + copy_word_size);
  489. build_copy_store(&buf, T1, off + copy_word_size);
  490. build_copy_store_pref(&buf, off + 2 * copy_word_size);
  491. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  492. build_copy_store_pref(&buf, off + 3 * copy_word_size);
  493. if (off == -(4 * copy_word_size))
  494. uasm_il_bne(&buf, &r, A2, A0,
  495. label_copy_pref_store);
  496. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  497. off += 4 * copy_word_size;
  498. } while (off < 0);
  499. }
  500. if (pref_bias_copy_store) {
  501. pg_addiu(&buf, A2, A0, pref_bias_copy_store);
  502. uasm_l_copy_nopref(&l, buf);
  503. off = 0;
  504. do {
  505. build_copy_load(&buf, T0, off);
  506. build_copy_load(&buf, T1, off + copy_word_size);
  507. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  508. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  509. build_copy_store(&buf, T0, off);
  510. build_copy_store(&buf, T1, off + copy_word_size);
  511. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  512. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  513. off += 4 * copy_word_size;
  514. } while (off < half_copy_loop_size);
  515. pg_addiu(&buf, A1, A1, 2 * off);
  516. pg_addiu(&buf, A0, A0, 2 * off);
  517. off = -off;
  518. do {
  519. build_copy_load(&buf, T0, off);
  520. build_copy_load(&buf, T1, off + copy_word_size);
  521. build_copy_load(&buf, T2, off + 2 * copy_word_size);
  522. build_copy_load(&buf, T3, off + 3 * copy_word_size);
  523. build_copy_store(&buf, T0, off);
  524. build_copy_store(&buf, T1, off + copy_word_size);
  525. build_copy_store(&buf, T2, off + 2 * copy_word_size);
  526. if (off == -(4 * copy_word_size))
  527. uasm_il_bne(&buf, &r, A2, A0,
  528. label_copy_nopref);
  529. build_copy_store(&buf, T3, off + 3 * copy_word_size);
  530. off += 4 * copy_word_size;
  531. } while (off < 0);
  532. }
  533. uasm_i_jr(&buf, RA);
  534. uasm_i_nop(&buf);
  535. BUG_ON(buf > &__copy_page_end);
  536. uasm_resolve_relocs(relocs, labels);
  537. pr_debug("Synthesized copy page handler (%u instructions).\n",
  538. (u32)(buf - &__copy_page_start));
  539. pr_debug("\t.set push\n");
  540. pr_debug("\t.set noreorder\n");
  541. for (i = 0; i < (buf - &__copy_page_start); i++)
  542. pr_debug("\t.word 0x%08x\n", (&__copy_page_start)[i]);
  543. pr_debug("\t.set pop\n");
  544. }
  545. #ifdef CONFIG_SIBYTE_DMA_PAGEOPS
  546. extern void clear_page_cpu(void *page);
  547. extern void copy_page_cpu(void *to, void *from);
  548. /*
  549. * Pad descriptors to cacheline, since each is exclusively owned by a
  550. * particular CPU.
  551. */
  552. struct dmadscr {
  553. u64 dscr_a;
  554. u64 dscr_b;
  555. u64 pad_a;
  556. u64 pad_b;
  557. } ____cacheline_aligned_in_smp page_descr[DM_NUM_CHANNELS];
  558. void sb1_dma_init(void)
  559. {
  560. int i;
  561. for (i = 0; i < DM_NUM_CHANNELS; i++) {
  562. const u64 base_val = CPHYSADDR((unsigned long)&page_descr[i]) |
  563. V_DM_DSCR_BASE_RINGSZ(1);
  564. void *base_reg = IOADDR(A_DM_REGISTER(i, R_DM_DSCR_BASE));
  565. __raw_writeq(base_val, base_reg);
  566. __raw_writeq(base_val | M_DM_DSCR_BASE_RESET, base_reg);
  567. __raw_writeq(base_val | M_DM_DSCR_BASE_ENABL, base_reg);
  568. }
  569. }
  570. void clear_page(void *page)
  571. {
  572. u64 to_phys = CPHYSADDR((unsigned long)page);
  573. unsigned int cpu = smp_processor_id();
  574. /* if the page is not in KSEG0, use old way */
  575. if ((long)KSEGX((unsigned long)page) != (long)CKSEG0)
  576. return clear_page_cpu(page);
  577. page_descr[cpu].dscr_a = to_phys | M_DM_DSCRA_ZERO_MEM |
  578. M_DM_DSCRA_L2C_DEST | M_DM_DSCRA_INTERRUPT;
  579. page_descr[cpu].dscr_b = V_DM_DSCRB_SRC_LENGTH(PAGE_SIZE);
  580. __raw_writeq(1, IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_COUNT)));
  581. /*
  582. * Don't really want to do it this way, but there's no
  583. * reliable way to delay completion detection.
  584. */
  585. while (!(__raw_readq(IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_BASE_DEBUG)))
  586. & M_DM_DSCR_BASE_INTERRUPT))
  587. ;
  588. __raw_readq(IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_BASE)));
  589. }
  590. void copy_page(void *to, void *from)
  591. {
  592. u64 from_phys = CPHYSADDR((unsigned long)from);
  593. u64 to_phys = CPHYSADDR((unsigned long)to);
  594. unsigned int cpu = smp_processor_id();
  595. /* if any page is not in KSEG0, use old way */
  596. if ((long)KSEGX((unsigned long)to) != (long)CKSEG0
  597. || (long)KSEGX((unsigned long)from) != (long)CKSEG0)
  598. return copy_page_cpu(to, from);
  599. page_descr[cpu].dscr_a = to_phys | M_DM_DSCRA_L2C_DEST |
  600. M_DM_DSCRA_INTERRUPT;
  601. page_descr[cpu].dscr_b = from_phys | V_DM_DSCRB_SRC_LENGTH(PAGE_SIZE);
  602. __raw_writeq(1, IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_COUNT)));
  603. /*
  604. * Don't really want to do it this way, but there's no
  605. * reliable way to delay completion detection.
  606. */
  607. while (!(__raw_readq(IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_BASE_DEBUG)))
  608. & M_DM_DSCR_BASE_INTERRUPT))
  609. ;
  610. __raw_readq(IOADDR(A_DM_REGISTER(cpu, R_DM_DSCR_BASE)));
  611. }
  612. #endif /* CONFIG_SIBYTE_DMA_PAGEOPS */