2 * Copyright (c) 1982, 1986 The Regents of the University of California.
3 * Copyright (c) 1989, 1990 William Jolitz
4 * Copyright (c) 1994 John Dyson
7 * This code is derived from software contributed to Berkeley by
8 * the Systems Programming Group of the University of Utah Computer
9 * Science Department, and William Jolitz.
11 * Redistribution and use in source and binary :forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * from: @(#)vm_machdep.c 7.3 (Berkeley) 5/13/91
40 * Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/kernel.h>
49 #include <sys/malloc.h>
52 #include <sys/socketvar.h>
53 #include <sys/sf_buf.h>
54 #include <sys/unistd.h>
55 #include <machine/cpu.h>
56 #include <machine/pcb.h>
57 #include <machine/sysarch.h>
59 #include <sys/mutex.h>
63 #include <vm/vm_extern.h>
64 #include <vm/vm_kern.h>
65 #include <vm/vm_page.h>
66 #include <vm/vm_map.h>
67 #include <vm/vm_param.h>
68 #include <vm/vm_pageout.h>
70 #include <vm/uma_int.h>
72 #include <machine/md_var.h>
75 #define NSFBUFS (512 + maxusers * 16)
78 #ifndef ARM_USE_SMALL_ALLOC
79 static void sf_buf_init(void *arg);
80 SYSINIT(sock_sf, SI_SUB_MBUF, SI_ORDER_ANY, sf_buf_init, NULL);
82 LIST_HEAD(sf_head, sf_buf);
86 * A hash table of active sendfile(2) buffers
88 static struct sf_head *sf_buf_active;
89 static u_long sf_buf_hashmask;
91 #define SF_BUF_HASH(m) (((m) - vm_page_array) & sf_buf_hashmask)
93 static TAILQ_HEAD(, sf_buf) sf_buf_freelist;
94 static u_int sf_buf_alloc_want;
97 * A lock used to synchronize access to the hash table and free list
99 static struct mtx sf_buf_lock;
103 * Finish a fork operation, with process p2 nearly set up.
104 * Copy and update the pcb, set up the stack so that the child
105 * ready to run and return to user mode.
108 cpu_fork(register struct thread *td1, register struct proc *p2,
109 struct thread *td2, int flags)
112 struct trapframe *tf;
113 struct switchframe *sf;
116 if ((flags & RFPROC) == 0)
118 pcb2 = (struct pcb *)(td2->td_kstack + td2->td_kstack_pages * PAGE_SIZE) - 1;
120 #ifndef CPU_XSCALE_CORE3
121 pmap_use_minicache(td2->td_kstack, td2->td_kstack_pages * PAGE_SIZE);
122 if (td2->td_altkstack)
123 pmap_use_minicache(td2->td_altkstack, td2->td_altkstack_pages *
128 bcopy(td1->td_pcb, pcb2, sizeof(*pcb2));
130 bcopy(&td1->td_proc->p_md, mdp2, sizeof(*mdp2));
131 pcb2->un_32.pcb32_und_sp = td2->td_kstack + USPACE_UNDEF_STACK_TOP;
132 pcb2->un_32.pcb32_sp = td2->td_kstack +
133 USPACE_SVC_STACK_TOP - sizeof(*pcb2);
136 (struct trapframe *)pcb2->un_32.pcb32_sp - 1;
137 *tf = *td1->td_frame;
138 sf = (struct switchframe *)tf - 1;
139 sf->sf_r4 = (u_int)fork_return;
140 sf->sf_r5 = (u_int)td2;
141 sf->sf_pc = (u_int)fork_trampoline;
142 tf->tf_spsr &= ~PSR_C_bit;
145 pcb2->un_32.pcb32_sp = (u_int)sf;
147 /* Setup to release spin count in fork_exit(). */
148 td2->td_md.md_spinlock_count = 1;
149 td2->td_md.md_saved_cspr = 0;
150 td2->td_md.md_tp = *(uint32_t **)ARM_TP_ADDRESS;
154 cpu_thread_swapin(struct thread *td)
159 cpu_thread_swapout(struct thread *td)
164 * Detatch mapped page and release resources back to the system.
167 sf_buf_free(struct sf_buf *sf)
169 #ifndef ARM_USE_SMALL_ALLOC
170 mtx_lock(&sf_buf_lock);
172 if (sf->ref_count == 0) {
173 TAILQ_INSERT_TAIL(&sf_buf_freelist, sf, free_entry);
175 if (sf_buf_alloc_want > 0)
176 wakeup_one(&sf_buf_freelist);
178 mtx_unlock(&sf_buf_lock);
182 #ifndef ARM_USE_SMALL_ALLOC
184 * Allocate a pool of sf_bufs (sendfile(2) or "super-fast" if you prefer. :-))
187 sf_buf_init(void *arg)
189 struct sf_buf *sf_bufs;
194 TUNABLE_INT_FETCH("kern.ipc.nsfbufs", &nsfbufs);
196 sf_buf_active = hashinit(nsfbufs, M_TEMP, &sf_buf_hashmask);
197 TAILQ_INIT(&sf_buf_freelist);
198 sf_base = kmem_alloc_nofault(kernel_map, nsfbufs * PAGE_SIZE);
199 sf_bufs = malloc(nsfbufs * sizeof(struct sf_buf), M_TEMP,
201 for (i = 0; i < nsfbufs; i++) {
202 sf_bufs[i].kva = sf_base + i * PAGE_SIZE;
203 TAILQ_INSERT_TAIL(&sf_buf_freelist, &sf_bufs[i], free_entry);
205 sf_buf_alloc_want = 0;
206 mtx_init(&sf_buf_lock, "sf_buf", NULL, MTX_DEF);
211 * Get an sf_buf from the freelist. Will block if none are available.
214 sf_buf_alloc(struct vm_page *m, int flags)
216 #ifdef ARM_USE_SMALL_ALLOC
217 return ((struct sf_buf *)m);
219 struct sf_head *hash_list;
223 hash_list = &sf_buf_active[SF_BUF_HASH(m)];
224 mtx_lock(&sf_buf_lock);
225 LIST_FOREACH(sf, hash_list, list_entry) {
228 if (sf->ref_count == 1) {
229 TAILQ_REMOVE(&sf_buf_freelist, sf, free_entry);
231 nsfbufspeak = imax(nsfbufspeak, nsfbufsused);
236 while ((sf = TAILQ_FIRST(&sf_buf_freelist)) == NULL) {
237 if (flags & SFB_NOWAIT)
240 mbstat.sf_allocwait++;
241 error = msleep(&sf_buf_freelist, &sf_buf_lock,
242 (flags & SFB_CATCH) ? PCATCH | PVM : PVM, "sfbufa", 0);
247 * If we got a signal, don't risk going back to sleep.
252 TAILQ_REMOVE(&sf_buf_freelist, sf, free_entry);
254 LIST_REMOVE(sf, list_entry);
255 LIST_INSERT_HEAD(hash_list, sf, list_entry);
259 nsfbufspeak = imax(nsfbufspeak, nsfbufsused);
260 pmap_kenter(sf->kva, VM_PAGE_TO_PHYS(sf->m));
262 mtx_unlock(&sf_buf_lock);
268 * Initialize machine state (pcb and trap frame) for a new thread about to
269 * upcall. Put enough state in the new thread's PCB to get it to go back
270 * userret(), where we can intercept it again to set the return (upcall)
271 * Address and stack, along with those from upcals that are from other sources
272 * such as those generated in thread_userret() itself.
275 cpu_set_upcall(struct thread *td, struct thread *td0)
277 struct trapframe *tf;
278 struct switchframe *sf;
280 bcopy(td0->td_frame, td->td_frame, sizeof(struct trapframe));
281 bcopy(td0->td_pcb, td->td_pcb, sizeof(struct pcb));
283 sf = (struct switchframe *)tf - 1;
284 sf->sf_r4 = (u_int)fork_return;
285 sf->sf_r5 = (u_int)td;
286 sf->sf_pc = (u_int)fork_trampoline;
287 tf->tf_spsr &= ~PSR_C_bit;
289 td->td_pcb->un_32.pcb32_sp = (u_int)sf;
290 td->td_pcb->un_32.pcb32_und_sp = td->td_kstack + USPACE_UNDEF_STACK_TOP;
292 /* Setup to release spin count in fork_exit(). */
293 td->td_md.md_spinlock_count = 1;
294 td->td_md.md_saved_cspr = 0;
298 * Set that machine state for performing an upcall that has to
299 * be done in thread_userret() so that those upcalls generated
300 * in thread_userret() itself can be done as well.
303 cpu_set_upcall_kse(struct thread *td, void (*entry)(void *), void *arg,
306 struct trapframe *tf = td->td_frame;
308 tf->tf_usr_sp = ((int)stack->ss_sp + stack->ss_size
309 - sizeof(struct trapframe)) & ~7;
310 tf->tf_pc = (int)entry;
311 tf->tf_r0 = (int)arg;
312 tf->tf_spsr = PSR_USR32_MODE;
316 cpu_set_user_tls(struct thread *td, void *tls_base)
320 td->td_md.md_tp = tls_base;
323 *(void **)ARM_TP_ADDRESS = tls_base;
330 cpu_thread_exit(struct thread *td)
335 cpu_thread_alloc(struct thread *td)
337 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_pages *
339 td->td_frame = (struct trapframe *)
340 ((u_int)td->td_kstack + USPACE_SVC_STACK_TOP - sizeof(struct pcb)) - 1;
342 #ifndef CPU_XSCALE_CORE3
343 pmap_use_minicache(td->td_kstack, td->td_kstack_pages * PAGE_SIZE);
349 cpu_thread_free(struct thread *td)
354 cpu_thread_clean(struct thread *td)
359 * Intercept the return address from a freshly forked process that has NOT
360 * been scheduled yet.
362 * This is needed to make kernel threads stay in kernel mode.
365 cpu_set_fork_handler(struct thread *td, void (*func)(void *), void *arg)
367 struct switchframe *sf;
368 struct trapframe *tf;
371 sf = (struct switchframe *)tf - 1;
372 sf->sf_r4 = (u_int)func;
373 sf->sf_r5 = (u_int)arg;
374 td->td_pcb->un_32.pcb32_sp = (u_int)sf;
378 * Software interrupt handler for queued VM system processing.
384 if (busdma_swi_pending)
389 cpu_exit(struct thread *td)
393 #define BITS_PER_INT (8 * sizeof(int))
394 vm_offset_t arm_nocache_startaddr;
395 static int arm_nocache_allocated[ARM_NOCACHE_KVA_SIZE / (PAGE_SIZE *
399 * Functions to map and unmap memory non-cached into KVA the kernel won't try
400 * to allocate. The goal is to provide uncached memory to busdma, to honor
402 * We can allocate at most ARM_NOCACHE_KVA_SIZE bytes.
403 * The allocator is rather dummy, each page is represented by a bit in
404 * a bitfield, 0 meaning the page is not allocated, 1 meaning it is.
405 * As soon as it finds enough contiguous pages to satisfy the request,
406 * it returns the address.
409 arm_remap_nocache(void *addr, vm_size_t size)
413 size = round_page(size);
414 for (i = 0; i < ARM_NOCACHE_KVA_SIZE / PAGE_SIZE; i++) {
415 if (!(arm_nocache_allocated[i / BITS_PER_INT] & (1 << (i %
417 for (j = i; j < i + (size / (PAGE_SIZE)); j++)
418 if (arm_nocache_allocated[j / BITS_PER_INT] &
419 (1 << (j % BITS_PER_INT)))
421 if (j == i + (size / (PAGE_SIZE)))
425 if (i < ARM_NOCACHE_KVA_SIZE / PAGE_SIZE) {
426 vm_offset_t tomap = arm_nocache_startaddr + i * PAGE_SIZE;
427 void *ret = (void *)tomap;
428 vm_paddr_t physaddr = vtophys((vm_offset_t)addr);
429 vm_offset_t vaddr = (vm_offset_t) addr;
431 vaddr = vaddr & ~PAGE_MASK;
432 for (; tomap < (vm_offset_t)ret + size; tomap += PAGE_SIZE,
433 vaddr += PAGE_SIZE, physaddr += PAGE_SIZE, i++) {
434 cpu_idcache_wbinv_range(vaddr, PAGE_SIZE);
435 cpu_l2cache_wbinv_range(vaddr, PAGE_SIZE);
436 pmap_kenter_nocache(tomap, physaddr);
437 cpu_tlb_flushID_SE(vaddr);
438 arm_nocache_allocated[i / BITS_PER_INT] |= 1 << (i %
448 arm_unmap_nocache(void *addr, vm_size_t size)
450 vm_offset_t raddr = (vm_offset_t)addr;
453 size = round_page(size);
454 i = (raddr - arm_nocache_startaddr) / (PAGE_SIZE);
455 for (; size > 0; size -= PAGE_SIZE, i++)
456 arm_nocache_allocated[i / BITS_PER_INT] &= ~(1 << (i %
460 #ifdef ARM_USE_SMALL_ALLOC
462 static TAILQ_HEAD(,arm_small_page) pages_normal =
463 TAILQ_HEAD_INITIALIZER(pages_normal);
464 static TAILQ_HEAD(,arm_small_page) pages_wt =
465 TAILQ_HEAD_INITIALIZER(pages_wt);
466 static TAILQ_HEAD(,arm_small_page) free_pgdesc =
467 TAILQ_HEAD_INITIALIZER(free_pgdesc);
469 extern uma_zone_t l2zone;
471 struct mtx smallalloc_mtx;
473 MALLOC_DEFINE(M_VMSMALLALLOC, "vm_small_alloc", "VM Small alloc data");
475 vm_offset_t alloc_firstaddr;
477 #ifdef ARM_HAVE_SUPERSECTIONS
478 #define S_FRAME L1_SUP_FRAME
479 #define S_SIZE L1_SUP_SIZE
481 #define S_FRAME L1_S_FRAME
482 #define S_SIZE L1_S_SIZE
486 arm_ptovirt(vm_paddr_t pa)
489 vm_offset_t addr = alloc_firstaddr;
491 KASSERT(alloc_firstaddr != 0, ("arm_ptovirt called too early ?"));
492 for (i = 0; dump_avail[i + 1]; i += 2) {
493 if (pa >= dump_avail[i] && pa < dump_avail[i + 1])
495 addr += (dump_avail[i + 1] & S_FRAME) + S_SIZE -
496 (dump_avail[i] & S_FRAME);
498 KASSERT(dump_avail[i + 1] != 0, ("Trying to access invalid physical address"));
499 return (addr + (pa - (dump_avail[i] & S_FRAME)));
503 arm_init_smallalloc(void)
505 vm_offset_t to_map = 0, mapaddr;
509 * We need to use dump_avail and not phys_avail, since we want to
510 * map the whole memory and not just the memory available to the VM
511 * to be able to do a pa => va association for any address.
514 for (i = 0; dump_avail[i + 1]; i+= 2) {
515 to_map += (dump_avail[i + 1] & S_FRAME) + S_SIZE -
516 (dump_avail[i] & S_FRAME);
518 alloc_firstaddr = mapaddr = KERNBASE - to_map;
519 for (i = 0; dump_avail[i + 1]; i+= 2) {
520 vm_offset_t size = (dump_avail[i + 1] & S_FRAME) +
521 S_SIZE - (dump_avail[i] & S_FRAME);
524 #ifdef ARM_HAVE_SUPERSECTIONS
525 pmap_kenter_supersection(mapaddr,
526 (dump_avail[i] & L1_SUP_FRAME) + did,
529 pmap_kenter_section(mapaddr,
530 (dump_avail[i] & L1_S_FRAME) + did, SECTION_CACHE);
540 arm_add_smallalloc_pages(void *list, void *mem, int bytes, int pagetable)
542 struct arm_small_page *pg;
546 pg = (struct arm_small_page *)list;
549 TAILQ_INSERT_HEAD(&pages_wt, pg, pg_list);
551 TAILQ_INSERT_HEAD(&pages_normal, pg, pg_list);
552 list = (char *)list + sizeof(*pg);
553 mem = (char *)mem + PAGE_SIZE;
559 uma_small_alloc(uma_zone_t zone, int bytes, u_int8_t *flags, int wait)
562 struct arm_small_page *sp;
563 TAILQ_HEAD(,arm_small_page) *head;
564 static vm_pindex_t color;
567 *flags = UMA_SLAB_PRIV;
569 * For CPUs where we setup page tables as write back, there's no
570 * need to maintain two separate pools.
572 if (zone == l2zone && pte_l1_s_cache_mode != pte_l1_s_cache_mode_pt)
573 head = (void *)&pages_wt;
575 head = (void *)&pages_normal;
577 mtx_lock(&smallalloc_mtx);
578 sp = TAILQ_FIRST(head);
583 mtx_unlock(&smallalloc_mtx);
584 if (zone == l2zone &&
585 pte_l1_s_cache_mode != pte_l1_s_cache_mode_pt) {
586 *flags = UMA_SLAB_KMEM;
587 ret = ((void *)kmem_malloc(kmem_map, bytes, M_NOWAIT));
590 if ((wait & (M_NOWAIT|M_USE_RESERVE)) == M_NOWAIT)
591 pflags = VM_ALLOC_INTERRUPT | VM_ALLOC_WIRED;
593 pflags = VM_ALLOC_SYSTEM | VM_ALLOC_WIRED;
595 pflags |= VM_ALLOC_ZERO;
597 m = vm_page_alloc(NULL, color++,
598 pflags | VM_ALLOC_NOOBJ);
606 ret = (void *)arm_ptovirt(VM_PAGE_TO_PHYS(m));
607 if ((wait & M_ZERO) && (m->flags & PG_ZERO) == 0)
608 bzero(ret, PAGE_SIZE);
611 TAILQ_REMOVE(head, sp, pg_list);
612 TAILQ_INSERT_HEAD(&free_pgdesc, sp, pg_list);
614 mtx_unlock(&smallalloc_mtx);
621 uma_small_free(void *mem, int size, u_int8_t flags)
626 if (flags & UMA_SLAB_KMEM)
627 kmem_free(kmem_map, (vm_offset_t)mem, size);
629 struct arm_small_page *sp;
631 if ((vm_offset_t)mem >= KERNBASE) {
632 mtx_lock(&smallalloc_mtx);
633 sp = TAILQ_FIRST(&free_pgdesc);
634 KASSERT(sp != NULL, ("No more free page descriptor ?"));
635 TAILQ_REMOVE(&free_pgdesc, sp, pg_list);
637 pmap_get_pde_pte(kernel_pmap, (vm_offset_t)mem, &pd,
639 if ((*pd & pte_l1_s_cache_mask) ==
640 pte_l1_s_cache_mode_pt &&
641 pte_l1_s_cache_mode_pt != pte_l1_s_cache_mode)
642 TAILQ_INSERT_HEAD(&pages_wt, sp, pg_list);
644 TAILQ_INSERT_HEAD(&pages_normal, sp, pg_list);
645 mtx_unlock(&smallalloc_mtx);
648 vm_paddr_t pa = vtophys((vm_offset_t)mem);
650 m = PHYS_TO_VM_PAGE(pa);
653 atomic_subtract_int(&cnt.v_wire_count, 1);