etc/protocols - sync with NetBSD-8
[minix.git] / sys / uvm / pmap / pmap_tlb.h
blob2fe603aa8fa42bb4adfa347aea46552e02248486
1 /* $NetBSD: pmap_tlb.h,v 1.8 2015/04/02 06:17:52 matt Exp $ */
3 /*
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Ralph Campbell.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
34 * @(#)pmap.h 8.1 (Berkeley) 6/10/93
38 * Copyright (c) 1987 Carnegie-Mellon University
40 * This code is derived from software contributed to Berkeley by
41 * Ralph Campbell.
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
45 * are met:
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 * SUCH DAMAGE.
71 * @(#)pmap.h 8.1 (Berkeley) 6/10/93
74 #ifndef _COMMON_PMAP_TLB_H_
75 #define _COMMON_PMAP_TLB_H_
77 #include <sys/evcnt.h>
78 #include <sys/kcpuset.h>
80 #if !defined(PMAP_TLB_MAX)
81 # if defined(MULTIPROCESSOR)
82 # define PMAP_TLB_MAX MAXCPUS
83 # else
84 # define PMAP_TLB_MAX 1
85 # endif
86 #endif
89 * Per TLB (normally same as CPU) asid info
91 struct pmap_asid_info {
92 LIST_ENTRY(pmap_asid_info) pai_link;
93 uint32_t pai_asid; /* TLB address space tag */
96 #define TLBINFO_LOCK(ti) mutex_spin_enter((ti)->ti_lock)
97 #define TLBINFO_UNLOCK(ti) mutex_spin_exit((ti)->ti_lock)
98 #define PMAP_PAI_ASIDVALID_P(pai, ti) ((pai)->pai_asid != 0)
99 #define PMAP_PAI(pmap, ti) (&(pmap)->pm_pai[tlbinfo_index(ti)])
100 #define PAI_PMAP(pai, ti) \
101 ((pmap_t)((intptr_t)(pai) \
102 - offsetof(struct pmap, pm_pai[tlbinfo_index(ti)])))
104 enum tlb_invalidate_op {
105 TLBINV_NOBODY=0,
106 TLBINV_ONE=1,
107 TLBINV_ALLUSER=2,
108 TLBINV_ALLKERNEL=3,
109 TLBINV_ALL=4
112 struct pmap_tlb_info {
113 char ti_name[8];
114 uint32_t ti_asids_free; /* # of ASIDs free */
115 #define tlbinfo_noasids_p(ti) ((ti)->ti_asids_free == 0)
116 kmutex_t *ti_lock;
117 u_int ti_wired; /* # of wired TLB entries */
118 tlb_asid_t ti_asid_hint; /* probable next ASID to use */
119 tlb_asid_t ti_asid_max;
120 LIST_HEAD(, pmap_asid_info) ti_pais; /* list of active ASIDs */
121 #ifdef MULTIPROCESSOR
122 pmap_t ti_victim;
123 uint32_t ti_synci_page_bitmap; /* page indices needing a syncicache */
124 #if PMAP_TLB_MAX > 1
125 kcpuset_t *ti_kcpuset; /* bitmask of CPUs sharing this TLB */
126 u_int ti_index;
127 enum tlb_invalidate_op ti_tlbinvop;
128 #define tlbinfo_index(ti) ((ti)->ti_index)
129 #else
130 #define tlbinfo_index(ti) ((void)(ti), 0)
131 #endif
132 struct evcnt ti_evcnt_synci_asts;
133 struct evcnt ti_evcnt_synci_all;
134 struct evcnt ti_evcnt_synci_pages;
135 struct evcnt ti_evcnt_synci_deferred;
136 struct evcnt ti_evcnt_synci_desired;
137 struct evcnt ti_evcnt_synci_duplicate;
138 #else
139 #define tlbinfo_index(ti) ((void)(ti), 0)
140 #endif
141 struct evcnt ti_evcnt_asid_reinits;
142 u_long ti_asid_bitmap[256 / (sizeof(u_long) * 8)];
145 #ifdef _KERNEL
146 extern struct pmap_tlb_info pmap_tlb0_info;
147 #ifdef MULTIPROCESSOR
148 extern struct pmap_tlb_info *pmap_tlbs[PMAP_TLB_MAX];
149 extern u_int pmap_ntlbs;
150 #endif
152 #ifndef cpu_set_tlb_info
153 # define cpu_set_tlb_info(ci, ti) ((void)((ci)->ci_tlb_info = (ti)))
154 #endif
155 #ifndef cpu_tlb_info
156 # if PMAP_TLB_MAX > 1
157 # define cpu_tlb_info(ci) ((ci)->ci_tlb_info)
158 # else
159 # define cpu_tlb_info(ci) (&pmap_tlb0_info)
160 # endif
161 #endif
163 #ifdef MULTIPROCESSOR
164 void pmap_tlb_shootdown_process(void);
165 bool pmap_tlb_shootdown_bystanders(pmap_t pmap);
166 void pmap_tlb_info_attach(struct pmap_tlb_info *, struct cpu_info *);
167 void pmap_md_tlb_info_attach(struct pmap_tlb_info *, struct cpu_info *);
168 #endif
169 void pmap_tlb_info_init(struct pmap_tlb_info *);
170 void pmap_tlb_info_evcnt_attach(struct pmap_tlb_info *);
171 void pmap_tlb_asid_acquire(pmap_t, struct lwp *l);
172 void pmap_tlb_asid_deactivate(pmap_t);
173 void pmap_tlb_asid_release_all(pmap_t);
174 int pmap_tlb_update_addr(pmap_t, vaddr_t, uint32_t, u_int);
175 #define PMAP_TLB_NEED_IPI 0x01
176 #define PMAP_TLB_INSERT 0x02
177 void pmap_tlb_invalidate_addr(pmap_t, vaddr_t);
178 void pmap_tlb_check(pmap_t, bool (*)(void *, vaddr_t, tlb_asid_t, pt_entry_t));
179 void pmap_tlb_asid_check(void);
181 #endif /* _KERNEL */
182 #endif /* _COMMON_PMAP_TLB_H_ */