xref: /netbsd-src/sys/uvm/pmap/pmap_tlb.h (revision b7b7574d3bf8eeb51a1fa3977b59142ec6434a55)
1 /*	$NetBSD: pmap_tlb.h,v 1.6 2014/04/03 14:46:25 matt Exp $	*/
2 
3 /*
4  * Copyright (c) 1992, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from software contributed to Berkeley by
8  * Ralph Campbell.
9  *
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.
21  *
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.
33  *
34  *	@(#)pmap.h	8.1 (Berkeley) 6/10/93
35  */
36 
37 /*
38  * Copyright (c) 1987 Carnegie-Mellon University
39  *
40  * This code is derived from software contributed to Berkeley by
41  * Ralph Campbell.
42  *
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.
58  *
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.
70  *
71  *	@(#)pmap.h	8.1 (Berkeley) 6/10/93
72  */
73 
74 #ifndef	_COMMON_PMAP_TLB_H_
75 #define	_COMMON_PMAP_TLB_H_
76 
77 #include <sys/kcpuset.h>
78 
79 #if !defined(PMAP_TLB_MAX)
80 # if defined(MULTIPROCESSOR)
81 #  define PMAP_TLB_MAX		MAXCPUS
82 # else
83 #  define PMAP_TLB_MAX		1
84 # endif
85 #endif
86 
87 /*
88  * Per TLB (normally same as CPU) asid info
89  */
90 struct pmap_asid_info {
91 	LIST_ENTRY(pmap_asid_info) pai_link;
92 	uint32_t	pai_asid;	/* TLB address space tag */
93 };
94 
95 #define	TLBINFO_LOCK(ti)		mutex_spin_enter((ti)->ti_lock)
96 #define	TLBINFO_UNLOCK(ti)		mutex_spin_exit((ti)->ti_lock)
97 #define	PMAP_PAI_ASIDVALID_P(pai, ti)	((pai)->pai_asid != 0)
98 #define	PMAP_PAI(pmap, ti)		(&(pmap)->pm_pai[tlbinfo_index(ti)])
99 #define	PAI_PMAP(pai, ti)	\
100 	((pmap_t)((intptr_t)(pai) \
101 	    - offsetof(struct pmap, pm_pai[tlbinfo_index(ti)])))
102 
103 enum tlb_invalidate_op {
104 	TLBINV_NOBODY=0,
105 	TLBINV_ONE=1,
106 	TLBINV_ALLUSER=2,
107 	TLBINV_ALLKERNEL=3,
108 	TLBINV_ALL=4
109 };
110 
111 struct pmap_tlb_info {
112 	char ti_name[8];
113 	uint32_t ti_asids_free;		/* # of ASIDs free */
114 #define	tlbinfo_noasids_p(ti)	((ti)->ti_asids_free == 0)
115 	kmutex_t *ti_lock;
116 	u_int ti_wired;			/* # of wired TLB entries */
117 	tlb_asid_t ti_asid_hint;		/* probable next ASID to use */
118 	tlb_asid_t ti_asid_max;
119 	LIST_HEAD(, pmap_asid_info) ti_pais; /* list of active ASIDs */
120 #ifdef MULTIPROCESSOR
121 	pmap_t ti_victim;
122 	uint32_t ti_synci_page_bitmap;	/* page indices needing a syncicache */
123 #if PMAP_TLB_MAX > 1
124 	kcpuset_t *ti_kcpuset;		/* bitmask of CPUs sharing this TLB */
125 	u_int ti_index;
126 	enum tlb_invalidate_op ti_tlbinvop;
127 #define tlbinfo_index(ti)	((ti)->ti_index)
128 #else
129 #define tlbinfo_index(ti)	((void)(ti), 0)
130 #endif
131 	struct evcnt ti_evcnt_synci_asts;
132 	struct evcnt ti_evcnt_synci_all;
133 	struct evcnt ti_evcnt_synci_pages;
134 	struct evcnt ti_evcnt_synci_deferred;
135 	struct evcnt ti_evcnt_synci_desired;
136 	struct evcnt ti_evcnt_synci_duplicate;
137 #else
138 #define tlbinfo_index(ti)	((void)(ti), 0)
139 #endif
140 	struct evcnt ti_evcnt_asid_reinits;
141 	u_long ti_asid_bitmap[256 / (sizeof(u_long) * 8)];
142 };
143 
144 #ifdef	_KERNEL
145 extern struct pmap_tlb_info pmap_tlb0_info;
146 #ifdef MULTIPROCESSOR
147 extern struct pmap_tlb_info *pmap_tlbs[MAXCPUS];
148 extern u_int pmap_ntlbs;
149 #endif
150 
151 #ifndef cpu_set_tlb_info
152 # define cpu_set_tlb_info(ci, ti)	((void)((ci)->ci_tlb_info = (ti)))
153 #endif
154 #ifndef cpu_tlb_info
155 # if PMAP_TLB_MAX > 1
156 #  define cpu_tlb_info(ci)		((ci)->ci_tlb_info)
157 # else
158 #  define cpu_tlb_info(ci)		(&pmap_tlb0_info)
159 # endif
160 #endif
161 
162 #ifdef MULTIPROCESSOR
163 void	pmap_tlb_shootdown_process(void);
164 bool	pmap_tlb_shootdown_bystanders(pmap_t pmap);
165 void	pmap_tlb_info_attach(struct pmap_tlb_info *, struct cpu_info *);
166 void	pmap_md_tlb_info_attach(struct pmap_tlb_info *, struct cpu_info *);
167 #endif
168 void	pmap_tlb_info_init(struct pmap_tlb_info *);
169 void	pmap_tlb_info_evcnt_attach(struct pmap_tlb_info *);
170 void	pmap_tlb_asid_acquire(pmap_t, struct lwp *l);
171 void	pmap_tlb_asid_deactivate(pmap_t);
172 void	pmap_tlb_asid_release_all(pmap_t);
173 int	pmap_tlb_update_addr(pmap_t, vaddr_t, uint32_t, u_int);
174 #define	PMAP_TLB_NEED_IPI	0x01
175 #define	PMAP_TLB_INSERT		0x02
176 void	pmap_tlb_invalidate_addr(pmap_t, vaddr_t);
177 void	pmap_tlb_check(pmap_t, bool (*)(void *, vaddr_t, tlb_asid_t, pt_entry_t));
178 void	pmap_tlb_asid_check(void);
179 
180 #endif	/* _KERNEL */
181 #endif	/* _COMMON_PMAP_TLB_H_ */
182