msm_iommu_pagetable.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660
  1. /* Copyright (c) 2012-2013, The Linux Foundation. All rights reserved.
  2. *
  3. * This program is free software; you can redistribute it and/or modify
  4. * it under the terms of the GNU General Public License version 2 and
  5. * only version 2 as published by the Free Software Foundation.
  6. *
  7. * This program is distributed in the hope that it will be useful,
  8. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. * GNU General Public License for more details.
  11. */
  12. #include <linux/kernel.h>
  13. #include <linux/module.h>
  14. #include <linux/errno.h>
  15. #include <linux/io.h>
  16. #include <linux/iommu.h>
  17. #include <linux/scatterlist.h>
  18. #include <asm/cacheflush.h>
  19. #include <mach/iommu.h>
  20. #include <mach/msm_iommu_priv.h>
  21. #include <trace/events/kmem.h>
  22. #include "msm_iommu_pagetable.h"
  23. #define NUM_FL_PTE 4096
  24. #define NUM_SL_PTE 256
  25. #define NUM_TEX_CLASS 8
  26. /* First-level page table bits */
  27. #define FL_BASE_MASK 0xFFFFFC00
  28. #define FL_TYPE_TABLE (1 << 0)
  29. #define FL_TYPE_SECT (2 << 0)
  30. #define FL_SUPERSECTION (1 << 18)
  31. #define FL_AP0 (1 << 10)
  32. #define FL_AP1 (1 << 11)
  33. #define FL_AP2 (1 << 15)
  34. #define FL_SHARED (1 << 16)
  35. #define FL_BUFFERABLE (1 << 2)
  36. #define FL_CACHEABLE (1 << 3)
  37. #define FL_TEX0 (1 << 12)
  38. #define FL_OFFSET(va) (((va) & 0xFFF00000) >> 20)
  39. #define FL_NG (1 << 17)
  40. /* Second-level page table bits */
  41. #define SL_BASE_MASK_LARGE 0xFFFF0000
  42. #define SL_BASE_MASK_SMALL 0xFFFFF000
  43. #define SL_TYPE_LARGE (1 << 0)
  44. #define SL_TYPE_SMALL (2 << 0)
  45. #define SL_AP0 (1 << 4)
  46. #define SL_AP1 (2 << 4)
  47. #define SL_AP2 (1 << 9)
  48. #define SL_SHARED (1 << 10)
  49. #define SL_BUFFERABLE (1 << 2)
  50. #define SL_CACHEABLE (1 << 3)
  51. #define SL_TEX0 (1 << 6)
  52. #define SL_OFFSET(va) (((va) & 0xFF000) >> 12)
  53. #define SL_NG (1 << 11)
  54. /* Memory type and cache policy attributes */
  55. #define MT_SO 0
  56. #define MT_DEV 1
  57. #define MT_NORMAL 2
  58. #define CP_NONCACHED 0
  59. #define CP_WB_WA 1
  60. #define CP_WT 2
  61. #define CP_WB_NWA 3
  62. /* Sharability attributes of MSM IOMMU mappings */
  63. #define MSM_IOMMU_ATTR_NON_SH 0x0
  64. #define MSM_IOMMU_ATTR_SH 0x4
  65. /* Cacheability attributes of MSM IOMMU mappings */
  66. #define MSM_IOMMU_ATTR_NONCACHED 0x0
  67. #define MSM_IOMMU_ATTR_CACHED_WB_WA 0x1
  68. #define MSM_IOMMU_ATTR_CACHED_WB_NWA 0x2
  69. #define MSM_IOMMU_ATTR_CACHED_WT 0x3
  70. static int msm_iommu_tex_class[4];
  71. /* TEX Remap Registers */
  72. #define NMRR_ICP(nmrr, n) (((nmrr) & (3 << ((n) * 2))) >> ((n) * 2))
  73. #define NMRR_OCP(nmrr, n) (((nmrr) & (3 << ((n) * 2 + 16))) >> ((n) * 2 + 16))
  74. #define PRRR_NOS(prrr, n) ((prrr) & (1 << ((n) + 24)) ? 1 : 0)
  75. #define PRRR_MT(prrr, n) ((((prrr) & (3 << ((n) * 2))) >> ((n) * 2)))
  76. static inline void clean_pte(unsigned long *start, unsigned long *end,
  77. int redirect)
  78. {
  79. if (!redirect)
  80. dmac_flush_range(start, end);
  81. }
  82. int msm_iommu_pagetable_alloc(struct msm_iommu_pt *pt)
  83. {
  84. pt->fl_table = (unsigned long *)__get_free_pages(GFP_KERNEL,
  85. get_order(SZ_16K));
  86. if (!pt->fl_table)
  87. return -ENOMEM;
  88. memset(pt->fl_table, 0, SZ_16K);
  89. clean_pte(pt->fl_table, pt->fl_table + NUM_FL_PTE, pt->redirect);
  90. return 0;
  91. }
  92. void msm_iommu_pagetable_free(struct msm_iommu_pt *pt)
  93. {
  94. unsigned long *fl_table;
  95. int i;
  96. fl_table = pt->fl_table;
  97. for (i = 0; i < NUM_FL_PTE; i++)
  98. if ((fl_table[i] & 0x03) == FL_TYPE_TABLE)
  99. free_page((unsigned long) __va(((fl_table[i]) &
  100. FL_BASE_MASK)));
  101. free_pages((unsigned long)fl_table, get_order(SZ_16K));
  102. pt->fl_table = 0;
  103. }
  104. static int __get_pgprot(int prot, int len)
  105. {
  106. unsigned int pgprot;
  107. int tex;
  108. if (!(prot & (IOMMU_READ | IOMMU_WRITE))) {
  109. prot |= IOMMU_READ | IOMMU_WRITE;
  110. WARN_ONCE(1, "No attributes in iommu mapping; assuming RW\n");
  111. }
  112. if ((prot & IOMMU_WRITE) && !(prot & IOMMU_READ)) {
  113. prot |= IOMMU_READ;
  114. WARN_ONCE(1, "Write-only unsupported; falling back to RW\n");
  115. }
  116. if (prot & IOMMU_CACHE)
  117. tex = (pgprot_kernel >> 2) & 0x07;
  118. else
  119. tex = msm_iommu_tex_class[MSM_IOMMU_ATTR_NONCACHED];
  120. if (tex < 0 || tex > NUM_TEX_CLASS - 1)
  121. return 0;
  122. if (len == SZ_16M || len == SZ_1M) {
  123. pgprot = FL_SHARED;
  124. pgprot |= tex & 0x01 ? FL_BUFFERABLE : 0;
  125. pgprot |= tex & 0x02 ? FL_CACHEABLE : 0;
  126. pgprot |= tex & 0x04 ? FL_TEX0 : 0;
  127. pgprot |= FL_AP0 | FL_AP1;
  128. pgprot |= prot & IOMMU_WRITE ? 0 : FL_AP2;
  129. } else {
  130. pgprot = SL_SHARED;
  131. pgprot |= tex & 0x01 ? SL_BUFFERABLE : 0;
  132. pgprot |= tex & 0x02 ? SL_CACHEABLE : 0;
  133. pgprot |= tex & 0x04 ? SL_TEX0 : 0;
  134. pgprot |= SL_AP0 | SL_AP1;
  135. pgprot |= prot & IOMMU_WRITE ? 0 : SL_AP2;
  136. }
  137. return pgprot;
  138. }
  139. static unsigned long *make_second_level(struct msm_iommu_pt *pt,
  140. unsigned long *fl_pte)
  141. {
  142. unsigned long *sl;
  143. sl = (unsigned long *) __get_free_pages(GFP_KERNEL,
  144. get_order(SZ_4K));
  145. if (!sl) {
  146. pr_debug("Could not allocate second level table\n");
  147. goto fail;
  148. }
  149. memset(sl, 0, SZ_4K);
  150. clean_pte(sl, sl + NUM_SL_PTE, pt->redirect);
  151. *fl_pte = ((((int)__pa(sl)) & FL_BASE_MASK) | \
  152. FL_TYPE_TABLE);
  153. clean_pte(fl_pte, fl_pte + 1, pt->redirect);
  154. fail:
  155. return sl;
  156. }
  157. static int sl_4k(unsigned long *sl_pte, phys_addr_t pa, unsigned int pgprot)
  158. {
  159. int ret = 0;
  160. if (*sl_pte) {
  161. ret = -EBUSY;
  162. goto fail;
  163. }
  164. *sl_pte = (pa & SL_BASE_MASK_SMALL) | SL_NG | SL_SHARED
  165. | SL_TYPE_SMALL | pgprot;
  166. fail:
  167. return ret;
  168. }
  169. static int sl_64k(unsigned long *sl_pte, phys_addr_t pa, unsigned int pgprot)
  170. {
  171. int ret = 0;
  172. int i;
  173. for (i = 0; i < 16; i++)
  174. if (*(sl_pte+i)) {
  175. ret = -EBUSY;
  176. goto fail;
  177. }
  178. for (i = 0; i < 16; i++)
  179. *(sl_pte+i) = (pa & SL_BASE_MASK_LARGE) | SL_NG
  180. | SL_SHARED | SL_TYPE_LARGE | pgprot;
  181. fail:
  182. return ret;
  183. }
  184. static inline int fl_1m(unsigned long *fl_pte, phys_addr_t pa, int pgprot)
  185. {
  186. if (*fl_pte)
  187. return -EBUSY;
  188. *fl_pte = (pa & 0xFFF00000) | FL_NG | FL_TYPE_SECT | FL_SHARED
  189. | pgprot;
  190. return 0;
  191. }
  192. static inline int fl_16m(unsigned long *fl_pte, phys_addr_t pa, int pgprot)
  193. {
  194. int i;
  195. int ret = 0;
  196. for (i = 0; i < 16; i++)
  197. if (*(fl_pte+i)) {
  198. ret = -EBUSY;
  199. goto fail;
  200. }
  201. for (i = 0; i < 16; i++)
  202. *(fl_pte+i) = (pa & 0xFF000000) | FL_SUPERSECTION
  203. | FL_TYPE_SECT | FL_SHARED | FL_NG | pgprot;
  204. fail:
  205. return ret;
  206. }
  207. int msm_iommu_pagetable_map(struct msm_iommu_pt *pt, unsigned long va,
  208. phys_addr_t pa, size_t len, int prot)
  209. {
  210. unsigned long *fl_pte;
  211. unsigned long fl_offset;
  212. unsigned long *sl_table;
  213. unsigned long *sl_pte;
  214. unsigned long sl_offset;
  215. unsigned int pgprot;
  216. int ret = 0;
  217. if (len != SZ_16M && len != SZ_1M &&
  218. len != SZ_64K && len != SZ_4K) {
  219. pr_debug("Bad size: %d\n", len);
  220. ret = -EINVAL;
  221. goto fail;
  222. }
  223. if (!pt->fl_table) {
  224. pr_debug("Null page table\n");
  225. ret = -EINVAL;
  226. goto fail;
  227. }
  228. pgprot = __get_pgprot(prot, len);
  229. if (!pgprot) {
  230. ret = -EINVAL;
  231. goto fail;
  232. }
  233. fl_offset = FL_OFFSET(va); /* Upper 12 bits */
  234. fl_pte = pt->fl_table + fl_offset; /* int pointers, 4 bytes */
  235. if (len == SZ_16M) {
  236. ret = fl_16m(fl_pte, pa, pgprot);
  237. if (ret)
  238. goto fail;
  239. clean_pte(fl_pte, fl_pte + 16, pt->redirect);
  240. }
  241. if (len == SZ_1M) {
  242. ret = fl_1m(fl_pte, pa, pgprot);
  243. if (ret)
  244. goto fail;
  245. clean_pte(fl_pte, fl_pte + 1, pt->redirect);
  246. }
  247. /* Need a 2nd level table */
  248. if (len == SZ_4K || len == SZ_64K) {
  249. if (*fl_pte == 0) {
  250. if (make_second_level(pt, fl_pte) == NULL) {
  251. ret = -ENOMEM;
  252. goto fail;
  253. }
  254. }
  255. if (!(*fl_pte & FL_TYPE_TABLE)) {
  256. ret = -EBUSY;
  257. goto fail;
  258. }
  259. }
  260. sl_table = (unsigned long *) __va(((*fl_pte) & FL_BASE_MASK));
  261. sl_offset = SL_OFFSET(va);
  262. sl_pte = sl_table + sl_offset;
  263. if (len == SZ_4K) {
  264. ret = sl_4k(sl_pte, pa, pgprot);
  265. if (ret)
  266. goto fail;
  267. clean_pte(sl_pte, sl_pte + 1, pt->redirect);
  268. }
  269. if (len == SZ_64K) {
  270. ret = sl_64k(sl_pte, pa, pgprot);
  271. if (ret)
  272. goto fail;
  273. clean_pte(sl_pte, sl_pte + 16, pt->redirect);
  274. }
  275. fail:
  276. return ret;
  277. }
  278. size_t msm_iommu_pagetable_unmap(struct msm_iommu_pt *pt, unsigned long va,
  279. size_t len)
  280. {
  281. msm_iommu_pagetable_unmap_range(pt, va, len);
  282. return len;
  283. }
  284. static phys_addr_t get_phys_addr(struct scatterlist *sg)
  285. {
  286. /*
  287. * Try sg_dma_address first so that we can
  288. * map carveout regions that do not have a
  289. * struct page associated with them.
  290. */
  291. phys_addr_t pa = sg_dma_address(sg);
  292. if (pa == 0)
  293. pa = sg_phys(sg);
  294. return pa;
  295. }
  296. static int check_range(unsigned long *fl_table, unsigned int va,
  297. unsigned int len)
  298. {
  299. unsigned int offset = 0;
  300. unsigned long *fl_pte;
  301. unsigned long fl_offset;
  302. unsigned long *sl_table;
  303. unsigned long sl_start, sl_end;
  304. int i;
  305. fl_offset = FL_OFFSET(va); /* Upper 12 bits */
  306. fl_pte = fl_table + fl_offset; /* int pointers, 4 bytes */
  307. while (offset < len) {
  308. if (*fl_pte & FL_TYPE_TABLE) {
  309. sl_start = SL_OFFSET(va);
  310. sl_table = __va(((*fl_pte) & FL_BASE_MASK));
  311. sl_end = ((len - offset) / SZ_4K) + sl_start;
  312. if (sl_end > NUM_SL_PTE)
  313. sl_end = NUM_SL_PTE;
  314. for (i = sl_start; i < sl_end; i++) {
  315. if (sl_table[i] != 0) {
  316. pr_err("%08x - %08x already mapped\n",
  317. va, va + SZ_4K);
  318. return -EBUSY;
  319. }
  320. offset += SZ_4K;
  321. va += SZ_4K;
  322. }
  323. sl_start = 0;
  324. } else {
  325. if (*fl_pte != 0) {
  326. pr_err("%08x - %08x already mapped\n",
  327. va, va + SZ_1M);
  328. return -EBUSY;
  329. }
  330. va += SZ_1M;
  331. offset += SZ_1M;
  332. sl_start = 0;
  333. }
  334. fl_pte++;
  335. }
  336. return 0;
  337. }
  338. static inline int is_fully_aligned(unsigned int va, phys_addr_t pa, size_t len,
  339. int align)
  340. {
  341. return IS_ALIGNED(va, align) && IS_ALIGNED(pa, align)
  342. && (len >= align);
  343. }
  344. int msm_iommu_pagetable_map_range(struct msm_iommu_pt *pt, unsigned int va,
  345. struct scatterlist *sg, unsigned int len, int prot)
  346. {
  347. phys_addr_t pa;
  348. unsigned int start_va = va;
  349. unsigned int offset = 0;
  350. unsigned long *fl_pte;
  351. unsigned long fl_offset;
  352. unsigned long *sl_table = NULL;
  353. unsigned long sl_offset, sl_start;
  354. unsigned int chunk_size, chunk_offset = 0;
  355. int ret = 0;
  356. unsigned int pgprot4k, pgprot64k, pgprot1m, pgprot16m;
  357. BUG_ON(len & (SZ_4K - 1));
  358. pgprot4k = __get_pgprot(prot, SZ_4K);
  359. pgprot64k = __get_pgprot(prot, SZ_64K);
  360. pgprot1m = __get_pgprot(prot, SZ_1M);
  361. pgprot16m = __get_pgprot(prot, SZ_16M);
  362. if (!pgprot4k || !pgprot64k || !pgprot1m || !pgprot16m) {
  363. ret = -EINVAL;
  364. goto fail;
  365. }
  366. fl_offset = FL_OFFSET(va); /* Upper 12 bits */
  367. fl_pte = pt->fl_table + fl_offset; /* int pointers, 4 bytes */
  368. pa = get_phys_addr(sg);
  369. ret = check_range(pt->fl_table, va, len);
  370. if (ret)
  371. goto fail;
  372. while (offset < len) {
  373. chunk_size = SZ_4K;
  374. if (is_fully_aligned(va, pa, sg->length - chunk_offset,
  375. SZ_16M))
  376. chunk_size = SZ_16M;
  377. else if (is_fully_aligned(va, pa, sg->length - chunk_offset,
  378. SZ_1M))
  379. chunk_size = SZ_1M;
  380. /* 64k or 4k determined later */
  381. trace_iommu_map_range(va, pa, sg->length, chunk_size);
  382. /* for 1M and 16M, only first level entries are required */
  383. if (chunk_size >= SZ_1M) {
  384. if (chunk_size == SZ_16M) {
  385. ret = fl_16m(fl_pte, pa, pgprot16m);
  386. if (ret)
  387. goto fail;
  388. clean_pte(fl_pte, fl_pte + 16, pt->redirect);
  389. fl_pte += 16;
  390. } else if (chunk_size == SZ_1M) {
  391. ret = fl_1m(fl_pte, pa, pgprot1m);
  392. if (ret)
  393. goto fail;
  394. clean_pte(fl_pte, fl_pte + 1, pt->redirect);
  395. fl_pte++;
  396. }
  397. offset += chunk_size;
  398. chunk_offset += chunk_size;
  399. va += chunk_size;
  400. pa += chunk_size;
  401. if (chunk_offset >= sg->length && offset < len) {
  402. chunk_offset = 0;
  403. sg = sg_next(sg);
  404. pa = get_phys_addr(sg);
  405. }
  406. continue;
  407. }
  408. /* for 4K or 64K, make sure there is a second level table */
  409. if (*fl_pte == 0) {
  410. if (!make_second_level(pt, fl_pte)) {
  411. ret = -ENOMEM;
  412. goto fail;
  413. }
  414. }
  415. if (!(*fl_pte & FL_TYPE_TABLE)) {
  416. ret = -EBUSY;
  417. goto fail;
  418. }
  419. sl_table = __va(((*fl_pte) & FL_BASE_MASK));
  420. sl_offset = SL_OFFSET(va);
  421. /* Keep track of initial position so we
  422. * don't clean more than we have to
  423. */
  424. sl_start = sl_offset;
  425. /* Build the 2nd level page table */
  426. while (offset < len && sl_offset < NUM_SL_PTE) {
  427. /* Map a large 64K page if the chunk is large enough and
  428. * the pa and va are aligned
  429. */
  430. if (is_fully_aligned(va, pa, sg->length - chunk_offset,
  431. SZ_64K))
  432. chunk_size = SZ_64K;
  433. else
  434. chunk_size = SZ_4K;
  435. trace_iommu_map_range(va, pa, sg->length,
  436. chunk_size);
  437. if (chunk_size == SZ_4K) {
  438. sl_4k(&sl_table[sl_offset], pa, pgprot4k);
  439. sl_offset++;
  440. } else {
  441. BUG_ON(sl_offset + 16 > NUM_SL_PTE);
  442. sl_64k(&sl_table[sl_offset], pa, pgprot64k);
  443. sl_offset += 16;
  444. }
  445. offset += chunk_size;
  446. chunk_offset += chunk_size;
  447. va += chunk_size;
  448. pa += chunk_size;
  449. if (chunk_offset >= sg->length && offset < len) {
  450. chunk_offset = 0;
  451. sg = sg_next(sg);
  452. pa = get_phys_addr(sg);
  453. }
  454. }
  455. clean_pte(sl_table + sl_start, sl_table + sl_offset,
  456. pt->redirect);
  457. fl_pte++;
  458. sl_offset = 0;
  459. }
  460. fail:
  461. if (ret && offset > 0)
  462. msm_iommu_pagetable_unmap_range(pt, start_va, offset);
  463. return ret;
  464. }
  465. void msm_iommu_pagetable_unmap_range(struct msm_iommu_pt *pt, unsigned int va,
  466. unsigned int len)
  467. {
  468. unsigned int offset = 0;
  469. unsigned long *fl_pte;
  470. unsigned long fl_offset;
  471. unsigned long *sl_table;
  472. unsigned long sl_start, sl_end;
  473. int used, i;
  474. BUG_ON(len & (SZ_4K - 1));
  475. fl_offset = FL_OFFSET(va); /* Upper 12 bits */
  476. fl_pte = pt->fl_table + fl_offset; /* int pointers, 4 bytes */
  477. while (offset < len) {
  478. if (*fl_pte & FL_TYPE_TABLE) {
  479. sl_start = SL_OFFSET(va);
  480. sl_table = __va(((*fl_pte) & FL_BASE_MASK));
  481. sl_end = ((len - offset) / SZ_4K) + sl_start;
  482. if (sl_end > NUM_SL_PTE)
  483. sl_end = NUM_SL_PTE;
  484. memset(sl_table + sl_start, 0, (sl_end - sl_start) * 4);
  485. clean_pte(sl_table + sl_start, sl_table + sl_end,
  486. pt->redirect);
  487. offset += (sl_end - sl_start) * SZ_4K;
  488. va += (sl_end - sl_start) * SZ_4K;
  489. /* Unmap and free the 2nd level table if all mappings
  490. * in it were removed. This saves memory, but the table
  491. * will need to be re-allocated the next time someone
  492. * tries to map these VAs.
  493. */
  494. used = 0;
  495. /* If we just unmapped the whole table, don't bother
  496. * seeing if there are still used entries left.
  497. */
  498. if (sl_end - sl_start != NUM_SL_PTE)
  499. for (i = 0; i < NUM_SL_PTE; i++)
  500. if (sl_table[i]) {
  501. used = 1;
  502. break;
  503. }
  504. if (!used) {
  505. free_page((unsigned long)sl_table);
  506. *fl_pte = 0;
  507. clean_pte(fl_pte, fl_pte + 1, pt->redirect);
  508. }
  509. sl_start = 0;
  510. } else {
  511. *fl_pte = 0;
  512. clean_pte(fl_pte, fl_pte + 1, pt->redirect);
  513. va += SZ_1M;
  514. offset += SZ_1M;
  515. sl_start = 0;
  516. }
  517. fl_pte++;
  518. }
  519. }
  520. static int __init get_tex_class(int icp, int ocp, int mt, int nos)
  521. {
  522. int i = 0;
  523. unsigned int prrr = 0;
  524. unsigned int nmrr = 0;
  525. int c_icp, c_ocp, c_mt, c_nos;
  526. RCP15_PRRR(prrr);
  527. RCP15_NMRR(nmrr);
  528. for (i = 0; i < NUM_TEX_CLASS; i++) {
  529. c_nos = PRRR_NOS(prrr, i);
  530. c_mt = PRRR_MT(prrr, i);
  531. c_icp = NMRR_ICP(nmrr, i);
  532. c_ocp = NMRR_OCP(nmrr, i);
  533. if (icp == c_icp && ocp == c_ocp && c_mt == mt && c_nos == nos)
  534. return i;
  535. }
  536. return -ENODEV;
  537. }
  538. static void __init setup_iommu_tex_classes(void)
  539. {
  540. msm_iommu_tex_class[MSM_IOMMU_ATTR_NONCACHED] =
  541. get_tex_class(CP_NONCACHED, CP_NONCACHED, MT_NORMAL, 1);
  542. msm_iommu_tex_class[MSM_IOMMU_ATTR_CACHED_WB_WA] =
  543. get_tex_class(CP_WB_WA, CP_WB_WA, MT_NORMAL, 1);
  544. msm_iommu_tex_class[MSM_IOMMU_ATTR_CACHED_WB_NWA] =
  545. get_tex_class(CP_WB_NWA, CP_WB_NWA, MT_NORMAL, 1);
  546. msm_iommu_tex_class[MSM_IOMMU_ATTR_CACHED_WT] =
  547. get_tex_class(CP_WT, CP_WT, MT_NORMAL, 1);
  548. }
  549. void __init msm_iommu_pagetable_init(void)
  550. {
  551. setup_iommu_tex_classes();
  552. }