Aren
/
NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
NetBSD/sys/arch/alpha/include/pmap.h

335 lines
11 KiB
C
Raw Normal View History

Add a VM_MDPAGE_MEMBERS macro that defines pmap-specific data for each vm_page structure. Add a VM_MDPAGE_INIT() macro to init this data when pages are initialized by UVM. These macros are mandatory, but ports may #define them to nothing if they are not needed/used. This deprecates struct pmap_physseg. As a transitional measure, allow a port to #define PMAP_PHYSSEG so that it can continue to use it until its pmap is converted to use VM_MDPAGE_MEMBERS. Use all this stuff to eliminate a lot of extra work in the Alpha pmap module (it's smaller and faster now). Changes to other pmap modules will follow.
2001-04-30 02:44:31 +04:00
/* $NetBSD: pmap.h,v 1.46 2001/04/29 22:44:33 thorpej Exp $ */
preliminary Alpha support. note that NOT ALL OF THE MODIFICATIONS TO THE REST OF THE KERNEL ARE IN THE TREE YET. Also, some of this is _incredibly_ hack-ish, etc., but it works.
1995-02-14 02:06:39 +03:00
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
/*-
Gather ASN info into a single structure, and place a variable-length array of those structures at the end of the pmap structure. We compute the size of the pmap structure based on the maximum CPU ID for a particular machine. This gives us better cache behavior and better memory footprint for the ASN info.
2001-04-25 00:11:53 +04:00
* Copyright (c) 1998, 1999, 2000, 2001 The NetBSD Foundation, Inc.
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
* NASA Ames Research Center and by Chris G. Demetriou.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) 1987 Carnegie-Mellon University
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* the Systems Programming Group of the University of Utah Computer
* Science Department.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)pmap.h 8.1 (Berkeley) 6/10/93
*/
#ifndef _PMAP_MACHINE_
#define _PMAP_MACHINE_
First-cut at multiprocessor TLB shootdown. This simple implementation can probably be improved somewhat, but an attempt to be efficient has been made. Note: TLB shootdowns are NOT YET ENABLED.
1999-02-24 22:22:16 +03:00
#if defined(_KERNEL) && !defined(_LKM)
#include "opt_multiprocessor.h"
#endif
Add fine-grained locking, using a locking protocol modeled after the i386 UVM pmap's locking protocol, written by Chuck Cranor. Not all of the support for multiple processors is here yet, but the kernel does run under moderate loads with LOCKDEBUG (all locking operations are no-ops unless LOCKDEBUG is turned on). This is by no means complete... there are still some possible snares to take a look at.
1998-05-20 08:05:50 +04:00
#include <sys/lock.h>
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#include <sys/queue.h>
Add fine-grained locking, using a locking protocol modeled after the i386 UVM pmap's locking protocol, written by Chuck Cranor. Not all of the support for multiple processors is here yet, but the kernel does run under moderate loads with LOCKDEBUG (all locking operations are no-ops unless LOCKDEBUG is turned on). This is by no means complete... there are still some possible snares to take a look at.
1998-05-20 08:05:50 +04:00
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#include <machine/pte.h>
/*
* Machine-dependent virtual memory state.
*
* If we ever support processor numbers higher than 63, we'll have to
* rethink the CPU mask.
*
Add some support for multiple processors to the pmap module. Still left to do: TLB shootdown code, but that will be much easier to write once the code to spin up the additional CPUs is working.
1998-09-22 07:58:10 +04:00
* Note pm_asn and pm_asngen are arrays allocated in pmap_create().
* Their size is based on the PCS count from the HWRPB, and indexed
* by processor ID (from `whami').
*
* The kernel pmap is a special case; it gets statically-allocated
* arrays which hold enough for ALPHA_MAXPROCS.
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
*/
Gather ASN info into a single structure, and place a variable-length array of those structures at the end of the pmap structure. We compute the size of the pmap structure based on the maximum CPU ID for a particular machine. This gives us better cache behavior and better memory footprint for the ASN info.
2001-04-25 00:11:53 +04:00
struct pmap_asn_info {
unsigned int pma_asn; /* address space number */
unsigned long pma_asngen; /* ASN generation number */
};
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
struct pmap {
Make the list of all pmaps LRU-ordered, and update a comment regarding locking.
1999-05-24 02:37:02 +04:00
TAILQ_ENTRY(pmap) pm_list; /* list of all pmaps */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
pt_entry_t *pm_lev1map; /* level 1 map */
int pm_count; /* pmap reference count */
Add fine-grained locking, using a locking protocol modeled after the i386 UVM pmap's locking protocol, written by Chuck Cranor. Not all of the support for multiple processors is here yet, but the kernel does run under moderate loads with LOCKDEBUG (all locking operations are no-ops unless LOCKDEBUG is turned on). This is by no means complete... there are still some possible snares to take a look at.
1998-05-20 08:05:50 +04:00
struct simplelock pm_slock; /* lock on pmap */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
struct pmap_statistics pm_stats; /* pmap statistics */
unsigned long pm_cpus; /* mask of CPUs using pmap */
Infrastructure for lazy istream sync in the pmap module: - Add a bitmask for the CPUs which need an isync before this pmap returns to userspace on that CPU. - Define PMAP_USERRET(), a utility macro for userret() to use to process the deferred isync, and call it as appropriate in userret().
2000-03-01 05:22:03 +03:00
unsigned long pm_needisync; /* mask of CPUs needing isync */
Gather ASN info into a single structure, and place a variable-length array of those structures at the end of the pmap structure. We compute the size of the pmap structure based on the maximum CPU ID for a particular machine. This gives us better cache behavior and better memory footprint for the ASN info.
2001-04-25 00:11:53 +04:00
struct pmap_asn_info pm_asni[1]; /* ASN information */
/* variable length */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
};
typedef struct pmap *pmap_t;
Gather ASN info into a single structure, and place a variable-length array of those structures at the end of the pmap structure. We compute the size of the pmap structure based on the maximum CPU ID for a particular machine. This gives us better cache behavior and better memory footprint for the ASN info.
2001-04-25 00:11:53 +04:00
/*
* Compute the sizeo of a pmap structure. Subtract one because one
* ASN info structure is already included in the pmap structure itself.
*/
#define PMAP_SIZEOF(x) \
(ALIGN(sizeof(struct pmap) + \
(sizeof(struct pmap_asn_info) * ((x) - 1))))
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#define PMAP_ASN_RESERVED 0 /* reserved for Lev1map users */
Gather ASN info into a single structure, and place a variable-length array of those structures at the end of the pmap structure. We compute the size of the pmap structure based on the maximum CPU ID for a particular machine. This gives us better cache behavior and better memory footprint for the ASN info.
2001-04-25 00:11:53 +04:00
extern u_long kernel_pmap_store[];
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
/*
* For each vm_page_t, there is a list of all currently valid virtual
* mappings of that page. An entry is a pv_entry_t, the list is pv_table.
*/
typedef struct pv_entry {
LIST_ENTRY(pv_entry) pv_list; /* pv_entry list */
struct pmap *pv_pmap; /* pmap where mapping lies */
vm_offset_t -> {paddr_t,vaddr_t}, vm_size_t -> vsize_t
1998-08-14 20:50:00 +04:00
vaddr_t pv_va; /* virtual address for mapping */
Save ourselves some work in some pv list traversal functions; keep a pointer to the PTE that maps the page in the pv_entry so that we don't have to compute it from the pmap/va.
1999-05-23 21:49:07 +04:00
pt_entry_t *pv_pte; /* PTE that maps the VA */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
} *pv_entry_t;
/* pvh_attrs */
Make the page attribute manifest constant names have similar form to page usage manifest constant names.
1998-05-19 04:29:03 +04:00
#define PGA_MODIFIED 0x01 /* modified */
#define PGA_REFERENCED 0x02 /* referenced */
Keep track of page usage inside the pmap (pvent, l{1,2,3}pt page, "normal").
1998-05-19 04:20:21 +04:00
/* pvh_usage */
#define PGU_NORMAL 0 /* free or normal use */
#define PGU_PVENT 1 /* PV entries */
#define PGU_L1PT 2 /* level 1 page table */
#define PGU_L2PT 3 /* level 2 page table */
#define PGU_L3PT 4 /* level 3 page table */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#ifdef _KERNEL
if NEW_SCC_DRIVER, 3000/300 and 3000/500 aren't PROM console candidates.
1998-03-26 05:53:21 +03:00
#ifndef _LKM
#include "opt_new_scc_driver.h"
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#include "opt_dec_3000_300.h" /* XXX */
#include "opt_dec_3000_500.h" /* XXX */
#include "opt_dec_kn8ae.h" /* XXX */
if NEW_SCC_DRIVER, 3000/300 and 3000/500 aren't PROM console candidates.
1998-03-26 05:53:21 +03:00
#if defined(NEW_SCC_DRIVER)
DEC_KN300 no longer uses PROM console.
1999-04-16 02:15:38 +04:00
#if defined(DEC_KN8AE)
if NEW_SCC_DRIVER, 3000/300 and 3000/500 aren't PROM console candidates.
1998-03-26 05:53:21 +03:00
#define _PMAP_MAY_USE_PROM_CONSOLE
#endif
#else /* ! NEW_SCC_DRIVER */
#if defined(DEC_3000_300) \
|| defined(DEC_3000_500) \
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
|| defined(DEC_KN8AE) /* XXX */
#define _PMAP_MAY_USE_PROM_CONSOLE /* XXX */
#endif /* XXX */
if NEW_SCC_DRIVER, 3000/300 and 3000/500 aren't PROM console candidates.
1998-03-26 05:53:21 +03:00
#endif /* NEW_SCC_DRIVER */
First-cut at multiprocessor TLB shootdown. This simple implementation can probably be improved somewhat, but an attempt to be efficient has been made. Note: TLB shootdowns are NOT YET ENABLED.
1999-02-24 22:22:16 +03:00
#if defined(MULTIPROCESSOR)
Several changes, which get us generally further along with multiprocessor support: - Implement MP-safe halt. - Make the FPU saving code more like Bill's on the i386 MP branch. XXX This code will no doubt be revisited again. - Pass the cpu_info and trapframe to IPI handlers, saving some work in the handlers themselves, and also making it possible for the "pause" handler to reference register state for DDB. - Add "machine cpu" to DDB, making it possible to reference other CPUs registers (and thus get e.g. a traceback) from whichever CPU is actually running the debugger. - Garbage-collect "machine halt" and "machine reboot" DDB commands. They don't have a prayer of working properly in multiprocessor kernels, and didn't really work all that well in uniprocessor kernels.
2000-11-22 11:39:46 +03:00
struct cpu_info;
struct trapframe;
pmap_asn_alloc(): In a multiprocessor configuration, it's possible to arrive here referencing the kernel_lev1map without having the RESERVED ASN -- another CPU may have caused pmap_lev1map_destroy() to be called, and that routine only invalidates the ASN for the CPU that called it. So, in the MULTIPROCESSOR case, simply assign the RESERVED ASN if we reference the kernel_lev1map rather than asserting that we already have the RESERVED ASN. Thanks to Bill Sommerfeld for helping me track down the problem. Also add a new IPI that causes a CPU to re-activate its address space if the pmap it's using changes level 1 maps (this probably won't happen very often, but it's correct to have it). This makes Alpha MP kernels boot multiuser. In fact, this commit is being made from my dual-CPU AlphaServer 1200 running an MP kernel.
2001-04-20 20:22:33 +04:00
void pmap_do_reactivate(struct cpu_info *, struct trapframe *);
And more ANSI'ification!
2000-06-08 07:10:06 +04:00
void pmap_tlb_shootdown(pmap_t, vaddr_t, pt_entry_t);
Several changes, which get us generally further along with multiprocessor support: - Implement MP-safe halt. - Make the FPU saving code more like Bill's on the i386 MP branch. XXX This code will no doubt be revisited again. - Pass the cpu_info and trapframe to IPI handlers, saving some work in the handlers themselves, and also making it possible for the "pause" handler to reference register state for DDB. - Add "machine cpu" to DDB, making it possible to reference other CPUs registers (and thus get e.g. a traceback) from whichever CPU is actually running the debugger. - Garbage-collect "machine halt" and "machine reboot" DDB commands. They don't have a prayer of working properly in multiprocessor kernels, and didn't really work all that well in uniprocessor kernels.
2000-11-22 11:39:46 +03:00
void pmap_do_tlb_shootdown(struct cpu_info *, struct trapframe *);
Snapshot of TLB shootdown bugfixes.
2000-08-26 07:27:44 +04:00
void pmap_tlb_shootdown_q_drain(u_long, boolean_t);
#define PMAP_TLB_SHOOTDOWN(pm, va, pte) \
pmap_tlb_shootdown((pm), (va), (pte))
#else
#define PMAP_TLB_SHOOTDOWN(pm, va, pte) /* nothing */
First-cut at multiprocessor TLB shootdown. This simple implementation can probably be improved somewhat, but an attempt to be efficient has been made. Note: TLB shootdowns are NOT YET ENABLED.
1999-02-24 22:22:16 +03:00
#endif /* MULTIPROCESSOR */
if NEW_SCC_DRIVER, 3000/300 and 3000/500 aren't PROM console candidates.
1998-03-26 05:53:21 +03:00
#endif /* _LKM */
Add a VM_MDPAGE_MEMBERS macro that defines pmap-specific data for each vm_page structure. Add a VM_MDPAGE_INIT() macro to init this data when pages are initialized by UVM. These macros are mandatory, but ports may #define them to nothing if they are not needed/used. This deprecates struct pmap_physseg. As a transitional measure, allow a port to #define PMAP_PHYSSEG so that it can continue to use it until its pmap is converted to use VM_MDPAGE_MEMBERS. Use all this stuff to eliminate a lot of extra work in the Alpha pmap module (it's smaller and faster now). Changes to other pmap modules will follow.
2001-04-30 02:44:31 +04:00
#define pmap_kernel() ((pmap_t) (&kernel_pmap_store[0]))
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
#define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)
Undo a misguided previous change to the pmap_update() API.
2001-04-23 03:19:26 +04:00
#define pmap_update() /* nothing (yet) */
#define away pmap_update() in <machine/pmap.h> so that no function call overhead is incurred as we start sprinkling pmap_update() calls throughout the source tree (no pmaps currently defer operations, but we are adding the infrastructure to allow them to do so).
2001-04-22 03:51:14 +04:00
Add a VM_MDPAGE_MEMBERS macro that defines pmap-specific data for each vm_page structure. Add a VM_MDPAGE_INIT() macro to init this data when pages are initialized by UVM. These macros are mandatory, but ports may #define them to nothing if they are not needed/used. This deprecates struct pmap_physseg. As a transitional measure, allow a port to #define PMAP_PHYSSEG so that it can continue to use it until its pmap is converted to use VM_MDPAGE_MEMBERS. Use all this stuff to eliminate a lot of extra work in the Alpha pmap module (it's smaller and faster now). Changes to other pmap modules will follow.
2001-04-30 02:44:31 +04:00
#define pmap_is_referenced(pg) \
(((pg)->pvh_attrs & PGA_REFERENCED) != 0)
#define pmap_is_modified(pg) \
(((pg)->pvh_attrs & PGA_MODIFIED) != 0)
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
extern pt_entry_t *VPT; /* Virtual Page Table */
#define PMAP_STEAL_MEMORY /* enable pmap_steal_memory() */
Implement pmap_growkernel().
2000-11-19 06:16:34 +03:00
#define PMAP_GROWKERNEL /* enable pmap_growkernel() */
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
Provide PMAP_{,UN}MAP_POOLPAGE().
1998-07-25 00:32:07 +04:00
/*
* Alternate mapping hooks for pool pages. Avoids thrashing the TLB.
*/
#define PMAP_MAP_POOLPAGE(pa) ALPHA_PHYS_TO_K0SEG((pa))
#define PMAP_UNMAP_POOLPAGE(va) ALPHA_K0SEG_TO_PHYS((va))
Add glue for page zero'ing in the idle loop.
2001-04-29 10:54:03 +04:00
boolean_t pmap_pageidlezero(paddr_t);
#define PMAP_PAGEIDLEZERO(pa) pmap_pageidlezero((pa))
And more ANSI'ification!
2000-06-08 07:10:06 +04:00
paddr_t vtophys(vaddr_t);
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
/* Machine-specific functions. */
And more ANSI'ification!
2000-06-08 07:10:06 +04:00
void pmap_bootstrap(paddr_t ptaddr, u_int maxasn, u_long ncpuids);
void pmap_emulate_reference(struct proc *p, vaddr_t v,
int user, int write);
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#ifdef _PMAP_MAY_USE_PROM_CONSOLE
And more ANSI'ification!
2000-06-08 07:10:06 +04:00
int pmap_uses_prom_console(void);
temporarily move new pmap code into a seperate header, so changes to one version won't spam people compiling with the option to get the other.
1996-07-10 02:22:25 +04:00
#endif
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#define pmap_pte_pa(pte) (PG_PFNUM(*(pte)) << PGSHIFT)
#define pmap_pte_prot(pte) (*(pte) & PG_PROT)
#define pmap_pte_w(pte) (*(pte) & PG_WIRED)
#define pmap_pte_v(pte) (*(pte) & PG_V)
#define pmap_pte_pv(pte) (*(pte) & PG_PVLIST)
#define pmap_pte_asm(pte) (*(pte) & PG_ASM)
Define a macro to test PG_EXEC.
1998-06-11 09:10:41 +04:00
#define pmap_pte_exec(pte) (*(pte) & PG_EXEC)
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#define pmap_pte_set_w(pte, v) \
do { \
if (v) \
*(pte) |= PG_WIRED; \
else \
*(pte) &= ~PG_WIRED; \
} while (0)
#define pmap_pte_w_chg(pte, nw) ((nw) ^ pmap_pte_w(pte))
#define pmap_pte_set_prot(pte, np) \
do { \
*(pte) &= ~PG_PROT; \
*(pte) |= (np); \
} while (0)
#define pmap_pte_prot_chg(pte, np) ((np) ^ pmap_pte_prot(pte))
And more ANSI'ification!
2000-06-08 07:10:06 +04:00
static __inline pt_entry_t *pmap_l2pte(pmap_t, vaddr_t, pt_entry_t *);
static __inline pt_entry_t *pmap_l3pte(pmap_t, vaddr_t, pt_entry_t *);
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#define pmap_l1pte(pmap, v) \
vm_offset_t -> {paddr_t,vaddr_t}, vm_size_t -> vsize_t
1998-08-14 20:50:00 +04:00
(&(pmap)->pm_lev1map[l1pte_index((vaddr_t)(v))])
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
static __inline pt_entry_t *
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pmap_l2pte(pmap, v, l1pte)
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
pmap_t pmap;
vm_offset_t -> {paddr_t,vaddr_t}, vm_size_t -> vsize_t
1998-08-14 20:50:00 +04:00
vaddr_t v;
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pt_entry_t *l1pte;
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
{
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pt_entry_t *lev2map;
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
if (l1pte == NULL) {
l1pte = pmap_l1pte(pmap, v);
if (pmap_pte_v(l1pte) == 0)
return (NULL);
}
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte));
return (&lev2map[l2pte_index(v)]);
}
static __inline pt_entry_t *
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pmap_l3pte(pmap, v, l2pte)
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
pmap_t pmap;
vm_offset_t -> {paddr_t,vaddr_t}, vm_size_t -> vsize_t
1998-08-14 20:50:00 +04:00
vaddr_t v;
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pt_entry_t *l2pte;
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
{
Increase the efficiency of pmap_l{2,3}pte() somewhat, by allowing the caller to pass an optional 3rd argument, which is the previous level PTE corresponding the virtual address. If this argument is non-NULL, the table walk otherwise necessary will be bypassed.
1998-04-27 23:07:03 +04:00
pt_entry_t *l1pte, *lev2map, *lev3map;
if (l2pte == NULL) {
l1pte = pmap_l1pte(pmap, v);
if (pmap_pte_v(l1pte) == 0)
return (NULL);
lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte));
l2pte = &lev2map[l2pte_index(v)];
if (pmap_pte_v(l2pte) == 0)
return (NULL);
}
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
lev3map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l2pte));
return (&lev3map[l3pte_index(v)]);
}
The kernel pmap can be accessed (and locked!) while in an interrupt context, so we must block interrupts which may cause memory allocation before asserting the kernel pmap's lock. Put this all in PMAP_LOCK() and PMAP_UNLOCK() macros to make it easier.
1999-05-25 00:11:58 +04:00
/*
* Macros for locking pmap structures.
*
- Use alpha_atomic_{add,sub}_q() to update the pmap statistics. We now no longer need to lock the kernel pmap in pmap_kenter_pa() and pmap_kremove(). - Since locking the kernel pmap in interrupt context is no longer required, don't go to splimp() when locking the kernel pmap. - Implement a new pmap_remove() function, not yet enabled by default. It is structured like pmap_protect, and should be *much* faster. This was actually written quite some time ago, but never committed because it didn't work properly. Given the recent bugfix to pmap_protect(), "duh, of course it didn't work properly before...". It seems to work fine now (have done several builds and run the UVM regression tests using the new code), but it is currently run-time optional so that some performance measurements can be easily run against the old and new code.
1999-11-28 22:53:11 +03:00
* Note that we if we access the kernel pmap in interrupt context, it
* is only to update statistics. Since stats are updated using atomic
* operations, locking the kernel pmap is not necessary. Therefore,
* it is not necessary to block interrupts when locking pmap strucutres.
The kernel pmap can be accessed (and locked!) while in an interrupt context, so we must block interrupts which may cause memory allocation before asserting the kernel pmap's lock. Put this all in PMAP_LOCK() and PMAP_UNLOCK() macros to make it easier.
1999-05-25 00:11:58 +04:00
*/
- Use alpha_atomic_{add,sub}_q() to update the pmap statistics. We now no longer need to lock the kernel pmap in pmap_kenter_pa() and pmap_kremove(). - Since locking the kernel pmap in interrupt context is no longer required, don't go to splimp() when locking the kernel pmap. - Implement a new pmap_remove() function, not yet enabled by default. It is structured like pmap_protect, and should be *much* faster. This was actually written quite some time ago, but never committed because it didn't work properly. Given the recent bugfix to pmap_protect(), "duh, of course it didn't work properly before...". It seems to work fine now (have done several builds and run the UVM regression tests using the new code), but it is currently run-time optional so that some performance measurements can be easily run against the old and new code.
1999-11-28 22:53:11 +03:00
#define PMAP_LOCK(pmap) simple_lock(&(pmap)->pm_slock)
#define PMAP_UNLOCK(pmap) simple_unlock(&(pmap)->pm_slock)
The kernel pmap can be accessed (and locked!) while in an interrupt context, so we must block interrupts which may cause memory allocation before asserting the kernel pmap's lock. Put this all in PMAP_LOCK() and PMAP_UNLOCK() macros to make it easier.
1999-05-25 00:11:58 +04:00
Infrastructure for lazy istream sync in the pmap module: - Add a bitmask for the CPUs which need an isync before this pmap returns to userspace on that CPU. - Define PMAP_USERRET(), a utility macro for userret() to use to process the deferred isync, and call it as appropriate in userret().
2000-03-01 05:22:03 +03:00
/*
* Macro for processing deferred I-stream synchronization.
*
* The pmap module may defer syncing the user I-stream until the
* return to userspace, since the IMB PALcode op can be quite
* expensive. Since user instructions won't be executed until
* the return to userspace, this can be deferred until userret().
*/
#define PMAP_USERRET(pmap) \
do { \
u_long cpu_mask = (1UL << cpu_number()); \
\
if ((pmap)->pm_needisync & cpu_mask) { \
Rename the atomic operations to have generic machine-independent names, and define __HAVE_ATOMIC_OPERATIONS to indicate their existence.
2000-05-23 09:12:53 +04:00
atomic_clearbits_ulong(&(pmap)->pm_needisync, \
Infrastructure for lazy istream sync in the pmap module: - Add a bitmask for the CPUs which need an isync before this pmap returns to userspace on that CPU. - Define PMAP_USERRET(), a utility macro for userret() to use to process the deferred isync, and call it as appropriate in userret().
2000-03-01 05:22:03 +03:00
cpu_mask); \
alpha_pal_imb(); \
} \
} while (0)
Remove the Mach 3 pmap from the tree, replacing it with the contents of pmap.old.<whatever>. To see the history, look at the corresponding pmap.old.<whatever> file.
1998-03-26 05:18:03 +03:00
#endif /* _KERNEL */
#endif /* _PMAP_MACHINE_ */