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