Print this page
NEX-5177 backport illumos 6345 remove xhat support
Reviewed by: Kevin Crowe <kevin.crowe@nexenta.com>
6345 remove xhat support
Reviewed by: Dan McDonald <danmcd@omniti.com>
Reviewed by: Garrett D'Amore <garrett@damore.org>
Approved by: Hans Rosenfeld <rosenfeld@grumpf.hope-2000.org>
NEX-5164 backport illumos 6514 AS_* lock macros simplification
Reviewed by: Kevin Crowe <kevin.crowe@nexenta.com>
6514 AS_* lock macros simplification
Reviewed by: Piotr Jasiukajtis <estibi@me.com>
Reviewed by: Yuri Pankov <yuri.pankov@nexenta.com>
Reviewed by: Albert Lee <trisk@omniti.com>
Approved by: Dan McDonald <danmcd@omniti.com>
re #13613 rb4516 Tunables needs volatile keyword
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/uts/common/vm/seg_vn.c
+++ new/usr/src/uts/common/vm/seg_vn.c
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21 /*
22 22 * Copyright (c) 1986, 2010, Oracle and/or its affiliates. All rights reserved.
23 23 * Copyright 2015, Joyent, Inc. All rights reserved.
24 24 * Copyright 2015 Nexenta Systems, Inc. All rights reserved.
25 25 */
26 26
27 27 /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
28 28 /* All Rights Reserved */
29 29
30 30 /*
31 31 * University Copyright- Copyright (c) 1982, 1986, 1988
32 32 * The Regents of the University of California
33 33 * All Rights Reserved
34 34 *
35 35 * University Acknowledgment- Portions of this document are derived from
36 36 * software developed by the University of California, Berkeley, and its
37 37 * contributors.
38 38 */
39 39
40 40 /*
41 41 * VM - shared or copy-on-write from a vnode/anonymous memory.
42 42 */
43 43
44 44 #include <sys/types.h>
45 45 #include <sys/param.h>
46 46 #include <sys/t_lock.h>
47 47 #include <sys/errno.h>
48 48 #include <sys/systm.h>
49 49 #include <sys/mman.h>
50 50 #include <sys/debug.h>
51 51 #include <sys/cred.h>
52 52 #include <sys/vmsystm.h>
53 53 #include <sys/tuneable.h>
54 54 #include <sys/bitmap.h>
55 55 #include <sys/swap.h>
56 56 #include <sys/kmem.h>
57 57 #include <sys/sysmacros.h>
58 58 #include <sys/vtrace.h>
59 59 #include <sys/cmn_err.h>
60 60 #include <sys/callb.h>
61 61 #include <sys/vm.h>
62 62 #include <sys/dumphdr.h>
63 63 #include <sys/lgrp.h>
64 64
65 65 #include <vm/hat.h>
66 66 #include <vm/as.h>
67 67 #include <vm/seg.h>
68 68 #include <vm/seg_vn.h>
69 69 #include <vm/pvn.h>
70 70 #include <vm/anon.h>
71 71 #include <vm/page.h>
72 72 #include <vm/vpage.h>
73 73 #include <sys/proc.h>
74 74 #include <sys/task.h>
75 75 #include <sys/project.h>
76 76 #include <sys/zone.h>
77 77 #include <sys/shm_impl.h>
78 78
79 79 /*
80 80 * segvn_fault needs a temporary page list array. To avoid calling kmem all
81 81 * the time, it creates a small (PVN_GETPAGE_NUM entry) array and uses it if
82 82 * it can. In the rare case when this page list is not large enough, it
83 83 * goes and gets a large enough array from kmem.
84 84 *
85 85 * This small page list array covers either 8 pages or 64kB worth of pages -
86 86 * whichever is smaller.
87 87 */
88 88 #define PVN_MAX_GETPAGE_SZ 0x10000
89 89 #define PVN_MAX_GETPAGE_NUM 0x8
90 90
91 91 #if PVN_MAX_GETPAGE_SZ > PVN_MAX_GETPAGE_NUM * PAGESIZE
92 92 #define PVN_GETPAGE_SZ ptob(PVN_MAX_GETPAGE_NUM)
93 93 #define PVN_GETPAGE_NUM PVN_MAX_GETPAGE_NUM
94 94 #else
95 95 #define PVN_GETPAGE_SZ PVN_MAX_GETPAGE_SZ
96 96 #define PVN_GETPAGE_NUM btop(PVN_MAX_GETPAGE_SZ)
97 97 #endif
98 98
99 99 /*
100 100 * Private seg op routines.
101 101 */
102 102 static int segvn_dup(struct seg *seg, struct seg *newseg);
103 103 static int segvn_unmap(struct seg *seg, caddr_t addr, size_t len);
104 104 static void segvn_free(struct seg *seg);
105 105 static faultcode_t segvn_fault(struct hat *hat, struct seg *seg,
106 106 caddr_t addr, size_t len, enum fault_type type,
107 107 enum seg_rw rw);
108 108 static faultcode_t segvn_faulta(struct seg *seg, caddr_t addr);
109 109 static int segvn_setprot(struct seg *seg, caddr_t addr,
110 110 size_t len, uint_t prot);
111 111 static int segvn_checkprot(struct seg *seg, caddr_t addr,
112 112 size_t len, uint_t prot);
113 113 static int segvn_kluster(struct seg *seg, caddr_t addr, ssize_t delta);
114 114 static size_t segvn_swapout(struct seg *seg);
115 115 static int segvn_sync(struct seg *seg, caddr_t addr, size_t len,
116 116 int attr, uint_t flags);
117 117 static size_t segvn_incore(struct seg *seg, caddr_t addr, size_t len,
118 118 char *vec);
119 119 static int segvn_lockop(struct seg *seg, caddr_t addr, size_t len,
120 120 int attr, int op, ulong_t *lockmap, size_t pos);
121 121 static int segvn_getprot(struct seg *seg, caddr_t addr, size_t len,
122 122 uint_t *protv);
123 123 static u_offset_t segvn_getoffset(struct seg *seg, caddr_t addr);
124 124 static int segvn_gettype(struct seg *seg, caddr_t addr);
125 125 static int segvn_getvp(struct seg *seg, caddr_t addr,
126 126 struct vnode **vpp);
127 127 static int segvn_advise(struct seg *seg, caddr_t addr, size_t len,
128 128 uint_t behav);
129 129 static void segvn_dump(struct seg *seg);
130 130 static int segvn_pagelock(struct seg *seg, caddr_t addr, size_t len,
131 131 struct page ***ppp, enum lock_type type, enum seg_rw rw);
132 132 static int segvn_setpagesize(struct seg *seg, caddr_t addr, size_t len,
133 133 uint_t szc);
134 134 static int segvn_getmemid(struct seg *seg, caddr_t addr,
135 135 memid_t *memidp);
136 136 static lgrp_mem_policy_info_t *segvn_getpolicy(struct seg *, caddr_t);
137 137 static int segvn_capable(struct seg *seg, segcapability_t capable);
138 138 static int segvn_inherit(struct seg *, caddr_t, size_t, uint_t);
139 139
140 140 struct seg_ops segvn_ops = {
141 141 segvn_dup,
142 142 segvn_unmap,
143 143 segvn_free,
144 144 segvn_fault,
145 145 segvn_faulta,
146 146 segvn_setprot,
147 147 segvn_checkprot,
148 148 segvn_kluster,
149 149 segvn_swapout,
150 150 segvn_sync,
151 151 segvn_incore,
152 152 segvn_lockop,
153 153 segvn_getprot,
154 154 segvn_getoffset,
155 155 segvn_gettype,
156 156 segvn_getvp,
157 157 segvn_advise,
158 158 segvn_dump,
159 159 segvn_pagelock,
160 160 segvn_setpagesize,
161 161 segvn_getmemid,
162 162 segvn_getpolicy,
163 163 segvn_capable,
164 164 segvn_inherit
165 165 };
166 166
167 167 /*
168 168 * Common zfod structures, provided as a shorthand for others to use.
169 169 */
170 170 static segvn_crargs_t zfod_segvn_crargs =
171 171 SEGVN_ZFOD_ARGS(PROT_ZFOD, PROT_ALL);
172 172 static segvn_crargs_t kzfod_segvn_crargs =
173 173 SEGVN_ZFOD_ARGS(PROT_ZFOD & ~PROT_USER,
174 174 PROT_ALL & ~PROT_USER);
175 175 static segvn_crargs_t stack_noexec_crargs =
176 176 SEGVN_ZFOD_ARGS(PROT_ZFOD & ~PROT_EXEC, PROT_ALL);
177 177
178 178 caddr_t zfod_argsp = (caddr_t)&zfod_segvn_crargs; /* user zfod argsp */
179 179 caddr_t kzfod_argsp = (caddr_t)&kzfod_segvn_crargs; /* kernel zfod argsp */
180 180 caddr_t stack_exec_argsp = (caddr_t)&zfod_segvn_crargs; /* executable stack */
181 181 caddr_t stack_noexec_argsp = (caddr_t)&stack_noexec_crargs; /* noexec stack */
182 182
183 183 #define vpgtob(n) ((n) * sizeof (struct vpage)) /* For brevity */
184 184
185 185 size_t segvn_comb_thrshld = UINT_MAX; /* patchable -- see 1196681 */
186 186
187 187 size_t segvn_pglock_comb_thrshld = (1UL << 16); /* 64K */
188 188 size_t segvn_pglock_comb_balign = (1UL << 16); /* 64K */
189 189 uint_t segvn_pglock_comb_bshift;
190 190 size_t segvn_pglock_comb_palign;
191 191
192 192 static int segvn_concat(struct seg *, struct seg *, int);
193 193 static int segvn_extend_prev(struct seg *, struct seg *,
194 194 struct segvn_crargs *, size_t);
195 195 static int segvn_extend_next(struct seg *, struct seg *,
196 196 struct segvn_crargs *, size_t);
197 197 static void segvn_softunlock(struct seg *, caddr_t, size_t, enum seg_rw);
198 198 static void segvn_pagelist_rele(page_t **);
199 199 static void segvn_setvnode_mpss(vnode_t *);
200 200 static void segvn_relocate_pages(page_t **, page_t *);
201 201 static int segvn_full_szcpages(page_t **, uint_t, int *, uint_t *);
202 202 static int segvn_fill_vp_pages(struct segvn_data *, vnode_t *, u_offset_t,
203 203 uint_t, page_t **, page_t **, uint_t *, int *);
204 204 static faultcode_t segvn_fault_vnodepages(struct hat *, struct seg *, caddr_t,
205 205 caddr_t, enum fault_type, enum seg_rw, caddr_t, caddr_t, int);
206 206 static faultcode_t segvn_fault_anonpages(struct hat *, struct seg *, caddr_t,
207 207 caddr_t, enum fault_type, enum seg_rw, caddr_t, caddr_t, int);
208 208 static faultcode_t segvn_faultpage(struct hat *, struct seg *, caddr_t,
209 209 u_offset_t, struct vpage *, page_t **, uint_t,
210 210 enum fault_type, enum seg_rw, int);
211 211 static void segvn_vpage(struct seg *);
212 212 static size_t segvn_count_swap_by_vpages(struct seg *);
213 213
214 214 static void segvn_purge(struct seg *seg);
215 215 static int segvn_reclaim(void *, caddr_t, size_t, struct page **,
216 216 enum seg_rw, int);
217 217 static int shamp_reclaim(void *, caddr_t, size_t, struct page **,
218 218 enum seg_rw, int);
219 219
220 220 static int sameprot(struct seg *, caddr_t, size_t);
221 221
222 222 static int segvn_demote_range(struct seg *, caddr_t, size_t, int, uint_t);
223 223 static int segvn_clrszc(struct seg *);
224 224 static struct seg *segvn_split_seg(struct seg *, caddr_t);
225 225 static int segvn_claim_pages(struct seg *, struct vpage *, u_offset_t,
226 226 ulong_t, uint_t);
227 227
228 228 static void segvn_hat_rgn_unload_callback(caddr_t, caddr_t, caddr_t,
229 229 size_t, void *, u_offset_t);
230 230
231 231 static struct kmem_cache *segvn_cache;
232 232 static struct kmem_cache **segvn_szc_cache;
233 233
234 234 #ifdef VM_STATS
235 235 static struct segvnvmstats_str {
236 236 ulong_t fill_vp_pages[31];
237 237 ulong_t fltvnpages[49];
238 238 ulong_t fullszcpages[10];
239 239 ulong_t relocatepages[3];
240 240 ulong_t fltanpages[17];
241 241 ulong_t pagelock[2];
242 242 ulong_t demoterange[3];
243 243 } segvnvmstats;
244 244 #endif /* VM_STATS */
245 245
246 246 #define SDR_RANGE 1 /* demote entire range */
247 247 #define SDR_END 2 /* demote non aligned ends only */
248 248
249 249 #define CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr) { \
250 250 if ((len) != 0) { \
251 251 lpgaddr = (caddr_t)P2ALIGN((uintptr_t)(addr), pgsz); \
252 252 ASSERT(lpgaddr >= (seg)->s_base); \
253 253 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)((addr) + \
254 254 (len)), pgsz); \
255 255 ASSERT(lpgeaddr > lpgaddr); \
256 256 ASSERT(lpgeaddr <= (seg)->s_base + (seg)->s_size); \
257 257 } else { \
258 258 lpgeaddr = lpgaddr = (addr); \
259 259 } \
260 260 }
261 261
262 262 /*ARGSUSED*/
263 263 static int
264 264 segvn_cache_constructor(void *buf, void *cdrarg, int kmflags)
265 265 {
266 266 struct segvn_data *svd = buf;
267 267
268 268 rw_init(&svd->lock, NULL, RW_DEFAULT, NULL);
269 269 mutex_init(&svd->segfree_syncmtx, NULL, MUTEX_DEFAULT, NULL);
270 270 svd->svn_trnext = svd->svn_trprev = NULL;
271 271 return (0);
272 272 }
273 273
274 274 /*ARGSUSED1*/
275 275 static void
276 276 segvn_cache_destructor(void *buf, void *cdrarg)
277 277 {
278 278 struct segvn_data *svd = buf;
279 279
280 280 rw_destroy(&svd->lock);
281 281 mutex_destroy(&svd->segfree_syncmtx);
282 282 }
283 283
284 284 /*ARGSUSED*/
285 285 static int
286 286 svntr_cache_constructor(void *buf, void *cdrarg, int kmflags)
287 287 {
288 288 bzero(buf, sizeof (svntr_t));
289 289 return (0);
290 290 }
291 291
292 292 /*
293 293 * Patching this variable to non-zero allows the system to run with
294 294 * stacks marked as "not executable". It's a bit of a kludge, but is
295 295 * provided as a tweakable for platforms that export those ABIs
296 296 * (e.g. sparc V8) that have executable stacks enabled by default.
297 297 * There are also some restrictions for platforms that don't actually
298 298 * implement 'noexec' protections.
299 299 *
300 300 * Once enabled, the system is (therefore) unable to provide a fully
|
↓ open down ↓ |
300 lines elided |
↑ open up ↑ |
301 301 * ABI-compliant execution environment, though practically speaking,
302 302 * most everything works. The exceptions are generally some interpreters
303 303 * and debuggers that create executable code on the stack and jump
304 304 * into it (without explicitly mprotecting the address range to include
305 305 * PROT_EXEC).
306 306 *
307 307 * One important class of applications that are disabled are those
308 308 * that have been transformed into malicious agents using one of the
309 309 * numerous "buffer overflow" attacks. See 4007890.
310 310 */
311 -int noexec_user_stack = 0;
311 +volatile int noexec_user_stack = 0;
312 312 int noexec_user_stack_log = 1;
313 313
314 314 int segvn_lpg_disable = 0;
315 315 uint_t segvn_maxpgszc = 0;
316 316
317 317 ulong_t segvn_vmpss_clrszc_cnt;
318 318 ulong_t segvn_vmpss_clrszc_err;
319 319 ulong_t segvn_fltvnpages_clrszc_cnt;
320 320 ulong_t segvn_fltvnpages_clrszc_err;
321 321 ulong_t segvn_setpgsz_align_err;
322 322 ulong_t segvn_setpgsz_anon_align_err;
323 323 ulong_t segvn_setpgsz_getattr_err;
324 324 ulong_t segvn_setpgsz_eof_err;
325 325 ulong_t segvn_faultvnmpss_align_err1;
326 326 ulong_t segvn_faultvnmpss_align_err2;
327 327 ulong_t segvn_faultvnmpss_align_err3;
328 328 ulong_t segvn_faultvnmpss_align_err4;
329 329 ulong_t segvn_faultvnmpss_align_err5;
330 330 ulong_t segvn_vmpss_pageio_deadlk_err;
331 331
332 332 int segvn_use_regions = 1;
333 333
334 334 /*
335 335 * Segvn supports text replication optimization for NUMA platforms. Text
336 336 * replica's are represented by anon maps (amp). There's one amp per text file
337 337 * region per lgroup. A process chooses the amp for each of its text mappings
338 338 * based on the lgroup assignment of its main thread (t_tid = 1). All
339 339 * processes that want a replica on a particular lgroup for the same text file
340 340 * mapping share the same amp. amp's are looked up in svntr_hashtab hash table
341 341 * with vp,off,size,szc used as a key. Text replication segments are read only
342 342 * MAP_PRIVATE|MAP_TEXT segments that map vnode. Replication is achieved by
343 343 * forcing COW faults from vnode to amp and mapping amp pages instead of vnode
344 344 * pages. Replication amp is assigned to a segment when it gets its first
345 345 * pagefault. To handle main thread lgroup rehoming segvn_trasync_thread
346 346 * rechecks periodically if the process still maps an amp local to the main
347 347 * thread. If not async thread forces process to remap to an amp in the new
348 348 * home lgroup of the main thread. Current text replication implementation
349 349 * only provides the benefit to workloads that do most of their work in the
350 350 * main thread of a process or all the threads of a process run in the same
351 351 * lgroup. To extend text replication benefit to different types of
352 352 * multithreaded workloads further work would be needed in the hat layer to
353 353 * allow the same virtual address in the same hat to simultaneously map
354 354 * different physical addresses (i.e. page table replication would be needed
355 355 * for x86).
356 356 *
357 357 * amp pages are used instead of vnode pages as long as segment has a very
358 358 * simple life cycle. It's created via segvn_create(), handles S_EXEC
359 359 * (S_READ) pagefaults and is fully unmapped. If anything more complicated
360 360 * happens such as protection is changed, real COW fault happens, pagesize is
361 361 * changed, MC_LOCK is requested or segment is partially unmapped we turn off
362 362 * text replication by converting the segment back to vnode only segment
363 363 * (unmap segment's address range and set svd->amp to NULL).
364 364 *
365 365 * The original file can be changed after amp is inserted into
366 366 * svntr_hashtab. Processes that are launched after the file is already
367 367 * changed can't use the replica's created prior to the file change. To
368 368 * implement this functionality hash entries are timestamped. Replica's can
369 369 * only be used if current file modification time is the same as the timestamp
370 370 * saved when hash entry was created. However just timestamps alone are not
371 371 * sufficient to detect file modification via mmap(MAP_SHARED) mappings. We
372 372 * deal with file changes via MAP_SHARED mappings differently. When writable
373 373 * MAP_SHARED mappings are created to vnodes marked as executable we mark all
374 374 * existing replica's for this vnode as not usable for future text
375 375 * mappings. And we don't create new replica's for files that currently have
376 376 * potentially writable MAP_SHARED mappings (i.e. vn_is_mapped(V_WRITE) is
377 377 * true).
378 378 */
379 379
380 380 #define SEGVN_TEXTREPL_MAXBYTES_FACTOR (20)
381 381 size_t segvn_textrepl_max_bytes_factor = SEGVN_TEXTREPL_MAXBYTES_FACTOR;
382 382
383 383 static ulong_t svntr_hashtab_sz = 512;
384 384 static svntr_bucket_t *svntr_hashtab = NULL;
385 385 static struct kmem_cache *svntr_cache;
386 386 static svntr_stats_t *segvn_textrepl_stats;
387 387 static ksema_t segvn_trasync_sem;
388 388
389 389 int segvn_disable_textrepl = 1;
390 390 size_t textrepl_size_thresh = (size_t)-1;
391 391 size_t segvn_textrepl_bytes = 0;
392 392 size_t segvn_textrepl_max_bytes = 0;
393 393 clock_t segvn_update_textrepl_interval = 0;
394 394 int segvn_update_tr_time = 10;
395 395 int segvn_disable_textrepl_update = 0;
396 396
397 397 static void segvn_textrepl(struct seg *);
398 398 static void segvn_textunrepl(struct seg *, int);
399 399 static void segvn_inval_trcache(vnode_t *);
400 400 static void segvn_trasync_thread(void);
401 401 static void segvn_trupdate_wakeup(void *);
402 402 static void segvn_trupdate(void);
403 403 static void segvn_trupdate_seg(struct seg *, segvn_data_t *, svntr_t *,
404 404 ulong_t);
405 405
406 406 /*
407 407 * Initialize segvn data structures
408 408 */
409 409 void
410 410 segvn_init(void)
411 411 {
412 412 uint_t maxszc;
413 413 uint_t szc;
414 414 size_t pgsz;
415 415
416 416 segvn_cache = kmem_cache_create("segvn_cache",
417 417 sizeof (struct segvn_data), 0,
418 418 segvn_cache_constructor, segvn_cache_destructor, NULL,
419 419 NULL, NULL, 0);
420 420
421 421 if (segvn_lpg_disable == 0) {
422 422 szc = maxszc = page_num_pagesizes() - 1;
423 423 if (szc == 0) {
424 424 segvn_lpg_disable = 1;
425 425 }
426 426 if (page_get_pagesize(0) != PAGESIZE) {
427 427 panic("segvn_init: bad szc 0");
428 428 /*NOTREACHED*/
429 429 }
430 430 while (szc != 0) {
431 431 pgsz = page_get_pagesize(szc);
432 432 if (pgsz <= PAGESIZE || !IS_P2ALIGNED(pgsz, pgsz)) {
433 433 panic("segvn_init: bad szc %d", szc);
434 434 /*NOTREACHED*/
435 435 }
436 436 szc--;
437 437 }
438 438 if (segvn_maxpgszc == 0 || segvn_maxpgszc > maxszc)
439 439 segvn_maxpgszc = maxszc;
440 440 }
441 441
442 442 if (segvn_maxpgszc) {
443 443 segvn_szc_cache = (struct kmem_cache **)kmem_alloc(
444 444 (segvn_maxpgszc + 1) * sizeof (struct kmem_cache *),
445 445 KM_SLEEP);
446 446 }
447 447
448 448 for (szc = 1; szc <= segvn_maxpgszc; szc++) {
449 449 char str[32];
450 450
451 451 (void) sprintf(str, "segvn_szc_cache%d", szc);
452 452 segvn_szc_cache[szc] = kmem_cache_create(str,
453 453 page_get_pagecnt(szc) * sizeof (page_t *), 0,
454 454 NULL, NULL, NULL, NULL, NULL, KMC_NODEBUG);
455 455 }
456 456
457 457
458 458 if (segvn_use_regions && !hat_supported(HAT_SHARED_REGIONS, NULL))
459 459 segvn_use_regions = 0;
460 460
461 461 /*
462 462 * For now shared regions and text replication segvn support
463 463 * are mutually exclusive. This is acceptable because
464 464 * currently significant benefit from text replication was
465 465 * only observed on AMD64 NUMA platforms (due to relatively
466 466 * small L2$ size) and currently we don't support shared
467 467 * regions on x86.
468 468 */
469 469 if (segvn_use_regions && !segvn_disable_textrepl) {
470 470 segvn_disable_textrepl = 1;
471 471 }
472 472
473 473 #if defined(_LP64)
474 474 if (lgrp_optimizations() && textrepl_size_thresh != (size_t)-1 &&
475 475 !segvn_disable_textrepl) {
476 476 ulong_t i;
477 477 size_t hsz = svntr_hashtab_sz * sizeof (svntr_bucket_t);
478 478
479 479 svntr_cache = kmem_cache_create("svntr_cache",
480 480 sizeof (svntr_t), 0, svntr_cache_constructor, NULL,
481 481 NULL, NULL, NULL, 0);
482 482 svntr_hashtab = kmem_zalloc(hsz, KM_SLEEP);
483 483 for (i = 0; i < svntr_hashtab_sz; i++) {
484 484 mutex_init(&svntr_hashtab[i].tr_lock, NULL,
485 485 MUTEX_DEFAULT, NULL);
486 486 }
487 487 segvn_textrepl_max_bytes = ptob(physmem) /
488 488 segvn_textrepl_max_bytes_factor;
489 489 segvn_textrepl_stats = kmem_zalloc(NCPU *
490 490 sizeof (svntr_stats_t), KM_SLEEP);
491 491 sema_init(&segvn_trasync_sem, 0, NULL, SEMA_DEFAULT, NULL);
492 492 (void) thread_create(NULL, 0, segvn_trasync_thread,
493 493 NULL, 0, &p0, TS_RUN, minclsyspri);
494 494 }
495 495 #endif
496 496
497 497 if (!ISP2(segvn_pglock_comb_balign) ||
498 498 segvn_pglock_comb_balign < PAGESIZE) {
499 499 segvn_pglock_comb_balign = 1UL << 16; /* 64K */
500 500 }
501 501 segvn_pglock_comb_bshift = highbit(segvn_pglock_comb_balign) - 1;
502 502 segvn_pglock_comb_palign = btop(segvn_pglock_comb_balign);
503 503 }
504 504
505 505 #define SEGVN_PAGEIO ((void *)0x1)
506 506 #define SEGVN_NOPAGEIO ((void *)0x2)
507 507
508 508 static void
509 509 segvn_setvnode_mpss(vnode_t *vp)
510 510 {
511 511 int err;
512 512
513 513 ASSERT(vp->v_mpssdata == NULL ||
514 514 vp->v_mpssdata == SEGVN_PAGEIO ||
515 515 vp->v_mpssdata == SEGVN_NOPAGEIO);
516 516
517 517 if (vp->v_mpssdata == NULL) {
518 518 if (vn_vmpss_usepageio(vp)) {
519 519 err = VOP_PAGEIO(vp, (page_t *)NULL,
520 520 (u_offset_t)0, 0, 0, CRED(), NULL);
521 521 } else {
522 522 err = ENOSYS;
523 523 }
524 524 /*
525 525 * set v_mpssdata just once per vnode life
526 526 * so that it never changes.
527 527 */
528 528 mutex_enter(&vp->v_lock);
529 529 if (vp->v_mpssdata == NULL) {
530 530 if (err == EINVAL) {
531 531 vp->v_mpssdata = SEGVN_PAGEIO;
532 532 } else {
533 533 vp->v_mpssdata = SEGVN_NOPAGEIO;
534 534 }
535 535 }
536 536 mutex_exit(&vp->v_lock);
537 537 }
538 538 }
539 539
540 540 int
541 541 segvn_create(struct seg *seg, void *argsp)
542 542 {
543 543 extern lgrp_mem_policy_t lgrp_mem_default_policy;
544 544 struct segvn_crargs *a = (struct segvn_crargs *)argsp;
545 545 struct segvn_data *svd;
546 546 size_t swresv = 0;
547 547 struct cred *cred;
548 548 struct anon_map *amp;
549 549 int error = 0;
550 550 size_t pgsz;
551 551 lgrp_mem_policy_t mpolicy = lgrp_mem_default_policy;
552 552 int use_rgn = 0;
553 553 int trok = 0;
554 554
555 555 ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
556 556
557 557 if (a->type != MAP_PRIVATE && a->type != MAP_SHARED) {
558 558 panic("segvn_create type");
559 559 /*NOTREACHED*/
560 560 }
561 561
562 562 /*
563 563 * Check arguments. If a shared anon structure is given then
564 564 * it is illegal to also specify a vp.
565 565 */
566 566 if (a->amp != NULL && a->vp != NULL) {
567 567 panic("segvn_create anon_map");
568 568 /*NOTREACHED*/
569 569 }
570 570
571 571 if (a->type == MAP_PRIVATE && (a->flags & MAP_TEXT) &&
572 572 a->vp != NULL && a->prot == (PROT_USER | PROT_READ | PROT_EXEC) &&
573 573 segvn_use_regions) {
574 574 use_rgn = 1;
575 575 }
576 576
577 577 /* MAP_NORESERVE on a MAP_SHARED segment is meaningless. */
578 578 if (a->type == MAP_SHARED)
579 579 a->flags &= ~MAP_NORESERVE;
580 580
581 581 if (a->szc != 0) {
582 582 if (segvn_lpg_disable != 0 || (a->szc == AS_MAP_NO_LPOOB) ||
583 583 (a->amp != NULL && a->type == MAP_PRIVATE) ||
584 584 (a->flags & MAP_NORESERVE) || seg->s_as == &kas) {
585 585 a->szc = 0;
586 586 } else {
587 587 if (a->szc > segvn_maxpgszc)
588 588 a->szc = segvn_maxpgszc;
589 589 pgsz = page_get_pagesize(a->szc);
590 590 if (!IS_P2ALIGNED(seg->s_base, pgsz) ||
591 591 !IS_P2ALIGNED(seg->s_size, pgsz)) {
592 592 a->szc = 0;
593 593 } else if (a->vp != NULL) {
594 594 if (IS_SWAPFSVP(a->vp) || VN_ISKAS(a->vp)) {
595 595 /*
596 596 * paranoid check.
597 597 * hat_page_demote() is not supported
598 598 * on swapfs pages.
599 599 */
600 600 a->szc = 0;
601 601 } else if (map_addr_vacalign_check(seg->s_base,
602 602 a->offset & PAGEMASK)) {
603 603 a->szc = 0;
604 604 }
605 605 } else if (a->amp != NULL) {
606 606 pgcnt_t anum = btopr(a->offset);
607 607 pgcnt_t pgcnt = page_get_pagecnt(a->szc);
608 608 if (!IS_P2ALIGNED(anum, pgcnt)) {
609 609 a->szc = 0;
610 610 }
611 611 }
612 612 }
613 613 }
614 614
615 615 /*
616 616 * If segment may need private pages, reserve them now.
617 617 */
618 618 if (!(a->flags & MAP_NORESERVE) && ((a->vp == NULL && a->amp == NULL) ||
619 619 (a->type == MAP_PRIVATE && (a->prot & PROT_WRITE)))) {
620 620 if (anon_resv_zone(seg->s_size,
621 621 seg->s_as->a_proc->p_zone) == 0)
622 622 return (EAGAIN);
623 623 swresv = seg->s_size;
624 624 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
625 625 seg, swresv, 1);
626 626 }
627 627
628 628 /*
629 629 * Reserve any mapping structures that may be required.
630 630 *
631 631 * Don't do it for segments that may use regions. It's currently a
632 632 * noop in the hat implementations anyway.
633 633 */
634 634 if (!use_rgn) {
635 635 hat_map(seg->s_as->a_hat, seg->s_base, seg->s_size, HAT_MAP);
636 636 }
637 637
638 638 if (a->cred) {
639 639 cred = a->cred;
640 640 crhold(cred);
641 641 } else {
642 642 crhold(cred = CRED());
643 643 }
644 644
645 645 /* Inform the vnode of the new mapping */
646 646 if (a->vp != NULL) {
647 647 error = VOP_ADDMAP(a->vp, a->offset & PAGEMASK,
648 648 seg->s_as, seg->s_base, seg->s_size, a->prot,
649 649 a->maxprot, a->type, cred, NULL);
650 650 if (error) {
651 651 if (swresv != 0) {
652 652 anon_unresv_zone(swresv,
653 653 seg->s_as->a_proc->p_zone);
654 654 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
655 655 "anon proc:%p %lu %u", seg, swresv, 0);
656 656 }
657 657 crfree(cred);
658 658 if (!use_rgn) {
659 659 hat_unload(seg->s_as->a_hat, seg->s_base,
660 660 seg->s_size, HAT_UNLOAD_UNMAP);
661 661 }
662 662 return (error);
663 663 }
664 664 /*
665 665 * svntr_hashtab will be NULL if we support shared regions.
666 666 */
667 667 trok = ((a->flags & MAP_TEXT) &&
668 668 (seg->s_size > textrepl_size_thresh ||
669 669 (a->flags & _MAP_TEXTREPL)) &&
670 670 lgrp_optimizations() && svntr_hashtab != NULL &&
671 671 a->type == MAP_PRIVATE && swresv == 0 &&
672 672 !(a->flags & MAP_NORESERVE) &&
673 673 seg->s_as != &kas && a->vp->v_type == VREG);
674 674
675 675 ASSERT(!trok || !use_rgn);
676 676 }
677 677
678 678 /*
679 679 * MAP_NORESERVE mappings don't count towards the VSZ of a process
680 680 * until we fault the pages in.
681 681 */
682 682 if ((a->vp == NULL || a->vp->v_type != VREG) &&
683 683 a->flags & MAP_NORESERVE) {
684 684 seg->s_as->a_resvsize -= seg->s_size;
685 685 }
686 686
687 687 /*
688 688 * If more than one segment in the address space, and they're adjacent
689 689 * virtually, try to concatenate them. Don't concatenate if an
690 690 * explicit anon_map structure was supplied (e.g., SystemV shared
691 691 * memory) or if we'll use text replication for this segment.
692 692 */
693 693 if (a->amp == NULL && !use_rgn && !trok) {
694 694 struct seg *pseg, *nseg;
695 695 struct segvn_data *psvd, *nsvd;
696 696 lgrp_mem_policy_t ppolicy, npolicy;
697 697 uint_t lgrp_mem_policy_flags = 0;
698 698
699 699 /*
700 700 * Memory policy flags (lgrp_mem_policy_flags) is valid when
701 701 * extending stack/heap segments.
702 702 */
703 703 if ((a->vp == NULL) && (a->type == MAP_PRIVATE) &&
704 704 !(a->flags & MAP_NORESERVE) && (seg->s_as != &kas)) {
705 705 lgrp_mem_policy_flags = a->lgrp_mem_policy_flags;
706 706 } else {
707 707 /*
708 708 * Get policy when not extending it from another segment
709 709 */
710 710 mpolicy = lgrp_mem_policy_default(seg->s_size, a->type);
711 711 }
712 712
713 713 /*
714 714 * First, try to concatenate the previous and new segments
715 715 */
716 716 pseg = AS_SEGPREV(seg->s_as, seg);
717 717 if (pseg != NULL &&
718 718 pseg->s_base + pseg->s_size == seg->s_base &&
719 719 pseg->s_ops == &segvn_ops) {
720 720 /*
721 721 * Get memory allocation policy from previous segment.
722 722 * When extension is specified (e.g. for heap) apply
723 723 * this policy to the new segment regardless of the
724 724 * outcome of segment concatenation. Extension occurs
725 725 * for non-default policy otherwise default policy is
726 726 * used and is based on extended segment size.
727 727 */
728 728 psvd = (struct segvn_data *)pseg->s_data;
729 729 ppolicy = psvd->policy_info.mem_policy;
730 730 if (lgrp_mem_policy_flags ==
731 731 LGRP_MP_FLAG_EXTEND_UP) {
732 732 if (ppolicy != lgrp_mem_default_policy) {
733 733 mpolicy = ppolicy;
734 734 } else {
735 735 mpolicy = lgrp_mem_policy_default(
736 736 pseg->s_size + seg->s_size,
737 737 a->type);
738 738 }
739 739 }
740 740
741 741 if (mpolicy == ppolicy &&
742 742 (pseg->s_size + seg->s_size <=
743 743 segvn_comb_thrshld || psvd->amp == NULL) &&
744 744 segvn_extend_prev(pseg, seg, a, swresv) == 0) {
745 745 /*
746 746 * success! now try to concatenate
747 747 * with following seg
748 748 */
749 749 crfree(cred);
750 750 nseg = AS_SEGNEXT(pseg->s_as, pseg);
751 751 if (nseg != NULL &&
752 752 nseg != pseg &&
753 753 nseg->s_ops == &segvn_ops &&
754 754 pseg->s_base + pseg->s_size ==
755 755 nseg->s_base)
756 756 (void) segvn_concat(pseg, nseg, 0);
757 757 ASSERT(pseg->s_szc == 0 ||
758 758 (a->szc == pseg->s_szc &&
759 759 IS_P2ALIGNED(pseg->s_base, pgsz) &&
760 760 IS_P2ALIGNED(pseg->s_size, pgsz)));
761 761 return (0);
762 762 }
763 763 }
764 764
765 765 /*
766 766 * Failed, so try to concatenate with following seg
767 767 */
768 768 nseg = AS_SEGNEXT(seg->s_as, seg);
769 769 if (nseg != NULL &&
770 770 seg->s_base + seg->s_size == nseg->s_base &&
771 771 nseg->s_ops == &segvn_ops) {
772 772 /*
773 773 * Get memory allocation policy from next segment.
774 774 * When extension is specified (e.g. for stack) apply
775 775 * this policy to the new segment regardless of the
776 776 * outcome of segment concatenation. Extension occurs
777 777 * for non-default policy otherwise default policy is
778 778 * used and is based on extended segment size.
779 779 */
780 780 nsvd = (struct segvn_data *)nseg->s_data;
781 781 npolicy = nsvd->policy_info.mem_policy;
782 782 if (lgrp_mem_policy_flags ==
783 783 LGRP_MP_FLAG_EXTEND_DOWN) {
784 784 if (npolicy != lgrp_mem_default_policy) {
785 785 mpolicy = npolicy;
786 786 } else {
787 787 mpolicy = lgrp_mem_policy_default(
788 788 nseg->s_size + seg->s_size,
789 789 a->type);
790 790 }
791 791 }
792 792
793 793 if (mpolicy == npolicy &&
794 794 segvn_extend_next(seg, nseg, a, swresv) == 0) {
795 795 crfree(cred);
796 796 ASSERT(nseg->s_szc == 0 ||
797 797 (a->szc == nseg->s_szc &&
798 798 IS_P2ALIGNED(nseg->s_base, pgsz) &&
799 799 IS_P2ALIGNED(nseg->s_size, pgsz)));
800 800 return (0);
801 801 }
802 802 }
803 803 }
804 804
805 805 if (a->vp != NULL) {
806 806 VN_HOLD(a->vp);
807 807 if (a->type == MAP_SHARED)
808 808 lgrp_shm_policy_init(NULL, a->vp);
809 809 }
810 810 svd = kmem_cache_alloc(segvn_cache, KM_SLEEP);
811 811
812 812 seg->s_ops = &segvn_ops;
813 813 seg->s_data = (void *)svd;
814 814 seg->s_szc = a->szc;
815 815
816 816 svd->seg = seg;
817 817 svd->vp = a->vp;
818 818 /*
819 819 * Anonymous mappings have no backing file so the offset is meaningless.
820 820 */
821 821 svd->offset = a->vp ? (a->offset & PAGEMASK) : 0;
822 822 svd->prot = a->prot;
823 823 svd->maxprot = a->maxprot;
824 824 svd->pageprot = 0;
825 825 svd->type = a->type;
826 826 svd->vpage = NULL;
827 827 svd->cred = cred;
828 828 svd->advice = MADV_NORMAL;
829 829 svd->pageadvice = 0;
830 830 svd->flags = (ushort_t)a->flags;
831 831 svd->softlockcnt = 0;
832 832 svd->softlockcnt_sbase = 0;
833 833 svd->softlockcnt_send = 0;
834 834 svd->svn_inz = 0;
835 835 svd->rcookie = HAT_INVALID_REGION_COOKIE;
836 836 svd->pageswap = 0;
837 837
838 838 if (a->szc != 0 && a->vp != NULL) {
839 839 segvn_setvnode_mpss(a->vp);
840 840 }
841 841 if (svd->type == MAP_SHARED && svd->vp != NULL &&
842 842 (svd->vp->v_flag & VVMEXEC) && (svd->prot & PROT_WRITE)) {
843 843 ASSERT(vn_is_mapped(svd->vp, V_WRITE));
844 844 segvn_inval_trcache(svd->vp);
845 845 }
846 846
847 847 amp = a->amp;
848 848 if ((svd->amp = amp) == NULL) {
849 849 svd->anon_index = 0;
850 850 if (svd->type == MAP_SHARED) {
851 851 svd->swresv = 0;
852 852 /*
853 853 * Shared mappings to a vp need no other setup.
854 854 * If we have a shared mapping to an anon_map object
855 855 * which hasn't been allocated yet, allocate the
856 856 * struct now so that it will be properly shared
857 857 * by remembering the swap reservation there.
858 858 */
859 859 if (a->vp == NULL) {
860 860 svd->amp = anonmap_alloc(seg->s_size, swresv,
861 861 ANON_SLEEP);
862 862 svd->amp->a_szc = seg->s_szc;
863 863 }
864 864 } else {
865 865 /*
866 866 * Private mapping (with or without a vp).
867 867 * Allocate anon_map when needed.
868 868 */
869 869 svd->swresv = swresv;
870 870 }
871 871 } else {
872 872 pgcnt_t anon_num;
873 873
874 874 /*
875 875 * Mapping to an existing anon_map structure without a vp.
876 876 * For now we will insure that the segment size isn't larger
877 877 * than the size - offset gives us. Later on we may wish to
878 878 * have the anon array dynamically allocated itself so that
879 879 * we don't always have to allocate all the anon pointer slots.
880 880 * This of course involves adding extra code to check that we
881 881 * aren't trying to use an anon pointer slot beyond the end
882 882 * of the currently allocated anon array.
883 883 */
884 884 if ((amp->size - a->offset) < seg->s_size) {
885 885 panic("segvn_create anon_map size");
886 886 /*NOTREACHED*/
887 887 }
888 888
889 889 anon_num = btopr(a->offset);
890 890
891 891 if (a->type == MAP_SHARED) {
892 892 /*
893 893 * SHARED mapping to a given anon_map.
894 894 */
895 895 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
896 896 amp->refcnt++;
897 897 if (a->szc > amp->a_szc) {
898 898 amp->a_szc = a->szc;
899 899 }
900 900 ANON_LOCK_EXIT(&->a_rwlock);
901 901 svd->anon_index = anon_num;
902 902 svd->swresv = 0;
903 903 } else {
904 904 /*
905 905 * PRIVATE mapping to a given anon_map.
906 906 * Make sure that all the needed anon
907 907 * structures are created (so that we will
908 908 * share the underlying pages if nothing
909 909 * is written by this mapping) and then
910 910 * duplicate the anon array as is done
911 911 * when a privately mapped segment is dup'ed.
912 912 */
913 913 struct anon *ap;
914 914 caddr_t addr;
915 915 caddr_t eaddr;
916 916 ulong_t anon_idx;
917 917 int hat_flag = HAT_LOAD;
918 918
919 919 if (svd->flags & MAP_TEXT) {
920 920 hat_flag |= HAT_LOAD_TEXT;
921 921 }
922 922
923 923 svd->amp = anonmap_alloc(seg->s_size, 0, ANON_SLEEP);
924 924 svd->amp->a_szc = seg->s_szc;
925 925 svd->anon_index = 0;
926 926 svd->swresv = swresv;
927 927
928 928 /*
929 929 * Prevent 2 threads from allocating anon
930 930 * slots simultaneously.
931 931 */
932 932 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
933 933 eaddr = seg->s_base + seg->s_size;
934 934
935 935 for (anon_idx = anon_num, addr = seg->s_base;
936 936 addr < eaddr; addr += PAGESIZE, anon_idx++) {
937 937 page_t *pp;
938 938
939 939 if ((ap = anon_get_ptr(amp->ahp,
940 940 anon_idx)) != NULL)
941 941 continue;
942 942
943 943 /*
944 944 * Allocate the anon struct now.
945 945 * Might as well load up translation
946 946 * to the page while we're at it...
947 947 */
948 948 pp = anon_zero(seg, addr, &ap, cred);
949 949 if (ap == NULL || pp == NULL) {
950 950 panic("segvn_create anon_zero");
951 951 /*NOTREACHED*/
952 952 }
953 953
954 954 /*
955 955 * Re-acquire the anon_map lock and
956 956 * initialize the anon array entry.
957 957 */
958 958 ASSERT(anon_get_ptr(amp->ahp,
959 959 anon_idx) == NULL);
960 960 (void) anon_set_ptr(amp->ahp, anon_idx, ap,
961 961 ANON_SLEEP);
962 962
963 963 ASSERT(seg->s_szc == 0);
964 964 ASSERT(!IS_VMODSORT(pp->p_vnode));
965 965
966 966 ASSERT(use_rgn == 0);
967 967 hat_memload(seg->s_as->a_hat, addr, pp,
968 968 svd->prot & ~PROT_WRITE, hat_flag);
969 969
970 970 page_unlock(pp);
971 971 }
972 972 ASSERT(seg->s_szc == 0);
973 973 anon_dup(amp->ahp, anon_num, svd->amp->ahp,
974 974 0, seg->s_size);
975 975 ANON_LOCK_EXIT(&->a_rwlock);
976 976 }
977 977 }
978 978
979 979 /*
980 980 * Set default memory allocation policy for segment
981 981 *
982 982 * Always set policy for private memory at least for initialization
983 983 * even if this is a shared memory segment
984 984 */
985 985 (void) lgrp_privm_policy_set(mpolicy, &svd->policy_info, seg->s_size);
986 986
987 987 if (svd->type == MAP_SHARED)
988 988 (void) lgrp_shm_policy_set(mpolicy, svd->amp, svd->anon_index,
989 989 svd->vp, svd->offset, seg->s_size);
990 990
991 991 if (use_rgn) {
992 992 ASSERT(!trok);
993 993 ASSERT(svd->amp == NULL);
994 994 svd->rcookie = hat_join_region(seg->s_as->a_hat, seg->s_base,
995 995 seg->s_size, (void *)svd->vp, svd->offset, svd->prot,
996 996 (uchar_t)seg->s_szc, segvn_hat_rgn_unload_callback,
997 997 HAT_REGION_TEXT);
998 998 }
999 999
1000 1000 ASSERT(!trok || !(svd->prot & PROT_WRITE));
1001 1001 svd->tr_state = trok ? SEGVN_TR_INIT : SEGVN_TR_OFF;
1002 1002
1003 1003 return (0);
1004 1004 }
1005 1005
1006 1006 /*
1007 1007 * Concatenate two existing segments, if possible.
1008 1008 * Return 0 on success, -1 if two segments are not compatible
1009 1009 * or -2 on memory allocation failure.
1010 1010 * If amp_cat == 1 then try and concat segments with anon maps
1011 1011 */
1012 1012 static int
1013 1013 segvn_concat(struct seg *seg1, struct seg *seg2, int amp_cat)
1014 1014 {
1015 1015 struct segvn_data *svd1 = seg1->s_data;
1016 1016 struct segvn_data *svd2 = seg2->s_data;
1017 1017 struct anon_map *amp1 = svd1->amp;
1018 1018 struct anon_map *amp2 = svd2->amp;
1019 1019 struct vpage *vpage1 = svd1->vpage;
1020 1020 struct vpage *vpage2 = svd2->vpage, *nvpage = NULL;
1021 1021 size_t size, nvpsize;
1022 1022 pgcnt_t npages1, npages2;
1023 1023
1024 1024 ASSERT(seg1->s_as && seg2->s_as && seg1->s_as == seg2->s_as);
1025 1025 ASSERT(AS_WRITE_HELD(seg1->s_as));
1026 1026 ASSERT(seg1->s_ops == seg2->s_ops);
1027 1027
1028 1028 if (HAT_IS_REGION_COOKIE_VALID(svd1->rcookie) ||
1029 1029 HAT_IS_REGION_COOKIE_VALID(svd2->rcookie)) {
1030 1030 return (-1);
1031 1031 }
1032 1032
1033 1033 /* both segments exist, try to merge them */
1034 1034 #define incompat(x) (svd1->x != svd2->x)
1035 1035 if (incompat(vp) || incompat(maxprot) ||
1036 1036 (!svd1->pageadvice && !svd2->pageadvice && incompat(advice)) ||
1037 1037 (!svd1->pageprot && !svd2->pageprot && incompat(prot)) ||
1038 1038 incompat(type) || incompat(cred) || incompat(flags) ||
1039 1039 seg1->s_szc != seg2->s_szc || incompat(policy_info.mem_policy) ||
1040 1040 (svd2->softlockcnt > 0) || svd1->softlockcnt_send > 0)
1041 1041 return (-1);
1042 1042 #undef incompat
1043 1043
1044 1044 /*
1045 1045 * vp == NULL implies zfod, offset doesn't matter
1046 1046 */
1047 1047 if (svd1->vp != NULL &&
1048 1048 svd1->offset + seg1->s_size != svd2->offset) {
1049 1049 return (-1);
1050 1050 }
1051 1051
1052 1052 /*
1053 1053 * Don't concatenate if either segment uses text replication.
1054 1054 */
1055 1055 if (svd1->tr_state != SEGVN_TR_OFF || svd2->tr_state != SEGVN_TR_OFF) {
1056 1056 return (-1);
1057 1057 }
1058 1058
1059 1059 /*
1060 1060 * Fail early if we're not supposed to concatenate
1061 1061 * segments with non NULL amp.
1062 1062 */
1063 1063 if (amp_cat == 0 && (amp1 != NULL || amp2 != NULL)) {
1064 1064 return (-1);
1065 1065 }
1066 1066
1067 1067 if (svd1->vp == NULL && svd1->type == MAP_SHARED) {
1068 1068 if (amp1 != amp2) {
1069 1069 return (-1);
1070 1070 }
1071 1071 if (amp1 != NULL && svd1->anon_index + btop(seg1->s_size) !=
1072 1072 svd2->anon_index) {
1073 1073 return (-1);
1074 1074 }
1075 1075 ASSERT(amp1 == NULL || amp1->refcnt >= 2);
1076 1076 }
1077 1077
1078 1078 /*
1079 1079 * If either seg has vpages, create a new merged vpage array.
1080 1080 */
1081 1081 if (vpage1 != NULL || vpage2 != NULL) {
1082 1082 struct vpage *vp, *evp;
1083 1083
1084 1084 npages1 = seg_pages(seg1);
1085 1085 npages2 = seg_pages(seg2);
1086 1086 nvpsize = vpgtob(npages1 + npages2);
1087 1087
1088 1088 if ((nvpage = kmem_zalloc(nvpsize, KM_NOSLEEP)) == NULL) {
1089 1089 return (-2);
1090 1090 }
1091 1091
1092 1092 if (vpage1 != NULL) {
1093 1093 bcopy(vpage1, nvpage, vpgtob(npages1));
1094 1094 } else {
1095 1095 evp = nvpage + npages1;
1096 1096 for (vp = nvpage; vp < evp; vp++) {
1097 1097 VPP_SETPROT(vp, svd1->prot);
1098 1098 VPP_SETADVICE(vp, svd1->advice);
1099 1099 }
1100 1100 }
1101 1101
1102 1102 if (vpage2 != NULL) {
1103 1103 bcopy(vpage2, nvpage + npages1, vpgtob(npages2));
1104 1104 } else {
1105 1105 evp = nvpage + npages1 + npages2;
1106 1106 for (vp = nvpage + npages1; vp < evp; vp++) {
1107 1107 VPP_SETPROT(vp, svd2->prot);
1108 1108 VPP_SETADVICE(vp, svd2->advice);
1109 1109 }
1110 1110 }
1111 1111
1112 1112 if (svd2->pageswap && (!svd1->pageswap && svd1->swresv)) {
1113 1113 ASSERT(svd1->swresv == seg1->s_size);
1114 1114 ASSERT(!(svd1->flags & MAP_NORESERVE));
1115 1115 ASSERT(!(svd2->flags & MAP_NORESERVE));
1116 1116 evp = nvpage + npages1;
1117 1117 for (vp = nvpage; vp < evp; vp++) {
1118 1118 VPP_SETSWAPRES(vp);
1119 1119 }
1120 1120 }
1121 1121
1122 1122 if (svd1->pageswap && (!svd2->pageswap && svd2->swresv)) {
1123 1123 ASSERT(svd2->swresv == seg2->s_size);
1124 1124 ASSERT(!(svd1->flags & MAP_NORESERVE));
1125 1125 ASSERT(!(svd2->flags & MAP_NORESERVE));
1126 1126 vp = nvpage + npages1;
1127 1127 evp = vp + npages2;
1128 1128 for (; vp < evp; vp++) {
1129 1129 VPP_SETSWAPRES(vp);
1130 1130 }
1131 1131 }
1132 1132 }
1133 1133 ASSERT((vpage1 != NULL || vpage2 != NULL) ||
1134 1134 (svd1->pageswap == 0 && svd2->pageswap == 0));
1135 1135
1136 1136 /*
1137 1137 * If either segment has private pages, create a new merged anon
1138 1138 * array. If mergeing shared anon segments just decrement anon map's
1139 1139 * refcnt.
1140 1140 */
1141 1141 if (amp1 != NULL && svd1->type == MAP_SHARED) {
1142 1142 ASSERT(amp1 == amp2 && svd1->vp == NULL);
1143 1143 ANON_LOCK_ENTER(&1->a_rwlock, RW_WRITER);
1144 1144 ASSERT(amp1->refcnt >= 2);
1145 1145 amp1->refcnt--;
1146 1146 ANON_LOCK_EXIT(&1->a_rwlock);
1147 1147 svd2->amp = NULL;
1148 1148 } else if (amp1 != NULL || amp2 != NULL) {
1149 1149 struct anon_hdr *nahp;
1150 1150 struct anon_map *namp = NULL;
1151 1151 size_t asize;
1152 1152
1153 1153 ASSERT(svd1->type == MAP_PRIVATE);
1154 1154
1155 1155 asize = seg1->s_size + seg2->s_size;
1156 1156 if ((nahp = anon_create(btop(asize), ANON_NOSLEEP)) == NULL) {
1157 1157 if (nvpage != NULL) {
1158 1158 kmem_free(nvpage, nvpsize);
1159 1159 }
1160 1160 return (-2);
1161 1161 }
1162 1162 if (amp1 != NULL) {
1163 1163 /*
1164 1164 * XXX anon rwlock is not really needed because
1165 1165 * this is a private segment and we are writers.
1166 1166 */
1167 1167 ANON_LOCK_ENTER(&1->a_rwlock, RW_WRITER);
1168 1168 ASSERT(amp1->refcnt == 1);
1169 1169 if (anon_copy_ptr(amp1->ahp, svd1->anon_index,
1170 1170 nahp, 0, btop(seg1->s_size), ANON_NOSLEEP)) {
1171 1171 anon_release(nahp, btop(asize));
1172 1172 ANON_LOCK_EXIT(&1->a_rwlock);
1173 1173 if (nvpage != NULL) {
1174 1174 kmem_free(nvpage, nvpsize);
1175 1175 }
1176 1176 return (-2);
1177 1177 }
1178 1178 }
1179 1179 if (amp2 != NULL) {
1180 1180 ANON_LOCK_ENTER(&2->a_rwlock, RW_WRITER);
1181 1181 ASSERT(amp2->refcnt == 1);
1182 1182 if (anon_copy_ptr(amp2->ahp, svd2->anon_index,
1183 1183 nahp, btop(seg1->s_size), btop(seg2->s_size),
1184 1184 ANON_NOSLEEP)) {
1185 1185 anon_release(nahp, btop(asize));
1186 1186 ANON_LOCK_EXIT(&2->a_rwlock);
1187 1187 if (amp1 != NULL) {
1188 1188 ANON_LOCK_EXIT(&1->a_rwlock);
1189 1189 }
1190 1190 if (nvpage != NULL) {
1191 1191 kmem_free(nvpage, nvpsize);
1192 1192 }
1193 1193 return (-2);
1194 1194 }
1195 1195 }
1196 1196 if (amp1 != NULL) {
1197 1197 namp = amp1;
1198 1198 anon_release(amp1->ahp, btop(amp1->size));
1199 1199 }
1200 1200 if (amp2 != NULL) {
1201 1201 if (namp == NULL) {
1202 1202 ASSERT(amp1 == NULL);
1203 1203 namp = amp2;
1204 1204 anon_release(amp2->ahp, btop(amp2->size));
1205 1205 } else {
1206 1206 amp2->refcnt--;
1207 1207 ANON_LOCK_EXIT(&2->a_rwlock);
1208 1208 anonmap_free(amp2);
1209 1209 }
1210 1210 svd2->amp = NULL; /* needed for seg_free */
1211 1211 }
1212 1212 namp->ahp = nahp;
1213 1213 namp->size = asize;
1214 1214 svd1->amp = namp;
1215 1215 svd1->anon_index = 0;
1216 1216 ANON_LOCK_EXIT(&namp->a_rwlock);
1217 1217 }
1218 1218 /*
1219 1219 * Now free the old vpage structures.
1220 1220 */
1221 1221 if (nvpage != NULL) {
1222 1222 if (vpage1 != NULL) {
1223 1223 kmem_free(vpage1, vpgtob(npages1));
1224 1224 }
1225 1225 if (vpage2 != NULL) {
1226 1226 svd2->vpage = NULL;
1227 1227 kmem_free(vpage2, vpgtob(npages2));
1228 1228 }
1229 1229 if (svd2->pageprot) {
1230 1230 svd1->pageprot = 1;
1231 1231 }
1232 1232 if (svd2->pageadvice) {
1233 1233 svd1->pageadvice = 1;
1234 1234 }
1235 1235 if (svd2->pageswap) {
1236 1236 svd1->pageswap = 1;
1237 1237 }
1238 1238 svd1->vpage = nvpage;
1239 1239 }
1240 1240
1241 1241 /* all looks ok, merge segments */
1242 1242 svd1->swresv += svd2->swresv;
1243 1243 svd2->swresv = 0; /* so seg_free doesn't release swap space */
1244 1244 size = seg2->s_size;
1245 1245 seg_free(seg2);
1246 1246 seg1->s_size += size;
1247 1247 return (0);
1248 1248 }
1249 1249
1250 1250 /*
1251 1251 * Extend the previous segment (seg1) to include the
1252 1252 * new segment (seg2 + a), if possible.
1253 1253 * Return 0 on success.
1254 1254 */
1255 1255 static int
1256 1256 segvn_extend_prev(seg1, seg2, a, swresv)
1257 1257 struct seg *seg1, *seg2;
1258 1258 struct segvn_crargs *a;
1259 1259 size_t swresv;
1260 1260 {
1261 1261 struct segvn_data *svd1 = (struct segvn_data *)seg1->s_data;
1262 1262 size_t size;
1263 1263 struct anon_map *amp1;
1264 1264 struct vpage *new_vpage;
1265 1265
1266 1266 /*
1267 1267 * We don't need any segment level locks for "segvn" data
1268 1268 * since the address space is "write" locked.
1269 1269 */
1270 1270 ASSERT(seg1->s_as && AS_WRITE_HELD(seg1->s_as));
1271 1271
1272 1272 if (HAT_IS_REGION_COOKIE_VALID(svd1->rcookie)) {
1273 1273 return (-1);
1274 1274 }
1275 1275
1276 1276 /* second segment is new, try to extend first */
1277 1277 /* XXX - should also check cred */
1278 1278 if (svd1->vp != a->vp || svd1->maxprot != a->maxprot ||
1279 1279 (!svd1->pageprot && (svd1->prot != a->prot)) ||
1280 1280 svd1->type != a->type || svd1->flags != a->flags ||
1281 1281 seg1->s_szc != a->szc || svd1->softlockcnt_send > 0)
1282 1282 return (-1);
1283 1283
1284 1284 /* vp == NULL implies zfod, offset doesn't matter */
1285 1285 if (svd1->vp != NULL &&
1286 1286 svd1->offset + seg1->s_size != (a->offset & PAGEMASK))
1287 1287 return (-1);
1288 1288
1289 1289 if (svd1->tr_state != SEGVN_TR_OFF) {
1290 1290 return (-1);
1291 1291 }
1292 1292
1293 1293 amp1 = svd1->amp;
1294 1294 if (amp1) {
1295 1295 pgcnt_t newpgs;
1296 1296
1297 1297 /*
1298 1298 * Segment has private pages, can data structures
1299 1299 * be expanded?
1300 1300 *
1301 1301 * Acquire the anon_map lock to prevent it from changing,
1302 1302 * if it is shared. This ensures that the anon_map
1303 1303 * will not change while a thread which has a read/write
1304 1304 * lock on an address space references it.
1305 1305 * XXX - Don't need the anon_map lock at all if "refcnt"
1306 1306 * is 1.
1307 1307 *
1308 1308 * Can't grow a MAP_SHARED segment with an anonmap because
1309 1309 * there may be existing anon slots where we want to extend
1310 1310 * the segment and we wouldn't know what to do with them
1311 1311 * (e.g., for tmpfs right thing is to just leave them there,
1312 1312 * for /dev/zero they should be cleared out).
1313 1313 */
1314 1314 if (svd1->type == MAP_SHARED)
1315 1315 return (-1);
1316 1316
1317 1317 ANON_LOCK_ENTER(&1->a_rwlock, RW_WRITER);
1318 1318 if (amp1->refcnt > 1) {
1319 1319 ANON_LOCK_EXIT(&1->a_rwlock);
1320 1320 return (-1);
1321 1321 }
1322 1322 newpgs = anon_grow(amp1->ahp, &svd1->anon_index,
1323 1323 btop(seg1->s_size), btop(seg2->s_size), ANON_NOSLEEP);
1324 1324
1325 1325 if (newpgs == 0) {
1326 1326 ANON_LOCK_EXIT(&1->a_rwlock);
1327 1327 return (-1);
1328 1328 }
1329 1329 amp1->size = ptob(newpgs);
1330 1330 ANON_LOCK_EXIT(&1->a_rwlock);
1331 1331 }
1332 1332 if (svd1->vpage != NULL) {
1333 1333 struct vpage *vp, *evp;
1334 1334 new_vpage =
1335 1335 kmem_zalloc(vpgtob(seg_pages(seg1) + seg_pages(seg2)),
1336 1336 KM_NOSLEEP);
1337 1337 if (new_vpage == NULL)
1338 1338 return (-1);
1339 1339 bcopy(svd1->vpage, new_vpage, vpgtob(seg_pages(seg1)));
1340 1340 kmem_free(svd1->vpage, vpgtob(seg_pages(seg1)));
1341 1341 svd1->vpage = new_vpage;
1342 1342
1343 1343 vp = new_vpage + seg_pages(seg1);
1344 1344 evp = vp + seg_pages(seg2);
1345 1345 for (; vp < evp; vp++)
1346 1346 VPP_SETPROT(vp, a->prot);
1347 1347 if (svd1->pageswap && swresv) {
1348 1348 ASSERT(!(svd1->flags & MAP_NORESERVE));
1349 1349 ASSERT(swresv == seg2->s_size);
1350 1350 vp = new_vpage + seg_pages(seg1);
1351 1351 for (; vp < evp; vp++) {
1352 1352 VPP_SETSWAPRES(vp);
1353 1353 }
1354 1354 }
1355 1355 }
1356 1356 ASSERT(svd1->vpage != NULL || svd1->pageswap == 0);
1357 1357 size = seg2->s_size;
1358 1358 seg_free(seg2);
1359 1359 seg1->s_size += size;
1360 1360 svd1->swresv += swresv;
1361 1361 if (svd1->pageprot && (a->prot & PROT_WRITE) &&
1362 1362 svd1->type == MAP_SHARED && svd1->vp != NULL &&
1363 1363 (svd1->vp->v_flag & VVMEXEC)) {
1364 1364 ASSERT(vn_is_mapped(svd1->vp, V_WRITE));
1365 1365 segvn_inval_trcache(svd1->vp);
1366 1366 }
1367 1367 return (0);
1368 1368 }
1369 1369
1370 1370 /*
1371 1371 * Extend the next segment (seg2) to include the
1372 1372 * new segment (seg1 + a), if possible.
1373 1373 * Return 0 on success.
1374 1374 */
1375 1375 static int
1376 1376 segvn_extend_next(
1377 1377 struct seg *seg1,
1378 1378 struct seg *seg2,
1379 1379 struct segvn_crargs *a,
1380 1380 size_t swresv)
1381 1381 {
1382 1382 struct segvn_data *svd2 = (struct segvn_data *)seg2->s_data;
1383 1383 size_t size;
1384 1384 struct anon_map *amp2;
1385 1385 struct vpage *new_vpage;
1386 1386
1387 1387 /*
1388 1388 * We don't need any segment level locks for "segvn" data
1389 1389 * since the address space is "write" locked.
1390 1390 */
1391 1391 ASSERT(seg2->s_as && AS_WRITE_HELD(seg2->s_as));
1392 1392
1393 1393 if (HAT_IS_REGION_COOKIE_VALID(svd2->rcookie)) {
1394 1394 return (-1);
1395 1395 }
1396 1396
1397 1397 /* first segment is new, try to extend second */
1398 1398 /* XXX - should also check cred */
1399 1399 if (svd2->vp != a->vp || svd2->maxprot != a->maxprot ||
1400 1400 (!svd2->pageprot && (svd2->prot != a->prot)) ||
1401 1401 svd2->type != a->type || svd2->flags != a->flags ||
1402 1402 seg2->s_szc != a->szc || svd2->softlockcnt_sbase > 0)
1403 1403 return (-1);
1404 1404 /* vp == NULL implies zfod, offset doesn't matter */
1405 1405 if (svd2->vp != NULL &&
1406 1406 (a->offset & PAGEMASK) + seg1->s_size != svd2->offset)
1407 1407 return (-1);
1408 1408
1409 1409 if (svd2->tr_state != SEGVN_TR_OFF) {
1410 1410 return (-1);
1411 1411 }
1412 1412
1413 1413 amp2 = svd2->amp;
1414 1414 if (amp2) {
1415 1415 pgcnt_t newpgs;
1416 1416
1417 1417 /*
1418 1418 * Segment has private pages, can data structures
1419 1419 * be expanded?
1420 1420 *
1421 1421 * Acquire the anon_map lock to prevent it from changing,
1422 1422 * if it is shared. This ensures that the anon_map
1423 1423 * will not change while a thread which has a read/write
1424 1424 * lock on an address space references it.
1425 1425 *
1426 1426 * XXX - Don't need the anon_map lock at all if "refcnt"
1427 1427 * is 1.
1428 1428 */
1429 1429 if (svd2->type == MAP_SHARED)
1430 1430 return (-1);
1431 1431
1432 1432 ANON_LOCK_ENTER(&2->a_rwlock, RW_WRITER);
1433 1433 if (amp2->refcnt > 1) {
1434 1434 ANON_LOCK_EXIT(&2->a_rwlock);
1435 1435 return (-1);
1436 1436 }
1437 1437 newpgs = anon_grow(amp2->ahp, &svd2->anon_index,
1438 1438 btop(seg2->s_size), btop(seg1->s_size),
1439 1439 ANON_NOSLEEP | ANON_GROWDOWN);
1440 1440
1441 1441 if (newpgs == 0) {
1442 1442 ANON_LOCK_EXIT(&2->a_rwlock);
1443 1443 return (-1);
1444 1444 }
1445 1445 amp2->size = ptob(newpgs);
1446 1446 ANON_LOCK_EXIT(&2->a_rwlock);
1447 1447 }
1448 1448 if (svd2->vpage != NULL) {
1449 1449 struct vpage *vp, *evp;
1450 1450 new_vpage =
1451 1451 kmem_zalloc(vpgtob(seg_pages(seg1) + seg_pages(seg2)),
1452 1452 KM_NOSLEEP);
1453 1453 if (new_vpage == NULL) {
1454 1454 /* Not merging segments so adjust anon_index back */
1455 1455 if (amp2)
1456 1456 svd2->anon_index += seg_pages(seg1);
1457 1457 return (-1);
1458 1458 }
1459 1459 bcopy(svd2->vpage, new_vpage + seg_pages(seg1),
1460 1460 vpgtob(seg_pages(seg2)));
1461 1461 kmem_free(svd2->vpage, vpgtob(seg_pages(seg2)));
1462 1462 svd2->vpage = new_vpage;
1463 1463
1464 1464 vp = new_vpage;
1465 1465 evp = vp + seg_pages(seg1);
1466 1466 for (; vp < evp; vp++)
1467 1467 VPP_SETPROT(vp, a->prot);
1468 1468 if (svd2->pageswap && swresv) {
1469 1469 ASSERT(!(svd2->flags & MAP_NORESERVE));
1470 1470 ASSERT(swresv == seg1->s_size);
1471 1471 vp = new_vpage;
1472 1472 for (; vp < evp; vp++) {
1473 1473 VPP_SETSWAPRES(vp);
1474 1474 }
1475 1475 }
1476 1476 }
1477 1477 ASSERT(svd2->vpage != NULL || svd2->pageswap == 0);
1478 1478 size = seg1->s_size;
1479 1479 seg_free(seg1);
1480 1480 seg2->s_size += size;
1481 1481 seg2->s_base -= size;
1482 1482 svd2->offset -= size;
1483 1483 svd2->swresv += swresv;
1484 1484 if (svd2->pageprot && (a->prot & PROT_WRITE) &&
1485 1485 svd2->type == MAP_SHARED && svd2->vp != NULL &&
1486 1486 (svd2->vp->v_flag & VVMEXEC)) {
1487 1487 ASSERT(vn_is_mapped(svd2->vp, V_WRITE));
1488 1488 segvn_inval_trcache(svd2->vp);
1489 1489 }
1490 1490 return (0);
1491 1491 }
1492 1492
1493 1493 /*
1494 1494 * Duplicate all the pages in the segment. This may break COW sharing for a
1495 1495 * given page. If the page is marked with inherit zero set, then instead of
1496 1496 * duplicating the page, we zero the page.
1497 1497 */
1498 1498 static int
1499 1499 segvn_dup_pages(struct seg *seg, struct seg *newseg)
1500 1500 {
1501 1501 int error;
1502 1502 uint_t prot;
1503 1503 page_t *pp;
1504 1504 struct anon *ap, *newap;
1505 1505 size_t i;
1506 1506 caddr_t addr;
1507 1507
1508 1508 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
1509 1509 struct segvn_data *newsvd = (struct segvn_data *)newseg->s_data;
1510 1510 ulong_t old_idx = svd->anon_index;
1511 1511 ulong_t new_idx = 0;
1512 1512
1513 1513 i = btopr(seg->s_size);
1514 1514 addr = seg->s_base;
1515 1515
1516 1516 /*
1517 1517 * XXX break cow sharing using PAGESIZE
1518 1518 * pages. They will be relocated into larger
1519 1519 * pages at fault time.
1520 1520 */
1521 1521 while (i-- > 0) {
1522 1522 if ((ap = anon_get_ptr(svd->amp->ahp, old_idx)) != NULL) {
1523 1523 struct vpage *vpp;
1524 1524
1525 1525 vpp = &svd->vpage[seg_page(seg, addr)];
1526 1526
1527 1527 /*
1528 1528 * prot need not be computed below 'cause anon_private
1529 1529 * is going to ignore it anyway as child doesn't inherit
1530 1530 * pagelock from parent.
1531 1531 */
1532 1532 prot = svd->pageprot ? VPP_PROT(vpp) : svd->prot;
1533 1533
1534 1534 /*
1535 1535 * Check whether we should zero this or dup it.
1536 1536 */
1537 1537 if (svd->svn_inz == SEGVN_INZ_ALL ||
1538 1538 (svd->svn_inz == SEGVN_INZ_VPP &&
1539 1539 VPP_ISINHZERO(vpp))) {
1540 1540 pp = anon_zero(newseg, addr, &newap,
1541 1541 newsvd->cred);
1542 1542 } else {
1543 1543 page_t *anon_pl[1+1];
1544 1544 uint_t vpprot;
1545 1545 error = anon_getpage(&ap, &vpprot, anon_pl,
1546 1546 PAGESIZE, seg, addr, S_READ, svd->cred);
1547 1547 if (error != 0)
1548 1548 return (error);
1549 1549
1550 1550 pp = anon_private(&newap, newseg, addr, prot,
1551 1551 anon_pl[0], 0, newsvd->cred);
1552 1552 }
1553 1553 if (pp == NULL) {
1554 1554 return (ENOMEM);
1555 1555 }
1556 1556 (void) anon_set_ptr(newsvd->amp->ahp, new_idx, newap,
1557 1557 ANON_SLEEP);
1558 1558 page_unlock(pp);
1559 1559 }
1560 1560 addr += PAGESIZE;
1561 1561 old_idx++;
1562 1562 new_idx++;
1563 1563 }
1564 1564
1565 1565 return (0);
1566 1566 }
1567 1567
1568 1568 static int
1569 1569 segvn_dup(struct seg *seg, struct seg *newseg)
1570 1570 {
1571 1571 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
1572 1572 struct segvn_data *newsvd;
1573 1573 pgcnt_t npages = seg_pages(seg);
1574 1574 int error = 0;
1575 1575 size_t len;
1576 1576 struct anon_map *amp;
1577 1577
1578 1578 ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
1579 1579 ASSERT(newseg->s_as->a_proc->p_parent == curproc);
1580 1580
1581 1581 /*
1582 1582 * If segment has anon reserved, reserve more for the new seg.
1583 1583 * For a MAP_NORESERVE segment swresv will be a count of all the
1584 1584 * allocated anon slots; thus we reserve for the child as many slots
1585 1585 * as the parent has allocated. This semantic prevents the child or
1586 1586 * parent from dieing during a copy-on-write fault caused by trying
1587 1587 * to write a shared pre-existing anon page.
1588 1588 */
1589 1589 if ((len = svd->swresv) != 0) {
1590 1590 if (anon_resv(svd->swresv) == 0)
1591 1591 return (ENOMEM);
1592 1592
1593 1593 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
1594 1594 seg, len, 0);
1595 1595 }
1596 1596
1597 1597 newsvd = kmem_cache_alloc(segvn_cache, KM_SLEEP);
1598 1598
1599 1599 newseg->s_ops = &segvn_ops;
1600 1600 newseg->s_data = (void *)newsvd;
1601 1601 newseg->s_szc = seg->s_szc;
1602 1602
1603 1603 newsvd->seg = newseg;
1604 1604 if ((newsvd->vp = svd->vp) != NULL) {
1605 1605 VN_HOLD(svd->vp);
1606 1606 if (svd->type == MAP_SHARED)
1607 1607 lgrp_shm_policy_init(NULL, svd->vp);
1608 1608 }
1609 1609 newsvd->offset = svd->offset;
1610 1610 newsvd->prot = svd->prot;
1611 1611 newsvd->maxprot = svd->maxprot;
1612 1612 newsvd->pageprot = svd->pageprot;
1613 1613 newsvd->type = svd->type;
1614 1614 newsvd->cred = svd->cred;
1615 1615 crhold(newsvd->cred);
1616 1616 newsvd->advice = svd->advice;
1617 1617 newsvd->pageadvice = svd->pageadvice;
1618 1618 newsvd->svn_inz = svd->svn_inz;
1619 1619 newsvd->swresv = svd->swresv;
1620 1620 newsvd->pageswap = svd->pageswap;
1621 1621 newsvd->flags = svd->flags;
1622 1622 newsvd->softlockcnt = 0;
1623 1623 newsvd->softlockcnt_sbase = 0;
1624 1624 newsvd->softlockcnt_send = 0;
1625 1625 newsvd->policy_info = svd->policy_info;
1626 1626 newsvd->rcookie = HAT_INVALID_REGION_COOKIE;
1627 1627
1628 1628 if ((amp = svd->amp) == NULL || svd->tr_state == SEGVN_TR_ON) {
1629 1629 /*
1630 1630 * Not attaching to a shared anon object.
1631 1631 */
1632 1632 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie) ||
1633 1633 svd->tr_state == SEGVN_TR_OFF);
1634 1634 if (svd->tr_state == SEGVN_TR_ON) {
1635 1635 ASSERT(newsvd->vp != NULL && amp != NULL);
1636 1636 newsvd->tr_state = SEGVN_TR_INIT;
1637 1637 } else {
1638 1638 newsvd->tr_state = svd->tr_state;
1639 1639 }
1640 1640 newsvd->amp = NULL;
1641 1641 newsvd->anon_index = 0;
1642 1642 } else {
1643 1643 /* regions for now are only used on pure vnode segments */
1644 1644 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
1645 1645 ASSERT(svd->tr_state == SEGVN_TR_OFF);
1646 1646 newsvd->tr_state = SEGVN_TR_OFF;
1647 1647 if (svd->type == MAP_SHARED) {
1648 1648 ASSERT(svd->svn_inz == SEGVN_INZ_NONE);
1649 1649 newsvd->amp = amp;
1650 1650 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
1651 1651 amp->refcnt++;
1652 1652 ANON_LOCK_EXIT(&->a_rwlock);
1653 1653 newsvd->anon_index = svd->anon_index;
1654 1654 } else {
1655 1655 int reclaim = 1;
1656 1656
1657 1657 /*
1658 1658 * Allocate and initialize new anon_map structure.
1659 1659 */
1660 1660 newsvd->amp = anonmap_alloc(newseg->s_size, 0,
1661 1661 ANON_SLEEP);
1662 1662 newsvd->amp->a_szc = newseg->s_szc;
1663 1663 newsvd->anon_index = 0;
1664 1664 ASSERT(svd->svn_inz == SEGVN_INZ_NONE ||
1665 1665 svd->svn_inz == SEGVN_INZ_ALL ||
1666 1666 svd->svn_inz == SEGVN_INZ_VPP);
1667 1667
1668 1668 /*
1669 1669 * We don't have to acquire the anon_map lock
1670 1670 * for the new segment (since it belongs to an
1671 1671 * address space that is still not associated
1672 1672 * with any process), or the segment in the old
1673 1673 * address space (since all threads in it
1674 1674 * are stopped while duplicating the address space).
1675 1675 */
1676 1676
1677 1677 /*
1678 1678 * The goal of the following code is to make sure that
1679 1679 * softlocked pages do not end up as copy on write
1680 1680 * pages. This would cause problems where one
1681 1681 * thread writes to a page that is COW and a different
1682 1682 * thread in the same process has softlocked it. The
1683 1683 * softlock lock would move away from this process
1684 1684 * because the write would cause this process to get
1685 1685 * a copy (without the softlock).
1686 1686 *
1687 1687 * The strategy here is to just break the
1688 1688 * sharing on pages that could possibly be
1689 1689 * softlocked.
1690 1690 *
1691 1691 * In addition, if any pages have been marked that they
1692 1692 * should be inherited as zero, then we immediately go
1693 1693 * ahead and break COW and zero them. In the case of a
1694 1694 * softlocked page that should be inherited zero, we
1695 1695 * break COW and just get a zero page.
1696 1696 */
1697 1697 retry:
1698 1698 if (svd->softlockcnt ||
1699 1699 svd->svn_inz != SEGVN_INZ_NONE) {
1700 1700 /*
1701 1701 * The softlock count might be non zero
1702 1702 * because some pages are still stuck in the
1703 1703 * cache for lazy reclaim. Flush the cache
1704 1704 * now. This should drop the count to zero.
1705 1705 * [or there is really I/O going on to these
1706 1706 * pages]. Note, we have the writers lock so
1707 1707 * nothing gets inserted during the flush.
1708 1708 */
1709 1709 if (svd->softlockcnt && reclaim == 1) {
1710 1710 segvn_purge(seg);
1711 1711 reclaim = 0;
1712 1712 goto retry;
1713 1713 }
1714 1714
1715 1715 error = segvn_dup_pages(seg, newseg);
1716 1716 if (error != 0) {
1717 1717 newsvd->vpage = NULL;
1718 1718 goto out;
1719 1719 }
1720 1720 } else { /* common case */
1721 1721 if (seg->s_szc != 0) {
1722 1722 /*
1723 1723 * If at least one of anon slots of a
1724 1724 * large page exists then make sure
1725 1725 * all anon slots of a large page
1726 1726 * exist to avoid partial cow sharing
1727 1727 * of a large page in the future.
1728 1728 */
1729 1729 anon_dup_fill_holes(amp->ahp,
1730 1730 svd->anon_index, newsvd->amp->ahp,
1731 1731 0, seg->s_size, seg->s_szc,
1732 1732 svd->vp != NULL);
1733 1733 } else {
1734 1734 anon_dup(amp->ahp, svd->anon_index,
1735 1735 newsvd->amp->ahp, 0, seg->s_size);
1736 1736 }
1737 1737
1738 1738 hat_clrattr(seg->s_as->a_hat, seg->s_base,
1739 1739 seg->s_size, PROT_WRITE);
1740 1740 }
1741 1741 }
1742 1742 }
1743 1743 /*
1744 1744 * If necessary, create a vpage structure for the new segment.
1745 1745 * Do not copy any page lock indications.
1746 1746 */
1747 1747 if (svd->vpage != NULL) {
1748 1748 uint_t i;
1749 1749 struct vpage *ovp = svd->vpage;
1750 1750 struct vpage *nvp;
1751 1751
1752 1752 nvp = newsvd->vpage =
1753 1753 kmem_alloc(vpgtob(npages), KM_SLEEP);
1754 1754 for (i = 0; i < npages; i++) {
1755 1755 *nvp = *ovp++;
1756 1756 VPP_CLRPPLOCK(nvp++);
1757 1757 }
1758 1758 } else
1759 1759 newsvd->vpage = NULL;
1760 1760
1761 1761 /* Inform the vnode of the new mapping */
1762 1762 if (newsvd->vp != NULL) {
1763 1763 error = VOP_ADDMAP(newsvd->vp, (offset_t)newsvd->offset,
1764 1764 newseg->s_as, newseg->s_base, newseg->s_size, newsvd->prot,
1765 1765 newsvd->maxprot, newsvd->type, newsvd->cred, NULL);
1766 1766 }
1767 1767 out:
1768 1768 if (error == 0 && HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
1769 1769 ASSERT(newsvd->amp == NULL);
1770 1770 ASSERT(newsvd->tr_state == SEGVN_TR_OFF);
1771 1771 newsvd->rcookie = svd->rcookie;
1772 1772 hat_dup_region(newseg->s_as->a_hat, newsvd->rcookie);
1773 1773 }
1774 1774 return (error);
1775 1775 }
1776 1776
1777 1777
1778 1778 /*
1779 1779 * callback function to invoke free_vp_pages() for only those pages actually
1780 1780 * processed by the HAT when a shared region is destroyed.
1781 1781 */
1782 1782 extern int free_pages;
1783 1783
1784 1784 static void
1785 1785 segvn_hat_rgn_unload_callback(caddr_t saddr, caddr_t eaddr, caddr_t r_saddr,
1786 1786 size_t r_size, void *r_obj, u_offset_t r_objoff)
1787 1787 {
1788 1788 u_offset_t off;
1789 1789 size_t len;
1790 1790 vnode_t *vp = (vnode_t *)r_obj;
1791 1791
1792 1792 ASSERT(eaddr > saddr);
1793 1793 ASSERT(saddr >= r_saddr);
1794 1794 ASSERT(saddr < r_saddr + r_size);
1795 1795 ASSERT(eaddr > r_saddr);
1796 1796 ASSERT(eaddr <= r_saddr + r_size);
1797 1797 ASSERT(vp != NULL);
1798 1798
1799 1799 if (!free_pages) {
1800 1800 return;
1801 1801 }
1802 1802
1803 1803 len = eaddr - saddr;
1804 1804 off = (saddr - r_saddr) + r_objoff;
1805 1805 free_vp_pages(vp, off, len);
1806 1806 }
1807 1807
1808 1808 /*
1809 1809 * callback function used by segvn_unmap to invoke free_vp_pages() for only
1810 1810 * those pages actually processed by the HAT
1811 1811 */
1812 1812 static void
1813 1813 segvn_hat_unload_callback(hat_callback_t *cb)
1814 1814 {
1815 1815 struct seg *seg = cb->hcb_data;
1816 1816 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
1817 1817 size_t len;
1818 1818 u_offset_t off;
1819 1819
1820 1820 ASSERT(svd->vp != NULL);
1821 1821 ASSERT(cb->hcb_end_addr > cb->hcb_start_addr);
1822 1822 ASSERT(cb->hcb_start_addr >= seg->s_base);
1823 1823
1824 1824 len = cb->hcb_end_addr - cb->hcb_start_addr;
1825 1825 off = cb->hcb_start_addr - seg->s_base;
1826 1826 free_vp_pages(svd->vp, svd->offset + off, len);
1827 1827 }
1828 1828
1829 1829 /*
1830 1830 * This function determines the number of bytes of swap reserved by
1831 1831 * a segment for which per-page accounting is present. It is used to
1832 1832 * calculate the correct value of a segvn_data's swresv.
1833 1833 */
1834 1834 static size_t
1835 1835 segvn_count_swap_by_vpages(struct seg *seg)
1836 1836 {
1837 1837 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
1838 1838 struct vpage *vp, *evp;
1839 1839 size_t nswappages = 0;
1840 1840
1841 1841 ASSERT(svd->pageswap);
1842 1842 ASSERT(svd->vpage != NULL);
1843 1843
1844 1844 evp = &svd->vpage[seg_page(seg, seg->s_base + seg->s_size)];
1845 1845
1846 1846 for (vp = svd->vpage; vp < evp; vp++) {
1847 1847 if (VPP_ISSWAPRES(vp))
1848 1848 nswappages++;
1849 1849 }
1850 1850
1851 1851 return (nswappages << PAGESHIFT);
1852 1852 }
1853 1853
1854 1854 static int
1855 1855 segvn_unmap(struct seg *seg, caddr_t addr, size_t len)
1856 1856 {
1857 1857 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
1858 1858 struct segvn_data *nsvd;
1859 1859 struct seg *nseg;
1860 1860 struct anon_map *amp;
1861 1861 pgcnt_t opages; /* old segment size in pages */
1862 1862 pgcnt_t npages; /* new segment size in pages */
1863 1863 pgcnt_t dpages; /* pages being deleted (unmapped) */
1864 1864 hat_callback_t callback; /* used for free_vp_pages() */
1865 1865 hat_callback_t *cbp = NULL;
1866 1866 caddr_t nbase;
1867 1867 size_t nsize;
1868 1868 size_t oswresv;
1869 1869 int reclaim = 1;
1870 1870
1871 1871 /*
1872 1872 * We don't need any segment level locks for "segvn" data
1873 1873 * since the address space is "write" locked.
1874 1874 */
1875 1875 ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
1876 1876
1877 1877 /*
1878 1878 * Fail the unmap if pages are SOFTLOCKed through this mapping.
1879 1879 * softlockcnt is protected from change by the as write lock.
1880 1880 */
1881 1881 retry:
1882 1882 if (svd->softlockcnt > 0) {
1883 1883 ASSERT(svd->tr_state == SEGVN_TR_OFF);
1884 1884
1885 1885 /*
1886 1886 * If this is shared segment non 0 softlockcnt
1887 1887 * means locked pages are still in use.
1888 1888 */
1889 1889 if (svd->type == MAP_SHARED) {
1890 1890 return (EAGAIN);
1891 1891 }
1892 1892
1893 1893 /*
1894 1894 * since we do have the writers lock nobody can fill
1895 1895 * the cache during the purge. The flush either succeeds
1896 1896 * or we still have pending I/Os.
1897 1897 */
1898 1898 if (reclaim == 1) {
1899 1899 segvn_purge(seg);
1900 1900 reclaim = 0;
1901 1901 goto retry;
1902 1902 }
1903 1903 return (EAGAIN);
1904 1904 }
1905 1905
1906 1906 /*
1907 1907 * Check for bad sizes
1908 1908 */
1909 1909 if (addr < seg->s_base || addr + len > seg->s_base + seg->s_size ||
1910 1910 (len & PAGEOFFSET) || ((uintptr_t)addr & PAGEOFFSET)) {
1911 1911 panic("segvn_unmap");
1912 1912 /*NOTREACHED*/
1913 1913 }
1914 1914
1915 1915 if (seg->s_szc != 0) {
1916 1916 size_t pgsz = page_get_pagesize(seg->s_szc);
1917 1917 int err;
1918 1918 if (!IS_P2ALIGNED(addr, pgsz) || !IS_P2ALIGNED(len, pgsz)) {
1919 1919 ASSERT(seg->s_base != addr || seg->s_size != len);
1920 1920 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
1921 1921 ASSERT(svd->amp == NULL);
1922 1922 ASSERT(svd->tr_state == SEGVN_TR_OFF);
1923 1923 hat_leave_region(seg->s_as->a_hat,
1924 1924 svd->rcookie, HAT_REGION_TEXT);
1925 1925 svd->rcookie = HAT_INVALID_REGION_COOKIE;
1926 1926 /*
1927 1927 * could pass a flag to segvn_demote_range()
1928 1928 * below to tell it not to do any unloads but
1929 1929 * this case is rare enough to not bother for
1930 1930 * now.
1931 1931 */
1932 1932 } else if (svd->tr_state == SEGVN_TR_INIT) {
1933 1933 svd->tr_state = SEGVN_TR_OFF;
1934 1934 } else if (svd->tr_state == SEGVN_TR_ON) {
1935 1935 ASSERT(svd->amp != NULL);
1936 1936 segvn_textunrepl(seg, 1);
1937 1937 ASSERT(svd->amp == NULL);
1938 1938 ASSERT(svd->tr_state == SEGVN_TR_OFF);
1939 1939 }
1940 1940 VM_STAT_ADD(segvnvmstats.demoterange[0]);
1941 1941 err = segvn_demote_range(seg, addr, len, SDR_END, 0);
1942 1942 if (err == 0) {
1943 1943 return (IE_RETRY);
1944 1944 }
1945 1945 return (err);
1946 1946 }
1947 1947 }
1948 1948
1949 1949 /* Inform the vnode of the unmapping. */
1950 1950 if (svd->vp) {
1951 1951 int error;
1952 1952
1953 1953 error = VOP_DELMAP(svd->vp,
1954 1954 (offset_t)svd->offset + (uintptr_t)(addr - seg->s_base),
1955 1955 seg->s_as, addr, len, svd->prot, svd->maxprot,
1956 1956 svd->type, svd->cred, NULL);
1957 1957
1958 1958 if (error == EAGAIN)
1959 1959 return (error);
1960 1960 }
1961 1961
1962 1962 /*
1963 1963 * Remove any page locks set through this mapping.
1964 1964 * If text replication is not off no page locks could have been
1965 1965 * established via this mapping.
1966 1966 */
1967 1967 if (svd->tr_state == SEGVN_TR_OFF) {
1968 1968 (void) segvn_lockop(seg, addr, len, 0, MC_UNLOCK, NULL, 0);
1969 1969 }
1970 1970
1971 1971 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
1972 1972 ASSERT(svd->amp == NULL);
1973 1973 ASSERT(svd->tr_state == SEGVN_TR_OFF);
1974 1974 ASSERT(svd->type == MAP_PRIVATE);
1975 1975 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
1976 1976 HAT_REGION_TEXT);
1977 1977 svd->rcookie = HAT_INVALID_REGION_COOKIE;
1978 1978 } else if (svd->tr_state == SEGVN_TR_ON) {
1979 1979 ASSERT(svd->amp != NULL);
1980 1980 ASSERT(svd->pageprot == 0 && !(svd->prot & PROT_WRITE));
1981 1981 segvn_textunrepl(seg, 1);
1982 1982 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
1983 1983 } else {
1984 1984 if (svd->tr_state != SEGVN_TR_OFF) {
1985 1985 ASSERT(svd->tr_state == SEGVN_TR_INIT);
1986 1986 svd->tr_state = SEGVN_TR_OFF;
1987 1987 }
1988 1988 /*
1989 1989 * Unload any hardware translations in the range to be taken
1990 1990 * out. Use a callback to invoke free_vp_pages() effectively.
1991 1991 */
1992 1992 if (svd->vp != NULL && free_pages != 0) {
1993 1993 callback.hcb_data = seg;
1994 1994 callback.hcb_function = segvn_hat_unload_callback;
1995 1995 cbp = &callback;
1996 1996 }
1997 1997 hat_unload_callback(seg->s_as->a_hat, addr, len,
1998 1998 HAT_UNLOAD_UNMAP, cbp);
1999 1999
2000 2000 if (svd->type == MAP_SHARED && svd->vp != NULL &&
2001 2001 (svd->vp->v_flag & VVMEXEC) &&
2002 2002 ((svd->prot & PROT_WRITE) || svd->pageprot)) {
2003 2003 segvn_inval_trcache(svd->vp);
2004 2004 }
2005 2005 }
2006 2006
2007 2007 /*
2008 2008 * Check for entire segment
2009 2009 */
2010 2010 if (addr == seg->s_base && len == seg->s_size) {
2011 2011 seg_free(seg);
2012 2012 return (0);
2013 2013 }
2014 2014
2015 2015 opages = seg_pages(seg);
2016 2016 dpages = btop(len);
2017 2017 npages = opages - dpages;
2018 2018 amp = svd->amp;
2019 2019 ASSERT(amp == NULL || amp->a_szc >= seg->s_szc);
2020 2020
2021 2021 /*
2022 2022 * Check for beginning of segment
2023 2023 */
2024 2024 if (addr == seg->s_base) {
2025 2025 if (svd->vpage != NULL) {
2026 2026 size_t nbytes;
2027 2027 struct vpage *ovpage;
2028 2028
2029 2029 ovpage = svd->vpage; /* keep pointer to vpage */
2030 2030
2031 2031 nbytes = vpgtob(npages);
2032 2032 svd->vpage = kmem_alloc(nbytes, KM_SLEEP);
2033 2033 bcopy(&ovpage[dpages], svd->vpage, nbytes);
2034 2034
2035 2035 /* free up old vpage */
2036 2036 kmem_free(ovpage, vpgtob(opages));
2037 2037 }
2038 2038 if (amp != NULL) {
2039 2039 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
2040 2040 if (amp->refcnt == 1 || svd->type == MAP_PRIVATE) {
2041 2041 /*
2042 2042 * Shared anon map is no longer in use. Before
2043 2043 * freeing its pages purge all entries from
2044 2044 * pcache that belong to this amp.
2045 2045 */
2046 2046 if (svd->type == MAP_SHARED) {
2047 2047 ASSERT(amp->refcnt == 1);
2048 2048 ASSERT(svd->softlockcnt == 0);
2049 2049 anonmap_purge(amp);
2050 2050 }
2051 2051 /*
2052 2052 * Free up now unused parts of anon_map array.
2053 2053 */
2054 2054 if (amp->a_szc == seg->s_szc) {
2055 2055 if (seg->s_szc != 0) {
2056 2056 anon_free_pages(amp->ahp,
2057 2057 svd->anon_index, len,
2058 2058 seg->s_szc);
2059 2059 } else {
2060 2060 anon_free(amp->ahp,
2061 2061 svd->anon_index,
2062 2062 len);
2063 2063 }
2064 2064 } else {
2065 2065 ASSERT(svd->type == MAP_SHARED);
2066 2066 ASSERT(amp->a_szc > seg->s_szc);
2067 2067 anon_shmap_free_pages(amp,
2068 2068 svd->anon_index, len);
2069 2069 }
2070 2070
2071 2071 /*
2072 2072 * Unreserve swap space for the
2073 2073 * unmapped chunk of this segment in
2074 2074 * case it's MAP_SHARED
2075 2075 */
2076 2076 if (svd->type == MAP_SHARED) {
2077 2077 anon_unresv_zone(len,
2078 2078 seg->s_as->a_proc->p_zone);
2079 2079 amp->swresv -= len;
2080 2080 }
2081 2081 }
2082 2082 ANON_LOCK_EXIT(&->a_rwlock);
2083 2083 svd->anon_index += dpages;
2084 2084 }
2085 2085 if (svd->vp != NULL)
2086 2086 svd->offset += len;
2087 2087
2088 2088 seg->s_base += len;
2089 2089 seg->s_size -= len;
2090 2090
2091 2091 if (svd->swresv) {
2092 2092 if (svd->flags & MAP_NORESERVE) {
2093 2093 ASSERT(amp);
2094 2094 oswresv = svd->swresv;
2095 2095
2096 2096 svd->swresv = ptob(anon_pages(amp->ahp,
2097 2097 svd->anon_index, npages));
2098 2098 anon_unresv_zone(oswresv - svd->swresv,
2099 2099 seg->s_as->a_proc->p_zone);
2100 2100 if (SEG_IS_PARTIAL_RESV(seg))
2101 2101 seg->s_as->a_resvsize -= oswresv -
2102 2102 svd->swresv;
2103 2103 } else {
2104 2104 size_t unlen;
2105 2105
2106 2106 if (svd->pageswap) {
2107 2107 oswresv = svd->swresv;
2108 2108 svd->swresv =
2109 2109 segvn_count_swap_by_vpages(seg);
2110 2110 ASSERT(oswresv >= svd->swresv);
2111 2111 unlen = oswresv - svd->swresv;
2112 2112 } else {
2113 2113 svd->swresv -= len;
2114 2114 ASSERT(svd->swresv == seg->s_size);
2115 2115 unlen = len;
2116 2116 }
2117 2117 anon_unresv_zone(unlen,
2118 2118 seg->s_as->a_proc->p_zone);
2119 2119 }
2120 2120 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
2121 2121 seg, len, 0);
2122 2122 }
2123 2123
2124 2124 return (0);
2125 2125 }
2126 2126
2127 2127 /*
2128 2128 * Check for end of segment
2129 2129 */
2130 2130 if (addr + len == seg->s_base + seg->s_size) {
2131 2131 if (svd->vpage != NULL) {
2132 2132 size_t nbytes;
2133 2133 struct vpage *ovpage;
2134 2134
2135 2135 ovpage = svd->vpage; /* keep pointer to vpage */
2136 2136
2137 2137 nbytes = vpgtob(npages);
2138 2138 svd->vpage = kmem_alloc(nbytes, KM_SLEEP);
2139 2139 bcopy(ovpage, svd->vpage, nbytes);
2140 2140
2141 2141 /* free up old vpage */
2142 2142 kmem_free(ovpage, vpgtob(opages));
2143 2143
2144 2144 }
2145 2145 if (amp != NULL) {
2146 2146 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
2147 2147 if (amp->refcnt == 1 || svd->type == MAP_PRIVATE) {
2148 2148 /*
2149 2149 * Free up now unused parts of anon_map array.
2150 2150 */
2151 2151 ulong_t an_idx = svd->anon_index + npages;
2152 2152
2153 2153 /*
2154 2154 * Shared anon map is no longer in use. Before
2155 2155 * freeing its pages purge all entries from
2156 2156 * pcache that belong to this amp.
2157 2157 */
2158 2158 if (svd->type == MAP_SHARED) {
2159 2159 ASSERT(amp->refcnt == 1);
2160 2160 ASSERT(svd->softlockcnt == 0);
2161 2161 anonmap_purge(amp);
2162 2162 }
2163 2163
2164 2164 if (amp->a_szc == seg->s_szc) {
2165 2165 if (seg->s_szc != 0) {
2166 2166 anon_free_pages(amp->ahp,
2167 2167 an_idx, len,
2168 2168 seg->s_szc);
2169 2169 } else {
2170 2170 anon_free(amp->ahp, an_idx,
2171 2171 len);
2172 2172 }
2173 2173 } else {
2174 2174 ASSERT(svd->type == MAP_SHARED);
2175 2175 ASSERT(amp->a_szc > seg->s_szc);
2176 2176 anon_shmap_free_pages(amp,
2177 2177 an_idx, len);
2178 2178 }
2179 2179
2180 2180 /*
2181 2181 * Unreserve swap space for the
2182 2182 * unmapped chunk of this segment in
2183 2183 * case it's MAP_SHARED
2184 2184 */
2185 2185 if (svd->type == MAP_SHARED) {
2186 2186 anon_unresv_zone(len,
2187 2187 seg->s_as->a_proc->p_zone);
2188 2188 amp->swresv -= len;
2189 2189 }
2190 2190 }
2191 2191 ANON_LOCK_EXIT(&->a_rwlock);
2192 2192 }
2193 2193
2194 2194 seg->s_size -= len;
2195 2195
2196 2196 if (svd->swresv) {
2197 2197 if (svd->flags & MAP_NORESERVE) {
2198 2198 ASSERT(amp);
2199 2199 oswresv = svd->swresv;
2200 2200 svd->swresv = ptob(anon_pages(amp->ahp,
2201 2201 svd->anon_index, npages));
2202 2202 anon_unresv_zone(oswresv - svd->swresv,
2203 2203 seg->s_as->a_proc->p_zone);
2204 2204 if (SEG_IS_PARTIAL_RESV(seg))
2205 2205 seg->s_as->a_resvsize -= oswresv -
2206 2206 svd->swresv;
2207 2207 } else {
2208 2208 size_t unlen;
2209 2209
2210 2210 if (svd->pageswap) {
2211 2211 oswresv = svd->swresv;
2212 2212 svd->swresv =
2213 2213 segvn_count_swap_by_vpages(seg);
2214 2214 ASSERT(oswresv >= svd->swresv);
2215 2215 unlen = oswresv - svd->swresv;
2216 2216 } else {
2217 2217 svd->swresv -= len;
2218 2218 ASSERT(svd->swresv == seg->s_size);
2219 2219 unlen = len;
2220 2220 }
2221 2221 anon_unresv_zone(unlen,
2222 2222 seg->s_as->a_proc->p_zone);
2223 2223 }
2224 2224 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
2225 2225 "anon proc:%p %lu %u", seg, len, 0);
2226 2226 }
2227 2227
2228 2228 return (0);
2229 2229 }
2230 2230
2231 2231 /*
2232 2232 * The section to go is in the middle of the segment,
2233 2233 * have to make it into two segments. nseg is made for
2234 2234 * the high end while seg is cut down at the low end.
2235 2235 */
2236 2236 nbase = addr + len; /* new seg base */
2237 2237 nsize = (seg->s_base + seg->s_size) - nbase; /* new seg size */
2238 2238 seg->s_size = addr - seg->s_base; /* shrink old seg */
2239 2239 nseg = seg_alloc(seg->s_as, nbase, nsize);
2240 2240 if (nseg == NULL) {
2241 2241 panic("segvn_unmap seg_alloc");
2242 2242 /*NOTREACHED*/
2243 2243 }
2244 2244 nseg->s_ops = seg->s_ops;
2245 2245 nsvd = kmem_cache_alloc(segvn_cache, KM_SLEEP);
2246 2246 nseg->s_data = (void *)nsvd;
2247 2247 nseg->s_szc = seg->s_szc;
2248 2248 *nsvd = *svd;
2249 2249 nsvd->seg = nseg;
2250 2250 nsvd->offset = svd->offset + (uintptr_t)(nseg->s_base - seg->s_base);
2251 2251 nsvd->swresv = 0;
2252 2252 nsvd->softlockcnt = 0;
2253 2253 nsvd->softlockcnt_sbase = 0;
2254 2254 nsvd->softlockcnt_send = 0;
2255 2255 nsvd->svn_inz = svd->svn_inz;
2256 2256 ASSERT(nsvd->rcookie == HAT_INVALID_REGION_COOKIE);
2257 2257
2258 2258 if (svd->vp != NULL) {
2259 2259 VN_HOLD(nsvd->vp);
2260 2260 if (nsvd->type == MAP_SHARED)
2261 2261 lgrp_shm_policy_init(NULL, nsvd->vp);
2262 2262 }
2263 2263 crhold(svd->cred);
2264 2264
2265 2265 if (svd->vpage == NULL) {
2266 2266 nsvd->vpage = NULL;
2267 2267 } else {
2268 2268 /* need to split vpage into two arrays */
2269 2269 size_t nbytes;
2270 2270 struct vpage *ovpage;
2271 2271
2272 2272 ovpage = svd->vpage; /* keep pointer to vpage */
2273 2273
2274 2274 npages = seg_pages(seg); /* seg has shrunk */
2275 2275 nbytes = vpgtob(npages);
2276 2276 svd->vpage = kmem_alloc(nbytes, KM_SLEEP);
2277 2277
2278 2278 bcopy(ovpage, svd->vpage, nbytes);
2279 2279
2280 2280 npages = seg_pages(nseg);
2281 2281 nbytes = vpgtob(npages);
2282 2282 nsvd->vpage = kmem_alloc(nbytes, KM_SLEEP);
2283 2283
2284 2284 bcopy(&ovpage[opages - npages], nsvd->vpage, nbytes);
2285 2285
2286 2286 /* free up old vpage */
2287 2287 kmem_free(ovpage, vpgtob(opages));
2288 2288 }
2289 2289
2290 2290 if (amp == NULL) {
2291 2291 nsvd->amp = NULL;
2292 2292 nsvd->anon_index = 0;
2293 2293 } else {
2294 2294 /*
2295 2295 * Need to create a new anon map for the new segment.
2296 2296 * We'll also allocate a new smaller array for the old
2297 2297 * smaller segment to save space.
2298 2298 */
2299 2299 opages = btop((uintptr_t)(addr - seg->s_base));
2300 2300 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
2301 2301 if (amp->refcnt == 1 || svd->type == MAP_PRIVATE) {
2302 2302 /*
2303 2303 * Free up now unused parts of anon_map array.
2304 2304 */
2305 2305 ulong_t an_idx = svd->anon_index + opages;
2306 2306
2307 2307 /*
2308 2308 * Shared anon map is no longer in use. Before
2309 2309 * freeing its pages purge all entries from
2310 2310 * pcache that belong to this amp.
2311 2311 */
2312 2312 if (svd->type == MAP_SHARED) {
2313 2313 ASSERT(amp->refcnt == 1);
2314 2314 ASSERT(svd->softlockcnt == 0);
2315 2315 anonmap_purge(amp);
2316 2316 }
2317 2317
2318 2318 if (amp->a_szc == seg->s_szc) {
2319 2319 if (seg->s_szc != 0) {
2320 2320 anon_free_pages(amp->ahp, an_idx, len,
2321 2321 seg->s_szc);
2322 2322 } else {
2323 2323 anon_free(amp->ahp, an_idx,
2324 2324 len);
2325 2325 }
2326 2326 } else {
2327 2327 ASSERT(svd->type == MAP_SHARED);
2328 2328 ASSERT(amp->a_szc > seg->s_szc);
2329 2329 anon_shmap_free_pages(amp, an_idx, len);
2330 2330 }
2331 2331
2332 2332 /*
2333 2333 * Unreserve swap space for the
2334 2334 * unmapped chunk of this segment in
2335 2335 * case it's MAP_SHARED
2336 2336 */
2337 2337 if (svd->type == MAP_SHARED) {
2338 2338 anon_unresv_zone(len,
2339 2339 seg->s_as->a_proc->p_zone);
2340 2340 amp->swresv -= len;
2341 2341 }
2342 2342 }
2343 2343 nsvd->anon_index = svd->anon_index +
2344 2344 btop((uintptr_t)(nseg->s_base - seg->s_base));
2345 2345 if (svd->type == MAP_SHARED) {
2346 2346 amp->refcnt++;
2347 2347 nsvd->amp = amp;
2348 2348 } else {
2349 2349 struct anon_map *namp;
2350 2350 struct anon_hdr *nahp;
2351 2351
2352 2352 ASSERT(svd->type == MAP_PRIVATE);
2353 2353 nahp = anon_create(btop(seg->s_size), ANON_SLEEP);
2354 2354 namp = anonmap_alloc(nseg->s_size, 0, ANON_SLEEP);
2355 2355 namp->a_szc = seg->s_szc;
2356 2356 (void) anon_copy_ptr(amp->ahp, svd->anon_index, nahp,
2357 2357 0, btop(seg->s_size), ANON_SLEEP);
2358 2358 (void) anon_copy_ptr(amp->ahp, nsvd->anon_index,
2359 2359 namp->ahp, 0, btop(nseg->s_size), ANON_SLEEP);
2360 2360 anon_release(amp->ahp, btop(amp->size));
2361 2361 svd->anon_index = 0;
2362 2362 nsvd->anon_index = 0;
2363 2363 amp->ahp = nahp;
2364 2364 amp->size = seg->s_size;
2365 2365 nsvd->amp = namp;
2366 2366 }
2367 2367 ANON_LOCK_EXIT(&->a_rwlock);
2368 2368 }
2369 2369 if (svd->swresv) {
2370 2370 if (svd->flags & MAP_NORESERVE) {
2371 2371 ASSERT(amp);
2372 2372 oswresv = svd->swresv;
2373 2373 svd->swresv = ptob(anon_pages(amp->ahp,
2374 2374 svd->anon_index, btop(seg->s_size)));
2375 2375 nsvd->swresv = ptob(anon_pages(nsvd->amp->ahp,
2376 2376 nsvd->anon_index, btop(nseg->s_size)));
2377 2377 ASSERT(oswresv >= (svd->swresv + nsvd->swresv));
2378 2378 anon_unresv_zone(oswresv - (svd->swresv + nsvd->swresv),
2379 2379 seg->s_as->a_proc->p_zone);
2380 2380 if (SEG_IS_PARTIAL_RESV(seg))
2381 2381 seg->s_as->a_resvsize -= oswresv -
2382 2382 (svd->swresv + nsvd->swresv);
2383 2383 } else {
2384 2384 size_t unlen;
2385 2385
2386 2386 if (svd->pageswap) {
2387 2387 oswresv = svd->swresv;
2388 2388 svd->swresv = segvn_count_swap_by_vpages(seg);
2389 2389 nsvd->swresv = segvn_count_swap_by_vpages(nseg);
2390 2390 ASSERT(oswresv >= (svd->swresv + nsvd->swresv));
2391 2391 unlen = oswresv - (svd->swresv + nsvd->swresv);
2392 2392 } else {
2393 2393 if (seg->s_size + nseg->s_size + len !=
2394 2394 svd->swresv) {
2395 2395 panic("segvn_unmap: cannot split "
2396 2396 "swap reservation");
2397 2397 /*NOTREACHED*/
2398 2398 }
2399 2399 svd->swresv = seg->s_size;
2400 2400 nsvd->swresv = nseg->s_size;
2401 2401 unlen = len;
2402 2402 }
2403 2403 anon_unresv_zone(unlen,
2404 2404 seg->s_as->a_proc->p_zone);
2405 2405 }
2406 2406 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
2407 2407 seg, len, 0);
2408 2408 }
2409 2409
2410 2410 return (0); /* I'm glad that's all over with! */
2411 2411 }
2412 2412
2413 2413 static void
2414 2414 segvn_free(struct seg *seg)
2415 2415 {
2416 2416 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
2417 2417 pgcnt_t npages = seg_pages(seg);
2418 2418 struct anon_map *amp;
2419 2419 size_t len;
2420 2420
2421 2421 /*
2422 2422 * We don't need any segment level locks for "segvn" data
2423 2423 * since the address space is "write" locked.
2424 2424 */
2425 2425 ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
2426 2426 ASSERT(svd->tr_state == SEGVN_TR_OFF);
2427 2427
2428 2428 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
2429 2429
2430 2430 /*
2431 2431 * Be sure to unlock pages. XXX Why do things get free'ed instead
2432 2432 * of unmapped? XXX
2433 2433 */
2434 2434 (void) segvn_lockop(seg, seg->s_base, seg->s_size,
2435 2435 0, MC_UNLOCK, NULL, 0);
2436 2436
2437 2437 /*
2438 2438 * Deallocate the vpage and anon pointers if necessary and possible.
2439 2439 */
2440 2440 if (svd->vpage != NULL) {
2441 2441 kmem_free(svd->vpage, vpgtob(npages));
2442 2442 svd->vpage = NULL;
2443 2443 }
2444 2444 if ((amp = svd->amp) != NULL) {
2445 2445 /*
2446 2446 * If there are no more references to this anon_map
2447 2447 * structure, then deallocate the structure after freeing
2448 2448 * up all the anon slot pointers that we can.
2449 2449 */
2450 2450 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
2451 2451 ASSERT(amp->a_szc >= seg->s_szc);
2452 2452 if (--amp->refcnt == 0) {
2453 2453 if (svd->type == MAP_PRIVATE) {
2454 2454 /*
2455 2455 * Private - we only need to anon_free
2456 2456 * the part that this segment refers to.
2457 2457 */
2458 2458 if (seg->s_szc != 0) {
2459 2459 anon_free_pages(amp->ahp,
2460 2460 svd->anon_index, seg->s_size,
2461 2461 seg->s_szc);
2462 2462 } else {
2463 2463 anon_free(amp->ahp, svd->anon_index,
2464 2464 seg->s_size);
2465 2465 }
2466 2466 } else {
2467 2467
2468 2468 /*
2469 2469 * Shared anon map is no longer in use. Before
2470 2470 * freeing its pages purge all entries from
2471 2471 * pcache that belong to this amp.
2472 2472 */
2473 2473 ASSERT(svd->softlockcnt == 0);
2474 2474 anonmap_purge(amp);
2475 2475
2476 2476 /*
2477 2477 * Shared - anon_free the entire
2478 2478 * anon_map's worth of stuff and
2479 2479 * release any swap reservation.
2480 2480 */
2481 2481 if (amp->a_szc != 0) {
2482 2482 anon_shmap_free_pages(amp, 0,
2483 2483 amp->size);
2484 2484 } else {
2485 2485 anon_free(amp->ahp, 0, amp->size);
2486 2486 }
2487 2487 if ((len = amp->swresv) != 0) {
2488 2488 anon_unresv_zone(len,
2489 2489 seg->s_as->a_proc->p_zone);
2490 2490 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
2491 2491 "anon proc:%p %lu %u", seg, len, 0);
2492 2492 }
2493 2493 }
2494 2494 svd->amp = NULL;
2495 2495 ANON_LOCK_EXIT(&->a_rwlock);
2496 2496 anonmap_free(amp);
2497 2497 } else if (svd->type == MAP_PRIVATE) {
2498 2498 /*
2499 2499 * We had a private mapping which still has
2500 2500 * a held anon_map so just free up all the
2501 2501 * anon slot pointers that we were using.
2502 2502 */
2503 2503 if (seg->s_szc != 0) {
2504 2504 anon_free_pages(amp->ahp, svd->anon_index,
2505 2505 seg->s_size, seg->s_szc);
2506 2506 } else {
2507 2507 anon_free(amp->ahp, svd->anon_index,
2508 2508 seg->s_size);
2509 2509 }
2510 2510 ANON_LOCK_EXIT(&->a_rwlock);
2511 2511 } else {
2512 2512 ANON_LOCK_EXIT(&->a_rwlock);
2513 2513 }
2514 2514 }
2515 2515
2516 2516 /*
2517 2517 * Release swap reservation.
2518 2518 */
2519 2519 if ((len = svd->swresv) != 0) {
2520 2520 anon_unresv_zone(svd->swresv,
2521 2521 seg->s_as->a_proc->p_zone);
2522 2522 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
2523 2523 seg, len, 0);
2524 2524 if (SEG_IS_PARTIAL_RESV(seg))
2525 2525 seg->s_as->a_resvsize -= svd->swresv;
2526 2526 svd->swresv = 0;
2527 2527 }
2528 2528 /*
2529 2529 * Release claim on vnode, credentials, and finally free the
2530 2530 * private data.
2531 2531 */
2532 2532 if (svd->vp != NULL) {
2533 2533 if (svd->type == MAP_SHARED)
2534 2534 lgrp_shm_policy_fini(NULL, svd->vp);
2535 2535 VN_RELE(svd->vp);
2536 2536 svd->vp = NULL;
2537 2537 }
2538 2538 crfree(svd->cred);
2539 2539 svd->pageprot = 0;
2540 2540 svd->pageadvice = 0;
2541 2541 svd->pageswap = 0;
2542 2542 svd->cred = NULL;
2543 2543
2544 2544 /*
2545 2545 * Take segfree_syncmtx lock to let segvn_reclaim() finish if it's
2546 2546 * still working with this segment without holding as lock (in case
2547 2547 * it's called by pcache async thread).
2548 2548 */
2549 2549 ASSERT(svd->softlockcnt == 0);
2550 2550 mutex_enter(&svd->segfree_syncmtx);
2551 2551 mutex_exit(&svd->segfree_syncmtx);
2552 2552
2553 2553 seg->s_data = NULL;
2554 2554 kmem_cache_free(segvn_cache, svd);
2555 2555 }
2556 2556
2557 2557 /*
2558 2558 * Do a F_SOFTUNLOCK call over the range requested. The range must have
2559 2559 * already been F_SOFTLOCK'ed.
2560 2560 * Caller must always match addr and len of a softunlock with a previous
2561 2561 * softlock with exactly the same addr and len.
2562 2562 */
2563 2563 static void
2564 2564 segvn_softunlock(struct seg *seg, caddr_t addr, size_t len, enum seg_rw rw)
2565 2565 {
2566 2566 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
2567 2567 page_t *pp;
2568 2568 caddr_t adr;
2569 2569 struct vnode *vp;
2570 2570 u_offset_t offset;
2571 2571 ulong_t anon_index;
2572 2572 struct anon_map *amp;
2573 2573 struct anon *ap = NULL;
2574 2574
2575 2575 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
2576 2576 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
2577 2577
2578 2578 if ((amp = svd->amp) != NULL)
2579 2579 anon_index = svd->anon_index + seg_page(seg, addr);
2580 2580
2581 2581 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
2582 2582 ASSERT(svd->tr_state == SEGVN_TR_OFF);
2583 2583 hat_unlock_region(seg->s_as->a_hat, addr, len, svd->rcookie);
2584 2584 } else {
2585 2585 hat_unlock(seg->s_as->a_hat, addr, len);
2586 2586 }
2587 2587 for (adr = addr; adr < addr + len; adr += PAGESIZE) {
2588 2588 if (amp != NULL) {
2589 2589 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
2590 2590 if ((ap = anon_get_ptr(amp->ahp, anon_index++))
2591 2591 != NULL) {
2592 2592 swap_xlate(ap, &vp, &offset);
2593 2593 } else {
2594 2594 vp = svd->vp;
2595 2595 offset = svd->offset +
2596 2596 (uintptr_t)(adr - seg->s_base);
2597 2597 }
2598 2598 ANON_LOCK_EXIT(&->a_rwlock);
2599 2599 } else {
2600 2600 vp = svd->vp;
2601 2601 offset = svd->offset +
2602 2602 (uintptr_t)(adr - seg->s_base);
2603 2603 }
2604 2604
2605 2605 /*
2606 2606 * Use page_find() instead of page_lookup() to
2607 2607 * find the page since we know that it is locked.
2608 2608 */
2609 2609 pp = page_find(vp, offset);
2610 2610 if (pp == NULL) {
2611 2611 panic(
2612 2612 "segvn_softunlock: addr %p, ap %p, vp %p, off %llx",
2613 2613 (void *)adr, (void *)ap, (void *)vp, offset);
2614 2614 /*NOTREACHED*/
2615 2615 }
2616 2616
2617 2617 if (rw == S_WRITE) {
2618 2618 hat_setrefmod(pp);
2619 2619 if (seg->s_as->a_vbits)
2620 2620 hat_setstat(seg->s_as, adr, PAGESIZE,
2621 2621 P_REF | P_MOD);
2622 2622 } else if (rw != S_OTHER) {
2623 2623 hat_setref(pp);
2624 2624 if (seg->s_as->a_vbits)
2625 2625 hat_setstat(seg->s_as, adr, PAGESIZE, P_REF);
2626 2626 }
2627 2627 TRACE_3(TR_FAC_VM, TR_SEGVN_FAULT,
2628 2628 "segvn_fault:pp %p vp %p offset %llx", pp, vp, offset);
2629 2629 page_unlock(pp);
2630 2630 }
2631 2631 ASSERT(svd->softlockcnt >= btop(len));
2632 2632 if (!atomic_add_long_nv((ulong_t *)&svd->softlockcnt, -btop(len))) {
2633 2633 /*
2634 2634 * All SOFTLOCKS are gone. Wakeup any waiting
2635 2635 * unmappers so they can try again to unmap.
2636 2636 * Check for waiters first without the mutex
2637 2637 * held so we don't always grab the mutex on
2638 2638 * softunlocks.
2639 2639 */
2640 2640 if (AS_ISUNMAPWAIT(seg->s_as)) {
2641 2641 mutex_enter(&seg->s_as->a_contents);
2642 2642 if (AS_ISUNMAPWAIT(seg->s_as)) {
2643 2643 AS_CLRUNMAPWAIT(seg->s_as);
2644 2644 cv_broadcast(&seg->s_as->a_cv);
2645 2645 }
2646 2646 mutex_exit(&seg->s_as->a_contents);
2647 2647 }
2648 2648 }
2649 2649 }
2650 2650
2651 2651 #define PAGE_HANDLED ((page_t *)-1)
2652 2652
2653 2653 /*
2654 2654 * Release all the pages in the NULL terminated ppp list
2655 2655 * which haven't already been converted to PAGE_HANDLED.
2656 2656 */
2657 2657 static void
2658 2658 segvn_pagelist_rele(page_t **ppp)
2659 2659 {
2660 2660 for (; *ppp != NULL; ppp++) {
2661 2661 if (*ppp != PAGE_HANDLED)
2662 2662 page_unlock(*ppp);
2663 2663 }
2664 2664 }
2665 2665
2666 2666 static int stealcow = 1;
2667 2667
2668 2668 /*
2669 2669 * Workaround for viking chip bug. See bug id 1220902.
2670 2670 * To fix this down in pagefault() would require importing so
2671 2671 * much as and segvn code as to be unmaintainable.
2672 2672 */
2673 2673 int enable_mbit_wa = 0;
2674 2674
2675 2675 /*
2676 2676 * Handles all the dirty work of getting the right
2677 2677 * anonymous pages and loading up the translations.
2678 2678 * This routine is called only from segvn_fault()
2679 2679 * when looping over the range of addresses requested.
2680 2680 *
2681 2681 * The basic algorithm here is:
2682 2682 * If this is an anon_zero case
2683 2683 * Call anon_zero to allocate page
2684 2684 * Load up translation
2685 2685 * Return
2686 2686 * endif
2687 2687 * If this is an anon page
2688 2688 * Use anon_getpage to get the page
2689 2689 * else
2690 2690 * Find page in pl[] list passed in
2691 2691 * endif
2692 2692 * If not a cow
2693 2693 * Load up the translation to the page
2694 2694 * return
2695 2695 * endif
2696 2696 * Call anon_private to handle cow
2697 2697 * Load up (writable) translation to new page
2698 2698 */
2699 2699 static faultcode_t
2700 2700 segvn_faultpage(
2701 2701 struct hat *hat, /* the hat to use for mapping */
2702 2702 struct seg *seg, /* seg_vn of interest */
2703 2703 caddr_t addr, /* address in as */
2704 2704 u_offset_t off, /* offset in vp */
2705 2705 struct vpage *vpage, /* pointer to vpage for vp, off */
2706 2706 page_t *pl[], /* object source page pointer */
2707 2707 uint_t vpprot, /* access allowed to object pages */
2708 2708 enum fault_type type, /* type of fault */
2709 2709 enum seg_rw rw, /* type of access at fault */
2710 2710 int brkcow) /* we may need to break cow */
2711 2711 {
2712 2712 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
2713 2713 page_t *pp, **ppp;
2714 2714 uint_t pageflags = 0;
2715 2715 page_t *anon_pl[1 + 1];
2716 2716 page_t *opp = NULL; /* original page */
2717 2717 uint_t prot;
2718 2718 int err;
2719 2719 int cow;
2720 2720 int claim;
2721 2721 int steal = 0;
2722 2722 ulong_t anon_index;
2723 2723 struct anon *ap, *oldap;
2724 2724 struct anon_map *amp;
2725 2725 int hat_flag = (type == F_SOFTLOCK) ? HAT_LOAD_LOCK : HAT_LOAD;
2726 2726 int anon_lock = 0;
2727 2727 anon_sync_obj_t cookie;
2728 2728
2729 2729 if (svd->flags & MAP_TEXT) {
2730 2730 hat_flag |= HAT_LOAD_TEXT;
2731 2731 }
2732 2732
2733 2733 ASSERT(SEGVN_READ_HELD(seg->s_as, &svd->lock));
2734 2734 ASSERT(seg->s_szc == 0);
2735 2735 ASSERT(svd->tr_state != SEGVN_TR_INIT);
2736 2736
2737 2737 /*
2738 2738 * Initialize protection value for this page.
2739 2739 * If we have per page protection values check it now.
2740 2740 */
2741 2741 if (svd->pageprot) {
2742 2742 uint_t protchk;
2743 2743
2744 2744 switch (rw) {
2745 2745 case S_READ:
2746 2746 protchk = PROT_READ;
2747 2747 break;
2748 2748 case S_WRITE:
2749 2749 protchk = PROT_WRITE;
2750 2750 break;
2751 2751 case S_EXEC:
2752 2752 protchk = PROT_EXEC;
2753 2753 break;
2754 2754 case S_OTHER:
2755 2755 default:
2756 2756 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
2757 2757 break;
2758 2758 }
2759 2759
2760 2760 prot = VPP_PROT(vpage);
2761 2761 if ((prot & protchk) == 0)
2762 2762 return (FC_PROT); /* illegal access type */
2763 2763 } else {
2764 2764 prot = svd->prot;
2765 2765 }
2766 2766
2767 2767 if (type == F_SOFTLOCK) {
2768 2768 atomic_inc_ulong((ulong_t *)&svd->softlockcnt);
2769 2769 }
2770 2770
2771 2771 /*
2772 2772 * Always acquire the anon array lock to prevent 2 threads from
2773 2773 * allocating separate anon slots for the same "addr".
2774 2774 */
2775 2775
2776 2776 if ((amp = svd->amp) != NULL) {
2777 2777 ASSERT(RW_READ_HELD(&->a_rwlock));
2778 2778 anon_index = svd->anon_index + seg_page(seg, addr);
2779 2779 anon_array_enter(amp, anon_index, &cookie);
2780 2780 anon_lock = 1;
2781 2781 }
2782 2782
2783 2783 if (svd->vp == NULL && amp != NULL) {
2784 2784 if ((ap = anon_get_ptr(amp->ahp, anon_index)) == NULL) {
2785 2785 /*
2786 2786 * Allocate a (normally) writable anonymous page of
2787 2787 * zeroes. If no advance reservations, reserve now.
2788 2788 */
2789 2789 if (svd->flags & MAP_NORESERVE) {
2790 2790 if (anon_resv_zone(ptob(1),
2791 2791 seg->s_as->a_proc->p_zone)) {
2792 2792 atomic_add_long(&svd->swresv, ptob(1));
2793 2793 atomic_add_long(&seg->s_as->a_resvsize,
2794 2794 ptob(1));
2795 2795 } else {
2796 2796 err = ENOMEM;
2797 2797 goto out;
2798 2798 }
2799 2799 }
2800 2800 if ((pp = anon_zero(seg, addr, &ap,
2801 2801 svd->cred)) == NULL) {
2802 2802 err = ENOMEM;
2803 2803 goto out; /* out of swap space */
2804 2804 }
2805 2805 /*
2806 2806 * Re-acquire the anon_map lock and
2807 2807 * initialize the anon array entry.
2808 2808 */
2809 2809 (void) anon_set_ptr(amp->ahp, anon_index, ap,
2810 2810 ANON_SLEEP);
2811 2811
2812 2812 ASSERT(pp->p_szc == 0);
2813 2813
2814 2814 /*
2815 2815 * Handle pages that have been marked for migration
2816 2816 */
2817 2817 if (lgrp_optimizations())
2818 2818 page_migrate(seg, addr, &pp, 1);
2819 2819
2820 2820 if (enable_mbit_wa) {
2821 2821 if (rw == S_WRITE)
2822 2822 hat_setmod(pp);
2823 2823 else if (!hat_ismod(pp))
2824 2824 prot &= ~PROT_WRITE;
2825 2825 }
2826 2826 /*
2827 2827 * If AS_PAGLCK is set in a_flags (via memcntl(2)
2828 2828 * with MC_LOCKAS, MCL_FUTURE) and this is a
2829 2829 * MAP_NORESERVE segment, we may need to
2830 2830 * permanently lock the page as it is being faulted
2831 2831 * for the first time. The following text applies
2832 2832 * only to MAP_NORESERVE segments:
2833 2833 *
2834 2834 * As per memcntl(2), if this segment was created
2835 2835 * after MCL_FUTURE was applied (a "future"
2836 2836 * segment), its pages must be locked. If this
2837 2837 * segment existed at MCL_FUTURE application (a
2838 2838 * "past" segment), the interface is unclear.
2839 2839 *
2840 2840 * We decide to lock only if vpage is present:
2841 2841 *
2842 2842 * - "future" segments will have a vpage array (see
2843 2843 * as_map), and so will be locked as required
2844 2844 *
2845 2845 * - "past" segments may not have a vpage array,
2846 2846 * depending on whether events (such as
2847 2847 * mprotect) have occurred. Locking if vpage
2848 2848 * exists will preserve legacy behavior. Not
2849 2849 * locking if vpage is absent, will not break
2850 2850 * the interface or legacy behavior. Note that
2851 2851 * allocating vpage here if it's absent requires
2852 2852 * upgrading the segvn reader lock, the cost of
2853 2853 * which does not seem worthwhile.
2854 2854 *
2855 2855 * Usually testing and setting VPP_ISPPLOCK and
2856 2856 * VPP_SETPPLOCK requires holding the segvn lock as
2857 2857 * writer, but in this case all readers are
2858 2858 * serializing on the anon array lock.
2859 2859 */
2860 2860 if (AS_ISPGLCK(seg->s_as) && vpage != NULL &&
2861 2861 (svd->flags & MAP_NORESERVE) &&
2862 2862 !VPP_ISPPLOCK(vpage)) {
2863 2863 proc_t *p = seg->s_as->a_proc;
2864 2864 ASSERT(svd->type == MAP_PRIVATE);
2865 2865 mutex_enter(&p->p_lock);
2866 2866 if (rctl_incr_locked_mem(p, NULL, PAGESIZE,
2867 2867 1) == 0) {
2868 2868 claim = VPP_PROT(vpage) & PROT_WRITE;
2869 2869 if (page_pp_lock(pp, claim, 0)) {
2870 2870 VPP_SETPPLOCK(vpage);
2871 2871 } else {
2872 2872 rctl_decr_locked_mem(p, NULL,
2873 2873 PAGESIZE, 1);
2874 2874 }
2875 2875 }
2876 2876 mutex_exit(&p->p_lock);
2877 2877 }
2878 2878
2879 2879 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
2880 2880 hat_memload(hat, addr, pp, prot, hat_flag);
2881 2881
2882 2882 if (!(hat_flag & HAT_LOAD_LOCK))
2883 2883 page_unlock(pp);
2884 2884
2885 2885 anon_array_exit(&cookie);
2886 2886 return (0);
2887 2887 }
2888 2888 }
2889 2889
2890 2890 /*
2891 2891 * Obtain the page structure via anon_getpage() if it is
2892 2892 * a private copy of an object (the result of a previous
2893 2893 * copy-on-write).
2894 2894 */
2895 2895 if (amp != NULL) {
2896 2896 if ((ap = anon_get_ptr(amp->ahp, anon_index)) != NULL) {
2897 2897 err = anon_getpage(&ap, &vpprot, anon_pl, PAGESIZE,
2898 2898 seg, addr, rw, svd->cred);
2899 2899 if (err)
2900 2900 goto out;
2901 2901
2902 2902 if (svd->type == MAP_SHARED) {
2903 2903 /*
2904 2904 * If this is a shared mapping to an
2905 2905 * anon_map, then ignore the write
2906 2906 * permissions returned by anon_getpage().
2907 2907 * They apply to the private mappings
2908 2908 * of this anon_map.
2909 2909 */
2910 2910 vpprot |= PROT_WRITE;
2911 2911 }
2912 2912 opp = anon_pl[0];
2913 2913 }
2914 2914 }
2915 2915
2916 2916 /*
2917 2917 * Search the pl[] list passed in if it is from the
2918 2918 * original object (i.e., not a private copy).
2919 2919 */
2920 2920 if (opp == NULL) {
2921 2921 /*
2922 2922 * Find original page. We must be bringing it in
2923 2923 * from the list in pl[].
2924 2924 */
2925 2925 for (ppp = pl; (opp = *ppp) != NULL; ppp++) {
2926 2926 if (opp == PAGE_HANDLED)
2927 2927 continue;
2928 2928 ASSERT(opp->p_vnode == svd->vp); /* XXX */
2929 2929 if (opp->p_offset == off)
2930 2930 break;
2931 2931 }
2932 2932 if (opp == NULL) {
2933 2933 panic("segvn_faultpage not found");
2934 2934 /*NOTREACHED*/
2935 2935 }
2936 2936 *ppp = PAGE_HANDLED;
2937 2937
2938 2938 }
2939 2939
2940 2940 ASSERT(PAGE_LOCKED(opp));
2941 2941
2942 2942 TRACE_3(TR_FAC_VM, TR_SEGVN_FAULT,
2943 2943 "segvn_fault:pp %p vp %p offset %llx", opp, NULL, 0);
2944 2944
2945 2945 /*
2946 2946 * The fault is treated as a copy-on-write fault if a
2947 2947 * write occurs on a private segment and the object
2948 2948 * page (i.e., mapping) is write protected. We assume
2949 2949 * that fatal protection checks have already been made.
2950 2950 */
2951 2951
2952 2952 if (brkcow) {
2953 2953 ASSERT(svd->tr_state == SEGVN_TR_OFF);
2954 2954 cow = !(vpprot & PROT_WRITE);
2955 2955 } else if (svd->tr_state == SEGVN_TR_ON) {
2956 2956 /*
2957 2957 * If we are doing text replication COW on first touch.
2958 2958 */
2959 2959 ASSERT(amp != NULL);
2960 2960 ASSERT(svd->vp != NULL);
2961 2961 ASSERT(rw != S_WRITE);
2962 2962 cow = (ap == NULL);
2963 2963 } else {
2964 2964 cow = 0;
2965 2965 }
2966 2966
2967 2967 /*
2968 2968 * If not a copy-on-write case load the translation
2969 2969 * and return.
2970 2970 */
2971 2971 if (cow == 0) {
2972 2972
2973 2973 /*
2974 2974 * Handle pages that have been marked for migration
2975 2975 */
2976 2976 if (lgrp_optimizations())
2977 2977 page_migrate(seg, addr, &opp, 1);
2978 2978
2979 2979 if (IS_VMODSORT(opp->p_vnode) || enable_mbit_wa) {
2980 2980 if (rw == S_WRITE)
2981 2981 hat_setmod(opp);
2982 2982 else if (rw != S_OTHER && !hat_ismod(opp))
2983 2983 prot &= ~PROT_WRITE;
2984 2984 }
2985 2985
2986 2986 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE ||
2987 2987 (!svd->pageprot && svd->prot == (prot & vpprot)));
2988 2988 ASSERT(amp == NULL ||
2989 2989 svd->rcookie == HAT_INVALID_REGION_COOKIE);
2990 2990 hat_memload_region(hat, addr, opp, prot & vpprot, hat_flag,
2991 2991 svd->rcookie);
2992 2992
2993 2993 if (!(hat_flag & HAT_LOAD_LOCK))
2994 2994 page_unlock(opp);
2995 2995
2996 2996 if (anon_lock) {
2997 2997 anon_array_exit(&cookie);
2998 2998 }
2999 2999 return (0);
3000 3000 }
3001 3001
3002 3002 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
3003 3003
3004 3004 hat_setref(opp);
3005 3005
3006 3006 ASSERT(amp != NULL && anon_lock);
3007 3007
3008 3008 /*
3009 3009 * Steal the page only if it isn't a private page
3010 3010 * since stealing a private page is not worth the effort.
3011 3011 */
3012 3012 if ((ap = anon_get_ptr(amp->ahp, anon_index)) == NULL)
3013 3013 steal = 1;
3014 3014
3015 3015 /*
3016 3016 * Steal the original page if the following conditions are true:
3017 3017 *
3018 3018 * We are low on memory, the page is not private, page is not large,
3019 3019 * not shared, not modified, not `locked' or if we have it `locked'
3020 3020 * (i.e., p_cowcnt == 1 and p_lckcnt == 0, which also implies
3021 3021 * that the page is not shared) and if it doesn't have any
3022 3022 * translations. page_struct_lock isn't needed to look at p_cowcnt
3023 3023 * and p_lckcnt because we first get exclusive lock on page.
3024 3024 */
3025 3025 (void) hat_pagesync(opp, HAT_SYNC_DONTZERO | HAT_SYNC_STOPON_MOD);
3026 3026
3027 3027 if (stealcow && freemem < minfree && steal && opp->p_szc == 0 &&
3028 3028 page_tryupgrade(opp) && !hat_ismod(opp) &&
3029 3029 ((opp->p_lckcnt == 0 && opp->p_cowcnt == 0) ||
3030 3030 (opp->p_lckcnt == 0 && opp->p_cowcnt == 1 &&
3031 3031 vpage != NULL && VPP_ISPPLOCK(vpage)))) {
3032 3032 /*
3033 3033 * Check if this page has other translations
3034 3034 * after unloading our translation.
3035 3035 */
3036 3036 if (hat_page_is_mapped(opp)) {
3037 3037 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
3038 3038 hat_unload(seg->s_as->a_hat, addr, PAGESIZE,
3039 3039 HAT_UNLOAD);
3040 3040 }
3041 3041
3042 3042 /*
3043 3043 * hat_unload() might sync back someone else's recent
3044 3044 * modification, so check again.
3045 3045 */
3046 3046 if (!hat_ismod(opp) && !hat_page_is_mapped(opp))
3047 3047 pageflags |= STEAL_PAGE;
3048 3048 }
3049 3049
3050 3050 /*
3051 3051 * If we have a vpage pointer, see if it indicates that we have
3052 3052 * ``locked'' the page we map -- if so, tell anon_private to
3053 3053 * transfer the locking resource to the new page.
3054 3054 *
3055 3055 * See Statement at the beginning of segvn_lockop regarding
3056 3056 * the way lockcnts/cowcnts are handled during COW.
3057 3057 *
3058 3058 */
3059 3059 if (vpage != NULL && VPP_ISPPLOCK(vpage))
3060 3060 pageflags |= LOCK_PAGE;
3061 3061
3062 3062 /*
3063 3063 * Allocate a private page and perform the copy.
3064 3064 * For MAP_NORESERVE reserve swap space now, unless this
3065 3065 * is a cow fault on an existing anon page in which case
3066 3066 * MAP_NORESERVE will have made advance reservations.
3067 3067 */
3068 3068 if ((svd->flags & MAP_NORESERVE) && (ap == NULL)) {
3069 3069 if (anon_resv_zone(ptob(1), seg->s_as->a_proc->p_zone)) {
3070 3070 atomic_add_long(&svd->swresv, ptob(1));
3071 3071 atomic_add_long(&seg->s_as->a_resvsize, ptob(1));
3072 3072 } else {
3073 3073 page_unlock(opp);
3074 3074 err = ENOMEM;
3075 3075 goto out;
3076 3076 }
3077 3077 }
3078 3078 oldap = ap;
3079 3079 pp = anon_private(&ap, seg, addr, prot, opp, pageflags, svd->cred);
3080 3080 if (pp == NULL) {
3081 3081 err = ENOMEM; /* out of swap space */
3082 3082 goto out;
3083 3083 }
3084 3084
3085 3085 /*
3086 3086 * If we copied away from an anonymous page, then
3087 3087 * we are one step closer to freeing up an anon slot.
3088 3088 *
3089 3089 * NOTE: The original anon slot must be released while
3090 3090 * holding the "anon_map" lock. This is necessary to prevent
3091 3091 * other threads from obtaining a pointer to the anon slot
3092 3092 * which may be freed if its "refcnt" is 1.
3093 3093 */
3094 3094 if (oldap != NULL)
3095 3095 anon_decref(oldap);
3096 3096
3097 3097 (void) anon_set_ptr(amp->ahp, anon_index, ap, ANON_SLEEP);
3098 3098
3099 3099 /*
3100 3100 * Handle pages that have been marked for migration
3101 3101 */
3102 3102 if (lgrp_optimizations())
3103 3103 page_migrate(seg, addr, &pp, 1);
3104 3104
3105 3105 ASSERT(pp->p_szc == 0);
3106 3106
3107 3107 ASSERT(!IS_VMODSORT(pp->p_vnode));
3108 3108 if (enable_mbit_wa) {
3109 3109 if (rw == S_WRITE)
3110 3110 hat_setmod(pp);
3111 3111 else if (!hat_ismod(pp))
3112 3112 prot &= ~PROT_WRITE;
3113 3113 }
3114 3114
3115 3115 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
3116 3116 hat_memload(hat, addr, pp, prot, hat_flag);
3117 3117
3118 3118 if (!(hat_flag & HAT_LOAD_LOCK))
3119 3119 page_unlock(pp);
3120 3120
3121 3121 ASSERT(anon_lock);
3122 3122 anon_array_exit(&cookie);
3123 3123 return (0);
3124 3124 out:
3125 3125 if (anon_lock)
3126 3126 anon_array_exit(&cookie);
3127 3127
3128 3128 if (type == F_SOFTLOCK) {
3129 3129 atomic_dec_ulong((ulong_t *)&svd->softlockcnt);
3130 3130 }
3131 3131 return (FC_MAKE_ERR(err));
3132 3132 }
3133 3133
3134 3134 /*
3135 3135 * relocate a bunch of smaller targ pages into one large repl page. all targ
3136 3136 * pages must be complete pages smaller than replacement pages.
3137 3137 * it's assumed that no page's szc can change since they are all PAGESIZE or
3138 3138 * complete large pages locked SHARED.
3139 3139 */
3140 3140 static void
3141 3141 segvn_relocate_pages(page_t **targ, page_t *replacement)
3142 3142 {
3143 3143 page_t *pp;
3144 3144 pgcnt_t repl_npgs, curnpgs;
3145 3145 pgcnt_t i;
3146 3146 uint_t repl_szc = replacement->p_szc;
3147 3147 page_t *first_repl = replacement;
3148 3148 page_t *repl;
3149 3149 spgcnt_t npgs;
3150 3150
3151 3151 VM_STAT_ADD(segvnvmstats.relocatepages[0]);
3152 3152
3153 3153 ASSERT(repl_szc != 0);
3154 3154 npgs = repl_npgs = page_get_pagecnt(repl_szc);
3155 3155
3156 3156 i = 0;
3157 3157 while (repl_npgs) {
3158 3158 spgcnt_t nreloc;
3159 3159 int err;
3160 3160 ASSERT(replacement != NULL);
3161 3161 pp = targ[i];
3162 3162 ASSERT(pp->p_szc < repl_szc);
3163 3163 ASSERT(PAGE_EXCL(pp));
3164 3164 ASSERT(!PP_ISFREE(pp));
3165 3165 curnpgs = page_get_pagecnt(pp->p_szc);
3166 3166 if (curnpgs == 1) {
3167 3167 VM_STAT_ADD(segvnvmstats.relocatepages[1]);
3168 3168 repl = replacement;
3169 3169 page_sub(&replacement, repl);
3170 3170 ASSERT(PAGE_EXCL(repl));
3171 3171 ASSERT(!PP_ISFREE(repl));
3172 3172 ASSERT(repl->p_szc == repl_szc);
3173 3173 } else {
3174 3174 page_t *repl_savepp;
3175 3175 int j;
3176 3176 VM_STAT_ADD(segvnvmstats.relocatepages[2]);
3177 3177 repl_savepp = replacement;
3178 3178 for (j = 0; j < curnpgs; j++) {
3179 3179 repl = replacement;
3180 3180 page_sub(&replacement, repl);
3181 3181 ASSERT(PAGE_EXCL(repl));
3182 3182 ASSERT(!PP_ISFREE(repl));
3183 3183 ASSERT(repl->p_szc == repl_szc);
3184 3184 ASSERT(page_pptonum(targ[i + j]) ==
3185 3185 page_pptonum(targ[i]) + j);
3186 3186 }
3187 3187 repl = repl_savepp;
3188 3188 ASSERT(IS_P2ALIGNED(page_pptonum(repl), curnpgs));
3189 3189 }
3190 3190 err = page_relocate(&pp, &repl, 0, 1, &nreloc, NULL);
3191 3191 if (err || nreloc != curnpgs) {
3192 3192 panic("segvn_relocate_pages: "
3193 3193 "page_relocate failed err=%d curnpgs=%ld "
3194 3194 "nreloc=%ld", err, curnpgs, nreloc);
3195 3195 }
3196 3196 ASSERT(curnpgs <= repl_npgs);
3197 3197 repl_npgs -= curnpgs;
3198 3198 i += curnpgs;
3199 3199 }
3200 3200 ASSERT(replacement == NULL);
3201 3201
3202 3202 repl = first_repl;
3203 3203 repl_npgs = npgs;
3204 3204 for (i = 0; i < repl_npgs; i++) {
3205 3205 ASSERT(PAGE_EXCL(repl));
3206 3206 ASSERT(!PP_ISFREE(repl));
3207 3207 targ[i] = repl;
3208 3208 page_downgrade(targ[i]);
3209 3209 repl++;
3210 3210 }
3211 3211 }
3212 3212
3213 3213 /*
3214 3214 * Check if all pages in ppa array are complete smaller than szc pages and
3215 3215 * their roots will still be aligned relative to their current size if the
3216 3216 * entire ppa array is relocated into one szc page. If these conditions are
3217 3217 * not met return 0.
3218 3218 *
3219 3219 * If all pages are properly aligned attempt to upgrade their locks
3220 3220 * to exclusive mode. If it fails set *upgrdfail to 1 and return 0.
3221 3221 * upgrdfail was set to 0 by caller.
3222 3222 *
3223 3223 * Return 1 if all pages are aligned and locked exclusively.
3224 3224 *
3225 3225 * If all pages in ppa array happen to be physically contiguous to make one
3226 3226 * szc page and all exclusive locks are successfully obtained promote the page
3227 3227 * size to szc and set *pszc to szc. Return 1 with pages locked shared.
3228 3228 */
3229 3229 static int
3230 3230 segvn_full_szcpages(page_t **ppa, uint_t szc, int *upgrdfail, uint_t *pszc)
3231 3231 {
3232 3232 page_t *pp;
3233 3233 pfn_t pfn;
3234 3234 pgcnt_t totnpgs = page_get_pagecnt(szc);
3235 3235 pfn_t first_pfn;
3236 3236 int contig = 1;
3237 3237 pgcnt_t i;
3238 3238 pgcnt_t j;
3239 3239 uint_t curszc;
3240 3240 pgcnt_t curnpgs;
3241 3241 int root = 0;
3242 3242
3243 3243 ASSERT(szc > 0);
3244 3244
3245 3245 VM_STAT_ADD(segvnvmstats.fullszcpages[0]);
3246 3246
3247 3247 for (i = 0; i < totnpgs; i++) {
3248 3248 pp = ppa[i];
3249 3249 ASSERT(PAGE_SHARED(pp));
3250 3250 ASSERT(!PP_ISFREE(pp));
3251 3251 pfn = page_pptonum(pp);
3252 3252 if (i == 0) {
3253 3253 if (!IS_P2ALIGNED(pfn, totnpgs)) {
3254 3254 contig = 0;
3255 3255 } else {
3256 3256 first_pfn = pfn;
3257 3257 }
3258 3258 } else if (contig && pfn != first_pfn + i) {
3259 3259 contig = 0;
3260 3260 }
3261 3261 if (pp->p_szc == 0) {
3262 3262 if (root) {
3263 3263 VM_STAT_ADD(segvnvmstats.fullszcpages[1]);
3264 3264 return (0);
3265 3265 }
3266 3266 } else if (!root) {
3267 3267 if ((curszc = pp->p_szc) >= szc) {
3268 3268 VM_STAT_ADD(segvnvmstats.fullszcpages[2]);
3269 3269 return (0);
3270 3270 }
3271 3271 if (curszc == 0) {
3272 3272 /*
3273 3273 * p_szc changed means we don't have all pages
3274 3274 * locked. return failure.
3275 3275 */
3276 3276 VM_STAT_ADD(segvnvmstats.fullszcpages[3]);
3277 3277 return (0);
3278 3278 }
3279 3279 curnpgs = page_get_pagecnt(curszc);
3280 3280 if (!IS_P2ALIGNED(pfn, curnpgs) ||
3281 3281 !IS_P2ALIGNED(i, curnpgs)) {
3282 3282 VM_STAT_ADD(segvnvmstats.fullszcpages[4]);
3283 3283 return (0);
3284 3284 }
3285 3285 root = 1;
3286 3286 } else {
3287 3287 ASSERT(i > 0);
3288 3288 VM_STAT_ADD(segvnvmstats.fullszcpages[5]);
3289 3289 if (pp->p_szc != curszc) {
3290 3290 VM_STAT_ADD(segvnvmstats.fullszcpages[6]);
3291 3291 return (0);
3292 3292 }
3293 3293 if (pfn - 1 != page_pptonum(ppa[i - 1])) {
3294 3294 panic("segvn_full_szcpages: "
3295 3295 "large page not physically contiguous");
3296 3296 }
3297 3297 if (P2PHASE(pfn, curnpgs) == curnpgs - 1) {
3298 3298 root = 0;
3299 3299 }
3300 3300 }
3301 3301 }
3302 3302
3303 3303 for (i = 0; i < totnpgs; i++) {
3304 3304 ASSERT(ppa[i]->p_szc < szc);
3305 3305 if (!page_tryupgrade(ppa[i])) {
3306 3306 for (j = 0; j < i; j++) {
3307 3307 page_downgrade(ppa[j]);
3308 3308 }
3309 3309 *pszc = ppa[i]->p_szc;
3310 3310 *upgrdfail = 1;
3311 3311 VM_STAT_ADD(segvnvmstats.fullszcpages[7]);
3312 3312 return (0);
3313 3313 }
3314 3314 }
3315 3315
3316 3316 /*
3317 3317 * When a page is put a free cachelist its szc is set to 0. if file
3318 3318 * system reclaimed pages from cachelist targ pages will be physically
3319 3319 * contiguous with 0 p_szc. in this case just upgrade szc of targ
3320 3320 * pages without any relocations.
3321 3321 * To avoid any hat issues with previous small mappings
3322 3322 * hat_pageunload() the target pages first.
3323 3323 */
3324 3324 if (contig) {
3325 3325 VM_STAT_ADD(segvnvmstats.fullszcpages[8]);
3326 3326 for (i = 0; i < totnpgs; i++) {
3327 3327 (void) hat_pageunload(ppa[i], HAT_FORCE_PGUNLOAD);
3328 3328 }
3329 3329 for (i = 0; i < totnpgs; i++) {
3330 3330 ppa[i]->p_szc = szc;
3331 3331 }
3332 3332 for (i = 0; i < totnpgs; i++) {
3333 3333 ASSERT(PAGE_EXCL(ppa[i]));
3334 3334 page_downgrade(ppa[i]);
3335 3335 }
3336 3336 if (pszc != NULL) {
3337 3337 *pszc = szc;
3338 3338 }
3339 3339 }
3340 3340 VM_STAT_ADD(segvnvmstats.fullszcpages[9]);
3341 3341 return (1);
3342 3342 }
3343 3343
3344 3344 /*
3345 3345 * Create physically contiguous pages for [vp, off] - [vp, off +
3346 3346 * page_size(szc)) range and for private segment return them in ppa array.
3347 3347 * Pages are created either via IO or relocations.
3348 3348 *
3349 3349 * Return 1 on success and 0 on failure.
3350 3350 *
3351 3351 * If physically contiguous pages already exist for this range return 1 without
3352 3352 * filling ppa array. Caller initializes ppa[0] as NULL to detect that ppa
3353 3353 * array wasn't filled. In this case caller fills ppa array via VOP_GETPAGE().
3354 3354 */
3355 3355
3356 3356 static int
3357 3357 segvn_fill_vp_pages(struct segvn_data *svd, vnode_t *vp, u_offset_t off,
3358 3358 uint_t szc, page_t **ppa, page_t **ppplist, uint_t *ret_pszc,
3359 3359 int *downsize)
3360 3360
3361 3361 {
3362 3362 page_t *pplist = *ppplist;
3363 3363 size_t pgsz = page_get_pagesize(szc);
3364 3364 pgcnt_t pages = btop(pgsz);
3365 3365 ulong_t start_off = off;
3366 3366 u_offset_t eoff = off + pgsz;
3367 3367 spgcnt_t nreloc;
3368 3368 u_offset_t io_off = off;
3369 3369 size_t io_len;
3370 3370 page_t *io_pplist = NULL;
3371 3371 page_t *done_pplist = NULL;
3372 3372 pgcnt_t pgidx = 0;
3373 3373 page_t *pp;
3374 3374 page_t *newpp;
3375 3375 page_t *targpp;
3376 3376 int io_err = 0;
3377 3377 int i;
3378 3378 pfn_t pfn;
3379 3379 ulong_t ppages;
3380 3380 page_t *targ_pplist = NULL;
3381 3381 page_t *repl_pplist = NULL;
3382 3382 page_t *tmp_pplist;
3383 3383 int nios = 0;
3384 3384 uint_t pszc;
3385 3385 struct vattr va;
3386 3386
3387 3387 VM_STAT_ADD(segvnvmstats.fill_vp_pages[0]);
3388 3388
3389 3389 ASSERT(szc != 0);
3390 3390 ASSERT(pplist->p_szc == szc);
3391 3391
3392 3392 /*
3393 3393 * downsize will be set to 1 only if we fail to lock pages. this will
3394 3394 * allow subsequent faults to try to relocate the page again. If we
3395 3395 * fail due to misalignment don't downsize and let the caller map the
3396 3396 * whole region with small mappings to avoid more faults into the area
3397 3397 * where we can't get large pages anyway.
3398 3398 */
3399 3399 *downsize = 0;
3400 3400
3401 3401 while (off < eoff) {
3402 3402 newpp = pplist;
3403 3403 ASSERT(newpp != NULL);
3404 3404 ASSERT(PAGE_EXCL(newpp));
3405 3405 ASSERT(!PP_ISFREE(newpp));
3406 3406 /*
3407 3407 * we pass NULL for nrelocp to page_lookup_create()
3408 3408 * so that it doesn't relocate. We relocate here
3409 3409 * later only after we make sure we can lock all
3410 3410 * pages in the range we handle and they are all
3411 3411 * aligned.
3412 3412 */
3413 3413 pp = page_lookup_create(vp, off, SE_SHARED, newpp, NULL, 0);
3414 3414 ASSERT(pp != NULL);
3415 3415 ASSERT(!PP_ISFREE(pp));
3416 3416 ASSERT(pp->p_vnode == vp);
3417 3417 ASSERT(pp->p_offset == off);
3418 3418 if (pp == newpp) {
3419 3419 VM_STAT_ADD(segvnvmstats.fill_vp_pages[1]);
3420 3420 page_sub(&pplist, pp);
3421 3421 ASSERT(PAGE_EXCL(pp));
3422 3422 ASSERT(page_iolock_assert(pp));
3423 3423 page_list_concat(&io_pplist, &pp);
3424 3424 off += PAGESIZE;
3425 3425 continue;
3426 3426 }
3427 3427 VM_STAT_ADD(segvnvmstats.fill_vp_pages[2]);
3428 3428 pfn = page_pptonum(pp);
3429 3429 pszc = pp->p_szc;
3430 3430 if (pszc >= szc && targ_pplist == NULL && io_pplist == NULL &&
3431 3431 IS_P2ALIGNED(pfn, pages)) {
3432 3432 ASSERT(repl_pplist == NULL);
3433 3433 ASSERT(done_pplist == NULL);
3434 3434 ASSERT(pplist == *ppplist);
3435 3435 page_unlock(pp);
3436 3436 page_free_replacement_page(pplist);
3437 3437 page_create_putback(pages);
3438 3438 *ppplist = NULL;
3439 3439 VM_STAT_ADD(segvnvmstats.fill_vp_pages[3]);
3440 3440 return (1);
3441 3441 }
3442 3442 if (pszc >= szc) {
3443 3443 page_unlock(pp);
3444 3444 segvn_faultvnmpss_align_err1++;
3445 3445 goto out;
3446 3446 }
3447 3447 ppages = page_get_pagecnt(pszc);
3448 3448 if (!IS_P2ALIGNED(pfn, ppages)) {
3449 3449 ASSERT(pszc > 0);
3450 3450 /*
3451 3451 * sizing down to pszc won't help.
3452 3452 */
3453 3453 page_unlock(pp);
3454 3454 segvn_faultvnmpss_align_err2++;
3455 3455 goto out;
3456 3456 }
3457 3457 pfn = page_pptonum(newpp);
3458 3458 if (!IS_P2ALIGNED(pfn, ppages)) {
3459 3459 ASSERT(pszc > 0);
3460 3460 /*
3461 3461 * sizing down to pszc won't help.
3462 3462 */
3463 3463 page_unlock(pp);
3464 3464 segvn_faultvnmpss_align_err3++;
3465 3465 goto out;
3466 3466 }
3467 3467 if (!PAGE_EXCL(pp)) {
3468 3468 VM_STAT_ADD(segvnvmstats.fill_vp_pages[4]);
3469 3469 page_unlock(pp);
3470 3470 *downsize = 1;
3471 3471 *ret_pszc = pp->p_szc;
3472 3472 goto out;
3473 3473 }
3474 3474 targpp = pp;
3475 3475 if (io_pplist != NULL) {
3476 3476 VM_STAT_ADD(segvnvmstats.fill_vp_pages[5]);
3477 3477 io_len = off - io_off;
3478 3478 /*
3479 3479 * Some file systems like NFS don't check EOF
3480 3480 * conditions in VOP_PAGEIO(). Check it here
3481 3481 * now that pages are locked SE_EXCL. Any file
3482 3482 * truncation will wait until the pages are
3483 3483 * unlocked so no need to worry that file will
3484 3484 * be truncated after we check its size here.
3485 3485 * XXX fix NFS to remove this check.
3486 3486 */
3487 3487 va.va_mask = AT_SIZE;
3488 3488 if (VOP_GETATTR(vp, &va, ATTR_HINT, svd->cred, NULL)) {
3489 3489 VM_STAT_ADD(segvnvmstats.fill_vp_pages[6]);
3490 3490 page_unlock(targpp);
3491 3491 goto out;
3492 3492 }
3493 3493 if (btopr(va.va_size) < btopr(io_off + io_len)) {
3494 3494 VM_STAT_ADD(segvnvmstats.fill_vp_pages[7]);
3495 3495 *downsize = 1;
3496 3496 *ret_pszc = 0;
3497 3497 page_unlock(targpp);
3498 3498 goto out;
3499 3499 }
3500 3500 io_err = VOP_PAGEIO(vp, io_pplist, io_off, io_len,
3501 3501 B_READ, svd->cred, NULL);
3502 3502 if (io_err) {
3503 3503 VM_STAT_ADD(segvnvmstats.fill_vp_pages[8]);
3504 3504 page_unlock(targpp);
3505 3505 if (io_err == EDEADLK) {
3506 3506 segvn_vmpss_pageio_deadlk_err++;
3507 3507 }
3508 3508 goto out;
3509 3509 }
3510 3510 nios++;
3511 3511 VM_STAT_ADD(segvnvmstats.fill_vp_pages[9]);
3512 3512 while (io_pplist != NULL) {
3513 3513 pp = io_pplist;
3514 3514 page_sub(&io_pplist, pp);
3515 3515 ASSERT(page_iolock_assert(pp));
3516 3516 page_io_unlock(pp);
3517 3517 pgidx = (pp->p_offset - start_off) >>
3518 3518 PAGESHIFT;
3519 3519 ASSERT(pgidx < pages);
3520 3520 ppa[pgidx] = pp;
3521 3521 page_list_concat(&done_pplist, &pp);
3522 3522 }
3523 3523 }
3524 3524 pp = targpp;
3525 3525 ASSERT(PAGE_EXCL(pp));
3526 3526 ASSERT(pp->p_szc <= pszc);
3527 3527 if (pszc != 0 && !group_page_trylock(pp, SE_EXCL)) {
3528 3528 VM_STAT_ADD(segvnvmstats.fill_vp_pages[10]);
3529 3529 page_unlock(pp);
3530 3530 *downsize = 1;
3531 3531 *ret_pszc = pp->p_szc;
3532 3532 goto out;
3533 3533 }
3534 3534 VM_STAT_ADD(segvnvmstats.fill_vp_pages[11]);
3535 3535 /*
3536 3536 * page szc chould have changed before the entire group was
3537 3537 * locked. reread page szc.
3538 3538 */
3539 3539 pszc = pp->p_szc;
3540 3540 ppages = page_get_pagecnt(pszc);
3541 3541
3542 3542 /* link just the roots */
3543 3543 page_list_concat(&targ_pplist, &pp);
3544 3544 page_sub(&pplist, newpp);
3545 3545 page_list_concat(&repl_pplist, &newpp);
3546 3546 off += PAGESIZE;
3547 3547 while (--ppages != 0) {
3548 3548 newpp = pplist;
3549 3549 page_sub(&pplist, newpp);
3550 3550 off += PAGESIZE;
3551 3551 }
3552 3552 io_off = off;
3553 3553 }
3554 3554 if (io_pplist != NULL) {
3555 3555 VM_STAT_ADD(segvnvmstats.fill_vp_pages[12]);
3556 3556 io_len = eoff - io_off;
3557 3557 va.va_mask = AT_SIZE;
3558 3558 if (VOP_GETATTR(vp, &va, ATTR_HINT, svd->cred, NULL) != 0) {
3559 3559 VM_STAT_ADD(segvnvmstats.fill_vp_pages[13]);
3560 3560 goto out;
3561 3561 }
3562 3562 if (btopr(va.va_size) < btopr(io_off + io_len)) {
3563 3563 VM_STAT_ADD(segvnvmstats.fill_vp_pages[14]);
3564 3564 *downsize = 1;
3565 3565 *ret_pszc = 0;
3566 3566 goto out;
3567 3567 }
3568 3568 io_err = VOP_PAGEIO(vp, io_pplist, io_off, io_len,
3569 3569 B_READ, svd->cred, NULL);
3570 3570 if (io_err) {
3571 3571 VM_STAT_ADD(segvnvmstats.fill_vp_pages[15]);
3572 3572 if (io_err == EDEADLK) {
3573 3573 segvn_vmpss_pageio_deadlk_err++;
3574 3574 }
3575 3575 goto out;
3576 3576 }
3577 3577 nios++;
3578 3578 while (io_pplist != NULL) {
3579 3579 pp = io_pplist;
3580 3580 page_sub(&io_pplist, pp);
3581 3581 ASSERT(page_iolock_assert(pp));
3582 3582 page_io_unlock(pp);
3583 3583 pgidx = (pp->p_offset - start_off) >> PAGESHIFT;
3584 3584 ASSERT(pgidx < pages);
3585 3585 ppa[pgidx] = pp;
3586 3586 }
3587 3587 }
3588 3588 /*
3589 3589 * we're now bound to succeed or panic.
3590 3590 * remove pages from done_pplist. it's not needed anymore.
3591 3591 */
3592 3592 while (done_pplist != NULL) {
3593 3593 pp = done_pplist;
3594 3594 page_sub(&done_pplist, pp);
3595 3595 }
3596 3596 VM_STAT_ADD(segvnvmstats.fill_vp_pages[16]);
3597 3597 ASSERT(pplist == NULL);
3598 3598 *ppplist = NULL;
3599 3599 while (targ_pplist != NULL) {
3600 3600 int ret;
3601 3601 VM_STAT_ADD(segvnvmstats.fill_vp_pages[17]);
3602 3602 ASSERT(repl_pplist);
3603 3603 pp = targ_pplist;
3604 3604 page_sub(&targ_pplist, pp);
3605 3605 pgidx = (pp->p_offset - start_off) >> PAGESHIFT;
3606 3606 newpp = repl_pplist;
3607 3607 page_sub(&repl_pplist, newpp);
3608 3608 #ifdef DEBUG
3609 3609 pfn = page_pptonum(pp);
3610 3610 pszc = pp->p_szc;
3611 3611 ppages = page_get_pagecnt(pszc);
3612 3612 ASSERT(IS_P2ALIGNED(pfn, ppages));
3613 3613 pfn = page_pptonum(newpp);
3614 3614 ASSERT(IS_P2ALIGNED(pfn, ppages));
3615 3615 ASSERT(P2PHASE(pfn, pages) == pgidx);
3616 3616 #endif
3617 3617 nreloc = 0;
3618 3618 ret = page_relocate(&pp, &newpp, 0, 1, &nreloc, NULL);
3619 3619 if (ret != 0 || nreloc == 0) {
3620 3620 panic("segvn_fill_vp_pages: "
3621 3621 "page_relocate failed");
3622 3622 }
3623 3623 pp = newpp;
3624 3624 while (nreloc-- != 0) {
3625 3625 ASSERT(PAGE_EXCL(pp));
3626 3626 ASSERT(pp->p_vnode == vp);
3627 3627 ASSERT(pgidx ==
3628 3628 ((pp->p_offset - start_off) >> PAGESHIFT));
3629 3629 ppa[pgidx++] = pp;
3630 3630 pp++;
3631 3631 }
3632 3632 }
3633 3633
3634 3634 if (svd->type == MAP_PRIVATE) {
3635 3635 VM_STAT_ADD(segvnvmstats.fill_vp_pages[18]);
3636 3636 for (i = 0; i < pages; i++) {
3637 3637 ASSERT(ppa[i] != NULL);
3638 3638 ASSERT(PAGE_EXCL(ppa[i]));
3639 3639 ASSERT(ppa[i]->p_vnode == vp);
3640 3640 ASSERT(ppa[i]->p_offset ==
3641 3641 start_off + (i << PAGESHIFT));
3642 3642 page_downgrade(ppa[i]);
3643 3643 }
3644 3644 ppa[pages] = NULL;
3645 3645 } else {
3646 3646 VM_STAT_ADD(segvnvmstats.fill_vp_pages[19]);
3647 3647 /*
3648 3648 * the caller will still call VOP_GETPAGE() for shared segments
3649 3649 * to check FS write permissions. For private segments we map
3650 3650 * file read only anyway. so no VOP_GETPAGE is needed.
3651 3651 */
3652 3652 for (i = 0; i < pages; i++) {
3653 3653 ASSERT(ppa[i] != NULL);
3654 3654 ASSERT(PAGE_EXCL(ppa[i]));
3655 3655 ASSERT(ppa[i]->p_vnode == vp);
3656 3656 ASSERT(ppa[i]->p_offset ==
3657 3657 start_off + (i << PAGESHIFT));
3658 3658 page_unlock(ppa[i]);
3659 3659 }
3660 3660 ppa[0] = NULL;
3661 3661 }
3662 3662
3663 3663 return (1);
3664 3664 out:
3665 3665 /*
3666 3666 * Do the cleanup. Unlock target pages we didn't relocate. They are
3667 3667 * linked on targ_pplist by root pages. reassemble unused replacement
3668 3668 * and io pages back to pplist.
3669 3669 */
3670 3670 if (io_pplist != NULL) {
3671 3671 VM_STAT_ADD(segvnvmstats.fill_vp_pages[20]);
3672 3672 pp = io_pplist;
3673 3673 do {
3674 3674 ASSERT(pp->p_vnode == vp);
3675 3675 ASSERT(pp->p_offset == io_off);
3676 3676 ASSERT(page_iolock_assert(pp));
3677 3677 page_io_unlock(pp);
3678 3678 page_hashout(pp, NULL);
3679 3679 io_off += PAGESIZE;
3680 3680 } while ((pp = pp->p_next) != io_pplist);
3681 3681 page_list_concat(&io_pplist, &pplist);
3682 3682 pplist = io_pplist;
3683 3683 }
3684 3684 tmp_pplist = NULL;
3685 3685 while (targ_pplist != NULL) {
3686 3686 VM_STAT_ADD(segvnvmstats.fill_vp_pages[21]);
3687 3687 pp = targ_pplist;
3688 3688 ASSERT(PAGE_EXCL(pp));
3689 3689 page_sub(&targ_pplist, pp);
3690 3690
3691 3691 pszc = pp->p_szc;
3692 3692 ppages = page_get_pagecnt(pszc);
3693 3693 ASSERT(IS_P2ALIGNED(page_pptonum(pp), ppages));
3694 3694
3695 3695 if (pszc != 0) {
3696 3696 group_page_unlock(pp);
3697 3697 }
3698 3698 page_unlock(pp);
3699 3699
3700 3700 pp = repl_pplist;
3701 3701 ASSERT(pp != NULL);
3702 3702 ASSERT(PAGE_EXCL(pp));
3703 3703 ASSERT(pp->p_szc == szc);
3704 3704 page_sub(&repl_pplist, pp);
3705 3705
3706 3706 ASSERT(IS_P2ALIGNED(page_pptonum(pp), ppages));
3707 3707
3708 3708 /* relink replacement page */
3709 3709 page_list_concat(&tmp_pplist, &pp);
3710 3710 while (--ppages != 0) {
3711 3711 VM_STAT_ADD(segvnvmstats.fill_vp_pages[22]);
3712 3712 pp++;
3713 3713 ASSERT(PAGE_EXCL(pp));
3714 3714 ASSERT(pp->p_szc == szc);
3715 3715 page_list_concat(&tmp_pplist, &pp);
3716 3716 }
3717 3717 }
3718 3718 if (tmp_pplist != NULL) {
3719 3719 VM_STAT_ADD(segvnvmstats.fill_vp_pages[23]);
3720 3720 page_list_concat(&tmp_pplist, &pplist);
3721 3721 pplist = tmp_pplist;
3722 3722 }
3723 3723 /*
3724 3724 * at this point all pages are either on done_pplist or
3725 3725 * pplist. They can't be all on done_pplist otherwise
3726 3726 * we'd've been done.
3727 3727 */
3728 3728 ASSERT(pplist != NULL);
3729 3729 if (nios != 0) {
3730 3730 VM_STAT_ADD(segvnvmstats.fill_vp_pages[24]);
3731 3731 pp = pplist;
3732 3732 do {
3733 3733 VM_STAT_ADD(segvnvmstats.fill_vp_pages[25]);
3734 3734 ASSERT(pp->p_szc == szc);
3735 3735 ASSERT(PAGE_EXCL(pp));
3736 3736 ASSERT(pp->p_vnode != vp);
3737 3737 pp->p_szc = 0;
3738 3738 } while ((pp = pp->p_next) != pplist);
3739 3739
3740 3740 pp = done_pplist;
3741 3741 do {
3742 3742 VM_STAT_ADD(segvnvmstats.fill_vp_pages[26]);
3743 3743 ASSERT(pp->p_szc == szc);
3744 3744 ASSERT(PAGE_EXCL(pp));
3745 3745 ASSERT(pp->p_vnode == vp);
3746 3746 pp->p_szc = 0;
3747 3747 } while ((pp = pp->p_next) != done_pplist);
3748 3748
3749 3749 while (pplist != NULL) {
3750 3750 VM_STAT_ADD(segvnvmstats.fill_vp_pages[27]);
3751 3751 pp = pplist;
3752 3752 page_sub(&pplist, pp);
3753 3753 page_free(pp, 0);
3754 3754 }
3755 3755
3756 3756 while (done_pplist != NULL) {
3757 3757 VM_STAT_ADD(segvnvmstats.fill_vp_pages[28]);
3758 3758 pp = done_pplist;
3759 3759 page_sub(&done_pplist, pp);
3760 3760 page_unlock(pp);
3761 3761 }
3762 3762 *ppplist = NULL;
3763 3763 return (0);
3764 3764 }
3765 3765 ASSERT(pplist == *ppplist);
3766 3766 if (io_err) {
3767 3767 VM_STAT_ADD(segvnvmstats.fill_vp_pages[29]);
3768 3768 /*
3769 3769 * don't downsize on io error.
3770 3770 * see if vop_getpage succeeds.
3771 3771 * pplist may still be used in this case
3772 3772 * for relocations.
3773 3773 */
3774 3774 return (0);
3775 3775 }
3776 3776 VM_STAT_ADD(segvnvmstats.fill_vp_pages[30]);
3777 3777 page_free_replacement_page(pplist);
3778 3778 page_create_putback(pages);
3779 3779 *ppplist = NULL;
3780 3780 return (0);
3781 3781 }
3782 3782
3783 3783 int segvn_anypgsz = 0;
3784 3784
3785 3785 #define SEGVN_RESTORE_SOFTLOCK_VP(type, pages) \
3786 3786 if ((type) == F_SOFTLOCK) { \
3787 3787 atomic_add_long((ulong_t *)&(svd)->softlockcnt, \
3788 3788 -(pages)); \
3789 3789 }
3790 3790
3791 3791 #define SEGVN_UPDATE_MODBITS(ppa, pages, rw, prot, vpprot) \
3792 3792 if (IS_VMODSORT((ppa)[0]->p_vnode)) { \
3793 3793 if ((rw) == S_WRITE) { \
3794 3794 for (i = 0; i < (pages); i++) { \
3795 3795 ASSERT((ppa)[i]->p_vnode == \
3796 3796 (ppa)[0]->p_vnode); \
3797 3797 hat_setmod((ppa)[i]); \
3798 3798 } \
3799 3799 } else if ((rw) != S_OTHER && \
3800 3800 ((prot) & (vpprot) & PROT_WRITE)) { \
3801 3801 for (i = 0; i < (pages); i++) { \
3802 3802 ASSERT((ppa)[i]->p_vnode == \
3803 3803 (ppa)[0]->p_vnode); \
3804 3804 if (!hat_ismod((ppa)[i])) { \
3805 3805 prot &= ~PROT_WRITE; \
3806 3806 break; \
3807 3807 } \
3808 3808 } \
3809 3809 } \
3810 3810 }
3811 3811
3812 3812 #ifdef VM_STATS
3813 3813
3814 3814 #define SEGVN_VMSTAT_FLTVNPAGES(idx) \
3815 3815 VM_STAT_ADD(segvnvmstats.fltvnpages[(idx)]);
3816 3816
3817 3817 #else /* VM_STATS */
3818 3818
3819 3819 #define SEGVN_VMSTAT_FLTVNPAGES(idx)
3820 3820
3821 3821 #endif
3822 3822
3823 3823 static faultcode_t
3824 3824 segvn_fault_vnodepages(struct hat *hat, struct seg *seg, caddr_t lpgaddr,
3825 3825 caddr_t lpgeaddr, enum fault_type type, enum seg_rw rw, caddr_t addr,
3826 3826 caddr_t eaddr, int brkcow)
3827 3827 {
3828 3828 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
3829 3829 struct anon_map *amp = svd->amp;
3830 3830 uchar_t segtype = svd->type;
3831 3831 uint_t szc = seg->s_szc;
3832 3832 size_t pgsz = page_get_pagesize(szc);
3833 3833 size_t maxpgsz = pgsz;
3834 3834 pgcnt_t pages = btop(pgsz);
3835 3835 pgcnt_t maxpages = pages;
3836 3836 size_t ppasize = (pages + 1) * sizeof (page_t *);
3837 3837 caddr_t a = lpgaddr;
3838 3838 caddr_t maxlpgeaddr = lpgeaddr;
3839 3839 u_offset_t off = svd->offset + (uintptr_t)(a - seg->s_base);
3840 3840 ulong_t aindx = svd->anon_index + seg_page(seg, a);
3841 3841 struct vpage *vpage = (svd->vpage != NULL) ?
3842 3842 &svd->vpage[seg_page(seg, a)] : NULL;
3843 3843 vnode_t *vp = svd->vp;
3844 3844 page_t **ppa;
3845 3845 uint_t pszc;
3846 3846 size_t ppgsz;
3847 3847 pgcnt_t ppages;
3848 3848 faultcode_t err = 0;
3849 3849 int ierr;
3850 3850 int vop_size_err = 0;
3851 3851 uint_t protchk, prot, vpprot;
3852 3852 ulong_t i;
3853 3853 int hat_flag = (type == F_SOFTLOCK) ? HAT_LOAD_LOCK : HAT_LOAD;
3854 3854 anon_sync_obj_t an_cookie;
3855 3855 enum seg_rw arw;
3856 3856 int alloc_failed = 0;
3857 3857 int adjszc_chk;
3858 3858 struct vattr va;
3859 3859 page_t *pplist;
3860 3860 pfn_t pfn;
3861 3861 int physcontig;
3862 3862 int upgrdfail;
3863 3863 int segvn_anypgsz_vnode = 0; /* for now map vnode with 2 page sizes */
3864 3864 int tron = (svd->tr_state == SEGVN_TR_ON);
3865 3865
3866 3866 ASSERT(szc != 0);
3867 3867 ASSERT(vp != NULL);
3868 3868 ASSERT(brkcow == 0 || amp != NULL);
3869 3869 ASSERT(tron == 0 || amp != NULL);
3870 3870 ASSERT(enable_mbit_wa == 0); /* no mbit simulations with large pages */
3871 3871 ASSERT(!(svd->flags & MAP_NORESERVE));
3872 3872 ASSERT(type != F_SOFTUNLOCK);
3873 3873 ASSERT(IS_P2ALIGNED(a, maxpgsz));
3874 3874 ASSERT(amp == NULL || IS_P2ALIGNED(aindx, maxpages));
3875 3875 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
3876 3876 ASSERT(seg->s_szc < NBBY * sizeof (int));
3877 3877 ASSERT(type != F_SOFTLOCK || lpgeaddr - a == maxpgsz);
3878 3878 ASSERT(svd->tr_state != SEGVN_TR_INIT);
3879 3879
3880 3880 VM_STAT_COND_ADD(type == F_SOFTLOCK, segvnvmstats.fltvnpages[0]);
3881 3881 VM_STAT_COND_ADD(type != F_SOFTLOCK, segvnvmstats.fltvnpages[1]);
3882 3882
3883 3883 if (svd->flags & MAP_TEXT) {
3884 3884 hat_flag |= HAT_LOAD_TEXT;
3885 3885 }
3886 3886
3887 3887 if (svd->pageprot) {
3888 3888 switch (rw) {
3889 3889 case S_READ:
3890 3890 protchk = PROT_READ;
3891 3891 break;
3892 3892 case S_WRITE:
3893 3893 protchk = PROT_WRITE;
3894 3894 break;
3895 3895 case S_EXEC:
3896 3896 protchk = PROT_EXEC;
3897 3897 break;
3898 3898 case S_OTHER:
3899 3899 default:
3900 3900 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
3901 3901 break;
3902 3902 }
3903 3903 } else {
3904 3904 prot = svd->prot;
3905 3905 /* caller has already done segment level protection check. */
3906 3906 }
3907 3907
3908 3908 if (rw == S_WRITE && segtype == MAP_PRIVATE) {
3909 3909 SEGVN_VMSTAT_FLTVNPAGES(2);
3910 3910 arw = S_READ;
3911 3911 } else {
3912 3912 arw = rw;
3913 3913 }
3914 3914
3915 3915 ppa = kmem_alloc(ppasize, KM_SLEEP);
3916 3916
3917 3917 VM_STAT_COND_ADD(amp != NULL, segvnvmstats.fltvnpages[3]);
3918 3918
3919 3919 for (;;) {
3920 3920 adjszc_chk = 0;
3921 3921 for (; a < lpgeaddr; a += pgsz, off += pgsz, aindx += pages) {
3922 3922 if (adjszc_chk) {
3923 3923 while (szc < seg->s_szc) {
3924 3924 uintptr_t e;
3925 3925 uint_t tszc;
3926 3926 tszc = segvn_anypgsz_vnode ? szc + 1 :
3927 3927 seg->s_szc;
3928 3928 ppgsz = page_get_pagesize(tszc);
3929 3929 if (!IS_P2ALIGNED(a, ppgsz) ||
3930 3930 ((alloc_failed >> tszc) & 0x1)) {
3931 3931 break;
3932 3932 }
3933 3933 SEGVN_VMSTAT_FLTVNPAGES(4);
3934 3934 szc = tszc;
3935 3935 pgsz = ppgsz;
3936 3936 pages = btop(pgsz);
3937 3937 e = P2ROUNDUP((uintptr_t)eaddr, pgsz);
3938 3938 lpgeaddr = (caddr_t)e;
3939 3939 }
3940 3940 }
3941 3941
3942 3942 again:
3943 3943 if (IS_P2ALIGNED(a, maxpgsz) && amp != NULL) {
3944 3944 ASSERT(IS_P2ALIGNED(aindx, maxpages));
3945 3945 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
3946 3946 anon_array_enter(amp, aindx, &an_cookie);
3947 3947 if (anon_get_ptr(amp->ahp, aindx) != NULL) {
3948 3948 SEGVN_VMSTAT_FLTVNPAGES(5);
3949 3949 ASSERT(anon_pages(amp->ahp, aindx,
3950 3950 maxpages) == maxpages);
3951 3951 anon_array_exit(&an_cookie);
3952 3952 ANON_LOCK_EXIT(&->a_rwlock);
3953 3953 err = segvn_fault_anonpages(hat, seg,
3954 3954 a, a + maxpgsz, type, rw,
3955 3955 MAX(a, addr),
3956 3956 MIN(a + maxpgsz, eaddr), brkcow);
3957 3957 if (err != 0) {
3958 3958 SEGVN_VMSTAT_FLTVNPAGES(6);
3959 3959 goto out;
3960 3960 }
3961 3961 if (szc < seg->s_szc) {
3962 3962 szc = seg->s_szc;
3963 3963 pgsz = maxpgsz;
3964 3964 pages = maxpages;
3965 3965 lpgeaddr = maxlpgeaddr;
3966 3966 }
3967 3967 goto next;
3968 3968 } else {
3969 3969 ASSERT(anon_pages(amp->ahp, aindx,
3970 3970 maxpages) == 0);
3971 3971 SEGVN_VMSTAT_FLTVNPAGES(7);
3972 3972 anon_array_exit(&an_cookie);
3973 3973 ANON_LOCK_EXIT(&->a_rwlock);
3974 3974 }
3975 3975 }
3976 3976 ASSERT(!brkcow || IS_P2ALIGNED(a, maxpgsz));
3977 3977 ASSERT(!tron || IS_P2ALIGNED(a, maxpgsz));
3978 3978
3979 3979 if (svd->pageprot != 0 && IS_P2ALIGNED(a, maxpgsz)) {
3980 3980 ASSERT(vpage != NULL);
3981 3981 prot = VPP_PROT(vpage);
3982 3982 ASSERT(sameprot(seg, a, maxpgsz));
3983 3983 if ((prot & protchk) == 0) {
3984 3984 SEGVN_VMSTAT_FLTVNPAGES(8);
3985 3985 err = FC_PROT;
3986 3986 goto out;
3987 3987 }
3988 3988 }
3989 3989 if (type == F_SOFTLOCK) {
3990 3990 atomic_add_long((ulong_t *)&svd->softlockcnt,
3991 3991 pages);
3992 3992 }
3993 3993
3994 3994 pplist = NULL;
3995 3995 physcontig = 0;
3996 3996 ppa[0] = NULL;
3997 3997 if (!brkcow && !tron && szc &&
3998 3998 !page_exists_physcontig(vp, off, szc,
3999 3999 segtype == MAP_PRIVATE ? ppa : NULL)) {
4000 4000 SEGVN_VMSTAT_FLTVNPAGES(9);
4001 4001 if (page_alloc_pages(vp, seg, a, &pplist, NULL,
4002 4002 szc, 0, 0) && type != F_SOFTLOCK) {
4003 4003 SEGVN_VMSTAT_FLTVNPAGES(10);
4004 4004 pszc = 0;
4005 4005 ierr = -1;
4006 4006 alloc_failed |= (1 << szc);
4007 4007 break;
4008 4008 }
4009 4009 if (pplist != NULL &&
4010 4010 vp->v_mpssdata == SEGVN_PAGEIO) {
4011 4011 int downsize;
4012 4012 SEGVN_VMSTAT_FLTVNPAGES(11);
4013 4013 physcontig = segvn_fill_vp_pages(svd,
4014 4014 vp, off, szc, ppa, &pplist,
4015 4015 &pszc, &downsize);
4016 4016 ASSERT(!physcontig || pplist == NULL);
4017 4017 if (!physcontig && downsize &&
4018 4018 type != F_SOFTLOCK) {
4019 4019 ASSERT(pplist == NULL);
4020 4020 SEGVN_VMSTAT_FLTVNPAGES(12);
4021 4021 ierr = -1;
4022 4022 break;
4023 4023 }
4024 4024 ASSERT(!physcontig ||
4025 4025 segtype == MAP_PRIVATE ||
4026 4026 ppa[0] == NULL);
4027 4027 if (physcontig && ppa[0] == NULL) {
4028 4028 physcontig = 0;
4029 4029 }
4030 4030 }
4031 4031 } else if (!brkcow && !tron && szc && ppa[0] != NULL) {
4032 4032 SEGVN_VMSTAT_FLTVNPAGES(13);
4033 4033 ASSERT(segtype == MAP_PRIVATE);
4034 4034 physcontig = 1;
4035 4035 }
4036 4036
4037 4037 if (!physcontig) {
4038 4038 SEGVN_VMSTAT_FLTVNPAGES(14);
4039 4039 ppa[0] = NULL;
4040 4040 ierr = VOP_GETPAGE(vp, (offset_t)off, pgsz,
4041 4041 &vpprot, ppa, pgsz, seg, a, arw,
4042 4042 svd->cred, NULL);
4043 4043 #ifdef DEBUG
4044 4044 if (ierr == 0) {
4045 4045 for (i = 0; i < pages; i++) {
4046 4046 ASSERT(PAGE_LOCKED(ppa[i]));
4047 4047 ASSERT(!PP_ISFREE(ppa[i]));
4048 4048 ASSERT(ppa[i]->p_vnode == vp);
4049 4049 ASSERT(ppa[i]->p_offset ==
4050 4050 off + (i << PAGESHIFT));
4051 4051 }
4052 4052 }
4053 4053 #endif /* DEBUG */
4054 4054 if (segtype == MAP_PRIVATE) {
4055 4055 SEGVN_VMSTAT_FLTVNPAGES(15);
4056 4056 vpprot &= ~PROT_WRITE;
4057 4057 }
4058 4058 } else {
4059 4059 ASSERT(segtype == MAP_PRIVATE);
4060 4060 SEGVN_VMSTAT_FLTVNPAGES(16);
4061 4061 vpprot = PROT_ALL & ~PROT_WRITE;
4062 4062 ierr = 0;
4063 4063 }
4064 4064
4065 4065 if (ierr != 0) {
4066 4066 SEGVN_VMSTAT_FLTVNPAGES(17);
4067 4067 if (pplist != NULL) {
4068 4068 SEGVN_VMSTAT_FLTVNPAGES(18);
4069 4069 page_free_replacement_page(pplist);
4070 4070 page_create_putback(pages);
4071 4071 }
4072 4072 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4073 4073 if (a + pgsz <= eaddr) {
4074 4074 SEGVN_VMSTAT_FLTVNPAGES(19);
4075 4075 err = FC_MAKE_ERR(ierr);
4076 4076 goto out;
4077 4077 }
4078 4078 va.va_mask = AT_SIZE;
4079 4079 if (VOP_GETATTR(vp, &va, 0, svd->cred, NULL)) {
4080 4080 SEGVN_VMSTAT_FLTVNPAGES(20);
4081 4081 err = FC_MAKE_ERR(EIO);
4082 4082 goto out;
4083 4083 }
4084 4084 if (btopr(va.va_size) >= btopr(off + pgsz)) {
4085 4085 SEGVN_VMSTAT_FLTVNPAGES(21);
4086 4086 err = FC_MAKE_ERR(ierr);
4087 4087 goto out;
4088 4088 }
4089 4089 if (btopr(va.va_size) <
4090 4090 btopr(off + (eaddr - a))) {
4091 4091 SEGVN_VMSTAT_FLTVNPAGES(22);
4092 4092 err = FC_MAKE_ERR(ierr);
4093 4093 goto out;
4094 4094 }
4095 4095 if (brkcow || tron || type == F_SOFTLOCK) {
4096 4096 /* can't reduce map area */
4097 4097 SEGVN_VMSTAT_FLTVNPAGES(23);
4098 4098 vop_size_err = 1;
4099 4099 goto out;
4100 4100 }
4101 4101 SEGVN_VMSTAT_FLTVNPAGES(24);
4102 4102 ASSERT(szc != 0);
4103 4103 pszc = 0;
4104 4104 ierr = -1;
4105 4105 break;
4106 4106 }
4107 4107
4108 4108 if (amp != NULL) {
4109 4109 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
4110 4110 anon_array_enter(amp, aindx, &an_cookie);
4111 4111 }
4112 4112 if (amp != NULL &&
4113 4113 anon_get_ptr(amp->ahp, aindx) != NULL) {
4114 4114 ulong_t taindx = P2ALIGN(aindx, maxpages);
4115 4115
4116 4116 SEGVN_VMSTAT_FLTVNPAGES(25);
4117 4117 ASSERT(anon_pages(amp->ahp, taindx,
4118 4118 maxpages) == maxpages);
4119 4119 for (i = 0; i < pages; i++) {
4120 4120 page_unlock(ppa[i]);
4121 4121 }
4122 4122 anon_array_exit(&an_cookie);
4123 4123 ANON_LOCK_EXIT(&->a_rwlock);
4124 4124 if (pplist != NULL) {
4125 4125 page_free_replacement_page(pplist);
4126 4126 page_create_putback(pages);
4127 4127 }
4128 4128 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4129 4129 if (szc < seg->s_szc) {
4130 4130 SEGVN_VMSTAT_FLTVNPAGES(26);
4131 4131 /*
4132 4132 * For private segments SOFTLOCK
4133 4133 * either always breaks cow (any rw
4134 4134 * type except S_READ_NOCOW) or
4135 4135 * address space is locked as writer
4136 4136 * (S_READ_NOCOW case) and anon slots
4137 4137 * can't show up on second check.
4138 4138 * Therefore if we are here for
4139 4139 * SOFTLOCK case it must be a cow
4140 4140 * break but cow break never reduces
4141 4141 * szc. text replication (tron) in
4142 4142 * this case works as cow break.
4143 4143 * Thus the assert below.
4144 4144 */
4145 4145 ASSERT(!brkcow && !tron &&
4146 4146 type != F_SOFTLOCK);
4147 4147 pszc = seg->s_szc;
4148 4148 ierr = -2;
4149 4149 break;
4150 4150 }
4151 4151 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4152 4152 goto again;
4153 4153 }
4154 4154 #ifdef DEBUG
4155 4155 if (amp != NULL) {
4156 4156 ulong_t taindx = P2ALIGN(aindx, maxpages);
4157 4157 ASSERT(!anon_pages(amp->ahp, taindx, maxpages));
4158 4158 }
4159 4159 #endif /* DEBUG */
4160 4160
4161 4161 if (brkcow || tron) {
4162 4162 ASSERT(amp != NULL);
4163 4163 ASSERT(pplist == NULL);
4164 4164 ASSERT(szc == seg->s_szc);
4165 4165 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4166 4166 ASSERT(IS_P2ALIGNED(aindx, maxpages));
4167 4167 SEGVN_VMSTAT_FLTVNPAGES(27);
4168 4168 ierr = anon_map_privatepages(amp, aindx, szc,
4169 4169 seg, a, prot, ppa, vpage, segvn_anypgsz,
4170 4170 tron ? PG_LOCAL : 0, svd->cred);
4171 4171 if (ierr != 0) {
4172 4172 SEGVN_VMSTAT_FLTVNPAGES(28);
4173 4173 anon_array_exit(&an_cookie);
4174 4174 ANON_LOCK_EXIT(&->a_rwlock);
4175 4175 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4176 4176 err = FC_MAKE_ERR(ierr);
4177 4177 goto out;
4178 4178 }
4179 4179
4180 4180 ASSERT(!IS_VMODSORT(ppa[0]->p_vnode));
4181 4181 /*
4182 4182 * p_szc can't be changed for locked
4183 4183 * swapfs pages.
4184 4184 */
4185 4185 ASSERT(svd->rcookie ==
4186 4186 HAT_INVALID_REGION_COOKIE);
4187 4187 hat_memload_array(hat, a, pgsz, ppa, prot,
4188 4188 hat_flag);
4189 4189
4190 4190 if (!(hat_flag & HAT_LOAD_LOCK)) {
4191 4191 SEGVN_VMSTAT_FLTVNPAGES(29);
4192 4192 for (i = 0; i < pages; i++) {
4193 4193 page_unlock(ppa[i]);
4194 4194 }
4195 4195 }
4196 4196 anon_array_exit(&an_cookie);
4197 4197 ANON_LOCK_EXIT(&->a_rwlock);
4198 4198 goto next;
4199 4199 }
4200 4200
4201 4201 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE ||
4202 4202 (!svd->pageprot && svd->prot == (prot & vpprot)));
4203 4203
4204 4204 pfn = page_pptonum(ppa[0]);
4205 4205 /*
4206 4206 * hat_page_demote() needs an SE_EXCL lock on one of
4207 4207 * constituent page_t's and it decreases root's p_szc
4208 4208 * last. This means if root's p_szc is equal szc and
4209 4209 * all its constituent pages are locked
4210 4210 * hat_page_demote() that could have changed p_szc to
4211 4211 * szc is already done and no new have page_demote()
4212 4212 * can start for this large page.
4213 4213 */
4214 4214
4215 4215 /*
4216 4216 * we need to make sure same mapping size is used for
4217 4217 * the same address range if there's a possibility the
4218 4218 * adddress is already mapped because hat layer panics
4219 4219 * when translation is loaded for the range already
4220 4220 * mapped with a different page size. We achieve it
4221 4221 * by always using largest page size possible subject
4222 4222 * to the constraints of page size, segment page size
4223 4223 * and page alignment. Since mappings are invalidated
4224 4224 * when those constraints change and make it
4225 4225 * impossible to use previously used mapping size no
4226 4226 * mapping size conflicts should happen.
4227 4227 */
4228 4228
4229 4229 chkszc:
4230 4230 if ((pszc = ppa[0]->p_szc) == szc &&
4231 4231 IS_P2ALIGNED(pfn, pages)) {
4232 4232
4233 4233 SEGVN_VMSTAT_FLTVNPAGES(30);
4234 4234 #ifdef DEBUG
4235 4235 for (i = 0; i < pages; i++) {
4236 4236 ASSERT(PAGE_LOCKED(ppa[i]));
4237 4237 ASSERT(!PP_ISFREE(ppa[i]));
4238 4238 ASSERT(page_pptonum(ppa[i]) ==
4239 4239 pfn + i);
4240 4240 ASSERT(ppa[i]->p_szc == szc);
4241 4241 ASSERT(ppa[i]->p_vnode == vp);
4242 4242 ASSERT(ppa[i]->p_offset ==
4243 4243 off + (i << PAGESHIFT));
4244 4244 }
4245 4245 #endif /* DEBUG */
4246 4246 /*
4247 4247 * All pages are of szc we need and they are
4248 4248 * all locked so they can't change szc. load
4249 4249 * translations.
4250 4250 *
4251 4251 * if page got promoted since last check
4252 4252 * we don't need pplist.
4253 4253 */
4254 4254 if (pplist != NULL) {
4255 4255 page_free_replacement_page(pplist);
4256 4256 page_create_putback(pages);
4257 4257 }
4258 4258 if (PP_ISMIGRATE(ppa[0])) {
4259 4259 page_migrate(seg, a, ppa, pages);
4260 4260 }
4261 4261 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4262 4262 prot, vpprot);
4263 4263 hat_memload_array_region(hat, a, pgsz,
4264 4264 ppa, prot & vpprot, hat_flag,
4265 4265 svd->rcookie);
4266 4266
4267 4267 if (!(hat_flag & HAT_LOAD_LOCK)) {
4268 4268 for (i = 0; i < pages; i++) {
4269 4269 page_unlock(ppa[i]);
4270 4270 }
4271 4271 }
4272 4272 if (amp != NULL) {
4273 4273 anon_array_exit(&an_cookie);
4274 4274 ANON_LOCK_EXIT(&->a_rwlock);
4275 4275 }
4276 4276 goto next;
4277 4277 }
4278 4278
4279 4279 /*
4280 4280 * See if upsize is possible.
4281 4281 */
4282 4282 if (pszc > szc && szc < seg->s_szc &&
4283 4283 (segvn_anypgsz_vnode || pszc >= seg->s_szc)) {
4284 4284 pgcnt_t aphase;
4285 4285 uint_t pszc1 = MIN(pszc, seg->s_szc);
4286 4286 ppgsz = page_get_pagesize(pszc1);
4287 4287 ppages = btop(ppgsz);
4288 4288 aphase = btop(P2PHASE((uintptr_t)a, ppgsz));
4289 4289
4290 4290 ASSERT(type != F_SOFTLOCK);
4291 4291
4292 4292 SEGVN_VMSTAT_FLTVNPAGES(31);
4293 4293 if (aphase != P2PHASE(pfn, ppages)) {
4294 4294 segvn_faultvnmpss_align_err4++;
4295 4295 } else {
4296 4296 SEGVN_VMSTAT_FLTVNPAGES(32);
4297 4297 if (pplist != NULL) {
4298 4298 page_t *pl = pplist;
4299 4299 page_free_replacement_page(pl);
4300 4300 page_create_putback(pages);
4301 4301 }
4302 4302 for (i = 0; i < pages; i++) {
4303 4303 page_unlock(ppa[i]);
4304 4304 }
4305 4305 if (amp != NULL) {
4306 4306 anon_array_exit(&an_cookie);
4307 4307 ANON_LOCK_EXIT(&->a_rwlock);
4308 4308 }
4309 4309 pszc = pszc1;
4310 4310 ierr = -2;
4311 4311 break;
4312 4312 }
4313 4313 }
4314 4314
4315 4315 /*
4316 4316 * check if we should use smallest mapping size.
4317 4317 */
4318 4318 upgrdfail = 0;
4319 4319 if (szc == 0 ||
4320 4320 (pszc >= szc &&
4321 4321 !IS_P2ALIGNED(pfn, pages)) ||
4322 4322 (pszc < szc &&
4323 4323 !segvn_full_szcpages(ppa, szc, &upgrdfail,
4324 4324 &pszc))) {
4325 4325
4326 4326 if (upgrdfail && type != F_SOFTLOCK) {
4327 4327 /*
4328 4328 * segvn_full_szcpages failed to lock
4329 4329 * all pages EXCL. Size down.
4330 4330 */
4331 4331 ASSERT(pszc < szc);
4332 4332
4333 4333 SEGVN_VMSTAT_FLTVNPAGES(33);
4334 4334
4335 4335 if (pplist != NULL) {
4336 4336 page_t *pl = pplist;
4337 4337 page_free_replacement_page(pl);
4338 4338 page_create_putback(pages);
4339 4339 }
4340 4340
4341 4341 for (i = 0; i < pages; i++) {
4342 4342 page_unlock(ppa[i]);
4343 4343 }
4344 4344 if (amp != NULL) {
4345 4345 anon_array_exit(&an_cookie);
4346 4346 ANON_LOCK_EXIT(&->a_rwlock);
4347 4347 }
4348 4348 ierr = -1;
4349 4349 break;
4350 4350 }
4351 4351 if (szc != 0 && !upgrdfail) {
4352 4352 segvn_faultvnmpss_align_err5++;
4353 4353 }
4354 4354 SEGVN_VMSTAT_FLTVNPAGES(34);
4355 4355 if (pplist != NULL) {
4356 4356 page_free_replacement_page(pplist);
4357 4357 page_create_putback(pages);
4358 4358 }
4359 4359 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4360 4360 prot, vpprot);
4361 4361 if (upgrdfail && segvn_anypgsz_vnode) {
4362 4362 /* SOFTLOCK case */
4363 4363 hat_memload_array_region(hat, a, pgsz,
4364 4364 ppa, prot & vpprot, hat_flag,
4365 4365 svd->rcookie);
4366 4366 } else {
4367 4367 for (i = 0; i < pages; i++) {
4368 4368 hat_memload_region(hat,
4369 4369 a + (i << PAGESHIFT),
4370 4370 ppa[i], prot & vpprot,
4371 4371 hat_flag, svd->rcookie);
4372 4372 }
4373 4373 }
4374 4374 if (!(hat_flag & HAT_LOAD_LOCK)) {
4375 4375 for (i = 0; i < pages; i++) {
4376 4376 page_unlock(ppa[i]);
4377 4377 }
4378 4378 }
4379 4379 if (amp != NULL) {
4380 4380 anon_array_exit(&an_cookie);
4381 4381 ANON_LOCK_EXIT(&->a_rwlock);
4382 4382 }
4383 4383 goto next;
4384 4384 }
4385 4385
4386 4386 if (pszc == szc) {
4387 4387 /*
4388 4388 * segvn_full_szcpages() upgraded pages szc.
4389 4389 */
4390 4390 ASSERT(pszc == ppa[0]->p_szc);
4391 4391 ASSERT(IS_P2ALIGNED(pfn, pages));
4392 4392 goto chkszc;
4393 4393 }
4394 4394
4395 4395 if (pszc > szc) {
4396 4396 kmutex_t *szcmtx;
4397 4397 SEGVN_VMSTAT_FLTVNPAGES(35);
4398 4398 /*
4399 4399 * p_szc of ppa[0] can change since we haven't
4400 4400 * locked all constituent pages. Call
4401 4401 * page_lock_szc() to prevent szc changes.
4402 4402 * This should be a rare case that happens when
4403 4403 * multiple segments use a different page size
4404 4404 * to map the same file offsets.
4405 4405 */
4406 4406 szcmtx = page_szc_lock(ppa[0]);
4407 4407 pszc = ppa[0]->p_szc;
4408 4408 ASSERT(szcmtx != NULL || pszc == 0);
4409 4409 ASSERT(ppa[0]->p_szc <= pszc);
4410 4410 if (pszc <= szc) {
4411 4411 SEGVN_VMSTAT_FLTVNPAGES(36);
4412 4412 if (szcmtx != NULL) {
4413 4413 mutex_exit(szcmtx);
4414 4414 }
4415 4415 goto chkszc;
4416 4416 }
4417 4417 if (pplist != NULL) {
4418 4418 /*
4419 4419 * page got promoted since last check.
4420 4420 * we don't need preaalocated large
4421 4421 * page.
4422 4422 */
4423 4423 SEGVN_VMSTAT_FLTVNPAGES(37);
4424 4424 page_free_replacement_page(pplist);
4425 4425 page_create_putback(pages);
4426 4426 }
4427 4427 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4428 4428 prot, vpprot);
4429 4429 hat_memload_array_region(hat, a, pgsz, ppa,
4430 4430 prot & vpprot, hat_flag, svd->rcookie);
4431 4431 mutex_exit(szcmtx);
4432 4432 if (!(hat_flag & HAT_LOAD_LOCK)) {
4433 4433 for (i = 0; i < pages; i++) {
4434 4434 page_unlock(ppa[i]);
4435 4435 }
4436 4436 }
4437 4437 if (amp != NULL) {
4438 4438 anon_array_exit(&an_cookie);
4439 4439 ANON_LOCK_EXIT(&->a_rwlock);
4440 4440 }
4441 4441 goto next;
4442 4442 }
4443 4443
4444 4444 /*
4445 4445 * if page got demoted since last check
4446 4446 * we could have not allocated larger page.
4447 4447 * allocate now.
4448 4448 */
4449 4449 if (pplist == NULL &&
4450 4450 page_alloc_pages(vp, seg, a, &pplist, NULL,
4451 4451 szc, 0, 0) && type != F_SOFTLOCK) {
4452 4452 SEGVN_VMSTAT_FLTVNPAGES(38);
4453 4453 for (i = 0; i < pages; i++) {
4454 4454 page_unlock(ppa[i]);
4455 4455 }
4456 4456 if (amp != NULL) {
4457 4457 anon_array_exit(&an_cookie);
4458 4458 ANON_LOCK_EXIT(&->a_rwlock);
4459 4459 }
4460 4460 ierr = -1;
4461 4461 alloc_failed |= (1 << szc);
4462 4462 break;
4463 4463 }
4464 4464
4465 4465 SEGVN_VMSTAT_FLTVNPAGES(39);
4466 4466
4467 4467 if (pplist != NULL) {
4468 4468 segvn_relocate_pages(ppa, pplist);
4469 4469 #ifdef DEBUG
4470 4470 } else {
4471 4471 ASSERT(type == F_SOFTLOCK);
4472 4472 SEGVN_VMSTAT_FLTVNPAGES(40);
4473 4473 #endif /* DEBUG */
4474 4474 }
4475 4475
4476 4476 SEGVN_UPDATE_MODBITS(ppa, pages, rw, prot, vpprot);
4477 4477
4478 4478 if (pplist == NULL && segvn_anypgsz_vnode == 0) {
4479 4479 ASSERT(type == F_SOFTLOCK);
4480 4480 for (i = 0; i < pages; i++) {
4481 4481 ASSERT(ppa[i]->p_szc < szc);
4482 4482 hat_memload_region(hat,
4483 4483 a + (i << PAGESHIFT),
4484 4484 ppa[i], prot & vpprot, hat_flag,
4485 4485 svd->rcookie);
4486 4486 }
4487 4487 } else {
4488 4488 ASSERT(pplist != NULL || type == F_SOFTLOCK);
4489 4489 hat_memload_array_region(hat, a, pgsz, ppa,
4490 4490 prot & vpprot, hat_flag, svd->rcookie);
4491 4491 }
4492 4492 if (!(hat_flag & HAT_LOAD_LOCK)) {
4493 4493 for (i = 0; i < pages; i++) {
4494 4494 ASSERT(PAGE_SHARED(ppa[i]));
4495 4495 page_unlock(ppa[i]);
4496 4496 }
4497 4497 }
4498 4498 if (amp != NULL) {
4499 4499 anon_array_exit(&an_cookie);
4500 4500 ANON_LOCK_EXIT(&->a_rwlock);
4501 4501 }
4502 4502
4503 4503 next:
4504 4504 if (vpage != NULL) {
4505 4505 vpage += pages;
4506 4506 }
4507 4507 adjszc_chk = 1;
4508 4508 }
4509 4509 if (a == lpgeaddr)
4510 4510 break;
4511 4511 ASSERT(a < lpgeaddr);
4512 4512
4513 4513 ASSERT(!brkcow && !tron && type != F_SOFTLOCK);
4514 4514
4515 4515 /*
4516 4516 * ierr == -1 means we failed to map with a large page.
4517 4517 * (either due to allocation/relocation failures or
4518 4518 * misalignment with other mappings to this file.
4519 4519 *
4520 4520 * ierr == -2 means some other thread allocated a large page
4521 4521 * after we gave up tp map with a large page. retry with
4522 4522 * larger mapping.
4523 4523 */
4524 4524 ASSERT(ierr == -1 || ierr == -2);
4525 4525 ASSERT(ierr == -2 || szc != 0);
4526 4526 ASSERT(ierr == -1 || szc < seg->s_szc);
4527 4527 if (ierr == -2) {
4528 4528 SEGVN_VMSTAT_FLTVNPAGES(41);
4529 4529 ASSERT(pszc > szc && pszc <= seg->s_szc);
4530 4530 szc = pszc;
4531 4531 } else if (segvn_anypgsz_vnode) {
4532 4532 SEGVN_VMSTAT_FLTVNPAGES(42);
4533 4533 szc--;
4534 4534 } else {
4535 4535 SEGVN_VMSTAT_FLTVNPAGES(43);
4536 4536 ASSERT(pszc < szc);
4537 4537 /*
4538 4538 * other process created pszc large page.
4539 4539 * but we still have to drop to 0 szc.
4540 4540 */
4541 4541 szc = 0;
4542 4542 }
4543 4543
4544 4544 pgsz = page_get_pagesize(szc);
4545 4545 pages = btop(pgsz);
4546 4546 if (ierr == -2) {
4547 4547 /*
4548 4548 * Size up case. Note lpgaddr may only be needed for
4549 4549 * softlock case so we don't adjust it here.
4550 4550 */
4551 4551 a = (caddr_t)P2ALIGN((uintptr_t)a, pgsz);
4552 4552 ASSERT(a >= lpgaddr);
4553 4553 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4554 4554 off = svd->offset + (uintptr_t)(a - seg->s_base);
4555 4555 aindx = svd->anon_index + seg_page(seg, a);
4556 4556 vpage = (svd->vpage != NULL) ?
4557 4557 &svd->vpage[seg_page(seg, a)] : NULL;
4558 4558 } else {
4559 4559 /*
4560 4560 * Size down case. Note lpgaddr may only be needed for
4561 4561 * softlock case so we don't adjust it here.
4562 4562 */
4563 4563 ASSERT(IS_P2ALIGNED(a, pgsz));
4564 4564 ASSERT(IS_P2ALIGNED(lpgeaddr, pgsz));
4565 4565 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4566 4566 ASSERT(a < lpgeaddr);
4567 4567 if (a < addr) {
4568 4568 SEGVN_VMSTAT_FLTVNPAGES(44);
4569 4569 /*
4570 4570 * The beginning of the large page region can
4571 4571 * be pulled to the right to make a smaller
4572 4572 * region. We haven't yet faulted a single
4573 4573 * page.
4574 4574 */
4575 4575 a = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
4576 4576 ASSERT(a >= lpgaddr);
4577 4577 off = svd->offset +
4578 4578 (uintptr_t)(a - seg->s_base);
4579 4579 aindx = svd->anon_index + seg_page(seg, a);
4580 4580 vpage = (svd->vpage != NULL) ?
4581 4581 &svd->vpage[seg_page(seg, a)] : NULL;
4582 4582 }
4583 4583 }
4584 4584 }
4585 4585 out:
4586 4586 kmem_free(ppa, ppasize);
4587 4587 if (!err && !vop_size_err) {
4588 4588 SEGVN_VMSTAT_FLTVNPAGES(45);
4589 4589 return (0);
4590 4590 }
4591 4591 if (type == F_SOFTLOCK && a > lpgaddr) {
4592 4592 SEGVN_VMSTAT_FLTVNPAGES(46);
4593 4593 segvn_softunlock(seg, lpgaddr, a - lpgaddr, S_OTHER);
4594 4594 }
4595 4595 if (!vop_size_err) {
4596 4596 SEGVN_VMSTAT_FLTVNPAGES(47);
4597 4597 return (err);
4598 4598 }
4599 4599 ASSERT(brkcow || tron || type == F_SOFTLOCK);
4600 4600 /*
4601 4601 * Large page end is mapped beyond the end of file and it's a cow
4602 4602 * fault (can be a text replication induced cow) or softlock so we can't
4603 4603 * reduce the map area. For now just demote the segment. This should
4604 4604 * really only happen if the end of the file changed after the mapping
4605 4605 * was established since when large page segments are created we make
4606 4606 * sure they don't extend beyond the end of the file.
4607 4607 */
4608 4608 SEGVN_VMSTAT_FLTVNPAGES(48);
4609 4609
4610 4610 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4611 4611 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
4612 4612 err = 0;
4613 4613 if (seg->s_szc != 0) {
4614 4614 segvn_fltvnpages_clrszc_cnt++;
4615 4615 ASSERT(svd->softlockcnt == 0);
4616 4616 err = segvn_clrszc(seg);
4617 4617 if (err != 0) {
4618 4618 segvn_fltvnpages_clrszc_err++;
4619 4619 }
4620 4620 }
4621 4621 ASSERT(err || seg->s_szc == 0);
4622 4622 SEGVN_LOCK_DOWNGRADE(seg->s_as, &svd->lock);
4623 4623 /* segvn_fault will do its job as if szc had been zero to begin with */
4624 4624 return (err == 0 ? IE_RETRY : FC_MAKE_ERR(err));
4625 4625 }
4626 4626
4627 4627 /*
4628 4628 * This routine will attempt to fault in one large page.
4629 4629 * it will use smaller pages if that fails.
4630 4630 * It should only be called for pure anonymous segments.
4631 4631 */
4632 4632 static faultcode_t
4633 4633 segvn_fault_anonpages(struct hat *hat, struct seg *seg, caddr_t lpgaddr,
4634 4634 caddr_t lpgeaddr, enum fault_type type, enum seg_rw rw, caddr_t addr,
4635 4635 caddr_t eaddr, int brkcow)
4636 4636 {
4637 4637 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
4638 4638 struct anon_map *amp = svd->amp;
4639 4639 uchar_t segtype = svd->type;
4640 4640 uint_t szc = seg->s_szc;
4641 4641 size_t pgsz = page_get_pagesize(szc);
4642 4642 size_t maxpgsz = pgsz;
4643 4643 pgcnt_t pages = btop(pgsz);
4644 4644 uint_t ppaszc = szc;
4645 4645 caddr_t a = lpgaddr;
4646 4646 ulong_t aindx = svd->anon_index + seg_page(seg, a);
4647 4647 struct vpage *vpage = (svd->vpage != NULL) ?
4648 4648 &svd->vpage[seg_page(seg, a)] : NULL;
4649 4649 page_t **ppa;
4650 4650 uint_t ppa_szc;
4651 4651 faultcode_t err;
4652 4652 int ierr;
4653 4653 uint_t protchk, prot, vpprot;
4654 4654 ulong_t i;
4655 4655 int hat_flag = (type == F_SOFTLOCK) ? HAT_LOAD_LOCK : HAT_LOAD;
4656 4656 anon_sync_obj_t cookie;
4657 4657 int adjszc_chk;
4658 4658 int pgflags = (svd->tr_state == SEGVN_TR_ON) ? PG_LOCAL : 0;
4659 4659
4660 4660 ASSERT(szc != 0);
4661 4661 ASSERT(amp != NULL);
4662 4662 ASSERT(enable_mbit_wa == 0); /* no mbit simulations with large pages */
4663 4663 ASSERT(!(svd->flags & MAP_NORESERVE));
4664 4664 ASSERT(type != F_SOFTUNLOCK);
4665 4665 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4666 4666 ASSERT(!brkcow || svd->tr_state == SEGVN_TR_OFF);
4667 4667 ASSERT(svd->tr_state != SEGVN_TR_INIT);
4668 4668
4669 4669 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
4670 4670
4671 4671 VM_STAT_COND_ADD(type == F_SOFTLOCK, segvnvmstats.fltanpages[0]);
4672 4672 VM_STAT_COND_ADD(type != F_SOFTLOCK, segvnvmstats.fltanpages[1]);
4673 4673
4674 4674 if (svd->flags & MAP_TEXT) {
4675 4675 hat_flag |= HAT_LOAD_TEXT;
4676 4676 }
4677 4677
4678 4678 if (svd->pageprot) {
4679 4679 switch (rw) {
4680 4680 case S_READ:
4681 4681 protchk = PROT_READ;
4682 4682 break;
4683 4683 case S_WRITE:
4684 4684 protchk = PROT_WRITE;
4685 4685 break;
4686 4686 case S_EXEC:
4687 4687 protchk = PROT_EXEC;
4688 4688 break;
4689 4689 case S_OTHER:
4690 4690 default:
4691 4691 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
4692 4692 break;
4693 4693 }
4694 4694 VM_STAT_ADD(segvnvmstats.fltanpages[2]);
4695 4695 } else {
4696 4696 prot = svd->prot;
4697 4697 /* caller has already done segment level protection check. */
4698 4698 }
4699 4699
4700 4700 ppa = kmem_cache_alloc(segvn_szc_cache[ppaszc], KM_SLEEP);
4701 4701 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
4702 4702 for (;;) {
4703 4703 adjszc_chk = 0;
4704 4704 for (; a < lpgeaddr; a += pgsz, aindx += pages) {
4705 4705 if (svd->pageprot != 0 && IS_P2ALIGNED(a, maxpgsz)) {
4706 4706 VM_STAT_ADD(segvnvmstats.fltanpages[3]);
4707 4707 ASSERT(vpage != NULL);
4708 4708 prot = VPP_PROT(vpage);
4709 4709 ASSERT(sameprot(seg, a, maxpgsz));
4710 4710 if ((prot & protchk) == 0) {
4711 4711 err = FC_PROT;
4712 4712 goto error;
4713 4713 }
4714 4714 }
4715 4715 if (adjszc_chk && IS_P2ALIGNED(a, maxpgsz) &&
4716 4716 pgsz < maxpgsz) {
4717 4717 ASSERT(a > lpgaddr);
4718 4718 szc = seg->s_szc;
4719 4719 pgsz = maxpgsz;
4720 4720 pages = btop(pgsz);
4721 4721 ASSERT(IS_P2ALIGNED(aindx, pages));
4722 4722 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr,
4723 4723 pgsz);
4724 4724 }
4725 4725 if (type == F_SOFTLOCK) {
4726 4726 atomic_add_long((ulong_t *)&svd->softlockcnt,
4727 4727 pages);
4728 4728 }
4729 4729 anon_array_enter(amp, aindx, &cookie);
4730 4730 ppa_szc = (uint_t)-1;
4731 4731 ierr = anon_map_getpages(amp, aindx, szc, seg, a,
4732 4732 prot, &vpprot, ppa, &ppa_szc, vpage, rw, brkcow,
4733 4733 segvn_anypgsz, pgflags, svd->cred);
4734 4734 if (ierr != 0) {
4735 4735 anon_array_exit(&cookie);
4736 4736 VM_STAT_ADD(segvnvmstats.fltanpages[4]);
4737 4737 if (type == F_SOFTLOCK) {
4738 4738 atomic_add_long(
4739 4739 (ulong_t *)&svd->softlockcnt,
4740 4740 -pages);
4741 4741 }
4742 4742 if (ierr > 0) {
4743 4743 VM_STAT_ADD(segvnvmstats.fltanpages[6]);
4744 4744 err = FC_MAKE_ERR(ierr);
4745 4745 goto error;
4746 4746 }
4747 4747 break;
4748 4748 }
4749 4749
4750 4750 ASSERT(!IS_VMODSORT(ppa[0]->p_vnode));
4751 4751
4752 4752 ASSERT(segtype == MAP_SHARED ||
4753 4753 ppa[0]->p_szc <= szc);
4754 4754 ASSERT(segtype == MAP_PRIVATE ||
4755 4755 ppa[0]->p_szc >= szc);
4756 4756
4757 4757 /*
4758 4758 * Handle pages that have been marked for migration
4759 4759 */
4760 4760 if (lgrp_optimizations())
4761 4761 page_migrate(seg, a, ppa, pages);
4762 4762
4763 4763 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
4764 4764
4765 4765 if (segtype == MAP_SHARED) {
4766 4766 vpprot |= PROT_WRITE;
4767 4767 }
4768 4768
4769 4769 hat_memload_array(hat, a, pgsz, ppa,
4770 4770 prot & vpprot, hat_flag);
4771 4771
4772 4772 if (hat_flag & HAT_LOAD_LOCK) {
4773 4773 VM_STAT_ADD(segvnvmstats.fltanpages[7]);
4774 4774 } else {
4775 4775 VM_STAT_ADD(segvnvmstats.fltanpages[8]);
4776 4776 for (i = 0; i < pages; i++)
4777 4777 page_unlock(ppa[i]);
4778 4778 }
4779 4779 if (vpage != NULL)
4780 4780 vpage += pages;
4781 4781
4782 4782 anon_array_exit(&cookie);
4783 4783 adjszc_chk = 1;
4784 4784 }
4785 4785 if (a == lpgeaddr)
4786 4786 break;
4787 4787 ASSERT(a < lpgeaddr);
4788 4788 /*
4789 4789 * ierr == -1 means we failed to allocate a large page.
4790 4790 * so do a size down operation.
4791 4791 *
4792 4792 * ierr == -2 means some other process that privately shares
4793 4793 * pages with this process has allocated a larger page and we
4794 4794 * need to retry with larger pages. So do a size up
4795 4795 * operation. This relies on the fact that large pages are
4796 4796 * never partially shared i.e. if we share any constituent
4797 4797 * page of a large page with another process we must share the
4798 4798 * entire large page. Note this cannot happen for SOFTLOCK
4799 4799 * case, unless current address (a) is at the beginning of the
4800 4800 * next page size boundary because the other process couldn't
4801 4801 * have relocated locked pages.
4802 4802 */
4803 4803 ASSERT(ierr == -1 || ierr == -2);
4804 4804
4805 4805 if (segvn_anypgsz) {
4806 4806 ASSERT(ierr == -2 || szc != 0);
4807 4807 ASSERT(ierr == -1 || szc < seg->s_szc);
4808 4808 szc = (ierr == -1) ? szc - 1 : szc + 1;
4809 4809 } else {
4810 4810 /*
4811 4811 * For non COW faults and segvn_anypgsz == 0
4812 4812 * we need to be careful not to loop forever
4813 4813 * if existing page is found with szc other
4814 4814 * than 0 or seg->s_szc. This could be due
4815 4815 * to page relocations on behalf of DR or
4816 4816 * more likely large page creation. For this
4817 4817 * case simply re-size to existing page's szc
4818 4818 * if returned by anon_map_getpages().
4819 4819 */
4820 4820 if (ppa_szc == (uint_t)-1) {
4821 4821 szc = (ierr == -1) ? 0 : seg->s_szc;
4822 4822 } else {
4823 4823 ASSERT(ppa_szc <= seg->s_szc);
4824 4824 ASSERT(ierr == -2 || ppa_szc < szc);
4825 4825 ASSERT(ierr == -1 || ppa_szc > szc);
4826 4826 szc = ppa_szc;
4827 4827 }
4828 4828 }
4829 4829
4830 4830 pgsz = page_get_pagesize(szc);
4831 4831 pages = btop(pgsz);
4832 4832 ASSERT(type != F_SOFTLOCK || ierr == -1 ||
4833 4833 (IS_P2ALIGNED(a, pgsz) && IS_P2ALIGNED(lpgeaddr, pgsz)));
4834 4834 if (type == F_SOFTLOCK) {
4835 4835 /*
4836 4836 * For softlocks we cannot reduce the fault area
4837 4837 * (calculated based on the largest page size for this
4838 4838 * segment) for size down and a is already next
4839 4839 * page size aligned as assertted above for size
4840 4840 * ups. Therefore just continue in case of softlock.
4841 4841 */
4842 4842 VM_STAT_ADD(segvnvmstats.fltanpages[9]);
4843 4843 continue; /* keep lint happy */
4844 4844 } else if (ierr == -2) {
4845 4845
4846 4846 /*
4847 4847 * Size up case. Note lpgaddr may only be needed for
4848 4848 * softlock case so we don't adjust it here.
4849 4849 */
4850 4850 VM_STAT_ADD(segvnvmstats.fltanpages[10]);
4851 4851 a = (caddr_t)P2ALIGN((uintptr_t)a, pgsz);
4852 4852 ASSERT(a >= lpgaddr);
4853 4853 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4854 4854 aindx = svd->anon_index + seg_page(seg, a);
4855 4855 vpage = (svd->vpage != NULL) ?
4856 4856 &svd->vpage[seg_page(seg, a)] : NULL;
4857 4857 } else {
4858 4858 /*
4859 4859 * Size down case. Note lpgaddr may only be needed for
4860 4860 * softlock case so we don't adjust it here.
4861 4861 */
4862 4862 VM_STAT_ADD(segvnvmstats.fltanpages[11]);
4863 4863 ASSERT(IS_P2ALIGNED(a, pgsz));
4864 4864 ASSERT(IS_P2ALIGNED(lpgeaddr, pgsz));
4865 4865 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4866 4866 ASSERT(a < lpgeaddr);
4867 4867 if (a < addr) {
4868 4868 /*
4869 4869 * The beginning of the large page region can
4870 4870 * be pulled to the right to make a smaller
4871 4871 * region. We haven't yet faulted a single
4872 4872 * page.
4873 4873 */
4874 4874 VM_STAT_ADD(segvnvmstats.fltanpages[12]);
4875 4875 a = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
4876 4876 ASSERT(a >= lpgaddr);
4877 4877 aindx = svd->anon_index + seg_page(seg, a);
4878 4878 vpage = (svd->vpage != NULL) ?
4879 4879 &svd->vpage[seg_page(seg, a)] : NULL;
4880 4880 }
4881 4881 }
4882 4882 }
4883 4883 VM_STAT_ADD(segvnvmstats.fltanpages[13]);
4884 4884 ANON_LOCK_EXIT(&->a_rwlock);
4885 4885 kmem_cache_free(segvn_szc_cache[ppaszc], ppa);
4886 4886 return (0);
4887 4887 error:
4888 4888 VM_STAT_ADD(segvnvmstats.fltanpages[14]);
4889 4889 ANON_LOCK_EXIT(&->a_rwlock);
4890 4890 kmem_cache_free(segvn_szc_cache[ppaszc], ppa);
4891 4891 if (type == F_SOFTLOCK && a > lpgaddr) {
4892 4892 VM_STAT_ADD(segvnvmstats.fltanpages[15]);
4893 4893 segvn_softunlock(seg, lpgaddr, a - lpgaddr, S_OTHER);
4894 4894 }
4895 4895 return (err);
4896 4896 }
4897 4897
4898 4898 int fltadvice = 1; /* set to free behind pages for sequential access */
4899 4899
4900 4900 /*
4901 4901 * This routine is called via a machine specific fault handling routine.
4902 4902 * It is also called by software routines wishing to lock or unlock
4903 4903 * a range of addresses.
4904 4904 *
4905 4905 * Here is the basic algorithm:
4906 4906 * If unlocking
4907 4907 * Call segvn_softunlock
4908 4908 * Return
4909 4909 * endif
4910 4910 * Checking and set up work
4911 4911 * If we will need some non-anonymous pages
4912 4912 * Call VOP_GETPAGE over the range of non-anonymous pages
4913 4913 * endif
4914 4914 * Loop over all addresses requested
4915 4915 * Call segvn_faultpage passing in page list
4916 4916 * to load up translations and handle anonymous pages
4917 4917 * endloop
4918 4918 * Load up translation to any additional pages in page list not
4919 4919 * already handled that fit into this segment
4920 4920 */
4921 4921 static faultcode_t
4922 4922 segvn_fault(struct hat *hat, struct seg *seg, caddr_t addr, size_t len,
4923 4923 enum fault_type type, enum seg_rw rw)
4924 4924 {
4925 4925 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
4926 4926 page_t **plp, **ppp, *pp;
4927 4927 u_offset_t off;
4928 4928 caddr_t a;
4929 4929 struct vpage *vpage;
4930 4930 uint_t vpprot, prot;
4931 4931 int err;
4932 4932 page_t *pl[PVN_GETPAGE_NUM + 1];
4933 4933 size_t plsz, pl_alloc_sz;
4934 4934 size_t page;
4935 4935 ulong_t anon_index;
4936 4936 struct anon_map *amp;
4937 4937 int dogetpage = 0;
4938 4938 caddr_t lpgaddr, lpgeaddr;
4939 4939 size_t pgsz;
4940 4940 anon_sync_obj_t cookie;
4941 4941 int brkcow = BREAK_COW_SHARE(rw, type, svd->type);
4942 4942
4943 4943 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
4944 4944 ASSERT(svd->amp == NULL || svd->rcookie == HAT_INVALID_REGION_COOKIE);
4945 4945
4946 4946 /*
4947 4947 * First handle the easy stuff
4948 4948 */
4949 4949 if (type == F_SOFTUNLOCK) {
4950 4950 if (rw == S_READ_NOCOW) {
4951 4951 rw = S_READ;
4952 4952 ASSERT(AS_WRITE_HELD(seg->s_as));
4953 4953 }
4954 4954 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
4955 4955 pgsz = (seg->s_szc == 0) ? PAGESIZE :
4956 4956 page_get_pagesize(seg->s_szc);
4957 4957 VM_STAT_COND_ADD(pgsz > PAGESIZE, segvnvmstats.fltanpages[16]);
4958 4958 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
4959 4959 segvn_softunlock(seg, lpgaddr, lpgeaddr - lpgaddr, rw);
4960 4960 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4961 4961 return (0);
4962 4962 }
4963 4963
4964 4964 ASSERT(svd->tr_state == SEGVN_TR_OFF ||
4965 4965 !HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
4966 4966 if (brkcow == 0) {
4967 4967 if (svd->tr_state == SEGVN_TR_INIT) {
4968 4968 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
4969 4969 if (svd->tr_state == SEGVN_TR_INIT) {
4970 4970 ASSERT(svd->vp != NULL && svd->amp == NULL);
4971 4971 ASSERT(svd->flags & MAP_TEXT);
4972 4972 ASSERT(svd->type == MAP_PRIVATE);
4973 4973 segvn_textrepl(seg);
4974 4974 ASSERT(svd->tr_state != SEGVN_TR_INIT);
4975 4975 ASSERT(svd->tr_state != SEGVN_TR_ON ||
4976 4976 svd->amp != NULL);
4977 4977 }
4978 4978 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4979 4979 }
4980 4980 } else if (svd->tr_state != SEGVN_TR_OFF) {
4981 4981 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
4982 4982
4983 4983 if (rw == S_WRITE && svd->tr_state != SEGVN_TR_OFF) {
4984 4984 ASSERT(!svd->pageprot && !(svd->prot & PROT_WRITE));
4985 4985 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4986 4986 return (FC_PROT);
4987 4987 }
4988 4988
4989 4989 if (svd->tr_state == SEGVN_TR_ON) {
4990 4990 ASSERT(svd->vp != NULL && svd->amp != NULL);
4991 4991 segvn_textunrepl(seg, 0);
4992 4992 ASSERT(svd->amp == NULL &&
4993 4993 svd->tr_state == SEGVN_TR_OFF);
4994 4994 } else if (svd->tr_state != SEGVN_TR_OFF) {
4995 4995 svd->tr_state = SEGVN_TR_OFF;
4996 4996 }
4997 4997 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
4998 4998 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4999 4999 }
5000 5000
5001 5001 top:
5002 5002 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
5003 5003
5004 5004 /*
5005 5005 * If we have the same protections for the entire segment,
5006 5006 * insure that the access being attempted is legitimate.
5007 5007 */
5008 5008
5009 5009 if (svd->pageprot == 0) {
5010 5010 uint_t protchk;
5011 5011
5012 5012 switch (rw) {
5013 5013 case S_READ:
5014 5014 case S_READ_NOCOW:
5015 5015 protchk = PROT_READ;
5016 5016 break;
5017 5017 case S_WRITE:
5018 5018 protchk = PROT_WRITE;
5019 5019 break;
5020 5020 case S_EXEC:
5021 5021 protchk = PROT_EXEC;
5022 5022 break;
5023 5023 case S_OTHER:
5024 5024 default:
5025 5025 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
5026 5026 break;
5027 5027 }
5028 5028
5029 5029 if ((svd->prot & protchk) == 0) {
5030 5030 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5031 5031 return (FC_PROT); /* illegal access type */
5032 5032 }
5033 5033 }
5034 5034
5035 5035 if (brkcow && HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5036 5036 /* this must be SOFTLOCK S_READ fault */
5037 5037 ASSERT(svd->amp == NULL);
5038 5038 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5039 5039 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5040 5040 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5041 5041 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5042 5042 /*
5043 5043 * this must be the first ever non S_READ_NOCOW
5044 5044 * softlock for this segment.
5045 5045 */
5046 5046 ASSERT(svd->softlockcnt == 0);
5047 5047 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
5048 5048 HAT_REGION_TEXT);
5049 5049 svd->rcookie = HAT_INVALID_REGION_COOKIE;
5050 5050 }
5051 5051 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5052 5052 goto top;
5053 5053 }
5054 5054
5055 5055 /*
5056 5056 * We can't allow the long term use of softlocks for vmpss segments,
5057 5057 * because in some file truncation cases we should be able to demote
5058 5058 * the segment, which requires that there are no softlocks. The
5059 5059 * only case where it's ok to allow a SOFTLOCK fault against a vmpss
5060 5060 * segment is S_READ_NOCOW, where the caller holds the address space
5061 5061 * locked as writer and calls softunlock before dropping the as lock.
5062 5062 * S_READ_NOCOW is used by /proc to read memory from another user.
5063 5063 *
5064 5064 * Another deadlock between SOFTLOCK and file truncation can happen
5065 5065 * because segvn_fault_vnodepages() calls the FS one pagesize at
5066 5066 * a time. A second VOP_GETPAGE() call by segvn_fault_vnodepages()
5067 5067 * can cause a deadlock because the first set of page_t's remain
5068 5068 * locked SE_SHARED. To avoid this, we demote segments on a first
5069 5069 * SOFTLOCK if they have a length greater than the segment's
5070 5070 * page size.
5071 5071 *
5072 5072 * So for now, we only avoid demoting a segment on a SOFTLOCK when
5073 5073 * the access type is S_READ_NOCOW and the fault length is less than
5074 5074 * or equal to the segment's page size. While this is quite restrictive,
5075 5075 * it should be the most common case of SOFTLOCK against a vmpss
5076 5076 * segment.
5077 5077 *
5078 5078 * For S_READ_NOCOW, it's safe not to do a copy on write because the
5079 5079 * caller makes sure no COW will be caused by another thread for a
5080 5080 * softlocked page.
5081 5081 */
5082 5082 if (type == F_SOFTLOCK && svd->vp != NULL && seg->s_szc != 0) {
5083 5083 int demote = 0;
5084 5084
5085 5085 if (rw != S_READ_NOCOW) {
5086 5086 demote = 1;
5087 5087 }
5088 5088 if (!demote && len > PAGESIZE) {
5089 5089 pgsz = page_get_pagesize(seg->s_szc);
5090 5090 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr,
5091 5091 lpgeaddr);
5092 5092 if (lpgeaddr - lpgaddr > pgsz) {
5093 5093 demote = 1;
5094 5094 }
5095 5095 }
5096 5096
5097 5097 ASSERT(demote || AS_WRITE_HELD(seg->s_as));
5098 5098
5099 5099 if (demote) {
5100 5100 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5101 5101 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5102 5102 if (seg->s_szc != 0) {
5103 5103 segvn_vmpss_clrszc_cnt++;
5104 5104 ASSERT(svd->softlockcnt == 0);
5105 5105 err = segvn_clrszc(seg);
5106 5106 if (err) {
5107 5107 segvn_vmpss_clrszc_err++;
5108 5108 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5109 5109 return (FC_MAKE_ERR(err));
5110 5110 }
5111 5111 }
5112 5112 ASSERT(seg->s_szc == 0);
5113 5113 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5114 5114 goto top;
5115 5115 }
5116 5116 }
5117 5117
5118 5118 /*
5119 5119 * Check to see if we need to allocate an anon_map structure.
5120 5120 */
5121 5121 if (svd->amp == NULL && (svd->vp == NULL || brkcow)) {
5122 5122 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
5123 5123 /*
5124 5124 * Drop the "read" lock on the segment and acquire
5125 5125 * the "write" version since we have to allocate the
5126 5126 * anon_map.
5127 5127 */
5128 5128 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5129 5129 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5130 5130
5131 5131 if (svd->amp == NULL) {
5132 5132 svd->amp = anonmap_alloc(seg->s_size, 0, ANON_SLEEP);
5133 5133 svd->amp->a_szc = seg->s_szc;
5134 5134 }
5135 5135 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5136 5136
5137 5137 /*
5138 5138 * Start all over again since segment protections
5139 5139 * may have changed after we dropped the "read" lock.
5140 5140 */
5141 5141 goto top;
5142 5142 }
5143 5143
5144 5144 /*
5145 5145 * S_READ_NOCOW vs S_READ distinction was
5146 5146 * only needed for the code above. After
5147 5147 * that we treat it as S_READ.
5148 5148 */
5149 5149 if (rw == S_READ_NOCOW) {
5150 5150 ASSERT(type == F_SOFTLOCK);
5151 5151 ASSERT(AS_WRITE_HELD(seg->s_as));
5152 5152 rw = S_READ;
5153 5153 }
5154 5154
5155 5155 amp = svd->amp;
5156 5156
5157 5157 /*
5158 5158 * MADV_SEQUENTIAL work is ignored for large page segments.
5159 5159 */
5160 5160 if (seg->s_szc != 0) {
5161 5161 pgsz = page_get_pagesize(seg->s_szc);
5162 5162 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
5163 5163 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
5164 5164 if (svd->vp == NULL) {
5165 5165 err = segvn_fault_anonpages(hat, seg, lpgaddr,
5166 5166 lpgeaddr, type, rw, addr, addr + len, brkcow);
5167 5167 } else {
5168 5168 err = segvn_fault_vnodepages(hat, seg, lpgaddr,
5169 5169 lpgeaddr, type, rw, addr, addr + len, brkcow);
5170 5170 if (err == IE_RETRY) {
5171 5171 ASSERT(seg->s_szc == 0);
5172 5172 ASSERT(SEGVN_READ_HELD(seg->s_as, &svd->lock));
5173 5173 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5174 5174 goto top;
5175 5175 }
5176 5176 }
5177 5177 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5178 5178 return (err);
5179 5179 }
5180 5180
5181 5181 page = seg_page(seg, addr);
5182 5182 if (amp != NULL) {
5183 5183 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
5184 5184 anon_index = svd->anon_index + page;
5185 5185
5186 5186 if (type == F_PROT && rw == S_READ &&
5187 5187 svd->tr_state == SEGVN_TR_OFF &&
5188 5188 svd->type == MAP_PRIVATE && svd->pageprot == 0) {
5189 5189 size_t index = anon_index;
5190 5190 struct anon *ap;
5191 5191
5192 5192 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5193 5193 /*
5194 5194 * The fast path could apply to S_WRITE also, except
5195 5195 * that the protection fault could be caused by lazy
5196 5196 * tlb flush when ro->rw. In this case, the pte is
5197 5197 * RW already. But RO in the other cpu's tlb causes
5198 5198 * the fault. Since hat_chgprot won't do anything if
5199 5199 * pte doesn't change, we may end up faulting
5200 5200 * indefinitely until the RO tlb entry gets replaced.
5201 5201 */
5202 5202 for (a = addr; a < addr + len; a += PAGESIZE, index++) {
5203 5203 anon_array_enter(amp, index, &cookie);
5204 5204 ap = anon_get_ptr(amp->ahp, index);
5205 5205 anon_array_exit(&cookie);
5206 5206 if ((ap == NULL) || (ap->an_refcnt != 1)) {
5207 5207 ANON_LOCK_EXIT(&->a_rwlock);
5208 5208 goto slow;
5209 5209 }
5210 5210 }
5211 5211 hat_chgprot(seg->s_as->a_hat, addr, len, svd->prot);
5212 5212 ANON_LOCK_EXIT(&->a_rwlock);
5213 5213 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5214 5214 return (0);
5215 5215 }
5216 5216 }
5217 5217 slow:
5218 5218
5219 5219 if (svd->vpage == NULL)
5220 5220 vpage = NULL;
5221 5221 else
5222 5222 vpage = &svd->vpage[page];
5223 5223
5224 5224 off = svd->offset + (uintptr_t)(addr - seg->s_base);
5225 5225
5226 5226 /*
5227 5227 * If MADV_SEQUENTIAL has been set for the particular page we
5228 5228 * are faulting on, free behind all pages in the segment and put
5229 5229 * them on the free list.
5230 5230 */
5231 5231
5232 5232 if ((page != 0) && fltadvice && svd->tr_state != SEGVN_TR_ON) {
5233 5233 struct vpage *vpp;
5234 5234 ulong_t fanon_index;
5235 5235 size_t fpage;
5236 5236 u_offset_t pgoff, fpgoff;
5237 5237 struct vnode *fvp;
5238 5238 struct anon *fap = NULL;
5239 5239
5240 5240 if (svd->advice == MADV_SEQUENTIAL ||
5241 5241 (svd->pageadvice &&
5242 5242 VPP_ADVICE(vpage) == MADV_SEQUENTIAL)) {
5243 5243 pgoff = off - PAGESIZE;
5244 5244 fpage = page - 1;
5245 5245 if (vpage != NULL)
5246 5246 vpp = &svd->vpage[fpage];
5247 5247 if (amp != NULL)
5248 5248 fanon_index = svd->anon_index + fpage;
5249 5249
5250 5250 while (pgoff > svd->offset) {
5251 5251 if (svd->advice != MADV_SEQUENTIAL &&
5252 5252 (!svd->pageadvice || (vpage &&
5253 5253 VPP_ADVICE(vpp) != MADV_SEQUENTIAL)))
5254 5254 break;
5255 5255
5256 5256 /*
5257 5257 * If this is an anon page, we must find the
5258 5258 * correct <vp, offset> for it
5259 5259 */
5260 5260 fap = NULL;
5261 5261 if (amp != NULL) {
5262 5262 ANON_LOCK_ENTER(&->a_rwlock,
5263 5263 RW_READER);
5264 5264 anon_array_enter(amp, fanon_index,
5265 5265 &cookie);
5266 5266 fap = anon_get_ptr(amp->ahp,
5267 5267 fanon_index);
5268 5268 if (fap != NULL) {
5269 5269 swap_xlate(fap, &fvp, &fpgoff);
5270 5270 } else {
5271 5271 fpgoff = pgoff;
5272 5272 fvp = svd->vp;
5273 5273 }
5274 5274 anon_array_exit(&cookie);
5275 5275 ANON_LOCK_EXIT(&->a_rwlock);
5276 5276 } else {
5277 5277 fpgoff = pgoff;
5278 5278 fvp = svd->vp;
5279 5279 }
5280 5280 if (fvp == NULL)
5281 5281 break; /* XXX */
5282 5282 /*
5283 5283 * Skip pages that are free or have an
5284 5284 * "exclusive" lock.
5285 5285 */
5286 5286 pp = page_lookup_nowait(fvp, fpgoff, SE_SHARED);
5287 5287 if (pp == NULL)
5288 5288 break;
5289 5289 /*
5290 5290 * We don't need the page_struct_lock to test
5291 5291 * as this is only advisory; even if we
5292 5292 * acquire it someone might race in and lock
5293 5293 * the page after we unlock and before the
5294 5294 * PUTPAGE, then VOP_PUTPAGE will do nothing.
5295 5295 */
5296 5296 if (pp->p_lckcnt == 0 && pp->p_cowcnt == 0) {
5297 5297 /*
5298 5298 * Hold the vnode before releasing
5299 5299 * the page lock to prevent it from
5300 5300 * being freed and re-used by some
5301 5301 * other thread.
5302 5302 */
5303 5303 VN_HOLD(fvp);
5304 5304 page_unlock(pp);
5305 5305 /*
5306 5306 * We should build a page list
5307 5307 * to kluster putpages XXX
5308 5308 */
5309 5309 (void) VOP_PUTPAGE(fvp,
5310 5310 (offset_t)fpgoff, PAGESIZE,
5311 5311 (B_DONTNEED|B_FREE|B_ASYNC),
5312 5312 svd->cred, NULL);
5313 5313 VN_RELE(fvp);
5314 5314 } else {
5315 5315 /*
5316 5316 * XXX - Should the loop terminate if
5317 5317 * the page is `locked'?
5318 5318 */
5319 5319 page_unlock(pp);
5320 5320 }
5321 5321 --vpp;
5322 5322 --fanon_index;
5323 5323 pgoff -= PAGESIZE;
5324 5324 }
5325 5325 }
5326 5326 }
5327 5327
5328 5328 plp = pl;
5329 5329 *plp = NULL;
5330 5330 pl_alloc_sz = 0;
5331 5331
5332 5332 /*
5333 5333 * See if we need to call VOP_GETPAGE for
5334 5334 * *any* of the range being faulted on.
5335 5335 * We can skip all of this work if there
5336 5336 * was no original vnode.
5337 5337 */
5338 5338 if (svd->vp != NULL) {
5339 5339 u_offset_t vp_off;
5340 5340 size_t vp_len;
5341 5341 struct anon *ap;
5342 5342 vnode_t *vp;
5343 5343
5344 5344 vp_off = off;
5345 5345 vp_len = len;
5346 5346
5347 5347 if (amp == NULL)
5348 5348 dogetpage = 1;
5349 5349 else {
5350 5350 /*
5351 5351 * Only acquire reader lock to prevent amp->ahp
5352 5352 * from being changed. It's ok to miss pages,
5353 5353 * hence we don't do anon_array_enter
5354 5354 */
5355 5355 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5356 5356 ap = anon_get_ptr(amp->ahp, anon_index);
5357 5357
5358 5358 if (len <= PAGESIZE)
5359 5359 /* inline non_anon() */
5360 5360 dogetpage = (ap == NULL);
5361 5361 else
5362 5362 dogetpage = non_anon(amp->ahp, anon_index,
5363 5363 &vp_off, &vp_len);
5364 5364 ANON_LOCK_EXIT(&->a_rwlock);
5365 5365 }
5366 5366
5367 5367 if (dogetpage) {
5368 5368 enum seg_rw arw;
5369 5369 struct as *as = seg->s_as;
5370 5370
5371 5371 if (len > ptob((sizeof (pl) / sizeof (pl[0])) - 1)) {
5372 5372 /*
5373 5373 * Page list won't fit in local array,
5374 5374 * allocate one of the needed size.
5375 5375 */
5376 5376 pl_alloc_sz =
5377 5377 (btop(len) + 1) * sizeof (page_t *);
5378 5378 plp = kmem_alloc(pl_alloc_sz, KM_SLEEP);
5379 5379 plp[0] = NULL;
5380 5380 plsz = len;
5381 5381 } else if (rw == S_WRITE && svd->type == MAP_PRIVATE ||
5382 5382 svd->tr_state == SEGVN_TR_ON || rw == S_OTHER ||
5383 5383 (((size_t)(addr + PAGESIZE) <
5384 5384 (size_t)(seg->s_base + seg->s_size)) &&
5385 5385 hat_probe(as->a_hat, addr + PAGESIZE))) {
5386 5386 /*
5387 5387 * Ask VOP_GETPAGE to return the exact number
5388 5388 * of pages if
5389 5389 * (a) this is a COW fault, or
5390 5390 * (b) this is a software fault, or
5391 5391 * (c) next page is already mapped.
5392 5392 */
5393 5393 plsz = len;
5394 5394 } else {
5395 5395 /*
5396 5396 * Ask VOP_GETPAGE to return adjacent pages
5397 5397 * within the segment.
5398 5398 */
5399 5399 plsz = MIN((size_t)PVN_GETPAGE_SZ, (size_t)
5400 5400 ((seg->s_base + seg->s_size) - addr));
5401 5401 ASSERT((addr + plsz) <=
5402 5402 (seg->s_base + seg->s_size));
5403 5403 }
5404 5404
5405 5405 /*
5406 5406 * Need to get some non-anonymous pages.
5407 5407 * We need to make only one call to GETPAGE to do
5408 5408 * this to prevent certain deadlocking conditions
5409 5409 * when we are doing locking. In this case
5410 5410 * non_anon() should have picked up the smallest
5411 5411 * range which includes all the non-anonymous
5412 5412 * pages in the requested range. We have to
5413 5413 * be careful regarding which rw flag to pass in
5414 5414 * because on a private mapping, the underlying
5415 5415 * object is never allowed to be written.
5416 5416 */
5417 5417 if (rw == S_WRITE && svd->type == MAP_PRIVATE) {
5418 5418 arw = S_READ;
5419 5419 } else {
5420 5420 arw = rw;
5421 5421 }
5422 5422 vp = svd->vp;
5423 5423 TRACE_3(TR_FAC_VM, TR_SEGVN_GETPAGE,
5424 5424 "segvn_getpage:seg %p addr %p vp %p",
5425 5425 seg, addr, vp);
5426 5426 err = VOP_GETPAGE(vp, (offset_t)vp_off, vp_len,
5427 5427 &vpprot, plp, plsz, seg, addr + (vp_off - off), arw,
5428 5428 svd->cred, NULL);
5429 5429 if (err) {
5430 5430 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5431 5431 segvn_pagelist_rele(plp);
5432 5432 if (pl_alloc_sz)
5433 5433 kmem_free(plp, pl_alloc_sz);
5434 5434 return (FC_MAKE_ERR(err));
5435 5435 }
5436 5436 if (svd->type == MAP_PRIVATE)
5437 5437 vpprot &= ~PROT_WRITE;
5438 5438 }
5439 5439 }
5440 5440
5441 5441 /*
5442 5442 * N.B. at this time the plp array has all the needed non-anon
5443 5443 * pages in addition to (possibly) having some adjacent pages.
5444 5444 */
5445 5445
5446 5446 /*
5447 5447 * Always acquire the anon_array_lock to prevent
5448 5448 * 2 threads from allocating separate anon slots for
5449 5449 * the same "addr".
5450 5450 *
5451 5451 * If this is a copy-on-write fault and we don't already
5452 5452 * have the anon_array_lock, acquire it to prevent the
5453 5453 * fault routine from handling multiple copy-on-write faults
5454 5454 * on the same "addr" in the same address space.
5455 5455 *
5456 5456 * Only one thread should deal with the fault since after
5457 5457 * it is handled, the other threads can acquire a translation
5458 5458 * to the newly created private page. This prevents two or
5459 5459 * more threads from creating different private pages for the
5460 5460 * same fault.
5461 5461 *
5462 5462 * We grab "serialization" lock here if this is a MAP_PRIVATE segment
5463 5463 * to prevent deadlock between this thread and another thread
5464 5464 * which has soft-locked this page and wants to acquire serial_lock.
5465 5465 * ( bug 4026339 )
5466 5466 *
5467 5467 * The fix for bug 4026339 becomes unnecessary when using the
5468 5468 * locking scheme with per amp rwlock and a global set of hash
5469 5469 * lock, anon_array_lock. If we steal a vnode page when low
5470 5470 * on memory and upgrad the page lock through page_rename,
5471 5471 * then the page is PAGE_HANDLED, nothing needs to be done
5472 5472 * for this page after returning from segvn_faultpage.
5473 5473 *
5474 5474 * But really, the page lock should be downgraded after
5475 5475 * the stolen page is page_rename'd.
5476 5476 */
5477 5477
5478 5478 if (amp != NULL)
5479 5479 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5480 5480
5481 5481 /*
5482 5482 * Ok, now loop over the address range and handle faults
5483 5483 */
5484 5484 for (a = addr; a < addr + len; a += PAGESIZE, off += PAGESIZE) {
5485 5485 err = segvn_faultpage(hat, seg, a, off, vpage, plp, vpprot,
5486 5486 type, rw, brkcow);
5487 5487 if (err) {
5488 5488 if (amp != NULL)
5489 5489 ANON_LOCK_EXIT(&->a_rwlock);
5490 5490 if (type == F_SOFTLOCK && a > addr) {
5491 5491 segvn_softunlock(seg, addr, (a - addr),
5492 5492 S_OTHER);
5493 5493 }
5494 5494 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5495 5495 segvn_pagelist_rele(plp);
5496 5496 if (pl_alloc_sz)
5497 5497 kmem_free(plp, pl_alloc_sz);
5498 5498 return (err);
5499 5499 }
5500 5500 if (vpage) {
5501 5501 vpage++;
5502 5502 } else if (svd->vpage) {
5503 5503 page = seg_page(seg, addr);
5504 5504 vpage = &svd->vpage[++page];
5505 5505 }
5506 5506 }
5507 5507
5508 5508 /* Didn't get pages from the underlying fs so we're done */
5509 5509 if (!dogetpage)
5510 5510 goto done;
5511 5511
5512 5512 /*
5513 5513 * Now handle any other pages in the list returned.
5514 5514 * If the page can be used, load up the translations now.
5515 5515 * Note that the for loop will only be entered if "plp"
5516 5516 * is pointing to a non-NULL page pointer which means that
5517 5517 * VOP_GETPAGE() was called and vpprot has been initialized.
5518 5518 */
5519 5519 if (svd->pageprot == 0)
5520 5520 prot = svd->prot & vpprot;
5521 5521
5522 5522
5523 5523 /*
5524 5524 * Large Files: diff should be unsigned value because we started
5525 5525 * supporting > 2GB segment sizes from 2.5.1 and when a
5526 5526 * large file of size > 2GB gets mapped to address space
5527 5527 * the diff value can be > 2GB.
5528 5528 */
5529 5529
5530 5530 for (ppp = plp; (pp = *ppp) != NULL; ppp++) {
5531 5531 size_t diff;
5532 5532 struct anon *ap;
5533 5533 int anon_index;
5534 5534 anon_sync_obj_t cookie;
5535 5535 int hat_flag = HAT_LOAD_ADV;
5536 5536
5537 5537 if (svd->flags & MAP_TEXT) {
5538 5538 hat_flag |= HAT_LOAD_TEXT;
5539 5539 }
5540 5540
5541 5541 if (pp == PAGE_HANDLED)
5542 5542 continue;
5543 5543
5544 5544 if (svd->tr_state != SEGVN_TR_ON &&
5545 5545 pp->p_offset >= svd->offset &&
5546 5546 pp->p_offset < svd->offset + seg->s_size) {
5547 5547
5548 5548 diff = pp->p_offset - svd->offset;
5549 5549
5550 5550 /*
5551 5551 * Large Files: Following is the assertion
5552 5552 * validating the above cast.
5553 5553 */
5554 5554 ASSERT(svd->vp == pp->p_vnode);
5555 5555
5556 5556 page = btop(diff);
5557 5557 if (svd->pageprot)
5558 5558 prot = VPP_PROT(&svd->vpage[page]) & vpprot;
5559 5559
5560 5560 /*
5561 5561 * Prevent other threads in the address space from
5562 5562 * creating private pages (i.e., allocating anon slots)
5563 5563 * while we are in the process of loading translations
5564 5564 * to additional pages returned by the underlying
5565 5565 * object.
5566 5566 */
5567 5567 if (amp != NULL) {
5568 5568 anon_index = svd->anon_index + page;
5569 5569 anon_array_enter(amp, anon_index, &cookie);
5570 5570 ap = anon_get_ptr(amp->ahp, anon_index);
5571 5571 }
5572 5572 if ((amp == NULL) || (ap == NULL)) {
5573 5573 if (IS_VMODSORT(pp->p_vnode) ||
5574 5574 enable_mbit_wa) {
5575 5575 if (rw == S_WRITE)
5576 5576 hat_setmod(pp);
5577 5577 else if (rw != S_OTHER &&
5578 5578 !hat_ismod(pp))
5579 5579 prot &= ~PROT_WRITE;
5580 5580 }
5581 5581 /*
5582 5582 * Skip mapping read ahead pages marked
5583 5583 * for migration, so they will get migrated
5584 5584 * properly on fault
5585 5585 */
5586 5586 ASSERT(amp == NULL ||
5587 5587 svd->rcookie == HAT_INVALID_REGION_COOKIE);
5588 5588 if ((prot & PROT_READ) && !PP_ISMIGRATE(pp)) {
5589 5589 hat_memload_region(hat,
5590 5590 seg->s_base + diff,
5591 5591 pp, prot, hat_flag,
5592 5592 svd->rcookie);
5593 5593 }
5594 5594 }
5595 5595 if (amp != NULL)
5596 5596 anon_array_exit(&cookie);
5597 5597 }
5598 5598 page_unlock(pp);
5599 5599 }
5600 5600 done:
5601 5601 if (amp != NULL)
5602 5602 ANON_LOCK_EXIT(&->a_rwlock);
5603 5603 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5604 5604 if (pl_alloc_sz)
5605 5605 kmem_free(plp, pl_alloc_sz);
5606 5606 return (0);
5607 5607 }
5608 5608
5609 5609 /*
5610 5610 * This routine is used to start I/O on pages asynchronously. XXX it will
5611 5611 * only create PAGESIZE pages. At fault time they will be relocated into
5612 5612 * larger pages.
5613 5613 */
5614 5614 static faultcode_t
5615 5615 segvn_faulta(struct seg *seg, caddr_t addr)
5616 5616 {
5617 5617 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
5618 5618 int err;
5619 5619 struct anon_map *amp;
5620 5620 vnode_t *vp;
5621 5621
5622 5622 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
5623 5623
5624 5624 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
5625 5625 if ((amp = svd->amp) != NULL) {
5626 5626 struct anon *ap;
5627 5627
5628 5628 /*
5629 5629 * Reader lock to prevent amp->ahp from being changed.
5630 5630 * This is advisory, it's ok to miss a page, so
5631 5631 * we don't do anon_array_enter lock.
5632 5632 */
5633 5633 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5634 5634 if ((ap = anon_get_ptr(amp->ahp,
5635 5635 svd->anon_index + seg_page(seg, addr))) != NULL) {
5636 5636
5637 5637 err = anon_getpage(&ap, NULL, NULL,
5638 5638 0, seg, addr, S_READ, svd->cred);
5639 5639
5640 5640 ANON_LOCK_EXIT(&->a_rwlock);
5641 5641 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5642 5642 if (err)
5643 5643 return (FC_MAKE_ERR(err));
5644 5644 return (0);
5645 5645 }
5646 5646 ANON_LOCK_EXIT(&->a_rwlock);
5647 5647 }
5648 5648
5649 5649 if (svd->vp == NULL) {
5650 5650 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5651 5651 return (0); /* zfod page - do nothing now */
5652 5652 }
5653 5653
5654 5654 vp = svd->vp;
5655 5655 TRACE_3(TR_FAC_VM, TR_SEGVN_GETPAGE,
5656 5656 "segvn_getpage:seg %p addr %p vp %p", seg, addr, vp);
5657 5657 err = VOP_GETPAGE(vp,
5658 5658 (offset_t)(svd->offset + (uintptr_t)(addr - seg->s_base)),
5659 5659 PAGESIZE, NULL, NULL, 0, seg, addr,
5660 5660 S_OTHER, svd->cred, NULL);
5661 5661
5662 5662 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5663 5663 if (err)
5664 5664 return (FC_MAKE_ERR(err));
5665 5665 return (0);
5666 5666 }
5667 5667
5668 5668 static int
5669 5669 segvn_setprot(struct seg *seg, caddr_t addr, size_t len, uint_t prot)
5670 5670 {
5671 5671 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
5672 5672 struct vpage *cvp, *svp, *evp;
5673 5673 struct vnode *vp;
5674 5674 size_t pgsz;
5675 5675 pgcnt_t pgcnt;
5676 5676 anon_sync_obj_t cookie;
5677 5677 int unload_done = 0;
5678 5678
5679 5679 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
5680 5680
5681 5681 if ((svd->maxprot & prot) != prot)
5682 5682 return (EACCES); /* violated maxprot */
5683 5683
5684 5684 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5685 5685
5686 5686 /* return if prot is the same */
5687 5687 if (!svd->pageprot && svd->prot == prot) {
5688 5688 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5689 5689 return (0);
5690 5690 }
5691 5691
5692 5692 /*
5693 5693 * Since we change protections we first have to flush the cache.
5694 5694 * This makes sure all the pagelock calls have to recheck
5695 5695 * protections.
5696 5696 */
5697 5697 if (svd->softlockcnt > 0) {
5698 5698 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5699 5699
5700 5700 /*
5701 5701 * If this is shared segment non 0 softlockcnt
5702 5702 * means locked pages are still in use.
5703 5703 */
5704 5704 if (svd->type == MAP_SHARED) {
5705 5705 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5706 5706 return (EAGAIN);
5707 5707 }
5708 5708
5709 5709 /*
5710 5710 * Since we do have the segvn writers lock nobody can fill
5711 5711 * the cache with entries belonging to this seg during
5712 5712 * the purge. The flush either succeeds or we still have
5713 5713 * pending I/Os.
5714 5714 */
5715 5715 segvn_purge(seg);
5716 5716 if (svd->softlockcnt > 0) {
5717 5717 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5718 5718 return (EAGAIN);
5719 5719 }
5720 5720 }
5721 5721
5722 5722 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5723 5723 ASSERT(svd->amp == NULL);
5724 5724 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5725 5725 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
5726 5726 HAT_REGION_TEXT);
5727 5727 svd->rcookie = HAT_INVALID_REGION_COOKIE;
5728 5728 unload_done = 1;
5729 5729 } else if (svd->tr_state == SEGVN_TR_INIT) {
5730 5730 svd->tr_state = SEGVN_TR_OFF;
5731 5731 } else if (svd->tr_state == SEGVN_TR_ON) {
5732 5732 ASSERT(svd->amp != NULL);
5733 5733 segvn_textunrepl(seg, 0);
5734 5734 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
5735 5735 unload_done = 1;
5736 5736 }
5737 5737
5738 5738 if ((prot & PROT_WRITE) && svd->type == MAP_SHARED &&
5739 5739 svd->vp != NULL && (svd->vp->v_flag & VVMEXEC)) {
5740 5740 ASSERT(vn_is_mapped(svd->vp, V_WRITE));
5741 5741 segvn_inval_trcache(svd->vp);
5742 5742 }
5743 5743 if (seg->s_szc != 0) {
5744 5744 int err;
5745 5745 pgsz = page_get_pagesize(seg->s_szc);
5746 5746 pgcnt = pgsz >> PAGESHIFT;
5747 5747 ASSERT(IS_P2ALIGNED(pgcnt, pgcnt));
5748 5748 if (!IS_P2ALIGNED(addr, pgsz) || !IS_P2ALIGNED(len, pgsz)) {
5749 5749 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5750 5750 ASSERT(seg->s_base != addr || seg->s_size != len);
5751 5751 /*
5752 5752 * If we are holding the as lock as a reader then
5753 5753 * we need to return IE_RETRY and let the as
5754 5754 * layer drop and re-acquire the lock as a writer.
5755 5755 */
5756 5756 if (AS_READ_HELD(seg->s_as))
5757 5757 return (IE_RETRY);
5758 5758 VM_STAT_ADD(segvnvmstats.demoterange[1]);
5759 5759 if (svd->type == MAP_PRIVATE || svd->vp != NULL) {
5760 5760 err = segvn_demote_range(seg, addr, len,
5761 5761 SDR_END, 0);
5762 5762 } else {
5763 5763 uint_t szcvec = map_pgszcvec(seg->s_base,
5764 5764 pgsz, (uintptr_t)seg->s_base,
5765 5765 (svd->flags & MAP_TEXT), MAPPGSZC_SHM, 0);
5766 5766 err = segvn_demote_range(seg, addr, len,
5767 5767 SDR_END, szcvec);
5768 5768 }
5769 5769 if (err == 0)
5770 5770 return (IE_RETRY);
5771 5771 if (err == ENOMEM)
5772 5772 return (IE_NOMEM);
5773 5773 return (err);
5774 5774 }
5775 5775 }
5776 5776
5777 5777
5778 5778 /*
5779 5779 * If it's a private mapping and we're making it writable then we
5780 5780 * may have to reserve the additional swap space now. If we are
5781 5781 * making writable only a part of the segment then we use its vpage
5782 5782 * array to keep a record of the pages for which we have reserved
5783 5783 * swap. In this case we set the pageswap field in the segment's
5784 5784 * segvn structure to record this.
5785 5785 *
5786 5786 * If it's a private mapping to a file (i.e., vp != NULL) and we're
5787 5787 * removing write permission on the entire segment and we haven't
5788 5788 * modified any pages, we can release the swap space.
5789 5789 */
5790 5790 if (svd->type == MAP_PRIVATE) {
5791 5791 if (prot & PROT_WRITE) {
5792 5792 if (!(svd->flags & MAP_NORESERVE) &&
5793 5793 !(svd->swresv && svd->pageswap == 0)) {
5794 5794 size_t sz = 0;
5795 5795
5796 5796 /*
5797 5797 * Start by determining how much swap
5798 5798 * space is required.
5799 5799 */
5800 5800 if (addr == seg->s_base &&
5801 5801 len == seg->s_size &&
5802 5802 svd->pageswap == 0) {
5803 5803 /* The whole segment */
5804 5804 sz = seg->s_size;
5805 5805 } else {
5806 5806 /*
5807 5807 * Make sure that the vpage array
5808 5808 * exists, and make a note of the
5809 5809 * range of elements corresponding
5810 5810 * to len.
5811 5811 */
5812 5812 segvn_vpage(seg);
5813 5813 if (svd->vpage == NULL) {
5814 5814 SEGVN_LOCK_EXIT(seg->s_as,
5815 5815 &svd->lock);
5816 5816 return (ENOMEM);
5817 5817 }
5818 5818 svp = &svd->vpage[seg_page(seg, addr)];
5819 5819 evp = &svd->vpage[seg_page(seg,
5820 5820 addr + len)];
5821 5821
5822 5822 if (svd->pageswap == 0) {
5823 5823 /*
5824 5824 * This is the first time we've
5825 5825 * asked for a part of this
5826 5826 * segment, so we need to
5827 5827 * reserve everything we've
5828 5828 * been asked for.
5829 5829 */
5830 5830 sz = len;
5831 5831 } else {
5832 5832 /*
5833 5833 * We have to count the number
5834 5834 * of pages required.
5835 5835 */
5836 5836 for (cvp = svp; cvp < evp;
5837 5837 cvp++) {
5838 5838 if (!VPP_ISSWAPRES(cvp))
5839 5839 sz++;
5840 5840 }
5841 5841 sz <<= PAGESHIFT;
5842 5842 }
5843 5843 }
5844 5844
5845 5845 /* Try to reserve the necessary swap. */
5846 5846 if (anon_resv_zone(sz,
5847 5847 seg->s_as->a_proc->p_zone) == 0) {
5848 5848 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5849 5849 return (IE_NOMEM);
5850 5850 }
5851 5851
5852 5852 /*
5853 5853 * Make a note of how much swap space
5854 5854 * we've reserved.
5855 5855 */
5856 5856 if (svd->pageswap == 0 && sz == seg->s_size) {
5857 5857 svd->swresv = sz;
5858 5858 } else {
5859 5859 ASSERT(svd->vpage != NULL);
5860 5860 svd->swresv += sz;
5861 5861 svd->pageswap = 1;
5862 5862 for (cvp = svp; cvp < evp; cvp++) {
5863 5863 if (!VPP_ISSWAPRES(cvp))
5864 5864 VPP_SETSWAPRES(cvp);
5865 5865 }
5866 5866 }
5867 5867 }
5868 5868 } else {
5869 5869 /*
5870 5870 * Swap space is released only if this segment
5871 5871 * does not map anonymous memory, since read faults
5872 5872 * on such segments still need an anon slot to read
5873 5873 * in the data.
5874 5874 */
5875 5875 if (svd->swresv != 0 && svd->vp != NULL &&
5876 5876 svd->amp == NULL && addr == seg->s_base &&
5877 5877 len == seg->s_size && svd->pageprot == 0) {
5878 5878 ASSERT(svd->pageswap == 0);
5879 5879 anon_unresv_zone(svd->swresv,
5880 5880 seg->s_as->a_proc->p_zone);
5881 5881 svd->swresv = 0;
5882 5882 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
5883 5883 "anon proc:%p %lu %u", seg, 0, 0);
5884 5884 }
5885 5885 }
5886 5886 }
5887 5887
5888 5888 if (addr == seg->s_base && len == seg->s_size && svd->vpage == NULL) {
5889 5889 if (svd->prot == prot) {
5890 5890 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5891 5891 return (0); /* all done */
5892 5892 }
5893 5893 svd->prot = (uchar_t)prot;
5894 5894 } else if (svd->type == MAP_PRIVATE) {
5895 5895 struct anon *ap = NULL;
5896 5896 page_t *pp;
5897 5897 u_offset_t offset, off;
5898 5898 struct anon_map *amp;
5899 5899 ulong_t anon_idx = 0;
5900 5900
5901 5901 /*
5902 5902 * A vpage structure exists or else the change does not
5903 5903 * involve the entire segment. Establish a vpage structure
5904 5904 * if none is there. Then, for each page in the range,
5905 5905 * adjust its individual permissions. Note that write-
5906 5906 * enabling a MAP_PRIVATE page can affect the claims for
5907 5907 * locked down memory. Overcommitting memory terminates
5908 5908 * the operation.
5909 5909 */
5910 5910 segvn_vpage(seg);
5911 5911 if (svd->vpage == NULL) {
5912 5912 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5913 5913 return (ENOMEM);
5914 5914 }
5915 5915 svd->pageprot = 1;
5916 5916 if ((amp = svd->amp) != NULL) {
5917 5917 anon_idx = svd->anon_index + seg_page(seg, addr);
5918 5918 ASSERT(seg->s_szc == 0 ||
5919 5919 IS_P2ALIGNED(anon_idx, pgcnt));
5920 5920 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5921 5921 }
5922 5922
5923 5923 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
5924 5924 evp = &svd->vpage[seg_page(seg, addr + len)];
5925 5925
5926 5926 /*
5927 5927 * See Statement at the beginning of segvn_lockop regarding
5928 5928 * the way cowcnts and lckcnts are handled.
5929 5929 */
5930 5930 for (svp = &svd->vpage[seg_page(seg, addr)]; svp < evp; svp++) {
5931 5931
5932 5932 if (seg->s_szc != 0) {
5933 5933 if (amp != NULL) {
5934 5934 anon_array_enter(amp, anon_idx,
5935 5935 &cookie);
5936 5936 }
5937 5937 if (IS_P2ALIGNED(anon_idx, pgcnt) &&
5938 5938 !segvn_claim_pages(seg, svp, offset,
5939 5939 anon_idx, prot)) {
5940 5940 if (amp != NULL) {
5941 5941 anon_array_exit(&cookie);
5942 5942 }
5943 5943 break;
5944 5944 }
5945 5945 if (amp != NULL) {
5946 5946 anon_array_exit(&cookie);
5947 5947 }
5948 5948 anon_idx++;
5949 5949 } else {
5950 5950 if (amp != NULL) {
5951 5951 anon_array_enter(amp, anon_idx,
5952 5952 &cookie);
5953 5953 ap = anon_get_ptr(amp->ahp, anon_idx++);
5954 5954 }
5955 5955
5956 5956 if (VPP_ISPPLOCK(svp) &&
5957 5957 VPP_PROT(svp) != prot) {
5958 5958
5959 5959 if (amp == NULL || ap == NULL) {
5960 5960 vp = svd->vp;
5961 5961 off = offset;
5962 5962 } else
5963 5963 swap_xlate(ap, &vp, &off);
5964 5964 if (amp != NULL)
5965 5965 anon_array_exit(&cookie);
5966 5966
5967 5967 if ((pp = page_lookup(vp, off,
5968 5968 SE_SHARED)) == NULL) {
5969 5969 panic("segvn_setprot: no page");
5970 5970 /*NOTREACHED*/
5971 5971 }
5972 5972 ASSERT(seg->s_szc == 0);
5973 5973 if ((VPP_PROT(svp) ^ prot) &
5974 5974 PROT_WRITE) {
5975 5975 if (prot & PROT_WRITE) {
5976 5976 if (!page_addclaim(
5977 5977 pp)) {
5978 5978 page_unlock(pp);
5979 5979 break;
5980 5980 }
5981 5981 } else {
5982 5982 if (!page_subclaim(
5983 5983 pp)) {
5984 5984 page_unlock(pp);
5985 5985 break;
5986 5986 }
5987 5987 }
5988 5988 }
5989 5989 page_unlock(pp);
5990 5990 } else if (amp != NULL)
5991 5991 anon_array_exit(&cookie);
5992 5992 }
5993 5993 VPP_SETPROT(svp, prot);
5994 5994 offset += PAGESIZE;
5995 5995 }
5996 5996 if (amp != NULL)
5997 5997 ANON_LOCK_EXIT(&->a_rwlock);
5998 5998
5999 5999 /*
6000 6000 * Did we terminate prematurely? If so, simply unload
6001 6001 * the translations to the things we've updated so far.
6002 6002 */
6003 6003 if (svp != evp) {
6004 6004 if (unload_done) {
6005 6005 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6006 6006 return (IE_NOMEM);
6007 6007 }
6008 6008 len = (svp - &svd->vpage[seg_page(seg, addr)]) *
6009 6009 PAGESIZE;
6010 6010 ASSERT(seg->s_szc == 0 || IS_P2ALIGNED(len, pgsz));
6011 6011 if (len != 0)
6012 6012 hat_unload(seg->s_as->a_hat, addr,
6013 6013 len, HAT_UNLOAD);
6014 6014 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6015 6015 return (IE_NOMEM);
6016 6016 }
6017 6017 } else {
6018 6018 segvn_vpage(seg);
6019 6019 if (svd->vpage == NULL) {
6020 6020 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6021 6021 return (ENOMEM);
6022 6022 }
6023 6023 svd->pageprot = 1;
6024 6024 evp = &svd->vpage[seg_page(seg, addr + len)];
6025 6025 for (svp = &svd->vpage[seg_page(seg, addr)]; svp < evp; svp++) {
6026 6026 VPP_SETPROT(svp, prot);
6027 6027 }
6028 6028 }
6029 6029
6030 6030 if (unload_done) {
6031 6031 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6032 6032 return (0);
6033 6033 }
6034 6034
6035 6035 if (((prot & PROT_WRITE) != 0 &&
6036 6036 (svd->vp != NULL || svd->type == MAP_PRIVATE)) ||
6037 6037 (prot & ~PROT_USER) == PROT_NONE) {
6038 6038 /*
6039 6039 * Either private or shared data with write access (in
6040 6040 * which case we need to throw out all former translations
6041 6041 * so that we get the right translations set up on fault
6042 6042 * and we don't allow write access to any copy-on-write pages
6043 6043 * that might be around or to prevent write access to pages
6044 6044 * representing holes in a file), or we don't have permission
6045 6045 * to access the memory at all (in which case we have to
6046 6046 * unload any current translations that might exist).
6047 6047 */
6048 6048 hat_unload(seg->s_as->a_hat, addr, len, HAT_UNLOAD);
6049 6049 } else {
6050 6050 /*
6051 6051 * A shared mapping or a private mapping in which write
6052 6052 * protection is going to be denied - just change all the
6053 6053 * protections over the range of addresses in question.
6054 6054 * segvn does not support any other attributes other
6055 6055 * than prot so we can use hat_chgattr.
6056 6056 */
6057 6057 hat_chgattr(seg->s_as->a_hat, addr, len, prot);
6058 6058 }
6059 6059
6060 6060 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6061 6061
6062 6062 return (0);
6063 6063 }
6064 6064
6065 6065 /*
6066 6066 * segvn_setpagesize is called via SEGOP_SETPAGESIZE from as_setpagesize,
6067 6067 * to determine if the seg is capable of mapping the requested szc.
6068 6068 */
6069 6069 static int
6070 6070 segvn_setpagesize(struct seg *seg, caddr_t addr, size_t len, uint_t szc)
6071 6071 {
6072 6072 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6073 6073 struct segvn_data *nsvd;
6074 6074 struct anon_map *amp = svd->amp;
6075 6075 struct seg *nseg;
6076 6076 caddr_t eaddr = addr + len, a;
6077 6077 size_t pgsz = page_get_pagesize(szc);
6078 6078 pgcnt_t pgcnt = page_get_pagecnt(szc);
6079 6079 int err;
6080 6080 u_offset_t off = svd->offset + (uintptr_t)(addr - seg->s_base);
6081 6081
6082 6082 ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
6083 6083 ASSERT(addr >= seg->s_base && eaddr <= seg->s_base + seg->s_size);
6084 6084
6085 6085 if (seg->s_szc == szc || segvn_lpg_disable != 0) {
6086 6086 return (0);
6087 6087 }
6088 6088
6089 6089 /*
6090 6090 * addr should always be pgsz aligned but eaddr may be misaligned if
6091 6091 * it's at the end of the segment.
6092 6092 *
6093 6093 * XXX we should assert this condition since as_setpagesize() logic
6094 6094 * guarantees it.
6095 6095 */
6096 6096 if (!IS_P2ALIGNED(addr, pgsz) ||
6097 6097 (!IS_P2ALIGNED(eaddr, pgsz) &&
6098 6098 eaddr != seg->s_base + seg->s_size)) {
6099 6099
6100 6100 segvn_setpgsz_align_err++;
6101 6101 return (EINVAL);
6102 6102 }
6103 6103
6104 6104 if (amp != NULL && svd->type == MAP_SHARED) {
6105 6105 ulong_t an_idx = svd->anon_index + seg_page(seg, addr);
6106 6106 if (!IS_P2ALIGNED(an_idx, pgcnt)) {
6107 6107
6108 6108 segvn_setpgsz_anon_align_err++;
6109 6109 return (EINVAL);
6110 6110 }
6111 6111 }
6112 6112
6113 6113 if ((svd->flags & MAP_NORESERVE) || seg->s_as == &kas ||
6114 6114 szc > segvn_maxpgszc) {
6115 6115 return (EINVAL);
6116 6116 }
6117 6117
6118 6118 /* paranoid check */
6119 6119 if (svd->vp != NULL &&
6120 6120 (IS_SWAPFSVP(svd->vp) || VN_ISKAS(svd->vp))) {
6121 6121 return (EINVAL);
6122 6122 }
6123 6123
6124 6124 if (seg->s_szc == 0 && svd->vp != NULL &&
6125 6125 map_addr_vacalign_check(addr, off)) {
6126 6126 return (EINVAL);
6127 6127 }
6128 6128
6129 6129 /*
6130 6130 * Check that protections are the same within new page
6131 6131 * size boundaries.
6132 6132 */
6133 6133 if (svd->pageprot) {
6134 6134 for (a = addr; a < eaddr; a += pgsz) {
6135 6135 if ((a + pgsz) > eaddr) {
6136 6136 if (!sameprot(seg, a, eaddr - a)) {
6137 6137 return (EINVAL);
6138 6138 }
6139 6139 } else {
6140 6140 if (!sameprot(seg, a, pgsz)) {
6141 6141 return (EINVAL);
6142 6142 }
6143 6143 }
6144 6144 }
6145 6145 }
6146 6146
6147 6147 /*
6148 6148 * Since we are changing page size we first have to flush
6149 6149 * the cache. This makes sure all the pagelock calls have
6150 6150 * to recheck protections.
6151 6151 */
6152 6152 if (svd->softlockcnt > 0) {
6153 6153 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6154 6154
6155 6155 /*
6156 6156 * If this is shared segment non 0 softlockcnt
6157 6157 * means locked pages are still in use.
6158 6158 */
6159 6159 if (svd->type == MAP_SHARED) {
6160 6160 return (EAGAIN);
6161 6161 }
6162 6162
6163 6163 /*
6164 6164 * Since we do have the segvn writers lock nobody can fill
6165 6165 * the cache with entries belonging to this seg during
6166 6166 * the purge. The flush either succeeds or we still have
6167 6167 * pending I/Os.
6168 6168 */
6169 6169 segvn_purge(seg);
6170 6170 if (svd->softlockcnt > 0) {
6171 6171 return (EAGAIN);
6172 6172 }
6173 6173 }
6174 6174
6175 6175 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
6176 6176 ASSERT(svd->amp == NULL);
6177 6177 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6178 6178 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
6179 6179 HAT_REGION_TEXT);
6180 6180 svd->rcookie = HAT_INVALID_REGION_COOKIE;
6181 6181 } else if (svd->tr_state == SEGVN_TR_INIT) {
6182 6182 svd->tr_state = SEGVN_TR_OFF;
6183 6183 } else if (svd->tr_state == SEGVN_TR_ON) {
6184 6184 ASSERT(svd->amp != NULL);
6185 6185 segvn_textunrepl(seg, 1);
6186 6186 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
6187 6187 amp = NULL;
6188 6188 }
6189 6189
6190 6190 /*
6191 6191 * Operation for sub range of existing segment.
6192 6192 */
6193 6193 if (addr != seg->s_base || eaddr != (seg->s_base + seg->s_size)) {
6194 6194 if (szc < seg->s_szc) {
6195 6195 VM_STAT_ADD(segvnvmstats.demoterange[2]);
6196 6196 err = segvn_demote_range(seg, addr, len, SDR_RANGE, 0);
6197 6197 if (err == 0) {
6198 6198 return (IE_RETRY);
6199 6199 }
6200 6200 if (err == ENOMEM) {
6201 6201 return (IE_NOMEM);
6202 6202 }
6203 6203 return (err);
6204 6204 }
6205 6205 if (addr != seg->s_base) {
6206 6206 nseg = segvn_split_seg(seg, addr);
6207 6207 if (eaddr != (nseg->s_base + nseg->s_size)) {
6208 6208 /* eaddr is szc aligned */
6209 6209 (void) segvn_split_seg(nseg, eaddr);
6210 6210 }
6211 6211 return (IE_RETRY);
6212 6212 }
6213 6213 if (eaddr != (seg->s_base + seg->s_size)) {
6214 6214 /* eaddr is szc aligned */
6215 6215 (void) segvn_split_seg(seg, eaddr);
6216 6216 }
6217 6217 return (IE_RETRY);
6218 6218 }
6219 6219
6220 6220 /*
6221 6221 * Break any low level sharing and reset seg->s_szc to 0.
6222 6222 */
6223 6223 if ((err = segvn_clrszc(seg)) != 0) {
6224 6224 if (err == ENOMEM) {
6225 6225 err = IE_NOMEM;
6226 6226 }
6227 6227 return (err);
6228 6228 }
6229 6229 ASSERT(seg->s_szc == 0);
6230 6230
6231 6231 /*
6232 6232 * If the end of the current segment is not pgsz aligned
6233 6233 * then attempt to concatenate with the next segment.
6234 6234 */
6235 6235 if (!IS_P2ALIGNED(eaddr, pgsz)) {
6236 6236 nseg = AS_SEGNEXT(seg->s_as, seg);
6237 6237 if (nseg == NULL || nseg == seg || eaddr != nseg->s_base) {
6238 6238 return (ENOMEM);
6239 6239 }
6240 6240 if (nseg->s_ops != &segvn_ops) {
6241 6241 return (EINVAL);
6242 6242 }
6243 6243 nsvd = (struct segvn_data *)nseg->s_data;
6244 6244 if (nsvd->softlockcnt > 0) {
6245 6245 /*
6246 6246 * If this is shared segment non 0 softlockcnt
6247 6247 * means locked pages are still in use.
6248 6248 */
6249 6249 if (nsvd->type == MAP_SHARED) {
6250 6250 return (EAGAIN);
6251 6251 }
6252 6252 segvn_purge(nseg);
6253 6253 if (nsvd->softlockcnt > 0) {
6254 6254 return (EAGAIN);
6255 6255 }
6256 6256 }
6257 6257 err = segvn_clrszc(nseg);
6258 6258 if (err == ENOMEM) {
6259 6259 err = IE_NOMEM;
6260 6260 }
6261 6261 if (err != 0) {
6262 6262 return (err);
6263 6263 }
6264 6264 ASSERT(nsvd->rcookie == HAT_INVALID_REGION_COOKIE);
6265 6265 err = segvn_concat(seg, nseg, 1);
6266 6266 if (err == -1) {
6267 6267 return (EINVAL);
6268 6268 }
6269 6269 if (err == -2) {
6270 6270 return (IE_NOMEM);
6271 6271 }
6272 6272 return (IE_RETRY);
6273 6273 }
6274 6274
6275 6275 /*
6276 6276 * May need to re-align anon array to
6277 6277 * new szc.
6278 6278 */
6279 6279 if (amp != NULL) {
6280 6280 if (!IS_P2ALIGNED(svd->anon_index, pgcnt)) {
6281 6281 struct anon_hdr *nahp;
6282 6282
6283 6283 ASSERT(svd->type == MAP_PRIVATE);
6284 6284
6285 6285 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6286 6286 ASSERT(amp->refcnt == 1);
6287 6287 nahp = anon_create(btop(amp->size), ANON_NOSLEEP);
6288 6288 if (nahp == NULL) {
6289 6289 ANON_LOCK_EXIT(&->a_rwlock);
6290 6290 return (IE_NOMEM);
6291 6291 }
6292 6292 if (anon_copy_ptr(amp->ahp, svd->anon_index,
6293 6293 nahp, 0, btop(seg->s_size), ANON_NOSLEEP)) {
6294 6294 anon_release(nahp, btop(amp->size));
6295 6295 ANON_LOCK_EXIT(&->a_rwlock);
6296 6296 return (IE_NOMEM);
6297 6297 }
6298 6298 anon_release(amp->ahp, btop(amp->size));
6299 6299 amp->ahp = nahp;
6300 6300 svd->anon_index = 0;
6301 6301 ANON_LOCK_EXIT(&->a_rwlock);
6302 6302 }
6303 6303 }
6304 6304 if (svd->vp != NULL && szc != 0) {
6305 6305 struct vattr va;
6306 6306 u_offset_t eoffpage = svd->offset;
6307 6307 va.va_mask = AT_SIZE;
6308 6308 eoffpage += seg->s_size;
6309 6309 eoffpage = btopr(eoffpage);
6310 6310 if (VOP_GETATTR(svd->vp, &va, 0, svd->cred, NULL) != 0) {
6311 6311 segvn_setpgsz_getattr_err++;
6312 6312 return (EINVAL);
6313 6313 }
6314 6314 if (btopr(va.va_size) < eoffpage) {
6315 6315 segvn_setpgsz_eof_err++;
6316 6316 return (EINVAL);
6317 6317 }
6318 6318 if (amp != NULL) {
6319 6319 /*
6320 6320 * anon_fill_cow_holes() may call VOP_GETPAGE().
6321 6321 * don't take anon map lock here to avoid holding it
6322 6322 * across VOP_GETPAGE() calls that may call back into
6323 6323 * segvn for klsutering checks. We don't really need
6324 6324 * anon map lock here since it's a private segment and
6325 6325 * we hold as level lock as writers.
6326 6326 */
6327 6327 if ((err = anon_fill_cow_holes(seg, seg->s_base,
6328 6328 amp->ahp, svd->anon_index, svd->vp, svd->offset,
6329 6329 seg->s_size, szc, svd->prot, svd->vpage,
6330 6330 svd->cred)) != 0) {
6331 6331 return (EINVAL);
6332 6332 }
6333 6333 }
6334 6334 segvn_setvnode_mpss(svd->vp);
6335 6335 }
6336 6336
6337 6337 if (amp != NULL) {
6338 6338 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6339 6339 if (svd->type == MAP_PRIVATE) {
6340 6340 amp->a_szc = szc;
6341 6341 } else if (szc > amp->a_szc) {
6342 6342 amp->a_szc = szc;
6343 6343 }
6344 6344 ANON_LOCK_EXIT(&->a_rwlock);
6345 6345 }
6346 6346
6347 6347 seg->s_szc = szc;
6348 6348
6349 6349 return (0);
6350 6350 }
6351 6351
6352 6352 static int
6353 6353 segvn_clrszc(struct seg *seg)
6354 6354 {
6355 6355 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6356 6356 struct anon_map *amp = svd->amp;
6357 6357 size_t pgsz;
6358 6358 pgcnt_t pages;
6359 6359 int err = 0;
6360 6360 caddr_t a = seg->s_base;
6361 6361 caddr_t ea = a + seg->s_size;
6362 6362 ulong_t an_idx = svd->anon_index;
6363 6363 vnode_t *vp = svd->vp;
6364 6364 struct vpage *vpage = svd->vpage;
6365 6365 page_t *anon_pl[1 + 1], *pp;
6366 6366 struct anon *ap, *oldap;
6367 6367 uint_t prot = svd->prot, vpprot;
6368 6368 int pageflag = 0;
6369 6369
6370 6370 ASSERT(AS_WRITE_HELD(seg->s_as) ||
6371 6371 SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
6372 6372 ASSERT(svd->softlockcnt == 0);
6373 6373
6374 6374 if (vp == NULL && amp == NULL) {
6375 6375 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6376 6376 seg->s_szc = 0;
6377 6377 return (0);
6378 6378 }
6379 6379
6380 6380 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
6381 6381 ASSERT(svd->amp == NULL);
6382 6382 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6383 6383 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
6384 6384 HAT_REGION_TEXT);
6385 6385 svd->rcookie = HAT_INVALID_REGION_COOKIE;
6386 6386 } else if (svd->tr_state == SEGVN_TR_ON) {
6387 6387 ASSERT(svd->amp != NULL);
6388 6388 segvn_textunrepl(seg, 1);
6389 6389 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
6390 6390 amp = NULL;
6391 6391 } else {
6392 6392 if (svd->tr_state != SEGVN_TR_OFF) {
6393 6393 ASSERT(svd->tr_state == SEGVN_TR_INIT);
6394 6394 svd->tr_state = SEGVN_TR_OFF;
6395 6395 }
6396 6396
6397 6397 /*
6398 6398 * do HAT_UNLOAD_UNMAP since we are changing the pagesize.
6399 6399 * unload argument is 0 when we are freeing the segment
6400 6400 * and unload was already done.
6401 6401 */
6402 6402 hat_unload(seg->s_as->a_hat, seg->s_base, seg->s_size,
6403 6403 HAT_UNLOAD_UNMAP);
6404 6404 }
6405 6405
6406 6406 if (amp == NULL || svd->type == MAP_SHARED) {
6407 6407 seg->s_szc = 0;
6408 6408 return (0);
6409 6409 }
6410 6410
6411 6411 pgsz = page_get_pagesize(seg->s_szc);
6412 6412 pages = btop(pgsz);
6413 6413
6414 6414 /*
6415 6415 * XXX anon rwlock is not really needed because this is a
6416 6416 * private segment and we are writers.
6417 6417 */
6418 6418 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6419 6419
6420 6420 for (; a < ea; a += pgsz, an_idx += pages) {
6421 6421 if ((oldap = anon_get_ptr(amp->ahp, an_idx)) != NULL) {
6422 6422 ASSERT(vpage != NULL || svd->pageprot == 0);
6423 6423 if (vpage != NULL) {
6424 6424 ASSERT(sameprot(seg, a, pgsz));
6425 6425 prot = VPP_PROT(vpage);
6426 6426 pageflag = VPP_ISPPLOCK(vpage) ? LOCK_PAGE : 0;
6427 6427 }
6428 6428 if (seg->s_szc != 0) {
6429 6429 ASSERT(vp == NULL || anon_pages(amp->ahp,
6430 6430 an_idx, pages) == pages);
6431 6431 if ((err = anon_map_demotepages(amp, an_idx,
6432 6432 seg, a, prot, vpage, svd->cred)) != 0) {
6433 6433 goto out;
6434 6434 }
6435 6435 } else {
6436 6436 if (oldap->an_refcnt == 1) {
6437 6437 continue;
6438 6438 }
6439 6439 if ((err = anon_getpage(&oldap, &vpprot,
6440 6440 anon_pl, PAGESIZE, seg, a, S_READ,
6441 6441 svd->cred))) {
6442 6442 goto out;
6443 6443 }
6444 6444 if ((pp = anon_private(&ap, seg, a, prot,
6445 6445 anon_pl[0], pageflag, svd->cred)) == NULL) {
6446 6446 err = ENOMEM;
6447 6447 goto out;
6448 6448 }
6449 6449 anon_decref(oldap);
6450 6450 (void) anon_set_ptr(amp->ahp, an_idx, ap,
6451 6451 ANON_SLEEP);
6452 6452 page_unlock(pp);
6453 6453 }
6454 6454 }
6455 6455 vpage = (vpage == NULL) ? NULL : vpage + pages;
6456 6456 }
6457 6457
6458 6458 amp->a_szc = 0;
6459 6459 seg->s_szc = 0;
6460 6460 out:
6461 6461 ANON_LOCK_EXIT(&->a_rwlock);
6462 6462 return (err);
6463 6463 }
6464 6464
6465 6465 static int
6466 6466 segvn_claim_pages(
6467 6467 struct seg *seg,
6468 6468 struct vpage *svp,
6469 6469 u_offset_t off,
6470 6470 ulong_t anon_idx,
6471 6471 uint_t prot)
6472 6472 {
6473 6473 pgcnt_t pgcnt = page_get_pagecnt(seg->s_szc);
6474 6474 size_t ppasize = (pgcnt + 1) * sizeof (page_t *);
6475 6475 page_t **ppa;
6476 6476 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6477 6477 struct anon_map *amp = svd->amp;
6478 6478 struct vpage *evp = svp + pgcnt;
6479 6479 caddr_t addr = ((uintptr_t)(svp - svd->vpage) << PAGESHIFT)
6480 6480 + seg->s_base;
6481 6481 struct anon *ap;
6482 6482 struct vnode *vp = svd->vp;
6483 6483 page_t *pp;
6484 6484 pgcnt_t pg_idx, i;
6485 6485 int err = 0;
6486 6486 anoff_t aoff;
6487 6487 int anon = (amp != NULL) ? 1 : 0;
6488 6488
6489 6489 ASSERT(svd->type == MAP_PRIVATE);
6490 6490 ASSERT(svd->vpage != NULL);
6491 6491 ASSERT(seg->s_szc != 0);
6492 6492 ASSERT(IS_P2ALIGNED(pgcnt, pgcnt));
6493 6493 ASSERT(amp == NULL || IS_P2ALIGNED(anon_idx, pgcnt));
6494 6494 ASSERT(sameprot(seg, addr, pgcnt << PAGESHIFT));
6495 6495
6496 6496 if (VPP_PROT(svp) == prot)
6497 6497 return (1);
6498 6498 if (!((VPP_PROT(svp) ^ prot) & PROT_WRITE))
6499 6499 return (1);
6500 6500
6501 6501 ppa = kmem_alloc(ppasize, KM_SLEEP);
6502 6502 if (anon && vp != NULL) {
6503 6503 if (anon_get_ptr(amp->ahp, anon_idx) == NULL) {
6504 6504 anon = 0;
6505 6505 ASSERT(!anon_pages(amp->ahp, anon_idx, pgcnt));
6506 6506 }
6507 6507 ASSERT(!anon ||
6508 6508 anon_pages(amp->ahp, anon_idx, pgcnt) == pgcnt);
6509 6509 }
6510 6510
6511 6511 for (*ppa = NULL, pg_idx = 0; svp < evp; svp++, anon_idx++) {
6512 6512 if (!VPP_ISPPLOCK(svp))
6513 6513 continue;
6514 6514 if (anon) {
6515 6515 ap = anon_get_ptr(amp->ahp, anon_idx);
6516 6516 if (ap == NULL) {
6517 6517 panic("segvn_claim_pages: no anon slot");
6518 6518 }
6519 6519 swap_xlate(ap, &vp, &aoff);
6520 6520 off = (u_offset_t)aoff;
6521 6521 }
6522 6522 ASSERT(vp != NULL);
6523 6523 if ((pp = page_lookup(vp,
6524 6524 (u_offset_t)off, SE_SHARED)) == NULL) {
6525 6525 panic("segvn_claim_pages: no page");
6526 6526 }
6527 6527 ppa[pg_idx++] = pp;
6528 6528 off += PAGESIZE;
6529 6529 }
6530 6530
6531 6531 if (ppa[0] == NULL) {
6532 6532 kmem_free(ppa, ppasize);
6533 6533 return (1);
6534 6534 }
6535 6535
6536 6536 ASSERT(pg_idx <= pgcnt);
6537 6537 ppa[pg_idx] = NULL;
6538 6538
6539 6539
6540 6540 /* Find each large page within ppa, and adjust its claim */
6541 6541
6542 6542 /* Does ppa cover a single large page? */
6543 6543 if (ppa[0]->p_szc == seg->s_szc) {
6544 6544 if (prot & PROT_WRITE)
6545 6545 err = page_addclaim_pages(ppa);
6546 6546 else
6547 6547 err = page_subclaim_pages(ppa);
6548 6548 } else {
6549 6549 for (i = 0; ppa[i]; i += pgcnt) {
6550 6550 ASSERT(IS_P2ALIGNED(page_pptonum(ppa[i]), pgcnt));
6551 6551 if (prot & PROT_WRITE)
6552 6552 err = page_addclaim_pages(&ppa[i]);
6553 6553 else
6554 6554 err = page_subclaim_pages(&ppa[i]);
6555 6555 if (err == 0)
6556 6556 break;
6557 6557 }
6558 6558 }
6559 6559
6560 6560 for (i = 0; i < pg_idx; i++) {
6561 6561 ASSERT(ppa[i] != NULL);
6562 6562 page_unlock(ppa[i]);
6563 6563 }
6564 6564
6565 6565 kmem_free(ppa, ppasize);
6566 6566 return (err);
6567 6567 }
6568 6568
6569 6569 /*
6570 6570 * Returns right (upper address) segment if split occurred.
6571 6571 * If the address is equal to the beginning or end of its segment it returns
6572 6572 * the current segment.
6573 6573 */
6574 6574 static struct seg *
6575 6575 segvn_split_seg(struct seg *seg, caddr_t addr)
6576 6576 {
6577 6577 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6578 6578 struct seg *nseg;
6579 6579 size_t nsize;
6580 6580 struct segvn_data *nsvd;
6581 6581
6582 6582 ASSERT(AS_WRITE_HELD(seg->s_as));
6583 6583 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6584 6584
6585 6585 ASSERT(addr >= seg->s_base);
6586 6586 ASSERT(addr <= seg->s_base + seg->s_size);
6587 6587 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6588 6588
6589 6589 if (addr == seg->s_base || addr == seg->s_base + seg->s_size)
6590 6590 return (seg);
6591 6591
6592 6592 nsize = seg->s_base + seg->s_size - addr;
6593 6593 seg->s_size = addr - seg->s_base;
6594 6594 nseg = seg_alloc(seg->s_as, addr, nsize);
6595 6595 ASSERT(nseg != NULL);
6596 6596 nseg->s_ops = seg->s_ops;
6597 6597 nsvd = kmem_cache_alloc(segvn_cache, KM_SLEEP);
6598 6598 nseg->s_data = (void *)nsvd;
6599 6599 nseg->s_szc = seg->s_szc;
6600 6600 *nsvd = *svd;
6601 6601 ASSERT(nsvd->rcookie == HAT_INVALID_REGION_COOKIE);
6602 6602 nsvd->seg = nseg;
6603 6603 rw_init(&nsvd->lock, NULL, RW_DEFAULT, NULL);
6604 6604
6605 6605 if (nsvd->vp != NULL) {
6606 6606 VN_HOLD(nsvd->vp);
6607 6607 nsvd->offset = svd->offset +
6608 6608 (uintptr_t)(nseg->s_base - seg->s_base);
6609 6609 if (nsvd->type == MAP_SHARED)
6610 6610 lgrp_shm_policy_init(NULL, nsvd->vp);
6611 6611 } else {
6612 6612 /*
6613 6613 * The offset for an anonymous segment has no signifigance in
6614 6614 * terms of an offset into a file. If we were to use the above
6615 6615 * calculation instead, the structures read out of
6616 6616 * /proc/<pid>/xmap would be more difficult to decipher since
6617 6617 * it would be unclear whether two seemingly contiguous
6618 6618 * prxmap_t structures represented different segments or a
6619 6619 * single segment that had been split up into multiple prxmap_t
6620 6620 * structures (e.g. if some part of the segment had not yet
6621 6621 * been faulted in).
6622 6622 */
6623 6623 nsvd->offset = 0;
6624 6624 }
6625 6625
6626 6626 ASSERT(svd->softlockcnt == 0);
6627 6627 ASSERT(svd->softlockcnt_sbase == 0);
6628 6628 ASSERT(svd->softlockcnt_send == 0);
6629 6629 crhold(svd->cred);
6630 6630
6631 6631 if (svd->vpage != NULL) {
6632 6632 size_t bytes = vpgtob(seg_pages(seg));
6633 6633 size_t nbytes = vpgtob(seg_pages(nseg));
6634 6634 struct vpage *ovpage = svd->vpage;
6635 6635
6636 6636 svd->vpage = kmem_alloc(bytes, KM_SLEEP);
6637 6637 bcopy(ovpage, svd->vpage, bytes);
6638 6638 nsvd->vpage = kmem_alloc(nbytes, KM_SLEEP);
6639 6639 bcopy(ovpage + seg_pages(seg), nsvd->vpage, nbytes);
6640 6640 kmem_free(ovpage, bytes + nbytes);
6641 6641 }
6642 6642 if (svd->amp != NULL && svd->type == MAP_PRIVATE) {
6643 6643 struct anon_map *oamp = svd->amp, *namp;
6644 6644 struct anon_hdr *nahp;
6645 6645
6646 6646 ANON_LOCK_ENTER(&oamp->a_rwlock, RW_WRITER);
6647 6647 ASSERT(oamp->refcnt == 1);
6648 6648 nahp = anon_create(btop(seg->s_size), ANON_SLEEP);
6649 6649 (void) anon_copy_ptr(oamp->ahp, svd->anon_index,
6650 6650 nahp, 0, btop(seg->s_size), ANON_SLEEP);
6651 6651
6652 6652 namp = anonmap_alloc(nseg->s_size, 0, ANON_SLEEP);
6653 6653 namp->a_szc = nseg->s_szc;
6654 6654 (void) anon_copy_ptr(oamp->ahp,
6655 6655 svd->anon_index + btop(seg->s_size),
6656 6656 namp->ahp, 0, btop(nseg->s_size), ANON_SLEEP);
6657 6657 anon_release(oamp->ahp, btop(oamp->size));
6658 6658 oamp->ahp = nahp;
6659 6659 oamp->size = seg->s_size;
6660 6660 svd->anon_index = 0;
6661 6661 nsvd->amp = namp;
6662 6662 nsvd->anon_index = 0;
6663 6663 ANON_LOCK_EXIT(&oamp->a_rwlock);
6664 6664 } else if (svd->amp != NULL) {
6665 6665 pgcnt_t pgcnt = page_get_pagecnt(seg->s_szc);
6666 6666 ASSERT(svd->amp == nsvd->amp);
6667 6667 ASSERT(seg->s_szc <= svd->amp->a_szc);
6668 6668 nsvd->anon_index = svd->anon_index + seg_pages(seg);
6669 6669 ASSERT(IS_P2ALIGNED(nsvd->anon_index, pgcnt));
6670 6670 ANON_LOCK_ENTER(&svd->amp->a_rwlock, RW_WRITER);
6671 6671 svd->amp->refcnt++;
6672 6672 ANON_LOCK_EXIT(&svd->amp->a_rwlock);
6673 6673 }
6674 6674
6675 6675 /*
6676 6676 * Split the amount of swap reserved.
6677 6677 */
6678 6678 if (svd->swresv) {
6679 6679 /*
6680 6680 * For MAP_NORESERVE, only allocate swap reserve for pages
6681 6681 * being used. Other segments get enough to cover whole
6682 6682 * segment.
6683 6683 */
6684 6684 if (svd->flags & MAP_NORESERVE) {
6685 6685 size_t oswresv;
6686 6686
6687 6687 ASSERT(svd->amp);
6688 6688 oswresv = svd->swresv;
6689 6689 svd->swresv = ptob(anon_pages(svd->amp->ahp,
6690 6690 svd->anon_index, btop(seg->s_size)));
6691 6691 nsvd->swresv = ptob(anon_pages(nsvd->amp->ahp,
6692 6692 nsvd->anon_index, btop(nseg->s_size)));
6693 6693 ASSERT(oswresv >= (svd->swresv + nsvd->swresv));
6694 6694 } else {
6695 6695 if (svd->pageswap) {
6696 6696 svd->swresv = segvn_count_swap_by_vpages(seg);
6697 6697 ASSERT(nsvd->swresv >= svd->swresv);
6698 6698 nsvd->swresv -= svd->swresv;
6699 6699 } else {
6700 6700 ASSERT(svd->swresv == seg->s_size +
6701 6701 nseg->s_size);
6702 6702 svd->swresv = seg->s_size;
6703 6703 nsvd->swresv = nseg->s_size;
6704 6704 }
6705 6705 }
6706 6706 }
6707 6707
6708 6708 return (nseg);
6709 6709 }
6710 6710
6711 6711 /*
6712 6712 * called on memory operations (unmap, setprot, setpagesize) for a subset
6713 6713 * of a large page segment to either demote the memory range (SDR_RANGE)
6714 6714 * or the ends (SDR_END) by addr/len.
6715 6715 *
6716 6716 * returns 0 on success. returns errno, including ENOMEM, on failure.
6717 6717 */
6718 6718 static int
6719 6719 segvn_demote_range(
6720 6720 struct seg *seg,
6721 6721 caddr_t addr,
6722 6722 size_t len,
6723 6723 int flag,
6724 6724 uint_t szcvec)
6725 6725 {
6726 6726 caddr_t eaddr = addr + len;
6727 6727 caddr_t lpgaddr, lpgeaddr;
6728 6728 struct seg *nseg;
6729 6729 struct seg *badseg1 = NULL;
6730 6730 struct seg *badseg2 = NULL;
6731 6731 size_t pgsz;
6732 6732 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6733 6733 int err;
6734 6734 uint_t szc = seg->s_szc;
6735 6735 uint_t tszcvec;
6736 6736
6737 6737 ASSERT(AS_WRITE_HELD(seg->s_as));
6738 6738 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6739 6739 ASSERT(szc != 0);
6740 6740 pgsz = page_get_pagesize(szc);
6741 6741 ASSERT(seg->s_base != addr || seg->s_size != len);
6742 6742 ASSERT(addr >= seg->s_base && eaddr <= seg->s_base + seg->s_size);
6743 6743 ASSERT(svd->softlockcnt == 0);
6744 6744 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6745 6745 ASSERT(szcvec == 0 || (flag == SDR_END && svd->type == MAP_SHARED));
6746 6746
6747 6747 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
6748 6748 ASSERT(flag == SDR_RANGE || eaddr < lpgeaddr || addr > lpgaddr);
6749 6749 if (flag == SDR_RANGE) {
6750 6750 /* demote entire range */
6751 6751 badseg1 = nseg = segvn_split_seg(seg, lpgaddr);
6752 6752 (void) segvn_split_seg(nseg, lpgeaddr);
6753 6753 ASSERT(badseg1->s_base == lpgaddr);
6754 6754 ASSERT(badseg1->s_size == lpgeaddr - lpgaddr);
6755 6755 } else if (addr != lpgaddr) {
6756 6756 ASSERT(flag == SDR_END);
6757 6757 badseg1 = nseg = segvn_split_seg(seg, lpgaddr);
6758 6758 if (eaddr != lpgeaddr && eaddr > lpgaddr + pgsz &&
6759 6759 eaddr < lpgaddr + 2 * pgsz) {
6760 6760 (void) segvn_split_seg(nseg, lpgeaddr);
6761 6761 ASSERT(badseg1->s_base == lpgaddr);
6762 6762 ASSERT(badseg1->s_size == 2 * pgsz);
6763 6763 } else {
6764 6764 nseg = segvn_split_seg(nseg, lpgaddr + pgsz);
6765 6765 ASSERT(badseg1->s_base == lpgaddr);
6766 6766 ASSERT(badseg1->s_size == pgsz);
6767 6767 if (eaddr != lpgeaddr && eaddr > lpgaddr + pgsz) {
6768 6768 ASSERT(lpgeaddr - lpgaddr > 2 * pgsz);
6769 6769 nseg = segvn_split_seg(nseg, lpgeaddr - pgsz);
6770 6770 badseg2 = nseg;
6771 6771 (void) segvn_split_seg(nseg, lpgeaddr);
6772 6772 ASSERT(badseg2->s_base == lpgeaddr - pgsz);
6773 6773 ASSERT(badseg2->s_size == pgsz);
6774 6774 }
6775 6775 }
6776 6776 } else {
6777 6777 ASSERT(flag == SDR_END);
6778 6778 ASSERT(eaddr < lpgeaddr);
6779 6779 badseg1 = nseg = segvn_split_seg(seg, lpgeaddr - pgsz);
6780 6780 (void) segvn_split_seg(nseg, lpgeaddr);
6781 6781 ASSERT(badseg1->s_base == lpgeaddr - pgsz);
6782 6782 ASSERT(badseg1->s_size == pgsz);
6783 6783 }
6784 6784
6785 6785 ASSERT(badseg1 != NULL);
6786 6786 ASSERT(badseg1->s_szc == szc);
6787 6787 ASSERT(flag == SDR_RANGE || badseg1->s_size == pgsz ||
6788 6788 badseg1->s_size == 2 * pgsz);
6789 6789 ASSERT(sameprot(badseg1, badseg1->s_base, pgsz));
6790 6790 ASSERT(badseg1->s_size == pgsz ||
6791 6791 sameprot(badseg1, badseg1->s_base + pgsz, pgsz));
6792 6792 if (err = segvn_clrszc(badseg1)) {
6793 6793 return (err);
6794 6794 }
6795 6795 ASSERT(badseg1->s_szc == 0);
6796 6796
6797 6797 if (szc > 1 && (tszcvec = P2PHASE(szcvec, 1 << szc)) > 1) {
6798 6798 uint_t tszc = highbit(tszcvec) - 1;
6799 6799 caddr_t ta = MAX(addr, badseg1->s_base);
6800 6800 caddr_t te;
6801 6801 size_t tpgsz = page_get_pagesize(tszc);
6802 6802
6803 6803 ASSERT(svd->type == MAP_SHARED);
6804 6804 ASSERT(flag == SDR_END);
6805 6805 ASSERT(tszc < szc && tszc > 0);
6806 6806
6807 6807 if (eaddr > badseg1->s_base + badseg1->s_size) {
6808 6808 te = badseg1->s_base + badseg1->s_size;
6809 6809 } else {
6810 6810 te = eaddr;
6811 6811 }
6812 6812
6813 6813 ASSERT(ta <= te);
6814 6814 badseg1->s_szc = tszc;
6815 6815 if (!IS_P2ALIGNED(ta, tpgsz) || !IS_P2ALIGNED(te, tpgsz)) {
6816 6816 if (badseg2 != NULL) {
6817 6817 err = segvn_demote_range(badseg1, ta, te - ta,
6818 6818 SDR_END, tszcvec);
6819 6819 if (err != 0) {
6820 6820 return (err);
6821 6821 }
6822 6822 } else {
6823 6823 return (segvn_demote_range(badseg1, ta,
6824 6824 te - ta, SDR_END, tszcvec));
6825 6825 }
6826 6826 }
6827 6827 }
6828 6828
6829 6829 if (badseg2 == NULL)
6830 6830 return (0);
6831 6831 ASSERT(badseg2->s_szc == szc);
6832 6832 ASSERT(badseg2->s_size == pgsz);
6833 6833 ASSERT(sameprot(badseg2, badseg2->s_base, badseg2->s_size));
6834 6834 if (err = segvn_clrszc(badseg2)) {
6835 6835 return (err);
6836 6836 }
6837 6837 ASSERT(badseg2->s_szc == 0);
6838 6838
6839 6839 if (szc > 1 && (tszcvec = P2PHASE(szcvec, 1 << szc)) > 1) {
6840 6840 uint_t tszc = highbit(tszcvec) - 1;
6841 6841 size_t tpgsz = page_get_pagesize(tszc);
6842 6842
6843 6843 ASSERT(svd->type == MAP_SHARED);
6844 6844 ASSERT(flag == SDR_END);
6845 6845 ASSERT(tszc < szc && tszc > 0);
6846 6846 ASSERT(badseg2->s_base > addr);
6847 6847 ASSERT(eaddr > badseg2->s_base);
6848 6848 ASSERT(eaddr < badseg2->s_base + badseg2->s_size);
6849 6849
6850 6850 badseg2->s_szc = tszc;
6851 6851 if (!IS_P2ALIGNED(eaddr, tpgsz)) {
6852 6852 return (segvn_demote_range(badseg2, badseg2->s_base,
6853 6853 eaddr - badseg2->s_base, SDR_END, tszcvec));
6854 6854 }
6855 6855 }
6856 6856
6857 6857 return (0);
6858 6858 }
6859 6859
6860 6860 static int
6861 6861 segvn_checkprot(struct seg *seg, caddr_t addr, size_t len, uint_t prot)
6862 6862 {
6863 6863 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6864 6864 struct vpage *vp, *evp;
6865 6865
6866 6866 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6867 6867
6868 6868 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
6869 6869 /*
6870 6870 * If segment protection can be used, simply check against them.
6871 6871 */
6872 6872 if (svd->pageprot == 0) {
6873 6873 int err;
6874 6874
6875 6875 err = ((svd->prot & prot) != prot) ? EACCES : 0;
6876 6876 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6877 6877 return (err);
6878 6878 }
6879 6879
6880 6880 /*
6881 6881 * Have to check down to the vpage level.
6882 6882 */
6883 6883 evp = &svd->vpage[seg_page(seg, addr + len)];
6884 6884 for (vp = &svd->vpage[seg_page(seg, addr)]; vp < evp; vp++) {
6885 6885 if ((VPP_PROT(vp) & prot) != prot) {
6886 6886 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6887 6887 return (EACCES);
6888 6888 }
6889 6889 }
6890 6890 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6891 6891 return (0);
6892 6892 }
6893 6893
6894 6894 static int
6895 6895 segvn_getprot(struct seg *seg, caddr_t addr, size_t len, uint_t *protv)
6896 6896 {
6897 6897 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6898 6898 size_t pgno = seg_page(seg, addr + len) - seg_page(seg, addr) + 1;
6899 6899
6900 6900 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6901 6901
6902 6902 if (pgno != 0) {
6903 6903 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
6904 6904 if (svd->pageprot == 0) {
6905 6905 do {
6906 6906 protv[--pgno] = svd->prot;
6907 6907 } while (pgno != 0);
6908 6908 } else {
6909 6909 size_t pgoff = seg_page(seg, addr);
6910 6910
6911 6911 do {
6912 6912 pgno--;
6913 6913 protv[pgno] = VPP_PROT(&svd->vpage[pgno+pgoff]);
6914 6914 } while (pgno != 0);
6915 6915 }
6916 6916 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6917 6917 }
6918 6918 return (0);
6919 6919 }
6920 6920
6921 6921 static u_offset_t
6922 6922 segvn_getoffset(struct seg *seg, caddr_t addr)
6923 6923 {
6924 6924 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6925 6925
6926 6926 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6927 6927
6928 6928 return (svd->offset + (uintptr_t)(addr - seg->s_base));
6929 6929 }
6930 6930
6931 6931 /*ARGSUSED*/
6932 6932 static int
6933 6933 segvn_gettype(struct seg *seg, caddr_t addr)
6934 6934 {
6935 6935 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6936 6936
6937 6937 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6938 6938
6939 6939 return (svd->type | (svd->flags & (MAP_NORESERVE | MAP_TEXT |
6940 6940 MAP_INITDATA)));
6941 6941 }
6942 6942
6943 6943 /*ARGSUSED*/
6944 6944 static int
6945 6945 segvn_getvp(struct seg *seg, caddr_t addr, struct vnode **vpp)
6946 6946 {
6947 6947 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6948 6948
6949 6949 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6950 6950
6951 6951 *vpp = svd->vp;
6952 6952 return (0);
6953 6953 }
6954 6954
6955 6955 /*
6956 6956 * Check to see if it makes sense to do kluster/read ahead to
6957 6957 * addr + delta relative to the mapping at addr. We assume here
6958 6958 * that delta is a signed PAGESIZE'd multiple (which can be negative).
6959 6959 *
6960 6960 * For segvn, we currently "approve" of the action if we are
6961 6961 * still in the segment and it maps from the same vp/off,
6962 6962 * or if the advice stored in segvn_data or vpages allows it.
6963 6963 * Currently, klustering is not allowed only if MADV_RANDOM is set.
6964 6964 */
6965 6965 static int
6966 6966 segvn_kluster(struct seg *seg, caddr_t addr, ssize_t delta)
6967 6967 {
6968 6968 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6969 6969 struct anon *oap, *ap;
6970 6970 ssize_t pd;
6971 6971 size_t page;
6972 6972 struct vnode *vp1, *vp2;
6973 6973 u_offset_t off1, off2;
6974 6974 struct anon_map *amp;
6975 6975
6976 6976 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6977 6977 ASSERT(AS_WRITE_HELD(seg->s_as) ||
6978 6978 SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
6979 6979
6980 6980 if (addr + delta < seg->s_base ||
6981 6981 addr + delta >= (seg->s_base + seg->s_size))
6982 6982 return (-1); /* exceeded segment bounds */
6983 6983
6984 6984 pd = delta / (ssize_t)PAGESIZE; /* divide to preserve sign bit */
6985 6985 page = seg_page(seg, addr);
6986 6986
6987 6987 /*
6988 6988 * Check to see if either of the pages addr or addr + delta
6989 6989 * have advice set that prevents klustering (if MADV_RANDOM advice
6990 6990 * is set for entire segment, or MADV_SEQUENTIAL is set and delta
6991 6991 * is negative).
6992 6992 */
6993 6993 if (svd->advice == MADV_RANDOM ||
6994 6994 svd->advice == MADV_SEQUENTIAL && delta < 0)
6995 6995 return (-1);
6996 6996 else if (svd->pageadvice && svd->vpage) {
6997 6997 struct vpage *bvpp, *evpp;
6998 6998
6999 6999 bvpp = &svd->vpage[page];
7000 7000 evpp = &svd->vpage[page + pd];
7001 7001 if (VPP_ADVICE(bvpp) == MADV_RANDOM ||
7002 7002 VPP_ADVICE(evpp) == MADV_SEQUENTIAL && delta < 0)
7003 7003 return (-1);
7004 7004 if (VPP_ADVICE(bvpp) != VPP_ADVICE(evpp) &&
7005 7005 VPP_ADVICE(evpp) == MADV_RANDOM)
7006 7006 return (-1);
7007 7007 }
7008 7008
7009 7009 if (svd->type == MAP_SHARED)
7010 7010 return (0); /* shared mapping - all ok */
7011 7011
7012 7012 if ((amp = svd->amp) == NULL)
7013 7013 return (0); /* off original vnode */
7014 7014
7015 7015 page += svd->anon_index;
7016 7016
7017 7017 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7018 7018
7019 7019 oap = anon_get_ptr(amp->ahp, page);
7020 7020 ap = anon_get_ptr(amp->ahp, page + pd);
7021 7021
7022 7022 ANON_LOCK_EXIT(&->a_rwlock);
7023 7023
7024 7024 if ((oap == NULL && ap != NULL) || (oap != NULL && ap == NULL)) {
7025 7025 return (-1); /* one with and one without an anon */
7026 7026 }
7027 7027
7028 7028 if (oap == NULL) { /* implies that ap == NULL */
7029 7029 return (0); /* off original vnode */
7030 7030 }
7031 7031
7032 7032 /*
7033 7033 * Now we know we have two anon pointers - check to
7034 7034 * see if they happen to be properly allocated.
7035 7035 */
7036 7036
7037 7037 /*
7038 7038 * XXX We cheat here and don't lock the anon slots. We can't because
7039 7039 * we may have been called from the anon layer which might already
7040 7040 * have locked them. We are holding a refcnt on the slots so they
7041 7041 * can't disappear. The worst that will happen is we'll get the wrong
7042 7042 * names (vp, off) for the slots and make a poor klustering decision.
7043 7043 */
7044 7044 swap_xlate(ap, &vp1, &off1);
7045 7045 swap_xlate(oap, &vp2, &off2);
7046 7046
7047 7047
7048 7048 if (!VOP_CMP(vp1, vp2, NULL) || off1 - off2 != delta)
7049 7049 return (-1);
7050 7050 return (0);
7051 7051 }
7052 7052
7053 7053 /*
7054 7054 * Swap the pages of seg out to secondary storage, returning the
7055 7055 * number of bytes of storage freed.
7056 7056 *
7057 7057 * The basic idea is first to unload all translations and then to call
7058 7058 * VOP_PUTPAGE() for all newly-unmapped pages, to push them out to the
7059 7059 * swap device. Pages to which other segments have mappings will remain
7060 7060 * mapped and won't be swapped. Our caller (as_swapout) has already
7061 7061 * performed the unloading step.
7062 7062 *
7063 7063 * The value returned is intended to correlate well with the process's
7064 7064 * memory requirements. However, there are some caveats:
7065 7065 * 1) When given a shared segment as argument, this routine will
7066 7066 * only succeed in swapping out pages for the last sharer of the
7067 7067 * segment. (Previous callers will only have decremented mapping
7068 7068 * reference counts.)
7069 7069 * 2) We assume that the hat layer maintains a large enough translation
7070 7070 * cache to capture process reference patterns.
7071 7071 */
7072 7072 static size_t
7073 7073 segvn_swapout(struct seg *seg)
7074 7074 {
7075 7075 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7076 7076 struct anon_map *amp;
7077 7077 pgcnt_t pgcnt = 0;
7078 7078 pgcnt_t npages;
7079 7079 pgcnt_t page;
7080 7080 ulong_t anon_index;
7081 7081
7082 7082 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7083 7083
7084 7084 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7085 7085 /*
7086 7086 * Find pages unmapped by our caller and force them
7087 7087 * out to the virtual swap device.
7088 7088 */
7089 7089 if ((amp = svd->amp) != NULL)
7090 7090 anon_index = svd->anon_index;
7091 7091 npages = seg->s_size >> PAGESHIFT;
7092 7092 for (page = 0; page < npages; page++) {
7093 7093 page_t *pp;
7094 7094 struct anon *ap;
7095 7095 struct vnode *vp;
7096 7096 u_offset_t off;
7097 7097 anon_sync_obj_t cookie;
7098 7098
7099 7099 /*
7100 7100 * Obtain <vp, off> pair for the page, then look it up.
7101 7101 *
7102 7102 * Note that this code is willing to consider regular
7103 7103 * pages as well as anon pages. Is this appropriate here?
7104 7104 */
7105 7105 ap = NULL;
7106 7106 if (amp != NULL) {
7107 7107 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7108 7108 if (anon_array_try_enter(amp, anon_index + page,
7109 7109 &cookie)) {
7110 7110 ANON_LOCK_EXIT(&->a_rwlock);
7111 7111 continue;
7112 7112 }
7113 7113 ap = anon_get_ptr(amp->ahp, anon_index + page);
7114 7114 if (ap != NULL) {
7115 7115 swap_xlate(ap, &vp, &off);
7116 7116 } else {
7117 7117 vp = svd->vp;
7118 7118 off = svd->offset + ptob(page);
7119 7119 }
7120 7120 anon_array_exit(&cookie);
7121 7121 ANON_LOCK_EXIT(&->a_rwlock);
7122 7122 } else {
7123 7123 vp = svd->vp;
7124 7124 off = svd->offset + ptob(page);
7125 7125 }
7126 7126 if (vp == NULL) { /* untouched zfod page */
7127 7127 ASSERT(ap == NULL);
7128 7128 continue;
7129 7129 }
7130 7130
7131 7131 pp = page_lookup_nowait(vp, off, SE_SHARED);
7132 7132 if (pp == NULL)
7133 7133 continue;
7134 7134
7135 7135
7136 7136 /*
7137 7137 * Examine the page to see whether it can be tossed out,
7138 7138 * keeping track of how many we've found.
7139 7139 */
7140 7140 if (!page_tryupgrade(pp)) {
7141 7141 /*
7142 7142 * If the page has an i/o lock and no mappings,
7143 7143 * it's very likely that the page is being
7144 7144 * written out as a result of klustering.
7145 7145 * Assume this is so and take credit for it here.
7146 7146 */
7147 7147 if (!page_io_trylock(pp)) {
7148 7148 if (!hat_page_is_mapped(pp))
7149 7149 pgcnt++;
7150 7150 } else {
7151 7151 page_io_unlock(pp);
7152 7152 }
7153 7153 page_unlock(pp);
7154 7154 continue;
7155 7155 }
7156 7156 ASSERT(!page_iolock_assert(pp));
7157 7157
7158 7158
7159 7159 /*
7160 7160 * Skip if page is locked or has mappings.
7161 7161 * We don't need the page_struct_lock to look at lckcnt
7162 7162 * and cowcnt because the page is exclusive locked.
7163 7163 */
7164 7164 if (pp->p_lckcnt != 0 || pp->p_cowcnt != 0 ||
7165 7165 hat_page_is_mapped(pp)) {
7166 7166 page_unlock(pp);
7167 7167 continue;
7168 7168 }
7169 7169
7170 7170 /*
7171 7171 * dispose skips large pages so try to demote first.
7172 7172 */
7173 7173 if (pp->p_szc != 0 && !page_try_demote_pages(pp)) {
7174 7174 page_unlock(pp);
7175 7175 /*
7176 7176 * XXX should skip the remaining page_t's of this
7177 7177 * large page.
7178 7178 */
7179 7179 continue;
7180 7180 }
7181 7181
7182 7182 ASSERT(pp->p_szc == 0);
7183 7183
7184 7184 /*
7185 7185 * No longer mapped -- we can toss it out. How
7186 7186 * we do so depends on whether or not it's dirty.
7187 7187 */
7188 7188 if (hat_ismod(pp) && pp->p_vnode) {
7189 7189 /*
7190 7190 * We must clean the page before it can be
7191 7191 * freed. Setting B_FREE will cause pvn_done
7192 7192 * to free the page when the i/o completes.
7193 7193 * XXX: This also causes it to be accounted
7194 7194 * as a pageout instead of a swap: need
7195 7195 * B_SWAPOUT bit to use instead of B_FREE.
7196 7196 *
7197 7197 * Hold the vnode before releasing the page lock
7198 7198 * to prevent it from being freed and re-used by
7199 7199 * some other thread.
7200 7200 */
7201 7201 VN_HOLD(vp);
7202 7202 page_unlock(pp);
7203 7203
7204 7204 /*
7205 7205 * Queue all i/o requests for the pageout thread
7206 7206 * to avoid saturating the pageout devices.
7207 7207 */
7208 7208 if (!queue_io_request(vp, off))
7209 7209 VN_RELE(vp);
7210 7210 } else {
7211 7211 /*
7212 7212 * The page was clean, free it.
7213 7213 *
7214 7214 * XXX: Can we ever encounter modified pages
7215 7215 * with no associated vnode here?
7216 7216 */
7217 7217 ASSERT(pp->p_vnode != NULL);
7218 7218 /*LINTED: constant in conditional context*/
7219 7219 VN_DISPOSE(pp, B_FREE, 0, kcred);
7220 7220 }
7221 7221
7222 7222 /*
7223 7223 * Credit now even if i/o is in progress.
7224 7224 */
7225 7225 pgcnt++;
7226 7226 }
7227 7227 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7228 7228
7229 7229 /*
7230 7230 * Wakeup pageout to initiate i/o on all queued requests.
7231 7231 */
7232 7232 cv_signal_pageout();
7233 7233 return (ptob(pgcnt));
7234 7234 }
7235 7235
7236 7236 /*
7237 7237 * Synchronize primary storage cache with real object in virtual memory.
7238 7238 *
7239 7239 * XXX - Anonymous pages should not be sync'ed out at all.
7240 7240 */
7241 7241 static int
7242 7242 segvn_sync(struct seg *seg, caddr_t addr, size_t len, int attr, uint_t flags)
7243 7243 {
7244 7244 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7245 7245 struct vpage *vpp;
7246 7246 page_t *pp;
7247 7247 u_offset_t offset;
7248 7248 struct vnode *vp;
7249 7249 u_offset_t off;
7250 7250 caddr_t eaddr;
7251 7251 int bflags;
7252 7252 int err = 0;
7253 7253 int segtype;
7254 7254 int pageprot;
7255 7255 int prot;
7256 7256 ulong_t anon_index;
7257 7257 struct anon_map *amp;
7258 7258 struct anon *ap;
7259 7259 anon_sync_obj_t cookie;
7260 7260
7261 7261 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7262 7262
7263 7263 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7264 7264
7265 7265 if (svd->softlockcnt > 0) {
7266 7266 /*
7267 7267 * If this is shared segment non 0 softlockcnt
7268 7268 * means locked pages are still in use.
7269 7269 */
7270 7270 if (svd->type == MAP_SHARED) {
7271 7271 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7272 7272 return (EAGAIN);
7273 7273 }
7274 7274
7275 7275 /*
7276 7276 * flush all pages from seg cache
7277 7277 * otherwise we may deadlock in swap_putpage
7278 7278 * for B_INVAL page (4175402).
7279 7279 *
7280 7280 * Even if we grab segvn WRITER's lock
7281 7281 * here, there might be another thread which could've
7282 7282 * successfully performed lookup/insert just before
7283 7283 * we acquired the lock here. So, grabbing either
7284 7284 * lock here is of not much use. Until we devise
7285 7285 * a strategy at upper layers to solve the
7286 7286 * synchronization issues completely, we expect
7287 7287 * applications to handle this appropriately.
7288 7288 */
7289 7289 segvn_purge(seg);
7290 7290 if (svd->softlockcnt > 0) {
7291 7291 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7292 7292 return (EAGAIN);
7293 7293 }
7294 7294 } else if (svd->type == MAP_SHARED && svd->amp != NULL &&
7295 7295 svd->amp->a_softlockcnt > 0) {
7296 7296 /*
7297 7297 * Try to purge this amp's entries from pcache. It will
7298 7298 * succeed only if other segments that share the amp have no
7299 7299 * outstanding softlock's.
7300 7300 */
7301 7301 segvn_purge(seg);
7302 7302 if (svd->amp->a_softlockcnt > 0 || svd->softlockcnt > 0) {
7303 7303 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7304 7304 return (EAGAIN);
7305 7305 }
7306 7306 }
7307 7307
7308 7308 vpp = svd->vpage;
7309 7309 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7310 7310 bflags = ((flags & MS_ASYNC) ? B_ASYNC : 0) |
7311 7311 ((flags & MS_INVALIDATE) ? B_INVAL : 0);
7312 7312
7313 7313 if (attr) {
7314 7314 pageprot = attr & ~(SHARED|PRIVATE);
7315 7315 segtype = (attr & SHARED) ? MAP_SHARED : MAP_PRIVATE;
7316 7316
7317 7317 /*
7318 7318 * We are done if the segment types don't match
7319 7319 * or if we have segment level protections and
7320 7320 * they don't match.
7321 7321 */
7322 7322 if (svd->type != segtype) {
7323 7323 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7324 7324 return (0);
7325 7325 }
7326 7326 if (vpp == NULL) {
7327 7327 if (svd->prot != pageprot) {
7328 7328 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7329 7329 return (0);
7330 7330 }
7331 7331 prot = svd->prot;
7332 7332 } else
7333 7333 vpp = &svd->vpage[seg_page(seg, addr)];
7334 7334
7335 7335 } else if (svd->vp && svd->amp == NULL &&
7336 7336 (flags & MS_INVALIDATE) == 0) {
7337 7337
7338 7338 /*
7339 7339 * No attributes, no anonymous pages and MS_INVALIDATE flag
7340 7340 * is not on, just use one big request.
7341 7341 */
7342 7342 err = VOP_PUTPAGE(svd->vp, (offset_t)offset, len,
7343 7343 bflags, svd->cred, NULL);
7344 7344 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7345 7345 return (err);
7346 7346 }
7347 7347
7348 7348 if ((amp = svd->amp) != NULL)
7349 7349 anon_index = svd->anon_index + seg_page(seg, addr);
7350 7350
7351 7351 for (eaddr = addr + len; addr < eaddr; addr += PAGESIZE) {
7352 7352 ap = NULL;
7353 7353 if (amp != NULL) {
7354 7354 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7355 7355 anon_array_enter(amp, anon_index, &cookie);
7356 7356 ap = anon_get_ptr(amp->ahp, anon_index++);
7357 7357 if (ap != NULL) {
7358 7358 swap_xlate(ap, &vp, &off);
7359 7359 } else {
7360 7360 vp = svd->vp;
7361 7361 off = offset;
7362 7362 }
7363 7363 anon_array_exit(&cookie);
7364 7364 ANON_LOCK_EXIT(&->a_rwlock);
7365 7365 } else {
7366 7366 vp = svd->vp;
7367 7367 off = offset;
7368 7368 }
7369 7369 offset += PAGESIZE;
7370 7370
7371 7371 if (vp == NULL) /* untouched zfod page */
7372 7372 continue;
7373 7373
7374 7374 if (attr) {
7375 7375 if (vpp) {
7376 7376 prot = VPP_PROT(vpp);
7377 7377 vpp++;
7378 7378 }
7379 7379 if (prot != pageprot) {
7380 7380 continue;
7381 7381 }
7382 7382 }
7383 7383
7384 7384 /*
7385 7385 * See if any of these pages are locked -- if so, then we
7386 7386 * will have to truncate an invalidate request at the first
7387 7387 * locked one. We don't need the page_struct_lock to test
7388 7388 * as this is only advisory; even if we acquire it someone
7389 7389 * might race in and lock the page after we unlock and before
7390 7390 * we do the PUTPAGE, then PUTPAGE simply does nothing.
7391 7391 */
7392 7392 if (flags & MS_INVALIDATE) {
7393 7393 if ((pp = page_lookup(vp, off, SE_SHARED)) != NULL) {
7394 7394 if (pp->p_lckcnt != 0 || pp->p_cowcnt != 0) {
7395 7395 page_unlock(pp);
7396 7396 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7397 7397 return (EBUSY);
7398 7398 }
7399 7399 if (ap != NULL && pp->p_szc != 0 &&
7400 7400 page_tryupgrade(pp)) {
7401 7401 if (pp->p_lckcnt == 0 &&
7402 7402 pp->p_cowcnt == 0) {
7403 7403 /*
7404 7404 * swapfs VN_DISPOSE() won't
7405 7405 * invalidate large pages.
7406 7406 * Attempt to demote.
7407 7407 * XXX can't help it if it
7408 7408 * fails. But for swapfs
7409 7409 * pages it is no big deal.
7410 7410 */
7411 7411 (void) page_try_demote_pages(
7412 7412 pp);
7413 7413 }
7414 7414 }
7415 7415 page_unlock(pp);
7416 7416 }
7417 7417 } else if (svd->type == MAP_SHARED && amp != NULL) {
7418 7418 /*
7419 7419 * Avoid writing out to disk ISM's large pages
7420 7420 * because segspt_free_pages() relies on NULL an_pvp
7421 7421 * of anon slots of such pages.
7422 7422 */
7423 7423
7424 7424 ASSERT(svd->vp == NULL);
7425 7425 /*
7426 7426 * swapfs uses page_lookup_nowait if not freeing or
7427 7427 * invalidating and skips a page if
7428 7428 * page_lookup_nowait returns NULL.
7429 7429 */
7430 7430 pp = page_lookup_nowait(vp, off, SE_SHARED);
7431 7431 if (pp == NULL) {
7432 7432 continue;
7433 7433 }
7434 7434 if (pp->p_szc != 0) {
7435 7435 page_unlock(pp);
7436 7436 continue;
7437 7437 }
7438 7438
7439 7439 /*
7440 7440 * Note ISM pages are created large so (vp, off)'s
7441 7441 * page cannot suddenly become large after we unlock
7442 7442 * pp.
7443 7443 */
7444 7444 page_unlock(pp);
7445 7445 }
7446 7446 /*
7447 7447 * XXX - Should ultimately try to kluster
7448 7448 * calls to VOP_PUTPAGE() for performance.
7449 7449 */
7450 7450 VN_HOLD(vp);
7451 7451 err = VOP_PUTPAGE(vp, (offset_t)off, PAGESIZE,
7452 7452 (bflags | (IS_SWAPFSVP(vp) ? B_PAGE_NOWAIT : 0)),
7453 7453 svd->cred, NULL);
7454 7454
7455 7455 VN_RELE(vp);
7456 7456 if (err)
7457 7457 break;
7458 7458 }
7459 7459 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7460 7460 return (err);
7461 7461 }
7462 7462
7463 7463 /*
7464 7464 * Determine if we have data corresponding to pages in the
7465 7465 * primary storage virtual memory cache (i.e., "in core").
7466 7466 */
7467 7467 static size_t
7468 7468 segvn_incore(struct seg *seg, caddr_t addr, size_t len, char *vec)
7469 7469 {
7470 7470 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7471 7471 struct vnode *vp, *avp;
7472 7472 u_offset_t offset, aoffset;
7473 7473 size_t p, ep;
7474 7474 int ret;
7475 7475 struct vpage *vpp;
7476 7476 page_t *pp;
7477 7477 uint_t start;
7478 7478 struct anon_map *amp; /* XXX - for locknest */
7479 7479 struct anon *ap;
7480 7480 uint_t attr;
7481 7481 anon_sync_obj_t cookie;
7482 7482
7483 7483 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7484 7484
7485 7485 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7486 7486 if (svd->amp == NULL && svd->vp == NULL) {
7487 7487 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7488 7488 bzero(vec, btopr(len));
7489 7489 return (len); /* no anonymous pages created yet */
7490 7490 }
7491 7491
7492 7492 p = seg_page(seg, addr);
7493 7493 ep = seg_page(seg, addr + len);
7494 7494 start = svd->vp ? SEG_PAGE_VNODEBACKED : 0;
7495 7495
7496 7496 amp = svd->amp;
7497 7497 for (; p < ep; p++, addr += PAGESIZE) {
7498 7498 vpp = (svd->vpage) ? &svd->vpage[p]: NULL;
7499 7499 ret = start;
7500 7500 ap = NULL;
7501 7501 avp = NULL;
7502 7502 /* Grab the vnode/offset for the anon slot */
7503 7503 if (amp != NULL) {
7504 7504 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7505 7505 anon_array_enter(amp, svd->anon_index + p, &cookie);
7506 7506 ap = anon_get_ptr(amp->ahp, svd->anon_index + p);
7507 7507 if (ap != NULL) {
7508 7508 swap_xlate(ap, &avp, &aoffset);
7509 7509 }
7510 7510 anon_array_exit(&cookie);
7511 7511 ANON_LOCK_EXIT(&->a_rwlock);
7512 7512 }
7513 7513 if ((avp != NULL) && page_exists(avp, aoffset)) {
7514 7514 /* A page exists for the anon slot */
7515 7515 ret |= SEG_PAGE_INCORE;
7516 7516
7517 7517 /*
7518 7518 * If page is mapped and writable
7519 7519 */
7520 7520 attr = (uint_t)0;
7521 7521 if ((hat_getattr(seg->s_as->a_hat, addr,
7522 7522 &attr) != -1) && (attr & PROT_WRITE)) {
7523 7523 ret |= SEG_PAGE_ANON;
7524 7524 }
7525 7525 /*
7526 7526 * Don't get page_struct lock for lckcnt and cowcnt,
7527 7527 * since this is purely advisory.
7528 7528 */
7529 7529 if ((pp = page_lookup_nowait(avp, aoffset,
7530 7530 SE_SHARED)) != NULL) {
7531 7531 if (pp->p_lckcnt)
7532 7532 ret |= SEG_PAGE_SOFTLOCK;
7533 7533 if (pp->p_cowcnt)
7534 7534 ret |= SEG_PAGE_HASCOW;
7535 7535 page_unlock(pp);
7536 7536 }
7537 7537 }
7538 7538
7539 7539 /* Gather vnode statistics */
7540 7540 vp = svd->vp;
7541 7541 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7542 7542
7543 7543 if (vp != NULL) {
7544 7544 /*
7545 7545 * Try to obtain a "shared" lock on the page
7546 7546 * without blocking. If this fails, determine
7547 7547 * if the page is in memory.
7548 7548 */
7549 7549 pp = page_lookup_nowait(vp, offset, SE_SHARED);
7550 7550 if ((pp == NULL) && (page_exists(vp, offset))) {
7551 7551 /* Page is incore, and is named */
7552 7552 ret |= (SEG_PAGE_INCORE | SEG_PAGE_VNODE);
7553 7553 }
7554 7554 /*
7555 7555 * Don't get page_struct lock for lckcnt and cowcnt,
7556 7556 * since this is purely advisory.
7557 7557 */
7558 7558 if (pp != NULL) {
7559 7559 ret |= (SEG_PAGE_INCORE | SEG_PAGE_VNODE);
7560 7560 if (pp->p_lckcnt)
7561 7561 ret |= SEG_PAGE_SOFTLOCK;
7562 7562 if (pp->p_cowcnt)
7563 7563 ret |= SEG_PAGE_HASCOW;
7564 7564 page_unlock(pp);
7565 7565 }
7566 7566 }
7567 7567
7568 7568 /* Gather virtual page information */
7569 7569 if (vpp) {
7570 7570 if (VPP_ISPPLOCK(vpp))
7571 7571 ret |= SEG_PAGE_LOCKED;
7572 7572 vpp++;
7573 7573 }
7574 7574
7575 7575 *vec++ = (char)ret;
7576 7576 }
7577 7577 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7578 7578 return (len);
7579 7579 }
7580 7580
7581 7581 /*
7582 7582 * Statement for p_cowcnts/p_lckcnts.
7583 7583 *
7584 7584 * p_cowcnt is updated while mlock/munlocking MAP_PRIVATE and PROT_WRITE region
7585 7585 * irrespective of the following factors or anything else:
7586 7586 *
7587 7587 * (1) anon slots are populated or not
7588 7588 * (2) cow is broken or not
7589 7589 * (3) refcnt on ap is 1 or greater than 1
7590 7590 *
7591 7591 * If it's not MAP_PRIVATE and PROT_WRITE, p_lckcnt is updated during mlock
7592 7592 * and munlock.
7593 7593 *
7594 7594 *
7595 7595 * Handling p_cowcnts/p_lckcnts during copy-on-write fault:
7596 7596 *
7597 7597 * if vpage has PROT_WRITE
7598 7598 * transfer cowcnt on the oldpage -> cowcnt on the newpage
7599 7599 * else
7600 7600 * transfer lckcnt on the oldpage -> lckcnt on the newpage
7601 7601 *
7602 7602 * During copy-on-write, decrement p_cowcnt on the oldpage and increment
7603 7603 * p_cowcnt on the newpage *if* the corresponding vpage has PROT_WRITE.
7604 7604 *
7605 7605 * We may also break COW if softlocking on read access in the physio case.
7606 7606 * In this case, vpage may not have PROT_WRITE. So, we need to decrement
7607 7607 * p_lckcnt on the oldpage and increment p_lckcnt on the newpage *if* the
7608 7608 * vpage doesn't have PROT_WRITE.
7609 7609 *
7610 7610 *
7611 7611 * Handling p_cowcnts/p_lckcnts during mprotect on mlocked region:
7612 7612 *
7613 7613 * If a MAP_PRIVATE region loses PROT_WRITE, we decrement p_cowcnt and
7614 7614 * increment p_lckcnt by calling page_subclaim() which takes care of
7615 7615 * availrmem accounting and p_lckcnt overflow.
7616 7616 *
7617 7617 * If a MAP_PRIVATE region gains PROT_WRITE, we decrement p_lckcnt and
7618 7618 * increment p_cowcnt by calling page_addclaim() which takes care of
7619 7619 * availrmem availability and p_cowcnt overflow.
7620 7620 */
7621 7621
7622 7622 /*
7623 7623 * Lock down (or unlock) pages mapped by this segment.
7624 7624 *
7625 7625 * XXX only creates PAGESIZE pages if anon slots are not initialized.
7626 7626 * At fault time they will be relocated into larger pages.
7627 7627 */
7628 7628 static int
7629 7629 segvn_lockop(struct seg *seg, caddr_t addr, size_t len,
7630 7630 int attr, int op, ulong_t *lockmap, size_t pos)
7631 7631 {
7632 7632 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7633 7633 struct vpage *vpp;
7634 7634 struct vpage *evp;
7635 7635 page_t *pp;
7636 7636 u_offset_t offset;
7637 7637 u_offset_t off;
7638 7638 int segtype;
7639 7639 int pageprot;
7640 7640 int claim;
7641 7641 struct vnode *vp;
7642 7642 ulong_t anon_index;
7643 7643 struct anon_map *amp;
7644 7644 struct anon *ap;
7645 7645 struct vattr va;
7646 7646 anon_sync_obj_t cookie;
7647 7647 struct kshmid *sp = NULL;
7648 7648 struct proc *p = curproc;
7649 7649 kproject_t *proj = NULL;
7650 7650 int chargeproc = 1;
7651 7651 size_t locked_bytes = 0;
7652 7652 size_t unlocked_bytes = 0;
7653 7653 int err = 0;
7654 7654
7655 7655 /*
7656 7656 * Hold write lock on address space because may split or concatenate
7657 7657 * segments
7658 7658 */
7659 7659 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7660 7660
7661 7661 /*
7662 7662 * If this is a shm, use shm's project and zone, else use
7663 7663 * project and zone of calling process
7664 7664 */
7665 7665
7666 7666 /* Determine if this segment backs a sysV shm */
7667 7667 if (svd->amp != NULL && svd->amp->a_sp != NULL) {
7668 7668 ASSERT(svd->type == MAP_SHARED);
7669 7669 ASSERT(svd->tr_state == SEGVN_TR_OFF);
7670 7670 sp = svd->amp->a_sp;
7671 7671 proj = sp->shm_perm.ipc_proj;
7672 7672 chargeproc = 0;
7673 7673 }
7674 7674
7675 7675 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
7676 7676 if (attr) {
7677 7677 pageprot = attr & ~(SHARED|PRIVATE);
7678 7678 segtype = attr & SHARED ? MAP_SHARED : MAP_PRIVATE;
7679 7679
7680 7680 /*
7681 7681 * We are done if the segment types don't match
7682 7682 * or if we have segment level protections and
7683 7683 * they don't match.
7684 7684 */
7685 7685 if (svd->type != segtype) {
7686 7686 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7687 7687 return (0);
7688 7688 }
7689 7689 if (svd->pageprot == 0 && svd->prot != pageprot) {
7690 7690 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7691 7691 return (0);
7692 7692 }
7693 7693 }
7694 7694
7695 7695 if (op == MC_LOCK) {
7696 7696 if (svd->tr_state == SEGVN_TR_INIT) {
7697 7697 svd->tr_state = SEGVN_TR_OFF;
7698 7698 } else if (svd->tr_state == SEGVN_TR_ON) {
7699 7699 ASSERT(svd->amp != NULL);
7700 7700 segvn_textunrepl(seg, 0);
7701 7701 ASSERT(svd->amp == NULL &&
7702 7702 svd->tr_state == SEGVN_TR_OFF);
7703 7703 }
7704 7704 }
7705 7705
7706 7706 /*
7707 7707 * If we're locking, then we must create a vpage structure if
7708 7708 * none exists. If we're unlocking, then check to see if there
7709 7709 * is a vpage -- if not, then we could not have locked anything.
7710 7710 */
7711 7711
7712 7712 if ((vpp = svd->vpage) == NULL) {
7713 7713 if (op == MC_LOCK) {
7714 7714 segvn_vpage(seg);
7715 7715 if (svd->vpage == NULL) {
7716 7716 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7717 7717 return (ENOMEM);
7718 7718 }
7719 7719 } else {
7720 7720 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7721 7721 return (0);
7722 7722 }
7723 7723 }
7724 7724
7725 7725 /*
7726 7726 * The anonymous data vector (i.e., previously
7727 7727 * unreferenced mapping to swap space) can be allocated
7728 7728 * by lazily testing for its existence.
7729 7729 */
7730 7730 if (op == MC_LOCK && svd->amp == NULL && svd->vp == NULL) {
7731 7731 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
7732 7732 svd->amp = anonmap_alloc(seg->s_size, 0, ANON_SLEEP);
7733 7733 svd->amp->a_szc = seg->s_szc;
7734 7734 }
7735 7735
7736 7736 if ((amp = svd->amp) != NULL) {
7737 7737 anon_index = svd->anon_index + seg_page(seg, addr);
7738 7738 }
7739 7739
7740 7740 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7741 7741 evp = &svd->vpage[seg_page(seg, addr + len)];
7742 7742
7743 7743 if (sp != NULL)
7744 7744 mutex_enter(&sp->shm_mlock);
7745 7745
7746 7746 /* determine number of unlocked bytes in range for lock operation */
7747 7747 if (op == MC_LOCK) {
7748 7748
7749 7749 if (sp == NULL) {
7750 7750 for (vpp = &svd->vpage[seg_page(seg, addr)]; vpp < evp;
7751 7751 vpp++) {
7752 7752 if (!VPP_ISPPLOCK(vpp))
7753 7753 unlocked_bytes += PAGESIZE;
7754 7754 }
7755 7755 } else {
7756 7756 ulong_t i_idx, i_edx;
7757 7757 anon_sync_obj_t i_cookie;
7758 7758 struct anon *i_ap;
7759 7759 struct vnode *i_vp;
7760 7760 u_offset_t i_off;
7761 7761
7762 7762 /* Only count sysV pages once for locked memory */
7763 7763 i_edx = svd->anon_index + seg_page(seg, addr + len);
7764 7764 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7765 7765 for (i_idx = anon_index; i_idx < i_edx; i_idx++) {
7766 7766 anon_array_enter(amp, i_idx, &i_cookie);
7767 7767 i_ap = anon_get_ptr(amp->ahp, i_idx);
7768 7768 if (i_ap == NULL) {
7769 7769 unlocked_bytes += PAGESIZE;
7770 7770 anon_array_exit(&i_cookie);
7771 7771 continue;
7772 7772 }
7773 7773 swap_xlate(i_ap, &i_vp, &i_off);
7774 7774 anon_array_exit(&i_cookie);
7775 7775 pp = page_lookup(i_vp, i_off, SE_SHARED);
7776 7776 if (pp == NULL) {
7777 7777 unlocked_bytes += PAGESIZE;
7778 7778 continue;
7779 7779 } else if (pp->p_lckcnt == 0)
7780 7780 unlocked_bytes += PAGESIZE;
7781 7781 page_unlock(pp);
7782 7782 }
7783 7783 ANON_LOCK_EXIT(&->a_rwlock);
7784 7784 }
7785 7785
7786 7786 mutex_enter(&p->p_lock);
7787 7787 err = rctl_incr_locked_mem(p, proj, unlocked_bytes,
7788 7788 chargeproc);
7789 7789 mutex_exit(&p->p_lock);
7790 7790
7791 7791 if (err) {
7792 7792 if (sp != NULL)
7793 7793 mutex_exit(&sp->shm_mlock);
7794 7794 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7795 7795 return (err);
7796 7796 }
7797 7797 }
7798 7798 /*
7799 7799 * Loop over all pages in the range. Process if we're locking and
7800 7800 * page has not already been locked in this mapping; or if we're
7801 7801 * unlocking and the page has been locked.
7802 7802 */
7803 7803 for (vpp = &svd->vpage[seg_page(seg, addr)]; vpp < evp;
7804 7804 vpp++, pos++, addr += PAGESIZE, offset += PAGESIZE, anon_index++) {
7805 7805 if ((attr == 0 || VPP_PROT(vpp) == pageprot) &&
7806 7806 ((op == MC_LOCK && !VPP_ISPPLOCK(vpp)) ||
7807 7807 (op == MC_UNLOCK && VPP_ISPPLOCK(vpp)))) {
7808 7808
7809 7809 if (amp != NULL)
7810 7810 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7811 7811 /*
7812 7812 * If this isn't a MAP_NORESERVE segment and
7813 7813 * we're locking, allocate anon slots if they
7814 7814 * don't exist. The page is brought in later on.
7815 7815 */
7816 7816 if (op == MC_LOCK && svd->vp == NULL &&
7817 7817 ((svd->flags & MAP_NORESERVE) == 0) &&
7818 7818 amp != NULL &&
7819 7819 ((ap = anon_get_ptr(amp->ahp, anon_index))
7820 7820 == NULL)) {
7821 7821 anon_array_enter(amp, anon_index, &cookie);
7822 7822
7823 7823 if ((ap = anon_get_ptr(amp->ahp,
7824 7824 anon_index)) == NULL) {
7825 7825 pp = anon_zero(seg, addr, &ap,
7826 7826 svd->cred);
7827 7827 if (pp == NULL) {
7828 7828 anon_array_exit(&cookie);
7829 7829 ANON_LOCK_EXIT(&->a_rwlock);
7830 7830 err = ENOMEM;
7831 7831 goto out;
7832 7832 }
7833 7833 ASSERT(anon_get_ptr(amp->ahp,
7834 7834 anon_index) == NULL);
7835 7835 (void) anon_set_ptr(amp->ahp,
7836 7836 anon_index, ap, ANON_SLEEP);
7837 7837 page_unlock(pp);
7838 7838 }
7839 7839 anon_array_exit(&cookie);
7840 7840 }
7841 7841
7842 7842 /*
7843 7843 * Get name for page, accounting for
7844 7844 * existence of private copy.
7845 7845 */
7846 7846 ap = NULL;
7847 7847 if (amp != NULL) {
7848 7848 anon_array_enter(amp, anon_index, &cookie);
7849 7849 ap = anon_get_ptr(amp->ahp, anon_index);
7850 7850 if (ap != NULL) {
7851 7851 swap_xlate(ap, &vp, &off);
7852 7852 } else {
7853 7853 if (svd->vp == NULL &&
7854 7854 (svd->flags & MAP_NORESERVE)) {
7855 7855 anon_array_exit(&cookie);
7856 7856 ANON_LOCK_EXIT(&->a_rwlock);
7857 7857 continue;
7858 7858 }
7859 7859 vp = svd->vp;
7860 7860 off = offset;
7861 7861 }
7862 7862 if (op != MC_LOCK || ap == NULL) {
7863 7863 anon_array_exit(&cookie);
7864 7864 ANON_LOCK_EXIT(&->a_rwlock);
7865 7865 }
7866 7866 } else {
7867 7867 vp = svd->vp;
7868 7868 off = offset;
7869 7869 }
7870 7870
7871 7871 /*
7872 7872 * Get page frame. It's ok if the page is
7873 7873 * not available when we're unlocking, as this
7874 7874 * may simply mean that a page we locked got
7875 7875 * truncated out of existence after we locked it.
7876 7876 *
7877 7877 * Invoke VOP_GETPAGE() to obtain the page struct
7878 7878 * since we may need to read it from disk if its
7879 7879 * been paged out.
7880 7880 */
7881 7881 if (op != MC_LOCK)
7882 7882 pp = page_lookup(vp, off, SE_SHARED);
7883 7883 else {
7884 7884 page_t *pl[1 + 1];
7885 7885 int error;
7886 7886
7887 7887 ASSERT(vp != NULL);
7888 7888
7889 7889 error = VOP_GETPAGE(vp, (offset_t)off, PAGESIZE,
7890 7890 (uint_t *)NULL, pl, PAGESIZE, seg, addr,
7891 7891 S_OTHER, svd->cred, NULL);
7892 7892
7893 7893 if (error && ap != NULL) {
7894 7894 anon_array_exit(&cookie);
7895 7895 ANON_LOCK_EXIT(&->a_rwlock);
7896 7896 }
7897 7897
7898 7898 /*
7899 7899 * If the error is EDEADLK then we must bounce
7900 7900 * up and drop all vm subsystem locks and then
7901 7901 * retry the operation later
7902 7902 * This behavior is a temporary measure because
7903 7903 * ufs/sds logging is badly designed and will
7904 7904 * deadlock if we don't allow this bounce to
7905 7905 * happen. The real solution is to re-design
7906 7906 * the logging code to work properly. See bug
7907 7907 * 4125102 for details of the problem.
7908 7908 */
7909 7909 if (error == EDEADLK) {
7910 7910 err = error;
7911 7911 goto out;
7912 7912 }
7913 7913 /*
7914 7914 * Quit if we fail to fault in the page. Treat
7915 7915 * the failure as an error, unless the addr
7916 7916 * is mapped beyond the end of a file.
7917 7917 */
7918 7918 if (error && svd->vp) {
7919 7919 va.va_mask = AT_SIZE;
7920 7920 if (VOP_GETATTR(svd->vp, &va, 0,
7921 7921 svd->cred, NULL) != 0) {
7922 7922 err = EIO;
7923 7923 goto out;
7924 7924 }
7925 7925 if (btopr(va.va_size) >=
7926 7926 btopr(off + 1)) {
7927 7927 err = EIO;
7928 7928 goto out;
7929 7929 }
7930 7930 goto out;
7931 7931
7932 7932 } else if (error) {
7933 7933 err = EIO;
7934 7934 goto out;
7935 7935 }
7936 7936 pp = pl[0];
7937 7937 ASSERT(pp != NULL);
7938 7938 }
7939 7939
7940 7940 /*
7941 7941 * See Statement at the beginning of this routine.
7942 7942 *
7943 7943 * claim is always set if MAP_PRIVATE and PROT_WRITE
7944 7944 * irrespective of following factors:
7945 7945 *
7946 7946 * (1) anon slots are populated or not
7947 7947 * (2) cow is broken or not
7948 7948 * (3) refcnt on ap is 1 or greater than 1
7949 7949 *
7950 7950 * See 4140683 for details
7951 7951 */
7952 7952 claim = ((VPP_PROT(vpp) & PROT_WRITE) &&
7953 7953 (svd->type == MAP_PRIVATE));
7954 7954
7955 7955 /*
7956 7956 * Perform page-level operation appropriate to
7957 7957 * operation. If locking, undo the SOFTLOCK
7958 7958 * performed to bring the page into memory
7959 7959 * after setting the lock. If unlocking,
7960 7960 * and no page was found, account for the claim
7961 7961 * separately.
7962 7962 */
7963 7963 if (op == MC_LOCK) {
7964 7964 int ret = 1; /* Assume success */
7965 7965
7966 7966 ASSERT(!VPP_ISPPLOCK(vpp));
7967 7967
7968 7968 ret = page_pp_lock(pp, claim, 0);
7969 7969 if (ap != NULL) {
7970 7970 if (ap->an_pvp != NULL) {
7971 7971 anon_swap_free(ap, pp);
7972 7972 }
7973 7973 anon_array_exit(&cookie);
7974 7974 ANON_LOCK_EXIT(&->a_rwlock);
7975 7975 }
7976 7976 if (ret == 0) {
7977 7977 /* locking page failed */
7978 7978 page_unlock(pp);
7979 7979 err = EAGAIN;
7980 7980 goto out;
7981 7981 }
7982 7982 VPP_SETPPLOCK(vpp);
7983 7983 if (sp != NULL) {
7984 7984 if (pp->p_lckcnt == 1)
7985 7985 locked_bytes += PAGESIZE;
7986 7986 } else
7987 7987 locked_bytes += PAGESIZE;
7988 7988
7989 7989 if (lockmap != (ulong_t *)NULL)
7990 7990 BT_SET(lockmap, pos);
7991 7991
7992 7992 page_unlock(pp);
7993 7993 } else {
7994 7994 ASSERT(VPP_ISPPLOCK(vpp));
7995 7995 if (pp != NULL) {
7996 7996 /* sysV pages should be locked */
7997 7997 ASSERT(sp == NULL || pp->p_lckcnt > 0);
7998 7998 page_pp_unlock(pp, claim, 0);
7999 7999 if (sp != NULL) {
8000 8000 if (pp->p_lckcnt == 0)
8001 8001 unlocked_bytes
8002 8002 += PAGESIZE;
8003 8003 } else
8004 8004 unlocked_bytes += PAGESIZE;
8005 8005 page_unlock(pp);
8006 8006 } else {
8007 8007 ASSERT(sp == NULL);
8008 8008 unlocked_bytes += PAGESIZE;
8009 8009 }
8010 8010 VPP_CLRPPLOCK(vpp);
8011 8011 }
8012 8012 }
8013 8013 }
8014 8014 out:
8015 8015 if (op == MC_LOCK) {
8016 8016 /* Credit back bytes that did not get locked */
8017 8017 if ((unlocked_bytes - locked_bytes) > 0) {
8018 8018 if (proj == NULL)
8019 8019 mutex_enter(&p->p_lock);
8020 8020 rctl_decr_locked_mem(p, proj,
8021 8021 (unlocked_bytes - locked_bytes), chargeproc);
8022 8022 if (proj == NULL)
8023 8023 mutex_exit(&p->p_lock);
8024 8024 }
8025 8025
8026 8026 } else {
8027 8027 /* Account bytes that were unlocked */
8028 8028 if (unlocked_bytes > 0) {
8029 8029 if (proj == NULL)
8030 8030 mutex_enter(&p->p_lock);
8031 8031 rctl_decr_locked_mem(p, proj, unlocked_bytes,
8032 8032 chargeproc);
8033 8033 if (proj == NULL)
8034 8034 mutex_exit(&p->p_lock);
8035 8035 }
8036 8036 }
8037 8037 if (sp != NULL)
8038 8038 mutex_exit(&sp->shm_mlock);
8039 8039 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8040 8040
8041 8041 return (err);
8042 8042 }
8043 8043
8044 8044 /*
8045 8045 * Set advice from user for specified pages
8046 8046 * There are 10 types of advice:
8047 8047 * MADV_NORMAL - Normal (default) behavior (whatever that is)
8048 8048 * MADV_RANDOM - Random page references
8049 8049 * do not allow readahead or 'klustering'
8050 8050 * MADV_SEQUENTIAL - Sequential page references
8051 8051 * Pages previous to the one currently being
8052 8052 * accessed (determined by fault) are 'not needed'
8053 8053 * and are freed immediately
8054 8054 * MADV_WILLNEED - Pages are likely to be used (fault ahead in mctl)
8055 8055 * MADV_DONTNEED - Pages are not needed (synced out in mctl)
8056 8056 * MADV_FREE - Contents can be discarded
8057 8057 * MADV_ACCESS_DEFAULT- Default access
8058 8058 * MADV_ACCESS_LWP - Next LWP will access heavily
8059 8059 * MADV_ACCESS_MANY- Many LWPs or processes will access heavily
8060 8060 * MADV_PURGE - Contents will be immediately discarded
8061 8061 */
8062 8062 static int
8063 8063 segvn_advise(struct seg *seg, caddr_t addr, size_t len, uint_t behav)
8064 8064 {
8065 8065 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8066 8066 size_t page;
8067 8067 int err = 0;
8068 8068 int already_set;
8069 8069 struct anon_map *amp;
8070 8070 ulong_t anon_index;
8071 8071 struct seg *next;
8072 8072 lgrp_mem_policy_t policy;
8073 8073 struct seg *prev;
8074 8074 struct vnode *vp;
8075 8075
8076 8076 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8077 8077
8078 8078 /*
8079 8079 * In case of MADV_FREE/MADV_PURGE, we won't be modifying any segment
8080 8080 * private data structures; so, we only need to grab READER's lock
8081 8081 */
8082 8082 if (behav != MADV_FREE && behav != MADV_PURGE) {
8083 8083 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
8084 8084 if (svd->tr_state != SEGVN_TR_OFF) {
8085 8085 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8086 8086 return (0);
8087 8087 }
8088 8088 } else {
8089 8089 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
8090 8090 }
8091 8091
8092 8092 /*
8093 8093 * Large pages are assumed to be only turned on when accesses to the
8094 8094 * segment's address range have spatial and temporal locality. That
8095 8095 * justifies ignoring MADV_SEQUENTIAL for large page segments.
8096 8096 * Also, ignore advice affecting lgroup memory allocation
8097 8097 * if don't need to do lgroup optimizations on this system
8098 8098 */
8099 8099
8100 8100 if ((behav == MADV_SEQUENTIAL &&
8101 8101 (seg->s_szc != 0 || HAT_IS_REGION_COOKIE_VALID(svd->rcookie))) ||
8102 8102 (!lgrp_optimizations() && (behav == MADV_ACCESS_DEFAULT ||
8103 8103 behav == MADV_ACCESS_LWP || behav == MADV_ACCESS_MANY))) {
8104 8104 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8105 8105 return (0);
8106 8106 }
8107 8107
8108 8108 if (behav == MADV_SEQUENTIAL || behav == MADV_ACCESS_DEFAULT ||
8109 8109 behav == MADV_ACCESS_LWP || behav == MADV_ACCESS_MANY) {
8110 8110 /*
8111 8111 * Since we are going to unload hat mappings
8112 8112 * we first have to flush the cache. Otherwise
8113 8113 * this might lead to system panic if another
8114 8114 * thread is doing physio on the range whose
8115 8115 * mappings are unloaded by madvise(3C).
8116 8116 */
8117 8117 if (svd->softlockcnt > 0) {
8118 8118 /*
8119 8119 * If this is shared segment non 0 softlockcnt
8120 8120 * means locked pages are still in use.
8121 8121 */
8122 8122 if (svd->type == MAP_SHARED) {
8123 8123 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8124 8124 return (EAGAIN);
8125 8125 }
8126 8126 /*
8127 8127 * Since we do have the segvn writers lock
8128 8128 * nobody can fill the cache with entries
8129 8129 * belonging to this seg during the purge.
8130 8130 * The flush either succeeds or we still
8131 8131 * have pending I/Os. In the later case,
8132 8132 * madvise(3C) fails.
8133 8133 */
8134 8134 segvn_purge(seg);
8135 8135 if (svd->softlockcnt > 0) {
8136 8136 /*
8137 8137 * Since madvise(3C) is advisory and
8138 8138 * it's not part of UNIX98, madvise(3C)
8139 8139 * failure here doesn't cause any hardship.
8140 8140 * Note that we don't block in "as" layer.
8141 8141 */
8142 8142 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8143 8143 return (EAGAIN);
8144 8144 }
8145 8145 } else if (svd->type == MAP_SHARED && svd->amp != NULL &&
8146 8146 svd->amp->a_softlockcnt > 0) {
8147 8147 /*
8148 8148 * Try to purge this amp's entries from pcache. It
8149 8149 * will succeed only if other segments that share the
8150 8150 * amp have no outstanding softlock's.
8151 8151 */
8152 8152 segvn_purge(seg);
8153 8153 }
8154 8154 }
8155 8155
8156 8156 amp = svd->amp;
8157 8157 vp = svd->vp;
8158 8158 if (behav == MADV_FREE || behav == MADV_PURGE) {
8159 8159 pgcnt_t purged;
8160 8160
8161 8161 if (behav == MADV_FREE && (vp != NULL || amp == NULL)) {
8162 8162 /*
8163 8163 * MADV_FREE is not supported for segments with an
8164 8164 * underlying object; if anonmap is NULL, anon slots
8165 8165 * are not yet populated and there is nothing for us
8166 8166 * to do. As MADV_FREE is advisory, we don't return an
8167 8167 * error in either case.
8168 8168 */
8169 8169 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8170 8170 return (0);
8171 8171 }
8172 8172
8173 8173 if (amp == NULL) {
8174 8174 /*
8175 8175 * If we're here with a NULL anonmap, it's because we
8176 8176 * are doing a MADV_PURGE. We have nothing to do, but
8177 8177 * because MADV_PURGE isn't merely advisory, we return
8178 8178 * an error in this case.
8179 8179 */
8180 8180 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8181 8181 return (EBUSY);
8182 8182 }
8183 8183
8184 8184 segvn_purge(seg);
8185 8185
8186 8186 page = seg_page(seg, addr);
8187 8187 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
8188 8188 err = anon_disclaim(amp,
8189 8189 svd->anon_index + page, len, behav, &purged);
8190 8190
8191 8191 if (purged != 0 && (svd->flags & MAP_NORESERVE)) {
8192 8192 /*
8193 8193 * If we purged pages on a MAP_NORESERVE mapping, we
8194 8194 * need to be sure to now unreserve our reserved swap.
8195 8195 * (We use the atomic operations to manipulate our
8196 8196 * segment and address space counters because we only
8197 8197 * have the corresponding locks held as reader, not
8198 8198 * writer.)
8199 8199 */
8200 8200 ssize_t bytes = ptob(purged);
8201 8201
8202 8202 anon_unresv_zone(bytes, seg->s_as->a_proc->p_zone);
8203 8203 atomic_add_long(&svd->swresv, -bytes);
8204 8204 atomic_add_long(&seg->s_as->a_resvsize, -bytes);
8205 8205 }
8206 8206
8207 8207 ANON_LOCK_EXIT(&->a_rwlock);
8208 8208 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8209 8209
8210 8210 /*
8211 8211 * MADV_PURGE and MADV_FREE differ in their return semantics:
8212 8212 * because MADV_PURGE is designed to be bug-for-bug compatible
8213 8213 * with its clumsy Linux forebear, it will fail where MADV_FREE
8214 8214 * does not.
8215 8215 */
8216 8216 return (behav == MADV_PURGE ? err : 0);
8217 8217 }
8218 8218
8219 8219 /*
8220 8220 * If advice is to be applied to entire segment,
8221 8221 * use advice field in seg_data structure
8222 8222 * otherwise use appropriate vpage entry.
8223 8223 */
8224 8224 if ((addr == seg->s_base) && (len == seg->s_size)) {
8225 8225 switch (behav) {
8226 8226 case MADV_ACCESS_LWP:
8227 8227 case MADV_ACCESS_MANY:
8228 8228 case MADV_ACCESS_DEFAULT:
8229 8229 /*
8230 8230 * Set memory allocation policy for this segment
8231 8231 */
8232 8232 policy = lgrp_madv_to_policy(behav, len, svd->type);
8233 8233 if (svd->type == MAP_SHARED)
8234 8234 already_set = lgrp_shm_policy_set(policy, amp,
8235 8235 svd->anon_index, vp, svd->offset, len);
8236 8236 else {
8237 8237 /*
8238 8238 * For private memory, need writers lock on
8239 8239 * address space because the segment may be
8240 8240 * split or concatenated when changing policy
8241 8241 */
8242 8242 if (AS_READ_HELD(seg->s_as)) {
8243 8243 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8244 8244 return (IE_RETRY);
8245 8245 }
8246 8246
8247 8247 already_set = lgrp_privm_policy_set(policy,
8248 8248 &svd->policy_info, len);
8249 8249 }
8250 8250
8251 8251 /*
8252 8252 * If policy set already and it shouldn't be reapplied,
8253 8253 * don't do anything.
8254 8254 */
8255 8255 if (already_set &&
8256 8256 !LGRP_MEM_POLICY_REAPPLICABLE(policy))
8257 8257 break;
8258 8258
8259 8259 /*
8260 8260 * Mark any existing pages in given range for
8261 8261 * migration
8262 8262 */
8263 8263 page_mark_migrate(seg, addr, len, amp, svd->anon_index,
8264 8264 vp, svd->offset, 1);
8265 8265
8266 8266 /*
8267 8267 * If same policy set already or this is a shared
8268 8268 * memory segment, don't need to try to concatenate
8269 8269 * segment with adjacent ones.
8270 8270 */
8271 8271 if (already_set || svd->type == MAP_SHARED)
8272 8272 break;
8273 8273
8274 8274 /*
8275 8275 * Try to concatenate this segment with previous
8276 8276 * one and next one, since we changed policy for
8277 8277 * this one and it may be compatible with adjacent
8278 8278 * ones now.
8279 8279 */
8280 8280 prev = AS_SEGPREV(seg->s_as, seg);
8281 8281 next = AS_SEGNEXT(seg->s_as, seg);
8282 8282
8283 8283 if (next && next->s_ops == &segvn_ops &&
8284 8284 addr + len == next->s_base)
8285 8285 (void) segvn_concat(seg, next, 1);
8286 8286
8287 8287 if (prev && prev->s_ops == &segvn_ops &&
8288 8288 addr == prev->s_base + prev->s_size) {
8289 8289 /*
8290 8290 * Drop lock for private data of current
8291 8291 * segment before concatenating (deleting) it
8292 8292 * and return IE_REATTACH to tell as_ctl() that
8293 8293 * current segment has changed
8294 8294 */
8295 8295 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8296 8296 if (!segvn_concat(prev, seg, 1))
8297 8297 err = IE_REATTACH;
8298 8298
8299 8299 return (err);
8300 8300 }
8301 8301 break;
8302 8302
8303 8303 case MADV_SEQUENTIAL:
8304 8304 /*
8305 8305 * unloading mapping guarantees
8306 8306 * detection in segvn_fault
8307 8307 */
8308 8308 ASSERT(seg->s_szc == 0);
8309 8309 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
8310 8310 hat_unload(seg->s_as->a_hat, addr, len,
8311 8311 HAT_UNLOAD);
8312 8312 /* FALLTHROUGH */
8313 8313 case MADV_NORMAL:
8314 8314 case MADV_RANDOM:
8315 8315 svd->advice = (uchar_t)behav;
8316 8316 svd->pageadvice = 0;
8317 8317 break;
8318 8318 case MADV_WILLNEED: /* handled in memcntl */
8319 8319 case MADV_DONTNEED: /* handled in memcntl */
8320 8320 case MADV_FREE: /* handled above */
8321 8321 case MADV_PURGE: /* handled above */
8322 8322 break;
8323 8323 default:
8324 8324 err = EINVAL;
8325 8325 }
8326 8326 } else {
8327 8327 caddr_t eaddr;
8328 8328 struct seg *new_seg;
8329 8329 struct segvn_data *new_svd;
8330 8330 u_offset_t off;
8331 8331 caddr_t oldeaddr;
8332 8332
8333 8333 page = seg_page(seg, addr);
8334 8334
8335 8335 segvn_vpage(seg);
8336 8336 if (svd->vpage == NULL) {
8337 8337 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8338 8338 return (ENOMEM);
8339 8339 }
8340 8340
8341 8341 switch (behav) {
8342 8342 struct vpage *bvpp, *evpp;
8343 8343
8344 8344 case MADV_ACCESS_LWP:
8345 8345 case MADV_ACCESS_MANY:
8346 8346 case MADV_ACCESS_DEFAULT:
8347 8347 /*
8348 8348 * Set memory allocation policy for portion of this
8349 8349 * segment
8350 8350 */
8351 8351
8352 8352 /*
8353 8353 * Align address and length of advice to page
8354 8354 * boundaries for large pages
8355 8355 */
8356 8356 if (seg->s_szc != 0) {
8357 8357 size_t pgsz;
8358 8358
8359 8359 pgsz = page_get_pagesize(seg->s_szc);
8360 8360 addr = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
8361 8361 len = P2ROUNDUP(len, pgsz);
8362 8362 }
8363 8363
8364 8364 /*
8365 8365 * Check to see whether policy is set already
8366 8366 */
8367 8367 policy = lgrp_madv_to_policy(behav, len, svd->type);
8368 8368
8369 8369 anon_index = svd->anon_index + page;
8370 8370 off = svd->offset + (uintptr_t)(addr - seg->s_base);
8371 8371
8372 8372 if (svd->type == MAP_SHARED)
8373 8373 already_set = lgrp_shm_policy_set(policy, amp,
8374 8374 anon_index, vp, off, len);
8375 8375 else
8376 8376 already_set =
8377 8377 (policy == svd->policy_info.mem_policy);
8378 8378
8379 8379 /*
8380 8380 * If policy set already and it shouldn't be reapplied,
8381 8381 * don't do anything.
8382 8382 */
8383 8383 if (already_set &&
8384 8384 !LGRP_MEM_POLICY_REAPPLICABLE(policy))
8385 8385 break;
8386 8386
8387 8387 /*
8388 8388 * For private memory, need writers lock on
8389 8389 * address space because the segment may be
8390 8390 * split or concatenated when changing policy
8391 8391 */
8392 8392 if (svd->type == MAP_PRIVATE &&
8393 8393 AS_READ_HELD(seg->s_as)) {
8394 8394 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8395 8395 return (IE_RETRY);
8396 8396 }
8397 8397
8398 8398 /*
8399 8399 * Mark any existing pages in given range for
8400 8400 * migration
8401 8401 */
8402 8402 page_mark_migrate(seg, addr, len, amp, svd->anon_index,
8403 8403 vp, svd->offset, 1);
8404 8404
8405 8405 /*
8406 8406 * Don't need to try to split or concatenate
8407 8407 * segments, since policy is same or this is a shared
8408 8408 * memory segment
8409 8409 */
8410 8410 if (already_set || svd->type == MAP_SHARED)
8411 8411 break;
8412 8412
8413 8413 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
8414 8414 ASSERT(svd->amp == NULL);
8415 8415 ASSERT(svd->tr_state == SEGVN_TR_OFF);
8416 8416 ASSERT(svd->softlockcnt == 0);
8417 8417 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
8418 8418 HAT_REGION_TEXT);
8419 8419 svd->rcookie = HAT_INVALID_REGION_COOKIE;
8420 8420 }
8421 8421
8422 8422 /*
8423 8423 * Split off new segment if advice only applies to a
8424 8424 * portion of existing segment starting in middle
8425 8425 */
8426 8426 new_seg = NULL;
8427 8427 eaddr = addr + len;
8428 8428 oldeaddr = seg->s_base + seg->s_size;
8429 8429 if (addr > seg->s_base) {
8430 8430 /*
8431 8431 * Must flush I/O page cache
8432 8432 * before splitting segment
8433 8433 */
8434 8434 if (svd->softlockcnt > 0)
8435 8435 segvn_purge(seg);
8436 8436
8437 8437 /*
8438 8438 * Split segment and return IE_REATTACH to tell
8439 8439 * as_ctl() that current segment changed
8440 8440 */
8441 8441 new_seg = segvn_split_seg(seg, addr);
8442 8442 new_svd = (struct segvn_data *)new_seg->s_data;
8443 8443 err = IE_REATTACH;
8444 8444
8445 8445 /*
8446 8446 * If new segment ends where old one
8447 8447 * did, try to concatenate the new
8448 8448 * segment with next one.
8449 8449 */
8450 8450 if (eaddr == oldeaddr) {
8451 8451 /*
8452 8452 * Set policy for new segment
8453 8453 */
8454 8454 (void) lgrp_privm_policy_set(policy,
8455 8455 &new_svd->policy_info,
8456 8456 new_seg->s_size);
8457 8457
8458 8458 next = AS_SEGNEXT(new_seg->s_as,
8459 8459 new_seg);
8460 8460
8461 8461 if (next &&
8462 8462 next->s_ops == &segvn_ops &&
8463 8463 eaddr == next->s_base)
8464 8464 (void) segvn_concat(new_seg,
8465 8465 next, 1);
8466 8466 }
8467 8467 }
8468 8468
8469 8469 /*
8470 8470 * Split off end of existing segment if advice only
8471 8471 * applies to a portion of segment ending before
8472 8472 * end of the existing segment
8473 8473 */
8474 8474 if (eaddr < oldeaddr) {
8475 8475 /*
8476 8476 * Must flush I/O page cache
8477 8477 * before splitting segment
8478 8478 */
8479 8479 if (svd->softlockcnt > 0)
8480 8480 segvn_purge(seg);
8481 8481
8482 8482 /*
8483 8483 * If beginning of old segment was already
8484 8484 * split off, use new segment to split end off
8485 8485 * from.
8486 8486 */
8487 8487 if (new_seg != NULL && new_seg != seg) {
8488 8488 /*
8489 8489 * Split segment
8490 8490 */
8491 8491 (void) segvn_split_seg(new_seg, eaddr);
8492 8492
8493 8493 /*
8494 8494 * Set policy for new segment
8495 8495 */
8496 8496 (void) lgrp_privm_policy_set(policy,
8497 8497 &new_svd->policy_info,
8498 8498 new_seg->s_size);
8499 8499 } else {
8500 8500 /*
8501 8501 * Split segment and return IE_REATTACH
8502 8502 * to tell as_ctl() that current
8503 8503 * segment changed
8504 8504 */
8505 8505 (void) segvn_split_seg(seg, eaddr);
8506 8506 err = IE_REATTACH;
8507 8507
8508 8508 (void) lgrp_privm_policy_set(policy,
8509 8509 &svd->policy_info, seg->s_size);
8510 8510
8511 8511 /*
8512 8512 * If new segment starts where old one
8513 8513 * did, try to concatenate it with
8514 8514 * previous segment.
8515 8515 */
8516 8516 if (addr == seg->s_base) {
8517 8517 prev = AS_SEGPREV(seg->s_as,
8518 8518 seg);
8519 8519
8520 8520 /*
8521 8521 * Drop lock for private data
8522 8522 * of current segment before
8523 8523 * concatenating (deleting) it
8524 8524 */
8525 8525 if (prev &&
8526 8526 prev->s_ops ==
8527 8527 &segvn_ops &&
8528 8528 addr == prev->s_base +
8529 8529 prev->s_size) {
8530 8530 SEGVN_LOCK_EXIT(
8531 8531 seg->s_as,
8532 8532 &svd->lock);
8533 8533 (void) segvn_concat(
8534 8534 prev, seg, 1);
8535 8535 return (err);
8536 8536 }
8537 8537 }
8538 8538 }
8539 8539 }
8540 8540 break;
8541 8541 case MADV_SEQUENTIAL:
8542 8542 ASSERT(seg->s_szc == 0);
8543 8543 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
8544 8544 hat_unload(seg->s_as->a_hat, addr, len, HAT_UNLOAD);
8545 8545 /* FALLTHROUGH */
8546 8546 case MADV_NORMAL:
8547 8547 case MADV_RANDOM:
8548 8548 bvpp = &svd->vpage[page];
8549 8549 evpp = &svd->vpage[page + (len >> PAGESHIFT)];
8550 8550 for (; bvpp < evpp; bvpp++)
8551 8551 VPP_SETADVICE(bvpp, behav);
8552 8552 svd->advice = MADV_NORMAL;
8553 8553 break;
8554 8554 case MADV_WILLNEED: /* handled in memcntl */
8555 8555 case MADV_DONTNEED: /* handled in memcntl */
8556 8556 case MADV_FREE: /* handled above */
8557 8557 case MADV_PURGE: /* handled above */
8558 8558 break;
8559 8559 default:
8560 8560 err = EINVAL;
8561 8561 }
8562 8562 }
8563 8563 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8564 8564 return (err);
8565 8565 }
8566 8566
8567 8567 /*
8568 8568 * There is one kind of inheritance that can be specified for pages:
8569 8569 *
8570 8570 * SEGP_INH_ZERO - Pages should be zeroed in the child
8571 8571 */
8572 8572 static int
8573 8573 segvn_inherit(struct seg *seg, caddr_t addr, size_t len, uint_t behav)
8574 8574 {
8575 8575 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8576 8576 struct vpage *bvpp, *evpp;
8577 8577 size_t page;
8578 8578 int ret = 0;
8579 8579
8580 8580 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8581 8581
8582 8582 /* Can't support something we don't know about */
8583 8583 if (behav != SEGP_INH_ZERO)
8584 8584 return (ENOTSUP);
8585 8585
8586 8586 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
8587 8587
8588 8588 /*
8589 8589 * This must be a straightforward anonymous segment that is mapped
8590 8590 * privately and is not backed by a vnode.
8591 8591 */
8592 8592 if (svd->tr_state != SEGVN_TR_OFF ||
8593 8593 svd->type != MAP_PRIVATE ||
8594 8594 svd->vp != NULL) {
8595 8595 ret = EINVAL;
8596 8596 goto out;
8597 8597 }
8598 8598
8599 8599 /*
8600 8600 * If the entire segment has been marked as inherit zero, then no reason
8601 8601 * to do anything else.
8602 8602 */
8603 8603 if (svd->svn_inz == SEGVN_INZ_ALL) {
8604 8604 ret = 0;
8605 8605 goto out;
8606 8606 }
8607 8607
8608 8608 /*
8609 8609 * If this applies to the entire segment, simply mark it and we're done.
8610 8610 */
8611 8611 if ((addr == seg->s_base) && (len == seg->s_size)) {
8612 8612 svd->svn_inz = SEGVN_INZ_ALL;
8613 8613 ret = 0;
8614 8614 goto out;
8615 8615 }
8616 8616
8617 8617 /*
8618 8618 * We've been asked to mark a subset of this segment as inherit zero,
8619 8619 * therefore we need to mainpulate its vpages.
8620 8620 */
8621 8621 if (svd->vpage == NULL) {
8622 8622 segvn_vpage(seg);
8623 8623 if (svd->vpage == NULL) {
8624 8624 ret = ENOMEM;
8625 8625 goto out;
8626 8626 }
8627 8627 }
8628 8628
8629 8629 svd->svn_inz = SEGVN_INZ_VPP;
8630 8630 page = seg_page(seg, addr);
8631 8631 bvpp = &svd->vpage[page];
8632 8632 evpp = &svd->vpage[page + (len >> PAGESHIFT)];
8633 8633 for (; bvpp < evpp; bvpp++)
8634 8634 VPP_SETINHZERO(bvpp);
8635 8635 ret = 0;
8636 8636
8637 8637 out:
8638 8638 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8639 8639 return (ret);
8640 8640 }
8641 8641
8642 8642 /*
8643 8643 * Create a vpage structure for this seg.
8644 8644 */
8645 8645 static void
8646 8646 segvn_vpage(struct seg *seg)
8647 8647 {
8648 8648 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8649 8649 struct vpage *vp, *evp;
8650 8650 static pgcnt_t page_limit = 0;
8651 8651
8652 8652 ASSERT(SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
8653 8653
8654 8654 /*
8655 8655 * If no vpage structure exists, allocate one. Copy the protections
8656 8656 * and the advice from the segment itself to the individual pages.
8657 8657 */
8658 8658 if (svd->vpage == NULL) {
8659 8659 /*
8660 8660 * Start by calculating the number of pages we must allocate to
8661 8661 * track the per-page vpage structs needs for this entire
8662 8662 * segment. If we know now that it will require more than our
8663 8663 * heuristic for the maximum amount of kmem we can consume then
8664 8664 * fail. We do this here, instead of trying to detect this deep
8665 8665 * in page_resv and propagating the error up, since the entire
8666 8666 * memory allocation stack is not amenable to passing this
8667 8667 * back. Instead, it wants to keep trying.
8668 8668 *
8669 8669 * As a heuristic we set a page limit of 5/8s of total_pages
8670 8670 * for this allocation. We use shifts so that no floating
8671 8671 * point conversion takes place and only need to do the
8672 8672 * calculation once.
8673 8673 */
8674 8674 ulong_t mem_needed = seg_pages(seg) * sizeof (struct vpage);
8675 8675 pgcnt_t npages = mem_needed >> PAGESHIFT;
8676 8676
8677 8677 if (page_limit == 0)
8678 8678 page_limit = (total_pages >> 1) + (total_pages >> 3);
8679 8679
8680 8680 if (npages > page_limit)
8681 8681 return;
8682 8682
8683 8683 svd->pageadvice = 1;
8684 8684 svd->vpage = kmem_zalloc(mem_needed, KM_SLEEP);
8685 8685 evp = &svd->vpage[seg_page(seg, seg->s_base + seg->s_size)];
8686 8686 for (vp = svd->vpage; vp < evp; vp++) {
8687 8687 VPP_SETPROT(vp, svd->prot);
8688 8688 VPP_SETADVICE(vp, svd->advice);
8689 8689 }
8690 8690 }
8691 8691 }
8692 8692
8693 8693 /*
8694 8694 * Dump the pages belonging to this segvn segment.
8695 8695 */
8696 8696 static void
8697 8697 segvn_dump(struct seg *seg)
8698 8698 {
8699 8699 struct segvn_data *svd;
8700 8700 page_t *pp;
8701 8701 struct anon_map *amp;
8702 8702 ulong_t anon_index;
8703 8703 struct vnode *vp;
8704 8704 u_offset_t off, offset;
8705 8705 pfn_t pfn;
8706 8706 pgcnt_t page, npages;
8707 8707 caddr_t addr;
8708 8708
8709 8709 npages = seg_pages(seg);
8710 8710 svd = (struct segvn_data *)seg->s_data;
8711 8711 vp = svd->vp;
8712 8712 off = offset = svd->offset;
8713 8713 addr = seg->s_base;
8714 8714
8715 8715 if ((amp = svd->amp) != NULL) {
8716 8716 anon_index = svd->anon_index;
8717 8717 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
8718 8718 }
8719 8719
8720 8720 for (page = 0; page < npages; page++, offset += PAGESIZE) {
8721 8721 struct anon *ap;
8722 8722 int we_own_it = 0;
8723 8723
8724 8724 if (amp && (ap = anon_get_ptr(svd->amp->ahp, anon_index++))) {
8725 8725 swap_xlate_nopanic(ap, &vp, &off);
8726 8726 } else {
8727 8727 vp = svd->vp;
8728 8728 off = offset;
8729 8729 }
8730 8730
8731 8731 /*
8732 8732 * If pp == NULL, the page either does not exist
8733 8733 * or is exclusively locked. So determine if it
8734 8734 * exists before searching for it.
8735 8735 */
8736 8736
8737 8737 if ((pp = page_lookup_nowait(vp, off, SE_SHARED)))
8738 8738 we_own_it = 1;
8739 8739 else
8740 8740 pp = page_exists(vp, off);
8741 8741
8742 8742 if (pp) {
8743 8743 pfn = page_pptonum(pp);
8744 8744 dump_addpage(seg->s_as, addr, pfn);
8745 8745 if (we_own_it)
8746 8746 page_unlock(pp);
8747 8747 }
8748 8748 addr += PAGESIZE;
8749 8749 dump_timeleft = dump_timeout;
8750 8750 }
8751 8751
8752 8752 if (amp != NULL)
8753 8753 ANON_LOCK_EXIT(&->a_rwlock);
8754 8754 }
8755 8755
8756 8756 #ifdef DEBUG
8757 8757 static uint32_t segvn_pglock_mtbf = 0;
8758 8758 #endif
8759 8759
8760 8760 #define PCACHE_SHWLIST ((page_t *)-2)
8761 8761 #define NOPCACHE_SHWLIST ((page_t *)-1)
8762 8762
8763 8763 /*
8764 8764 * Lock/Unlock anon pages over a given range. Return shadow list. This routine
8765 8765 * uses global segment pcache to cache shadow lists (i.e. pp arrays) of pages
8766 8766 * to avoid the overhead of per page locking, unlocking for subsequent IOs to
8767 8767 * the same parts of the segment. Currently shadow list creation is only
8768 8768 * supported for pure anon segments. MAP_PRIVATE segment pcache entries are
8769 8769 * tagged with segment pointer, starting virtual address and length. This
8770 8770 * approach for MAP_SHARED segments may add many pcache entries for the same
8771 8771 * set of pages and lead to long hash chains that decrease pcache lookup
8772 8772 * performance. To avoid this issue for shared segments shared anon map and
8773 8773 * starting anon index are used for pcache entry tagging. This allows all
8774 8774 * segments to share pcache entries for the same anon range and reduces pcache
8775 8775 * chain's length as well as memory overhead from duplicate shadow lists and
8776 8776 * pcache entries.
8777 8777 *
8778 8778 * softlockcnt field in segvn_data structure counts the number of F_SOFTLOCK'd
8779 8779 * pages via segvn_fault() and pagelock'd pages via this routine. But pagelock
8780 8780 * part of softlockcnt accounting is done differently for private and shared
8781 8781 * segments. In private segment case softlock is only incremented when a new
8782 8782 * shadow list is created but not when an existing one is found via
8783 8783 * seg_plookup(). pcache entries have reference count incremented/decremented
8784 8784 * by each seg_plookup()/seg_pinactive() operation. Only entries that have 0
8785 8785 * reference count can be purged (and purging is needed before segment can be
8786 8786 * freed). When a private segment pcache entry is purged segvn_reclaim() will
8787 8787 * decrement softlockcnt. Since in private segment case each of its pcache
8788 8788 * entries only belongs to this segment we can expect that when
8789 8789 * segvn_pagelock(L_PAGEUNLOCK) was called for all outstanding IOs in this
8790 8790 * segment purge will succeed and softlockcnt will drop to 0. In shared
8791 8791 * segment case reference count in pcache entry counts active locks from many
8792 8792 * different segments so we can't expect segment purging to succeed even when
8793 8793 * segvn_pagelock(L_PAGEUNLOCK) was called for all outstanding IOs in this
8794 8794 * segment. To be able to determine when there're no pending pagelocks in
8795 8795 * shared segment case we don't rely on purging to make softlockcnt drop to 0
8796 8796 * but instead softlockcnt is incremented and decremented for every
8797 8797 * segvn_pagelock(L_PAGELOCK/L_PAGEUNLOCK) call regardless if a new shadow
8798 8798 * list was created or an existing one was found. When softlockcnt drops to 0
8799 8799 * this segment no longer has any claims for pcached shadow lists and the
8800 8800 * segment can be freed even if there're still active pcache entries
8801 8801 * shared by this segment anon map. Shared segment pcache entries belong to
8802 8802 * anon map and are typically removed when anon map is freed after all
8803 8803 * processes destroy the segments that use this anon map.
8804 8804 */
8805 8805 static int
8806 8806 segvn_pagelock(struct seg *seg, caddr_t addr, size_t len, struct page ***ppp,
8807 8807 enum lock_type type, enum seg_rw rw)
8808 8808 {
8809 8809 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8810 8810 size_t np;
8811 8811 pgcnt_t adjustpages;
8812 8812 pgcnt_t npages;
8813 8813 ulong_t anon_index;
8814 8814 uint_t protchk = (rw == S_READ) ? PROT_READ : PROT_WRITE;
8815 8815 uint_t error;
8816 8816 struct anon_map *amp;
8817 8817 pgcnt_t anpgcnt;
8818 8818 struct page **pplist, **pl, *pp;
8819 8819 caddr_t a;
8820 8820 size_t page;
8821 8821 caddr_t lpgaddr, lpgeaddr;
8822 8822 anon_sync_obj_t cookie;
8823 8823 int anlock;
8824 8824 struct anon_map *pamp;
8825 8825 caddr_t paddr;
8826 8826 seg_preclaim_cbfunc_t preclaim_callback;
8827 8827 size_t pgsz;
8828 8828 int use_pcache;
8829 8829 size_t wlen;
8830 8830 uint_t pflags = 0;
8831 8831 int sftlck_sbase = 0;
8832 8832 int sftlck_send = 0;
8833 8833
8834 8834 #ifdef DEBUG
8835 8835 if (type == L_PAGELOCK && segvn_pglock_mtbf) {
8836 8836 hrtime_t ts = gethrtime();
8837 8837 if ((ts % segvn_pglock_mtbf) == 0) {
8838 8838 return (ENOTSUP);
8839 8839 }
8840 8840 if ((ts % segvn_pglock_mtbf) == 1) {
8841 8841 return (EFAULT);
8842 8842 }
8843 8843 }
8844 8844 #endif
8845 8845
8846 8846 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_START,
8847 8847 "segvn_pagelock: start seg %p addr %p", seg, addr);
8848 8848
8849 8849 ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8850 8850 ASSERT(type == L_PAGELOCK || type == L_PAGEUNLOCK);
8851 8851
8852 8852 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
8853 8853
8854 8854 /*
8855 8855 * for now we only support pagelock to anon memory. We would have to
8856 8856 * check protections for vnode objects and call into the vnode driver.
8857 8857 * That's too much for a fast path. Let the fault entry point handle
8858 8858 * it.
8859 8859 */
8860 8860 if (svd->vp != NULL) {
8861 8861 if (type == L_PAGELOCK) {
8862 8862 error = ENOTSUP;
8863 8863 goto out;
8864 8864 }
8865 8865 panic("segvn_pagelock(L_PAGEUNLOCK): vp != NULL");
8866 8866 }
8867 8867 if ((amp = svd->amp) == NULL) {
8868 8868 if (type == L_PAGELOCK) {
8869 8869 error = EFAULT;
8870 8870 goto out;
8871 8871 }
8872 8872 panic("segvn_pagelock(L_PAGEUNLOCK): amp == NULL");
8873 8873 }
8874 8874 if (rw != S_READ && rw != S_WRITE) {
8875 8875 if (type == L_PAGELOCK) {
8876 8876 error = ENOTSUP;
8877 8877 goto out;
8878 8878 }
8879 8879 panic("segvn_pagelock(L_PAGEUNLOCK): bad rw");
8880 8880 }
8881 8881
8882 8882 if (seg->s_szc != 0) {
8883 8883 /*
8884 8884 * We are adjusting the pagelock region to the large page size
8885 8885 * boundary because the unlocked part of a large page cannot
8886 8886 * be freed anyway unless all constituent pages of a large
8887 8887 * page are locked. Bigger regions reduce pcache chain length
8888 8888 * and improve lookup performance. The tradeoff is that the
8889 8889 * very first segvn_pagelock() call for a given page is more
8890 8890 * expensive if only 1 page_t is needed for IO. This is only
8891 8891 * an issue if pcache entry doesn't get reused by several
8892 8892 * subsequent calls. We optimize here for the case when pcache
8893 8893 * is heavily used by repeated IOs to the same address range.
8894 8894 *
8895 8895 * Note segment's page size cannot change while we are holding
8896 8896 * as lock. And then it cannot change while softlockcnt is
8897 8897 * not 0. This will allow us to correctly recalculate large
8898 8898 * page size region for the matching pageunlock/reclaim call
8899 8899 * since as_pageunlock() caller must always match
8900 8900 * as_pagelock() call's addr and len.
8901 8901 *
8902 8902 * For pageunlock *ppp points to the pointer of page_t that
8903 8903 * corresponds to the real unadjusted start address. Similar
8904 8904 * for pagelock *ppp must point to the pointer of page_t that
8905 8905 * corresponds to the real unadjusted start address.
8906 8906 */
8907 8907 pgsz = page_get_pagesize(seg->s_szc);
8908 8908 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
8909 8909 adjustpages = btop((uintptr_t)(addr - lpgaddr));
8910 8910 } else if (len < segvn_pglock_comb_thrshld) {
8911 8911 lpgaddr = addr;
8912 8912 lpgeaddr = addr + len;
8913 8913 adjustpages = 0;
8914 8914 pgsz = PAGESIZE;
8915 8915 } else {
8916 8916 /*
8917 8917 * Align the address range of large enough requests to allow
8918 8918 * combining of different shadow lists into 1 to reduce memory
8919 8919 * overhead from potentially overlapping large shadow lists
8920 8920 * (worst case is we have a 1MB IO into buffers with start
8921 8921 * addresses separated by 4K). Alignment is only possible if
8922 8922 * padded chunks have sufficient access permissions. Note
8923 8923 * permissions won't change between L_PAGELOCK and
8924 8924 * L_PAGEUNLOCK calls since non 0 softlockcnt will force
8925 8925 * segvn_setprot() to wait until softlockcnt drops to 0. This
8926 8926 * allows us to determine in L_PAGEUNLOCK the same range we
8927 8927 * computed in L_PAGELOCK.
8928 8928 *
8929 8929 * If alignment is limited by segment ends set
8930 8930 * sftlck_sbase/sftlck_send flags. In L_PAGELOCK case when
8931 8931 * these flags are set bump softlockcnt_sbase/softlockcnt_send
8932 8932 * per segment counters. In L_PAGEUNLOCK case decrease
8933 8933 * softlockcnt_sbase/softlockcnt_send counters if
8934 8934 * sftlck_sbase/sftlck_send flags are set. When
8935 8935 * softlockcnt_sbase/softlockcnt_send are non 0
8936 8936 * segvn_concat()/segvn_extend_prev()/segvn_extend_next()
8937 8937 * won't merge the segments. This restriction combined with
8938 8938 * restriction on segment unmapping and splitting for segments
8939 8939 * that have non 0 softlockcnt allows L_PAGEUNLOCK to
8940 8940 * correctly determine the same range that was previously
8941 8941 * locked by matching L_PAGELOCK.
8942 8942 */
8943 8943 pflags = SEGP_PSHIFT | (segvn_pglock_comb_bshift << 16);
8944 8944 pgsz = PAGESIZE;
8945 8945 if (svd->type == MAP_PRIVATE) {
8946 8946 lpgaddr = (caddr_t)P2ALIGN((uintptr_t)addr,
8947 8947 segvn_pglock_comb_balign);
8948 8948 if (lpgaddr < seg->s_base) {
8949 8949 lpgaddr = seg->s_base;
8950 8950 sftlck_sbase = 1;
8951 8951 }
8952 8952 } else {
8953 8953 ulong_t aix = svd->anon_index + seg_page(seg, addr);
8954 8954 ulong_t aaix = P2ALIGN(aix, segvn_pglock_comb_palign);
8955 8955 if (aaix < svd->anon_index) {
8956 8956 lpgaddr = seg->s_base;
8957 8957 sftlck_sbase = 1;
8958 8958 } else {
8959 8959 lpgaddr = addr - ptob(aix - aaix);
8960 8960 ASSERT(lpgaddr >= seg->s_base);
8961 8961 }
8962 8962 }
8963 8963 if (svd->pageprot && lpgaddr != addr) {
8964 8964 struct vpage *vp = &svd->vpage[seg_page(seg, lpgaddr)];
8965 8965 struct vpage *evp = &svd->vpage[seg_page(seg, addr)];
8966 8966 while (vp < evp) {
8967 8967 if ((VPP_PROT(vp) & protchk) == 0) {
8968 8968 break;
8969 8969 }
8970 8970 vp++;
8971 8971 }
8972 8972 if (vp < evp) {
8973 8973 lpgaddr = addr;
8974 8974 pflags = 0;
8975 8975 }
8976 8976 }
8977 8977 lpgeaddr = addr + len;
8978 8978 if (pflags) {
8979 8979 if (svd->type == MAP_PRIVATE) {
8980 8980 lpgeaddr = (caddr_t)P2ROUNDUP(
8981 8981 (uintptr_t)lpgeaddr,
8982 8982 segvn_pglock_comb_balign);
8983 8983 } else {
8984 8984 ulong_t aix = svd->anon_index +
8985 8985 seg_page(seg, lpgeaddr);
8986 8986 ulong_t aaix = P2ROUNDUP(aix,
8987 8987 segvn_pglock_comb_palign);
8988 8988 if (aaix < aix) {
8989 8989 lpgeaddr = 0;
8990 8990 } else {
8991 8991 lpgeaddr += ptob(aaix - aix);
8992 8992 }
8993 8993 }
8994 8994 if (lpgeaddr == 0 ||
8995 8995 lpgeaddr > seg->s_base + seg->s_size) {
8996 8996 lpgeaddr = seg->s_base + seg->s_size;
8997 8997 sftlck_send = 1;
8998 8998 }
8999 8999 }
9000 9000 if (svd->pageprot && lpgeaddr != addr + len) {
9001 9001 struct vpage *vp;
9002 9002 struct vpage *evp;
9003 9003
9004 9004 vp = &svd->vpage[seg_page(seg, addr + len)];
9005 9005 evp = &svd->vpage[seg_page(seg, lpgeaddr)];
9006 9006
9007 9007 while (vp < evp) {
9008 9008 if ((VPP_PROT(vp) & protchk) == 0) {
9009 9009 break;
9010 9010 }
9011 9011 vp++;
9012 9012 }
9013 9013 if (vp < evp) {
9014 9014 lpgeaddr = addr + len;
9015 9015 }
9016 9016 }
9017 9017 adjustpages = btop((uintptr_t)(addr - lpgaddr));
9018 9018 }
9019 9019
9020 9020 /*
9021 9021 * For MAP_SHARED segments we create pcache entries tagged by amp and
9022 9022 * anon index so that we can share pcache entries with other segments
9023 9023 * that map this amp. For private segments pcache entries are tagged
9024 9024 * with segment and virtual address.
9025 9025 */
9026 9026 if (svd->type == MAP_SHARED) {
9027 9027 pamp = amp;
9028 9028 paddr = (caddr_t)((lpgaddr - seg->s_base) +
9029 9029 ptob(svd->anon_index));
9030 9030 preclaim_callback = shamp_reclaim;
9031 9031 } else {
9032 9032 pamp = NULL;
9033 9033 paddr = lpgaddr;
9034 9034 preclaim_callback = segvn_reclaim;
9035 9035 }
9036 9036
9037 9037 if (type == L_PAGEUNLOCK) {
9038 9038 VM_STAT_ADD(segvnvmstats.pagelock[0]);
9039 9039
9040 9040 /*
9041 9041 * update hat ref bits for /proc. We need to make sure
9042 9042 * that threads tracing the ref and mod bits of the
9043 9043 * address space get the right data.
9044 9044 * Note: page ref and mod bits are updated at reclaim time
9045 9045 */
9046 9046 if (seg->s_as->a_vbits) {
9047 9047 for (a = addr; a < addr + len; a += PAGESIZE) {
9048 9048 if (rw == S_WRITE) {
9049 9049 hat_setstat(seg->s_as, a,
9050 9050 PAGESIZE, P_REF | P_MOD);
9051 9051 } else {
9052 9052 hat_setstat(seg->s_as, a,
9053 9053 PAGESIZE, P_REF);
9054 9054 }
9055 9055 }
9056 9056 }
9057 9057
9058 9058 /*
9059 9059 * Check the shadow list entry after the last page used in
9060 9060 * this IO request. If it's NOPCACHE_SHWLIST the shadow list
9061 9061 * was not inserted into pcache and is not large page
9062 9062 * adjusted. In this case call reclaim callback directly and
9063 9063 * don't adjust the shadow list start and size for large
9064 9064 * pages.
9065 9065 */
9066 9066 npages = btop(len);
9067 9067 if ((*ppp)[npages] == NOPCACHE_SHWLIST) {
9068 9068 void *ptag;
9069 9069 if (pamp != NULL) {
9070 9070 ASSERT(svd->type == MAP_SHARED);
9071 9071 ptag = (void *)pamp;
9072 9072 paddr = (caddr_t)((addr - seg->s_base) +
9073 9073 ptob(svd->anon_index));
9074 9074 } else {
9075 9075 ptag = (void *)seg;
9076 9076 paddr = addr;
9077 9077 }
9078 9078 (*preclaim_callback)(ptag, paddr, len, *ppp, rw, 0);
9079 9079 } else {
9080 9080 ASSERT((*ppp)[npages] == PCACHE_SHWLIST ||
9081 9081 IS_SWAPFSVP((*ppp)[npages]->p_vnode));
9082 9082 len = lpgeaddr - lpgaddr;
9083 9083 npages = btop(len);
9084 9084 seg_pinactive(seg, pamp, paddr, len,
9085 9085 *ppp - adjustpages, rw, pflags, preclaim_callback);
9086 9086 }
9087 9087
9088 9088 if (pamp != NULL) {
9089 9089 ASSERT(svd->type == MAP_SHARED);
9090 9090 ASSERT(svd->softlockcnt >= npages);
9091 9091 atomic_add_long((ulong_t *)&svd->softlockcnt, -npages);
9092 9092 }
9093 9093
9094 9094 if (sftlck_sbase) {
9095 9095 ASSERT(svd->softlockcnt_sbase > 0);
9096 9096 atomic_dec_ulong((ulong_t *)&svd->softlockcnt_sbase);
9097 9097 }
9098 9098 if (sftlck_send) {
9099 9099 ASSERT(svd->softlockcnt_send > 0);
9100 9100 atomic_dec_ulong((ulong_t *)&svd->softlockcnt_send);
9101 9101 }
9102 9102
9103 9103 /*
9104 9104 * If someone is blocked while unmapping, we purge
9105 9105 * segment page cache and thus reclaim pplist synchronously
9106 9106 * without waiting for seg_pasync_thread. This speeds up
9107 9107 * unmapping in cases where munmap(2) is called, while
9108 9108 * raw async i/o is still in progress or where a thread
9109 9109 * exits on data fault in a multithreaded application.
9110 9110 */
9111 9111 if (AS_ISUNMAPWAIT(seg->s_as)) {
9112 9112 if (svd->softlockcnt == 0) {
9113 9113 mutex_enter(&seg->s_as->a_contents);
9114 9114 if (AS_ISUNMAPWAIT(seg->s_as)) {
9115 9115 AS_CLRUNMAPWAIT(seg->s_as);
9116 9116 cv_broadcast(&seg->s_as->a_cv);
9117 9117 }
9118 9118 mutex_exit(&seg->s_as->a_contents);
9119 9119 } else if (pamp == NULL) {
9120 9120 /*
9121 9121 * softlockcnt is not 0 and this is a
9122 9122 * MAP_PRIVATE segment. Try to purge its
9123 9123 * pcache entries to reduce softlockcnt.
9124 9124 * If it drops to 0 segvn_reclaim()
9125 9125 * will wake up a thread waiting on
9126 9126 * unmapwait flag.
9127 9127 *
9128 9128 * We don't purge MAP_SHARED segments with non
9129 9129 * 0 softlockcnt since IO is still in progress
9130 9130 * for such segments.
9131 9131 */
9132 9132 ASSERT(svd->type == MAP_PRIVATE);
9133 9133 segvn_purge(seg);
9134 9134 }
9135 9135 }
9136 9136 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9137 9137 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_UNLOCK_END,
9138 9138 "segvn_pagelock: unlock seg %p addr %p", seg, addr);
9139 9139 return (0);
9140 9140 }
9141 9141
9142 9142 /* The L_PAGELOCK case ... */
9143 9143
9144 9144 VM_STAT_ADD(segvnvmstats.pagelock[1]);
9145 9145
9146 9146 /*
9147 9147 * For MAP_SHARED segments we have to check protections before
9148 9148 * seg_plookup() since pcache entries may be shared by many segments
9149 9149 * with potentially different page protections.
9150 9150 */
9151 9151 if (pamp != NULL) {
9152 9152 ASSERT(svd->type == MAP_SHARED);
9153 9153 if (svd->pageprot == 0) {
9154 9154 if ((svd->prot & protchk) == 0) {
9155 9155 error = EACCES;
9156 9156 goto out;
9157 9157 }
9158 9158 } else {
9159 9159 /*
9160 9160 * check page protections
9161 9161 */
9162 9162 caddr_t ea;
9163 9163
9164 9164 if (seg->s_szc) {
9165 9165 a = lpgaddr;
9166 9166 ea = lpgeaddr;
9167 9167 } else {
9168 9168 a = addr;
9169 9169 ea = addr + len;
9170 9170 }
9171 9171 for (; a < ea; a += pgsz) {
9172 9172 struct vpage *vp;
9173 9173
9174 9174 ASSERT(seg->s_szc == 0 ||
9175 9175 sameprot(seg, a, pgsz));
9176 9176 vp = &svd->vpage[seg_page(seg, a)];
9177 9177 if ((VPP_PROT(vp) & protchk) == 0) {
9178 9178 error = EACCES;
9179 9179 goto out;
9180 9180 }
9181 9181 }
9182 9182 }
9183 9183 }
9184 9184
9185 9185 /*
9186 9186 * try to find pages in segment page cache
9187 9187 */
9188 9188 pplist = seg_plookup(seg, pamp, paddr, lpgeaddr - lpgaddr, rw, pflags);
9189 9189 if (pplist != NULL) {
9190 9190 if (pamp != NULL) {
9191 9191 npages = btop((uintptr_t)(lpgeaddr - lpgaddr));
9192 9192 ASSERT(svd->type == MAP_SHARED);
9193 9193 atomic_add_long((ulong_t *)&svd->softlockcnt,
9194 9194 npages);
9195 9195 }
9196 9196 if (sftlck_sbase) {
9197 9197 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_sbase);
9198 9198 }
9199 9199 if (sftlck_send) {
9200 9200 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_send);
9201 9201 }
9202 9202 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9203 9203 *ppp = pplist + adjustpages;
9204 9204 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_HIT_END,
9205 9205 "segvn_pagelock: cache hit seg %p addr %p", seg, addr);
9206 9206 return (0);
9207 9207 }
9208 9208
9209 9209 /*
9210 9210 * For MAP_SHARED segments we already verified above that segment
9211 9211 * protections allow this pagelock operation.
9212 9212 */
9213 9213 if (pamp == NULL) {
9214 9214 ASSERT(svd->type == MAP_PRIVATE);
9215 9215 if (svd->pageprot == 0) {
9216 9216 if ((svd->prot & protchk) == 0) {
9217 9217 error = EACCES;
9218 9218 goto out;
9219 9219 }
9220 9220 if (svd->prot & PROT_WRITE) {
9221 9221 wlen = lpgeaddr - lpgaddr;
9222 9222 } else {
9223 9223 wlen = 0;
9224 9224 ASSERT(rw == S_READ);
9225 9225 }
9226 9226 } else {
9227 9227 int wcont = 1;
9228 9228 /*
9229 9229 * check page protections
9230 9230 */
9231 9231 for (a = lpgaddr, wlen = 0; a < lpgeaddr; a += pgsz) {
9232 9232 struct vpage *vp;
9233 9233
9234 9234 ASSERT(seg->s_szc == 0 ||
9235 9235 sameprot(seg, a, pgsz));
9236 9236 vp = &svd->vpage[seg_page(seg, a)];
9237 9237 if ((VPP_PROT(vp) & protchk) == 0) {
9238 9238 error = EACCES;
9239 9239 goto out;
9240 9240 }
9241 9241 if (wcont && (VPP_PROT(vp) & PROT_WRITE)) {
9242 9242 wlen += pgsz;
9243 9243 } else {
9244 9244 wcont = 0;
9245 9245 ASSERT(rw == S_READ);
9246 9246 }
9247 9247 }
9248 9248 }
9249 9249 ASSERT(rw == S_READ || wlen == lpgeaddr - lpgaddr);
9250 9250 ASSERT(rw == S_WRITE || wlen <= lpgeaddr - lpgaddr);
9251 9251 }
9252 9252
9253 9253 /*
9254 9254 * Only build large page adjusted shadow list if we expect to insert
9255 9255 * it into pcache. For large enough pages it's a big overhead to
9256 9256 * create a shadow list of the entire large page. But this overhead
9257 9257 * should be amortized over repeated pcache hits on subsequent reuse
9258 9258 * of this shadow list (IO into any range within this shadow list will
9259 9259 * find it in pcache since we large page align the request for pcache
9260 9260 * lookups). pcache performance is improved with bigger shadow lists
9261 9261 * as it reduces the time to pcache the entire big segment and reduces
9262 9262 * pcache chain length.
9263 9263 */
9264 9264 if (seg_pinsert_check(seg, pamp, paddr,
9265 9265 lpgeaddr - lpgaddr, pflags) == SEGP_SUCCESS) {
9266 9266 addr = lpgaddr;
9267 9267 len = lpgeaddr - lpgaddr;
9268 9268 use_pcache = 1;
9269 9269 } else {
9270 9270 use_pcache = 0;
9271 9271 /*
9272 9272 * Since this entry will not be inserted into the pcache, we
9273 9273 * will not do any adjustments to the starting address or
9274 9274 * size of the memory to be locked.
9275 9275 */
9276 9276 adjustpages = 0;
9277 9277 }
9278 9278 npages = btop(len);
9279 9279
9280 9280 pplist = kmem_alloc(sizeof (page_t *) * (npages + 1), KM_SLEEP);
9281 9281 pl = pplist;
9282 9282 *ppp = pplist + adjustpages;
9283 9283 /*
9284 9284 * If use_pcache is 0 this shadow list is not large page adjusted.
9285 9285 * Record this info in the last entry of shadow array so that
9286 9286 * L_PAGEUNLOCK can determine if it should large page adjust the
9287 9287 * address range to find the real range that was locked.
9288 9288 */
9289 9289 pl[npages] = use_pcache ? PCACHE_SHWLIST : NOPCACHE_SHWLIST;
9290 9290
9291 9291 page = seg_page(seg, addr);
9292 9292 anon_index = svd->anon_index + page;
9293 9293
9294 9294 anlock = 0;
9295 9295 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
9296 9296 ASSERT(amp->a_szc >= seg->s_szc);
9297 9297 anpgcnt = page_get_pagecnt(amp->a_szc);
9298 9298 for (a = addr; a < addr + len; a += PAGESIZE, anon_index++) {
9299 9299 struct anon *ap;
9300 9300 struct vnode *vp;
9301 9301 u_offset_t off;
9302 9302
9303 9303 /*
9304 9304 * Lock and unlock anon array only once per large page.
9305 9305 * anon_array_enter() locks the root anon slot according to
9306 9306 * a_szc which can't change while anon map is locked. We lock
9307 9307 * anon the first time through this loop and each time we
9308 9308 * reach anon index that corresponds to a root of a large
9309 9309 * page.
9310 9310 */
9311 9311 if (a == addr || P2PHASE(anon_index, anpgcnt) == 0) {
9312 9312 ASSERT(anlock == 0);
9313 9313 anon_array_enter(amp, anon_index, &cookie);
9314 9314 anlock = 1;
9315 9315 }
9316 9316 ap = anon_get_ptr(amp->ahp, anon_index);
9317 9317
9318 9318 /*
9319 9319 * We must never use seg_pcache for COW pages
9320 9320 * because we might end up with original page still
9321 9321 * lying in seg_pcache even after private page is
9322 9322 * created. This leads to data corruption as
9323 9323 * aio_write refers to the page still in cache
9324 9324 * while all other accesses refer to the private
9325 9325 * page.
9326 9326 */
9327 9327 if (ap == NULL || ap->an_refcnt != 1) {
9328 9328 struct vpage *vpage;
9329 9329
9330 9330 if (seg->s_szc) {
9331 9331 error = EFAULT;
9332 9332 break;
9333 9333 }
9334 9334 if (svd->vpage != NULL) {
9335 9335 vpage = &svd->vpage[seg_page(seg, a)];
9336 9336 } else {
9337 9337 vpage = NULL;
9338 9338 }
9339 9339 ASSERT(anlock);
9340 9340 anon_array_exit(&cookie);
9341 9341 anlock = 0;
9342 9342 pp = NULL;
9343 9343 error = segvn_faultpage(seg->s_as->a_hat, seg, a, 0,
9344 9344 vpage, &pp, 0, F_INVAL, rw, 1);
9345 9345 if (error) {
9346 9346 error = fc_decode(error);
9347 9347 break;
9348 9348 }
9349 9349 anon_array_enter(amp, anon_index, &cookie);
9350 9350 anlock = 1;
9351 9351 ap = anon_get_ptr(amp->ahp, anon_index);
9352 9352 if (ap == NULL || ap->an_refcnt != 1) {
9353 9353 error = EFAULT;
9354 9354 break;
9355 9355 }
9356 9356 }
9357 9357 swap_xlate(ap, &vp, &off);
9358 9358 pp = page_lookup_nowait(vp, off, SE_SHARED);
9359 9359 if (pp == NULL) {
9360 9360 error = EFAULT;
9361 9361 break;
9362 9362 }
9363 9363 if (ap->an_pvp != NULL) {
9364 9364 anon_swap_free(ap, pp);
9365 9365 }
9366 9366 /*
9367 9367 * Unlock anon if this is the last slot in a large page.
9368 9368 */
9369 9369 if (P2PHASE(anon_index, anpgcnt) == anpgcnt - 1) {
9370 9370 ASSERT(anlock);
9371 9371 anon_array_exit(&cookie);
9372 9372 anlock = 0;
9373 9373 }
9374 9374 *pplist++ = pp;
9375 9375 }
9376 9376 if (anlock) { /* Ensure the lock is dropped */
9377 9377 anon_array_exit(&cookie);
9378 9378 }
9379 9379 ANON_LOCK_EXIT(&->a_rwlock);
9380 9380
9381 9381 if (a >= addr + len) {
9382 9382 atomic_add_long((ulong_t *)&svd->softlockcnt, npages);
9383 9383 if (pamp != NULL) {
9384 9384 ASSERT(svd->type == MAP_SHARED);
9385 9385 atomic_add_long((ulong_t *)&pamp->a_softlockcnt,
9386 9386 npages);
9387 9387 wlen = len;
9388 9388 }
9389 9389 if (sftlck_sbase) {
9390 9390 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_sbase);
9391 9391 }
9392 9392 if (sftlck_send) {
9393 9393 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_send);
9394 9394 }
9395 9395 if (use_pcache) {
9396 9396 (void) seg_pinsert(seg, pamp, paddr, len, wlen, pl,
9397 9397 rw, pflags, preclaim_callback);
9398 9398 }
9399 9399 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9400 9400 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_FILL_END,
9401 9401 "segvn_pagelock: cache fill seg %p addr %p", seg, addr);
9402 9402 return (0);
9403 9403 }
9404 9404
9405 9405 pplist = pl;
9406 9406 np = ((uintptr_t)(a - addr)) >> PAGESHIFT;
9407 9407 while (np > (uint_t)0) {
9408 9408 ASSERT(PAGE_LOCKED(*pplist));
9409 9409 page_unlock(*pplist);
9410 9410 np--;
9411 9411 pplist++;
9412 9412 }
9413 9413 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9414 9414 out:
9415 9415 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9416 9416 *ppp = NULL;
9417 9417 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_MISS_END,
9418 9418 "segvn_pagelock: cache miss seg %p addr %p", seg, addr);
9419 9419 return (error);
9420 9420 }
9421 9421
9422 9422 /*
9423 9423 * purge any cached pages in the I/O page cache
9424 9424 */
9425 9425 static void
9426 9426 segvn_purge(struct seg *seg)
9427 9427 {
9428 9428 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9429 9429
9430 9430 /*
9431 9431 * pcache is only used by pure anon segments.
9432 9432 */
9433 9433 if (svd->amp == NULL || svd->vp != NULL) {
9434 9434 return;
9435 9435 }
9436 9436
9437 9437 /*
9438 9438 * For MAP_SHARED segments non 0 segment's softlockcnt means
9439 9439 * active IO is still in progress via this segment. So we only
9440 9440 * purge MAP_SHARED segments when their softlockcnt is 0.
9441 9441 */
9442 9442 if (svd->type == MAP_PRIVATE) {
9443 9443 if (svd->softlockcnt) {
9444 9444 seg_ppurge(seg, NULL, 0);
9445 9445 }
9446 9446 } else if (svd->softlockcnt == 0 && svd->amp->a_softlockcnt != 0) {
9447 9447 seg_ppurge(seg, svd->amp, 0);
9448 9448 }
9449 9449 }
9450 9450
9451 9451 /*
9452 9452 * If async argument is not 0 we are called from pcache async thread and don't
9453 9453 * hold AS lock.
9454 9454 */
9455 9455
9456 9456 /*ARGSUSED*/
9457 9457 static int
9458 9458 segvn_reclaim(void *ptag, caddr_t addr, size_t len, struct page **pplist,
9459 9459 enum seg_rw rw, int async)
9460 9460 {
9461 9461 struct seg *seg = (struct seg *)ptag;
9462 9462 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9463 9463 pgcnt_t np, npages;
9464 9464 struct page **pl;
9465 9465
9466 9466 npages = np = btop(len);
9467 9467 ASSERT(npages);
9468 9468
9469 9469 ASSERT(svd->vp == NULL && svd->amp != NULL);
9470 9470 ASSERT(svd->softlockcnt >= npages);
9471 9471 ASSERT(async || AS_LOCK_HELD(seg->s_as));
9472 9472
9473 9473 pl = pplist;
9474 9474
9475 9475 ASSERT(pl[np] == NOPCACHE_SHWLIST || pl[np] == PCACHE_SHWLIST);
9476 9476 ASSERT(!async || pl[np] == PCACHE_SHWLIST);
9477 9477
9478 9478 while (np > (uint_t)0) {
9479 9479 if (rw == S_WRITE) {
9480 9480 hat_setrefmod(*pplist);
9481 9481 } else {
9482 9482 hat_setref(*pplist);
9483 9483 }
9484 9484 page_unlock(*pplist);
9485 9485 np--;
9486 9486 pplist++;
9487 9487 }
9488 9488
9489 9489 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9490 9490
9491 9491 /*
9492 9492 * If we are pcache async thread we don't hold AS lock. This means if
9493 9493 * softlockcnt drops to 0 after the decrement below address space may
9494 9494 * get freed. We can't allow it since after softlock derement to 0 we
9495 9495 * still need to access as structure for possible wakeup of unmap
9496 9496 * waiters. To prevent the disappearance of as we take this segment
9497 9497 * segfree_syncmtx. segvn_free() also takes this mutex as a barrier to
9498 9498 * make sure this routine completes before segment is freed.
9499 9499 *
9500 9500 * The second complication we have to deal with in async case is a
9501 9501 * possibility of missed wake up of unmap wait thread. When we don't
9502 9502 * hold as lock here we may take a_contents lock before unmap wait
9503 9503 * thread that was first to see softlockcnt was still not 0. As a
9504 9504 * result we'll fail to wake up an unmap wait thread. To avoid this
9505 9505 * race we set nounmapwait flag in as structure if we drop softlockcnt
9506 9506 * to 0 when we were called by pcache async thread. unmapwait thread
9507 9507 * will not block if this flag is set.
9508 9508 */
9509 9509 if (async) {
9510 9510 mutex_enter(&svd->segfree_syncmtx);
9511 9511 }
9512 9512
9513 9513 if (!atomic_add_long_nv((ulong_t *)&svd->softlockcnt, -npages)) {
9514 9514 if (async || AS_ISUNMAPWAIT(seg->s_as)) {
9515 9515 mutex_enter(&seg->s_as->a_contents);
9516 9516 if (async) {
9517 9517 AS_SETNOUNMAPWAIT(seg->s_as);
9518 9518 }
9519 9519 if (AS_ISUNMAPWAIT(seg->s_as)) {
9520 9520 AS_CLRUNMAPWAIT(seg->s_as);
9521 9521 cv_broadcast(&seg->s_as->a_cv);
9522 9522 }
9523 9523 mutex_exit(&seg->s_as->a_contents);
9524 9524 }
9525 9525 }
9526 9526
9527 9527 if (async) {
9528 9528 mutex_exit(&svd->segfree_syncmtx);
9529 9529 }
9530 9530 return (0);
9531 9531 }
9532 9532
9533 9533 /*ARGSUSED*/
9534 9534 static int
9535 9535 shamp_reclaim(void *ptag, caddr_t addr, size_t len, struct page **pplist,
9536 9536 enum seg_rw rw, int async)
9537 9537 {
9538 9538 amp_t *amp = (amp_t *)ptag;
9539 9539 pgcnt_t np, npages;
9540 9540 struct page **pl;
9541 9541
9542 9542 npages = np = btop(len);
9543 9543 ASSERT(npages);
9544 9544 ASSERT(amp->a_softlockcnt >= npages);
9545 9545
9546 9546 pl = pplist;
9547 9547
9548 9548 ASSERT(pl[np] == NOPCACHE_SHWLIST || pl[np] == PCACHE_SHWLIST);
9549 9549 ASSERT(!async || pl[np] == PCACHE_SHWLIST);
9550 9550
9551 9551 while (np > (uint_t)0) {
9552 9552 if (rw == S_WRITE) {
9553 9553 hat_setrefmod(*pplist);
9554 9554 } else {
9555 9555 hat_setref(*pplist);
9556 9556 }
9557 9557 page_unlock(*pplist);
9558 9558 np--;
9559 9559 pplist++;
9560 9560 }
9561 9561
9562 9562 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9563 9563
9564 9564 /*
9565 9565 * If somebody sleeps in anonmap_purge() wake them up if a_softlockcnt
9566 9566 * drops to 0. anon map can't be freed until a_softlockcnt drops to 0
9567 9567 * and anonmap_purge() acquires a_purgemtx.
9568 9568 */
9569 9569 mutex_enter(&->a_purgemtx);
9570 9570 if (!atomic_add_long_nv((ulong_t *)&->a_softlockcnt, -npages) &&
9571 9571 amp->a_purgewait) {
9572 9572 amp->a_purgewait = 0;
9573 9573 cv_broadcast(&->a_purgecv);
9574 9574 }
9575 9575 mutex_exit(&->a_purgemtx);
9576 9576 return (0);
9577 9577 }
9578 9578
9579 9579 /*
9580 9580 * get a memory ID for an addr in a given segment
9581 9581 *
9582 9582 * XXX only creates PAGESIZE pages if anon slots are not initialized.
9583 9583 * At fault time they will be relocated into larger pages.
9584 9584 */
9585 9585 static int
9586 9586 segvn_getmemid(struct seg *seg, caddr_t addr, memid_t *memidp)
9587 9587 {
9588 9588 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9589 9589 struct anon *ap = NULL;
9590 9590 ulong_t anon_index;
9591 9591 struct anon_map *amp;
9592 9592 anon_sync_obj_t cookie;
9593 9593
9594 9594 if (svd->type == MAP_PRIVATE) {
9595 9595 memidp->val[0] = (uintptr_t)seg->s_as;
9596 9596 memidp->val[1] = (uintptr_t)addr;
9597 9597 return (0);
9598 9598 }
9599 9599
9600 9600 if (svd->type == MAP_SHARED) {
9601 9601 if (svd->vp) {
9602 9602 memidp->val[0] = (uintptr_t)svd->vp;
9603 9603 memidp->val[1] = (u_longlong_t)svd->offset +
9604 9604 (uintptr_t)(addr - seg->s_base);
9605 9605 return (0);
9606 9606 } else {
9607 9607
9608 9608 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
9609 9609 if ((amp = svd->amp) != NULL) {
9610 9610 anon_index = svd->anon_index +
9611 9611 seg_page(seg, addr);
9612 9612 }
9613 9613 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9614 9614
9615 9615 ASSERT(amp != NULL);
9616 9616
9617 9617 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
9618 9618 anon_array_enter(amp, anon_index, &cookie);
9619 9619 ap = anon_get_ptr(amp->ahp, anon_index);
9620 9620 if (ap == NULL) {
9621 9621 page_t *pp;
9622 9622
9623 9623 pp = anon_zero(seg, addr, &ap, svd->cred);
9624 9624 if (pp == NULL) {
9625 9625 anon_array_exit(&cookie);
9626 9626 ANON_LOCK_EXIT(&->a_rwlock);
9627 9627 return (ENOMEM);
9628 9628 }
9629 9629 ASSERT(anon_get_ptr(amp->ahp, anon_index)
9630 9630 == NULL);
9631 9631 (void) anon_set_ptr(amp->ahp, anon_index,
9632 9632 ap, ANON_SLEEP);
9633 9633 page_unlock(pp);
9634 9634 }
9635 9635
9636 9636 anon_array_exit(&cookie);
9637 9637 ANON_LOCK_EXIT(&->a_rwlock);
9638 9638
9639 9639 memidp->val[0] = (uintptr_t)ap;
9640 9640 memidp->val[1] = (uintptr_t)addr & PAGEOFFSET;
9641 9641 return (0);
9642 9642 }
9643 9643 }
9644 9644 return (EINVAL);
9645 9645 }
9646 9646
9647 9647 static int
9648 9648 sameprot(struct seg *seg, caddr_t a, size_t len)
9649 9649 {
9650 9650 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9651 9651 struct vpage *vpage;
9652 9652 spgcnt_t pages = btop(len);
9653 9653 uint_t prot;
9654 9654
9655 9655 if (svd->pageprot == 0)
9656 9656 return (1);
9657 9657
9658 9658 ASSERT(svd->vpage != NULL);
9659 9659
9660 9660 vpage = &svd->vpage[seg_page(seg, a)];
9661 9661 prot = VPP_PROT(vpage);
9662 9662 vpage++;
9663 9663 pages--;
9664 9664 while (pages-- > 0) {
9665 9665 if (prot != VPP_PROT(vpage))
9666 9666 return (0);
9667 9667 vpage++;
9668 9668 }
9669 9669 return (1);
9670 9670 }
9671 9671
9672 9672 /*
9673 9673 * Get memory allocation policy info for specified address in given segment
9674 9674 */
9675 9675 static lgrp_mem_policy_info_t *
9676 9676 segvn_getpolicy(struct seg *seg, caddr_t addr)
9677 9677 {
9678 9678 struct anon_map *amp;
9679 9679 ulong_t anon_index;
9680 9680 lgrp_mem_policy_info_t *policy_info;
9681 9681 struct segvn_data *svn_data;
9682 9682 u_offset_t vn_off;
9683 9683 vnode_t *vp;
9684 9684
9685 9685 ASSERT(seg != NULL);
9686 9686
9687 9687 svn_data = (struct segvn_data *)seg->s_data;
9688 9688 if (svn_data == NULL)
9689 9689 return (NULL);
9690 9690
9691 9691 /*
9692 9692 * Get policy info for private or shared memory
9693 9693 */
9694 9694 if (svn_data->type != MAP_SHARED) {
9695 9695 if (svn_data->tr_state != SEGVN_TR_ON) {
9696 9696 policy_info = &svn_data->policy_info;
9697 9697 } else {
9698 9698 policy_info = &svn_data->tr_policy_info;
9699 9699 ASSERT(policy_info->mem_policy ==
9700 9700 LGRP_MEM_POLICY_NEXT_SEG);
9701 9701 }
9702 9702 } else {
9703 9703 amp = svn_data->amp;
9704 9704 anon_index = svn_data->anon_index + seg_page(seg, addr);
9705 9705 vp = svn_data->vp;
9706 9706 vn_off = svn_data->offset + (uintptr_t)(addr - seg->s_base);
9707 9707 policy_info = lgrp_shm_policy_get(amp, anon_index, vp, vn_off);
9708 9708 }
9709 9709
9710 9710 return (policy_info);
9711 9711 }
9712 9712
9713 9713 /*ARGSUSED*/
9714 9714 static int
9715 9715 segvn_capable(struct seg *seg, segcapability_t capability)
9716 9716 {
9717 9717 return (0);
9718 9718 }
9719 9719
9720 9720 /*
9721 9721 * Bind text vnode segment to an amp. If we bind successfully mappings will be
9722 9722 * established to per vnode mapping per lgroup amp pages instead of to vnode
9723 9723 * pages. There's one amp per vnode text mapping per lgroup. Many processes
9724 9724 * may share the same text replication amp. If a suitable amp doesn't already
9725 9725 * exist in svntr hash table create a new one. We may fail to bind to amp if
9726 9726 * segment is not eligible for text replication. Code below first checks for
9727 9727 * these conditions. If binding is successful segment tr_state is set to on
9728 9728 * and svd->amp points to the amp to use. Otherwise tr_state is set to off and
9729 9729 * svd->amp remains as NULL.
9730 9730 */
9731 9731 static void
9732 9732 segvn_textrepl(struct seg *seg)
9733 9733 {
9734 9734 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9735 9735 vnode_t *vp = svd->vp;
9736 9736 u_offset_t off = svd->offset;
9737 9737 size_t size = seg->s_size;
9738 9738 u_offset_t eoff = off + size;
9739 9739 uint_t szc = seg->s_szc;
9740 9740 ulong_t hash = SVNTR_HASH_FUNC(vp);
9741 9741 svntr_t *svntrp;
9742 9742 struct vattr va;
9743 9743 proc_t *p = seg->s_as->a_proc;
9744 9744 lgrp_id_t lgrp_id;
9745 9745 lgrp_id_t olid;
9746 9746 int first;
9747 9747 struct anon_map *amp;
9748 9748
9749 9749 ASSERT(AS_LOCK_HELD(seg->s_as));
9750 9750 ASSERT(SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
9751 9751 ASSERT(p != NULL);
9752 9752 ASSERT(svd->tr_state == SEGVN_TR_INIT);
9753 9753 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
9754 9754 ASSERT(svd->flags & MAP_TEXT);
9755 9755 ASSERT(svd->type == MAP_PRIVATE);
9756 9756 ASSERT(vp != NULL && svd->amp == NULL);
9757 9757 ASSERT(!svd->pageprot && !(svd->prot & PROT_WRITE));
9758 9758 ASSERT(!(svd->flags & MAP_NORESERVE) && svd->swresv == 0);
9759 9759 ASSERT(seg->s_as != &kas);
9760 9760 ASSERT(off < eoff);
9761 9761 ASSERT(svntr_hashtab != NULL);
9762 9762
9763 9763 /*
9764 9764 * If numa optimizations are no longer desired bail out.
9765 9765 */
9766 9766 if (!lgrp_optimizations()) {
9767 9767 svd->tr_state = SEGVN_TR_OFF;
9768 9768 return;
9769 9769 }
9770 9770
9771 9771 /*
9772 9772 * Avoid creating anon maps with size bigger than the file size.
9773 9773 * If VOP_GETATTR() call fails bail out.
9774 9774 */
9775 9775 va.va_mask = AT_SIZE | AT_MTIME | AT_CTIME;
9776 9776 if (VOP_GETATTR(vp, &va, 0, svd->cred, NULL) != 0) {
9777 9777 svd->tr_state = SEGVN_TR_OFF;
9778 9778 SEGVN_TR_ADDSTAT(gaerr);
9779 9779 return;
9780 9780 }
9781 9781 if (btopr(va.va_size) < btopr(eoff)) {
9782 9782 svd->tr_state = SEGVN_TR_OFF;
9783 9783 SEGVN_TR_ADDSTAT(overmap);
9784 9784 return;
9785 9785 }
9786 9786
9787 9787 /*
9788 9788 * VVMEXEC may not be set yet if exec() prefaults text segment. Set
9789 9789 * this flag now before vn_is_mapped(V_WRITE) so that MAP_SHARED
9790 9790 * mapping that checks if trcache for this vnode needs to be
9791 9791 * invalidated can't miss us.
9792 9792 */
9793 9793 if (!(vp->v_flag & VVMEXEC)) {
9794 9794 mutex_enter(&vp->v_lock);
9795 9795 vp->v_flag |= VVMEXEC;
9796 9796 mutex_exit(&vp->v_lock);
9797 9797 }
9798 9798 mutex_enter(&svntr_hashtab[hash].tr_lock);
9799 9799 /*
9800 9800 * Bail out if potentially MAP_SHARED writable mappings exist to this
9801 9801 * vnode. We don't want to use old file contents from existing
9802 9802 * replicas if this mapping was established after the original file
9803 9803 * was changed.
9804 9804 */
9805 9805 if (vn_is_mapped(vp, V_WRITE)) {
9806 9806 mutex_exit(&svntr_hashtab[hash].tr_lock);
9807 9807 svd->tr_state = SEGVN_TR_OFF;
9808 9808 SEGVN_TR_ADDSTAT(wrcnt);
9809 9809 return;
9810 9810 }
9811 9811 svntrp = svntr_hashtab[hash].tr_head;
9812 9812 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
9813 9813 ASSERT(svntrp->tr_refcnt != 0);
9814 9814 if (svntrp->tr_vp != vp) {
9815 9815 continue;
9816 9816 }
9817 9817
9818 9818 /*
9819 9819 * Bail out if the file or its attributes were changed after
9820 9820 * this replication entry was created since we need to use the
9821 9821 * latest file contents. Note that mtime test alone is not
9822 9822 * sufficient because a user can explicitly change mtime via
9823 9823 * utimes(2) interfaces back to the old value after modifiying
9824 9824 * the file contents. To detect this case we also have to test
9825 9825 * ctime which among other things records the time of the last
9826 9826 * mtime change by utimes(2). ctime is not changed when the file
9827 9827 * is only read or executed so we expect that typically existing
9828 9828 * replication amp's can be used most of the time.
9829 9829 */
9830 9830 if (!svntrp->tr_valid ||
9831 9831 svntrp->tr_mtime.tv_sec != va.va_mtime.tv_sec ||
9832 9832 svntrp->tr_mtime.tv_nsec != va.va_mtime.tv_nsec ||
9833 9833 svntrp->tr_ctime.tv_sec != va.va_ctime.tv_sec ||
9834 9834 svntrp->tr_ctime.tv_nsec != va.va_ctime.tv_nsec) {
9835 9835 mutex_exit(&svntr_hashtab[hash].tr_lock);
9836 9836 svd->tr_state = SEGVN_TR_OFF;
9837 9837 SEGVN_TR_ADDSTAT(stale);
9838 9838 return;
9839 9839 }
9840 9840 /*
9841 9841 * if off, eoff and szc match current segment we found the
9842 9842 * existing entry we can use.
9843 9843 */
9844 9844 if (svntrp->tr_off == off && svntrp->tr_eoff == eoff &&
9845 9845 svntrp->tr_szc == szc) {
9846 9846 break;
9847 9847 }
9848 9848 /*
9849 9849 * Don't create different but overlapping in file offsets
9850 9850 * entries to avoid replication of the same file pages more
9851 9851 * than once per lgroup.
9852 9852 */
9853 9853 if ((off >= svntrp->tr_off && off < svntrp->tr_eoff) ||
9854 9854 (eoff > svntrp->tr_off && eoff <= svntrp->tr_eoff)) {
9855 9855 mutex_exit(&svntr_hashtab[hash].tr_lock);
9856 9856 svd->tr_state = SEGVN_TR_OFF;
9857 9857 SEGVN_TR_ADDSTAT(overlap);
9858 9858 return;
9859 9859 }
9860 9860 }
9861 9861 /*
9862 9862 * If we didn't find existing entry create a new one.
9863 9863 */
9864 9864 if (svntrp == NULL) {
9865 9865 svntrp = kmem_cache_alloc(svntr_cache, KM_NOSLEEP);
9866 9866 if (svntrp == NULL) {
9867 9867 mutex_exit(&svntr_hashtab[hash].tr_lock);
9868 9868 svd->tr_state = SEGVN_TR_OFF;
9869 9869 SEGVN_TR_ADDSTAT(nokmem);
9870 9870 return;
9871 9871 }
9872 9872 #ifdef DEBUG
9873 9873 {
9874 9874 lgrp_id_t i;
9875 9875 for (i = 0; i < NLGRPS_MAX; i++) {
9876 9876 ASSERT(svntrp->tr_amp[i] == NULL);
9877 9877 }
9878 9878 }
9879 9879 #endif /* DEBUG */
9880 9880 svntrp->tr_vp = vp;
9881 9881 svntrp->tr_off = off;
9882 9882 svntrp->tr_eoff = eoff;
9883 9883 svntrp->tr_szc = szc;
9884 9884 svntrp->tr_valid = 1;
9885 9885 svntrp->tr_mtime = va.va_mtime;
9886 9886 svntrp->tr_ctime = va.va_ctime;
9887 9887 svntrp->tr_refcnt = 0;
9888 9888 svntrp->tr_next = svntr_hashtab[hash].tr_head;
9889 9889 svntr_hashtab[hash].tr_head = svntrp;
9890 9890 }
9891 9891 first = 1;
9892 9892 again:
9893 9893 /*
9894 9894 * We want to pick a replica with pages on main thread's (t_tid = 1,
9895 9895 * aka T1) lgrp. Currently text replication is only optimized for
9896 9896 * workloads that either have all threads of a process on the same
9897 9897 * lgrp or execute their large text primarily on main thread.
9898 9898 */
9899 9899 lgrp_id = p->p_t1_lgrpid;
9900 9900 if (lgrp_id == LGRP_NONE) {
9901 9901 /*
9902 9902 * In case exec() prefaults text on non main thread use
9903 9903 * current thread lgrpid. It will become main thread anyway
9904 9904 * soon.
9905 9905 */
9906 9906 lgrp_id = lgrp_home_id(curthread);
9907 9907 }
9908 9908 /*
9909 9909 * Set p_tr_lgrpid to lgrpid if it hasn't been set yet. Otherwise
9910 9910 * just set it to NLGRPS_MAX if it's different from current process T1
9911 9911 * home lgrp. p_tr_lgrpid is used to detect if process uses text
9912 9912 * replication and T1 new home is different from lgrp used for text
9913 9913 * replication. When this happens asyncronous segvn thread rechecks if
9914 9914 * segments should change lgrps used for text replication. If we fail
9915 9915 * to set p_tr_lgrpid with atomic_cas_32 then set it to NLGRPS_MAX
9916 9916 * without cas if it's not already NLGRPS_MAX and not equal lgrp_id
9917 9917 * we want to use. We don't need to use cas in this case because
9918 9918 * another thread that races in between our non atomic check and set
9919 9919 * may only change p_tr_lgrpid to NLGRPS_MAX at this point.
9920 9920 */
9921 9921 ASSERT(lgrp_id != LGRP_NONE && lgrp_id < NLGRPS_MAX);
9922 9922 olid = p->p_tr_lgrpid;
9923 9923 if (lgrp_id != olid && olid != NLGRPS_MAX) {
9924 9924 lgrp_id_t nlid = (olid == LGRP_NONE) ? lgrp_id : NLGRPS_MAX;
9925 9925 if (atomic_cas_32((uint32_t *)&p->p_tr_lgrpid, olid, nlid) !=
9926 9926 olid) {
9927 9927 olid = p->p_tr_lgrpid;
9928 9928 ASSERT(olid != LGRP_NONE);
9929 9929 if (olid != lgrp_id && olid != NLGRPS_MAX) {
9930 9930 p->p_tr_lgrpid = NLGRPS_MAX;
9931 9931 }
9932 9932 }
9933 9933 ASSERT(p->p_tr_lgrpid != LGRP_NONE);
9934 9934 membar_producer();
9935 9935 /*
9936 9936 * lgrp_move_thread() won't schedule async recheck after
9937 9937 * p->p_t1_lgrpid update unless p->p_tr_lgrpid is not
9938 9938 * LGRP_NONE. Recheck p_t1_lgrpid once now that p->p_tr_lgrpid
9939 9939 * is not LGRP_NONE.
9940 9940 */
9941 9941 if (first && p->p_t1_lgrpid != LGRP_NONE &&
9942 9942 p->p_t1_lgrpid != lgrp_id) {
9943 9943 first = 0;
9944 9944 goto again;
9945 9945 }
9946 9946 }
9947 9947 /*
9948 9948 * If no amp was created yet for lgrp_id create a new one as long as
9949 9949 * we have enough memory to afford it.
9950 9950 */
9951 9951 if ((amp = svntrp->tr_amp[lgrp_id]) == NULL) {
9952 9952 size_t trmem = atomic_add_long_nv(&segvn_textrepl_bytes, size);
9953 9953 if (trmem > segvn_textrepl_max_bytes) {
9954 9954 SEGVN_TR_ADDSTAT(normem);
9955 9955 goto fail;
9956 9956 }
9957 9957 if (anon_try_resv_zone(size, NULL) == 0) {
9958 9958 SEGVN_TR_ADDSTAT(noanon);
9959 9959 goto fail;
9960 9960 }
9961 9961 amp = anonmap_alloc(size, size, ANON_NOSLEEP);
9962 9962 if (amp == NULL) {
9963 9963 anon_unresv_zone(size, NULL);
9964 9964 SEGVN_TR_ADDSTAT(nokmem);
9965 9965 goto fail;
9966 9966 }
9967 9967 ASSERT(amp->refcnt == 1);
9968 9968 amp->a_szc = szc;
9969 9969 svntrp->tr_amp[lgrp_id] = amp;
9970 9970 SEGVN_TR_ADDSTAT(newamp);
9971 9971 }
9972 9972 svntrp->tr_refcnt++;
9973 9973 ASSERT(svd->svn_trnext == NULL);
9974 9974 ASSERT(svd->svn_trprev == NULL);
9975 9975 svd->svn_trnext = svntrp->tr_svnhead;
9976 9976 svd->svn_trprev = NULL;
9977 9977 if (svntrp->tr_svnhead != NULL) {
9978 9978 svntrp->tr_svnhead->svn_trprev = svd;
9979 9979 }
9980 9980 svntrp->tr_svnhead = svd;
9981 9981 ASSERT(amp->a_szc == szc && amp->size == size && amp->swresv == size);
9982 9982 ASSERT(amp->refcnt >= 1);
9983 9983 svd->amp = amp;
9984 9984 svd->anon_index = 0;
9985 9985 svd->tr_policy_info.mem_policy = LGRP_MEM_POLICY_NEXT_SEG;
9986 9986 svd->tr_policy_info.mem_lgrpid = lgrp_id;
9987 9987 svd->tr_state = SEGVN_TR_ON;
9988 9988 mutex_exit(&svntr_hashtab[hash].tr_lock);
9989 9989 SEGVN_TR_ADDSTAT(repl);
9990 9990 return;
9991 9991 fail:
9992 9992 ASSERT(segvn_textrepl_bytes >= size);
9993 9993 atomic_add_long(&segvn_textrepl_bytes, -size);
9994 9994 ASSERT(svntrp != NULL);
9995 9995 ASSERT(svntrp->tr_amp[lgrp_id] == NULL);
9996 9996 if (svntrp->tr_refcnt == 0) {
9997 9997 ASSERT(svntrp == svntr_hashtab[hash].tr_head);
9998 9998 svntr_hashtab[hash].tr_head = svntrp->tr_next;
9999 9999 mutex_exit(&svntr_hashtab[hash].tr_lock);
10000 10000 kmem_cache_free(svntr_cache, svntrp);
10001 10001 } else {
10002 10002 mutex_exit(&svntr_hashtab[hash].tr_lock);
10003 10003 }
10004 10004 svd->tr_state = SEGVN_TR_OFF;
10005 10005 }
10006 10006
10007 10007 /*
10008 10008 * Convert seg back to regular vnode mapping seg by unbinding it from its text
10009 10009 * replication amp. This routine is most typically called when segment is
10010 10010 * unmapped but can also be called when segment no longer qualifies for text
10011 10011 * replication (e.g. due to protection changes). If unload_unmap is set use
10012 10012 * HAT_UNLOAD_UNMAP flag in hat_unload_callback(). If we are the last user of
10013 10013 * svntr free all its anon maps and remove it from the hash table.
10014 10014 */
10015 10015 static void
10016 10016 segvn_textunrepl(struct seg *seg, int unload_unmap)
10017 10017 {
10018 10018 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
10019 10019 vnode_t *vp = svd->vp;
10020 10020 u_offset_t off = svd->offset;
10021 10021 size_t size = seg->s_size;
10022 10022 u_offset_t eoff = off + size;
10023 10023 uint_t szc = seg->s_szc;
10024 10024 ulong_t hash = SVNTR_HASH_FUNC(vp);
10025 10025 svntr_t *svntrp;
10026 10026 svntr_t **prv_svntrp;
10027 10027 lgrp_id_t lgrp_id = svd->tr_policy_info.mem_lgrpid;
10028 10028 lgrp_id_t i;
10029 10029
10030 10030 ASSERT(AS_LOCK_HELD(seg->s_as));
10031 10031 ASSERT(AS_WRITE_HELD(seg->s_as) ||
10032 10032 SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
10033 10033 ASSERT(svd->tr_state == SEGVN_TR_ON);
10034 10034 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
10035 10035 ASSERT(svd->amp != NULL);
10036 10036 ASSERT(svd->amp->refcnt >= 1);
10037 10037 ASSERT(svd->anon_index == 0);
10038 10038 ASSERT(lgrp_id != LGRP_NONE && lgrp_id < NLGRPS_MAX);
10039 10039 ASSERT(svntr_hashtab != NULL);
10040 10040
10041 10041 mutex_enter(&svntr_hashtab[hash].tr_lock);
10042 10042 prv_svntrp = &svntr_hashtab[hash].tr_head;
10043 10043 for (; (svntrp = *prv_svntrp) != NULL; prv_svntrp = &svntrp->tr_next) {
10044 10044 ASSERT(svntrp->tr_refcnt != 0);
10045 10045 if (svntrp->tr_vp == vp && svntrp->tr_off == off &&
10046 10046 svntrp->tr_eoff == eoff && svntrp->tr_szc == szc) {
10047 10047 break;
10048 10048 }
10049 10049 }
10050 10050 if (svntrp == NULL) {
10051 10051 panic("segvn_textunrepl: svntr record not found");
10052 10052 }
10053 10053 if (svntrp->tr_amp[lgrp_id] != svd->amp) {
10054 10054 panic("segvn_textunrepl: amp mismatch");
10055 10055 }
10056 10056 svd->tr_state = SEGVN_TR_OFF;
10057 10057 svd->amp = NULL;
10058 10058 if (svd->svn_trprev == NULL) {
10059 10059 ASSERT(svntrp->tr_svnhead == svd);
10060 10060 svntrp->tr_svnhead = svd->svn_trnext;
10061 10061 if (svntrp->tr_svnhead != NULL) {
10062 10062 svntrp->tr_svnhead->svn_trprev = NULL;
10063 10063 }
10064 10064 svd->svn_trnext = NULL;
10065 10065 } else {
10066 10066 svd->svn_trprev->svn_trnext = svd->svn_trnext;
10067 10067 if (svd->svn_trnext != NULL) {
10068 10068 svd->svn_trnext->svn_trprev = svd->svn_trprev;
10069 10069 svd->svn_trnext = NULL;
10070 10070 }
10071 10071 svd->svn_trprev = NULL;
10072 10072 }
10073 10073 if (--svntrp->tr_refcnt) {
10074 10074 mutex_exit(&svntr_hashtab[hash].tr_lock);
10075 10075 goto done;
10076 10076 }
10077 10077 *prv_svntrp = svntrp->tr_next;
10078 10078 mutex_exit(&svntr_hashtab[hash].tr_lock);
10079 10079 for (i = 0; i < NLGRPS_MAX; i++) {
10080 10080 struct anon_map *amp = svntrp->tr_amp[i];
10081 10081 if (amp == NULL) {
10082 10082 continue;
10083 10083 }
10084 10084 ASSERT(amp->refcnt == 1);
10085 10085 ASSERT(amp->swresv == size);
10086 10086 ASSERT(amp->size == size);
10087 10087 ASSERT(amp->a_szc == szc);
10088 10088 if (amp->a_szc != 0) {
10089 10089 anon_free_pages(amp->ahp, 0, size, szc);
10090 10090 } else {
10091 10091 anon_free(amp->ahp, 0, size);
10092 10092 }
10093 10093 svntrp->tr_amp[i] = NULL;
10094 10094 ASSERT(segvn_textrepl_bytes >= size);
10095 10095 atomic_add_long(&segvn_textrepl_bytes, -size);
10096 10096 anon_unresv_zone(amp->swresv, NULL);
10097 10097 amp->refcnt = 0;
10098 10098 anonmap_free(amp);
10099 10099 }
10100 10100 kmem_cache_free(svntr_cache, svntrp);
10101 10101 done:
10102 10102 hat_unload_callback(seg->s_as->a_hat, seg->s_base, size,
10103 10103 unload_unmap ? HAT_UNLOAD_UNMAP : 0, NULL);
10104 10104 }
10105 10105
10106 10106 /*
10107 10107 * This is called when a MAP_SHARED writable mapping is created to a vnode
10108 10108 * that is currently used for execution (VVMEXEC flag is set). In this case we
10109 10109 * need to prevent further use of existing replicas.
10110 10110 */
10111 10111 static void
10112 10112 segvn_inval_trcache(vnode_t *vp)
10113 10113 {
10114 10114 ulong_t hash = SVNTR_HASH_FUNC(vp);
10115 10115 svntr_t *svntrp;
10116 10116
10117 10117 ASSERT(vp->v_flag & VVMEXEC);
10118 10118
10119 10119 if (svntr_hashtab == NULL) {
10120 10120 return;
10121 10121 }
10122 10122
10123 10123 mutex_enter(&svntr_hashtab[hash].tr_lock);
10124 10124 svntrp = svntr_hashtab[hash].tr_head;
10125 10125 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
10126 10126 ASSERT(svntrp->tr_refcnt != 0);
10127 10127 if (svntrp->tr_vp == vp && svntrp->tr_valid) {
10128 10128 svntrp->tr_valid = 0;
10129 10129 }
10130 10130 }
10131 10131 mutex_exit(&svntr_hashtab[hash].tr_lock);
10132 10132 }
10133 10133
10134 10134 static void
10135 10135 segvn_trasync_thread(void)
10136 10136 {
10137 10137 callb_cpr_t cpr_info;
10138 10138 kmutex_t cpr_lock; /* just for CPR stuff */
10139 10139
10140 10140 mutex_init(&cpr_lock, NULL, MUTEX_DEFAULT, NULL);
10141 10141
10142 10142 CALLB_CPR_INIT(&cpr_info, &cpr_lock,
10143 10143 callb_generic_cpr, "segvn_async");
10144 10144
10145 10145 if (segvn_update_textrepl_interval == 0) {
10146 10146 segvn_update_textrepl_interval = segvn_update_tr_time * hz;
10147 10147 } else {
10148 10148 segvn_update_textrepl_interval *= hz;
10149 10149 }
10150 10150 (void) timeout(segvn_trupdate_wakeup, NULL,
10151 10151 segvn_update_textrepl_interval);
10152 10152
10153 10153 for (;;) {
10154 10154 mutex_enter(&cpr_lock);
10155 10155 CALLB_CPR_SAFE_BEGIN(&cpr_info);
10156 10156 mutex_exit(&cpr_lock);
10157 10157 sema_p(&segvn_trasync_sem);
10158 10158 mutex_enter(&cpr_lock);
10159 10159 CALLB_CPR_SAFE_END(&cpr_info, &cpr_lock);
10160 10160 mutex_exit(&cpr_lock);
10161 10161 segvn_trupdate();
10162 10162 }
10163 10163 }
10164 10164
10165 10165 static uint64_t segvn_lgrp_trthr_migrs_snpsht = 0;
10166 10166
10167 10167 static void
10168 10168 segvn_trupdate_wakeup(void *dummy)
10169 10169 {
10170 10170 uint64_t cur_lgrp_trthr_migrs = lgrp_get_trthr_migrations();
10171 10171
10172 10172 if (cur_lgrp_trthr_migrs != segvn_lgrp_trthr_migrs_snpsht) {
10173 10173 segvn_lgrp_trthr_migrs_snpsht = cur_lgrp_trthr_migrs;
10174 10174 sema_v(&segvn_trasync_sem);
10175 10175 }
10176 10176
10177 10177 if (!segvn_disable_textrepl_update &&
10178 10178 segvn_update_textrepl_interval != 0) {
10179 10179 (void) timeout(segvn_trupdate_wakeup, dummy,
10180 10180 segvn_update_textrepl_interval);
10181 10181 }
10182 10182 }
10183 10183
10184 10184 static void
10185 10185 segvn_trupdate(void)
10186 10186 {
10187 10187 ulong_t hash;
10188 10188 svntr_t *svntrp;
10189 10189 segvn_data_t *svd;
10190 10190
10191 10191 ASSERT(svntr_hashtab != NULL);
10192 10192
10193 10193 for (hash = 0; hash < svntr_hashtab_sz; hash++) {
10194 10194 mutex_enter(&svntr_hashtab[hash].tr_lock);
10195 10195 svntrp = svntr_hashtab[hash].tr_head;
10196 10196 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
10197 10197 ASSERT(svntrp->tr_refcnt != 0);
10198 10198 svd = svntrp->tr_svnhead;
10199 10199 for (; svd != NULL; svd = svd->svn_trnext) {
10200 10200 segvn_trupdate_seg(svd->seg, svd, svntrp,
10201 10201 hash);
10202 10202 }
10203 10203 }
10204 10204 mutex_exit(&svntr_hashtab[hash].tr_lock);
10205 10205 }
10206 10206 }
10207 10207
10208 10208 static void
10209 10209 segvn_trupdate_seg(struct seg *seg,
10210 10210 segvn_data_t *svd,
10211 10211 svntr_t *svntrp,
10212 10212 ulong_t hash)
10213 10213 {
10214 10214 proc_t *p;
10215 10215 lgrp_id_t lgrp_id;
10216 10216 struct as *as;
10217 10217 size_t size;
10218 10218 struct anon_map *amp;
10219 10219
10220 10220 ASSERT(svd->vp != NULL);
10221 10221 ASSERT(svd->vp == svntrp->tr_vp);
10222 10222 ASSERT(svd->offset == svntrp->tr_off);
10223 10223 ASSERT(svd->offset + seg->s_size == svntrp->tr_eoff);
10224 10224 ASSERT(seg != NULL);
10225 10225 ASSERT(svd->seg == seg);
10226 10226 ASSERT(seg->s_data == (void *)svd);
10227 10227 ASSERT(seg->s_szc == svntrp->tr_szc);
10228 10228 ASSERT(svd->tr_state == SEGVN_TR_ON);
10229 10229 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
10230 10230 ASSERT(svd->amp != NULL);
10231 10231 ASSERT(svd->tr_policy_info.mem_policy == LGRP_MEM_POLICY_NEXT_SEG);
10232 10232 ASSERT(svd->tr_policy_info.mem_lgrpid != LGRP_NONE);
10233 10233 ASSERT(svd->tr_policy_info.mem_lgrpid < NLGRPS_MAX);
10234 10234 ASSERT(svntrp->tr_amp[svd->tr_policy_info.mem_lgrpid] == svd->amp);
10235 10235 ASSERT(svntrp->tr_refcnt != 0);
10236 10236 ASSERT(mutex_owned(&svntr_hashtab[hash].tr_lock));
10237 10237
10238 10238 as = seg->s_as;
10239 10239 ASSERT(as != NULL && as != &kas);
10240 10240 p = as->a_proc;
10241 10241 ASSERT(p != NULL);
10242 10242 ASSERT(p->p_tr_lgrpid != LGRP_NONE);
10243 10243 lgrp_id = p->p_t1_lgrpid;
10244 10244 if (lgrp_id == LGRP_NONE) {
10245 10245 return;
10246 10246 }
10247 10247 ASSERT(lgrp_id < NLGRPS_MAX);
10248 10248 if (svd->tr_policy_info.mem_lgrpid == lgrp_id) {
10249 10249 return;
10250 10250 }
10251 10251
10252 10252 /*
10253 10253 * Use tryenter locking since we are locking as/seg and svntr hash
10254 10254 * lock in reverse from syncrounous thread order.
10255 10255 */
10256 10256 if (!AS_LOCK_TRYENTER(as, RW_READER)) {
10257 10257 SEGVN_TR_ADDSTAT(nolock);
10258 10258 if (segvn_lgrp_trthr_migrs_snpsht) {
10259 10259 segvn_lgrp_trthr_migrs_snpsht = 0;
10260 10260 }
10261 10261 return;
10262 10262 }
10263 10263 if (!SEGVN_LOCK_TRYENTER(seg->s_as, &svd->lock, RW_WRITER)) {
10264 10264 AS_LOCK_EXIT(as);
10265 10265 SEGVN_TR_ADDSTAT(nolock);
10266 10266 if (segvn_lgrp_trthr_migrs_snpsht) {
10267 10267 segvn_lgrp_trthr_migrs_snpsht = 0;
10268 10268 }
10269 10269 return;
10270 10270 }
10271 10271 size = seg->s_size;
10272 10272 if (svntrp->tr_amp[lgrp_id] == NULL) {
10273 10273 size_t trmem = atomic_add_long_nv(&segvn_textrepl_bytes, size);
10274 10274 if (trmem > segvn_textrepl_max_bytes) {
10275 10275 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10276 10276 AS_LOCK_EXIT(as);
10277 10277 atomic_add_long(&segvn_textrepl_bytes, -size);
10278 10278 SEGVN_TR_ADDSTAT(normem);
10279 10279 return;
10280 10280 }
10281 10281 if (anon_try_resv_zone(size, NULL) == 0) {
10282 10282 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10283 10283 AS_LOCK_EXIT(as);
10284 10284 atomic_add_long(&segvn_textrepl_bytes, -size);
10285 10285 SEGVN_TR_ADDSTAT(noanon);
10286 10286 return;
10287 10287 }
10288 10288 amp = anonmap_alloc(size, size, KM_NOSLEEP);
10289 10289 if (amp == NULL) {
10290 10290 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10291 10291 AS_LOCK_EXIT(as);
10292 10292 atomic_add_long(&segvn_textrepl_bytes, -size);
10293 10293 anon_unresv_zone(size, NULL);
10294 10294 SEGVN_TR_ADDSTAT(nokmem);
10295 10295 return;
10296 10296 }
10297 10297 ASSERT(amp->refcnt == 1);
10298 10298 amp->a_szc = seg->s_szc;
10299 10299 svntrp->tr_amp[lgrp_id] = amp;
10300 10300 }
10301 10301 /*
10302 10302 * We don't need to drop the bucket lock but here we give other
10303 10303 * threads a chance. svntr and svd can't be unlinked as long as
10304 10304 * segment lock is held as a writer and AS held as well. After we
10305 10305 * retake bucket lock we'll continue from where we left. We'll be able
10306 10306 * to reach the end of either list since new entries are always added
10307 10307 * to the beginning of the lists.
10308 10308 */
10309 10309 mutex_exit(&svntr_hashtab[hash].tr_lock);
10310 10310 hat_unload_callback(as->a_hat, seg->s_base, size, 0, NULL);
10311 10311 mutex_enter(&svntr_hashtab[hash].tr_lock);
10312 10312
10313 10313 ASSERT(svd->tr_state == SEGVN_TR_ON);
10314 10314 ASSERT(svd->amp != NULL);
10315 10315 ASSERT(svd->tr_policy_info.mem_policy == LGRP_MEM_POLICY_NEXT_SEG);
10316 10316 ASSERT(svd->tr_policy_info.mem_lgrpid != lgrp_id);
10317 10317 ASSERT(svd->amp != svntrp->tr_amp[lgrp_id]);
10318 10318
10319 10319 svd->tr_policy_info.mem_lgrpid = lgrp_id;
10320 10320 svd->amp = svntrp->tr_amp[lgrp_id];
10321 10321 p->p_tr_lgrpid = NLGRPS_MAX;
10322 10322 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10323 10323 AS_LOCK_EXIT(as);
10324 10324
10325 10325 ASSERT(svntrp->tr_refcnt != 0);
10326 10326 ASSERT(svd->vp == svntrp->tr_vp);
10327 10327 ASSERT(svd->tr_policy_info.mem_lgrpid == lgrp_id);
10328 10328 ASSERT(svd->amp != NULL && svd->amp == svntrp->tr_amp[lgrp_id]);
10329 10329 ASSERT(svd->seg == seg);
10330 10330 ASSERT(svd->tr_state == SEGVN_TR_ON);
10331 10331
10332 10332 SEGVN_TR_ADDSTAT(asyncrepl);
10333 10333 }
|
↓ open down ↓ |
10012 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX