hashtable.S 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606
  1. /*
  2. * $Id: hashtable.S,v 1.6 1999/10/08 01:56:15 paulus Exp $
  3. *
  4. * PowerPC version
  5. * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
  6. * Rewritten by Cort Dougan (cort@cs.nmt.edu) for PReP
  7. * Copyright (C) 1996 Cort Dougan <cort@cs.nmt.edu>
  8. * Adapted for Power Macintosh by Paul Mackerras.
  9. * Low-level exception handlers and MMU support
  10. * rewritten by Paul Mackerras.
  11. * Copyright (C) 1996 Paul Mackerras.
  12. *
  13. * This file contains low-level assembler routines for managing
  14. * the PowerPC MMU hash table. (PPC 8xx processors don't use a
  15. * hash table, so this file is not used on them.)
  16. *
  17. * This program is free software; you can redistribute it and/or
  18. * modify it under the terms of the GNU General Public License
  19. * as published by the Free Software Foundation; either version
  20. * 2 of the License, or (at your option) any later version.
  21. *
  22. */
  23. #include <linux/config.h>
  24. #include <asm/processor.h>
  25. #include <asm/page.h>
  26. #include <asm/pgtable.h>
  27. #include <asm/cputable.h>
  28. #include <asm/ppc_asm.h>
  29. #include <asm/thread_info.h>
  30. #include <asm/asm-offsets.h>
  31. #ifdef CONFIG_SMP
  32. .comm mmu_hash_lock,4
  33. #endif /* CONFIG_SMP */
  34. /*
  35. * Sync CPUs with hash_page taking & releasing the hash
  36. * table lock
  37. */
  38. #ifdef CONFIG_SMP
  39. .text
  40. _GLOBAL(hash_page_sync)
  41. lis r8,mmu_hash_lock@h
  42. ori r8,r8,mmu_hash_lock@l
  43. lis r0,0x0fff
  44. b 10f
  45. 11: lwz r6,0(r8)
  46. cmpwi 0,r6,0
  47. bne 11b
  48. 10: lwarx r6,0,r8
  49. cmpwi 0,r6,0
  50. bne- 11b
  51. stwcx. r0,0,r8
  52. bne- 10b
  53. isync
  54. eieio
  55. li r0,0
  56. stw r0,0(r8)
  57. blr
  58. #endif
  59. /*
  60. * Load a PTE into the hash table, if possible.
  61. * The address is in r4, and r3 contains an access flag:
  62. * _PAGE_RW (0x400) if a write.
  63. * r9 contains the SRR1 value, from which we use the MSR_PR bit.
  64. * SPRG3 contains the physical address of the current task's thread.
  65. *
  66. * Returns to the caller if the access is illegal or there is no
  67. * mapping for the address. Otherwise it places an appropriate PTE
  68. * in the hash table and returns from the exception.
  69. * Uses r0, r3 - r8, ctr, lr.
  70. */
  71. .text
  72. _GLOBAL(hash_page)
  73. tophys(r7,0) /* gets -KERNELBASE into r7 */
  74. #ifdef CONFIG_SMP
  75. addis r8,r7,mmu_hash_lock@h
  76. ori r8,r8,mmu_hash_lock@l
  77. lis r0,0x0fff
  78. b 10f
  79. 11: lwz r6,0(r8)
  80. cmpwi 0,r6,0
  81. bne 11b
  82. 10: lwarx r6,0,r8
  83. cmpwi 0,r6,0
  84. bne- 11b
  85. stwcx. r0,0,r8
  86. bne- 10b
  87. isync
  88. #endif
  89. /* Get PTE (linux-style) and check access */
  90. lis r0,KERNELBASE@h /* check if kernel address */
  91. cmplw 0,r4,r0
  92. mfspr r8,SPRN_SPRG3 /* current task's THREAD (phys) */
  93. ori r3,r3,_PAGE_USER|_PAGE_PRESENT /* test low addresses as user */
  94. lwz r5,PGDIR(r8) /* virt page-table root */
  95. blt+ 112f /* assume user more likely */
  96. lis r5,swapper_pg_dir@ha /* if kernel address, use */
  97. addi r5,r5,swapper_pg_dir@l /* kernel page table */
  98. rlwimi r3,r9,32-12,29,29 /* MSR_PR -> _PAGE_USER */
  99. 112: add r5,r5,r7 /* convert to phys addr */
  100. rlwimi r5,r4,12,20,29 /* insert top 10 bits of address */
  101. lwz r8,0(r5) /* get pmd entry */
  102. rlwinm. r8,r8,0,0,19 /* extract address of pte page */
  103. #ifdef CONFIG_SMP
  104. beq- hash_page_out /* return if no mapping */
  105. #else
  106. /* XXX it seems like the 601 will give a machine fault on the
  107. rfi if its alignment is wrong (bottom 4 bits of address are
  108. 8 or 0xc) and we have had a not-taken conditional branch
  109. to the address following the rfi. */
  110. beqlr-
  111. #endif
  112. rlwimi r8,r4,22,20,29 /* insert next 10 bits of address */
  113. rlwinm r0,r3,32-3,24,24 /* _PAGE_RW access -> _PAGE_DIRTY */
  114. ori r0,r0,_PAGE_ACCESSED|_PAGE_HASHPTE
  115. /*
  116. * Update the linux PTE atomically. We do the lwarx up-front
  117. * because almost always, there won't be a permission violation
  118. * and there won't already be an HPTE, and thus we will have
  119. * to update the PTE to set _PAGE_HASHPTE. -- paulus.
  120. */
  121. retry:
  122. lwarx r6,0,r8 /* get linux-style pte */
  123. andc. r5,r3,r6 /* check access & ~permission */
  124. #ifdef CONFIG_SMP
  125. bne- hash_page_out /* return if access not permitted */
  126. #else
  127. bnelr-
  128. #endif
  129. or r5,r0,r6 /* set accessed/dirty bits */
  130. stwcx. r5,0,r8 /* attempt to update PTE */
  131. bne- retry /* retry if someone got there first */
  132. mfsrin r3,r4 /* get segment reg for segment */
  133. mfctr r0
  134. stw r0,_CTR(r11)
  135. bl create_hpte /* add the hash table entry */
  136. /*
  137. * htab_reloads counts the number of times we have to fault an
  138. * HPTE into the hash table. This should only happen after a
  139. * fork (because fork does a flush_tlb_mm) or a vmalloc or ioremap.
  140. * Where a page is faulted into a process's address space,
  141. * update_mmu_cache gets called to put the HPTE into the hash table
  142. * and those are counted as preloads rather than reloads.
  143. */
  144. addis r8,r7,htab_reloads@ha
  145. lwz r3,htab_reloads@l(r8)
  146. addi r3,r3,1
  147. stw r3,htab_reloads@l(r8)
  148. #ifdef CONFIG_SMP
  149. eieio
  150. addis r8,r7,mmu_hash_lock@ha
  151. li r0,0
  152. stw r0,mmu_hash_lock@l(r8)
  153. #endif
  154. /* Return from the exception */
  155. lwz r5,_CTR(r11)
  156. mtctr r5
  157. lwz r0,GPR0(r11)
  158. lwz r7,GPR7(r11)
  159. lwz r8,GPR8(r11)
  160. b fast_exception_return
  161. #ifdef CONFIG_SMP
  162. hash_page_out:
  163. eieio
  164. addis r8,r7,mmu_hash_lock@ha
  165. li r0,0
  166. stw r0,mmu_hash_lock@l(r8)
  167. blr
  168. #endif /* CONFIG_SMP */
  169. /*
  170. * Add an entry for a particular page to the hash table.
  171. *
  172. * add_hash_page(unsigned context, unsigned long va, unsigned long pmdval)
  173. *
  174. * We assume any necessary modifications to the pte (e.g. setting
  175. * the accessed bit) have already been done and that there is actually
  176. * a hash table in use (i.e. we're not on a 603).
  177. */
  178. _GLOBAL(add_hash_page)
  179. mflr r0
  180. stw r0,4(r1)
  181. /* Convert context and va to VSID */
  182. mulli r3,r3,897*16 /* multiply context by context skew */
  183. rlwinm r0,r4,4,28,31 /* get ESID (top 4 bits of va) */
  184. mulli r0,r0,0x111 /* multiply by ESID skew */
  185. add r3,r3,r0 /* note create_hpte trims to 24 bits */
  186. #ifdef CONFIG_SMP
  187. rlwinm r8,r1,0,0,18 /* use cpu number to make tag */
  188. lwz r8,TI_CPU(r8) /* to go in mmu_hash_lock */
  189. oris r8,r8,12
  190. #endif /* CONFIG_SMP */
  191. /*
  192. * We disable interrupts here, even on UP, because we don't
  193. * want to race with hash_page, and because we want the
  194. * _PAGE_HASHPTE bit to be a reliable indication of whether
  195. * the HPTE exists (or at least whether one did once).
  196. * We also turn off the MMU for data accesses so that we
  197. * we can't take a hash table miss (assuming the code is
  198. * covered by a BAT). -- paulus
  199. */
  200. mfmsr r10
  201. SYNC
  202. rlwinm r0,r10,0,17,15 /* clear bit 16 (MSR_EE) */
  203. rlwinm r0,r0,0,28,26 /* clear MSR_DR */
  204. mtmsr r0
  205. SYNC_601
  206. isync
  207. tophys(r7,0)
  208. #ifdef CONFIG_SMP
  209. addis r9,r7,mmu_hash_lock@ha
  210. addi r9,r9,mmu_hash_lock@l
  211. 10: lwarx r0,0,r9 /* take the mmu_hash_lock */
  212. cmpi 0,r0,0
  213. bne- 11f
  214. stwcx. r8,0,r9
  215. beq+ 12f
  216. 11: lwz r0,0(r9)
  217. cmpi 0,r0,0
  218. beq 10b
  219. b 11b
  220. 12: isync
  221. #endif
  222. /*
  223. * Fetch the linux pte and test and set _PAGE_HASHPTE atomically.
  224. * If _PAGE_HASHPTE was already set, we don't replace the existing
  225. * HPTE, so we just unlock and return.
  226. */
  227. mr r8,r5
  228. rlwimi r8,r4,22,20,29
  229. 1: lwarx r6,0,r8
  230. andi. r0,r6,_PAGE_HASHPTE
  231. bne 9f /* if HASHPTE already set, done */
  232. ori r5,r6,_PAGE_HASHPTE
  233. stwcx. r5,0,r8
  234. bne- 1b
  235. bl create_hpte
  236. addis r8,r7,htab_preloads@ha
  237. lwz r3,htab_preloads@l(r8)
  238. addi r3,r3,1
  239. stw r3,htab_preloads@l(r8)
  240. 9:
  241. #ifdef CONFIG_SMP
  242. eieio
  243. li r0,0
  244. stw r0,0(r9) /* clear mmu_hash_lock */
  245. #endif
  246. /* reenable interrupts and DR */
  247. mtmsr r10
  248. SYNC_601
  249. isync
  250. lwz r0,4(r1)
  251. mtlr r0
  252. blr
  253. /*
  254. * This routine adds a hardware PTE to the hash table.
  255. * It is designed to be called with the MMU either on or off.
  256. * r3 contains the VSID, r4 contains the virtual address,
  257. * r5 contains the linux PTE, r6 contains the old value of the
  258. * linux PTE (before setting _PAGE_HASHPTE) and r7 contains the
  259. * offset to be added to addresses (0 if the MMU is on,
  260. * -KERNELBASE if it is off).
  261. * On SMP, the caller should have the mmu_hash_lock held.
  262. * We assume that the caller has (or will) set the _PAGE_HASHPTE
  263. * bit in the linux PTE in memory. The value passed in r6 should
  264. * be the old linux PTE value; if it doesn't have _PAGE_HASHPTE set
  265. * this routine will skip the search for an existing HPTE.
  266. * This procedure modifies r0, r3 - r6, r8, cr0.
  267. * -- paulus.
  268. *
  269. * For speed, 4 of the instructions get patched once the size and
  270. * physical address of the hash table are known. These definitions
  271. * of Hash_base and Hash_bits below are just an example.
  272. */
  273. Hash_base = 0xc0180000
  274. Hash_bits = 12 /* e.g. 256kB hash table */
  275. Hash_msk = (((1 << Hash_bits) - 1) * 64)
  276. /* defines for the PTE format for 32-bit PPCs */
  277. #define PTE_SIZE 8
  278. #define PTEG_SIZE 64
  279. #define LG_PTEG_SIZE 6
  280. #define LDPTEu lwzu
  281. #define STPTE stw
  282. #define CMPPTE cmpw
  283. #define PTE_H 0x40
  284. #define PTE_V 0x80000000
  285. #define TST_V(r) rlwinm. r,r,0,0,0
  286. #define SET_V(r) oris r,r,PTE_V@h
  287. #define CLR_V(r,t) rlwinm r,r,0,1,31
  288. #define HASH_LEFT 31-(LG_PTEG_SIZE+Hash_bits-1)
  289. #define HASH_RIGHT 31-LG_PTEG_SIZE
  290. _GLOBAL(create_hpte)
  291. /* Convert linux-style PTE (r5) to low word of PPC-style PTE (r8) */
  292. rlwinm r8,r5,32-10,31,31 /* _PAGE_RW -> PP lsb */
  293. rlwinm r0,r5,32-7,31,31 /* _PAGE_DIRTY -> PP lsb */
  294. and r8,r8,r0 /* writable if _RW & _DIRTY */
  295. rlwimi r5,r5,32-1,30,30 /* _PAGE_USER -> PP msb */
  296. rlwimi r5,r5,32-2,31,31 /* _PAGE_USER -> PP lsb */
  297. ori r8,r8,0xe14 /* clear out reserved bits and M */
  298. andc r8,r5,r8 /* PP = user? (rw&dirty? 2: 3): 0 */
  299. BEGIN_FTR_SECTION
  300. ori r8,r8,_PAGE_COHERENT /* set M (coherence required) */
  301. END_FTR_SECTION_IFSET(CPU_FTR_NEED_COHERENT)
  302. /* Construct the high word of the PPC-style PTE (r5) */
  303. rlwinm r5,r3,7,1,24 /* put VSID in 0x7fffff80 bits */
  304. rlwimi r5,r4,10,26,31 /* put in API (abbrev page index) */
  305. SET_V(r5) /* set V (valid) bit */
  306. /* Get the address of the primary PTE group in the hash table (r3) */
  307. _GLOBAL(hash_page_patch_A)
  308. addis r0,r7,Hash_base@h /* base address of hash table */
  309. rlwimi r0,r3,LG_PTEG_SIZE,HASH_LEFT,HASH_RIGHT /* VSID -> hash */
  310. rlwinm r3,r4,20+LG_PTEG_SIZE,HASH_LEFT,HASH_RIGHT /* PI -> hash */
  311. xor r3,r3,r0 /* make primary hash */
  312. li r0,8 /* PTEs/group */
  313. /*
  314. * Test the _PAGE_HASHPTE bit in the old linux PTE, and skip the search
  315. * if it is clear, meaning that the HPTE isn't there already...
  316. */
  317. andi. r6,r6,_PAGE_HASHPTE
  318. beq+ 10f /* no PTE: go look for an empty slot */
  319. tlbie r4
  320. addis r4,r7,htab_hash_searches@ha
  321. lwz r6,htab_hash_searches@l(r4)
  322. addi r6,r6,1 /* count how many searches we do */
  323. stw r6,htab_hash_searches@l(r4)
  324. /* Search the primary PTEG for a PTE whose 1st (d)word matches r5 */
  325. mtctr r0
  326. addi r4,r3,-PTE_SIZE
  327. 1: LDPTEu r6,PTE_SIZE(r4) /* get next PTE */
  328. CMPPTE 0,r6,r5
  329. bdnzf 2,1b /* loop while ctr != 0 && !cr0.eq */
  330. beq+ found_slot
  331. /* Search the secondary PTEG for a matching PTE */
  332. ori r5,r5,PTE_H /* set H (secondary hash) bit */
  333. _GLOBAL(hash_page_patch_B)
  334. xoris r4,r3,Hash_msk>>16 /* compute secondary hash */
  335. xori r4,r4,(-PTEG_SIZE & 0xffff)
  336. addi r4,r4,-PTE_SIZE
  337. mtctr r0
  338. 2: LDPTEu r6,PTE_SIZE(r4)
  339. CMPPTE 0,r6,r5
  340. bdnzf 2,2b
  341. beq+ found_slot
  342. xori r5,r5,PTE_H /* clear H bit again */
  343. /* Search the primary PTEG for an empty slot */
  344. 10: mtctr r0
  345. addi r4,r3,-PTE_SIZE /* search primary PTEG */
  346. 1: LDPTEu r6,PTE_SIZE(r4) /* get next PTE */
  347. TST_V(r6) /* test valid bit */
  348. bdnzf 2,1b /* loop while ctr != 0 && !cr0.eq */
  349. beq+ found_empty
  350. /* update counter of times that the primary PTEG is full */
  351. addis r4,r7,primary_pteg_full@ha
  352. lwz r6,primary_pteg_full@l(r4)
  353. addi r6,r6,1
  354. stw r6,primary_pteg_full@l(r4)
  355. /* Search the secondary PTEG for an empty slot */
  356. ori r5,r5,PTE_H /* set H (secondary hash) bit */
  357. _GLOBAL(hash_page_patch_C)
  358. xoris r4,r3,Hash_msk>>16 /* compute secondary hash */
  359. xori r4,r4,(-PTEG_SIZE & 0xffff)
  360. addi r4,r4,-PTE_SIZE
  361. mtctr r0
  362. 2: LDPTEu r6,PTE_SIZE(r4)
  363. TST_V(r6)
  364. bdnzf 2,2b
  365. beq+ found_empty
  366. xori r5,r5,PTE_H /* clear H bit again */
  367. /*
  368. * Choose an arbitrary slot in the primary PTEG to overwrite.
  369. * Since both the primary and secondary PTEGs are full, and we
  370. * have no information that the PTEs in the primary PTEG are
  371. * more important or useful than those in the secondary PTEG,
  372. * and we know there is a definite (although small) speed
  373. * advantage to putting the PTE in the primary PTEG, we always
  374. * put the PTE in the primary PTEG.
  375. */
  376. addis r4,r7,next_slot@ha
  377. lwz r6,next_slot@l(r4)
  378. addi r6,r6,PTE_SIZE
  379. andi. r6,r6,7*PTE_SIZE
  380. stw r6,next_slot@l(r4)
  381. add r4,r3,r6
  382. /* update counter of evicted pages */
  383. addis r6,r7,htab_evicts@ha
  384. lwz r3,htab_evicts@l(r6)
  385. addi r3,r3,1
  386. stw r3,htab_evicts@l(r6)
  387. #ifndef CONFIG_SMP
  388. /* Store PTE in PTEG */
  389. found_empty:
  390. STPTE r5,0(r4)
  391. found_slot:
  392. STPTE r8,PTE_SIZE/2(r4)
  393. #else /* CONFIG_SMP */
  394. /*
  395. * Between the tlbie above and updating the hash table entry below,
  396. * another CPU could read the hash table entry and put it in its TLB.
  397. * There are 3 cases:
  398. * 1. using an empty slot
  399. * 2. updating an earlier entry to change permissions (i.e. enable write)
  400. * 3. taking over the PTE for an unrelated address
  401. *
  402. * In each case it doesn't really matter if the other CPUs have the old
  403. * PTE in their TLB. So we don't need to bother with another tlbie here,
  404. * which is convenient as we've overwritten the register that had the
  405. * address. :-) The tlbie above is mainly to make sure that this CPU comes
  406. * and gets the new PTE from the hash table.
  407. *
  408. * We do however have to make sure that the PTE is never in an invalid
  409. * state with the V bit set.
  410. */
  411. found_empty:
  412. found_slot:
  413. CLR_V(r5,r0) /* clear V (valid) bit in PTE */
  414. STPTE r5,0(r4)
  415. sync
  416. TLBSYNC
  417. STPTE r8,PTE_SIZE/2(r4) /* put in correct RPN, WIMG, PP bits */
  418. sync
  419. SET_V(r5)
  420. STPTE r5,0(r4) /* finally set V bit in PTE */
  421. #endif /* CONFIG_SMP */
  422. sync /* make sure pte updates get to memory */
  423. blr
  424. .comm next_slot,4
  425. .comm primary_pteg_full,4
  426. .comm htab_hash_searches,4
  427. /*
  428. * Flush the entry for a particular page from the hash table.
  429. *
  430. * flush_hash_pages(unsigned context, unsigned long va, unsigned long pmdval,
  431. * int count)
  432. *
  433. * We assume that there is a hash table in use (Hash != 0).
  434. */
  435. _GLOBAL(flush_hash_pages)
  436. tophys(r7,0)
  437. /*
  438. * We disable interrupts here, even on UP, because we want
  439. * the _PAGE_HASHPTE bit to be a reliable indication of
  440. * whether the HPTE exists (or at least whether one did once).
  441. * We also turn off the MMU for data accesses so that we
  442. * we can't take a hash table miss (assuming the code is
  443. * covered by a BAT). -- paulus
  444. */
  445. mfmsr r10
  446. SYNC
  447. rlwinm r0,r10,0,17,15 /* clear bit 16 (MSR_EE) */
  448. rlwinm r0,r0,0,28,26 /* clear MSR_DR */
  449. mtmsr r0
  450. SYNC_601
  451. isync
  452. /* First find a PTE in the range that has _PAGE_HASHPTE set */
  453. rlwimi r5,r4,22,20,29
  454. 1: lwz r0,0(r5)
  455. cmpwi cr1,r6,1
  456. andi. r0,r0,_PAGE_HASHPTE
  457. bne 2f
  458. ble cr1,19f
  459. addi r4,r4,0x1000
  460. addi r5,r5,4
  461. addi r6,r6,-1
  462. b 1b
  463. /* Convert context and va to VSID */
  464. 2: mulli r3,r3,897*16 /* multiply context by context skew */
  465. rlwinm r0,r4,4,28,31 /* get ESID (top 4 bits of va) */
  466. mulli r0,r0,0x111 /* multiply by ESID skew */
  467. add r3,r3,r0 /* note code below trims to 24 bits */
  468. /* Construct the high word of the PPC-style PTE (r11) */
  469. rlwinm r11,r3,7,1,24 /* put VSID in 0x7fffff80 bits */
  470. rlwimi r11,r4,10,26,31 /* put in API (abbrev page index) */
  471. SET_V(r11) /* set V (valid) bit */
  472. #ifdef CONFIG_SMP
  473. addis r9,r7,mmu_hash_lock@ha
  474. addi r9,r9,mmu_hash_lock@l
  475. rlwinm r8,r1,0,0,18
  476. add r8,r8,r7
  477. lwz r8,TI_CPU(r8)
  478. oris r8,r8,9
  479. 10: lwarx r0,0,r9
  480. cmpi 0,r0,0
  481. bne- 11f
  482. stwcx. r8,0,r9
  483. beq+ 12f
  484. 11: lwz r0,0(r9)
  485. cmpi 0,r0,0
  486. beq 10b
  487. b 11b
  488. 12: isync
  489. #endif
  490. /*
  491. * Check the _PAGE_HASHPTE bit in the linux PTE. If it is
  492. * already clear, we're done (for this pte). If not,
  493. * clear it (atomically) and proceed. -- paulus.
  494. */
  495. 33: lwarx r8,0,r5 /* fetch the pte */
  496. andi. r0,r8,_PAGE_HASHPTE
  497. beq 8f /* done if HASHPTE is already clear */
  498. rlwinm r8,r8,0,31,29 /* clear HASHPTE bit */
  499. stwcx. r8,0,r5 /* update the pte */
  500. bne- 33b
  501. /* Get the address of the primary PTE group in the hash table (r3) */
  502. _GLOBAL(flush_hash_patch_A)
  503. addis r8,r7,Hash_base@h /* base address of hash table */
  504. rlwimi r8,r3,LG_PTEG_SIZE,HASH_LEFT,HASH_RIGHT /* VSID -> hash */
  505. rlwinm r0,r4,20+LG_PTEG_SIZE,HASH_LEFT,HASH_RIGHT /* PI -> hash */
  506. xor r8,r0,r8 /* make primary hash */
  507. /* Search the primary PTEG for a PTE whose 1st (d)word matches r5 */
  508. li r0,8 /* PTEs/group */
  509. mtctr r0
  510. addi r12,r8,-PTE_SIZE
  511. 1: LDPTEu r0,PTE_SIZE(r12) /* get next PTE */
  512. CMPPTE 0,r0,r11
  513. bdnzf 2,1b /* loop while ctr != 0 && !cr0.eq */
  514. beq+ 3f
  515. /* Search the secondary PTEG for a matching PTE */
  516. ori r11,r11,PTE_H /* set H (secondary hash) bit */
  517. li r0,8 /* PTEs/group */
  518. _GLOBAL(flush_hash_patch_B)
  519. xoris r12,r8,Hash_msk>>16 /* compute secondary hash */
  520. xori r12,r12,(-PTEG_SIZE & 0xffff)
  521. addi r12,r12,-PTE_SIZE
  522. mtctr r0
  523. 2: LDPTEu r0,PTE_SIZE(r12)
  524. CMPPTE 0,r0,r11
  525. bdnzf 2,2b
  526. xori r11,r11,PTE_H /* clear H again */
  527. bne- 4f /* should rarely fail to find it */
  528. 3: li r0,0
  529. STPTE r0,0(r12) /* invalidate entry */
  530. 4: sync
  531. tlbie r4 /* in hw tlb too */
  532. sync
  533. 8: ble cr1,9f /* if all ptes checked */
  534. 81: addi r6,r6,-1
  535. addi r5,r5,4 /* advance to next pte */
  536. addi r4,r4,0x1000
  537. lwz r0,0(r5) /* check next pte */
  538. cmpwi cr1,r6,1
  539. andi. r0,r0,_PAGE_HASHPTE
  540. bne 33b
  541. bgt cr1,81b
  542. 9:
  543. #ifdef CONFIG_SMP
  544. TLBSYNC
  545. li r0,0
  546. stw r0,0(r9) /* clear mmu_hash_lock */
  547. #endif
  548. 19: mtmsr r10
  549. SYNC_601
  550. isync
  551. blr