Print this page
patch as-lock-macro-simplification
| 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
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 311 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 struct segvn_crargs *a = (struct segvn_crargs *)argsp;
|
↓ open down ↓ |
543 lines elided |
↑ open up ↑ |
544 544 struct segvn_data *svd;
545 545 size_t swresv = 0;
546 546 struct cred *cred;
547 547 struct anon_map *amp;
548 548 int error = 0;
549 549 size_t pgsz;
550 550 lgrp_mem_policy_t mpolicy = LGRP_MEM_POLICY_DEFAULT;
551 551 int use_rgn = 0;
552 552 int trok = 0;
553 553
554 - ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
554 + ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
555 555
556 556 if (a->type != MAP_PRIVATE && a->type != MAP_SHARED) {
557 557 panic("segvn_create type");
558 558 /*NOTREACHED*/
559 559 }
560 560
561 561 /*
562 562 * Check arguments. If a shared anon structure is given then
563 563 * it is illegal to also specify a vp.
564 564 */
565 565 if (a->amp != NULL && a->vp != NULL) {
566 566 panic("segvn_create anon_map");
567 567 /*NOTREACHED*/
568 568 }
569 569
570 570 if (a->type == MAP_PRIVATE && (a->flags & MAP_TEXT) &&
571 571 a->vp != NULL && a->prot == (PROT_USER | PROT_READ | PROT_EXEC) &&
572 572 segvn_use_regions) {
573 573 use_rgn = 1;
574 574 }
575 575
576 576 /* MAP_NORESERVE on a MAP_SHARED segment is meaningless. */
577 577 if (a->type == MAP_SHARED)
578 578 a->flags &= ~MAP_NORESERVE;
579 579
580 580 if (a->szc != 0) {
581 581 if (segvn_lpg_disable != 0 || (a->szc == AS_MAP_NO_LPOOB) ||
582 582 (a->amp != NULL && a->type == MAP_PRIVATE) ||
583 583 (a->flags & MAP_NORESERVE) || seg->s_as == &kas) {
584 584 a->szc = 0;
585 585 } else {
586 586 if (a->szc > segvn_maxpgszc)
587 587 a->szc = segvn_maxpgszc;
588 588 pgsz = page_get_pagesize(a->szc);
589 589 if (!IS_P2ALIGNED(seg->s_base, pgsz) ||
590 590 !IS_P2ALIGNED(seg->s_size, pgsz)) {
591 591 a->szc = 0;
592 592 } else if (a->vp != NULL) {
593 593 if (IS_SWAPFSVP(a->vp) || VN_ISKAS(a->vp)) {
594 594 /*
595 595 * paranoid check.
596 596 * hat_page_demote() is not supported
597 597 * on swapfs pages.
598 598 */
599 599 a->szc = 0;
600 600 } else if (map_addr_vacalign_check(seg->s_base,
601 601 a->offset & PAGEMASK)) {
602 602 a->szc = 0;
603 603 }
604 604 } else if (a->amp != NULL) {
605 605 pgcnt_t anum = btopr(a->offset);
606 606 pgcnt_t pgcnt = page_get_pagecnt(a->szc);
607 607 if (!IS_P2ALIGNED(anum, pgcnt)) {
608 608 a->szc = 0;
609 609 }
610 610 }
611 611 }
612 612 }
613 613
614 614 /*
615 615 * If segment may need private pages, reserve them now.
616 616 */
617 617 if (!(a->flags & MAP_NORESERVE) && ((a->vp == NULL && a->amp == NULL) ||
618 618 (a->type == MAP_PRIVATE && (a->prot & PROT_WRITE)))) {
619 619 if (anon_resv_zone(seg->s_size,
620 620 seg->s_as->a_proc->p_zone) == 0)
621 621 return (EAGAIN);
622 622 swresv = seg->s_size;
623 623 TRACE_3(TR_FAC_VM, TR_ANON_PROC, "anon proc:%p %lu %u",
624 624 seg, swresv, 1);
625 625 }
626 626
627 627 /*
628 628 * Reserve any mapping structures that may be required.
629 629 *
630 630 * Don't do it for segments that may use regions. It's currently a
631 631 * noop in the hat implementations anyway.
632 632 */
633 633 if (!use_rgn) {
634 634 hat_map(seg->s_as->a_hat, seg->s_base, seg->s_size, HAT_MAP);
635 635 }
636 636
637 637 if (a->cred) {
638 638 cred = a->cred;
639 639 crhold(cred);
640 640 } else {
641 641 crhold(cred = CRED());
642 642 }
643 643
644 644 /* Inform the vnode of the new mapping */
645 645 if (a->vp != NULL) {
646 646 error = VOP_ADDMAP(a->vp, a->offset & PAGEMASK,
647 647 seg->s_as, seg->s_base, seg->s_size, a->prot,
648 648 a->maxprot, a->type, cred, NULL);
649 649 if (error) {
650 650 if (swresv != 0) {
651 651 anon_unresv_zone(swresv,
652 652 seg->s_as->a_proc->p_zone);
653 653 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
654 654 "anon proc:%p %lu %u", seg, swresv, 0);
655 655 }
656 656 crfree(cred);
657 657 if (!use_rgn) {
658 658 hat_unload(seg->s_as->a_hat, seg->s_base,
659 659 seg->s_size, HAT_UNLOAD_UNMAP);
660 660 }
661 661 return (error);
662 662 }
663 663 /*
664 664 * svntr_hashtab will be NULL if we support shared regions.
665 665 */
666 666 trok = ((a->flags & MAP_TEXT) &&
667 667 (seg->s_size > textrepl_size_thresh ||
668 668 (a->flags & _MAP_TEXTREPL)) &&
669 669 lgrp_optimizations() && svntr_hashtab != NULL &&
670 670 a->type == MAP_PRIVATE && swresv == 0 &&
671 671 !(a->flags & MAP_NORESERVE) &&
672 672 seg->s_as != &kas && a->vp->v_type == VREG);
673 673
674 674 ASSERT(!trok || !use_rgn);
675 675 }
676 676
677 677 /*
678 678 * MAP_NORESERVE mappings don't count towards the VSZ of a process
679 679 * until we fault the pages in.
680 680 */
681 681 if ((a->vp == NULL || a->vp->v_type != VREG) &&
682 682 a->flags & MAP_NORESERVE) {
683 683 seg->s_as->a_resvsize -= seg->s_size;
684 684 }
685 685
686 686 /*
687 687 * If more than one segment in the address space, and they're adjacent
688 688 * virtually, try to concatenate them. Don't concatenate if an
689 689 * explicit anon_map structure was supplied (e.g., SystemV shared
690 690 * memory) or if we'll use text replication for this segment.
691 691 */
692 692 if (a->amp == NULL && !use_rgn && !trok) {
693 693 struct seg *pseg, *nseg;
694 694 struct segvn_data *psvd, *nsvd;
695 695 lgrp_mem_policy_t ppolicy, npolicy;
696 696 uint_t lgrp_mem_policy_flags = 0;
697 697 extern lgrp_mem_policy_t lgrp_mem_default_policy;
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 {
|
↓ open down ↓ |
450 lines elided |
↑ open up ↑ |
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 - ASSERT(AS_WRITE_HELD(seg1->s_as, &seg1->s_as->a_lock));
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;
|
↓ open down ↓ |
224 lines elided |
↑ open up ↑ |
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 - ASSERT(seg1->s_as && AS_WRITE_HELD(seg1->s_as, &seg1->s_as->a_lock));
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)
|
↓ open down ↓ |
100 lines elided |
↑ open up ↑ |
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 - ASSERT(seg2->s_as && AS_WRITE_HELD(seg2->s_as, &seg2->s_as->a_lock));
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
|
↓ open down ↓ |
166 lines elided |
↑ open up ↑ |
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 - ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
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() */
|
↓ open down ↓ |
276 lines elided |
↑ open up ↑ |
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 - ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
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)
|
↓ open down ↓ |
529 lines elided |
↑ open up ↑ |
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 - ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
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)
|
↓ open down ↓ |
129 lines elided |
↑ open up ↑ |
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 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
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 int xhat = 0;
3860 3860 page_t *pplist;
3861 3861 pfn_t pfn;
3862 3862 int physcontig;
3863 3863 int upgrdfail;
3864 3864 int segvn_anypgsz_vnode = 0; /* for now map vnode with 2 page sizes */
3865 3865 int tron = (svd->tr_state == SEGVN_TR_ON);
3866 3866
3867 3867 ASSERT(szc != 0);
3868 3868 ASSERT(vp != NULL);
3869 3869 ASSERT(brkcow == 0 || amp != NULL);
3870 3870 ASSERT(tron == 0 || amp != NULL);
3871 3871 ASSERT(enable_mbit_wa == 0); /* no mbit simulations with large pages */
3872 3872 ASSERT(!(svd->flags & MAP_NORESERVE));
3873 3873 ASSERT(type != F_SOFTUNLOCK);
3874 3874 ASSERT(IS_P2ALIGNED(a, maxpgsz));
3875 3875 ASSERT(amp == NULL || IS_P2ALIGNED(aindx, maxpages));
3876 3876 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
3877 3877 ASSERT(seg->s_szc < NBBY * sizeof (int));
3878 3878 ASSERT(type != F_SOFTLOCK || lpgeaddr - a == maxpgsz);
3879 3879 ASSERT(svd->tr_state != SEGVN_TR_INIT);
3880 3880
3881 3881 VM_STAT_COND_ADD(type == F_SOFTLOCK, segvnvmstats.fltvnpages[0]);
3882 3882 VM_STAT_COND_ADD(type != F_SOFTLOCK, segvnvmstats.fltvnpages[1]);
3883 3883
3884 3884 if (svd->flags & MAP_TEXT) {
3885 3885 hat_flag |= HAT_LOAD_TEXT;
3886 3886 }
3887 3887
3888 3888 if (svd->pageprot) {
3889 3889 switch (rw) {
3890 3890 case S_READ:
3891 3891 protchk = PROT_READ;
3892 3892 break;
3893 3893 case S_WRITE:
3894 3894 protchk = PROT_WRITE;
3895 3895 break;
3896 3896 case S_EXEC:
3897 3897 protchk = PROT_EXEC;
3898 3898 break;
3899 3899 case S_OTHER:
3900 3900 default:
3901 3901 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
3902 3902 break;
3903 3903 }
3904 3904 } else {
3905 3905 prot = svd->prot;
3906 3906 /* caller has already done segment level protection check. */
3907 3907 }
3908 3908
3909 3909 if (seg->s_as->a_hat != hat) {
3910 3910 xhat = 1;
3911 3911 }
3912 3912
3913 3913 if (rw == S_WRITE && segtype == MAP_PRIVATE) {
3914 3914 SEGVN_VMSTAT_FLTVNPAGES(2);
3915 3915 arw = S_READ;
3916 3916 } else {
3917 3917 arw = rw;
3918 3918 }
3919 3919
3920 3920 ppa = kmem_alloc(ppasize, KM_SLEEP);
3921 3921
3922 3922 VM_STAT_COND_ADD(amp != NULL, segvnvmstats.fltvnpages[3]);
3923 3923
3924 3924 for (;;) {
3925 3925 adjszc_chk = 0;
3926 3926 for (; a < lpgeaddr; a += pgsz, off += pgsz, aindx += pages) {
3927 3927 if (adjszc_chk) {
3928 3928 while (szc < seg->s_szc) {
3929 3929 uintptr_t e;
3930 3930 uint_t tszc;
3931 3931 tszc = segvn_anypgsz_vnode ? szc + 1 :
3932 3932 seg->s_szc;
3933 3933 ppgsz = page_get_pagesize(tszc);
3934 3934 if (!IS_P2ALIGNED(a, ppgsz) ||
3935 3935 ((alloc_failed >> tszc) & 0x1)) {
3936 3936 break;
3937 3937 }
3938 3938 SEGVN_VMSTAT_FLTVNPAGES(4);
3939 3939 szc = tszc;
3940 3940 pgsz = ppgsz;
3941 3941 pages = btop(pgsz);
3942 3942 e = P2ROUNDUP((uintptr_t)eaddr, pgsz);
3943 3943 lpgeaddr = (caddr_t)e;
3944 3944 }
3945 3945 }
3946 3946
3947 3947 again:
3948 3948 if (IS_P2ALIGNED(a, maxpgsz) && amp != NULL) {
3949 3949 ASSERT(IS_P2ALIGNED(aindx, maxpages));
3950 3950 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
3951 3951 anon_array_enter(amp, aindx, &an_cookie);
3952 3952 if (anon_get_ptr(amp->ahp, aindx) != NULL) {
3953 3953 SEGVN_VMSTAT_FLTVNPAGES(5);
3954 3954 ASSERT(anon_pages(amp->ahp, aindx,
3955 3955 maxpages) == maxpages);
3956 3956 anon_array_exit(&an_cookie);
3957 3957 ANON_LOCK_EXIT(&->a_rwlock);
3958 3958 err = segvn_fault_anonpages(hat, seg,
3959 3959 a, a + maxpgsz, type, rw,
3960 3960 MAX(a, addr),
3961 3961 MIN(a + maxpgsz, eaddr), brkcow);
3962 3962 if (err != 0) {
3963 3963 SEGVN_VMSTAT_FLTVNPAGES(6);
3964 3964 goto out;
3965 3965 }
3966 3966 if (szc < seg->s_szc) {
3967 3967 szc = seg->s_szc;
3968 3968 pgsz = maxpgsz;
3969 3969 pages = maxpages;
3970 3970 lpgeaddr = maxlpgeaddr;
3971 3971 }
3972 3972 goto next;
3973 3973 } else {
3974 3974 ASSERT(anon_pages(amp->ahp, aindx,
3975 3975 maxpages) == 0);
3976 3976 SEGVN_VMSTAT_FLTVNPAGES(7);
3977 3977 anon_array_exit(&an_cookie);
3978 3978 ANON_LOCK_EXIT(&->a_rwlock);
3979 3979 }
3980 3980 }
3981 3981 ASSERT(!brkcow || IS_P2ALIGNED(a, maxpgsz));
3982 3982 ASSERT(!tron || IS_P2ALIGNED(a, maxpgsz));
3983 3983
3984 3984 if (svd->pageprot != 0 && IS_P2ALIGNED(a, maxpgsz)) {
3985 3985 ASSERT(vpage != NULL);
3986 3986 prot = VPP_PROT(vpage);
3987 3987 ASSERT(sameprot(seg, a, maxpgsz));
3988 3988 if ((prot & protchk) == 0) {
3989 3989 SEGVN_VMSTAT_FLTVNPAGES(8);
3990 3990 err = FC_PROT;
3991 3991 goto out;
3992 3992 }
3993 3993 }
3994 3994 if (type == F_SOFTLOCK) {
3995 3995 atomic_add_long((ulong_t *)&svd->softlockcnt,
3996 3996 pages);
3997 3997 }
3998 3998
3999 3999 pplist = NULL;
4000 4000 physcontig = 0;
4001 4001 ppa[0] = NULL;
4002 4002 if (!brkcow && !tron && szc &&
4003 4003 !page_exists_physcontig(vp, off, szc,
4004 4004 segtype == MAP_PRIVATE ? ppa : NULL)) {
4005 4005 SEGVN_VMSTAT_FLTVNPAGES(9);
4006 4006 if (page_alloc_pages(vp, seg, a, &pplist, NULL,
4007 4007 szc, 0, 0) && type != F_SOFTLOCK) {
4008 4008 SEGVN_VMSTAT_FLTVNPAGES(10);
4009 4009 pszc = 0;
4010 4010 ierr = -1;
4011 4011 alloc_failed |= (1 << szc);
4012 4012 break;
4013 4013 }
4014 4014 if (pplist != NULL &&
4015 4015 vp->v_mpssdata == SEGVN_PAGEIO) {
4016 4016 int downsize;
4017 4017 SEGVN_VMSTAT_FLTVNPAGES(11);
4018 4018 physcontig = segvn_fill_vp_pages(svd,
4019 4019 vp, off, szc, ppa, &pplist,
4020 4020 &pszc, &downsize);
4021 4021 ASSERT(!physcontig || pplist == NULL);
4022 4022 if (!physcontig && downsize &&
4023 4023 type != F_SOFTLOCK) {
4024 4024 ASSERT(pplist == NULL);
4025 4025 SEGVN_VMSTAT_FLTVNPAGES(12);
4026 4026 ierr = -1;
4027 4027 break;
4028 4028 }
4029 4029 ASSERT(!physcontig ||
4030 4030 segtype == MAP_PRIVATE ||
4031 4031 ppa[0] == NULL);
4032 4032 if (physcontig && ppa[0] == NULL) {
4033 4033 physcontig = 0;
4034 4034 }
4035 4035 }
4036 4036 } else if (!brkcow && !tron && szc && ppa[0] != NULL) {
4037 4037 SEGVN_VMSTAT_FLTVNPAGES(13);
4038 4038 ASSERT(segtype == MAP_PRIVATE);
4039 4039 physcontig = 1;
4040 4040 }
4041 4041
4042 4042 if (!physcontig) {
4043 4043 SEGVN_VMSTAT_FLTVNPAGES(14);
4044 4044 ppa[0] = NULL;
4045 4045 ierr = VOP_GETPAGE(vp, (offset_t)off, pgsz,
4046 4046 &vpprot, ppa, pgsz, seg, a, arw,
4047 4047 svd->cred, NULL);
4048 4048 #ifdef DEBUG
4049 4049 if (ierr == 0) {
4050 4050 for (i = 0; i < pages; i++) {
4051 4051 ASSERT(PAGE_LOCKED(ppa[i]));
4052 4052 ASSERT(!PP_ISFREE(ppa[i]));
4053 4053 ASSERT(ppa[i]->p_vnode == vp);
4054 4054 ASSERT(ppa[i]->p_offset ==
4055 4055 off + (i << PAGESHIFT));
4056 4056 }
4057 4057 }
4058 4058 #endif /* DEBUG */
4059 4059 if (segtype == MAP_PRIVATE) {
4060 4060 SEGVN_VMSTAT_FLTVNPAGES(15);
4061 4061 vpprot &= ~PROT_WRITE;
4062 4062 }
4063 4063 } else {
4064 4064 ASSERT(segtype == MAP_PRIVATE);
4065 4065 SEGVN_VMSTAT_FLTVNPAGES(16);
4066 4066 vpprot = PROT_ALL & ~PROT_WRITE;
4067 4067 ierr = 0;
4068 4068 }
4069 4069
4070 4070 if (ierr != 0) {
4071 4071 SEGVN_VMSTAT_FLTVNPAGES(17);
4072 4072 if (pplist != NULL) {
4073 4073 SEGVN_VMSTAT_FLTVNPAGES(18);
4074 4074 page_free_replacement_page(pplist);
4075 4075 page_create_putback(pages);
4076 4076 }
4077 4077 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4078 4078 if (a + pgsz <= eaddr) {
4079 4079 SEGVN_VMSTAT_FLTVNPAGES(19);
4080 4080 err = FC_MAKE_ERR(ierr);
4081 4081 goto out;
4082 4082 }
4083 4083 va.va_mask = AT_SIZE;
4084 4084 if (VOP_GETATTR(vp, &va, 0, svd->cred, NULL)) {
4085 4085 SEGVN_VMSTAT_FLTVNPAGES(20);
4086 4086 err = FC_MAKE_ERR(EIO);
4087 4087 goto out;
4088 4088 }
4089 4089 if (btopr(va.va_size) >= btopr(off + pgsz)) {
4090 4090 SEGVN_VMSTAT_FLTVNPAGES(21);
4091 4091 err = FC_MAKE_ERR(ierr);
4092 4092 goto out;
4093 4093 }
4094 4094 if (btopr(va.va_size) <
4095 4095 btopr(off + (eaddr - a))) {
4096 4096 SEGVN_VMSTAT_FLTVNPAGES(22);
4097 4097 err = FC_MAKE_ERR(ierr);
4098 4098 goto out;
4099 4099 }
4100 4100 if (brkcow || tron || type == F_SOFTLOCK) {
4101 4101 /* can't reduce map area */
4102 4102 SEGVN_VMSTAT_FLTVNPAGES(23);
4103 4103 vop_size_err = 1;
4104 4104 goto out;
4105 4105 }
4106 4106 SEGVN_VMSTAT_FLTVNPAGES(24);
4107 4107 ASSERT(szc != 0);
4108 4108 pszc = 0;
4109 4109 ierr = -1;
4110 4110 break;
4111 4111 }
4112 4112
4113 4113 if (amp != NULL) {
4114 4114 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
4115 4115 anon_array_enter(amp, aindx, &an_cookie);
4116 4116 }
4117 4117 if (amp != NULL &&
4118 4118 anon_get_ptr(amp->ahp, aindx) != NULL) {
4119 4119 ulong_t taindx = P2ALIGN(aindx, maxpages);
4120 4120
4121 4121 SEGVN_VMSTAT_FLTVNPAGES(25);
4122 4122 ASSERT(anon_pages(amp->ahp, taindx,
4123 4123 maxpages) == maxpages);
4124 4124 for (i = 0; i < pages; i++) {
4125 4125 page_unlock(ppa[i]);
4126 4126 }
4127 4127 anon_array_exit(&an_cookie);
4128 4128 ANON_LOCK_EXIT(&->a_rwlock);
4129 4129 if (pplist != NULL) {
4130 4130 page_free_replacement_page(pplist);
4131 4131 page_create_putback(pages);
4132 4132 }
4133 4133 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4134 4134 if (szc < seg->s_szc) {
4135 4135 SEGVN_VMSTAT_FLTVNPAGES(26);
4136 4136 /*
4137 4137 * For private segments SOFTLOCK
4138 4138 * either always breaks cow (any rw
4139 4139 * type except S_READ_NOCOW) or
4140 4140 * address space is locked as writer
4141 4141 * (S_READ_NOCOW case) and anon slots
4142 4142 * can't show up on second check.
4143 4143 * Therefore if we are here for
4144 4144 * SOFTLOCK case it must be a cow
4145 4145 * break but cow break never reduces
4146 4146 * szc. text replication (tron) in
4147 4147 * this case works as cow break.
4148 4148 * Thus the assert below.
4149 4149 */
4150 4150 ASSERT(!brkcow && !tron &&
4151 4151 type != F_SOFTLOCK);
4152 4152 pszc = seg->s_szc;
4153 4153 ierr = -2;
4154 4154 break;
4155 4155 }
4156 4156 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4157 4157 goto again;
4158 4158 }
4159 4159 #ifdef DEBUG
4160 4160 if (amp != NULL) {
4161 4161 ulong_t taindx = P2ALIGN(aindx, maxpages);
4162 4162 ASSERT(!anon_pages(amp->ahp, taindx, maxpages));
4163 4163 }
4164 4164 #endif /* DEBUG */
4165 4165
4166 4166 if (brkcow || tron) {
4167 4167 ASSERT(amp != NULL);
4168 4168 ASSERT(pplist == NULL);
4169 4169 ASSERT(szc == seg->s_szc);
4170 4170 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4171 4171 ASSERT(IS_P2ALIGNED(aindx, maxpages));
4172 4172 SEGVN_VMSTAT_FLTVNPAGES(27);
4173 4173 ierr = anon_map_privatepages(amp, aindx, szc,
4174 4174 seg, a, prot, ppa, vpage, segvn_anypgsz,
4175 4175 tron ? PG_LOCAL : 0, svd->cred);
4176 4176 if (ierr != 0) {
4177 4177 SEGVN_VMSTAT_FLTVNPAGES(28);
4178 4178 anon_array_exit(&an_cookie);
4179 4179 ANON_LOCK_EXIT(&->a_rwlock);
4180 4180 SEGVN_RESTORE_SOFTLOCK_VP(type, pages);
4181 4181 err = FC_MAKE_ERR(ierr);
4182 4182 goto out;
4183 4183 }
4184 4184
4185 4185 ASSERT(!IS_VMODSORT(ppa[0]->p_vnode));
4186 4186 /*
4187 4187 * p_szc can't be changed for locked
4188 4188 * swapfs pages.
4189 4189 */
4190 4190 ASSERT(svd->rcookie ==
4191 4191 HAT_INVALID_REGION_COOKIE);
4192 4192 hat_memload_array(hat, a, pgsz, ppa, prot,
4193 4193 hat_flag);
4194 4194
4195 4195 if (!(hat_flag & HAT_LOAD_LOCK)) {
4196 4196 SEGVN_VMSTAT_FLTVNPAGES(29);
4197 4197 for (i = 0; i < pages; i++) {
4198 4198 page_unlock(ppa[i]);
4199 4199 }
4200 4200 }
4201 4201 anon_array_exit(&an_cookie);
4202 4202 ANON_LOCK_EXIT(&->a_rwlock);
4203 4203 goto next;
4204 4204 }
4205 4205
4206 4206 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE ||
4207 4207 (!svd->pageprot && svd->prot == (prot & vpprot)));
4208 4208
4209 4209 pfn = page_pptonum(ppa[0]);
4210 4210 /*
4211 4211 * hat_page_demote() needs an SE_EXCL lock on one of
4212 4212 * constituent page_t's and it decreases root's p_szc
4213 4213 * last. This means if root's p_szc is equal szc and
4214 4214 * all its constituent pages are locked
4215 4215 * hat_page_demote() that could have changed p_szc to
4216 4216 * szc is already done and no new have page_demote()
4217 4217 * can start for this large page.
4218 4218 */
4219 4219
4220 4220 /*
4221 4221 * we need to make sure same mapping size is used for
4222 4222 * the same address range if there's a possibility the
4223 4223 * adddress is already mapped because hat layer panics
4224 4224 * when translation is loaded for the range already
4225 4225 * mapped with a different page size. We achieve it
4226 4226 * by always using largest page size possible subject
4227 4227 * to the constraints of page size, segment page size
4228 4228 * and page alignment. Since mappings are invalidated
4229 4229 * when those constraints change and make it
4230 4230 * impossible to use previously used mapping size no
4231 4231 * mapping size conflicts should happen.
4232 4232 */
4233 4233
4234 4234 chkszc:
4235 4235 if ((pszc = ppa[0]->p_szc) == szc &&
4236 4236 IS_P2ALIGNED(pfn, pages)) {
4237 4237
4238 4238 SEGVN_VMSTAT_FLTVNPAGES(30);
4239 4239 #ifdef DEBUG
4240 4240 for (i = 0; i < pages; i++) {
4241 4241 ASSERT(PAGE_LOCKED(ppa[i]));
4242 4242 ASSERT(!PP_ISFREE(ppa[i]));
4243 4243 ASSERT(page_pptonum(ppa[i]) ==
4244 4244 pfn + i);
4245 4245 ASSERT(ppa[i]->p_szc == szc);
4246 4246 ASSERT(ppa[i]->p_vnode == vp);
4247 4247 ASSERT(ppa[i]->p_offset ==
4248 4248 off + (i << PAGESHIFT));
4249 4249 }
4250 4250 #endif /* DEBUG */
4251 4251 /*
4252 4252 * All pages are of szc we need and they are
4253 4253 * all locked so they can't change szc. load
4254 4254 * translations.
4255 4255 *
4256 4256 * if page got promoted since last check
4257 4257 * we don't need pplist.
4258 4258 */
4259 4259 if (pplist != NULL) {
4260 4260 page_free_replacement_page(pplist);
4261 4261 page_create_putback(pages);
4262 4262 }
4263 4263 if (PP_ISMIGRATE(ppa[0])) {
4264 4264 page_migrate(seg, a, ppa, pages);
4265 4265 }
4266 4266 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4267 4267 prot, vpprot);
4268 4268 if (!xhat) {
4269 4269 hat_memload_array_region(hat, a, pgsz,
4270 4270 ppa, prot & vpprot, hat_flag,
4271 4271 svd->rcookie);
4272 4272 } else {
4273 4273 /*
4274 4274 * avoid large xhat mappings to FS
4275 4275 * pages so that hat_page_demote()
4276 4276 * doesn't need to check for xhat
4277 4277 * large mappings.
4278 4278 * Don't use regions with xhats.
4279 4279 */
4280 4280 for (i = 0; i < pages; i++) {
4281 4281 hat_memload(hat,
4282 4282 a + (i << PAGESHIFT),
4283 4283 ppa[i], prot & vpprot,
4284 4284 hat_flag);
4285 4285 }
4286 4286 }
4287 4287
4288 4288 if (!(hat_flag & HAT_LOAD_LOCK)) {
4289 4289 for (i = 0; i < pages; i++) {
4290 4290 page_unlock(ppa[i]);
4291 4291 }
4292 4292 }
4293 4293 if (amp != NULL) {
4294 4294 anon_array_exit(&an_cookie);
4295 4295 ANON_LOCK_EXIT(&->a_rwlock);
4296 4296 }
4297 4297 goto next;
4298 4298 }
4299 4299
4300 4300 /*
4301 4301 * See if upsize is possible.
4302 4302 */
4303 4303 if (pszc > szc && szc < seg->s_szc &&
4304 4304 (segvn_anypgsz_vnode || pszc >= seg->s_szc)) {
4305 4305 pgcnt_t aphase;
4306 4306 uint_t pszc1 = MIN(pszc, seg->s_szc);
4307 4307 ppgsz = page_get_pagesize(pszc1);
4308 4308 ppages = btop(ppgsz);
4309 4309 aphase = btop(P2PHASE((uintptr_t)a, ppgsz));
4310 4310
4311 4311 ASSERT(type != F_SOFTLOCK);
4312 4312
4313 4313 SEGVN_VMSTAT_FLTVNPAGES(31);
4314 4314 if (aphase != P2PHASE(pfn, ppages)) {
4315 4315 segvn_faultvnmpss_align_err4++;
4316 4316 } else {
4317 4317 SEGVN_VMSTAT_FLTVNPAGES(32);
4318 4318 if (pplist != NULL) {
4319 4319 page_t *pl = pplist;
4320 4320 page_free_replacement_page(pl);
4321 4321 page_create_putback(pages);
4322 4322 }
4323 4323 for (i = 0; i < pages; i++) {
4324 4324 page_unlock(ppa[i]);
4325 4325 }
4326 4326 if (amp != NULL) {
4327 4327 anon_array_exit(&an_cookie);
4328 4328 ANON_LOCK_EXIT(&->a_rwlock);
4329 4329 }
4330 4330 pszc = pszc1;
4331 4331 ierr = -2;
4332 4332 break;
4333 4333 }
4334 4334 }
4335 4335
4336 4336 /*
4337 4337 * check if we should use smallest mapping size.
4338 4338 */
4339 4339 upgrdfail = 0;
4340 4340 if (szc == 0 || xhat ||
4341 4341 (pszc >= szc &&
4342 4342 !IS_P2ALIGNED(pfn, pages)) ||
4343 4343 (pszc < szc &&
4344 4344 !segvn_full_szcpages(ppa, szc, &upgrdfail,
4345 4345 &pszc))) {
4346 4346
4347 4347 if (upgrdfail && type != F_SOFTLOCK) {
4348 4348 /*
4349 4349 * segvn_full_szcpages failed to lock
4350 4350 * all pages EXCL. Size down.
4351 4351 */
4352 4352 ASSERT(pszc < szc);
4353 4353
4354 4354 SEGVN_VMSTAT_FLTVNPAGES(33);
4355 4355
4356 4356 if (pplist != NULL) {
4357 4357 page_t *pl = pplist;
4358 4358 page_free_replacement_page(pl);
4359 4359 page_create_putback(pages);
4360 4360 }
4361 4361
4362 4362 for (i = 0; i < pages; i++) {
4363 4363 page_unlock(ppa[i]);
4364 4364 }
4365 4365 if (amp != NULL) {
4366 4366 anon_array_exit(&an_cookie);
4367 4367 ANON_LOCK_EXIT(&->a_rwlock);
4368 4368 }
4369 4369 ierr = -1;
4370 4370 break;
4371 4371 }
4372 4372 if (szc != 0 && !xhat && !upgrdfail) {
4373 4373 segvn_faultvnmpss_align_err5++;
4374 4374 }
4375 4375 SEGVN_VMSTAT_FLTVNPAGES(34);
4376 4376 if (pplist != NULL) {
4377 4377 page_free_replacement_page(pplist);
4378 4378 page_create_putback(pages);
4379 4379 }
4380 4380 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4381 4381 prot, vpprot);
4382 4382 if (upgrdfail && segvn_anypgsz_vnode) {
4383 4383 /* SOFTLOCK case */
4384 4384 hat_memload_array_region(hat, a, pgsz,
4385 4385 ppa, prot & vpprot, hat_flag,
4386 4386 svd->rcookie);
4387 4387 } else {
4388 4388 for (i = 0; i < pages; i++) {
4389 4389 hat_memload_region(hat,
4390 4390 a + (i << PAGESHIFT),
4391 4391 ppa[i], prot & vpprot,
4392 4392 hat_flag, svd->rcookie);
4393 4393 }
4394 4394 }
4395 4395 if (!(hat_flag & HAT_LOAD_LOCK)) {
4396 4396 for (i = 0; i < pages; i++) {
4397 4397 page_unlock(ppa[i]);
4398 4398 }
4399 4399 }
4400 4400 if (amp != NULL) {
4401 4401 anon_array_exit(&an_cookie);
4402 4402 ANON_LOCK_EXIT(&->a_rwlock);
4403 4403 }
4404 4404 goto next;
4405 4405 }
4406 4406
4407 4407 if (pszc == szc) {
4408 4408 /*
4409 4409 * segvn_full_szcpages() upgraded pages szc.
4410 4410 */
4411 4411 ASSERT(pszc == ppa[0]->p_szc);
4412 4412 ASSERT(IS_P2ALIGNED(pfn, pages));
4413 4413 goto chkszc;
4414 4414 }
4415 4415
4416 4416 if (pszc > szc) {
4417 4417 kmutex_t *szcmtx;
4418 4418 SEGVN_VMSTAT_FLTVNPAGES(35);
4419 4419 /*
4420 4420 * p_szc of ppa[0] can change since we haven't
4421 4421 * locked all constituent pages. Call
4422 4422 * page_lock_szc() to prevent szc changes.
4423 4423 * This should be a rare case that happens when
4424 4424 * multiple segments use a different page size
4425 4425 * to map the same file offsets.
4426 4426 */
4427 4427 szcmtx = page_szc_lock(ppa[0]);
4428 4428 pszc = ppa[0]->p_szc;
4429 4429 ASSERT(szcmtx != NULL || pszc == 0);
4430 4430 ASSERT(ppa[0]->p_szc <= pszc);
4431 4431 if (pszc <= szc) {
4432 4432 SEGVN_VMSTAT_FLTVNPAGES(36);
4433 4433 if (szcmtx != NULL) {
4434 4434 mutex_exit(szcmtx);
4435 4435 }
4436 4436 goto chkszc;
4437 4437 }
4438 4438 if (pplist != NULL) {
4439 4439 /*
4440 4440 * page got promoted since last check.
4441 4441 * we don't need preaalocated large
4442 4442 * page.
4443 4443 */
4444 4444 SEGVN_VMSTAT_FLTVNPAGES(37);
4445 4445 page_free_replacement_page(pplist);
4446 4446 page_create_putback(pages);
4447 4447 }
4448 4448 SEGVN_UPDATE_MODBITS(ppa, pages, rw,
4449 4449 prot, vpprot);
4450 4450 hat_memload_array_region(hat, a, pgsz, ppa,
4451 4451 prot & vpprot, hat_flag, svd->rcookie);
4452 4452 mutex_exit(szcmtx);
4453 4453 if (!(hat_flag & HAT_LOAD_LOCK)) {
4454 4454 for (i = 0; i < pages; i++) {
4455 4455 page_unlock(ppa[i]);
4456 4456 }
4457 4457 }
4458 4458 if (amp != NULL) {
4459 4459 anon_array_exit(&an_cookie);
4460 4460 ANON_LOCK_EXIT(&->a_rwlock);
4461 4461 }
4462 4462 goto next;
4463 4463 }
4464 4464
4465 4465 /*
4466 4466 * if page got demoted since last check
4467 4467 * we could have not allocated larger page.
4468 4468 * allocate now.
4469 4469 */
4470 4470 if (pplist == NULL &&
4471 4471 page_alloc_pages(vp, seg, a, &pplist, NULL,
4472 4472 szc, 0, 0) && type != F_SOFTLOCK) {
4473 4473 SEGVN_VMSTAT_FLTVNPAGES(38);
4474 4474 for (i = 0; i < pages; i++) {
4475 4475 page_unlock(ppa[i]);
4476 4476 }
4477 4477 if (amp != NULL) {
4478 4478 anon_array_exit(&an_cookie);
4479 4479 ANON_LOCK_EXIT(&->a_rwlock);
4480 4480 }
4481 4481 ierr = -1;
4482 4482 alloc_failed |= (1 << szc);
4483 4483 break;
4484 4484 }
4485 4485
4486 4486 SEGVN_VMSTAT_FLTVNPAGES(39);
4487 4487
4488 4488 if (pplist != NULL) {
4489 4489 segvn_relocate_pages(ppa, pplist);
4490 4490 #ifdef DEBUG
4491 4491 } else {
4492 4492 ASSERT(type == F_SOFTLOCK);
4493 4493 SEGVN_VMSTAT_FLTVNPAGES(40);
4494 4494 #endif /* DEBUG */
4495 4495 }
4496 4496
4497 4497 SEGVN_UPDATE_MODBITS(ppa, pages, rw, prot, vpprot);
4498 4498
4499 4499 if (pplist == NULL && segvn_anypgsz_vnode == 0) {
4500 4500 ASSERT(type == F_SOFTLOCK);
4501 4501 for (i = 0; i < pages; i++) {
4502 4502 ASSERT(ppa[i]->p_szc < szc);
4503 4503 hat_memload_region(hat,
4504 4504 a + (i << PAGESHIFT),
4505 4505 ppa[i], prot & vpprot, hat_flag,
4506 4506 svd->rcookie);
4507 4507 }
4508 4508 } else {
4509 4509 ASSERT(pplist != NULL || type == F_SOFTLOCK);
4510 4510 hat_memload_array_region(hat, a, pgsz, ppa,
4511 4511 prot & vpprot, hat_flag, svd->rcookie);
4512 4512 }
4513 4513 if (!(hat_flag & HAT_LOAD_LOCK)) {
4514 4514 for (i = 0; i < pages; i++) {
4515 4515 ASSERT(PAGE_SHARED(ppa[i]));
4516 4516 page_unlock(ppa[i]);
4517 4517 }
4518 4518 }
4519 4519 if (amp != NULL) {
4520 4520 anon_array_exit(&an_cookie);
4521 4521 ANON_LOCK_EXIT(&->a_rwlock);
4522 4522 }
4523 4523
4524 4524 next:
4525 4525 if (vpage != NULL) {
4526 4526 vpage += pages;
4527 4527 }
4528 4528 adjszc_chk = 1;
4529 4529 }
4530 4530 if (a == lpgeaddr)
4531 4531 break;
4532 4532 ASSERT(a < lpgeaddr);
4533 4533
4534 4534 ASSERT(!brkcow && !tron && type != F_SOFTLOCK);
4535 4535
4536 4536 /*
4537 4537 * ierr == -1 means we failed to map with a large page.
4538 4538 * (either due to allocation/relocation failures or
4539 4539 * misalignment with other mappings to this file.
4540 4540 *
4541 4541 * ierr == -2 means some other thread allocated a large page
4542 4542 * after we gave up tp map with a large page. retry with
4543 4543 * larger mapping.
4544 4544 */
4545 4545 ASSERT(ierr == -1 || ierr == -2);
4546 4546 ASSERT(ierr == -2 || szc != 0);
4547 4547 ASSERT(ierr == -1 || szc < seg->s_szc);
4548 4548 if (ierr == -2) {
4549 4549 SEGVN_VMSTAT_FLTVNPAGES(41);
4550 4550 ASSERT(pszc > szc && pszc <= seg->s_szc);
4551 4551 szc = pszc;
4552 4552 } else if (segvn_anypgsz_vnode) {
4553 4553 SEGVN_VMSTAT_FLTVNPAGES(42);
4554 4554 szc--;
4555 4555 } else {
4556 4556 SEGVN_VMSTAT_FLTVNPAGES(43);
4557 4557 ASSERT(pszc < szc);
4558 4558 /*
4559 4559 * other process created pszc large page.
4560 4560 * but we still have to drop to 0 szc.
4561 4561 */
4562 4562 szc = 0;
4563 4563 }
4564 4564
4565 4565 pgsz = page_get_pagesize(szc);
4566 4566 pages = btop(pgsz);
4567 4567 if (ierr == -2) {
4568 4568 /*
4569 4569 * Size up case. Note lpgaddr may only be needed for
4570 4570 * softlock case so we don't adjust it here.
4571 4571 */
4572 4572 a = (caddr_t)P2ALIGN((uintptr_t)a, pgsz);
4573 4573 ASSERT(a >= lpgaddr);
4574 4574 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4575 4575 off = svd->offset + (uintptr_t)(a - seg->s_base);
4576 4576 aindx = svd->anon_index + seg_page(seg, a);
4577 4577 vpage = (svd->vpage != NULL) ?
4578 4578 &svd->vpage[seg_page(seg, a)] : NULL;
4579 4579 } else {
4580 4580 /*
4581 4581 * Size down case. Note lpgaddr may only be needed for
4582 4582 * softlock case so we don't adjust it here.
4583 4583 */
4584 4584 ASSERT(IS_P2ALIGNED(a, pgsz));
4585 4585 ASSERT(IS_P2ALIGNED(lpgeaddr, pgsz));
4586 4586 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4587 4587 ASSERT(a < lpgeaddr);
4588 4588 if (a < addr) {
4589 4589 SEGVN_VMSTAT_FLTVNPAGES(44);
4590 4590 /*
4591 4591 * The beginning of the large page region can
4592 4592 * be pulled to the right to make a smaller
4593 4593 * region. We haven't yet faulted a single
4594 4594 * page.
4595 4595 */
4596 4596 a = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
4597 4597 ASSERT(a >= lpgaddr);
4598 4598 off = svd->offset +
4599 4599 (uintptr_t)(a - seg->s_base);
4600 4600 aindx = svd->anon_index + seg_page(seg, a);
4601 4601 vpage = (svd->vpage != NULL) ?
4602 4602 &svd->vpage[seg_page(seg, a)] : NULL;
4603 4603 }
4604 4604 }
4605 4605 }
4606 4606 out:
4607 4607 kmem_free(ppa, ppasize);
4608 4608 if (!err && !vop_size_err) {
4609 4609 SEGVN_VMSTAT_FLTVNPAGES(45);
4610 4610 return (0);
4611 4611 }
4612 4612 if (type == F_SOFTLOCK && a > lpgaddr) {
4613 4613 SEGVN_VMSTAT_FLTVNPAGES(46);
4614 4614 segvn_softunlock(seg, lpgaddr, a - lpgaddr, S_OTHER);
4615 4615 }
4616 4616 if (!vop_size_err) {
4617 4617 SEGVN_VMSTAT_FLTVNPAGES(47);
4618 4618 return (err);
4619 4619 }
4620 4620 ASSERT(brkcow || tron || type == F_SOFTLOCK);
4621 4621 /*
4622 4622 * Large page end is mapped beyond the end of file and it's a cow
4623 4623 * fault (can be a text replication induced cow) or softlock so we can't
4624 4624 * reduce the map area. For now just demote the segment. This should
4625 4625 * really only happen if the end of the file changed after the mapping
4626 4626 * was established since when large page segments are created we make
4627 4627 * sure they don't extend beyond the end of the file.
4628 4628 */
4629 4629 SEGVN_VMSTAT_FLTVNPAGES(48);
4630 4630
4631 4631 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4632 4632 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
4633 4633 err = 0;
4634 4634 if (seg->s_szc != 0) {
4635 4635 segvn_fltvnpages_clrszc_cnt++;
4636 4636 ASSERT(svd->softlockcnt == 0);
4637 4637 err = segvn_clrszc(seg);
4638 4638 if (err != 0) {
4639 4639 segvn_fltvnpages_clrszc_err++;
4640 4640 }
4641 4641 }
4642 4642 ASSERT(err || seg->s_szc == 0);
4643 4643 SEGVN_LOCK_DOWNGRADE(seg->s_as, &svd->lock);
4644 4644 /* segvn_fault will do its job as if szc had been zero to begin with */
4645 4645 return (err == 0 ? IE_RETRY : FC_MAKE_ERR(err));
4646 4646 }
4647 4647
4648 4648 /*
4649 4649 * This routine will attempt to fault in one large page.
4650 4650 * it will use smaller pages if that fails.
4651 4651 * It should only be called for pure anonymous segments.
4652 4652 */
4653 4653 static faultcode_t
4654 4654 segvn_fault_anonpages(struct hat *hat, struct seg *seg, caddr_t lpgaddr,
4655 4655 caddr_t lpgeaddr, enum fault_type type, enum seg_rw rw, caddr_t addr,
4656 4656 caddr_t eaddr, int brkcow)
4657 4657 {
4658 4658 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
4659 4659 struct anon_map *amp = svd->amp;
4660 4660 uchar_t segtype = svd->type;
4661 4661 uint_t szc = seg->s_szc;
4662 4662 size_t pgsz = page_get_pagesize(szc);
4663 4663 size_t maxpgsz = pgsz;
4664 4664 pgcnt_t pages = btop(pgsz);
4665 4665 uint_t ppaszc = szc;
4666 4666 caddr_t a = lpgaddr;
4667 4667 ulong_t aindx = svd->anon_index + seg_page(seg, a);
4668 4668 struct vpage *vpage = (svd->vpage != NULL) ?
4669 4669 &svd->vpage[seg_page(seg, a)] : NULL;
4670 4670 page_t **ppa;
4671 4671 uint_t ppa_szc;
4672 4672 faultcode_t err;
4673 4673 int ierr;
4674 4674 uint_t protchk, prot, vpprot;
4675 4675 ulong_t i;
4676 4676 int hat_flag = (type == F_SOFTLOCK) ? HAT_LOAD_LOCK : HAT_LOAD;
4677 4677 anon_sync_obj_t cookie;
4678 4678 int adjszc_chk;
4679 4679 int pgflags = (svd->tr_state == SEGVN_TR_ON) ? PG_LOCAL : 0;
4680 4680
4681 4681 ASSERT(szc != 0);
4682 4682 ASSERT(amp != NULL);
4683 4683 ASSERT(enable_mbit_wa == 0); /* no mbit simulations with large pages */
4684 4684 ASSERT(!(svd->flags & MAP_NORESERVE));
4685 4685 ASSERT(type != F_SOFTUNLOCK);
4686 4686 ASSERT(IS_P2ALIGNED(a, maxpgsz));
4687 4687 ASSERT(!brkcow || svd->tr_state == SEGVN_TR_OFF);
4688 4688 ASSERT(svd->tr_state != SEGVN_TR_INIT);
4689 4689
4690 4690 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
4691 4691
4692 4692 VM_STAT_COND_ADD(type == F_SOFTLOCK, segvnvmstats.fltanpages[0]);
4693 4693 VM_STAT_COND_ADD(type != F_SOFTLOCK, segvnvmstats.fltanpages[1]);
4694 4694
4695 4695 if (svd->flags & MAP_TEXT) {
4696 4696 hat_flag |= HAT_LOAD_TEXT;
4697 4697 }
4698 4698
4699 4699 if (svd->pageprot) {
4700 4700 switch (rw) {
4701 4701 case S_READ:
4702 4702 protchk = PROT_READ;
4703 4703 break;
4704 4704 case S_WRITE:
4705 4705 protchk = PROT_WRITE;
4706 4706 break;
4707 4707 case S_EXEC:
4708 4708 protchk = PROT_EXEC;
4709 4709 break;
4710 4710 case S_OTHER:
4711 4711 default:
4712 4712 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
4713 4713 break;
4714 4714 }
4715 4715 VM_STAT_ADD(segvnvmstats.fltanpages[2]);
4716 4716 } else {
4717 4717 prot = svd->prot;
4718 4718 /* caller has already done segment level protection check. */
4719 4719 }
4720 4720
4721 4721 ppa = kmem_cache_alloc(segvn_szc_cache[ppaszc], KM_SLEEP);
4722 4722 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
4723 4723 for (;;) {
4724 4724 adjszc_chk = 0;
4725 4725 for (; a < lpgeaddr; a += pgsz, aindx += pages) {
4726 4726 if (svd->pageprot != 0 && IS_P2ALIGNED(a, maxpgsz)) {
4727 4727 VM_STAT_ADD(segvnvmstats.fltanpages[3]);
4728 4728 ASSERT(vpage != NULL);
4729 4729 prot = VPP_PROT(vpage);
4730 4730 ASSERT(sameprot(seg, a, maxpgsz));
4731 4731 if ((prot & protchk) == 0) {
4732 4732 err = FC_PROT;
4733 4733 goto error;
4734 4734 }
4735 4735 }
4736 4736 if (adjszc_chk && IS_P2ALIGNED(a, maxpgsz) &&
4737 4737 pgsz < maxpgsz) {
4738 4738 ASSERT(a > lpgaddr);
4739 4739 szc = seg->s_szc;
4740 4740 pgsz = maxpgsz;
4741 4741 pages = btop(pgsz);
4742 4742 ASSERT(IS_P2ALIGNED(aindx, pages));
4743 4743 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr,
4744 4744 pgsz);
4745 4745 }
4746 4746 if (type == F_SOFTLOCK) {
4747 4747 atomic_add_long((ulong_t *)&svd->softlockcnt,
4748 4748 pages);
4749 4749 }
4750 4750 anon_array_enter(amp, aindx, &cookie);
4751 4751 ppa_szc = (uint_t)-1;
4752 4752 ierr = anon_map_getpages(amp, aindx, szc, seg, a,
4753 4753 prot, &vpprot, ppa, &ppa_szc, vpage, rw, brkcow,
4754 4754 segvn_anypgsz, pgflags, svd->cred);
4755 4755 if (ierr != 0) {
4756 4756 anon_array_exit(&cookie);
4757 4757 VM_STAT_ADD(segvnvmstats.fltanpages[4]);
4758 4758 if (type == F_SOFTLOCK) {
4759 4759 atomic_add_long(
4760 4760 (ulong_t *)&svd->softlockcnt,
4761 4761 -pages);
4762 4762 }
4763 4763 if (ierr > 0) {
4764 4764 VM_STAT_ADD(segvnvmstats.fltanpages[6]);
4765 4765 err = FC_MAKE_ERR(ierr);
4766 4766 goto error;
4767 4767 }
4768 4768 break;
4769 4769 }
4770 4770
4771 4771 ASSERT(!IS_VMODSORT(ppa[0]->p_vnode));
4772 4772
4773 4773 ASSERT(segtype == MAP_SHARED ||
4774 4774 ppa[0]->p_szc <= szc);
4775 4775 ASSERT(segtype == MAP_PRIVATE ||
4776 4776 ppa[0]->p_szc >= szc);
4777 4777
4778 4778 /*
4779 4779 * Handle pages that have been marked for migration
4780 4780 */
4781 4781 if (lgrp_optimizations())
4782 4782 page_migrate(seg, a, ppa, pages);
4783 4783
4784 4784 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
4785 4785
4786 4786 if (segtype == MAP_SHARED) {
4787 4787 vpprot |= PROT_WRITE;
4788 4788 }
4789 4789
4790 4790 hat_memload_array(hat, a, pgsz, ppa,
4791 4791 prot & vpprot, hat_flag);
4792 4792
4793 4793 if (hat_flag & HAT_LOAD_LOCK) {
4794 4794 VM_STAT_ADD(segvnvmstats.fltanpages[7]);
4795 4795 } else {
4796 4796 VM_STAT_ADD(segvnvmstats.fltanpages[8]);
4797 4797 for (i = 0; i < pages; i++)
4798 4798 page_unlock(ppa[i]);
4799 4799 }
4800 4800 if (vpage != NULL)
4801 4801 vpage += pages;
4802 4802
4803 4803 anon_array_exit(&cookie);
4804 4804 adjszc_chk = 1;
4805 4805 }
4806 4806 if (a == lpgeaddr)
4807 4807 break;
4808 4808 ASSERT(a < lpgeaddr);
4809 4809 /*
4810 4810 * ierr == -1 means we failed to allocate a large page.
4811 4811 * so do a size down operation.
4812 4812 *
4813 4813 * ierr == -2 means some other process that privately shares
4814 4814 * pages with this process has allocated a larger page and we
4815 4815 * need to retry with larger pages. So do a size up
4816 4816 * operation. This relies on the fact that large pages are
4817 4817 * never partially shared i.e. if we share any constituent
4818 4818 * page of a large page with another process we must share the
4819 4819 * entire large page. Note this cannot happen for SOFTLOCK
4820 4820 * case, unless current address (a) is at the beginning of the
4821 4821 * next page size boundary because the other process couldn't
4822 4822 * have relocated locked pages.
4823 4823 */
4824 4824 ASSERT(ierr == -1 || ierr == -2);
4825 4825
4826 4826 if (segvn_anypgsz) {
4827 4827 ASSERT(ierr == -2 || szc != 0);
4828 4828 ASSERT(ierr == -1 || szc < seg->s_szc);
4829 4829 szc = (ierr == -1) ? szc - 1 : szc + 1;
4830 4830 } else {
4831 4831 /*
4832 4832 * For non COW faults and segvn_anypgsz == 0
4833 4833 * we need to be careful not to loop forever
4834 4834 * if existing page is found with szc other
4835 4835 * than 0 or seg->s_szc. This could be due
4836 4836 * to page relocations on behalf of DR or
4837 4837 * more likely large page creation. For this
4838 4838 * case simply re-size to existing page's szc
4839 4839 * if returned by anon_map_getpages().
4840 4840 */
4841 4841 if (ppa_szc == (uint_t)-1) {
4842 4842 szc = (ierr == -1) ? 0 : seg->s_szc;
4843 4843 } else {
4844 4844 ASSERT(ppa_szc <= seg->s_szc);
4845 4845 ASSERT(ierr == -2 || ppa_szc < szc);
4846 4846 ASSERT(ierr == -1 || ppa_szc > szc);
4847 4847 szc = ppa_szc;
4848 4848 }
4849 4849 }
4850 4850
4851 4851 pgsz = page_get_pagesize(szc);
4852 4852 pages = btop(pgsz);
4853 4853 ASSERT(type != F_SOFTLOCK || ierr == -1 ||
4854 4854 (IS_P2ALIGNED(a, pgsz) && IS_P2ALIGNED(lpgeaddr, pgsz)));
4855 4855 if (type == F_SOFTLOCK) {
4856 4856 /*
4857 4857 * For softlocks we cannot reduce the fault area
4858 4858 * (calculated based on the largest page size for this
4859 4859 * segment) for size down and a is already next
4860 4860 * page size aligned as assertted above for size
4861 4861 * ups. Therefore just continue in case of softlock.
4862 4862 */
4863 4863 VM_STAT_ADD(segvnvmstats.fltanpages[9]);
4864 4864 continue; /* keep lint happy */
4865 4865 } else if (ierr == -2) {
4866 4866
4867 4867 /*
4868 4868 * Size up case. Note lpgaddr may only be needed for
4869 4869 * softlock case so we don't adjust it here.
4870 4870 */
4871 4871 VM_STAT_ADD(segvnvmstats.fltanpages[10]);
4872 4872 a = (caddr_t)P2ALIGN((uintptr_t)a, pgsz);
4873 4873 ASSERT(a >= lpgaddr);
4874 4874 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4875 4875 aindx = svd->anon_index + seg_page(seg, a);
4876 4876 vpage = (svd->vpage != NULL) ?
4877 4877 &svd->vpage[seg_page(seg, a)] : NULL;
4878 4878 } else {
4879 4879 /*
4880 4880 * Size down case. Note lpgaddr may only be needed for
4881 4881 * softlock case so we don't adjust it here.
4882 4882 */
4883 4883 VM_STAT_ADD(segvnvmstats.fltanpages[11]);
4884 4884 ASSERT(IS_P2ALIGNED(a, pgsz));
4885 4885 ASSERT(IS_P2ALIGNED(lpgeaddr, pgsz));
4886 4886 lpgeaddr = (caddr_t)P2ROUNDUP((uintptr_t)eaddr, pgsz);
4887 4887 ASSERT(a < lpgeaddr);
4888 4888 if (a < addr) {
4889 4889 /*
4890 4890 * The beginning of the large page region can
4891 4891 * be pulled to the right to make a smaller
4892 4892 * region. We haven't yet faulted a single
4893 4893 * page.
4894 4894 */
4895 4895 VM_STAT_ADD(segvnvmstats.fltanpages[12]);
4896 4896 a = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
4897 4897 ASSERT(a >= lpgaddr);
4898 4898 aindx = svd->anon_index + seg_page(seg, a);
4899 4899 vpage = (svd->vpage != NULL) ?
4900 4900 &svd->vpage[seg_page(seg, a)] : NULL;
4901 4901 }
4902 4902 }
4903 4903 }
4904 4904 VM_STAT_ADD(segvnvmstats.fltanpages[13]);
4905 4905 ANON_LOCK_EXIT(&->a_rwlock);
4906 4906 kmem_cache_free(segvn_szc_cache[ppaszc], ppa);
4907 4907 return (0);
4908 4908 error:
4909 4909 VM_STAT_ADD(segvnvmstats.fltanpages[14]);
4910 4910 ANON_LOCK_EXIT(&->a_rwlock);
4911 4911 kmem_cache_free(segvn_szc_cache[ppaszc], ppa);
4912 4912 if (type == F_SOFTLOCK && a > lpgaddr) {
4913 4913 VM_STAT_ADD(segvnvmstats.fltanpages[15]);
4914 4914 segvn_softunlock(seg, lpgaddr, a - lpgaddr, S_OTHER);
4915 4915 }
4916 4916 return (err);
4917 4917 }
4918 4918
4919 4919 int fltadvice = 1; /* set to free behind pages for sequential access */
4920 4920
4921 4921 /*
4922 4922 * This routine is called via a machine specific fault handling routine.
4923 4923 * It is also called by software routines wishing to lock or unlock
4924 4924 * a range of addresses.
4925 4925 *
4926 4926 * Here is the basic algorithm:
4927 4927 * If unlocking
4928 4928 * Call segvn_softunlock
4929 4929 * Return
4930 4930 * endif
4931 4931 * Checking and set up work
4932 4932 * If we will need some non-anonymous pages
4933 4933 * Call VOP_GETPAGE over the range of non-anonymous pages
4934 4934 * endif
4935 4935 * Loop over all addresses requested
4936 4936 * Call segvn_faultpage passing in page list
4937 4937 * to load up translations and handle anonymous pages
4938 4938 * endloop
4939 4939 * Load up translation to any additional pages in page list not
4940 4940 * already handled that fit into this segment
4941 4941 */
4942 4942 static faultcode_t
4943 4943 segvn_fault(struct hat *hat, struct seg *seg, caddr_t addr, size_t len,
4944 4944 enum fault_type type, enum seg_rw rw)
4945 4945 {
4946 4946 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
4947 4947 page_t **plp, **ppp, *pp;
4948 4948 u_offset_t off;
4949 4949 caddr_t a;
4950 4950 struct vpage *vpage;
4951 4951 uint_t vpprot, prot;
4952 4952 int err;
4953 4953 page_t *pl[PVN_GETPAGE_NUM + 1];
|
↓ open down ↓ |
2368 lines elided |
↑ open up ↑ |
4954 4954 size_t plsz, pl_alloc_sz;
4955 4955 size_t page;
4956 4956 ulong_t anon_index;
4957 4957 struct anon_map *amp;
4958 4958 int dogetpage = 0;
4959 4959 caddr_t lpgaddr, lpgeaddr;
4960 4960 size_t pgsz;
4961 4961 anon_sync_obj_t cookie;
4962 4962 int brkcow = BREAK_COW_SHARE(rw, type, svd->type);
4963 4963
4964 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
4964 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
4965 4965 ASSERT(svd->amp == NULL || svd->rcookie == HAT_INVALID_REGION_COOKIE);
4966 4966
4967 4967 /*
4968 4968 * First handle the easy stuff
4969 4969 */
4970 4970 if (type == F_SOFTUNLOCK) {
4971 4971 if (rw == S_READ_NOCOW) {
4972 4972 rw = S_READ;
4973 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
4973 + ASSERT(AS_WRITE_HELD(seg->s_as));
4974 4974 }
4975 4975 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
4976 4976 pgsz = (seg->s_szc == 0) ? PAGESIZE :
4977 4977 page_get_pagesize(seg->s_szc);
4978 4978 VM_STAT_COND_ADD(pgsz > PAGESIZE, segvnvmstats.fltanpages[16]);
4979 4979 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
4980 4980 segvn_softunlock(seg, lpgaddr, lpgeaddr - lpgaddr, rw);
4981 4981 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
4982 4982 return (0);
4983 4983 }
4984 4984
4985 4985 ASSERT(svd->tr_state == SEGVN_TR_OFF ||
4986 4986 !HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
4987 4987 if (brkcow == 0) {
4988 4988 if (svd->tr_state == SEGVN_TR_INIT) {
4989 4989 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
4990 4990 if (svd->tr_state == SEGVN_TR_INIT) {
4991 4991 ASSERT(svd->vp != NULL && svd->amp == NULL);
4992 4992 ASSERT(svd->flags & MAP_TEXT);
4993 4993 ASSERT(svd->type == MAP_PRIVATE);
4994 4994 segvn_textrepl(seg);
4995 4995 ASSERT(svd->tr_state != SEGVN_TR_INIT);
4996 4996 ASSERT(svd->tr_state != SEGVN_TR_ON ||
4997 4997 svd->amp != NULL);
4998 4998 }
4999 4999 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5000 5000 }
5001 5001 } else if (svd->tr_state != SEGVN_TR_OFF) {
5002 5002 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5003 5003
5004 5004 if (rw == S_WRITE && svd->tr_state != SEGVN_TR_OFF) {
5005 5005 ASSERT(!svd->pageprot && !(svd->prot & PROT_WRITE));
5006 5006 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5007 5007 return (FC_PROT);
5008 5008 }
5009 5009
5010 5010 if (svd->tr_state == SEGVN_TR_ON) {
5011 5011 ASSERT(svd->vp != NULL && svd->amp != NULL);
5012 5012 segvn_textunrepl(seg, 0);
5013 5013 ASSERT(svd->amp == NULL &&
5014 5014 svd->tr_state == SEGVN_TR_OFF);
5015 5015 } else if (svd->tr_state != SEGVN_TR_OFF) {
5016 5016 svd->tr_state = SEGVN_TR_OFF;
5017 5017 }
5018 5018 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
5019 5019 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5020 5020 }
5021 5021
5022 5022 top:
5023 5023 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
5024 5024
5025 5025 /*
5026 5026 * If we have the same protections for the entire segment,
5027 5027 * insure that the access being attempted is legitimate.
5028 5028 */
5029 5029
5030 5030 if (svd->pageprot == 0) {
5031 5031 uint_t protchk;
5032 5032
5033 5033 switch (rw) {
5034 5034 case S_READ:
5035 5035 case S_READ_NOCOW:
5036 5036 protchk = PROT_READ;
5037 5037 break;
5038 5038 case S_WRITE:
5039 5039 protchk = PROT_WRITE;
5040 5040 break;
5041 5041 case S_EXEC:
5042 5042 protchk = PROT_EXEC;
5043 5043 break;
5044 5044 case S_OTHER:
5045 5045 default:
5046 5046 protchk = PROT_READ | PROT_WRITE | PROT_EXEC;
5047 5047 break;
5048 5048 }
5049 5049
5050 5050 if ((svd->prot & protchk) == 0) {
5051 5051 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5052 5052 return (FC_PROT); /* illegal access type */
5053 5053 }
5054 5054 }
5055 5055
5056 5056 if (brkcow && HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5057 5057 /* this must be SOFTLOCK S_READ fault */
5058 5058 ASSERT(svd->amp == NULL);
5059 5059 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5060 5060 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5061 5061 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5062 5062 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5063 5063 /*
5064 5064 * this must be the first ever non S_READ_NOCOW
5065 5065 * softlock for this segment.
5066 5066 */
5067 5067 ASSERT(svd->softlockcnt == 0);
5068 5068 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
5069 5069 HAT_REGION_TEXT);
5070 5070 svd->rcookie = HAT_INVALID_REGION_COOKIE;
5071 5071 }
5072 5072 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5073 5073 goto top;
5074 5074 }
5075 5075
5076 5076 /*
5077 5077 * We can't allow the long term use of softlocks for vmpss segments,
5078 5078 * because in some file truncation cases we should be able to demote
5079 5079 * the segment, which requires that there are no softlocks. The
5080 5080 * only case where it's ok to allow a SOFTLOCK fault against a vmpss
5081 5081 * segment is S_READ_NOCOW, where the caller holds the address space
5082 5082 * locked as writer and calls softunlock before dropping the as lock.
5083 5083 * S_READ_NOCOW is used by /proc to read memory from another user.
5084 5084 *
5085 5085 * Another deadlock between SOFTLOCK and file truncation can happen
5086 5086 * because segvn_fault_vnodepages() calls the FS one pagesize at
5087 5087 * a time. A second VOP_GETPAGE() call by segvn_fault_vnodepages()
5088 5088 * can cause a deadlock because the first set of page_t's remain
5089 5089 * locked SE_SHARED. To avoid this, we demote segments on a first
5090 5090 * SOFTLOCK if they have a length greater than the segment's
5091 5091 * page size.
5092 5092 *
5093 5093 * So for now, we only avoid demoting a segment on a SOFTLOCK when
5094 5094 * the access type is S_READ_NOCOW and the fault length is less than
5095 5095 * or equal to the segment's page size. While this is quite restrictive,
5096 5096 * it should be the most common case of SOFTLOCK against a vmpss
5097 5097 * segment.
5098 5098 *
5099 5099 * For S_READ_NOCOW, it's safe not to do a copy on write because the
5100 5100 * caller makes sure no COW will be caused by another thread for a
5101 5101 * softlocked page.
5102 5102 */
5103 5103 if (type == F_SOFTLOCK && svd->vp != NULL && seg->s_szc != 0) {
5104 5104 int demote = 0;
5105 5105
5106 5106 if (rw != S_READ_NOCOW) {
5107 5107 demote = 1;
|
↓ open down ↓ |
124 lines elided |
↑ open up ↑ |
5108 5108 }
5109 5109 if (!demote && len > PAGESIZE) {
5110 5110 pgsz = page_get_pagesize(seg->s_szc);
5111 5111 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr,
5112 5112 lpgeaddr);
5113 5113 if (lpgeaddr - lpgaddr > pgsz) {
5114 5114 demote = 1;
5115 5115 }
5116 5116 }
5117 5117
5118 - ASSERT(demote || AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
5118 + ASSERT(demote || AS_WRITE_HELD(seg->s_as));
5119 5119
5120 5120 if (demote) {
5121 5121 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5122 5122 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5123 5123 if (seg->s_szc != 0) {
5124 5124 segvn_vmpss_clrszc_cnt++;
5125 5125 ASSERT(svd->softlockcnt == 0);
5126 5126 err = segvn_clrszc(seg);
5127 5127 if (err) {
5128 5128 segvn_vmpss_clrszc_err++;
5129 5129 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5130 5130 return (FC_MAKE_ERR(err));
5131 5131 }
5132 5132 }
5133 5133 ASSERT(seg->s_szc == 0);
5134 5134 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5135 5135 goto top;
5136 5136 }
5137 5137 }
5138 5138
5139 5139 /*
5140 5140 * Check to see if we need to allocate an anon_map structure.
5141 5141 */
5142 5142 if (svd->amp == NULL && (svd->vp == NULL || brkcow)) {
5143 5143 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
5144 5144 /*
5145 5145 * Drop the "read" lock on the segment and acquire
5146 5146 * the "write" version since we have to allocate the
5147 5147 * anon_map.
5148 5148 */
5149 5149 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5150 5150 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5151 5151
5152 5152 if (svd->amp == NULL) {
5153 5153 svd->amp = anonmap_alloc(seg->s_size, 0, ANON_SLEEP);
5154 5154 svd->amp->a_szc = seg->s_szc;
5155 5155 }
5156 5156 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5157 5157
5158 5158 /*
5159 5159 * Start all over again since segment protections
5160 5160 * may have changed after we dropped the "read" lock.
5161 5161 */
|
↓ open down ↓ |
33 lines elided |
↑ open up ↑ |
5162 5162 goto top;
5163 5163 }
5164 5164
5165 5165 /*
5166 5166 * S_READ_NOCOW vs S_READ distinction was
5167 5167 * only needed for the code above. After
5168 5168 * that we treat it as S_READ.
5169 5169 */
5170 5170 if (rw == S_READ_NOCOW) {
5171 5171 ASSERT(type == F_SOFTLOCK);
5172 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
5172 + ASSERT(AS_WRITE_HELD(seg->s_as));
5173 5173 rw = S_READ;
5174 5174 }
5175 5175
5176 5176 amp = svd->amp;
5177 5177
5178 5178 /*
5179 5179 * MADV_SEQUENTIAL work is ignored for large page segments.
5180 5180 */
5181 5181 if (seg->s_szc != 0) {
5182 5182 pgsz = page_get_pagesize(seg->s_szc);
5183 5183 ASSERT(SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
5184 5184 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
5185 5185 if (svd->vp == NULL) {
5186 5186 err = segvn_fault_anonpages(hat, seg, lpgaddr,
5187 5187 lpgeaddr, type, rw, addr, addr + len, brkcow);
5188 5188 } else {
5189 5189 err = segvn_fault_vnodepages(hat, seg, lpgaddr,
5190 5190 lpgeaddr, type, rw, addr, addr + len, brkcow);
5191 5191 if (err == IE_RETRY) {
5192 5192 ASSERT(seg->s_szc == 0);
5193 5193 ASSERT(SEGVN_READ_HELD(seg->s_as, &svd->lock));
5194 5194 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5195 5195 goto top;
5196 5196 }
5197 5197 }
5198 5198 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5199 5199 return (err);
5200 5200 }
5201 5201
5202 5202 page = seg_page(seg, addr);
5203 5203 if (amp != NULL) {
5204 5204 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
5205 5205 anon_index = svd->anon_index + page;
5206 5206
5207 5207 if (type == F_PROT && rw == S_READ &&
5208 5208 svd->tr_state == SEGVN_TR_OFF &&
5209 5209 svd->type == MAP_PRIVATE && svd->pageprot == 0) {
5210 5210 size_t index = anon_index;
5211 5211 struct anon *ap;
5212 5212
5213 5213 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5214 5214 /*
5215 5215 * The fast path could apply to S_WRITE also, except
5216 5216 * that the protection fault could be caused by lazy
5217 5217 * tlb flush when ro->rw. In this case, the pte is
5218 5218 * RW already. But RO in the other cpu's tlb causes
5219 5219 * the fault. Since hat_chgprot won't do anything if
5220 5220 * pte doesn't change, we may end up faulting
5221 5221 * indefinitely until the RO tlb entry gets replaced.
5222 5222 */
5223 5223 for (a = addr; a < addr + len; a += PAGESIZE, index++) {
5224 5224 anon_array_enter(amp, index, &cookie);
5225 5225 ap = anon_get_ptr(amp->ahp, index);
5226 5226 anon_array_exit(&cookie);
5227 5227 if ((ap == NULL) || (ap->an_refcnt != 1)) {
5228 5228 ANON_LOCK_EXIT(&->a_rwlock);
5229 5229 goto slow;
5230 5230 }
5231 5231 }
5232 5232 hat_chgprot(seg->s_as->a_hat, addr, len, svd->prot);
5233 5233 ANON_LOCK_EXIT(&->a_rwlock);
5234 5234 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5235 5235 return (0);
5236 5236 }
5237 5237 }
5238 5238 slow:
5239 5239
5240 5240 if (svd->vpage == NULL)
5241 5241 vpage = NULL;
5242 5242 else
5243 5243 vpage = &svd->vpage[page];
5244 5244
5245 5245 off = svd->offset + (uintptr_t)(addr - seg->s_base);
5246 5246
5247 5247 /*
5248 5248 * If MADV_SEQUENTIAL has been set for the particular page we
5249 5249 * are faulting on, free behind all pages in the segment and put
5250 5250 * them on the free list.
5251 5251 */
5252 5252
5253 5253 if ((page != 0) && fltadvice && svd->tr_state != SEGVN_TR_ON) {
5254 5254 struct vpage *vpp;
5255 5255 ulong_t fanon_index;
5256 5256 size_t fpage;
5257 5257 u_offset_t pgoff, fpgoff;
5258 5258 struct vnode *fvp;
5259 5259 struct anon *fap = NULL;
5260 5260
5261 5261 if (svd->advice == MADV_SEQUENTIAL ||
5262 5262 (svd->pageadvice &&
5263 5263 VPP_ADVICE(vpage) == MADV_SEQUENTIAL)) {
5264 5264 pgoff = off - PAGESIZE;
5265 5265 fpage = page - 1;
5266 5266 if (vpage != NULL)
5267 5267 vpp = &svd->vpage[fpage];
5268 5268 if (amp != NULL)
5269 5269 fanon_index = svd->anon_index + fpage;
5270 5270
5271 5271 while (pgoff > svd->offset) {
5272 5272 if (svd->advice != MADV_SEQUENTIAL &&
5273 5273 (!svd->pageadvice || (vpage &&
5274 5274 VPP_ADVICE(vpp) != MADV_SEQUENTIAL)))
5275 5275 break;
5276 5276
5277 5277 /*
5278 5278 * If this is an anon page, we must find the
5279 5279 * correct <vp, offset> for it
5280 5280 */
5281 5281 fap = NULL;
5282 5282 if (amp != NULL) {
5283 5283 ANON_LOCK_ENTER(&->a_rwlock,
5284 5284 RW_READER);
5285 5285 anon_array_enter(amp, fanon_index,
5286 5286 &cookie);
5287 5287 fap = anon_get_ptr(amp->ahp,
5288 5288 fanon_index);
5289 5289 if (fap != NULL) {
5290 5290 swap_xlate(fap, &fvp, &fpgoff);
5291 5291 } else {
5292 5292 fpgoff = pgoff;
5293 5293 fvp = svd->vp;
5294 5294 }
5295 5295 anon_array_exit(&cookie);
5296 5296 ANON_LOCK_EXIT(&->a_rwlock);
5297 5297 } else {
5298 5298 fpgoff = pgoff;
5299 5299 fvp = svd->vp;
5300 5300 }
5301 5301 if (fvp == NULL)
5302 5302 break; /* XXX */
5303 5303 /*
5304 5304 * Skip pages that are free or have an
5305 5305 * "exclusive" lock.
5306 5306 */
5307 5307 pp = page_lookup_nowait(fvp, fpgoff, SE_SHARED);
5308 5308 if (pp == NULL)
5309 5309 break;
5310 5310 /*
5311 5311 * We don't need the page_struct_lock to test
5312 5312 * as this is only advisory; even if we
5313 5313 * acquire it someone might race in and lock
5314 5314 * the page after we unlock and before the
5315 5315 * PUTPAGE, then VOP_PUTPAGE will do nothing.
5316 5316 */
5317 5317 if (pp->p_lckcnt == 0 && pp->p_cowcnt == 0) {
5318 5318 /*
5319 5319 * Hold the vnode before releasing
5320 5320 * the page lock to prevent it from
5321 5321 * being freed and re-used by some
5322 5322 * other thread.
5323 5323 */
5324 5324 VN_HOLD(fvp);
5325 5325 page_unlock(pp);
5326 5326 /*
5327 5327 * We should build a page list
5328 5328 * to kluster putpages XXX
5329 5329 */
5330 5330 (void) VOP_PUTPAGE(fvp,
5331 5331 (offset_t)fpgoff, PAGESIZE,
5332 5332 (B_DONTNEED|B_FREE|B_ASYNC),
5333 5333 svd->cred, NULL);
5334 5334 VN_RELE(fvp);
5335 5335 } else {
5336 5336 /*
5337 5337 * XXX - Should the loop terminate if
5338 5338 * the page is `locked'?
5339 5339 */
5340 5340 page_unlock(pp);
5341 5341 }
5342 5342 --vpp;
5343 5343 --fanon_index;
5344 5344 pgoff -= PAGESIZE;
5345 5345 }
5346 5346 }
5347 5347 }
5348 5348
5349 5349 plp = pl;
5350 5350 *plp = NULL;
5351 5351 pl_alloc_sz = 0;
5352 5352
5353 5353 /*
5354 5354 * See if we need to call VOP_GETPAGE for
5355 5355 * *any* of the range being faulted on.
5356 5356 * We can skip all of this work if there
5357 5357 * was no original vnode.
5358 5358 */
5359 5359 if (svd->vp != NULL) {
5360 5360 u_offset_t vp_off;
5361 5361 size_t vp_len;
5362 5362 struct anon *ap;
5363 5363 vnode_t *vp;
5364 5364
5365 5365 vp_off = off;
5366 5366 vp_len = len;
5367 5367
5368 5368 if (amp == NULL)
5369 5369 dogetpage = 1;
5370 5370 else {
5371 5371 /*
5372 5372 * Only acquire reader lock to prevent amp->ahp
5373 5373 * from being changed. It's ok to miss pages,
5374 5374 * hence we don't do anon_array_enter
5375 5375 */
5376 5376 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5377 5377 ap = anon_get_ptr(amp->ahp, anon_index);
5378 5378
5379 5379 if (len <= PAGESIZE)
5380 5380 /* inline non_anon() */
5381 5381 dogetpage = (ap == NULL);
5382 5382 else
5383 5383 dogetpage = non_anon(amp->ahp, anon_index,
5384 5384 &vp_off, &vp_len);
5385 5385 ANON_LOCK_EXIT(&->a_rwlock);
5386 5386 }
5387 5387
5388 5388 if (dogetpage) {
5389 5389 enum seg_rw arw;
5390 5390 struct as *as = seg->s_as;
5391 5391
5392 5392 if (len > ptob((sizeof (pl) / sizeof (pl[0])) - 1)) {
5393 5393 /*
5394 5394 * Page list won't fit in local array,
5395 5395 * allocate one of the needed size.
5396 5396 */
5397 5397 pl_alloc_sz =
5398 5398 (btop(len) + 1) * sizeof (page_t *);
5399 5399 plp = kmem_alloc(pl_alloc_sz, KM_SLEEP);
5400 5400 plp[0] = NULL;
5401 5401 plsz = len;
5402 5402 } else if (rw == S_WRITE && svd->type == MAP_PRIVATE ||
5403 5403 svd->tr_state == SEGVN_TR_ON || rw == S_OTHER ||
5404 5404 (((size_t)(addr + PAGESIZE) <
5405 5405 (size_t)(seg->s_base + seg->s_size)) &&
5406 5406 hat_probe(as->a_hat, addr + PAGESIZE))) {
5407 5407 /*
5408 5408 * Ask VOP_GETPAGE to return the exact number
5409 5409 * of pages if
5410 5410 * (a) this is a COW fault, or
5411 5411 * (b) this is a software fault, or
5412 5412 * (c) next page is already mapped.
5413 5413 */
5414 5414 plsz = len;
5415 5415 } else {
5416 5416 /*
5417 5417 * Ask VOP_GETPAGE to return adjacent pages
5418 5418 * within the segment.
5419 5419 */
5420 5420 plsz = MIN((size_t)PVN_GETPAGE_SZ, (size_t)
5421 5421 ((seg->s_base + seg->s_size) - addr));
5422 5422 ASSERT((addr + plsz) <=
5423 5423 (seg->s_base + seg->s_size));
5424 5424 }
5425 5425
5426 5426 /*
5427 5427 * Need to get some non-anonymous pages.
5428 5428 * We need to make only one call to GETPAGE to do
5429 5429 * this to prevent certain deadlocking conditions
5430 5430 * when we are doing locking. In this case
5431 5431 * non_anon() should have picked up the smallest
5432 5432 * range which includes all the non-anonymous
5433 5433 * pages in the requested range. We have to
5434 5434 * be careful regarding which rw flag to pass in
5435 5435 * because on a private mapping, the underlying
5436 5436 * object is never allowed to be written.
5437 5437 */
5438 5438 if (rw == S_WRITE && svd->type == MAP_PRIVATE) {
5439 5439 arw = S_READ;
5440 5440 } else {
5441 5441 arw = rw;
5442 5442 }
5443 5443 vp = svd->vp;
5444 5444 TRACE_3(TR_FAC_VM, TR_SEGVN_GETPAGE,
5445 5445 "segvn_getpage:seg %p addr %p vp %p",
5446 5446 seg, addr, vp);
5447 5447 err = VOP_GETPAGE(vp, (offset_t)vp_off, vp_len,
5448 5448 &vpprot, plp, plsz, seg, addr + (vp_off - off), arw,
5449 5449 svd->cred, NULL);
5450 5450 if (err) {
5451 5451 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5452 5452 segvn_pagelist_rele(plp);
5453 5453 if (pl_alloc_sz)
5454 5454 kmem_free(plp, pl_alloc_sz);
5455 5455 return (FC_MAKE_ERR(err));
5456 5456 }
5457 5457 if (svd->type == MAP_PRIVATE)
5458 5458 vpprot &= ~PROT_WRITE;
5459 5459 }
5460 5460 }
5461 5461
5462 5462 /*
5463 5463 * N.B. at this time the plp array has all the needed non-anon
5464 5464 * pages in addition to (possibly) having some adjacent pages.
5465 5465 */
5466 5466
5467 5467 /*
5468 5468 * Always acquire the anon_array_lock to prevent
5469 5469 * 2 threads from allocating separate anon slots for
5470 5470 * the same "addr".
5471 5471 *
5472 5472 * If this is a copy-on-write fault and we don't already
5473 5473 * have the anon_array_lock, acquire it to prevent the
5474 5474 * fault routine from handling multiple copy-on-write faults
5475 5475 * on the same "addr" in the same address space.
5476 5476 *
5477 5477 * Only one thread should deal with the fault since after
5478 5478 * it is handled, the other threads can acquire a translation
5479 5479 * to the newly created private page. This prevents two or
5480 5480 * more threads from creating different private pages for the
5481 5481 * same fault.
5482 5482 *
5483 5483 * We grab "serialization" lock here if this is a MAP_PRIVATE segment
5484 5484 * to prevent deadlock between this thread and another thread
5485 5485 * which has soft-locked this page and wants to acquire serial_lock.
5486 5486 * ( bug 4026339 )
5487 5487 *
5488 5488 * The fix for bug 4026339 becomes unnecessary when using the
5489 5489 * locking scheme with per amp rwlock and a global set of hash
5490 5490 * lock, anon_array_lock. If we steal a vnode page when low
5491 5491 * on memory and upgrad the page lock through page_rename,
5492 5492 * then the page is PAGE_HANDLED, nothing needs to be done
5493 5493 * for this page after returning from segvn_faultpage.
5494 5494 *
5495 5495 * But really, the page lock should be downgraded after
5496 5496 * the stolen page is page_rename'd.
5497 5497 */
5498 5498
5499 5499 if (amp != NULL)
5500 5500 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5501 5501
5502 5502 /*
5503 5503 * Ok, now loop over the address range and handle faults
5504 5504 */
5505 5505 for (a = addr; a < addr + len; a += PAGESIZE, off += PAGESIZE) {
5506 5506 err = segvn_faultpage(hat, seg, a, off, vpage, plp, vpprot,
5507 5507 type, rw, brkcow);
5508 5508 if (err) {
5509 5509 if (amp != NULL)
5510 5510 ANON_LOCK_EXIT(&->a_rwlock);
5511 5511 if (type == F_SOFTLOCK && a > addr) {
5512 5512 segvn_softunlock(seg, addr, (a - addr),
5513 5513 S_OTHER);
5514 5514 }
5515 5515 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5516 5516 segvn_pagelist_rele(plp);
5517 5517 if (pl_alloc_sz)
5518 5518 kmem_free(plp, pl_alloc_sz);
5519 5519 return (err);
5520 5520 }
5521 5521 if (vpage) {
5522 5522 vpage++;
5523 5523 } else if (svd->vpage) {
5524 5524 page = seg_page(seg, addr);
5525 5525 vpage = &svd->vpage[++page];
5526 5526 }
5527 5527 }
5528 5528
5529 5529 /* Didn't get pages from the underlying fs so we're done */
5530 5530 if (!dogetpage)
5531 5531 goto done;
5532 5532
5533 5533 /*
5534 5534 * Now handle any other pages in the list returned.
5535 5535 * If the page can be used, load up the translations now.
5536 5536 * Note that the for loop will only be entered if "plp"
5537 5537 * is pointing to a non-NULL page pointer which means that
5538 5538 * VOP_GETPAGE() was called and vpprot has been initialized.
5539 5539 */
5540 5540 if (svd->pageprot == 0)
5541 5541 prot = svd->prot & vpprot;
5542 5542
5543 5543
5544 5544 /*
5545 5545 * Large Files: diff should be unsigned value because we started
5546 5546 * supporting > 2GB segment sizes from 2.5.1 and when a
5547 5547 * large file of size > 2GB gets mapped to address space
5548 5548 * the diff value can be > 2GB.
5549 5549 */
5550 5550
5551 5551 for (ppp = plp; (pp = *ppp) != NULL; ppp++) {
5552 5552 size_t diff;
5553 5553 struct anon *ap;
5554 5554 int anon_index;
5555 5555 anon_sync_obj_t cookie;
5556 5556 int hat_flag = HAT_LOAD_ADV;
5557 5557
5558 5558 if (svd->flags & MAP_TEXT) {
5559 5559 hat_flag |= HAT_LOAD_TEXT;
5560 5560 }
5561 5561
5562 5562 if (pp == PAGE_HANDLED)
5563 5563 continue;
5564 5564
5565 5565 if (svd->tr_state != SEGVN_TR_ON &&
5566 5566 pp->p_offset >= svd->offset &&
5567 5567 pp->p_offset < svd->offset + seg->s_size) {
5568 5568
5569 5569 diff = pp->p_offset - svd->offset;
5570 5570
5571 5571 /*
5572 5572 * Large Files: Following is the assertion
5573 5573 * validating the above cast.
5574 5574 */
5575 5575 ASSERT(svd->vp == pp->p_vnode);
5576 5576
5577 5577 page = btop(diff);
5578 5578 if (svd->pageprot)
5579 5579 prot = VPP_PROT(&svd->vpage[page]) & vpprot;
5580 5580
5581 5581 /*
5582 5582 * Prevent other threads in the address space from
5583 5583 * creating private pages (i.e., allocating anon slots)
5584 5584 * while we are in the process of loading translations
5585 5585 * to additional pages returned by the underlying
5586 5586 * object.
5587 5587 */
5588 5588 if (amp != NULL) {
5589 5589 anon_index = svd->anon_index + page;
5590 5590 anon_array_enter(amp, anon_index, &cookie);
5591 5591 ap = anon_get_ptr(amp->ahp, anon_index);
5592 5592 }
5593 5593 if ((amp == NULL) || (ap == NULL)) {
5594 5594 if (IS_VMODSORT(pp->p_vnode) ||
5595 5595 enable_mbit_wa) {
5596 5596 if (rw == S_WRITE)
5597 5597 hat_setmod(pp);
5598 5598 else if (rw != S_OTHER &&
5599 5599 !hat_ismod(pp))
5600 5600 prot &= ~PROT_WRITE;
5601 5601 }
5602 5602 /*
5603 5603 * Skip mapping read ahead pages marked
5604 5604 * for migration, so they will get migrated
5605 5605 * properly on fault
5606 5606 */
5607 5607 ASSERT(amp == NULL ||
5608 5608 svd->rcookie == HAT_INVALID_REGION_COOKIE);
5609 5609 if ((prot & PROT_READ) && !PP_ISMIGRATE(pp)) {
5610 5610 hat_memload_region(hat,
5611 5611 seg->s_base + diff,
5612 5612 pp, prot, hat_flag,
5613 5613 svd->rcookie);
5614 5614 }
5615 5615 }
5616 5616 if (amp != NULL)
5617 5617 anon_array_exit(&cookie);
5618 5618 }
5619 5619 page_unlock(pp);
5620 5620 }
5621 5621 done:
5622 5622 if (amp != NULL)
5623 5623 ANON_LOCK_EXIT(&->a_rwlock);
5624 5624 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5625 5625 if (pl_alloc_sz)
5626 5626 kmem_free(plp, pl_alloc_sz);
5627 5627 return (0);
5628 5628 }
5629 5629
5630 5630 /*
5631 5631 * This routine is used to start I/O on pages asynchronously. XXX it will
5632 5632 * only create PAGESIZE pages. At fault time they will be relocated into
|
↓ open down ↓ |
450 lines elided |
↑ open up ↑ |
5633 5633 * larger pages.
5634 5634 */
5635 5635 static faultcode_t
5636 5636 segvn_faulta(struct seg *seg, caddr_t addr)
5637 5637 {
5638 5638 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
5639 5639 int err;
5640 5640 struct anon_map *amp;
5641 5641 vnode_t *vp;
5642 5642
5643 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
5643 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
5644 5644
5645 5645 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
5646 5646 if ((amp = svd->amp) != NULL) {
5647 5647 struct anon *ap;
5648 5648
5649 5649 /*
5650 5650 * Reader lock to prevent amp->ahp from being changed.
5651 5651 * This is advisory, it's ok to miss a page, so
5652 5652 * we don't do anon_array_enter lock.
5653 5653 */
5654 5654 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5655 5655 if ((ap = anon_get_ptr(amp->ahp,
5656 5656 svd->anon_index + seg_page(seg, addr))) != NULL) {
5657 5657
5658 5658 err = anon_getpage(&ap, NULL, NULL,
5659 5659 0, seg, addr, S_READ, svd->cred);
5660 5660
5661 5661 ANON_LOCK_EXIT(&->a_rwlock);
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 ANON_LOCK_EXIT(&->a_rwlock);
5668 5668 }
5669 5669
5670 5670 if (svd->vp == NULL) {
5671 5671 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5672 5672 return (0); /* zfod page - do nothing now */
5673 5673 }
5674 5674
5675 5675 vp = svd->vp;
5676 5676 TRACE_3(TR_FAC_VM, TR_SEGVN_GETPAGE,
5677 5677 "segvn_getpage:seg %p addr %p vp %p", seg, addr, vp);
5678 5678 err = VOP_GETPAGE(vp,
5679 5679 (offset_t)(svd->offset + (uintptr_t)(addr - seg->s_base)),
5680 5680 PAGESIZE, NULL, NULL, 0, seg, addr,
5681 5681 S_OTHER, svd->cred, NULL);
5682 5682
5683 5683 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5684 5684 if (err)
5685 5685 return (FC_MAKE_ERR(err));
5686 5686 return (0);
5687 5687 }
5688 5688
5689 5689 static int
|
↓ open down ↓ |
36 lines elided |
↑ open up ↑ |
5690 5690 segvn_setprot(struct seg *seg, caddr_t addr, size_t len, uint_t prot)
5691 5691 {
5692 5692 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
5693 5693 struct vpage *cvp, *svp, *evp;
5694 5694 struct vnode *vp;
5695 5695 size_t pgsz;
5696 5696 pgcnt_t pgcnt;
5697 5697 anon_sync_obj_t cookie;
5698 5698 int unload_done = 0;
5699 5699
5700 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
5700 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
5701 5701
5702 5702 if ((svd->maxprot & prot) != prot)
5703 5703 return (EACCES); /* violated maxprot */
5704 5704
5705 5705 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
5706 5706
5707 5707 /* return if prot is the same */
5708 5708 if (!svd->pageprot && svd->prot == prot) {
5709 5709 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5710 5710 return (0);
5711 5711 }
5712 5712
5713 5713 /*
5714 5714 * Since we change protections we first have to flush the cache.
5715 5715 * This makes sure all the pagelock calls have to recheck
5716 5716 * protections.
5717 5717 */
5718 5718 if (svd->softlockcnt > 0) {
5719 5719 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5720 5720
5721 5721 /*
5722 5722 * If this is shared segment non 0 softlockcnt
5723 5723 * means locked pages are still in use.
5724 5724 */
5725 5725 if (svd->type == MAP_SHARED) {
5726 5726 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5727 5727 return (EAGAIN);
5728 5728 }
5729 5729
5730 5730 /*
5731 5731 * Since we do have the segvn writers lock nobody can fill
5732 5732 * the cache with entries belonging to this seg during
5733 5733 * the purge. The flush either succeeds or we still have
5734 5734 * pending I/Os.
5735 5735 */
5736 5736 segvn_purge(seg);
5737 5737 if (svd->softlockcnt > 0) {
5738 5738 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5739 5739 return (EAGAIN);
5740 5740 }
5741 5741 }
5742 5742
5743 5743 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
5744 5744 ASSERT(svd->amp == NULL);
5745 5745 ASSERT(svd->tr_state == SEGVN_TR_OFF);
5746 5746 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
5747 5747 HAT_REGION_TEXT);
5748 5748 svd->rcookie = HAT_INVALID_REGION_COOKIE;
5749 5749 unload_done = 1;
5750 5750 } else if (svd->tr_state == SEGVN_TR_INIT) {
5751 5751 svd->tr_state = SEGVN_TR_OFF;
5752 5752 } else if (svd->tr_state == SEGVN_TR_ON) {
5753 5753 ASSERT(svd->amp != NULL);
5754 5754 segvn_textunrepl(seg, 0);
5755 5755 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
5756 5756 unload_done = 1;
5757 5757 }
5758 5758
5759 5759 if ((prot & PROT_WRITE) && svd->type == MAP_SHARED &&
5760 5760 svd->vp != NULL && (svd->vp->v_flag & VVMEXEC)) {
5761 5761 ASSERT(vn_is_mapped(svd->vp, V_WRITE));
5762 5762 segvn_inval_trcache(svd->vp);
5763 5763 }
5764 5764 if (seg->s_szc != 0) {
5765 5765 int err;
5766 5766 pgsz = page_get_pagesize(seg->s_szc);
|
↓ open down ↓ |
56 lines elided |
↑ open up ↑ |
5767 5767 pgcnt = pgsz >> PAGESHIFT;
5768 5768 ASSERT(IS_P2ALIGNED(pgcnt, pgcnt));
5769 5769 if (!IS_P2ALIGNED(addr, pgsz) || !IS_P2ALIGNED(len, pgsz)) {
5770 5770 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5771 5771 ASSERT(seg->s_base != addr || seg->s_size != len);
5772 5772 /*
5773 5773 * If we are holding the as lock as a reader then
5774 5774 * we need to return IE_RETRY and let the as
5775 5775 * layer drop and re-acquire the lock as a writer.
5776 5776 */
5777 - if (AS_READ_HELD(seg->s_as, &seg->s_as->a_lock))
5777 + if (AS_READ_HELD(seg->s_as))
5778 5778 return (IE_RETRY);
5779 5779 VM_STAT_ADD(segvnvmstats.demoterange[1]);
5780 5780 if (svd->type == MAP_PRIVATE || svd->vp != NULL) {
5781 5781 err = segvn_demote_range(seg, addr, len,
5782 5782 SDR_END, 0);
5783 5783 } else {
5784 5784 uint_t szcvec = map_pgszcvec(seg->s_base,
5785 5785 pgsz, (uintptr_t)seg->s_base,
5786 5786 (svd->flags & MAP_TEXT), MAPPGSZC_SHM, 0);
5787 5787 err = segvn_demote_range(seg, addr, len,
5788 5788 SDR_END, szcvec);
5789 5789 }
5790 5790 if (err == 0)
5791 5791 return (IE_RETRY);
5792 5792 if (err == ENOMEM)
5793 5793 return (IE_NOMEM);
5794 5794 return (err);
5795 5795 }
5796 5796 }
5797 5797
5798 5798
5799 5799 /*
5800 5800 * If it's a private mapping and we're making it writable then we
5801 5801 * may have to reserve the additional swap space now. If we are
5802 5802 * making writable only a part of the segment then we use its vpage
5803 5803 * array to keep a record of the pages for which we have reserved
5804 5804 * swap. In this case we set the pageswap field in the segment's
5805 5805 * segvn structure to record this.
5806 5806 *
5807 5807 * If it's a private mapping to a file (i.e., vp != NULL) and we're
5808 5808 * removing write permission on the entire segment and we haven't
5809 5809 * modified any pages, we can release the swap space.
5810 5810 */
5811 5811 if (svd->type == MAP_PRIVATE) {
5812 5812 if (prot & PROT_WRITE) {
5813 5813 if (!(svd->flags & MAP_NORESERVE) &&
5814 5814 !(svd->swresv && svd->pageswap == 0)) {
5815 5815 size_t sz = 0;
5816 5816
5817 5817 /*
5818 5818 * Start by determining how much swap
5819 5819 * space is required.
5820 5820 */
5821 5821 if (addr == seg->s_base &&
5822 5822 len == seg->s_size &&
5823 5823 svd->pageswap == 0) {
5824 5824 /* The whole segment */
5825 5825 sz = seg->s_size;
5826 5826 } else {
5827 5827 /*
5828 5828 * Make sure that the vpage array
5829 5829 * exists, and make a note of the
5830 5830 * range of elements corresponding
5831 5831 * to len.
5832 5832 */
5833 5833 segvn_vpage(seg);
5834 5834 if (svd->vpage == NULL) {
5835 5835 SEGVN_LOCK_EXIT(seg->s_as,
5836 5836 &svd->lock);
5837 5837 return (ENOMEM);
5838 5838 }
5839 5839 svp = &svd->vpage[seg_page(seg, addr)];
5840 5840 evp = &svd->vpage[seg_page(seg,
5841 5841 addr + len)];
5842 5842
5843 5843 if (svd->pageswap == 0) {
5844 5844 /*
5845 5845 * This is the first time we've
5846 5846 * asked for a part of this
5847 5847 * segment, so we need to
5848 5848 * reserve everything we've
5849 5849 * been asked for.
5850 5850 */
5851 5851 sz = len;
5852 5852 } else {
5853 5853 /*
5854 5854 * We have to count the number
5855 5855 * of pages required.
5856 5856 */
5857 5857 for (cvp = svp; cvp < evp;
5858 5858 cvp++) {
5859 5859 if (!VPP_ISSWAPRES(cvp))
5860 5860 sz++;
5861 5861 }
5862 5862 sz <<= PAGESHIFT;
5863 5863 }
5864 5864 }
5865 5865
5866 5866 /* Try to reserve the necessary swap. */
5867 5867 if (anon_resv_zone(sz,
5868 5868 seg->s_as->a_proc->p_zone) == 0) {
5869 5869 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5870 5870 return (IE_NOMEM);
5871 5871 }
5872 5872
5873 5873 /*
5874 5874 * Make a note of how much swap space
5875 5875 * we've reserved.
5876 5876 */
5877 5877 if (svd->pageswap == 0 && sz == seg->s_size) {
5878 5878 svd->swresv = sz;
5879 5879 } else {
5880 5880 ASSERT(svd->vpage != NULL);
5881 5881 svd->swresv += sz;
5882 5882 svd->pageswap = 1;
5883 5883 for (cvp = svp; cvp < evp; cvp++) {
5884 5884 if (!VPP_ISSWAPRES(cvp))
5885 5885 VPP_SETSWAPRES(cvp);
5886 5886 }
5887 5887 }
5888 5888 }
5889 5889 } else {
5890 5890 /*
5891 5891 * Swap space is released only if this segment
5892 5892 * does not map anonymous memory, since read faults
5893 5893 * on such segments still need an anon slot to read
5894 5894 * in the data.
5895 5895 */
5896 5896 if (svd->swresv != 0 && svd->vp != NULL &&
5897 5897 svd->amp == NULL && addr == seg->s_base &&
5898 5898 len == seg->s_size && svd->pageprot == 0) {
5899 5899 ASSERT(svd->pageswap == 0);
5900 5900 anon_unresv_zone(svd->swresv,
5901 5901 seg->s_as->a_proc->p_zone);
5902 5902 svd->swresv = 0;
5903 5903 TRACE_3(TR_FAC_VM, TR_ANON_PROC,
5904 5904 "anon proc:%p %lu %u", seg, 0, 0);
5905 5905 }
5906 5906 }
5907 5907 }
5908 5908
5909 5909 if (addr == seg->s_base && len == seg->s_size && svd->vpage == NULL) {
5910 5910 if (svd->prot == prot) {
5911 5911 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5912 5912 return (0); /* all done */
5913 5913 }
5914 5914 svd->prot = (uchar_t)prot;
5915 5915 } else if (svd->type == MAP_PRIVATE) {
5916 5916 struct anon *ap = NULL;
5917 5917 page_t *pp;
5918 5918 u_offset_t offset, off;
5919 5919 struct anon_map *amp;
5920 5920 ulong_t anon_idx = 0;
5921 5921
5922 5922 /*
5923 5923 * A vpage structure exists or else the change does not
5924 5924 * involve the entire segment. Establish a vpage structure
5925 5925 * if none is there. Then, for each page in the range,
5926 5926 * adjust its individual permissions. Note that write-
5927 5927 * enabling a MAP_PRIVATE page can affect the claims for
5928 5928 * locked down memory. Overcommitting memory terminates
5929 5929 * the operation.
5930 5930 */
5931 5931 segvn_vpage(seg);
5932 5932 if (svd->vpage == NULL) {
5933 5933 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
5934 5934 return (ENOMEM);
5935 5935 }
5936 5936 svd->pageprot = 1;
5937 5937 if ((amp = svd->amp) != NULL) {
5938 5938 anon_idx = svd->anon_index + seg_page(seg, addr);
5939 5939 ASSERT(seg->s_szc == 0 ||
5940 5940 IS_P2ALIGNED(anon_idx, pgcnt));
5941 5941 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
5942 5942 }
5943 5943
5944 5944 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
5945 5945 evp = &svd->vpage[seg_page(seg, addr + len)];
5946 5946
5947 5947 /*
5948 5948 * See Statement at the beginning of segvn_lockop regarding
5949 5949 * the way cowcnts and lckcnts are handled.
5950 5950 */
5951 5951 for (svp = &svd->vpage[seg_page(seg, addr)]; svp < evp; svp++) {
5952 5952
5953 5953 if (seg->s_szc != 0) {
5954 5954 if (amp != NULL) {
5955 5955 anon_array_enter(amp, anon_idx,
5956 5956 &cookie);
5957 5957 }
5958 5958 if (IS_P2ALIGNED(anon_idx, pgcnt) &&
5959 5959 !segvn_claim_pages(seg, svp, offset,
5960 5960 anon_idx, prot)) {
5961 5961 if (amp != NULL) {
5962 5962 anon_array_exit(&cookie);
5963 5963 }
5964 5964 break;
5965 5965 }
5966 5966 if (amp != NULL) {
5967 5967 anon_array_exit(&cookie);
5968 5968 }
5969 5969 anon_idx++;
5970 5970 } else {
5971 5971 if (amp != NULL) {
5972 5972 anon_array_enter(amp, anon_idx,
5973 5973 &cookie);
5974 5974 ap = anon_get_ptr(amp->ahp, anon_idx++);
5975 5975 }
5976 5976
5977 5977 if (VPP_ISPPLOCK(svp) &&
5978 5978 VPP_PROT(svp) != prot) {
5979 5979
5980 5980 if (amp == NULL || ap == NULL) {
5981 5981 vp = svd->vp;
5982 5982 off = offset;
5983 5983 } else
5984 5984 swap_xlate(ap, &vp, &off);
5985 5985 if (amp != NULL)
5986 5986 anon_array_exit(&cookie);
5987 5987
5988 5988 if ((pp = page_lookup(vp, off,
5989 5989 SE_SHARED)) == NULL) {
5990 5990 panic("segvn_setprot: no page");
5991 5991 /*NOTREACHED*/
5992 5992 }
5993 5993 ASSERT(seg->s_szc == 0);
5994 5994 if ((VPP_PROT(svp) ^ prot) &
5995 5995 PROT_WRITE) {
5996 5996 if (prot & PROT_WRITE) {
5997 5997 if (!page_addclaim(
5998 5998 pp)) {
5999 5999 page_unlock(pp);
6000 6000 break;
6001 6001 }
6002 6002 } else {
6003 6003 if (!page_subclaim(
6004 6004 pp)) {
6005 6005 page_unlock(pp);
6006 6006 break;
6007 6007 }
6008 6008 }
6009 6009 }
6010 6010 page_unlock(pp);
6011 6011 } else if (amp != NULL)
6012 6012 anon_array_exit(&cookie);
6013 6013 }
6014 6014 VPP_SETPROT(svp, prot);
6015 6015 offset += PAGESIZE;
6016 6016 }
6017 6017 if (amp != NULL)
6018 6018 ANON_LOCK_EXIT(&->a_rwlock);
6019 6019
6020 6020 /*
6021 6021 * Did we terminate prematurely? If so, simply unload
6022 6022 * the translations to the things we've updated so far.
6023 6023 */
6024 6024 if (svp != evp) {
6025 6025 if (unload_done) {
6026 6026 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6027 6027 return (IE_NOMEM);
6028 6028 }
6029 6029 len = (svp - &svd->vpage[seg_page(seg, addr)]) *
6030 6030 PAGESIZE;
6031 6031 ASSERT(seg->s_szc == 0 || IS_P2ALIGNED(len, pgsz));
6032 6032 if (len != 0)
6033 6033 hat_unload(seg->s_as->a_hat, addr,
6034 6034 len, HAT_UNLOAD);
6035 6035 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6036 6036 return (IE_NOMEM);
6037 6037 }
6038 6038 } else {
6039 6039 segvn_vpage(seg);
6040 6040 if (svd->vpage == NULL) {
6041 6041 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6042 6042 return (ENOMEM);
6043 6043 }
6044 6044 svd->pageprot = 1;
6045 6045 evp = &svd->vpage[seg_page(seg, addr + len)];
6046 6046 for (svp = &svd->vpage[seg_page(seg, addr)]; svp < evp; svp++) {
6047 6047 VPP_SETPROT(svp, prot);
6048 6048 }
6049 6049 }
6050 6050
6051 6051 if (unload_done) {
6052 6052 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6053 6053 return (0);
6054 6054 }
6055 6055
6056 6056 if (((prot & PROT_WRITE) != 0 &&
6057 6057 (svd->vp != NULL || svd->type == MAP_PRIVATE)) ||
6058 6058 (prot & ~PROT_USER) == PROT_NONE) {
6059 6059 /*
6060 6060 * Either private or shared data with write access (in
6061 6061 * which case we need to throw out all former translations
6062 6062 * so that we get the right translations set up on fault
6063 6063 * and we don't allow write access to any copy-on-write pages
6064 6064 * that might be around or to prevent write access to pages
6065 6065 * representing holes in a file), or we don't have permission
6066 6066 * to access the memory at all (in which case we have to
6067 6067 * unload any current translations that might exist).
6068 6068 */
6069 6069 hat_unload(seg->s_as->a_hat, addr, len, HAT_UNLOAD);
6070 6070 } else {
6071 6071 /*
6072 6072 * A shared mapping or a private mapping in which write
6073 6073 * protection is going to be denied - just change all the
6074 6074 * protections over the range of addresses in question.
6075 6075 * segvn does not support any other attributes other
6076 6076 * than prot so we can use hat_chgattr.
6077 6077 */
6078 6078 hat_chgattr(seg->s_as->a_hat, addr, len, prot);
6079 6079 }
6080 6080
6081 6081 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6082 6082
6083 6083 return (0);
6084 6084 }
6085 6085
6086 6086 /*
6087 6087 * segvn_setpagesize is called via SEGOP_SETPAGESIZE from as_setpagesize,
6088 6088 * to determine if the seg is capable of mapping the requested szc.
6089 6089 */
6090 6090 static int
6091 6091 segvn_setpagesize(struct seg *seg, caddr_t addr, size_t len, uint_t szc)
6092 6092 {
|
↓ open down ↓ |
305 lines elided |
↑ open up ↑ |
6093 6093 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6094 6094 struct segvn_data *nsvd;
6095 6095 struct anon_map *amp = svd->amp;
6096 6096 struct seg *nseg;
6097 6097 caddr_t eaddr = addr + len, a;
6098 6098 size_t pgsz = page_get_pagesize(szc);
6099 6099 pgcnt_t pgcnt = page_get_pagecnt(szc);
6100 6100 int err;
6101 6101 u_offset_t off = svd->offset + (uintptr_t)(addr - seg->s_base);
6102 6102
6103 - ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
6103 + ASSERT(seg->s_as && AS_WRITE_HELD(seg->s_as));
6104 6104 ASSERT(addr >= seg->s_base && eaddr <= seg->s_base + seg->s_size);
6105 6105
6106 6106 if (seg->s_szc == szc || segvn_lpg_disable != 0) {
6107 6107 return (0);
6108 6108 }
6109 6109
6110 6110 /*
6111 6111 * addr should always be pgsz aligned but eaddr may be misaligned if
6112 6112 * it's at the end of the segment.
6113 6113 *
6114 6114 * XXX we should assert this condition since as_setpagesize() logic
6115 6115 * guarantees it.
6116 6116 */
6117 6117 if (!IS_P2ALIGNED(addr, pgsz) ||
6118 6118 (!IS_P2ALIGNED(eaddr, pgsz) &&
6119 6119 eaddr != seg->s_base + seg->s_size)) {
6120 6120
6121 6121 segvn_setpgsz_align_err++;
6122 6122 return (EINVAL);
6123 6123 }
6124 6124
6125 6125 if (amp != NULL && svd->type == MAP_SHARED) {
6126 6126 ulong_t an_idx = svd->anon_index + seg_page(seg, addr);
6127 6127 if (!IS_P2ALIGNED(an_idx, pgcnt)) {
6128 6128
6129 6129 segvn_setpgsz_anon_align_err++;
6130 6130 return (EINVAL);
6131 6131 }
6132 6132 }
6133 6133
6134 6134 if ((svd->flags & MAP_NORESERVE) || seg->s_as == &kas ||
6135 6135 szc > segvn_maxpgszc) {
6136 6136 return (EINVAL);
6137 6137 }
6138 6138
6139 6139 /* paranoid check */
6140 6140 if (svd->vp != NULL &&
6141 6141 (IS_SWAPFSVP(svd->vp) || VN_ISKAS(svd->vp))) {
6142 6142 return (EINVAL);
6143 6143 }
6144 6144
6145 6145 if (seg->s_szc == 0 && svd->vp != NULL &&
6146 6146 map_addr_vacalign_check(addr, off)) {
6147 6147 return (EINVAL);
6148 6148 }
6149 6149
6150 6150 /*
6151 6151 * Check that protections are the same within new page
6152 6152 * size boundaries.
6153 6153 */
6154 6154 if (svd->pageprot) {
6155 6155 for (a = addr; a < eaddr; a += pgsz) {
6156 6156 if ((a + pgsz) > eaddr) {
6157 6157 if (!sameprot(seg, a, eaddr - a)) {
6158 6158 return (EINVAL);
6159 6159 }
6160 6160 } else {
6161 6161 if (!sameprot(seg, a, pgsz)) {
6162 6162 return (EINVAL);
6163 6163 }
6164 6164 }
6165 6165 }
6166 6166 }
6167 6167
6168 6168 /*
6169 6169 * Since we are changing page size we first have to flush
6170 6170 * the cache. This makes sure all the pagelock calls have
6171 6171 * to recheck protections.
6172 6172 */
6173 6173 if (svd->softlockcnt > 0) {
6174 6174 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6175 6175
6176 6176 /*
6177 6177 * If this is shared segment non 0 softlockcnt
6178 6178 * means locked pages are still in use.
6179 6179 */
6180 6180 if (svd->type == MAP_SHARED) {
6181 6181 return (EAGAIN);
6182 6182 }
6183 6183
6184 6184 /*
6185 6185 * Since we do have the segvn writers lock nobody can fill
6186 6186 * the cache with entries belonging to this seg during
6187 6187 * the purge. The flush either succeeds or we still have
6188 6188 * pending I/Os.
6189 6189 */
6190 6190 segvn_purge(seg);
6191 6191 if (svd->softlockcnt > 0) {
6192 6192 return (EAGAIN);
6193 6193 }
6194 6194 }
6195 6195
6196 6196 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
6197 6197 ASSERT(svd->amp == NULL);
6198 6198 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6199 6199 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
6200 6200 HAT_REGION_TEXT);
6201 6201 svd->rcookie = HAT_INVALID_REGION_COOKIE;
6202 6202 } else if (svd->tr_state == SEGVN_TR_INIT) {
6203 6203 svd->tr_state = SEGVN_TR_OFF;
6204 6204 } else if (svd->tr_state == SEGVN_TR_ON) {
6205 6205 ASSERT(svd->amp != NULL);
6206 6206 segvn_textunrepl(seg, 1);
6207 6207 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
6208 6208 amp = NULL;
6209 6209 }
6210 6210
6211 6211 /*
6212 6212 * Operation for sub range of existing segment.
6213 6213 */
6214 6214 if (addr != seg->s_base || eaddr != (seg->s_base + seg->s_size)) {
6215 6215 if (szc < seg->s_szc) {
6216 6216 VM_STAT_ADD(segvnvmstats.demoterange[2]);
6217 6217 err = segvn_demote_range(seg, addr, len, SDR_RANGE, 0);
6218 6218 if (err == 0) {
6219 6219 return (IE_RETRY);
6220 6220 }
6221 6221 if (err == ENOMEM) {
6222 6222 return (IE_NOMEM);
6223 6223 }
6224 6224 return (err);
6225 6225 }
6226 6226 if (addr != seg->s_base) {
6227 6227 nseg = segvn_split_seg(seg, addr);
6228 6228 if (eaddr != (nseg->s_base + nseg->s_size)) {
6229 6229 /* eaddr is szc aligned */
6230 6230 (void) segvn_split_seg(nseg, eaddr);
6231 6231 }
6232 6232 return (IE_RETRY);
6233 6233 }
6234 6234 if (eaddr != (seg->s_base + seg->s_size)) {
6235 6235 /* eaddr is szc aligned */
6236 6236 (void) segvn_split_seg(seg, eaddr);
6237 6237 }
6238 6238 return (IE_RETRY);
6239 6239 }
6240 6240
6241 6241 /*
6242 6242 * Break any low level sharing and reset seg->s_szc to 0.
6243 6243 */
6244 6244 if ((err = segvn_clrszc(seg)) != 0) {
6245 6245 if (err == ENOMEM) {
6246 6246 err = IE_NOMEM;
6247 6247 }
6248 6248 return (err);
6249 6249 }
6250 6250 ASSERT(seg->s_szc == 0);
6251 6251
6252 6252 /*
6253 6253 * If the end of the current segment is not pgsz aligned
6254 6254 * then attempt to concatenate with the next segment.
6255 6255 */
6256 6256 if (!IS_P2ALIGNED(eaddr, pgsz)) {
6257 6257 nseg = AS_SEGNEXT(seg->s_as, seg);
6258 6258 if (nseg == NULL || nseg == seg || eaddr != nseg->s_base) {
6259 6259 return (ENOMEM);
6260 6260 }
6261 6261 if (nseg->s_ops != &segvn_ops) {
6262 6262 return (EINVAL);
6263 6263 }
6264 6264 nsvd = (struct segvn_data *)nseg->s_data;
6265 6265 if (nsvd->softlockcnt > 0) {
6266 6266 /*
6267 6267 * If this is shared segment non 0 softlockcnt
6268 6268 * means locked pages are still in use.
6269 6269 */
6270 6270 if (nsvd->type == MAP_SHARED) {
6271 6271 return (EAGAIN);
6272 6272 }
6273 6273 segvn_purge(nseg);
6274 6274 if (nsvd->softlockcnt > 0) {
6275 6275 return (EAGAIN);
6276 6276 }
6277 6277 }
6278 6278 err = segvn_clrszc(nseg);
6279 6279 if (err == ENOMEM) {
6280 6280 err = IE_NOMEM;
6281 6281 }
6282 6282 if (err != 0) {
6283 6283 return (err);
6284 6284 }
6285 6285 ASSERT(nsvd->rcookie == HAT_INVALID_REGION_COOKIE);
6286 6286 err = segvn_concat(seg, nseg, 1);
6287 6287 if (err == -1) {
6288 6288 return (EINVAL);
6289 6289 }
6290 6290 if (err == -2) {
6291 6291 return (IE_NOMEM);
6292 6292 }
6293 6293 return (IE_RETRY);
6294 6294 }
6295 6295
6296 6296 /*
6297 6297 * May need to re-align anon array to
6298 6298 * new szc.
6299 6299 */
6300 6300 if (amp != NULL) {
6301 6301 if (!IS_P2ALIGNED(svd->anon_index, pgcnt)) {
6302 6302 struct anon_hdr *nahp;
6303 6303
6304 6304 ASSERT(svd->type == MAP_PRIVATE);
6305 6305
6306 6306 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6307 6307 ASSERT(amp->refcnt == 1);
6308 6308 nahp = anon_create(btop(amp->size), ANON_NOSLEEP);
6309 6309 if (nahp == NULL) {
6310 6310 ANON_LOCK_EXIT(&->a_rwlock);
6311 6311 return (IE_NOMEM);
6312 6312 }
6313 6313 if (anon_copy_ptr(amp->ahp, svd->anon_index,
6314 6314 nahp, 0, btop(seg->s_size), ANON_NOSLEEP)) {
6315 6315 anon_release(nahp, btop(amp->size));
6316 6316 ANON_LOCK_EXIT(&->a_rwlock);
6317 6317 return (IE_NOMEM);
6318 6318 }
6319 6319 anon_release(amp->ahp, btop(amp->size));
6320 6320 amp->ahp = nahp;
6321 6321 svd->anon_index = 0;
6322 6322 ANON_LOCK_EXIT(&->a_rwlock);
6323 6323 }
6324 6324 }
6325 6325 if (svd->vp != NULL && szc != 0) {
6326 6326 struct vattr va;
6327 6327 u_offset_t eoffpage = svd->offset;
6328 6328 va.va_mask = AT_SIZE;
6329 6329 eoffpage += seg->s_size;
6330 6330 eoffpage = btopr(eoffpage);
6331 6331 if (VOP_GETATTR(svd->vp, &va, 0, svd->cred, NULL) != 0) {
6332 6332 segvn_setpgsz_getattr_err++;
6333 6333 return (EINVAL);
6334 6334 }
6335 6335 if (btopr(va.va_size) < eoffpage) {
6336 6336 segvn_setpgsz_eof_err++;
6337 6337 return (EINVAL);
6338 6338 }
6339 6339 if (amp != NULL) {
6340 6340 /*
6341 6341 * anon_fill_cow_holes() may call VOP_GETPAGE().
6342 6342 * don't take anon map lock here to avoid holding it
6343 6343 * across VOP_GETPAGE() calls that may call back into
6344 6344 * segvn for klsutering checks. We don't really need
6345 6345 * anon map lock here since it's a private segment and
6346 6346 * we hold as level lock as writers.
6347 6347 */
6348 6348 if ((err = anon_fill_cow_holes(seg, seg->s_base,
6349 6349 amp->ahp, svd->anon_index, svd->vp, svd->offset,
6350 6350 seg->s_size, szc, svd->prot, svd->vpage,
6351 6351 svd->cred)) != 0) {
6352 6352 return (EINVAL);
6353 6353 }
6354 6354 }
6355 6355 segvn_setvnode_mpss(svd->vp);
6356 6356 }
6357 6357
6358 6358 if (amp != NULL) {
6359 6359 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6360 6360 if (svd->type == MAP_PRIVATE) {
6361 6361 amp->a_szc = szc;
6362 6362 } else if (szc > amp->a_szc) {
6363 6363 amp->a_szc = szc;
6364 6364 }
6365 6365 ANON_LOCK_EXIT(&->a_rwlock);
6366 6366 }
6367 6367
6368 6368 seg->s_szc = szc;
6369 6369
6370 6370 return (0);
6371 6371 }
6372 6372
6373 6373 static int
6374 6374 segvn_clrszc(struct seg *seg)
6375 6375 {
6376 6376 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6377 6377 struct anon_map *amp = svd->amp;
6378 6378 size_t pgsz;
6379 6379 pgcnt_t pages;
6380 6380 int err = 0;
|
↓ open down ↓ |
267 lines elided |
↑ open up ↑ |
6381 6381 caddr_t a = seg->s_base;
6382 6382 caddr_t ea = a + seg->s_size;
6383 6383 ulong_t an_idx = svd->anon_index;
6384 6384 vnode_t *vp = svd->vp;
6385 6385 struct vpage *vpage = svd->vpage;
6386 6386 page_t *anon_pl[1 + 1], *pp;
6387 6387 struct anon *ap, *oldap;
6388 6388 uint_t prot = svd->prot, vpprot;
6389 6389 int pageflag = 0;
6390 6390
6391 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock) ||
6391 + ASSERT(AS_WRITE_HELD(seg->s_as) ||
6392 6392 SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
6393 6393 ASSERT(svd->softlockcnt == 0);
6394 6394
6395 6395 if (vp == NULL && amp == NULL) {
6396 6396 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6397 6397 seg->s_szc = 0;
6398 6398 return (0);
6399 6399 }
6400 6400
6401 6401 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
6402 6402 ASSERT(svd->amp == NULL);
6403 6403 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6404 6404 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
6405 6405 HAT_REGION_TEXT);
6406 6406 svd->rcookie = HAT_INVALID_REGION_COOKIE;
6407 6407 } else if (svd->tr_state == SEGVN_TR_ON) {
6408 6408 ASSERT(svd->amp != NULL);
6409 6409 segvn_textunrepl(seg, 1);
6410 6410 ASSERT(svd->amp == NULL && svd->tr_state == SEGVN_TR_OFF);
6411 6411 amp = NULL;
6412 6412 } else {
6413 6413 if (svd->tr_state != SEGVN_TR_OFF) {
6414 6414 ASSERT(svd->tr_state == SEGVN_TR_INIT);
6415 6415 svd->tr_state = SEGVN_TR_OFF;
6416 6416 }
6417 6417
6418 6418 /*
6419 6419 * do HAT_UNLOAD_UNMAP since we are changing the pagesize.
6420 6420 * unload argument is 0 when we are freeing the segment
6421 6421 * and unload was already done.
6422 6422 */
6423 6423 hat_unload(seg->s_as->a_hat, seg->s_base, seg->s_size,
6424 6424 HAT_UNLOAD_UNMAP);
6425 6425 }
6426 6426
6427 6427 if (amp == NULL || svd->type == MAP_SHARED) {
6428 6428 seg->s_szc = 0;
6429 6429 return (0);
6430 6430 }
6431 6431
6432 6432 pgsz = page_get_pagesize(seg->s_szc);
6433 6433 pages = btop(pgsz);
6434 6434
6435 6435 /*
6436 6436 * XXX anon rwlock is not really needed because this is a
6437 6437 * private segment and we are writers.
6438 6438 */
6439 6439 ANON_LOCK_ENTER(&->a_rwlock, RW_WRITER);
6440 6440
6441 6441 for (; a < ea; a += pgsz, an_idx += pages) {
6442 6442 if ((oldap = anon_get_ptr(amp->ahp, an_idx)) != NULL) {
6443 6443 ASSERT(vpage != NULL || svd->pageprot == 0);
6444 6444 if (vpage != NULL) {
6445 6445 ASSERT(sameprot(seg, a, pgsz));
6446 6446 prot = VPP_PROT(vpage);
6447 6447 pageflag = VPP_ISPPLOCK(vpage) ? LOCK_PAGE : 0;
6448 6448 }
6449 6449 if (seg->s_szc != 0) {
6450 6450 ASSERT(vp == NULL || anon_pages(amp->ahp,
6451 6451 an_idx, pages) == pages);
6452 6452 if ((err = anon_map_demotepages(amp, an_idx,
6453 6453 seg, a, prot, vpage, svd->cred)) != 0) {
6454 6454 goto out;
6455 6455 }
6456 6456 } else {
6457 6457 if (oldap->an_refcnt == 1) {
6458 6458 continue;
6459 6459 }
6460 6460 if ((err = anon_getpage(&oldap, &vpprot,
6461 6461 anon_pl, PAGESIZE, seg, a, S_READ,
6462 6462 svd->cred))) {
6463 6463 goto out;
6464 6464 }
6465 6465 if ((pp = anon_private(&ap, seg, a, prot,
6466 6466 anon_pl[0], pageflag, svd->cred)) == NULL) {
6467 6467 err = ENOMEM;
6468 6468 goto out;
6469 6469 }
6470 6470 anon_decref(oldap);
6471 6471 (void) anon_set_ptr(amp->ahp, an_idx, ap,
6472 6472 ANON_SLEEP);
6473 6473 page_unlock(pp);
6474 6474 }
6475 6475 }
6476 6476 vpage = (vpage == NULL) ? NULL : vpage + pages;
6477 6477 }
6478 6478
6479 6479 amp->a_szc = 0;
6480 6480 seg->s_szc = 0;
6481 6481 out:
6482 6482 ANON_LOCK_EXIT(&->a_rwlock);
6483 6483 return (err);
6484 6484 }
6485 6485
6486 6486 static int
6487 6487 segvn_claim_pages(
6488 6488 struct seg *seg,
6489 6489 struct vpage *svp,
6490 6490 u_offset_t off,
6491 6491 ulong_t anon_idx,
6492 6492 uint_t prot)
6493 6493 {
6494 6494 pgcnt_t pgcnt = page_get_pagecnt(seg->s_szc);
6495 6495 size_t ppasize = (pgcnt + 1) * sizeof (page_t *);
6496 6496 page_t **ppa;
6497 6497 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6498 6498 struct anon_map *amp = svd->amp;
6499 6499 struct vpage *evp = svp + pgcnt;
6500 6500 caddr_t addr = ((uintptr_t)(svp - svd->vpage) << PAGESHIFT)
6501 6501 + seg->s_base;
6502 6502 struct anon *ap;
6503 6503 struct vnode *vp = svd->vp;
6504 6504 page_t *pp;
6505 6505 pgcnt_t pg_idx, i;
6506 6506 int err = 0;
6507 6507 anoff_t aoff;
6508 6508 int anon = (amp != NULL) ? 1 : 0;
6509 6509
6510 6510 ASSERT(svd->type == MAP_PRIVATE);
6511 6511 ASSERT(svd->vpage != NULL);
6512 6512 ASSERT(seg->s_szc != 0);
6513 6513 ASSERT(IS_P2ALIGNED(pgcnt, pgcnt));
6514 6514 ASSERT(amp == NULL || IS_P2ALIGNED(anon_idx, pgcnt));
6515 6515 ASSERT(sameprot(seg, addr, pgcnt << PAGESHIFT));
6516 6516
6517 6517 if (VPP_PROT(svp) == prot)
6518 6518 return (1);
6519 6519 if (!((VPP_PROT(svp) ^ prot) & PROT_WRITE))
6520 6520 return (1);
6521 6521
6522 6522 ppa = kmem_alloc(ppasize, KM_SLEEP);
6523 6523 if (anon && vp != NULL) {
6524 6524 if (anon_get_ptr(amp->ahp, anon_idx) == NULL) {
6525 6525 anon = 0;
6526 6526 ASSERT(!anon_pages(amp->ahp, anon_idx, pgcnt));
6527 6527 }
6528 6528 ASSERT(!anon ||
6529 6529 anon_pages(amp->ahp, anon_idx, pgcnt) == pgcnt);
6530 6530 }
6531 6531
6532 6532 for (*ppa = NULL, pg_idx = 0; svp < evp; svp++, anon_idx++) {
6533 6533 if (!VPP_ISPPLOCK(svp))
6534 6534 continue;
6535 6535 if (anon) {
6536 6536 ap = anon_get_ptr(amp->ahp, anon_idx);
6537 6537 if (ap == NULL) {
6538 6538 panic("segvn_claim_pages: no anon slot");
6539 6539 }
6540 6540 swap_xlate(ap, &vp, &aoff);
6541 6541 off = (u_offset_t)aoff;
6542 6542 }
6543 6543 ASSERT(vp != NULL);
6544 6544 if ((pp = page_lookup(vp,
6545 6545 (u_offset_t)off, SE_SHARED)) == NULL) {
6546 6546 panic("segvn_claim_pages: no page");
6547 6547 }
6548 6548 ppa[pg_idx++] = pp;
6549 6549 off += PAGESIZE;
6550 6550 }
6551 6551
6552 6552 if (ppa[0] == NULL) {
6553 6553 kmem_free(ppa, ppasize);
6554 6554 return (1);
6555 6555 }
6556 6556
6557 6557 ASSERT(pg_idx <= pgcnt);
6558 6558 ppa[pg_idx] = NULL;
6559 6559
6560 6560
6561 6561 /* Find each large page within ppa, and adjust its claim */
6562 6562
6563 6563 /* Does ppa cover a single large page? */
6564 6564 if (ppa[0]->p_szc == seg->s_szc) {
6565 6565 if (prot & PROT_WRITE)
6566 6566 err = page_addclaim_pages(ppa);
6567 6567 else
6568 6568 err = page_subclaim_pages(ppa);
6569 6569 } else {
6570 6570 for (i = 0; ppa[i]; i += pgcnt) {
6571 6571 ASSERT(IS_P2ALIGNED(page_pptonum(ppa[i]), pgcnt));
6572 6572 if (prot & PROT_WRITE)
6573 6573 err = page_addclaim_pages(&ppa[i]);
6574 6574 else
6575 6575 err = page_subclaim_pages(&ppa[i]);
6576 6576 if (err == 0)
6577 6577 break;
6578 6578 }
6579 6579 }
6580 6580
6581 6581 for (i = 0; i < pg_idx; i++) {
6582 6582 ASSERT(ppa[i] != NULL);
6583 6583 page_unlock(ppa[i]);
6584 6584 }
6585 6585
6586 6586 kmem_free(ppa, ppasize);
6587 6587 return (err);
6588 6588 }
6589 6589
6590 6590 /*
6591 6591 * Returns right (upper address) segment if split occurred.
6592 6592 * If the address is equal to the beginning or end of its segment it returns
|
↓ open down ↓ |
191 lines elided |
↑ open up ↑ |
6593 6593 * the current segment.
6594 6594 */
6595 6595 static struct seg *
6596 6596 segvn_split_seg(struct seg *seg, caddr_t addr)
6597 6597 {
6598 6598 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6599 6599 struct seg *nseg;
6600 6600 size_t nsize;
6601 6601 struct segvn_data *nsvd;
6602 6602
6603 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
6603 + ASSERT(AS_WRITE_HELD(seg->s_as));
6604 6604 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6605 6605
6606 6606 ASSERT(addr >= seg->s_base);
6607 6607 ASSERT(addr <= seg->s_base + seg->s_size);
6608 6608 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6609 6609
6610 6610 if (addr == seg->s_base || addr == seg->s_base + seg->s_size)
6611 6611 return (seg);
6612 6612
6613 6613 nsize = seg->s_base + seg->s_size - addr;
6614 6614 seg->s_size = addr - seg->s_base;
6615 6615 nseg = seg_alloc(seg->s_as, addr, nsize);
6616 6616 ASSERT(nseg != NULL);
6617 6617 nseg->s_ops = seg->s_ops;
6618 6618 nsvd = kmem_cache_alloc(segvn_cache, KM_SLEEP);
6619 6619 nseg->s_data = (void *)nsvd;
6620 6620 nseg->s_szc = seg->s_szc;
6621 6621 *nsvd = *svd;
6622 6622 ASSERT(nsvd->rcookie == HAT_INVALID_REGION_COOKIE);
6623 6623 nsvd->seg = nseg;
6624 6624 rw_init(&nsvd->lock, NULL, RW_DEFAULT, NULL);
6625 6625
6626 6626 if (nsvd->vp != NULL) {
6627 6627 VN_HOLD(nsvd->vp);
6628 6628 nsvd->offset = svd->offset +
6629 6629 (uintptr_t)(nseg->s_base - seg->s_base);
6630 6630 if (nsvd->type == MAP_SHARED)
6631 6631 lgrp_shm_policy_init(NULL, nsvd->vp);
6632 6632 } else {
6633 6633 /*
6634 6634 * The offset for an anonymous segment has no signifigance in
6635 6635 * terms of an offset into a file. If we were to use the above
6636 6636 * calculation instead, the structures read out of
6637 6637 * /proc/<pid>/xmap would be more difficult to decipher since
6638 6638 * it would be unclear whether two seemingly contiguous
6639 6639 * prxmap_t structures represented different segments or a
6640 6640 * single segment that had been split up into multiple prxmap_t
6641 6641 * structures (e.g. if some part of the segment had not yet
6642 6642 * been faulted in).
6643 6643 */
6644 6644 nsvd->offset = 0;
6645 6645 }
6646 6646
6647 6647 ASSERT(svd->softlockcnt == 0);
6648 6648 ASSERT(svd->softlockcnt_sbase == 0);
6649 6649 ASSERT(svd->softlockcnt_send == 0);
6650 6650 crhold(svd->cred);
6651 6651
6652 6652 if (svd->vpage != NULL) {
6653 6653 size_t bytes = vpgtob(seg_pages(seg));
6654 6654 size_t nbytes = vpgtob(seg_pages(nseg));
6655 6655 struct vpage *ovpage = svd->vpage;
6656 6656
6657 6657 svd->vpage = kmem_alloc(bytes, KM_SLEEP);
6658 6658 bcopy(ovpage, svd->vpage, bytes);
6659 6659 nsvd->vpage = kmem_alloc(nbytes, KM_SLEEP);
6660 6660 bcopy(ovpage + seg_pages(seg), nsvd->vpage, nbytes);
6661 6661 kmem_free(ovpage, bytes + nbytes);
6662 6662 }
6663 6663 if (svd->amp != NULL && svd->type == MAP_PRIVATE) {
6664 6664 struct anon_map *oamp = svd->amp, *namp;
6665 6665 struct anon_hdr *nahp;
6666 6666
6667 6667 ANON_LOCK_ENTER(&oamp->a_rwlock, RW_WRITER);
6668 6668 ASSERT(oamp->refcnt == 1);
6669 6669 nahp = anon_create(btop(seg->s_size), ANON_SLEEP);
6670 6670 (void) anon_copy_ptr(oamp->ahp, svd->anon_index,
6671 6671 nahp, 0, btop(seg->s_size), ANON_SLEEP);
6672 6672
6673 6673 namp = anonmap_alloc(nseg->s_size, 0, ANON_SLEEP);
6674 6674 namp->a_szc = nseg->s_szc;
6675 6675 (void) anon_copy_ptr(oamp->ahp,
6676 6676 svd->anon_index + btop(seg->s_size),
6677 6677 namp->ahp, 0, btop(nseg->s_size), ANON_SLEEP);
6678 6678 anon_release(oamp->ahp, btop(oamp->size));
6679 6679 oamp->ahp = nahp;
6680 6680 oamp->size = seg->s_size;
6681 6681 svd->anon_index = 0;
6682 6682 nsvd->amp = namp;
6683 6683 nsvd->anon_index = 0;
6684 6684 ANON_LOCK_EXIT(&oamp->a_rwlock);
6685 6685 } else if (svd->amp != NULL) {
6686 6686 pgcnt_t pgcnt = page_get_pagecnt(seg->s_szc);
6687 6687 ASSERT(svd->amp == nsvd->amp);
6688 6688 ASSERT(seg->s_szc <= svd->amp->a_szc);
6689 6689 nsvd->anon_index = svd->anon_index + seg_pages(seg);
6690 6690 ASSERT(IS_P2ALIGNED(nsvd->anon_index, pgcnt));
6691 6691 ANON_LOCK_ENTER(&svd->amp->a_rwlock, RW_WRITER);
6692 6692 svd->amp->refcnt++;
6693 6693 ANON_LOCK_EXIT(&svd->amp->a_rwlock);
6694 6694 }
6695 6695
6696 6696 /*
6697 6697 * Split the amount of swap reserved.
6698 6698 */
6699 6699 if (svd->swresv) {
6700 6700 /*
6701 6701 * For MAP_NORESERVE, only allocate swap reserve for pages
6702 6702 * being used. Other segments get enough to cover whole
6703 6703 * segment.
6704 6704 */
6705 6705 if (svd->flags & MAP_NORESERVE) {
6706 6706 size_t oswresv;
6707 6707
6708 6708 ASSERT(svd->amp);
6709 6709 oswresv = svd->swresv;
6710 6710 svd->swresv = ptob(anon_pages(svd->amp->ahp,
6711 6711 svd->anon_index, btop(seg->s_size)));
6712 6712 nsvd->swresv = ptob(anon_pages(nsvd->amp->ahp,
6713 6713 nsvd->anon_index, btop(nseg->s_size)));
6714 6714 ASSERT(oswresv >= (svd->swresv + nsvd->swresv));
6715 6715 } else {
6716 6716 if (svd->pageswap) {
6717 6717 svd->swresv = segvn_count_swap_by_vpages(seg);
6718 6718 ASSERT(nsvd->swresv >= svd->swresv);
6719 6719 nsvd->swresv -= svd->swresv;
6720 6720 } else {
6721 6721 ASSERT(svd->swresv == seg->s_size +
6722 6722 nseg->s_size);
6723 6723 svd->swresv = seg->s_size;
6724 6724 nsvd->swresv = nseg->s_size;
6725 6725 }
6726 6726 }
6727 6727 }
6728 6728
6729 6729 return (nseg);
6730 6730 }
6731 6731
6732 6732 /*
6733 6733 * called on memory operations (unmap, setprot, setpagesize) for a subset
6734 6734 * of a large page segment to either demote the memory range (SDR_RANGE)
6735 6735 * or the ends (SDR_END) by addr/len.
6736 6736 *
6737 6737 * returns 0 on success. returns errno, including ENOMEM, on failure.
6738 6738 */
6739 6739 static int
6740 6740 segvn_demote_range(
6741 6741 struct seg *seg,
6742 6742 caddr_t addr,
6743 6743 size_t len,
6744 6744 int flag,
6745 6745 uint_t szcvec)
6746 6746 {
6747 6747 caddr_t eaddr = addr + len;
|
↓ open down ↓ |
134 lines elided |
↑ open up ↑ |
6748 6748 caddr_t lpgaddr, lpgeaddr;
6749 6749 struct seg *nseg;
6750 6750 struct seg *badseg1 = NULL;
6751 6751 struct seg *badseg2 = NULL;
6752 6752 size_t pgsz;
6753 6753 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6754 6754 int err;
6755 6755 uint_t szc = seg->s_szc;
6756 6756 uint_t tszcvec;
6757 6757
6758 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock));
6758 + ASSERT(AS_WRITE_HELD(seg->s_as));
6759 6759 ASSERT(svd->tr_state == SEGVN_TR_OFF);
6760 6760 ASSERT(szc != 0);
6761 6761 pgsz = page_get_pagesize(szc);
6762 6762 ASSERT(seg->s_base != addr || seg->s_size != len);
6763 6763 ASSERT(addr >= seg->s_base && eaddr <= seg->s_base + seg->s_size);
6764 6764 ASSERT(svd->softlockcnt == 0);
6765 6765 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
6766 6766 ASSERT(szcvec == 0 || (flag == SDR_END && svd->type == MAP_SHARED));
6767 6767
6768 6768 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
6769 6769 ASSERT(flag == SDR_RANGE || eaddr < lpgeaddr || addr > lpgaddr);
6770 6770 if (flag == SDR_RANGE) {
6771 6771 /* demote entire range */
6772 6772 badseg1 = nseg = segvn_split_seg(seg, lpgaddr);
6773 6773 (void) segvn_split_seg(nseg, lpgeaddr);
6774 6774 ASSERT(badseg1->s_base == lpgaddr);
6775 6775 ASSERT(badseg1->s_size == lpgeaddr - lpgaddr);
6776 6776 } else if (addr != lpgaddr) {
6777 6777 ASSERT(flag == SDR_END);
6778 6778 badseg1 = nseg = segvn_split_seg(seg, lpgaddr);
6779 6779 if (eaddr != lpgeaddr && eaddr > lpgaddr + pgsz &&
6780 6780 eaddr < lpgaddr + 2 * pgsz) {
6781 6781 (void) segvn_split_seg(nseg, lpgeaddr);
6782 6782 ASSERT(badseg1->s_base == lpgaddr);
6783 6783 ASSERT(badseg1->s_size == 2 * pgsz);
6784 6784 } else {
6785 6785 nseg = segvn_split_seg(nseg, lpgaddr + pgsz);
6786 6786 ASSERT(badseg1->s_base == lpgaddr);
6787 6787 ASSERT(badseg1->s_size == pgsz);
6788 6788 if (eaddr != lpgeaddr && eaddr > lpgaddr + pgsz) {
6789 6789 ASSERT(lpgeaddr - lpgaddr > 2 * pgsz);
6790 6790 nseg = segvn_split_seg(nseg, lpgeaddr - pgsz);
6791 6791 badseg2 = nseg;
6792 6792 (void) segvn_split_seg(nseg, lpgeaddr);
6793 6793 ASSERT(badseg2->s_base == lpgeaddr - pgsz);
6794 6794 ASSERT(badseg2->s_size == pgsz);
6795 6795 }
6796 6796 }
6797 6797 } else {
6798 6798 ASSERT(flag == SDR_END);
6799 6799 ASSERT(eaddr < lpgeaddr);
6800 6800 badseg1 = nseg = segvn_split_seg(seg, lpgeaddr - pgsz);
6801 6801 (void) segvn_split_seg(nseg, lpgeaddr);
6802 6802 ASSERT(badseg1->s_base == lpgeaddr - pgsz);
6803 6803 ASSERT(badseg1->s_size == pgsz);
6804 6804 }
6805 6805
6806 6806 ASSERT(badseg1 != NULL);
6807 6807 ASSERT(badseg1->s_szc == szc);
6808 6808 ASSERT(flag == SDR_RANGE || badseg1->s_size == pgsz ||
6809 6809 badseg1->s_size == 2 * pgsz);
6810 6810 ASSERT(sameprot(badseg1, badseg1->s_base, pgsz));
6811 6811 ASSERT(badseg1->s_size == pgsz ||
6812 6812 sameprot(badseg1, badseg1->s_base + pgsz, pgsz));
6813 6813 if (err = segvn_clrszc(badseg1)) {
6814 6814 return (err);
6815 6815 }
6816 6816 ASSERT(badseg1->s_szc == 0);
6817 6817
6818 6818 if (szc > 1 && (tszcvec = P2PHASE(szcvec, 1 << szc)) > 1) {
6819 6819 uint_t tszc = highbit(tszcvec) - 1;
6820 6820 caddr_t ta = MAX(addr, badseg1->s_base);
6821 6821 caddr_t te;
6822 6822 size_t tpgsz = page_get_pagesize(tszc);
6823 6823
6824 6824 ASSERT(svd->type == MAP_SHARED);
6825 6825 ASSERT(flag == SDR_END);
6826 6826 ASSERT(tszc < szc && tszc > 0);
6827 6827
6828 6828 if (eaddr > badseg1->s_base + badseg1->s_size) {
6829 6829 te = badseg1->s_base + badseg1->s_size;
6830 6830 } else {
6831 6831 te = eaddr;
6832 6832 }
6833 6833
6834 6834 ASSERT(ta <= te);
6835 6835 badseg1->s_szc = tszc;
6836 6836 if (!IS_P2ALIGNED(ta, tpgsz) || !IS_P2ALIGNED(te, tpgsz)) {
6837 6837 if (badseg2 != NULL) {
6838 6838 err = segvn_demote_range(badseg1, ta, te - ta,
6839 6839 SDR_END, tszcvec);
6840 6840 if (err != 0) {
6841 6841 return (err);
6842 6842 }
6843 6843 } else {
6844 6844 return (segvn_demote_range(badseg1, ta,
6845 6845 te - ta, SDR_END, tszcvec));
6846 6846 }
6847 6847 }
6848 6848 }
6849 6849
6850 6850 if (badseg2 == NULL)
6851 6851 return (0);
6852 6852 ASSERT(badseg2->s_szc == szc);
6853 6853 ASSERT(badseg2->s_size == pgsz);
6854 6854 ASSERT(sameprot(badseg2, badseg2->s_base, badseg2->s_size));
6855 6855 if (err = segvn_clrszc(badseg2)) {
6856 6856 return (err);
6857 6857 }
6858 6858 ASSERT(badseg2->s_szc == 0);
6859 6859
6860 6860 if (szc > 1 && (tszcvec = P2PHASE(szcvec, 1 << szc)) > 1) {
6861 6861 uint_t tszc = highbit(tszcvec) - 1;
6862 6862 size_t tpgsz = page_get_pagesize(tszc);
6863 6863
6864 6864 ASSERT(svd->type == MAP_SHARED);
6865 6865 ASSERT(flag == SDR_END);
6866 6866 ASSERT(tszc < szc && tszc > 0);
6867 6867 ASSERT(badseg2->s_base > addr);
6868 6868 ASSERT(eaddr > badseg2->s_base);
6869 6869 ASSERT(eaddr < badseg2->s_base + badseg2->s_size);
6870 6870
6871 6871 badseg2->s_szc = tszc;
6872 6872 if (!IS_P2ALIGNED(eaddr, tpgsz)) {
6873 6873 return (segvn_demote_range(badseg2, badseg2->s_base,
6874 6874 eaddr - badseg2->s_base, SDR_END, tszcvec));
6875 6875 }
6876 6876 }
|
↓ open down ↓ |
108 lines elided |
↑ open up ↑ |
6877 6877
6878 6878 return (0);
6879 6879 }
6880 6880
6881 6881 static int
6882 6882 segvn_checkprot(struct seg *seg, caddr_t addr, size_t len, uint_t prot)
6883 6883 {
6884 6884 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6885 6885 struct vpage *vp, *evp;
6886 6886
6887 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6887 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6888 6888
6889 6889 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
6890 6890 /*
6891 6891 * If segment protection can be used, simply check against them.
6892 6892 */
6893 6893 if (svd->pageprot == 0) {
6894 6894 int err;
6895 6895
6896 6896 err = ((svd->prot & prot) != prot) ? EACCES : 0;
6897 6897 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6898 6898 return (err);
6899 6899 }
6900 6900
6901 6901 /*
6902 6902 * Have to check down to the vpage level.
6903 6903 */
6904 6904 evp = &svd->vpage[seg_page(seg, addr + len)];
6905 6905 for (vp = &svd->vpage[seg_page(seg, addr)]; vp < evp; vp++) {
6906 6906 if ((VPP_PROT(vp) & prot) != prot) {
6907 6907 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6908 6908 return (EACCES);
6909 6909 }
6910 6910 }
|
↓ open down ↓ |
13 lines elided |
↑ open up ↑ |
6911 6911 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6912 6912 return (0);
6913 6913 }
6914 6914
6915 6915 static int
6916 6916 segvn_getprot(struct seg *seg, caddr_t addr, size_t len, uint_t *protv)
6917 6917 {
6918 6918 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6919 6919 size_t pgno = seg_page(seg, addr + len) - seg_page(seg, addr) + 1;
6920 6920
6921 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6921 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6922 6922
6923 6923 if (pgno != 0) {
6924 6924 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
6925 6925 if (svd->pageprot == 0) {
6926 6926 do {
6927 6927 protv[--pgno] = svd->prot;
6928 6928 } while (pgno != 0);
6929 6929 } else {
6930 6930 size_t pgoff = seg_page(seg, addr);
6931 6931
6932 6932 do {
6933 6933 pgno--;
6934 6934 protv[pgno] = VPP_PROT(&svd->vpage[pgno+pgoff]);
6935 6935 } while (pgno != 0);
6936 6936 }
|
↓ open down ↓ |
5 lines elided |
↑ open up ↑ |
6937 6937 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
6938 6938 }
6939 6939 return (0);
6940 6940 }
6941 6941
6942 6942 static u_offset_t
6943 6943 segvn_getoffset(struct seg *seg, caddr_t addr)
6944 6944 {
6945 6945 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6946 6946
6947 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6947 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6948 6948
6949 6949 return (svd->offset + (uintptr_t)(addr - seg->s_base));
6950 6950 }
6951 6951
6952 6952 /*ARGSUSED*/
6953 6953 static int
6954 6954 segvn_gettype(struct seg *seg, caddr_t addr)
6955 6955 {
6956 6956 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6957 6957
6958 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6958 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6959 6959
6960 6960 return (svd->type | (svd->flags & (MAP_NORESERVE | MAP_TEXT |
6961 6961 MAP_INITDATA)));
6962 6962 }
6963 6963
6964 6964 /*ARGSUSED*/
6965 6965 static int
6966 6966 segvn_getvp(struct seg *seg, caddr_t addr, struct vnode **vpp)
6967 6967 {
6968 6968 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6969 6969
6970 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6970 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6971 6971
6972 6972 *vpp = svd->vp;
6973 6973 return (0);
6974 6974 }
6975 6975
6976 6976 /*
6977 6977 * Check to see if it makes sense to do kluster/read ahead to
6978 6978 * addr + delta relative to the mapping at addr. We assume here
6979 6979 * that delta is a signed PAGESIZE'd multiple (which can be negative).
6980 6980 *
6981 6981 * For segvn, we currently "approve" of the action if we are
6982 6982 * still in the segment and it maps from the same vp/off,
6983 6983 * or if the advice stored in segvn_data or vpages allows it.
6984 6984 * Currently, klustering is not allowed only if MADV_RANDOM is set.
6985 6985 */
6986 6986 static int
|
↓ open down ↓ |
6 lines elided |
↑ open up ↑ |
6987 6987 segvn_kluster(struct seg *seg, caddr_t addr, ssize_t delta)
6988 6988 {
6989 6989 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
6990 6990 struct anon *oap, *ap;
6991 6991 ssize_t pd;
6992 6992 size_t page;
6993 6993 struct vnode *vp1, *vp2;
6994 6994 u_offset_t off1, off2;
6995 6995 struct anon_map *amp;
6996 6996
6997 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
6998 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock) ||
6997 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
6998 + ASSERT(AS_WRITE_HELD(seg->s_as) ||
6999 6999 SEGVN_LOCK_HELD(seg->s_as, &svd->lock));
7000 7000
7001 7001 if (addr + delta < seg->s_base ||
7002 7002 addr + delta >= (seg->s_base + seg->s_size))
7003 7003 return (-1); /* exceeded segment bounds */
7004 7004
7005 7005 pd = delta / (ssize_t)PAGESIZE; /* divide to preserve sign bit */
7006 7006 page = seg_page(seg, addr);
7007 7007
7008 7008 /*
7009 7009 * Check to see if either of the pages addr or addr + delta
7010 7010 * have advice set that prevents klustering (if MADV_RANDOM advice
7011 7011 * is set for entire segment, or MADV_SEQUENTIAL is set and delta
7012 7012 * is negative).
7013 7013 */
7014 7014 if (svd->advice == MADV_RANDOM ||
7015 7015 svd->advice == MADV_SEQUENTIAL && delta < 0)
7016 7016 return (-1);
7017 7017 else if (svd->pageadvice && svd->vpage) {
7018 7018 struct vpage *bvpp, *evpp;
7019 7019
7020 7020 bvpp = &svd->vpage[page];
7021 7021 evpp = &svd->vpage[page + pd];
7022 7022 if (VPP_ADVICE(bvpp) == MADV_RANDOM ||
7023 7023 VPP_ADVICE(evpp) == MADV_SEQUENTIAL && delta < 0)
7024 7024 return (-1);
7025 7025 if (VPP_ADVICE(bvpp) != VPP_ADVICE(evpp) &&
7026 7026 VPP_ADVICE(evpp) == MADV_RANDOM)
7027 7027 return (-1);
7028 7028 }
7029 7029
7030 7030 if (svd->type == MAP_SHARED)
7031 7031 return (0); /* shared mapping - all ok */
7032 7032
7033 7033 if ((amp = svd->amp) == NULL)
7034 7034 return (0); /* off original vnode */
7035 7035
7036 7036 page += svd->anon_index;
7037 7037
7038 7038 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7039 7039
7040 7040 oap = anon_get_ptr(amp->ahp, page);
7041 7041 ap = anon_get_ptr(amp->ahp, page + pd);
7042 7042
7043 7043 ANON_LOCK_EXIT(&->a_rwlock);
7044 7044
7045 7045 if ((oap == NULL && ap != NULL) || (oap != NULL && ap == NULL)) {
7046 7046 return (-1); /* one with and one without an anon */
7047 7047 }
7048 7048
7049 7049 if (oap == NULL) { /* implies that ap == NULL */
7050 7050 return (0); /* off original vnode */
7051 7051 }
7052 7052
7053 7053 /*
7054 7054 * Now we know we have two anon pointers - check to
7055 7055 * see if they happen to be properly allocated.
7056 7056 */
7057 7057
7058 7058 /*
7059 7059 * XXX We cheat here and don't lock the anon slots. We can't because
7060 7060 * we may have been called from the anon layer which might already
7061 7061 * have locked them. We are holding a refcnt on the slots so they
7062 7062 * can't disappear. The worst that will happen is we'll get the wrong
7063 7063 * names (vp, off) for the slots and make a poor klustering decision.
7064 7064 */
7065 7065 swap_xlate(ap, &vp1, &off1);
7066 7066 swap_xlate(oap, &vp2, &off2);
7067 7067
7068 7068
7069 7069 if (!VOP_CMP(vp1, vp2, NULL) || off1 - off2 != delta)
7070 7070 return (-1);
7071 7071 return (0);
7072 7072 }
7073 7073
7074 7074 /*
7075 7075 * Swap the pages of seg out to secondary storage, returning the
7076 7076 * number of bytes of storage freed.
7077 7077 *
7078 7078 * The basic idea is first to unload all translations and then to call
7079 7079 * VOP_PUTPAGE() for all newly-unmapped pages, to push them out to the
7080 7080 * swap device. Pages to which other segments have mappings will remain
7081 7081 * mapped and won't be swapped. Our caller (as_swapout) has already
7082 7082 * performed the unloading step.
7083 7083 *
7084 7084 * The value returned is intended to correlate well with the process's
7085 7085 * memory requirements. However, there are some caveats:
7086 7086 * 1) When given a shared segment as argument, this routine will
7087 7087 * only succeed in swapping out pages for the last sharer of the
7088 7088 * segment. (Previous callers will only have decremented mapping
7089 7089 * reference counts.)
7090 7090 * 2) We assume that the hat layer maintains a large enough translation
7091 7091 * cache to capture process reference patterns.
7092 7092 */
|
↓ open down ↓ |
84 lines elided |
↑ open up ↑ |
7093 7093 static size_t
7094 7094 segvn_swapout(struct seg *seg)
7095 7095 {
7096 7096 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7097 7097 struct anon_map *amp;
7098 7098 pgcnt_t pgcnt = 0;
7099 7099 pgcnt_t npages;
7100 7100 pgcnt_t page;
7101 7101 ulong_t anon_index;
7102 7102
7103 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
7103 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7104 7104
7105 7105 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7106 7106 /*
7107 7107 * Find pages unmapped by our caller and force them
7108 7108 * out to the virtual swap device.
7109 7109 */
7110 7110 if ((amp = svd->amp) != NULL)
7111 7111 anon_index = svd->anon_index;
7112 7112 npages = seg->s_size >> PAGESHIFT;
7113 7113 for (page = 0; page < npages; page++) {
7114 7114 page_t *pp;
7115 7115 struct anon *ap;
7116 7116 struct vnode *vp;
7117 7117 u_offset_t off;
7118 7118 anon_sync_obj_t cookie;
7119 7119
7120 7120 /*
7121 7121 * Obtain <vp, off> pair for the page, then look it up.
7122 7122 *
7123 7123 * Note that this code is willing to consider regular
7124 7124 * pages as well as anon pages. Is this appropriate here?
7125 7125 */
7126 7126 ap = NULL;
7127 7127 if (amp != NULL) {
7128 7128 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7129 7129 if (anon_array_try_enter(amp, anon_index + page,
7130 7130 &cookie)) {
7131 7131 ANON_LOCK_EXIT(&->a_rwlock);
7132 7132 continue;
7133 7133 }
7134 7134 ap = anon_get_ptr(amp->ahp, anon_index + page);
7135 7135 if (ap != NULL) {
7136 7136 swap_xlate(ap, &vp, &off);
7137 7137 } else {
7138 7138 vp = svd->vp;
7139 7139 off = svd->offset + ptob(page);
7140 7140 }
7141 7141 anon_array_exit(&cookie);
7142 7142 ANON_LOCK_EXIT(&->a_rwlock);
7143 7143 } else {
7144 7144 vp = svd->vp;
7145 7145 off = svd->offset + ptob(page);
7146 7146 }
7147 7147 if (vp == NULL) { /* untouched zfod page */
7148 7148 ASSERT(ap == NULL);
7149 7149 continue;
7150 7150 }
7151 7151
7152 7152 pp = page_lookup_nowait(vp, off, SE_SHARED);
7153 7153 if (pp == NULL)
7154 7154 continue;
7155 7155
7156 7156
7157 7157 /*
7158 7158 * Examine the page to see whether it can be tossed out,
7159 7159 * keeping track of how many we've found.
7160 7160 */
7161 7161 if (!page_tryupgrade(pp)) {
7162 7162 /*
7163 7163 * If the page has an i/o lock and no mappings,
7164 7164 * it's very likely that the page is being
7165 7165 * written out as a result of klustering.
7166 7166 * Assume this is so and take credit for it here.
7167 7167 */
7168 7168 if (!page_io_trylock(pp)) {
7169 7169 if (!hat_page_is_mapped(pp))
7170 7170 pgcnt++;
7171 7171 } else {
7172 7172 page_io_unlock(pp);
7173 7173 }
7174 7174 page_unlock(pp);
7175 7175 continue;
7176 7176 }
7177 7177 ASSERT(!page_iolock_assert(pp));
7178 7178
7179 7179
7180 7180 /*
7181 7181 * Skip if page is locked or has mappings.
7182 7182 * We don't need the page_struct_lock to look at lckcnt
7183 7183 * and cowcnt because the page is exclusive locked.
7184 7184 */
7185 7185 if (pp->p_lckcnt != 0 || pp->p_cowcnt != 0 ||
7186 7186 hat_page_is_mapped(pp)) {
7187 7187 page_unlock(pp);
7188 7188 continue;
7189 7189 }
7190 7190
7191 7191 /*
7192 7192 * dispose skips large pages so try to demote first.
7193 7193 */
7194 7194 if (pp->p_szc != 0 && !page_try_demote_pages(pp)) {
7195 7195 page_unlock(pp);
7196 7196 /*
7197 7197 * XXX should skip the remaining page_t's of this
7198 7198 * large page.
7199 7199 */
7200 7200 continue;
7201 7201 }
7202 7202
7203 7203 ASSERT(pp->p_szc == 0);
7204 7204
7205 7205 /*
7206 7206 * No longer mapped -- we can toss it out. How
7207 7207 * we do so depends on whether or not it's dirty.
7208 7208 */
7209 7209 if (hat_ismod(pp) && pp->p_vnode) {
7210 7210 /*
7211 7211 * We must clean the page before it can be
7212 7212 * freed. Setting B_FREE will cause pvn_done
7213 7213 * to free the page when the i/o completes.
7214 7214 * XXX: This also causes it to be accounted
7215 7215 * as a pageout instead of a swap: need
7216 7216 * B_SWAPOUT bit to use instead of B_FREE.
7217 7217 *
7218 7218 * Hold the vnode before releasing the page lock
7219 7219 * to prevent it from being freed and re-used by
7220 7220 * some other thread.
7221 7221 */
7222 7222 VN_HOLD(vp);
7223 7223 page_unlock(pp);
7224 7224
7225 7225 /*
7226 7226 * Queue all i/o requests for the pageout thread
7227 7227 * to avoid saturating the pageout devices.
7228 7228 */
7229 7229 if (!queue_io_request(vp, off))
7230 7230 VN_RELE(vp);
7231 7231 } else {
7232 7232 /*
7233 7233 * The page was clean, free it.
7234 7234 *
7235 7235 * XXX: Can we ever encounter modified pages
7236 7236 * with no associated vnode here?
7237 7237 */
7238 7238 ASSERT(pp->p_vnode != NULL);
7239 7239 /*LINTED: constant in conditional context*/
7240 7240 VN_DISPOSE(pp, B_FREE, 0, kcred);
7241 7241 }
7242 7242
7243 7243 /*
7244 7244 * Credit now even if i/o is in progress.
7245 7245 */
7246 7246 pgcnt++;
7247 7247 }
7248 7248 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7249 7249
7250 7250 /*
7251 7251 * Wakeup pageout to initiate i/o on all queued requests.
7252 7252 */
7253 7253 cv_signal_pageout();
7254 7254 return (ptob(pgcnt));
7255 7255 }
7256 7256
7257 7257 /*
7258 7258 * Synchronize primary storage cache with real object in virtual memory.
7259 7259 *
7260 7260 * XXX - Anonymous pages should not be sync'ed out at all.
7261 7261 */
7262 7262 static int
7263 7263 segvn_sync(struct seg *seg, caddr_t addr, size_t len, int attr, uint_t flags)
7264 7264 {
7265 7265 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7266 7266 struct vpage *vpp;
7267 7267 page_t *pp;
7268 7268 u_offset_t offset;
7269 7269 struct vnode *vp;
7270 7270 u_offset_t off;
7271 7271 caddr_t eaddr;
|
↓ open down ↓ |
158 lines elided |
↑ open up ↑ |
7272 7272 int bflags;
7273 7273 int err = 0;
7274 7274 int segtype;
7275 7275 int pageprot;
7276 7276 int prot;
7277 7277 ulong_t anon_index;
7278 7278 struct anon_map *amp;
7279 7279 struct anon *ap;
7280 7280 anon_sync_obj_t cookie;
7281 7281
7282 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
7282 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7283 7283
7284 7284 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7285 7285
7286 7286 if (svd->softlockcnt > 0) {
7287 7287 /*
7288 7288 * If this is shared segment non 0 softlockcnt
7289 7289 * means locked pages are still in use.
7290 7290 */
7291 7291 if (svd->type == MAP_SHARED) {
7292 7292 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7293 7293 return (EAGAIN);
7294 7294 }
7295 7295
7296 7296 /*
7297 7297 * flush all pages from seg cache
7298 7298 * otherwise we may deadlock in swap_putpage
7299 7299 * for B_INVAL page (4175402).
7300 7300 *
7301 7301 * Even if we grab segvn WRITER's lock
7302 7302 * here, there might be another thread which could've
7303 7303 * successfully performed lookup/insert just before
7304 7304 * we acquired the lock here. So, grabbing either
7305 7305 * lock here is of not much use. Until we devise
7306 7306 * a strategy at upper layers to solve the
7307 7307 * synchronization issues completely, we expect
7308 7308 * applications to handle this appropriately.
7309 7309 */
7310 7310 segvn_purge(seg);
7311 7311 if (svd->softlockcnt > 0) {
7312 7312 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7313 7313 return (EAGAIN);
7314 7314 }
7315 7315 } else if (svd->type == MAP_SHARED && svd->amp != NULL &&
7316 7316 svd->amp->a_softlockcnt > 0) {
7317 7317 /*
7318 7318 * Try to purge this amp's entries from pcache. It will
7319 7319 * succeed only if other segments that share the amp have no
7320 7320 * outstanding softlock's.
7321 7321 */
7322 7322 segvn_purge(seg);
7323 7323 if (svd->amp->a_softlockcnt > 0 || svd->softlockcnt > 0) {
7324 7324 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7325 7325 return (EAGAIN);
7326 7326 }
7327 7327 }
7328 7328
7329 7329 vpp = svd->vpage;
7330 7330 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7331 7331 bflags = ((flags & MS_ASYNC) ? B_ASYNC : 0) |
7332 7332 ((flags & MS_INVALIDATE) ? B_INVAL : 0);
7333 7333
7334 7334 if (attr) {
7335 7335 pageprot = attr & ~(SHARED|PRIVATE);
7336 7336 segtype = (attr & SHARED) ? MAP_SHARED : MAP_PRIVATE;
7337 7337
7338 7338 /*
7339 7339 * We are done if the segment types don't match
7340 7340 * or if we have segment level protections and
7341 7341 * they don't match.
7342 7342 */
7343 7343 if (svd->type != segtype) {
7344 7344 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7345 7345 return (0);
7346 7346 }
7347 7347 if (vpp == NULL) {
7348 7348 if (svd->prot != pageprot) {
7349 7349 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7350 7350 return (0);
7351 7351 }
7352 7352 prot = svd->prot;
7353 7353 } else
7354 7354 vpp = &svd->vpage[seg_page(seg, addr)];
7355 7355
7356 7356 } else if (svd->vp && svd->amp == NULL &&
7357 7357 (flags & MS_INVALIDATE) == 0) {
7358 7358
7359 7359 /*
7360 7360 * No attributes, no anonymous pages and MS_INVALIDATE flag
7361 7361 * is not on, just use one big request.
7362 7362 */
7363 7363 err = VOP_PUTPAGE(svd->vp, (offset_t)offset, len,
7364 7364 bflags, svd->cred, NULL);
7365 7365 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7366 7366 return (err);
7367 7367 }
7368 7368
7369 7369 if ((amp = svd->amp) != NULL)
7370 7370 anon_index = svd->anon_index + seg_page(seg, addr);
7371 7371
7372 7372 for (eaddr = addr + len; addr < eaddr; addr += PAGESIZE) {
7373 7373 ap = NULL;
7374 7374 if (amp != NULL) {
7375 7375 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7376 7376 anon_array_enter(amp, anon_index, &cookie);
7377 7377 ap = anon_get_ptr(amp->ahp, anon_index++);
7378 7378 if (ap != NULL) {
7379 7379 swap_xlate(ap, &vp, &off);
7380 7380 } else {
7381 7381 vp = svd->vp;
7382 7382 off = offset;
7383 7383 }
7384 7384 anon_array_exit(&cookie);
7385 7385 ANON_LOCK_EXIT(&->a_rwlock);
7386 7386 } else {
7387 7387 vp = svd->vp;
7388 7388 off = offset;
7389 7389 }
7390 7390 offset += PAGESIZE;
7391 7391
7392 7392 if (vp == NULL) /* untouched zfod page */
7393 7393 continue;
7394 7394
7395 7395 if (attr) {
7396 7396 if (vpp) {
7397 7397 prot = VPP_PROT(vpp);
7398 7398 vpp++;
7399 7399 }
7400 7400 if (prot != pageprot) {
7401 7401 continue;
7402 7402 }
7403 7403 }
7404 7404
7405 7405 /*
7406 7406 * See if any of these pages are locked -- if so, then we
7407 7407 * will have to truncate an invalidate request at the first
7408 7408 * locked one. We don't need the page_struct_lock to test
7409 7409 * as this is only advisory; even if we acquire it someone
7410 7410 * might race in and lock the page after we unlock and before
7411 7411 * we do the PUTPAGE, then PUTPAGE simply does nothing.
7412 7412 */
7413 7413 if (flags & MS_INVALIDATE) {
7414 7414 if ((pp = page_lookup(vp, off, SE_SHARED)) != NULL) {
7415 7415 if (pp->p_lckcnt != 0 || pp->p_cowcnt != 0) {
7416 7416 page_unlock(pp);
7417 7417 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7418 7418 return (EBUSY);
7419 7419 }
7420 7420 if (ap != NULL && pp->p_szc != 0 &&
7421 7421 page_tryupgrade(pp)) {
7422 7422 if (pp->p_lckcnt == 0 &&
7423 7423 pp->p_cowcnt == 0) {
7424 7424 /*
7425 7425 * swapfs VN_DISPOSE() won't
7426 7426 * invalidate large pages.
7427 7427 * Attempt to demote.
7428 7428 * XXX can't help it if it
7429 7429 * fails. But for swapfs
7430 7430 * pages it is no big deal.
7431 7431 */
7432 7432 (void) page_try_demote_pages(
7433 7433 pp);
7434 7434 }
7435 7435 }
7436 7436 page_unlock(pp);
7437 7437 }
7438 7438 } else if (svd->type == MAP_SHARED && amp != NULL) {
7439 7439 /*
7440 7440 * Avoid writing out to disk ISM's large pages
7441 7441 * because segspt_free_pages() relies on NULL an_pvp
7442 7442 * of anon slots of such pages.
7443 7443 */
7444 7444
7445 7445 ASSERT(svd->vp == NULL);
7446 7446 /*
7447 7447 * swapfs uses page_lookup_nowait if not freeing or
7448 7448 * invalidating and skips a page if
7449 7449 * page_lookup_nowait returns NULL.
7450 7450 */
7451 7451 pp = page_lookup_nowait(vp, off, SE_SHARED);
7452 7452 if (pp == NULL) {
7453 7453 continue;
7454 7454 }
7455 7455 if (pp->p_szc != 0) {
7456 7456 page_unlock(pp);
7457 7457 continue;
7458 7458 }
7459 7459
7460 7460 /*
7461 7461 * Note ISM pages are created large so (vp, off)'s
7462 7462 * page cannot suddenly become large after we unlock
7463 7463 * pp.
7464 7464 */
7465 7465 page_unlock(pp);
7466 7466 }
7467 7467 /*
7468 7468 * XXX - Should ultimately try to kluster
7469 7469 * calls to VOP_PUTPAGE() for performance.
7470 7470 */
7471 7471 VN_HOLD(vp);
7472 7472 err = VOP_PUTPAGE(vp, (offset_t)off, PAGESIZE,
7473 7473 (bflags | (IS_SWAPFSVP(vp) ? B_PAGE_NOWAIT : 0)),
7474 7474 svd->cred, NULL);
7475 7475
7476 7476 VN_RELE(vp);
7477 7477 if (err)
7478 7478 break;
7479 7479 }
7480 7480 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7481 7481 return (err);
7482 7482 }
7483 7483
7484 7484 /*
7485 7485 * Determine if we have data corresponding to pages in the
7486 7486 * primary storage virtual memory cache (i.e., "in core").
7487 7487 */
7488 7488 static size_t
7489 7489 segvn_incore(struct seg *seg, caddr_t addr, size_t len, char *vec)
7490 7490 {
7491 7491 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7492 7492 struct vnode *vp, *avp;
7493 7493 u_offset_t offset, aoffset;
|
↓ open down ↓ |
201 lines elided |
↑ open up ↑ |
7494 7494 size_t p, ep;
7495 7495 int ret;
7496 7496 struct vpage *vpp;
7497 7497 page_t *pp;
7498 7498 uint_t start;
7499 7499 struct anon_map *amp; /* XXX - for locknest */
7500 7500 struct anon *ap;
7501 7501 uint_t attr;
7502 7502 anon_sync_obj_t cookie;
7503 7503
7504 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
7504 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7505 7505
7506 7506 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
7507 7507 if (svd->amp == NULL && svd->vp == NULL) {
7508 7508 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7509 7509 bzero(vec, btopr(len));
7510 7510 return (len); /* no anonymous pages created yet */
7511 7511 }
7512 7512
7513 7513 p = seg_page(seg, addr);
7514 7514 ep = seg_page(seg, addr + len);
7515 7515 start = svd->vp ? SEG_PAGE_VNODEBACKED : 0;
7516 7516
7517 7517 amp = svd->amp;
7518 7518 for (; p < ep; p++, addr += PAGESIZE) {
7519 7519 vpp = (svd->vpage) ? &svd->vpage[p]: NULL;
7520 7520 ret = start;
7521 7521 ap = NULL;
7522 7522 avp = NULL;
7523 7523 /* Grab the vnode/offset for the anon slot */
7524 7524 if (amp != NULL) {
7525 7525 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7526 7526 anon_array_enter(amp, svd->anon_index + p, &cookie);
7527 7527 ap = anon_get_ptr(amp->ahp, svd->anon_index + p);
7528 7528 if (ap != NULL) {
7529 7529 swap_xlate(ap, &avp, &aoffset);
7530 7530 }
7531 7531 anon_array_exit(&cookie);
7532 7532 ANON_LOCK_EXIT(&->a_rwlock);
7533 7533 }
7534 7534 if ((avp != NULL) && page_exists(avp, aoffset)) {
7535 7535 /* A page exists for the anon slot */
7536 7536 ret |= SEG_PAGE_INCORE;
7537 7537
7538 7538 /*
7539 7539 * If page is mapped and writable
7540 7540 */
7541 7541 attr = (uint_t)0;
7542 7542 if ((hat_getattr(seg->s_as->a_hat, addr,
7543 7543 &attr) != -1) && (attr & PROT_WRITE)) {
7544 7544 ret |= SEG_PAGE_ANON;
7545 7545 }
7546 7546 /*
7547 7547 * Don't get page_struct lock for lckcnt and cowcnt,
7548 7548 * since this is purely advisory.
7549 7549 */
7550 7550 if ((pp = page_lookup_nowait(avp, aoffset,
7551 7551 SE_SHARED)) != NULL) {
7552 7552 if (pp->p_lckcnt)
7553 7553 ret |= SEG_PAGE_SOFTLOCK;
7554 7554 if (pp->p_cowcnt)
7555 7555 ret |= SEG_PAGE_HASCOW;
7556 7556 page_unlock(pp);
7557 7557 }
7558 7558 }
7559 7559
7560 7560 /* Gather vnode statistics */
7561 7561 vp = svd->vp;
7562 7562 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7563 7563
7564 7564 if (vp != NULL) {
7565 7565 /*
7566 7566 * Try to obtain a "shared" lock on the page
7567 7567 * without blocking. If this fails, determine
7568 7568 * if the page is in memory.
7569 7569 */
7570 7570 pp = page_lookup_nowait(vp, offset, SE_SHARED);
7571 7571 if ((pp == NULL) && (page_exists(vp, offset))) {
7572 7572 /* Page is incore, and is named */
7573 7573 ret |= (SEG_PAGE_INCORE | SEG_PAGE_VNODE);
7574 7574 }
7575 7575 /*
7576 7576 * Don't get page_struct lock for lckcnt and cowcnt,
7577 7577 * since this is purely advisory.
7578 7578 */
7579 7579 if (pp != NULL) {
7580 7580 ret |= (SEG_PAGE_INCORE | SEG_PAGE_VNODE);
7581 7581 if (pp->p_lckcnt)
7582 7582 ret |= SEG_PAGE_SOFTLOCK;
7583 7583 if (pp->p_cowcnt)
7584 7584 ret |= SEG_PAGE_HASCOW;
7585 7585 page_unlock(pp);
7586 7586 }
7587 7587 }
7588 7588
7589 7589 /* Gather virtual page information */
7590 7590 if (vpp) {
7591 7591 if (VPP_ISPPLOCK(vpp))
7592 7592 ret |= SEG_PAGE_LOCKED;
7593 7593 vpp++;
7594 7594 }
7595 7595
7596 7596 *vec++ = (char)ret;
7597 7597 }
7598 7598 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7599 7599 return (len);
7600 7600 }
7601 7601
7602 7602 /*
7603 7603 * Statement for p_cowcnts/p_lckcnts.
7604 7604 *
7605 7605 * p_cowcnt is updated while mlock/munlocking MAP_PRIVATE and PROT_WRITE region
7606 7606 * irrespective of the following factors or anything else:
7607 7607 *
7608 7608 * (1) anon slots are populated or not
7609 7609 * (2) cow is broken or not
7610 7610 * (3) refcnt on ap is 1 or greater than 1
7611 7611 *
7612 7612 * If it's not MAP_PRIVATE and PROT_WRITE, p_lckcnt is updated during mlock
7613 7613 * and munlock.
7614 7614 *
7615 7615 *
7616 7616 * Handling p_cowcnts/p_lckcnts during copy-on-write fault:
7617 7617 *
7618 7618 * if vpage has PROT_WRITE
7619 7619 * transfer cowcnt on the oldpage -> cowcnt on the newpage
7620 7620 * else
7621 7621 * transfer lckcnt on the oldpage -> lckcnt on the newpage
7622 7622 *
7623 7623 * During copy-on-write, decrement p_cowcnt on the oldpage and increment
7624 7624 * p_cowcnt on the newpage *if* the corresponding vpage has PROT_WRITE.
7625 7625 *
7626 7626 * We may also break COW if softlocking on read access in the physio case.
7627 7627 * In this case, vpage may not have PROT_WRITE. So, we need to decrement
7628 7628 * p_lckcnt on the oldpage and increment p_lckcnt on the newpage *if* the
7629 7629 * vpage doesn't have PROT_WRITE.
7630 7630 *
7631 7631 *
7632 7632 * Handling p_cowcnts/p_lckcnts during mprotect on mlocked region:
7633 7633 *
7634 7634 * If a MAP_PRIVATE region loses PROT_WRITE, we decrement p_cowcnt and
7635 7635 * increment p_lckcnt by calling page_subclaim() which takes care of
7636 7636 * availrmem accounting and p_lckcnt overflow.
7637 7637 *
7638 7638 * If a MAP_PRIVATE region gains PROT_WRITE, we decrement p_lckcnt and
7639 7639 * increment p_cowcnt by calling page_addclaim() which takes care of
7640 7640 * availrmem availability and p_cowcnt overflow.
7641 7641 */
7642 7642
7643 7643 /*
7644 7644 * Lock down (or unlock) pages mapped by this segment.
7645 7645 *
7646 7646 * XXX only creates PAGESIZE pages if anon slots are not initialized.
7647 7647 * At fault time they will be relocated into larger pages.
7648 7648 */
7649 7649 static int
7650 7650 segvn_lockop(struct seg *seg, caddr_t addr, size_t len,
7651 7651 int attr, int op, ulong_t *lockmap, size_t pos)
7652 7652 {
7653 7653 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
7654 7654 struct vpage *vpp;
7655 7655 struct vpage *evp;
7656 7656 page_t *pp;
7657 7657 u_offset_t offset;
7658 7658 u_offset_t off;
7659 7659 int segtype;
7660 7660 int pageprot;
7661 7661 int claim;
7662 7662 struct vnode *vp;
7663 7663 ulong_t anon_index;
7664 7664 struct anon_map *amp;
7665 7665 struct anon *ap;
7666 7666 struct vattr va;
7667 7667 anon_sync_obj_t cookie;
7668 7668 struct kshmid *sp = NULL;
7669 7669 struct proc *p = curproc;
|
↓ open down ↓ |
155 lines elided |
↑ open up ↑ |
7670 7670 kproject_t *proj = NULL;
7671 7671 int chargeproc = 1;
7672 7672 size_t locked_bytes = 0;
7673 7673 size_t unlocked_bytes = 0;
7674 7674 int err = 0;
7675 7675
7676 7676 /*
7677 7677 * Hold write lock on address space because may split or concatenate
7678 7678 * segments
7679 7679 */
7680 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
7680 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
7681 7681
7682 7682 /*
7683 7683 * If this is a shm, use shm's project and zone, else use
7684 7684 * project and zone of calling process
7685 7685 */
7686 7686
7687 7687 /* Determine if this segment backs a sysV shm */
7688 7688 if (svd->amp != NULL && svd->amp->a_sp != NULL) {
7689 7689 ASSERT(svd->type == MAP_SHARED);
7690 7690 ASSERT(svd->tr_state == SEGVN_TR_OFF);
7691 7691 sp = svd->amp->a_sp;
7692 7692 proj = sp->shm_perm.ipc_proj;
7693 7693 chargeproc = 0;
7694 7694 }
7695 7695
7696 7696 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
7697 7697 if (attr) {
7698 7698 pageprot = attr & ~(SHARED|PRIVATE);
7699 7699 segtype = attr & SHARED ? MAP_SHARED : MAP_PRIVATE;
7700 7700
7701 7701 /*
7702 7702 * We are done if the segment types don't match
7703 7703 * or if we have segment level protections and
7704 7704 * they don't match.
7705 7705 */
7706 7706 if (svd->type != segtype) {
7707 7707 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7708 7708 return (0);
7709 7709 }
7710 7710 if (svd->pageprot == 0 && svd->prot != pageprot) {
7711 7711 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7712 7712 return (0);
7713 7713 }
7714 7714 }
7715 7715
7716 7716 if (op == MC_LOCK) {
7717 7717 if (svd->tr_state == SEGVN_TR_INIT) {
7718 7718 svd->tr_state = SEGVN_TR_OFF;
7719 7719 } else if (svd->tr_state == SEGVN_TR_ON) {
7720 7720 ASSERT(svd->amp != NULL);
7721 7721 segvn_textunrepl(seg, 0);
7722 7722 ASSERT(svd->amp == NULL &&
7723 7723 svd->tr_state == SEGVN_TR_OFF);
7724 7724 }
7725 7725 }
7726 7726
7727 7727 /*
7728 7728 * If we're locking, then we must create a vpage structure if
7729 7729 * none exists. If we're unlocking, then check to see if there
7730 7730 * is a vpage -- if not, then we could not have locked anything.
7731 7731 */
7732 7732
7733 7733 if ((vpp = svd->vpage) == NULL) {
7734 7734 if (op == MC_LOCK) {
7735 7735 segvn_vpage(seg);
7736 7736 if (svd->vpage == NULL) {
7737 7737 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7738 7738 return (ENOMEM);
7739 7739 }
7740 7740 } else {
7741 7741 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7742 7742 return (0);
7743 7743 }
7744 7744 }
7745 7745
7746 7746 /*
7747 7747 * The anonymous data vector (i.e., previously
7748 7748 * unreferenced mapping to swap space) can be allocated
7749 7749 * by lazily testing for its existence.
7750 7750 */
7751 7751 if (op == MC_LOCK && svd->amp == NULL && svd->vp == NULL) {
7752 7752 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
7753 7753 svd->amp = anonmap_alloc(seg->s_size, 0, ANON_SLEEP);
7754 7754 svd->amp->a_szc = seg->s_szc;
7755 7755 }
7756 7756
7757 7757 if ((amp = svd->amp) != NULL) {
7758 7758 anon_index = svd->anon_index + seg_page(seg, addr);
7759 7759 }
7760 7760
7761 7761 offset = svd->offset + (uintptr_t)(addr - seg->s_base);
7762 7762 evp = &svd->vpage[seg_page(seg, addr + len)];
7763 7763
7764 7764 if (sp != NULL)
7765 7765 mutex_enter(&sp->shm_mlock);
7766 7766
7767 7767 /* determine number of unlocked bytes in range for lock operation */
7768 7768 if (op == MC_LOCK) {
7769 7769
7770 7770 if (sp == NULL) {
7771 7771 for (vpp = &svd->vpage[seg_page(seg, addr)]; vpp < evp;
7772 7772 vpp++) {
7773 7773 if (!VPP_ISPPLOCK(vpp))
7774 7774 unlocked_bytes += PAGESIZE;
7775 7775 }
7776 7776 } else {
7777 7777 ulong_t i_idx, i_edx;
7778 7778 anon_sync_obj_t i_cookie;
7779 7779 struct anon *i_ap;
7780 7780 struct vnode *i_vp;
7781 7781 u_offset_t i_off;
7782 7782
7783 7783 /* Only count sysV pages once for locked memory */
7784 7784 i_edx = svd->anon_index + seg_page(seg, addr + len);
7785 7785 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7786 7786 for (i_idx = anon_index; i_idx < i_edx; i_idx++) {
7787 7787 anon_array_enter(amp, i_idx, &i_cookie);
7788 7788 i_ap = anon_get_ptr(amp->ahp, i_idx);
7789 7789 if (i_ap == NULL) {
7790 7790 unlocked_bytes += PAGESIZE;
7791 7791 anon_array_exit(&i_cookie);
7792 7792 continue;
7793 7793 }
7794 7794 swap_xlate(i_ap, &i_vp, &i_off);
7795 7795 anon_array_exit(&i_cookie);
7796 7796 pp = page_lookup(i_vp, i_off, SE_SHARED);
7797 7797 if (pp == NULL) {
7798 7798 unlocked_bytes += PAGESIZE;
7799 7799 continue;
7800 7800 } else if (pp->p_lckcnt == 0)
7801 7801 unlocked_bytes += PAGESIZE;
7802 7802 page_unlock(pp);
7803 7803 }
7804 7804 ANON_LOCK_EXIT(&->a_rwlock);
7805 7805 }
7806 7806
7807 7807 mutex_enter(&p->p_lock);
7808 7808 err = rctl_incr_locked_mem(p, proj, unlocked_bytes,
7809 7809 chargeproc);
7810 7810 mutex_exit(&p->p_lock);
7811 7811
7812 7812 if (err) {
7813 7813 if (sp != NULL)
7814 7814 mutex_exit(&sp->shm_mlock);
7815 7815 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
7816 7816 return (err);
7817 7817 }
7818 7818 }
7819 7819 /*
7820 7820 * Loop over all pages in the range. Process if we're locking and
7821 7821 * page has not already been locked in this mapping; or if we're
7822 7822 * unlocking and the page has been locked.
7823 7823 */
7824 7824 for (vpp = &svd->vpage[seg_page(seg, addr)]; vpp < evp;
7825 7825 vpp++, pos++, addr += PAGESIZE, offset += PAGESIZE, anon_index++) {
7826 7826 if ((attr == 0 || VPP_PROT(vpp) == pageprot) &&
7827 7827 ((op == MC_LOCK && !VPP_ISPPLOCK(vpp)) ||
7828 7828 (op == MC_UNLOCK && VPP_ISPPLOCK(vpp)))) {
7829 7829
7830 7830 if (amp != NULL)
7831 7831 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
7832 7832 /*
7833 7833 * If this isn't a MAP_NORESERVE segment and
7834 7834 * we're locking, allocate anon slots if they
7835 7835 * don't exist. The page is brought in later on.
7836 7836 */
7837 7837 if (op == MC_LOCK && svd->vp == NULL &&
7838 7838 ((svd->flags & MAP_NORESERVE) == 0) &&
7839 7839 amp != NULL &&
7840 7840 ((ap = anon_get_ptr(amp->ahp, anon_index))
7841 7841 == NULL)) {
7842 7842 anon_array_enter(amp, anon_index, &cookie);
7843 7843
7844 7844 if ((ap = anon_get_ptr(amp->ahp,
7845 7845 anon_index)) == NULL) {
7846 7846 pp = anon_zero(seg, addr, &ap,
7847 7847 svd->cred);
7848 7848 if (pp == NULL) {
7849 7849 anon_array_exit(&cookie);
7850 7850 ANON_LOCK_EXIT(&->a_rwlock);
7851 7851 err = ENOMEM;
7852 7852 goto out;
7853 7853 }
7854 7854 ASSERT(anon_get_ptr(amp->ahp,
7855 7855 anon_index) == NULL);
7856 7856 (void) anon_set_ptr(amp->ahp,
7857 7857 anon_index, ap, ANON_SLEEP);
7858 7858 page_unlock(pp);
7859 7859 }
7860 7860 anon_array_exit(&cookie);
7861 7861 }
7862 7862
7863 7863 /*
7864 7864 * Get name for page, accounting for
7865 7865 * existence of private copy.
7866 7866 */
7867 7867 ap = NULL;
7868 7868 if (amp != NULL) {
7869 7869 anon_array_enter(amp, anon_index, &cookie);
7870 7870 ap = anon_get_ptr(amp->ahp, anon_index);
7871 7871 if (ap != NULL) {
7872 7872 swap_xlate(ap, &vp, &off);
7873 7873 } else {
7874 7874 if (svd->vp == NULL &&
7875 7875 (svd->flags & MAP_NORESERVE)) {
7876 7876 anon_array_exit(&cookie);
7877 7877 ANON_LOCK_EXIT(&->a_rwlock);
7878 7878 continue;
7879 7879 }
7880 7880 vp = svd->vp;
7881 7881 off = offset;
7882 7882 }
7883 7883 if (op != MC_LOCK || ap == NULL) {
7884 7884 anon_array_exit(&cookie);
7885 7885 ANON_LOCK_EXIT(&->a_rwlock);
7886 7886 }
7887 7887 } else {
7888 7888 vp = svd->vp;
7889 7889 off = offset;
7890 7890 }
7891 7891
7892 7892 /*
7893 7893 * Get page frame. It's ok if the page is
7894 7894 * not available when we're unlocking, as this
7895 7895 * may simply mean that a page we locked got
7896 7896 * truncated out of existence after we locked it.
7897 7897 *
7898 7898 * Invoke VOP_GETPAGE() to obtain the page struct
7899 7899 * since we may need to read it from disk if its
7900 7900 * been paged out.
7901 7901 */
7902 7902 if (op != MC_LOCK)
7903 7903 pp = page_lookup(vp, off, SE_SHARED);
7904 7904 else {
7905 7905 page_t *pl[1 + 1];
7906 7906 int error;
7907 7907
7908 7908 ASSERT(vp != NULL);
7909 7909
7910 7910 error = VOP_GETPAGE(vp, (offset_t)off, PAGESIZE,
7911 7911 (uint_t *)NULL, pl, PAGESIZE, seg, addr,
7912 7912 S_OTHER, svd->cred, NULL);
7913 7913
7914 7914 if (error && ap != NULL) {
7915 7915 anon_array_exit(&cookie);
7916 7916 ANON_LOCK_EXIT(&->a_rwlock);
7917 7917 }
7918 7918
7919 7919 /*
7920 7920 * If the error is EDEADLK then we must bounce
7921 7921 * up and drop all vm subsystem locks and then
7922 7922 * retry the operation later
7923 7923 * This behavior is a temporary measure because
7924 7924 * ufs/sds logging is badly designed and will
7925 7925 * deadlock if we don't allow this bounce to
7926 7926 * happen. The real solution is to re-design
7927 7927 * the logging code to work properly. See bug
7928 7928 * 4125102 for details of the problem.
7929 7929 */
7930 7930 if (error == EDEADLK) {
7931 7931 err = error;
7932 7932 goto out;
7933 7933 }
7934 7934 /*
7935 7935 * Quit if we fail to fault in the page. Treat
7936 7936 * the failure as an error, unless the addr
7937 7937 * is mapped beyond the end of a file.
7938 7938 */
7939 7939 if (error && svd->vp) {
7940 7940 va.va_mask = AT_SIZE;
7941 7941 if (VOP_GETATTR(svd->vp, &va, 0,
7942 7942 svd->cred, NULL) != 0) {
7943 7943 err = EIO;
7944 7944 goto out;
7945 7945 }
7946 7946 if (btopr(va.va_size) >=
7947 7947 btopr(off + 1)) {
7948 7948 err = EIO;
7949 7949 goto out;
7950 7950 }
7951 7951 goto out;
7952 7952
7953 7953 } else if (error) {
7954 7954 err = EIO;
7955 7955 goto out;
7956 7956 }
7957 7957 pp = pl[0];
7958 7958 ASSERT(pp != NULL);
7959 7959 }
7960 7960
7961 7961 /*
7962 7962 * See Statement at the beginning of this routine.
7963 7963 *
7964 7964 * claim is always set if MAP_PRIVATE and PROT_WRITE
7965 7965 * irrespective of following factors:
7966 7966 *
7967 7967 * (1) anon slots are populated or not
7968 7968 * (2) cow is broken or not
7969 7969 * (3) refcnt on ap is 1 or greater than 1
7970 7970 *
7971 7971 * See 4140683 for details
7972 7972 */
7973 7973 claim = ((VPP_PROT(vpp) & PROT_WRITE) &&
7974 7974 (svd->type == MAP_PRIVATE));
7975 7975
7976 7976 /*
7977 7977 * Perform page-level operation appropriate to
7978 7978 * operation. If locking, undo the SOFTLOCK
7979 7979 * performed to bring the page into memory
7980 7980 * after setting the lock. If unlocking,
7981 7981 * and no page was found, account for the claim
7982 7982 * separately.
7983 7983 */
7984 7984 if (op == MC_LOCK) {
7985 7985 int ret = 1; /* Assume success */
7986 7986
7987 7987 ASSERT(!VPP_ISPPLOCK(vpp));
7988 7988
7989 7989 ret = page_pp_lock(pp, claim, 0);
7990 7990 if (ap != NULL) {
7991 7991 if (ap->an_pvp != NULL) {
7992 7992 anon_swap_free(ap, pp);
7993 7993 }
7994 7994 anon_array_exit(&cookie);
7995 7995 ANON_LOCK_EXIT(&->a_rwlock);
7996 7996 }
7997 7997 if (ret == 0) {
7998 7998 /* locking page failed */
7999 7999 page_unlock(pp);
8000 8000 err = EAGAIN;
8001 8001 goto out;
8002 8002 }
8003 8003 VPP_SETPPLOCK(vpp);
8004 8004 if (sp != NULL) {
8005 8005 if (pp->p_lckcnt == 1)
8006 8006 locked_bytes += PAGESIZE;
8007 8007 } else
8008 8008 locked_bytes += PAGESIZE;
8009 8009
8010 8010 if (lockmap != (ulong_t *)NULL)
8011 8011 BT_SET(lockmap, pos);
8012 8012
8013 8013 page_unlock(pp);
8014 8014 } else {
8015 8015 ASSERT(VPP_ISPPLOCK(vpp));
8016 8016 if (pp != NULL) {
8017 8017 /* sysV pages should be locked */
8018 8018 ASSERT(sp == NULL || pp->p_lckcnt > 0);
8019 8019 page_pp_unlock(pp, claim, 0);
8020 8020 if (sp != NULL) {
8021 8021 if (pp->p_lckcnt == 0)
8022 8022 unlocked_bytes
8023 8023 += PAGESIZE;
8024 8024 } else
8025 8025 unlocked_bytes += PAGESIZE;
8026 8026 page_unlock(pp);
8027 8027 } else {
8028 8028 ASSERT(sp == NULL);
8029 8029 unlocked_bytes += PAGESIZE;
8030 8030 }
8031 8031 VPP_CLRPPLOCK(vpp);
8032 8032 }
8033 8033 }
8034 8034 }
8035 8035 out:
8036 8036 if (op == MC_LOCK) {
8037 8037 /* Credit back bytes that did not get locked */
8038 8038 if ((unlocked_bytes - locked_bytes) > 0) {
8039 8039 if (proj == NULL)
8040 8040 mutex_enter(&p->p_lock);
8041 8041 rctl_decr_locked_mem(p, proj,
8042 8042 (unlocked_bytes - locked_bytes), chargeproc);
8043 8043 if (proj == NULL)
8044 8044 mutex_exit(&p->p_lock);
8045 8045 }
8046 8046
8047 8047 } else {
8048 8048 /* Account bytes that were unlocked */
8049 8049 if (unlocked_bytes > 0) {
8050 8050 if (proj == NULL)
8051 8051 mutex_enter(&p->p_lock);
8052 8052 rctl_decr_locked_mem(p, proj, unlocked_bytes,
8053 8053 chargeproc);
8054 8054 if (proj == NULL)
8055 8055 mutex_exit(&p->p_lock);
8056 8056 }
8057 8057 }
8058 8058 if (sp != NULL)
8059 8059 mutex_exit(&sp->shm_mlock);
8060 8060 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8061 8061
8062 8062 return (err);
8063 8063 }
8064 8064
8065 8065 /*
8066 8066 * Set advice from user for specified pages
8067 8067 * There are 9 types of advice:
8068 8068 * MADV_NORMAL - Normal (default) behavior (whatever that is)
8069 8069 * MADV_RANDOM - Random page references
8070 8070 * do not allow readahead or 'klustering'
8071 8071 * MADV_SEQUENTIAL - Sequential page references
8072 8072 * Pages previous to the one currently being
8073 8073 * accessed (determined by fault) are 'not needed'
8074 8074 * and are freed immediately
8075 8075 * MADV_WILLNEED - Pages are likely to be used (fault ahead in mctl)
8076 8076 * MADV_DONTNEED - Pages are not needed (synced out in mctl)
8077 8077 * MADV_FREE - Contents can be discarded
8078 8078 * MADV_ACCESS_DEFAULT- Default access
8079 8079 * MADV_ACCESS_LWP - Next LWP will access heavily
8080 8080 * MADV_ACCESS_MANY- Many LWPs or processes will access heavily
8081 8081 */
8082 8082 static int
8083 8083 segvn_advise(struct seg *seg, caddr_t addr, size_t len, uint_t behav)
8084 8084 {
8085 8085 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
|
↓ open down ↓ |
395 lines elided |
↑ open up ↑ |
8086 8086 size_t page;
8087 8087 int err = 0;
8088 8088 int already_set;
8089 8089 struct anon_map *amp;
8090 8090 ulong_t anon_index;
8091 8091 struct seg *next;
8092 8092 lgrp_mem_policy_t policy;
8093 8093 struct seg *prev;
8094 8094 struct vnode *vp;
8095 8095
8096 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
8096 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8097 8097
8098 8098 /*
8099 8099 * In case of MADV_FREE, we won't be modifying any segment private
8100 8100 * data structures; so, we only need to grab READER's lock
8101 8101 */
8102 8102 if (behav != MADV_FREE) {
8103 8103 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
8104 8104 if (svd->tr_state != SEGVN_TR_OFF) {
8105 8105 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8106 8106 return (0);
8107 8107 }
8108 8108 } else {
8109 8109 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
8110 8110 }
8111 8111
8112 8112 /*
8113 8113 * Large pages are assumed to be only turned on when accesses to the
8114 8114 * segment's address range have spatial and temporal locality. That
8115 8115 * justifies ignoring MADV_SEQUENTIAL for large page segments.
8116 8116 * Also, ignore advice affecting lgroup memory allocation
8117 8117 * if don't need to do lgroup optimizations on this system
8118 8118 */
8119 8119
8120 8120 if ((behav == MADV_SEQUENTIAL &&
8121 8121 (seg->s_szc != 0 || HAT_IS_REGION_COOKIE_VALID(svd->rcookie))) ||
8122 8122 (!lgrp_optimizations() && (behav == MADV_ACCESS_DEFAULT ||
8123 8123 behav == MADV_ACCESS_LWP || behav == MADV_ACCESS_MANY))) {
8124 8124 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8125 8125 return (0);
8126 8126 }
8127 8127
8128 8128 if (behav == MADV_SEQUENTIAL || behav == MADV_ACCESS_DEFAULT ||
8129 8129 behav == MADV_ACCESS_LWP || behav == MADV_ACCESS_MANY) {
8130 8130 /*
8131 8131 * Since we are going to unload hat mappings
8132 8132 * we first have to flush the cache. Otherwise
8133 8133 * this might lead to system panic if another
8134 8134 * thread is doing physio on the range whose
8135 8135 * mappings are unloaded by madvise(3C).
8136 8136 */
8137 8137 if (svd->softlockcnt > 0) {
8138 8138 /*
8139 8139 * If this is shared segment non 0 softlockcnt
8140 8140 * means locked pages are still in use.
8141 8141 */
8142 8142 if (svd->type == MAP_SHARED) {
8143 8143 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8144 8144 return (EAGAIN);
8145 8145 }
8146 8146 /*
8147 8147 * Since we do have the segvn writers lock
8148 8148 * nobody can fill the cache with entries
8149 8149 * belonging to this seg during the purge.
8150 8150 * The flush either succeeds or we still
8151 8151 * have pending I/Os. In the later case,
8152 8152 * madvise(3C) fails.
8153 8153 */
8154 8154 segvn_purge(seg);
8155 8155 if (svd->softlockcnt > 0) {
8156 8156 /*
8157 8157 * Since madvise(3C) is advisory and
8158 8158 * it's not part of UNIX98, madvise(3C)
8159 8159 * failure here doesn't cause any hardship.
8160 8160 * Note that we don't block in "as" layer.
8161 8161 */
8162 8162 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8163 8163 return (EAGAIN);
8164 8164 }
8165 8165 } else if (svd->type == MAP_SHARED && svd->amp != NULL &&
8166 8166 svd->amp->a_softlockcnt > 0) {
8167 8167 /*
8168 8168 * Try to purge this amp's entries from pcache. It
8169 8169 * will succeed only if other segments that share the
8170 8170 * amp have no outstanding softlock's.
8171 8171 */
8172 8172 segvn_purge(seg);
8173 8173 }
8174 8174 }
8175 8175
8176 8176 amp = svd->amp;
8177 8177 vp = svd->vp;
8178 8178 if (behav == MADV_FREE) {
8179 8179 /*
8180 8180 * MADV_FREE is not supported for segments with
8181 8181 * underlying object; if anonmap is NULL, anon slots
8182 8182 * are not yet populated and there is nothing for
8183 8183 * us to do. As MADV_FREE is advisory, we don't
8184 8184 * return error in either case.
8185 8185 */
8186 8186 if (vp != NULL || amp == NULL) {
8187 8187 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8188 8188 return (0);
8189 8189 }
8190 8190
8191 8191 segvn_purge(seg);
8192 8192
8193 8193 page = seg_page(seg, addr);
8194 8194 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
8195 8195 anon_disclaim(amp, svd->anon_index + page, len);
8196 8196 ANON_LOCK_EXIT(&->a_rwlock);
8197 8197 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8198 8198 return (0);
8199 8199 }
8200 8200
8201 8201 /*
8202 8202 * If advice is to be applied to entire segment,
8203 8203 * use advice field in seg_data structure
8204 8204 * otherwise use appropriate vpage entry.
8205 8205 */
8206 8206 if ((addr == seg->s_base) && (len == seg->s_size)) {
8207 8207 switch (behav) {
8208 8208 case MADV_ACCESS_LWP:
8209 8209 case MADV_ACCESS_MANY:
8210 8210 case MADV_ACCESS_DEFAULT:
8211 8211 /*
8212 8212 * Set memory allocation policy for this segment
8213 8213 */
|
↓ open down ↓ |
107 lines elided |
↑ open up ↑ |
8214 8214 policy = lgrp_madv_to_policy(behav, len, svd->type);
8215 8215 if (svd->type == MAP_SHARED)
8216 8216 already_set = lgrp_shm_policy_set(policy, amp,
8217 8217 svd->anon_index, vp, svd->offset, len);
8218 8218 else {
8219 8219 /*
8220 8220 * For private memory, need writers lock on
8221 8221 * address space because the segment may be
8222 8222 * split or concatenated when changing policy
8223 8223 */
8224 - if (AS_READ_HELD(seg->s_as,
8225 - &seg->s_as->a_lock)) {
8224 + if (AS_READ_HELD(seg->s_as)) {
8226 8225 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8227 8226 return (IE_RETRY);
8228 8227 }
8229 8228
8230 8229 already_set = lgrp_privm_policy_set(policy,
8231 8230 &svd->policy_info, len);
8232 8231 }
8233 8232
8234 8233 /*
8235 8234 * If policy set already and it shouldn't be reapplied,
8236 8235 * don't do anything.
8237 8236 */
8238 8237 if (already_set &&
8239 8238 !LGRP_MEM_POLICY_REAPPLICABLE(policy))
8240 8239 break;
8241 8240
8242 8241 /*
8243 8242 * Mark any existing pages in given range for
8244 8243 * migration
8245 8244 */
8246 8245 page_mark_migrate(seg, addr, len, amp, svd->anon_index,
8247 8246 vp, svd->offset, 1);
8248 8247
8249 8248 /*
8250 8249 * If same policy set already or this is a shared
8251 8250 * memory segment, don't need to try to concatenate
8252 8251 * segment with adjacent ones.
8253 8252 */
8254 8253 if (already_set || svd->type == MAP_SHARED)
8255 8254 break;
8256 8255
8257 8256 /*
8258 8257 * Try to concatenate this segment with previous
8259 8258 * one and next one, since we changed policy for
8260 8259 * this one and it may be compatible with adjacent
8261 8260 * ones now.
8262 8261 */
8263 8262 prev = AS_SEGPREV(seg->s_as, seg);
8264 8263 next = AS_SEGNEXT(seg->s_as, seg);
8265 8264
8266 8265 if (next && next->s_ops == &segvn_ops &&
8267 8266 addr + len == next->s_base)
8268 8267 (void) segvn_concat(seg, next, 1);
8269 8268
8270 8269 if (prev && prev->s_ops == &segvn_ops &&
8271 8270 addr == prev->s_base + prev->s_size) {
8272 8271 /*
8273 8272 * Drop lock for private data of current
8274 8273 * segment before concatenating (deleting) it
8275 8274 * and return IE_REATTACH to tell as_ctl() that
8276 8275 * current segment has changed
8277 8276 */
8278 8277 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8279 8278 if (!segvn_concat(prev, seg, 1))
8280 8279 err = IE_REATTACH;
8281 8280
8282 8281 return (err);
8283 8282 }
8284 8283 break;
8285 8284
8286 8285 case MADV_SEQUENTIAL:
8287 8286 /*
8288 8287 * unloading mapping guarantees
8289 8288 * detection in segvn_fault
8290 8289 */
8291 8290 ASSERT(seg->s_szc == 0);
8292 8291 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
8293 8292 hat_unload(seg->s_as->a_hat, addr, len,
8294 8293 HAT_UNLOAD);
8295 8294 /* FALLTHROUGH */
8296 8295 case MADV_NORMAL:
8297 8296 case MADV_RANDOM:
8298 8297 svd->advice = (uchar_t)behav;
8299 8298 svd->pageadvice = 0;
8300 8299 break;
8301 8300 case MADV_WILLNEED: /* handled in memcntl */
8302 8301 case MADV_DONTNEED: /* handled in memcntl */
8303 8302 case MADV_FREE: /* handled above */
8304 8303 break;
8305 8304 default:
8306 8305 err = EINVAL;
8307 8306 }
8308 8307 } else {
8309 8308 caddr_t eaddr;
8310 8309 struct seg *new_seg;
8311 8310 struct segvn_data *new_svd;
8312 8311 u_offset_t off;
8313 8312 caddr_t oldeaddr;
8314 8313
8315 8314 page = seg_page(seg, addr);
8316 8315
8317 8316 segvn_vpage(seg);
8318 8317 if (svd->vpage == NULL) {
8319 8318 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8320 8319 return (ENOMEM);
8321 8320 }
8322 8321
8323 8322 switch (behav) {
8324 8323 struct vpage *bvpp, *evpp;
8325 8324
8326 8325 case MADV_ACCESS_LWP:
8327 8326 case MADV_ACCESS_MANY:
8328 8327 case MADV_ACCESS_DEFAULT:
8329 8328 /*
8330 8329 * Set memory allocation policy for portion of this
8331 8330 * segment
8332 8331 */
8333 8332
8334 8333 /*
8335 8334 * Align address and length of advice to page
8336 8335 * boundaries for large pages
8337 8336 */
8338 8337 if (seg->s_szc != 0) {
8339 8338 size_t pgsz;
8340 8339
8341 8340 pgsz = page_get_pagesize(seg->s_szc);
8342 8341 addr = (caddr_t)P2ALIGN((uintptr_t)addr, pgsz);
8343 8342 len = P2ROUNDUP(len, pgsz);
8344 8343 }
8345 8344
8346 8345 /*
8347 8346 * Check to see whether policy is set already
8348 8347 */
8349 8348 policy = lgrp_madv_to_policy(behav, len, svd->type);
8350 8349
8351 8350 anon_index = svd->anon_index + page;
8352 8351 off = svd->offset + (uintptr_t)(addr - seg->s_base);
8353 8352
8354 8353 if (svd->type == MAP_SHARED)
8355 8354 already_set = lgrp_shm_policy_set(policy, amp,
8356 8355 anon_index, vp, off, len);
8357 8356 else
8358 8357 already_set =
8359 8358 (policy == svd->policy_info.mem_policy);
8360 8359
8361 8360 /*
8362 8361 * If policy set already and it shouldn't be reapplied,
8363 8362 * don't do anything.
8364 8363 */
|
↓ open down ↓ |
129 lines elided |
↑ open up ↑ |
8365 8364 if (already_set &&
8366 8365 !LGRP_MEM_POLICY_REAPPLICABLE(policy))
8367 8366 break;
8368 8367
8369 8368 /*
8370 8369 * For private memory, need writers lock on
8371 8370 * address space because the segment may be
8372 8371 * split or concatenated when changing policy
8373 8372 */
8374 8373 if (svd->type == MAP_PRIVATE &&
8375 - AS_READ_HELD(seg->s_as, &seg->s_as->a_lock)) {
8374 + AS_READ_HELD(seg->s_as)) {
8376 8375 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8377 8376 return (IE_RETRY);
8378 8377 }
8379 8378
8380 8379 /*
8381 8380 * Mark any existing pages in given range for
8382 8381 * migration
8383 8382 */
8384 8383 page_mark_migrate(seg, addr, len, amp, svd->anon_index,
8385 8384 vp, svd->offset, 1);
8386 8385
8387 8386 /*
8388 8387 * Don't need to try to split or concatenate
8389 8388 * segments, since policy is same or this is a shared
8390 8389 * memory segment
8391 8390 */
8392 8391 if (already_set || svd->type == MAP_SHARED)
8393 8392 break;
8394 8393
8395 8394 if (HAT_IS_REGION_COOKIE_VALID(svd->rcookie)) {
8396 8395 ASSERT(svd->amp == NULL);
8397 8396 ASSERT(svd->tr_state == SEGVN_TR_OFF);
8398 8397 ASSERT(svd->softlockcnt == 0);
8399 8398 hat_leave_region(seg->s_as->a_hat, svd->rcookie,
8400 8399 HAT_REGION_TEXT);
8401 8400 svd->rcookie = HAT_INVALID_REGION_COOKIE;
8402 8401 }
8403 8402
8404 8403 /*
8405 8404 * Split off new segment if advice only applies to a
8406 8405 * portion of existing segment starting in middle
8407 8406 */
8408 8407 new_seg = NULL;
8409 8408 eaddr = addr + len;
8410 8409 oldeaddr = seg->s_base + seg->s_size;
8411 8410 if (addr > seg->s_base) {
8412 8411 /*
8413 8412 * Must flush I/O page cache
8414 8413 * before splitting segment
8415 8414 */
8416 8415 if (svd->softlockcnt > 0)
8417 8416 segvn_purge(seg);
8418 8417
8419 8418 /*
8420 8419 * Split segment and return IE_REATTACH to tell
8421 8420 * as_ctl() that current segment changed
8422 8421 */
8423 8422 new_seg = segvn_split_seg(seg, addr);
8424 8423 new_svd = (struct segvn_data *)new_seg->s_data;
8425 8424 err = IE_REATTACH;
8426 8425
8427 8426 /*
8428 8427 * If new segment ends where old one
8429 8428 * did, try to concatenate the new
8430 8429 * segment with next one.
8431 8430 */
8432 8431 if (eaddr == oldeaddr) {
8433 8432 /*
8434 8433 * Set policy for new segment
8435 8434 */
8436 8435 (void) lgrp_privm_policy_set(policy,
8437 8436 &new_svd->policy_info,
8438 8437 new_seg->s_size);
8439 8438
8440 8439 next = AS_SEGNEXT(new_seg->s_as,
8441 8440 new_seg);
8442 8441
8443 8442 if (next &&
8444 8443 next->s_ops == &segvn_ops &&
8445 8444 eaddr == next->s_base)
8446 8445 (void) segvn_concat(new_seg,
8447 8446 next, 1);
8448 8447 }
8449 8448 }
8450 8449
8451 8450 /*
8452 8451 * Split off end of existing segment if advice only
8453 8452 * applies to a portion of segment ending before
8454 8453 * end of the existing segment
8455 8454 */
8456 8455 if (eaddr < oldeaddr) {
8457 8456 /*
8458 8457 * Must flush I/O page cache
8459 8458 * before splitting segment
8460 8459 */
8461 8460 if (svd->softlockcnt > 0)
8462 8461 segvn_purge(seg);
8463 8462
8464 8463 /*
8465 8464 * If beginning of old segment was already
8466 8465 * split off, use new segment to split end off
8467 8466 * from.
8468 8467 */
8469 8468 if (new_seg != NULL && new_seg != seg) {
8470 8469 /*
8471 8470 * Split segment
8472 8471 */
8473 8472 (void) segvn_split_seg(new_seg, eaddr);
8474 8473
8475 8474 /*
8476 8475 * Set policy for new segment
8477 8476 */
8478 8477 (void) lgrp_privm_policy_set(policy,
8479 8478 &new_svd->policy_info,
8480 8479 new_seg->s_size);
8481 8480 } else {
8482 8481 /*
8483 8482 * Split segment and return IE_REATTACH
8484 8483 * to tell as_ctl() that current
8485 8484 * segment changed
8486 8485 */
8487 8486 (void) segvn_split_seg(seg, eaddr);
8488 8487 err = IE_REATTACH;
8489 8488
8490 8489 (void) lgrp_privm_policy_set(policy,
8491 8490 &svd->policy_info, seg->s_size);
8492 8491
8493 8492 /*
8494 8493 * If new segment starts where old one
8495 8494 * did, try to concatenate it with
8496 8495 * previous segment.
8497 8496 */
8498 8497 if (addr == seg->s_base) {
8499 8498 prev = AS_SEGPREV(seg->s_as,
8500 8499 seg);
8501 8500
8502 8501 /*
8503 8502 * Drop lock for private data
8504 8503 * of current segment before
8505 8504 * concatenating (deleting) it
8506 8505 */
8507 8506 if (prev &&
8508 8507 prev->s_ops ==
8509 8508 &segvn_ops &&
8510 8509 addr == prev->s_base +
8511 8510 prev->s_size) {
8512 8511 SEGVN_LOCK_EXIT(
8513 8512 seg->s_as,
8514 8513 &svd->lock);
8515 8514 (void) segvn_concat(
8516 8515 prev, seg, 1);
8517 8516 return (err);
8518 8517 }
8519 8518 }
8520 8519 }
8521 8520 }
8522 8521 break;
8523 8522 case MADV_SEQUENTIAL:
8524 8523 ASSERT(seg->s_szc == 0);
8525 8524 ASSERT(svd->rcookie == HAT_INVALID_REGION_COOKIE);
8526 8525 hat_unload(seg->s_as->a_hat, addr, len, HAT_UNLOAD);
8527 8526 /* FALLTHROUGH */
8528 8527 case MADV_NORMAL:
8529 8528 case MADV_RANDOM:
8530 8529 bvpp = &svd->vpage[page];
8531 8530 evpp = &svd->vpage[page + (len >> PAGESHIFT)];
8532 8531 for (; bvpp < evpp; bvpp++)
8533 8532 VPP_SETADVICE(bvpp, behav);
8534 8533 svd->advice = MADV_NORMAL;
8535 8534 break;
8536 8535 case MADV_WILLNEED: /* handled in memcntl */
8537 8536 case MADV_DONTNEED: /* handled in memcntl */
8538 8537 case MADV_FREE: /* handled above */
8539 8538 break;
8540 8539 default:
8541 8540 err = EINVAL;
8542 8541 }
8543 8542 }
8544 8543 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8545 8544 return (err);
8546 8545 }
8547 8546
8548 8547 /*
8549 8548 * There is one kind of inheritance that can be specified for pages:
8550 8549 *
|
↓ open down ↓ |
165 lines elided |
↑ open up ↑ |
8551 8550 * SEGP_INH_ZERO - Pages should be zeroed in the child
8552 8551 */
8553 8552 static int
8554 8553 segvn_inherit(struct seg *seg, caddr_t addr, size_t len, uint_t behav)
8555 8554 {
8556 8555 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8557 8556 struct vpage *bvpp, *evpp;
8558 8557 size_t page;
8559 8558 int ret = 0;
8560 8559
8561 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
8560 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8562 8561
8563 8562 /* Can't support something we don't know about */
8564 8563 if (behav != SEGP_INH_ZERO)
8565 8564 return (ENOTSUP);
8566 8565
8567 8566 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_WRITER);
8568 8567
8569 8568 /*
8570 8569 * This must be a straightforward anonymous segment that is mapped
8571 8570 * privately and is not backed by a vnode.
8572 8571 */
8573 8572 if (svd->tr_state != SEGVN_TR_OFF ||
8574 8573 svd->type != MAP_PRIVATE ||
8575 8574 svd->vp != NULL) {
8576 8575 ret = EINVAL;
8577 8576 goto out;
8578 8577 }
8579 8578
8580 8579 /*
8581 8580 * If the entire segment has been marked as inherit zero, then no reason
8582 8581 * to do anything else.
8583 8582 */
8584 8583 if (svd->svn_inz == SEGVN_INZ_ALL) {
8585 8584 ret = 0;
8586 8585 goto out;
8587 8586 }
8588 8587
8589 8588 /*
8590 8589 * If this applies to the entire segment, simply mark it and we're done.
8591 8590 */
8592 8591 if ((addr == seg->s_base) && (len == seg->s_size)) {
8593 8592 svd->svn_inz = SEGVN_INZ_ALL;
8594 8593 ret = 0;
8595 8594 goto out;
8596 8595 }
8597 8596
8598 8597 /*
8599 8598 * We've been asked to mark a subset of this segment as inherit zero,
8600 8599 * therefore we need to mainpulate its vpages.
8601 8600 */
8602 8601 if (svd->vpage == NULL) {
8603 8602 segvn_vpage(seg);
8604 8603 if (svd->vpage == NULL) {
8605 8604 ret = ENOMEM;
8606 8605 goto out;
8607 8606 }
8608 8607 }
8609 8608
8610 8609 svd->svn_inz = SEGVN_INZ_VPP;
8611 8610 page = seg_page(seg, addr);
8612 8611 bvpp = &svd->vpage[page];
8613 8612 evpp = &svd->vpage[page + (len >> PAGESHIFT)];
8614 8613 for (; bvpp < evpp; bvpp++)
8615 8614 VPP_SETINHZERO(bvpp);
8616 8615 ret = 0;
8617 8616
8618 8617 out:
8619 8618 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
8620 8619 return (ret);
8621 8620 }
8622 8621
8623 8622 /*
8624 8623 * Create a vpage structure for this seg.
8625 8624 */
8626 8625 static void
8627 8626 segvn_vpage(struct seg *seg)
8628 8627 {
8629 8628 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8630 8629 struct vpage *vp, *evp;
8631 8630 static pgcnt_t page_limit = 0;
8632 8631
8633 8632 ASSERT(SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
8634 8633
8635 8634 /*
8636 8635 * If no vpage structure exists, allocate one. Copy the protections
8637 8636 * and the advice from the segment itself to the individual pages.
8638 8637 */
8639 8638 if (svd->vpage == NULL) {
8640 8639 /*
8641 8640 * Start by calculating the number of pages we must allocate to
8642 8641 * track the per-page vpage structs needs for this entire
8643 8642 * segment. If we know now that it will require more than our
8644 8643 * heuristic for the maximum amount of kmem we can consume then
8645 8644 * fail. We do this here, instead of trying to detect this deep
8646 8645 * in page_resv and propagating the error up, since the entire
8647 8646 * memory allocation stack is not amenable to passing this
8648 8647 * back. Instead, it wants to keep trying.
8649 8648 *
8650 8649 * As a heuristic we set a page limit of 5/8s of total_pages
8651 8650 * for this allocation. We use shifts so that no floating
8652 8651 * point conversion takes place and only need to do the
8653 8652 * calculation once.
8654 8653 */
8655 8654 ulong_t mem_needed = seg_pages(seg) * sizeof (struct vpage);
8656 8655 pgcnt_t npages = mem_needed >> PAGESHIFT;
8657 8656
8658 8657 if (page_limit == 0)
8659 8658 page_limit = (total_pages >> 1) + (total_pages >> 3);
8660 8659
8661 8660 if (npages > page_limit)
8662 8661 return;
8663 8662
8664 8663 svd->pageadvice = 1;
8665 8664 svd->vpage = kmem_zalloc(mem_needed, KM_SLEEP);
8666 8665 evp = &svd->vpage[seg_page(seg, seg->s_base + seg->s_size)];
8667 8666 for (vp = svd->vpage; vp < evp; vp++) {
8668 8667 VPP_SETPROT(vp, svd->prot);
8669 8668 VPP_SETADVICE(vp, svd->advice);
8670 8669 }
8671 8670 }
8672 8671 }
8673 8672
8674 8673 /*
8675 8674 * Dump the pages belonging to this segvn segment.
8676 8675 */
8677 8676 static void
8678 8677 segvn_dump(struct seg *seg)
8679 8678 {
8680 8679 struct segvn_data *svd;
8681 8680 page_t *pp;
8682 8681 struct anon_map *amp;
8683 8682 ulong_t anon_index;
8684 8683 struct vnode *vp;
8685 8684 u_offset_t off, offset;
8686 8685 pfn_t pfn;
8687 8686 pgcnt_t page, npages;
8688 8687 caddr_t addr;
8689 8688
8690 8689 npages = seg_pages(seg);
8691 8690 svd = (struct segvn_data *)seg->s_data;
8692 8691 vp = svd->vp;
8693 8692 off = offset = svd->offset;
8694 8693 addr = seg->s_base;
8695 8694
8696 8695 if ((amp = svd->amp) != NULL) {
8697 8696 anon_index = svd->anon_index;
8698 8697 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
8699 8698 }
8700 8699
8701 8700 for (page = 0; page < npages; page++, offset += PAGESIZE) {
8702 8701 struct anon *ap;
8703 8702 int we_own_it = 0;
8704 8703
8705 8704 if (amp && (ap = anon_get_ptr(svd->amp->ahp, anon_index++))) {
8706 8705 swap_xlate_nopanic(ap, &vp, &off);
8707 8706 } else {
8708 8707 vp = svd->vp;
8709 8708 off = offset;
8710 8709 }
8711 8710
8712 8711 /*
8713 8712 * If pp == NULL, the page either does not exist
8714 8713 * or is exclusively locked. So determine if it
8715 8714 * exists before searching for it.
8716 8715 */
8717 8716
8718 8717 if ((pp = page_lookup_nowait(vp, off, SE_SHARED)))
8719 8718 we_own_it = 1;
8720 8719 else
8721 8720 pp = page_exists(vp, off);
8722 8721
8723 8722 if (pp) {
8724 8723 pfn = page_pptonum(pp);
8725 8724 dump_addpage(seg->s_as, addr, pfn);
8726 8725 if (we_own_it)
8727 8726 page_unlock(pp);
8728 8727 }
8729 8728 addr += PAGESIZE;
8730 8729 dump_timeleft = dump_timeout;
8731 8730 }
8732 8731
8733 8732 if (amp != NULL)
8734 8733 ANON_LOCK_EXIT(&->a_rwlock);
8735 8734 }
8736 8735
8737 8736 #ifdef DEBUG
8738 8737 static uint32_t segvn_pglock_mtbf = 0;
8739 8738 #endif
8740 8739
8741 8740 #define PCACHE_SHWLIST ((page_t *)-2)
8742 8741 #define NOPCACHE_SHWLIST ((page_t *)-1)
8743 8742
8744 8743 /*
8745 8744 * Lock/Unlock anon pages over a given range. Return shadow list. This routine
8746 8745 * uses global segment pcache to cache shadow lists (i.e. pp arrays) of pages
8747 8746 * to avoid the overhead of per page locking, unlocking for subsequent IOs to
8748 8747 * the same parts of the segment. Currently shadow list creation is only
8749 8748 * supported for pure anon segments. MAP_PRIVATE segment pcache entries are
8750 8749 * tagged with segment pointer, starting virtual address and length. This
8751 8750 * approach for MAP_SHARED segments may add many pcache entries for the same
8752 8751 * set of pages and lead to long hash chains that decrease pcache lookup
8753 8752 * performance. To avoid this issue for shared segments shared anon map and
8754 8753 * starting anon index are used for pcache entry tagging. This allows all
8755 8754 * segments to share pcache entries for the same anon range and reduces pcache
8756 8755 * chain's length as well as memory overhead from duplicate shadow lists and
8757 8756 * pcache entries.
8758 8757 *
8759 8758 * softlockcnt field in segvn_data structure counts the number of F_SOFTLOCK'd
8760 8759 * pages via segvn_fault() and pagelock'd pages via this routine. But pagelock
8761 8760 * part of softlockcnt accounting is done differently for private and shared
8762 8761 * segments. In private segment case softlock is only incremented when a new
8763 8762 * shadow list is created but not when an existing one is found via
8764 8763 * seg_plookup(). pcache entries have reference count incremented/decremented
8765 8764 * by each seg_plookup()/seg_pinactive() operation. Only entries that have 0
8766 8765 * reference count can be purged (and purging is needed before segment can be
8767 8766 * freed). When a private segment pcache entry is purged segvn_reclaim() will
8768 8767 * decrement softlockcnt. Since in private segment case each of its pcache
8769 8768 * entries only belongs to this segment we can expect that when
8770 8769 * segvn_pagelock(L_PAGEUNLOCK) was called for all outstanding IOs in this
8771 8770 * segment purge will succeed and softlockcnt will drop to 0. In shared
8772 8771 * segment case reference count in pcache entry counts active locks from many
8773 8772 * different segments so we can't expect segment purging to succeed even when
8774 8773 * segvn_pagelock(L_PAGEUNLOCK) was called for all outstanding IOs in this
8775 8774 * segment. To be able to determine when there're no pending pagelocks in
8776 8775 * shared segment case we don't rely on purging to make softlockcnt drop to 0
8777 8776 * but instead softlockcnt is incremented and decremented for every
8778 8777 * segvn_pagelock(L_PAGELOCK/L_PAGEUNLOCK) call regardless if a new shadow
8779 8778 * list was created or an existing one was found. When softlockcnt drops to 0
8780 8779 * this segment no longer has any claims for pcached shadow lists and the
8781 8780 * segment can be freed even if there're still active pcache entries
8782 8781 * shared by this segment anon map. Shared segment pcache entries belong to
8783 8782 * anon map and are typically removed when anon map is freed after all
8784 8783 * processes destroy the segments that use this anon map.
8785 8784 */
8786 8785 static int
8787 8786 segvn_pagelock(struct seg *seg, caddr_t addr, size_t len, struct page ***ppp,
8788 8787 enum lock_type type, enum seg_rw rw)
8789 8788 {
8790 8789 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
8791 8790 size_t np;
8792 8791 pgcnt_t adjustpages;
8793 8792 pgcnt_t npages;
8794 8793 ulong_t anon_index;
8795 8794 uint_t protchk = (rw == S_READ) ? PROT_READ : PROT_WRITE;
8796 8795 uint_t error;
8797 8796 struct anon_map *amp;
8798 8797 pgcnt_t anpgcnt;
8799 8798 struct page **pplist, **pl, *pp;
8800 8799 caddr_t a;
8801 8800 size_t page;
8802 8801 caddr_t lpgaddr, lpgeaddr;
8803 8802 anon_sync_obj_t cookie;
8804 8803 int anlock;
8805 8804 struct anon_map *pamp;
8806 8805 caddr_t paddr;
8807 8806 seg_preclaim_cbfunc_t preclaim_callback;
8808 8807 size_t pgsz;
8809 8808 int use_pcache;
8810 8809 size_t wlen;
8811 8810 uint_t pflags = 0;
8812 8811 int sftlck_sbase = 0;
8813 8812 int sftlck_send = 0;
8814 8813
8815 8814 #ifdef DEBUG
8816 8815 if (type == L_PAGELOCK && segvn_pglock_mtbf) {
8817 8816 hrtime_t ts = gethrtime();
8818 8817 if ((ts % segvn_pglock_mtbf) == 0) {
8819 8818 return (ENOTSUP);
|
↓ open down ↓ |
248 lines elided |
↑ open up ↑ |
8820 8819 }
8821 8820 if ((ts % segvn_pglock_mtbf) == 1) {
8822 8821 return (EFAULT);
8823 8822 }
8824 8823 }
8825 8824 #endif
8826 8825
8827 8826 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_START,
8828 8827 "segvn_pagelock: start seg %p addr %p", seg, addr);
8829 8828
8830 - ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
8829 + ASSERT(seg->s_as && AS_LOCK_HELD(seg->s_as));
8831 8830 ASSERT(type == L_PAGELOCK || type == L_PAGEUNLOCK);
8832 8831
8833 8832 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
8834 8833
8835 8834 /*
8836 8835 * for now we only support pagelock to anon memory. We would have to
8837 8836 * check protections for vnode objects and call into the vnode driver.
8838 8837 * That's too much for a fast path. Let the fault entry point handle
8839 8838 * it.
8840 8839 */
8841 8840 if (svd->vp != NULL) {
8842 8841 if (type == L_PAGELOCK) {
8843 8842 error = ENOTSUP;
8844 8843 goto out;
8845 8844 }
8846 8845 panic("segvn_pagelock(L_PAGEUNLOCK): vp != NULL");
8847 8846 }
8848 8847 if ((amp = svd->amp) == NULL) {
8849 8848 if (type == L_PAGELOCK) {
8850 8849 error = EFAULT;
8851 8850 goto out;
8852 8851 }
8853 8852 panic("segvn_pagelock(L_PAGEUNLOCK): amp == NULL");
8854 8853 }
8855 8854 if (rw != S_READ && rw != S_WRITE) {
8856 8855 if (type == L_PAGELOCK) {
8857 8856 error = ENOTSUP;
8858 8857 goto out;
8859 8858 }
8860 8859 panic("segvn_pagelock(L_PAGEUNLOCK): bad rw");
8861 8860 }
8862 8861
8863 8862 if (seg->s_szc != 0) {
8864 8863 /*
8865 8864 * We are adjusting the pagelock region to the large page size
8866 8865 * boundary because the unlocked part of a large page cannot
8867 8866 * be freed anyway unless all constituent pages of a large
8868 8867 * page are locked. Bigger regions reduce pcache chain length
8869 8868 * and improve lookup performance. The tradeoff is that the
8870 8869 * very first segvn_pagelock() call for a given page is more
8871 8870 * expensive if only 1 page_t is needed for IO. This is only
8872 8871 * an issue if pcache entry doesn't get reused by several
8873 8872 * subsequent calls. We optimize here for the case when pcache
8874 8873 * is heavily used by repeated IOs to the same address range.
8875 8874 *
8876 8875 * Note segment's page size cannot change while we are holding
8877 8876 * as lock. And then it cannot change while softlockcnt is
8878 8877 * not 0. This will allow us to correctly recalculate large
8879 8878 * page size region for the matching pageunlock/reclaim call
8880 8879 * since as_pageunlock() caller must always match
8881 8880 * as_pagelock() call's addr and len.
8882 8881 *
8883 8882 * For pageunlock *ppp points to the pointer of page_t that
8884 8883 * corresponds to the real unadjusted start address. Similar
8885 8884 * for pagelock *ppp must point to the pointer of page_t that
8886 8885 * corresponds to the real unadjusted start address.
8887 8886 */
8888 8887 pgsz = page_get_pagesize(seg->s_szc);
8889 8888 CALC_LPG_REGION(pgsz, seg, addr, len, lpgaddr, lpgeaddr);
8890 8889 adjustpages = btop((uintptr_t)(addr - lpgaddr));
8891 8890 } else if (len < segvn_pglock_comb_thrshld) {
8892 8891 lpgaddr = addr;
8893 8892 lpgeaddr = addr + len;
8894 8893 adjustpages = 0;
8895 8894 pgsz = PAGESIZE;
8896 8895 } else {
8897 8896 /*
8898 8897 * Align the address range of large enough requests to allow
8899 8898 * combining of different shadow lists into 1 to reduce memory
8900 8899 * overhead from potentially overlapping large shadow lists
8901 8900 * (worst case is we have a 1MB IO into buffers with start
8902 8901 * addresses separated by 4K). Alignment is only possible if
8903 8902 * padded chunks have sufficient access permissions. Note
8904 8903 * permissions won't change between L_PAGELOCK and
8905 8904 * L_PAGEUNLOCK calls since non 0 softlockcnt will force
8906 8905 * segvn_setprot() to wait until softlockcnt drops to 0. This
8907 8906 * allows us to determine in L_PAGEUNLOCK the same range we
8908 8907 * computed in L_PAGELOCK.
8909 8908 *
8910 8909 * If alignment is limited by segment ends set
8911 8910 * sftlck_sbase/sftlck_send flags. In L_PAGELOCK case when
8912 8911 * these flags are set bump softlockcnt_sbase/softlockcnt_send
8913 8912 * per segment counters. In L_PAGEUNLOCK case decrease
8914 8913 * softlockcnt_sbase/softlockcnt_send counters if
8915 8914 * sftlck_sbase/sftlck_send flags are set. When
8916 8915 * softlockcnt_sbase/softlockcnt_send are non 0
8917 8916 * segvn_concat()/segvn_extend_prev()/segvn_extend_next()
8918 8917 * won't merge the segments. This restriction combined with
8919 8918 * restriction on segment unmapping and splitting for segments
8920 8919 * that have non 0 softlockcnt allows L_PAGEUNLOCK to
8921 8920 * correctly determine the same range that was previously
8922 8921 * locked by matching L_PAGELOCK.
8923 8922 */
8924 8923 pflags = SEGP_PSHIFT | (segvn_pglock_comb_bshift << 16);
8925 8924 pgsz = PAGESIZE;
8926 8925 if (svd->type == MAP_PRIVATE) {
8927 8926 lpgaddr = (caddr_t)P2ALIGN((uintptr_t)addr,
8928 8927 segvn_pglock_comb_balign);
8929 8928 if (lpgaddr < seg->s_base) {
8930 8929 lpgaddr = seg->s_base;
8931 8930 sftlck_sbase = 1;
8932 8931 }
8933 8932 } else {
8934 8933 ulong_t aix = svd->anon_index + seg_page(seg, addr);
8935 8934 ulong_t aaix = P2ALIGN(aix, segvn_pglock_comb_palign);
8936 8935 if (aaix < svd->anon_index) {
8937 8936 lpgaddr = seg->s_base;
8938 8937 sftlck_sbase = 1;
8939 8938 } else {
8940 8939 lpgaddr = addr - ptob(aix - aaix);
8941 8940 ASSERT(lpgaddr >= seg->s_base);
8942 8941 }
8943 8942 }
8944 8943 if (svd->pageprot && lpgaddr != addr) {
8945 8944 struct vpage *vp = &svd->vpage[seg_page(seg, lpgaddr)];
8946 8945 struct vpage *evp = &svd->vpage[seg_page(seg, addr)];
8947 8946 while (vp < evp) {
8948 8947 if ((VPP_PROT(vp) & protchk) == 0) {
8949 8948 break;
8950 8949 }
8951 8950 vp++;
8952 8951 }
8953 8952 if (vp < evp) {
8954 8953 lpgaddr = addr;
8955 8954 pflags = 0;
8956 8955 }
8957 8956 }
8958 8957 lpgeaddr = addr + len;
8959 8958 if (pflags) {
8960 8959 if (svd->type == MAP_PRIVATE) {
8961 8960 lpgeaddr = (caddr_t)P2ROUNDUP(
8962 8961 (uintptr_t)lpgeaddr,
8963 8962 segvn_pglock_comb_balign);
8964 8963 } else {
8965 8964 ulong_t aix = svd->anon_index +
8966 8965 seg_page(seg, lpgeaddr);
8967 8966 ulong_t aaix = P2ROUNDUP(aix,
8968 8967 segvn_pglock_comb_palign);
8969 8968 if (aaix < aix) {
8970 8969 lpgeaddr = 0;
8971 8970 } else {
8972 8971 lpgeaddr += ptob(aaix - aix);
8973 8972 }
8974 8973 }
8975 8974 if (lpgeaddr == 0 ||
8976 8975 lpgeaddr > seg->s_base + seg->s_size) {
8977 8976 lpgeaddr = seg->s_base + seg->s_size;
8978 8977 sftlck_send = 1;
8979 8978 }
8980 8979 }
8981 8980 if (svd->pageprot && lpgeaddr != addr + len) {
8982 8981 struct vpage *vp;
8983 8982 struct vpage *evp;
8984 8983
8985 8984 vp = &svd->vpage[seg_page(seg, addr + len)];
8986 8985 evp = &svd->vpage[seg_page(seg, lpgeaddr)];
8987 8986
8988 8987 while (vp < evp) {
8989 8988 if ((VPP_PROT(vp) & protchk) == 0) {
8990 8989 break;
8991 8990 }
8992 8991 vp++;
8993 8992 }
8994 8993 if (vp < evp) {
8995 8994 lpgeaddr = addr + len;
8996 8995 }
8997 8996 }
8998 8997 adjustpages = btop((uintptr_t)(addr - lpgaddr));
8999 8998 }
9000 8999
9001 9000 /*
9002 9001 * For MAP_SHARED segments we create pcache entries tagged by amp and
9003 9002 * anon index so that we can share pcache entries with other segments
9004 9003 * that map this amp. For private segments pcache entries are tagged
9005 9004 * with segment and virtual address.
9006 9005 */
9007 9006 if (svd->type == MAP_SHARED) {
9008 9007 pamp = amp;
9009 9008 paddr = (caddr_t)((lpgaddr - seg->s_base) +
9010 9009 ptob(svd->anon_index));
9011 9010 preclaim_callback = shamp_reclaim;
9012 9011 } else {
9013 9012 pamp = NULL;
9014 9013 paddr = lpgaddr;
9015 9014 preclaim_callback = segvn_reclaim;
9016 9015 }
9017 9016
9018 9017 if (type == L_PAGEUNLOCK) {
9019 9018 VM_STAT_ADD(segvnvmstats.pagelock[0]);
9020 9019
9021 9020 /*
9022 9021 * update hat ref bits for /proc. We need to make sure
9023 9022 * that threads tracing the ref and mod bits of the
9024 9023 * address space get the right data.
9025 9024 * Note: page ref and mod bits are updated at reclaim time
9026 9025 */
9027 9026 if (seg->s_as->a_vbits) {
9028 9027 for (a = addr; a < addr + len; a += PAGESIZE) {
9029 9028 if (rw == S_WRITE) {
9030 9029 hat_setstat(seg->s_as, a,
9031 9030 PAGESIZE, P_REF | P_MOD);
9032 9031 } else {
9033 9032 hat_setstat(seg->s_as, a,
9034 9033 PAGESIZE, P_REF);
9035 9034 }
9036 9035 }
9037 9036 }
9038 9037
9039 9038 /*
9040 9039 * Check the shadow list entry after the last page used in
9041 9040 * this IO request. If it's NOPCACHE_SHWLIST the shadow list
9042 9041 * was not inserted into pcache and is not large page
9043 9042 * adjusted. In this case call reclaim callback directly and
9044 9043 * don't adjust the shadow list start and size for large
9045 9044 * pages.
9046 9045 */
9047 9046 npages = btop(len);
9048 9047 if ((*ppp)[npages] == NOPCACHE_SHWLIST) {
9049 9048 void *ptag;
9050 9049 if (pamp != NULL) {
9051 9050 ASSERT(svd->type == MAP_SHARED);
9052 9051 ptag = (void *)pamp;
9053 9052 paddr = (caddr_t)((addr - seg->s_base) +
9054 9053 ptob(svd->anon_index));
9055 9054 } else {
9056 9055 ptag = (void *)seg;
9057 9056 paddr = addr;
9058 9057 }
9059 9058 (*preclaim_callback)(ptag, paddr, len, *ppp, rw, 0);
9060 9059 } else {
9061 9060 ASSERT((*ppp)[npages] == PCACHE_SHWLIST ||
9062 9061 IS_SWAPFSVP((*ppp)[npages]->p_vnode));
9063 9062 len = lpgeaddr - lpgaddr;
9064 9063 npages = btop(len);
9065 9064 seg_pinactive(seg, pamp, paddr, len,
9066 9065 *ppp - adjustpages, rw, pflags, preclaim_callback);
9067 9066 }
9068 9067
9069 9068 if (pamp != NULL) {
9070 9069 ASSERT(svd->type == MAP_SHARED);
9071 9070 ASSERT(svd->softlockcnt >= npages);
9072 9071 atomic_add_long((ulong_t *)&svd->softlockcnt, -npages);
9073 9072 }
9074 9073
9075 9074 if (sftlck_sbase) {
9076 9075 ASSERT(svd->softlockcnt_sbase > 0);
9077 9076 atomic_dec_ulong((ulong_t *)&svd->softlockcnt_sbase);
9078 9077 }
9079 9078 if (sftlck_send) {
9080 9079 ASSERT(svd->softlockcnt_send > 0);
9081 9080 atomic_dec_ulong((ulong_t *)&svd->softlockcnt_send);
9082 9081 }
9083 9082
9084 9083 /*
9085 9084 * If someone is blocked while unmapping, we purge
9086 9085 * segment page cache and thus reclaim pplist synchronously
9087 9086 * without waiting for seg_pasync_thread. This speeds up
9088 9087 * unmapping in cases where munmap(2) is called, while
9089 9088 * raw async i/o is still in progress or where a thread
9090 9089 * exits on data fault in a multithreaded application.
9091 9090 */
9092 9091 if (AS_ISUNMAPWAIT(seg->s_as)) {
9093 9092 if (svd->softlockcnt == 0) {
9094 9093 mutex_enter(&seg->s_as->a_contents);
9095 9094 if (AS_ISUNMAPWAIT(seg->s_as)) {
9096 9095 AS_CLRUNMAPWAIT(seg->s_as);
9097 9096 cv_broadcast(&seg->s_as->a_cv);
9098 9097 }
9099 9098 mutex_exit(&seg->s_as->a_contents);
9100 9099 } else if (pamp == NULL) {
9101 9100 /*
9102 9101 * softlockcnt is not 0 and this is a
9103 9102 * MAP_PRIVATE segment. Try to purge its
9104 9103 * pcache entries to reduce softlockcnt.
9105 9104 * If it drops to 0 segvn_reclaim()
9106 9105 * will wake up a thread waiting on
9107 9106 * unmapwait flag.
9108 9107 *
9109 9108 * We don't purge MAP_SHARED segments with non
9110 9109 * 0 softlockcnt since IO is still in progress
9111 9110 * for such segments.
9112 9111 */
9113 9112 ASSERT(svd->type == MAP_PRIVATE);
9114 9113 segvn_purge(seg);
9115 9114 }
9116 9115 }
9117 9116 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9118 9117 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_UNLOCK_END,
9119 9118 "segvn_pagelock: unlock seg %p addr %p", seg, addr);
9120 9119 return (0);
9121 9120 }
9122 9121
9123 9122 /* The L_PAGELOCK case ... */
9124 9123
9125 9124 VM_STAT_ADD(segvnvmstats.pagelock[1]);
9126 9125
9127 9126 /*
9128 9127 * For MAP_SHARED segments we have to check protections before
9129 9128 * seg_plookup() since pcache entries may be shared by many segments
9130 9129 * with potentially different page protections.
9131 9130 */
9132 9131 if (pamp != NULL) {
9133 9132 ASSERT(svd->type == MAP_SHARED);
9134 9133 if (svd->pageprot == 0) {
9135 9134 if ((svd->prot & protchk) == 0) {
9136 9135 error = EACCES;
9137 9136 goto out;
9138 9137 }
9139 9138 } else {
9140 9139 /*
9141 9140 * check page protections
9142 9141 */
9143 9142 caddr_t ea;
9144 9143
9145 9144 if (seg->s_szc) {
9146 9145 a = lpgaddr;
9147 9146 ea = lpgeaddr;
9148 9147 } else {
9149 9148 a = addr;
9150 9149 ea = addr + len;
9151 9150 }
9152 9151 for (; a < ea; a += pgsz) {
9153 9152 struct vpage *vp;
9154 9153
9155 9154 ASSERT(seg->s_szc == 0 ||
9156 9155 sameprot(seg, a, pgsz));
9157 9156 vp = &svd->vpage[seg_page(seg, a)];
9158 9157 if ((VPP_PROT(vp) & protchk) == 0) {
9159 9158 error = EACCES;
9160 9159 goto out;
9161 9160 }
9162 9161 }
9163 9162 }
9164 9163 }
9165 9164
9166 9165 /*
9167 9166 * try to find pages in segment page cache
9168 9167 */
9169 9168 pplist = seg_plookup(seg, pamp, paddr, lpgeaddr - lpgaddr, rw, pflags);
9170 9169 if (pplist != NULL) {
9171 9170 if (pamp != NULL) {
9172 9171 npages = btop((uintptr_t)(lpgeaddr - lpgaddr));
9173 9172 ASSERT(svd->type == MAP_SHARED);
9174 9173 atomic_add_long((ulong_t *)&svd->softlockcnt,
9175 9174 npages);
9176 9175 }
9177 9176 if (sftlck_sbase) {
9178 9177 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_sbase);
9179 9178 }
9180 9179 if (sftlck_send) {
9181 9180 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_send);
9182 9181 }
9183 9182 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9184 9183 *ppp = pplist + adjustpages;
9185 9184 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_HIT_END,
9186 9185 "segvn_pagelock: cache hit seg %p addr %p", seg, addr);
9187 9186 return (0);
9188 9187 }
9189 9188
9190 9189 /*
9191 9190 * For MAP_SHARED segments we already verified above that segment
9192 9191 * protections allow this pagelock operation.
9193 9192 */
9194 9193 if (pamp == NULL) {
9195 9194 ASSERT(svd->type == MAP_PRIVATE);
9196 9195 if (svd->pageprot == 0) {
9197 9196 if ((svd->prot & protchk) == 0) {
9198 9197 error = EACCES;
9199 9198 goto out;
9200 9199 }
9201 9200 if (svd->prot & PROT_WRITE) {
9202 9201 wlen = lpgeaddr - lpgaddr;
9203 9202 } else {
9204 9203 wlen = 0;
9205 9204 ASSERT(rw == S_READ);
9206 9205 }
9207 9206 } else {
9208 9207 int wcont = 1;
9209 9208 /*
9210 9209 * check page protections
9211 9210 */
9212 9211 for (a = lpgaddr, wlen = 0; a < lpgeaddr; a += pgsz) {
9213 9212 struct vpage *vp;
9214 9213
9215 9214 ASSERT(seg->s_szc == 0 ||
9216 9215 sameprot(seg, a, pgsz));
9217 9216 vp = &svd->vpage[seg_page(seg, a)];
9218 9217 if ((VPP_PROT(vp) & protchk) == 0) {
9219 9218 error = EACCES;
9220 9219 goto out;
9221 9220 }
9222 9221 if (wcont && (VPP_PROT(vp) & PROT_WRITE)) {
9223 9222 wlen += pgsz;
9224 9223 } else {
9225 9224 wcont = 0;
9226 9225 ASSERT(rw == S_READ);
9227 9226 }
9228 9227 }
9229 9228 }
9230 9229 ASSERT(rw == S_READ || wlen == lpgeaddr - lpgaddr);
9231 9230 ASSERT(rw == S_WRITE || wlen <= lpgeaddr - lpgaddr);
9232 9231 }
9233 9232
9234 9233 /*
9235 9234 * Only build large page adjusted shadow list if we expect to insert
9236 9235 * it into pcache. For large enough pages it's a big overhead to
9237 9236 * create a shadow list of the entire large page. But this overhead
9238 9237 * should be amortized over repeated pcache hits on subsequent reuse
9239 9238 * of this shadow list (IO into any range within this shadow list will
9240 9239 * find it in pcache since we large page align the request for pcache
9241 9240 * lookups). pcache performance is improved with bigger shadow lists
9242 9241 * as it reduces the time to pcache the entire big segment and reduces
9243 9242 * pcache chain length.
9244 9243 */
9245 9244 if (seg_pinsert_check(seg, pamp, paddr,
9246 9245 lpgeaddr - lpgaddr, pflags) == SEGP_SUCCESS) {
9247 9246 addr = lpgaddr;
9248 9247 len = lpgeaddr - lpgaddr;
9249 9248 use_pcache = 1;
9250 9249 } else {
9251 9250 use_pcache = 0;
9252 9251 /*
9253 9252 * Since this entry will not be inserted into the pcache, we
9254 9253 * will not do any adjustments to the starting address or
9255 9254 * size of the memory to be locked.
9256 9255 */
9257 9256 adjustpages = 0;
9258 9257 }
9259 9258 npages = btop(len);
9260 9259
9261 9260 pplist = kmem_alloc(sizeof (page_t *) * (npages + 1), KM_SLEEP);
9262 9261 pl = pplist;
9263 9262 *ppp = pplist + adjustpages;
9264 9263 /*
9265 9264 * If use_pcache is 0 this shadow list is not large page adjusted.
9266 9265 * Record this info in the last entry of shadow array so that
9267 9266 * L_PAGEUNLOCK can determine if it should large page adjust the
9268 9267 * address range to find the real range that was locked.
9269 9268 */
9270 9269 pl[npages] = use_pcache ? PCACHE_SHWLIST : NOPCACHE_SHWLIST;
9271 9270
9272 9271 page = seg_page(seg, addr);
9273 9272 anon_index = svd->anon_index + page;
9274 9273
9275 9274 anlock = 0;
9276 9275 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
9277 9276 ASSERT(amp->a_szc >= seg->s_szc);
9278 9277 anpgcnt = page_get_pagecnt(amp->a_szc);
9279 9278 for (a = addr; a < addr + len; a += PAGESIZE, anon_index++) {
9280 9279 struct anon *ap;
9281 9280 struct vnode *vp;
9282 9281 u_offset_t off;
9283 9282
9284 9283 /*
9285 9284 * Lock and unlock anon array only once per large page.
9286 9285 * anon_array_enter() locks the root anon slot according to
9287 9286 * a_szc which can't change while anon map is locked. We lock
9288 9287 * anon the first time through this loop and each time we
9289 9288 * reach anon index that corresponds to a root of a large
9290 9289 * page.
9291 9290 */
9292 9291 if (a == addr || P2PHASE(anon_index, anpgcnt) == 0) {
9293 9292 ASSERT(anlock == 0);
9294 9293 anon_array_enter(amp, anon_index, &cookie);
9295 9294 anlock = 1;
9296 9295 }
9297 9296 ap = anon_get_ptr(amp->ahp, anon_index);
9298 9297
9299 9298 /*
9300 9299 * We must never use seg_pcache for COW pages
9301 9300 * because we might end up with original page still
9302 9301 * lying in seg_pcache even after private page is
9303 9302 * created. This leads to data corruption as
9304 9303 * aio_write refers to the page still in cache
9305 9304 * while all other accesses refer to the private
9306 9305 * page.
9307 9306 */
9308 9307 if (ap == NULL || ap->an_refcnt != 1) {
9309 9308 struct vpage *vpage;
9310 9309
9311 9310 if (seg->s_szc) {
9312 9311 error = EFAULT;
9313 9312 break;
9314 9313 }
9315 9314 if (svd->vpage != NULL) {
9316 9315 vpage = &svd->vpage[seg_page(seg, a)];
9317 9316 } else {
9318 9317 vpage = NULL;
9319 9318 }
9320 9319 ASSERT(anlock);
9321 9320 anon_array_exit(&cookie);
9322 9321 anlock = 0;
9323 9322 pp = NULL;
9324 9323 error = segvn_faultpage(seg->s_as->a_hat, seg, a, 0,
9325 9324 vpage, &pp, 0, F_INVAL, rw, 1);
9326 9325 if (error) {
9327 9326 error = fc_decode(error);
9328 9327 break;
9329 9328 }
9330 9329 anon_array_enter(amp, anon_index, &cookie);
9331 9330 anlock = 1;
9332 9331 ap = anon_get_ptr(amp->ahp, anon_index);
9333 9332 if (ap == NULL || ap->an_refcnt != 1) {
9334 9333 error = EFAULT;
9335 9334 break;
9336 9335 }
9337 9336 }
9338 9337 swap_xlate(ap, &vp, &off);
9339 9338 pp = page_lookup_nowait(vp, off, SE_SHARED);
9340 9339 if (pp == NULL) {
9341 9340 error = EFAULT;
9342 9341 break;
9343 9342 }
9344 9343 if (ap->an_pvp != NULL) {
9345 9344 anon_swap_free(ap, pp);
9346 9345 }
9347 9346 /*
9348 9347 * Unlock anon if this is the last slot in a large page.
9349 9348 */
9350 9349 if (P2PHASE(anon_index, anpgcnt) == anpgcnt - 1) {
9351 9350 ASSERT(anlock);
9352 9351 anon_array_exit(&cookie);
9353 9352 anlock = 0;
9354 9353 }
9355 9354 *pplist++ = pp;
9356 9355 }
9357 9356 if (anlock) { /* Ensure the lock is dropped */
9358 9357 anon_array_exit(&cookie);
9359 9358 }
9360 9359 ANON_LOCK_EXIT(&->a_rwlock);
9361 9360
9362 9361 if (a >= addr + len) {
9363 9362 atomic_add_long((ulong_t *)&svd->softlockcnt, npages);
9364 9363 if (pamp != NULL) {
9365 9364 ASSERT(svd->type == MAP_SHARED);
9366 9365 atomic_add_long((ulong_t *)&pamp->a_softlockcnt,
9367 9366 npages);
9368 9367 wlen = len;
9369 9368 }
9370 9369 if (sftlck_sbase) {
9371 9370 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_sbase);
9372 9371 }
9373 9372 if (sftlck_send) {
9374 9373 atomic_inc_ulong((ulong_t *)&svd->softlockcnt_send);
9375 9374 }
9376 9375 if (use_pcache) {
9377 9376 (void) seg_pinsert(seg, pamp, paddr, len, wlen, pl,
9378 9377 rw, pflags, preclaim_callback);
9379 9378 }
9380 9379 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9381 9380 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_FILL_END,
9382 9381 "segvn_pagelock: cache fill seg %p addr %p", seg, addr);
9383 9382 return (0);
9384 9383 }
9385 9384
9386 9385 pplist = pl;
9387 9386 np = ((uintptr_t)(a - addr)) >> PAGESHIFT;
9388 9387 while (np > (uint_t)0) {
9389 9388 ASSERT(PAGE_LOCKED(*pplist));
9390 9389 page_unlock(*pplist);
9391 9390 np--;
9392 9391 pplist++;
9393 9392 }
9394 9393 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9395 9394 out:
9396 9395 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9397 9396 *ppp = NULL;
9398 9397 TRACE_2(TR_FAC_PHYSIO, TR_PHYSIO_SEGVN_MISS_END,
9399 9398 "segvn_pagelock: cache miss seg %p addr %p", seg, addr);
9400 9399 return (error);
9401 9400 }
9402 9401
9403 9402 /*
9404 9403 * purge any cached pages in the I/O page cache
9405 9404 */
9406 9405 static void
9407 9406 segvn_purge(struct seg *seg)
9408 9407 {
9409 9408 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9410 9409
9411 9410 /*
9412 9411 * pcache is only used by pure anon segments.
9413 9412 */
9414 9413 if (svd->amp == NULL || svd->vp != NULL) {
9415 9414 return;
9416 9415 }
9417 9416
9418 9417 /*
9419 9418 * For MAP_SHARED segments non 0 segment's softlockcnt means
9420 9419 * active IO is still in progress via this segment. So we only
9421 9420 * purge MAP_SHARED segments when their softlockcnt is 0.
9422 9421 */
9423 9422 if (svd->type == MAP_PRIVATE) {
9424 9423 if (svd->softlockcnt) {
9425 9424 seg_ppurge(seg, NULL, 0);
9426 9425 }
9427 9426 } else if (svd->softlockcnt == 0 && svd->amp->a_softlockcnt != 0) {
9428 9427 seg_ppurge(seg, svd->amp, 0);
9429 9428 }
9430 9429 }
9431 9430
9432 9431 /*
9433 9432 * If async argument is not 0 we are called from pcache async thread and don't
9434 9433 * hold AS lock.
9435 9434 */
9436 9435
9437 9436 /*ARGSUSED*/
9438 9437 static int
9439 9438 segvn_reclaim(void *ptag, caddr_t addr, size_t len, struct page **pplist,
9440 9439 enum seg_rw rw, int async)
9441 9440 {
|
↓ open down ↓ |
601 lines elided |
↑ open up ↑ |
9442 9441 struct seg *seg = (struct seg *)ptag;
9443 9442 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9444 9443 pgcnt_t np, npages;
9445 9444 struct page **pl;
9446 9445
9447 9446 npages = np = btop(len);
9448 9447 ASSERT(npages);
9449 9448
9450 9449 ASSERT(svd->vp == NULL && svd->amp != NULL);
9451 9450 ASSERT(svd->softlockcnt >= npages);
9452 - ASSERT(async || AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
9451 + ASSERT(async || AS_LOCK_HELD(seg->s_as));
9453 9452
9454 9453 pl = pplist;
9455 9454
9456 9455 ASSERT(pl[np] == NOPCACHE_SHWLIST || pl[np] == PCACHE_SHWLIST);
9457 9456 ASSERT(!async || pl[np] == PCACHE_SHWLIST);
9458 9457
9459 9458 while (np > (uint_t)0) {
9460 9459 if (rw == S_WRITE) {
9461 9460 hat_setrefmod(*pplist);
9462 9461 } else {
9463 9462 hat_setref(*pplist);
9464 9463 }
9465 9464 page_unlock(*pplist);
9466 9465 np--;
9467 9466 pplist++;
9468 9467 }
9469 9468
9470 9469 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9471 9470
9472 9471 /*
9473 9472 * If we are pcache async thread we don't hold AS lock. This means if
9474 9473 * softlockcnt drops to 0 after the decrement below address space may
9475 9474 * get freed. We can't allow it since after softlock derement to 0 we
9476 9475 * still need to access as structure for possible wakeup of unmap
9477 9476 * waiters. To prevent the disappearance of as we take this segment
9478 9477 * segfree_syncmtx. segvn_free() also takes this mutex as a barrier to
9479 9478 * make sure this routine completes before segment is freed.
9480 9479 *
9481 9480 * The second complication we have to deal with in async case is a
9482 9481 * possibility of missed wake up of unmap wait thread. When we don't
9483 9482 * hold as lock here we may take a_contents lock before unmap wait
9484 9483 * thread that was first to see softlockcnt was still not 0. As a
9485 9484 * result we'll fail to wake up an unmap wait thread. To avoid this
9486 9485 * race we set nounmapwait flag in as structure if we drop softlockcnt
9487 9486 * to 0 when we were called by pcache async thread. unmapwait thread
9488 9487 * will not block if this flag is set.
9489 9488 */
9490 9489 if (async) {
9491 9490 mutex_enter(&svd->segfree_syncmtx);
9492 9491 }
9493 9492
9494 9493 if (!atomic_add_long_nv((ulong_t *)&svd->softlockcnt, -npages)) {
9495 9494 if (async || AS_ISUNMAPWAIT(seg->s_as)) {
9496 9495 mutex_enter(&seg->s_as->a_contents);
9497 9496 if (async) {
9498 9497 AS_SETNOUNMAPWAIT(seg->s_as);
9499 9498 }
9500 9499 if (AS_ISUNMAPWAIT(seg->s_as)) {
9501 9500 AS_CLRUNMAPWAIT(seg->s_as);
9502 9501 cv_broadcast(&seg->s_as->a_cv);
9503 9502 }
9504 9503 mutex_exit(&seg->s_as->a_contents);
9505 9504 }
9506 9505 }
9507 9506
9508 9507 if (async) {
9509 9508 mutex_exit(&svd->segfree_syncmtx);
9510 9509 }
9511 9510 return (0);
9512 9511 }
9513 9512
9514 9513 /*ARGSUSED*/
9515 9514 static int
9516 9515 shamp_reclaim(void *ptag, caddr_t addr, size_t len, struct page **pplist,
9517 9516 enum seg_rw rw, int async)
9518 9517 {
9519 9518 amp_t *amp = (amp_t *)ptag;
9520 9519 pgcnt_t np, npages;
9521 9520 struct page **pl;
9522 9521
9523 9522 npages = np = btop(len);
9524 9523 ASSERT(npages);
9525 9524 ASSERT(amp->a_softlockcnt >= npages);
9526 9525
9527 9526 pl = pplist;
9528 9527
9529 9528 ASSERT(pl[np] == NOPCACHE_SHWLIST || pl[np] == PCACHE_SHWLIST);
9530 9529 ASSERT(!async || pl[np] == PCACHE_SHWLIST);
9531 9530
9532 9531 while (np > (uint_t)0) {
9533 9532 if (rw == S_WRITE) {
9534 9533 hat_setrefmod(*pplist);
9535 9534 } else {
9536 9535 hat_setref(*pplist);
9537 9536 }
9538 9537 page_unlock(*pplist);
9539 9538 np--;
9540 9539 pplist++;
9541 9540 }
9542 9541
9543 9542 kmem_free(pl, sizeof (page_t *) * (npages + 1));
9544 9543
9545 9544 /*
9546 9545 * If somebody sleeps in anonmap_purge() wake them up if a_softlockcnt
9547 9546 * drops to 0. anon map can't be freed until a_softlockcnt drops to 0
9548 9547 * and anonmap_purge() acquires a_purgemtx.
9549 9548 */
9550 9549 mutex_enter(&->a_purgemtx);
9551 9550 if (!atomic_add_long_nv((ulong_t *)&->a_softlockcnt, -npages) &&
9552 9551 amp->a_purgewait) {
9553 9552 amp->a_purgewait = 0;
9554 9553 cv_broadcast(&->a_purgecv);
9555 9554 }
9556 9555 mutex_exit(&->a_purgemtx);
9557 9556 return (0);
9558 9557 }
9559 9558
9560 9559 /*
9561 9560 * get a memory ID for an addr in a given segment
9562 9561 *
9563 9562 * XXX only creates PAGESIZE pages if anon slots are not initialized.
9564 9563 * At fault time they will be relocated into larger pages.
9565 9564 */
9566 9565 static int
9567 9566 segvn_getmemid(struct seg *seg, caddr_t addr, memid_t *memidp)
9568 9567 {
9569 9568 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9570 9569 struct anon *ap = NULL;
9571 9570 ulong_t anon_index;
9572 9571 struct anon_map *amp;
9573 9572 anon_sync_obj_t cookie;
9574 9573
9575 9574 if (svd->type == MAP_PRIVATE) {
9576 9575 memidp->val[0] = (uintptr_t)seg->s_as;
9577 9576 memidp->val[1] = (uintptr_t)addr;
9578 9577 return (0);
9579 9578 }
9580 9579
9581 9580 if (svd->type == MAP_SHARED) {
9582 9581 if (svd->vp) {
9583 9582 memidp->val[0] = (uintptr_t)svd->vp;
9584 9583 memidp->val[1] = (u_longlong_t)svd->offset +
9585 9584 (uintptr_t)(addr - seg->s_base);
9586 9585 return (0);
9587 9586 } else {
9588 9587
9589 9588 SEGVN_LOCK_ENTER(seg->s_as, &svd->lock, RW_READER);
9590 9589 if ((amp = svd->amp) != NULL) {
9591 9590 anon_index = svd->anon_index +
9592 9591 seg_page(seg, addr);
9593 9592 }
9594 9593 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
9595 9594
9596 9595 ASSERT(amp != NULL);
9597 9596
9598 9597 ANON_LOCK_ENTER(&->a_rwlock, RW_READER);
9599 9598 anon_array_enter(amp, anon_index, &cookie);
9600 9599 ap = anon_get_ptr(amp->ahp, anon_index);
9601 9600 if (ap == NULL) {
9602 9601 page_t *pp;
9603 9602
9604 9603 pp = anon_zero(seg, addr, &ap, svd->cred);
9605 9604 if (pp == NULL) {
9606 9605 anon_array_exit(&cookie);
9607 9606 ANON_LOCK_EXIT(&->a_rwlock);
9608 9607 return (ENOMEM);
9609 9608 }
9610 9609 ASSERT(anon_get_ptr(amp->ahp, anon_index)
9611 9610 == NULL);
9612 9611 (void) anon_set_ptr(amp->ahp, anon_index,
9613 9612 ap, ANON_SLEEP);
9614 9613 page_unlock(pp);
9615 9614 }
9616 9615
9617 9616 anon_array_exit(&cookie);
9618 9617 ANON_LOCK_EXIT(&->a_rwlock);
9619 9618
9620 9619 memidp->val[0] = (uintptr_t)ap;
9621 9620 memidp->val[1] = (uintptr_t)addr & PAGEOFFSET;
9622 9621 return (0);
9623 9622 }
9624 9623 }
9625 9624 return (EINVAL);
9626 9625 }
9627 9626
9628 9627 static int
9629 9628 sameprot(struct seg *seg, caddr_t a, size_t len)
9630 9629 {
9631 9630 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9632 9631 struct vpage *vpage;
9633 9632 spgcnt_t pages = btop(len);
9634 9633 uint_t prot;
9635 9634
9636 9635 if (svd->pageprot == 0)
9637 9636 return (1);
9638 9637
9639 9638 ASSERT(svd->vpage != NULL);
9640 9639
9641 9640 vpage = &svd->vpage[seg_page(seg, a)];
9642 9641 prot = VPP_PROT(vpage);
9643 9642 vpage++;
9644 9643 pages--;
9645 9644 while (pages-- > 0) {
9646 9645 if (prot != VPP_PROT(vpage))
9647 9646 return (0);
9648 9647 vpage++;
9649 9648 }
9650 9649 return (1);
9651 9650 }
9652 9651
9653 9652 /*
9654 9653 * Get memory allocation policy info for specified address in given segment
9655 9654 */
9656 9655 static lgrp_mem_policy_info_t *
9657 9656 segvn_getpolicy(struct seg *seg, caddr_t addr)
9658 9657 {
9659 9658 struct anon_map *amp;
9660 9659 ulong_t anon_index;
9661 9660 lgrp_mem_policy_info_t *policy_info;
9662 9661 struct segvn_data *svn_data;
9663 9662 u_offset_t vn_off;
9664 9663 vnode_t *vp;
9665 9664
9666 9665 ASSERT(seg != NULL);
9667 9666
9668 9667 svn_data = (struct segvn_data *)seg->s_data;
9669 9668 if (svn_data == NULL)
9670 9669 return (NULL);
9671 9670
9672 9671 /*
9673 9672 * Get policy info for private or shared memory
9674 9673 */
9675 9674 if (svn_data->type != MAP_SHARED) {
9676 9675 if (svn_data->tr_state != SEGVN_TR_ON) {
9677 9676 policy_info = &svn_data->policy_info;
9678 9677 } else {
9679 9678 policy_info = &svn_data->tr_policy_info;
9680 9679 ASSERT(policy_info->mem_policy ==
9681 9680 LGRP_MEM_POLICY_NEXT_SEG);
9682 9681 }
9683 9682 } else {
9684 9683 amp = svn_data->amp;
9685 9684 anon_index = svn_data->anon_index + seg_page(seg, addr);
9686 9685 vp = svn_data->vp;
9687 9686 vn_off = svn_data->offset + (uintptr_t)(addr - seg->s_base);
9688 9687 policy_info = lgrp_shm_policy_get(amp, anon_index, vp, vn_off);
9689 9688 }
9690 9689
9691 9690 return (policy_info);
9692 9691 }
9693 9692
9694 9693 /*ARGSUSED*/
9695 9694 static int
9696 9695 segvn_capable(struct seg *seg, segcapability_t capability)
9697 9696 {
9698 9697 return (0);
9699 9698 }
9700 9699
9701 9700 /*
9702 9701 * Bind text vnode segment to an amp. If we bind successfully mappings will be
9703 9702 * established to per vnode mapping per lgroup amp pages instead of to vnode
9704 9703 * pages. There's one amp per vnode text mapping per lgroup. Many processes
9705 9704 * may share the same text replication amp. If a suitable amp doesn't already
9706 9705 * exist in svntr hash table create a new one. We may fail to bind to amp if
9707 9706 * segment is not eligible for text replication. Code below first checks for
9708 9707 * these conditions. If binding is successful segment tr_state is set to on
9709 9708 * and svd->amp points to the amp to use. Otherwise tr_state is set to off and
9710 9709 * svd->amp remains as NULL.
9711 9710 */
9712 9711 static void
9713 9712 segvn_textrepl(struct seg *seg)
9714 9713 {
9715 9714 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
9716 9715 vnode_t *vp = svd->vp;
9717 9716 u_offset_t off = svd->offset;
9718 9717 size_t size = seg->s_size;
9719 9718 u_offset_t eoff = off + size;
|
↓ open down ↓ |
257 lines elided |
↑ open up ↑ |
9720 9719 uint_t szc = seg->s_szc;
9721 9720 ulong_t hash = SVNTR_HASH_FUNC(vp);
9722 9721 svntr_t *svntrp;
9723 9722 struct vattr va;
9724 9723 proc_t *p = seg->s_as->a_proc;
9725 9724 lgrp_id_t lgrp_id;
9726 9725 lgrp_id_t olid;
9727 9726 int first;
9728 9727 struct anon_map *amp;
9729 9728
9730 - ASSERT(AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
9729 + ASSERT(AS_LOCK_HELD(seg->s_as));
9731 9730 ASSERT(SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
9732 9731 ASSERT(p != NULL);
9733 9732 ASSERT(svd->tr_state == SEGVN_TR_INIT);
9734 9733 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
9735 9734 ASSERT(svd->flags & MAP_TEXT);
9736 9735 ASSERT(svd->type == MAP_PRIVATE);
9737 9736 ASSERT(vp != NULL && svd->amp == NULL);
9738 9737 ASSERT(!svd->pageprot && !(svd->prot & PROT_WRITE));
9739 9738 ASSERT(!(svd->flags & MAP_NORESERVE) && svd->swresv == 0);
9740 9739 ASSERT(seg->s_as != &kas);
9741 9740 ASSERT(off < eoff);
9742 9741 ASSERT(svntr_hashtab != NULL);
9743 9742
9744 9743 /*
9745 9744 * If numa optimizations are no longer desired bail out.
9746 9745 */
9747 9746 if (!lgrp_optimizations()) {
9748 9747 svd->tr_state = SEGVN_TR_OFF;
9749 9748 return;
9750 9749 }
9751 9750
9752 9751 /*
9753 9752 * Avoid creating anon maps with size bigger than the file size.
9754 9753 * If VOP_GETATTR() call fails bail out.
9755 9754 */
9756 9755 va.va_mask = AT_SIZE | AT_MTIME | AT_CTIME;
9757 9756 if (VOP_GETATTR(vp, &va, 0, svd->cred, NULL) != 0) {
9758 9757 svd->tr_state = SEGVN_TR_OFF;
9759 9758 SEGVN_TR_ADDSTAT(gaerr);
9760 9759 return;
9761 9760 }
9762 9761 if (btopr(va.va_size) < btopr(eoff)) {
9763 9762 svd->tr_state = SEGVN_TR_OFF;
9764 9763 SEGVN_TR_ADDSTAT(overmap);
9765 9764 return;
9766 9765 }
9767 9766
9768 9767 /*
9769 9768 * VVMEXEC may not be set yet if exec() prefaults text segment. Set
9770 9769 * this flag now before vn_is_mapped(V_WRITE) so that MAP_SHARED
9771 9770 * mapping that checks if trcache for this vnode needs to be
9772 9771 * invalidated can't miss us.
9773 9772 */
9774 9773 if (!(vp->v_flag & VVMEXEC)) {
9775 9774 mutex_enter(&vp->v_lock);
9776 9775 vp->v_flag |= VVMEXEC;
9777 9776 mutex_exit(&vp->v_lock);
9778 9777 }
9779 9778 mutex_enter(&svntr_hashtab[hash].tr_lock);
9780 9779 /*
9781 9780 * Bail out if potentially MAP_SHARED writable mappings exist to this
9782 9781 * vnode. We don't want to use old file contents from existing
9783 9782 * replicas if this mapping was established after the original file
9784 9783 * was changed.
9785 9784 */
9786 9785 if (vn_is_mapped(vp, V_WRITE)) {
9787 9786 mutex_exit(&svntr_hashtab[hash].tr_lock);
9788 9787 svd->tr_state = SEGVN_TR_OFF;
9789 9788 SEGVN_TR_ADDSTAT(wrcnt);
9790 9789 return;
9791 9790 }
9792 9791 svntrp = svntr_hashtab[hash].tr_head;
9793 9792 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
9794 9793 ASSERT(svntrp->tr_refcnt != 0);
9795 9794 if (svntrp->tr_vp != vp) {
9796 9795 continue;
9797 9796 }
9798 9797
9799 9798 /*
9800 9799 * Bail out if the file or its attributes were changed after
9801 9800 * this replication entry was created since we need to use the
9802 9801 * latest file contents. Note that mtime test alone is not
9803 9802 * sufficient because a user can explicitly change mtime via
9804 9803 * utimes(2) interfaces back to the old value after modifiying
9805 9804 * the file contents. To detect this case we also have to test
9806 9805 * ctime which among other things records the time of the last
9807 9806 * mtime change by utimes(2). ctime is not changed when the file
9808 9807 * is only read or executed so we expect that typically existing
9809 9808 * replication amp's can be used most of the time.
9810 9809 */
9811 9810 if (!svntrp->tr_valid ||
9812 9811 svntrp->tr_mtime.tv_sec != va.va_mtime.tv_sec ||
9813 9812 svntrp->tr_mtime.tv_nsec != va.va_mtime.tv_nsec ||
9814 9813 svntrp->tr_ctime.tv_sec != va.va_ctime.tv_sec ||
9815 9814 svntrp->tr_ctime.tv_nsec != va.va_ctime.tv_nsec) {
9816 9815 mutex_exit(&svntr_hashtab[hash].tr_lock);
9817 9816 svd->tr_state = SEGVN_TR_OFF;
9818 9817 SEGVN_TR_ADDSTAT(stale);
9819 9818 return;
9820 9819 }
9821 9820 /*
9822 9821 * if off, eoff and szc match current segment we found the
9823 9822 * existing entry we can use.
9824 9823 */
9825 9824 if (svntrp->tr_off == off && svntrp->tr_eoff == eoff &&
9826 9825 svntrp->tr_szc == szc) {
9827 9826 break;
9828 9827 }
9829 9828 /*
9830 9829 * Don't create different but overlapping in file offsets
9831 9830 * entries to avoid replication of the same file pages more
9832 9831 * than once per lgroup.
9833 9832 */
9834 9833 if ((off >= svntrp->tr_off && off < svntrp->tr_eoff) ||
9835 9834 (eoff > svntrp->tr_off && eoff <= svntrp->tr_eoff)) {
9836 9835 mutex_exit(&svntr_hashtab[hash].tr_lock);
9837 9836 svd->tr_state = SEGVN_TR_OFF;
9838 9837 SEGVN_TR_ADDSTAT(overlap);
9839 9838 return;
9840 9839 }
9841 9840 }
9842 9841 /*
9843 9842 * If we didn't find existing entry create a new one.
9844 9843 */
9845 9844 if (svntrp == NULL) {
9846 9845 svntrp = kmem_cache_alloc(svntr_cache, KM_NOSLEEP);
9847 9846 if (svntrp == NULL) {
9848 9847 mutex_exit(&svntr_hashtab[hash].tr_lock);
9849 9848 svd->tr_state = SEGVN_TR_OFF;
9850 9849 SEGVN_TR_ADDSTAT(nokmem);
9851 9850 return;
9852 9851 }
9853 9852 #ifdef DEBUG
9854 9853 {
9855 9854 lgrp_id_t i;
9856 9855 for (i = 0; i < NLGRPS_MAX; i++) {
9857 9856 ASSERT(svntrp->tr_amp[i] == NULL);
9858 9857 }
9859 9858 }
9860 9859 #endif /* DEBUG */
9861 9860 svntrp->tr_vp = vp;
9862 9861 svntrp->tr_off = off;
9863 9862 svntrp->tr_eoff = eoff;
9864 9863 svntrp->tr_szc = szc;
9865 9864 svntrp->tr_valid = 1;
9866 9865 svntrp->tr_mtime = va.va_mtime;
9867 9866 svntrp->tr_ctime = va.va_ctime;
9868 9867 svntrp->tr_refcnt = 0;
9869 9868 svntrp->tr_next = svntr_hashtab[hash].tr_head;
9870 9869 svntr_hashtab[hash].tr_head = svntrp;
9871 9870 }
9872 9871 first = 1;
9873 9872 again:
9874 9873 /*
9875 9874 * We want to pick a replica with pages on main thread's (t_tid = 1,
9876 9875 * aka T1) lgrp. Currently text replication is only optimized for
9877 9876 * workloads that either have all threads of a process on the same
9878 9877 * lgrp or execute their large text primarily on main thread.
9879 9878 */
9880 9879 lgrp_id = p->p_t1_lgrpid;
9881 9880 if (lgrp_id == LGRP_NONE) {
9882 9881 /*
9883 9882 * In case exec() prefaults text on non main thread use
9884 9883 * current thread lgrpid. It will become main thread anyway
9885 9884 * soon.
9886 9885 */
9887 9886 lgrp_id = lgrp_home_id(curthread);
9888 9887 }
9889 9888 /*
9890 9889 * Set p_tr_lgrpid to lgrpid if it hasn't been set yet. Otherwise
9891 9890 * just set it to NLGRPS_MAX if it's different from current process T1
9892 9891 * home lgrp. p_tr_lgrpid is used to detect if process uses text
9893 9892 * replication and T1 new home is different from lgrp used for text
9894 9893 * replication. When this happens asyncronous segvn thread rechecks if
9895 9894 * segments should change lgrps used for text replication. If we fail
9896 9895 * to set p_tr_lgrpid with atomic_cas_32 then set it to NLGRPS_MAX
9897 9896 * without cas if it's not already NLGRPS_MAX and not equal lgrp_id
9898 9897 * we want to use. We don't need to use cas in this case because
9899 9898 * another thread that races in between our non atomic check and set
9900 9899 * may only change p_tr_lgrpid to NLGRPS_MAX at this point.
9901 9900 */
9902 9901 ASSERT(lgrp_id != LGRP_NONE && lgrp_id < NLGRPS_MAX);
9903 9902 olid = p->p_tr_lgrpid;
9904 9903 if (lgrp_id != olid && olid != NLGRPS_MAX) {
9905 9904 lgrp_id_t nlid = (olid == LGRP_NONE) ? lgrp_id : NLGRPS_MAX;
9906 9905 if (atomic_cas_32((uint32_t *)&p->p_tr_lgrpid, olid, nlid) !=
9907 9906 olid) {
9908 9907 olid = p->p_tr_lgrpid;
9909 9908 ASSERT(olid != LGRP_NONE);
9910 9909 if (olid != lgrp_id && olid != NLGRPS_MAX) {
9911 9910 p->p_tr_lgrpid = NLGRPS_MAX;
9912 9911 }
9913 9912 }
9914 9913 ASSERT(p->p_tr_lgrpid != LGRP_NONE);
9915 9914 membar_producer();
9916 9915 /*
9917 9916 * lgrp_move_thread() won't schedule async recheck after
9918 9917 * p->p_t1_lgrpid update unless p->p_tr_lgrpid is not
9919 9918 * LGRP_NONE. Recheck p_t1_lgrpid once now that p->p_tr_lgrpid
9920 9919 * is not LGRP_NONE.
9921 9920 */
9922 9921 if (first && p->p_t1_lgrpid != LGRP_NONE &&
9923 9922 p->p_t1_lgrpid != lgrp_id) {
9924 9923 first = 0;
9925 9924 goto again;
9926 9925 }
9927 9926 }
9928 9927 /*
9929 9928 * If no amp was created yet for lgrp_id create a new one as long as
9930 9929 * we have enough memory to afford it.
9931 9930 */
9932 9931 if ((amp = svntrp->tr_amp[lgrp_id]) == NULL) {
9933 9932 size_t trmem = atomic_add_long_nv(&segvn_textrepl_bytes, size);
9934 9933 if (trmem > segvn_textrepl_max_bytes) {
9935 9934 SEGVN_TR_ADDSTAT(normem);
9936 9935 goto fail;
9937 9936 }
9938 9937 if (anon_try_resv_zone(size, NULL) == 0) {
9939 9938 SEGVN_TR_ADDSTAT(noanon);
9940 9939 goto fail;
9941 9940 }
9942 9941 amp = anonmap_alloc(size, size, ANON_NOSLEEP);
9943 9942 if (amp == NULL) {
9944 9943 anon_unresv_zone(size, NULL);
9945 9944 SEGVN_TR_ADDSTAT(nokmem);
9946 9945 goto fail;
9947 9946 }
9948 9947 ASSERT(amp->refcnt == 1);
9949 9948 amp->a_szc = szc;
9950 9949 svntrp->tr_amp[lgrp_id] = amp;
9951 9950 SEGVN_TR_ADDSTAT(newamp);
9952 9951 }
9953 9952 svntrp->tr_refcnt++;
9954 9953 ASSERT(svd->svn_trnext == NULL);
9955 9954 ASSERT(svd->svn_trprev == NULL);
9956 9955 svd->svn_trnext = svntrp->tr_svnhead;
9957 9956 svd->svn_trprev = NULL;
9958 9957 if (svntrp->tr_svnhead != NULL) {
9959 9958 svntrp->tr_svnhead->svn_trprev = svd;
9960 9959 }
9961 9960 svntrp->tr_svnhead = svd;
9962 9961 ASSERT(amp->a_szc == szc && amp->size == size && amp->swresv == size);
9963 9962 ASSERT(amp->refcnt >= 1);
9964 9963 svd->amp = amp;
9965 9964 svd->anon_index = 0;
9966 9965 svd->tr_policy_info.mem_policy = LGRP_MEM_POLICY_NEXT_SEG;
9967 9966 svd->tr_policy_info.mem_lgrpid = lgrp_id;
9968 9967 svd->tr_state = SEGVN_TR_ON;
9969 9968 mutex_exit(&svntr_hashtab[hash].tr_lock);
9970 9969 SEGVN_TR_ADDSTAT(repl);
9971 9970 return;
9972 9971 fail:
9973 9972 ASSERT(segvn_textrepl_bytes >= size);
9974 9973 atomic_add_long(&segvn_textrepl_bytes, -size);
9975 9974 ASSERT(svntrp != NULL);
9976 9975 ASSERT(svntrp->tr_amp[lgrp_id] == NULL);
9977 9976 if (svntrp->tr_refcnt == 0) {
9978 9977 ASSERT(svntrp == svntr_hashtab[hash].tr_head);
9979 9978 svntr_hashtab[hash].tr_head = svntrp->tr_next;
9980 9979 mutex_exit(&svntr_hashtab[hash].tr_lock);
9981 9980 kmem_cache_free(svntr_cache, svntrp);
9982 9981 } else {
9983 9982 mutex_exit(&svntr_hashtab[hash].tr_lock);
9984 9983 }
9985 9984 svd->tr_state = SEGVN_TR_OFF;
9986 9985 }
9987 9986
9988 9987 /*
9989 9988 * Convert seg back to regular vnode mapping seg by unbinding it from its text
9990 9989 * replication amp. This routine is most typically called when segment is
9991 9990 * unmapped but can also be called when segment no longer qualifies for text
9992 9991 * replication (e.g. due to protection changes). If unload_unmap is set use
9993 9992 * HAT_UNLOAD_UNMAP flag in hat_unload_callback(). If we are the last user of
9994 9993 * svntr free all its anon maps and remove it from the hash table.
9995 9994 */
9996 9995 static void
9997 9996 segvn_textunrepl(struct seg *seg, int unload_unmap)
9998 9997 {
9999 9998 struct segvn_data *svd = (struct segvn_data *)seg->s_data;
10000 9999 vnode_t *vp = svd->vp;
|
↓ open down ↓ |
260 lines elided |
↑ open up ↑ |
10001 10000 u_offset_t off = svd->offset;
10002 10001 size_t size = seg->s_size;
10003 10002 u_offset_t eoff = off + size;
10004 10003 uint_t szc = seg->s_szc;
10005 10004 ulong_t hash = SVNTR_HASH_FUNC(vp);
10006 10005 svntr_t *svntrp;
10007 10006 svntr_t **prv_svntrp;
10008 10007 lgrp_id_t lgrp_id = svd->tr_policy_info.mem_lgrpid;
10009 10008 lgrp_id_t i;
10010 10009
10011 - ASSERT(AS_LOCK_HELD(seg->s_as, &seg->s_as->a_lock));
10012 - ASSERT(AS_WRITE_HELD(seg->s_as, &seg->s_as->a_lock) ||
10010 + ASSERT(AS_LOCK_HELD(seg->s_as));
10011 + ASSERT(AS_WRITE_HELD(seg->s_as) ||
10013 10012 SEGVN_WRITE_HELD(seg->s_as, &svd->lock));
10014 10013 ASSERT(svd->tr_state == SEGVN_TR_ON);
10015 10014 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
10016 10015 ASSERT(svd->amp != NULL);
10017 10016 ASSERT(svd->amp->refcnt >= 1);
10018 10017 ASSERT(svd->anon_index == 0);
10019 10018 ASSERT(lgrp_id != LGRP_NONE && lgrp_id < NLGRPS_MAX);
10020 10019 ASSERT(svntr_hashtab != NULL);
10021 10020
10022 10021 mutex_enter(&svntr_hashtab[hash].tr_lock);
10023 10022 prv_svntrp = &svntr_hashtab[hash].tr_head;
10024 10023 for (; (svntrp = *prv_svntrp) != NULL; prv_svntrp = &svntrp->tr_next) {
10025 10024 ASSERT(svntrp->tr_refcnt != 0);
10026 10025 if (svntrp->tr_vp == vp && svntrp->tr_off == off &&
10027 10026 svntrp->tr_eoff == eoff && svntrp->tr_szc == szc) {
10028 10027 break;
10029 10028 }
10030 10029 }
10031 10030 if (svntrp == NULL) {
10032 10031 panic("segvn_textunrepl: svntr record not found");
10033 10032 }
10034 10033 if (svntrp->tr_amp[lgrp_id] != svd->amp) {
10035 10034 panic("segvn_textunrepl: amp mismatch");
10036 10035 }
10037 10036 svd->tr_state = SEGVN_TR_OFF;
10038 10037 svd->amp = NULL;
10039 10038 if (svd->svn_trprev == NULL) {
10040 10039 ASSERT(svntrp->tr_svnhead == svd);
10041 10040 svntrp->tr_svnhead = svd->svn_trnext;
10042 10041 if (svntrp->tr_svnhead != NULL) {
10043 10042 svntrp->tr_svnhead->svn_trprev = NULL;
10044 10043 }
10045 10044 svd->svn_trnext = NULL;
10046 10045 } else {
10047 10046 svd->svn_trprev->svn_trnext = svd->svn_trnext;
10048 10047 if (svd->svn_trnext != NULL) {
10049 10048 svd->svn_trnext->svn_trprev = svd->svn_trprev;
10050 10049 svd->svn_trnext = NULL;
10051 10050 }
10052 10051 svd->svn_trprev = NULL;
10053 10052 }
10054 10053 if (--svntrp->tr_refcnt) {
10055 10054 mutex_exit(&svntr_hashtab[hash].tr_lock);
10056 10055 goto done;
10057 10056 }
10058 10057 *prv_svntrp = svntrp->tr_next;
10059 10058 mutex_exit(&svntr_hashtab[hash].tr_lock);
10060 10059 for (i = 0; i < NLGRPS_MAX; i++) {
10061 10060 struct anon_map *amp = svntrp->tr_amp[i];
10062 10061 if (amp == NULL) {
10063 10062 continue;
10064 10063 }
10065 10064 ASSERT(amp->refcnt == 1);
10066 10065 ASSERT(amp->swresv == size);
10067 10066 ASSERT(amp->size == size);
10068 10067 ASSERT(amp->a_szc == szc);
10069 10068 if (amp->a_szc != 0) {
10070 10069 anon_free_pages(amp->ahp, 0, size, szc);
10071 10070 } else {
10072 10071 anon_free(amp->ahp, 0, size);
10073 10072 }
10074 10073 svntrp->tr_amp[i] = NULL;
10075 10074 ASSERT(segvn_textrepl_bytes >= size);
10076 10075 atomic_add_long(&segvn_textrepl_bytes, -size);
10077 10076 anon_unresv_zone(amp->swresv, NULL);
10078 10077 amp->refcnt = 0;
10079 10078 anonmap_free(amp);
10080 10079 }
10081 10080 kmem_cache_free(svntr_cache, svntrp);
10082 10081 done:
10083 10082 hat_unload_callback(seg->s_as->a_hat, seg->s_base, size,
10084 10083 unload_unmap ? HAT_UNLOAD_UNMAP : 0, NULL);
10085 10084 }
10086 10085
10087 10086 /*
10088 10087 * This is called when a MAP_SHARED writable mapping is created to a vnode
10089 10088 * that is currently used for execution (VVMEXEC flag is set). In this case we
10090 10089 * need to prevent further use of existing replicas.
10091 10090 */
10092 10091 static void
10093 10092 segvn_inval_trcache(vnode_t *vp)
10094 10093 {
10095 10094 ulong_t hash = SVNTR_HASH_FUNC(vp);
10096 10095 svntr_t *svntrp;
10097 10096
10098 10097 ASSERT(vp->v_flag & VVMEXEC);
10099 10098
10100 10099 if (svntr_hashtab == NULL) {
10101 10100 return;
10102 10101 }
10103 10102
10104 10103 mutex_enter(&svntr_hashtab[hash].tr_lock);
10105 10104 svntrp = svntr_hashtab[hash].tr_head;
10106 10105 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
10107 10106 ASSERT(svntrp->tr_refcnt != 0);
10108 10107 if (svntrp->tr_vp == vp && svntrp->tr_valid) {
10109 10108 svntrp->tr_valid = 0;
10110 10109 }
10111 10110 }
10112 10111 mutex_exit(&svntr_hashtab[hash].tr_lock);
10113 10112 }
10114 10113
10115 10114 static void
10116 10115 segvn_trasync_thread(void)
10117 10116 {
10118 10117 callb_cpr_t cpr_info;
10119 10118 kmutex_t cpr_lock; /* just for CPR stuff */
10120 10119
10121 10120 mutex_init(&cpr_lock, NULL, MUTEX_DEFAULT, NULL);
10122 10121
10123 10122 CALLB_CPR_INIT(&cpr_info, &cpr_lock,
10124 10123 callb_generic_cpr, "segvn_async");
10125 10124
10126 10125 if (segvn_update_textrepl_interval == 0) {
10127 10126 segvn_update_textrepl_interval = segvn_update_tr_time * hz;
10128 10127 } else {
10129 10128 segvn_update_textrepl_interval *= hz;
10130 10129 }
10131 10130 (void) timeout(segvn_trupdate_wakeup, NULL,
10132 10131 segvn_update_textrepl_interval);
10133 10132
10134 10133 for (;;) {
10135 10134 mutex_enter(&cpr_lock);
10136 10135 CALLB_CPR_SAFE_BEGIN(&cpr_info);
10137 10136 mutex_exit(&cpr_lock);
10138 10137 sema_p(&segvn_trasync_sem);
10139 10138 mutex_enter(&cpr_lock);
10140 10139 CALLB_CPR_SAFE_END(&cpr_info, &cpr_lock);
10141 10140 mutex_exit(&cpr_lock);
10142 10141 segvn_trupdate();
10143 10142 }
10144 10143 }
10145 10144
10146 10145 static uint64_t segvn_lgrp_trthr_migrs_snpsht = 0;
10147 10146
10148 10147 static void
10149 10148 segvn_trupdate_wakeup(void *dummy)
10150 10149 {
10151 10150 uint64_t cur_lgrp_trthr_migrs = lgrp_get_trthr_migrations();
10152 10151
10153 10152 if (cur_lgrp_trthr_migrs != segvn_lgrp_trthr_migrs_snpsht) {
10154 10153 segvn_lgrp_trthr_migrs_snpsht = cur_lgrp_trthr_migrs;
10155 10154 sema_v(&segvn_trasync_sem);
10156 10155 }
10157 10156
10158 10157 if (!segvn_disable_textrepl_update &&
10159 10158 segvn_update_textrepl_interval != 0) {
10160 10159 (void) timeout(segvn_trupdate_wakeup, dummy,
10161 10160 segvn_update_textrepl_interval);
10162 10161 }
10163 10162 }
10164 10163
10165 10164 static void
10166 10165 segvn_trupdate(void)
10167 10166 {
10168 10167 ulong_t hash;
10169 10168 svntr_t *svntrp;
10170 10169 segvn_data_t *svd;
10171 10170
10172 10171 ASSERT(svntr_hashtab != NULL);
10173 10172
10174 10173 for (hash = 0; hash < svntr_hashtab_sz; hash++) {
10175 10174 mutex_enter(&svntr_hashtab[hash].tr_lock);
10176 10175 svntrp = svntr_hashtab[hash].tr_head;
10177 10176 for (; svntrp != NULL; svntrp = svntrp->tr_next) {
10178 10177 ASSERT(svntrp->tr_refcnt != 0);
10179 10178 svd = svntrp->tr_svnhead;
10180 10179 for (; svd != NULL; svd = svd->svn_trnext) {
10181 10180 segvn_trupdate_seg(svd->seg, svd, svntrp,
10182 10181 hash);
10183 10182 }
10184 10183 }
10185 10184 mutex_exit(&svntr_hashtab[hash].tr_lock);
10186 10185 }
10187 10186 }
10188 10187
10189 10188 static void
10190 10189 segvn_trupdate_seg(struct seg *seg,
10191 10190 segvn_data_t *svd,
10192 10191 svntr_t *svntrp,
10193 10192 ulong_t hash)
10194 10193 {
10195 10194 proc_t *p;
10196 10195 lgrp_id_t lgrp_id;
10197 10196 struct as *as;
10198 10197 size_t size;
10199 10198 struct anon_map *amp;
10200 10199
10201 10200 ASSERT(svd->vp != NULL);
10202 10201 ASSERT(svd->vp == svntrp->tr_vp);
10203 10202 ASSERT(svd->offset == svntrp->tr_off);
10204 10203 ASSERT(svd->offset + seg->s_size == svntrp->tr_eoff);
10205 10204 ASSERT(seg != NULL);
10206 10205 ASSERT(svd->seg == seg);
10207 10206 ASSERT(seg->s_data == (void *)svd);
10208 10207 ASSERT(seg->s_szc == svntrp->tr_szc);
10209 10208 ASSERT(svd->tr_state == SEGVN_TR_ON);
10210 10209 ASSERT(!HAT_IS_REGION_COOKIE_VALID(svd->rcookie));
10211 10210 ASSERT(svd->amp != NULL);
10212 10211 ASSERT(svd->tr_policy_info.mem_policy == LGRP_MEM_POLICY_NEXT_SEG);
10213 10212 ASSERT(svd->tr_policy_info.mem_lgrpid != LGRP_NONE);
10214 10213 ASSERT(svd->tr_policy_info.mem_lgrpid < NLGRPS_MAX);
10215 10214 ASSERT(svntrp->tr_amp[svd->tr_policy_info.mem_lgrpid] == svd->amp);
10216 10215 ASSERT(svntrp->tr_refcnt != 0);
10217 10216 ASSERT(mutex_owned(&svntr_hashtab[hash].tr_lock));
10218 10217
10219 10218 as = seg->s_as;
10220 10219 ASSERT(as != NULL && as != &kas);
10221 10220 p = as->a_proc;
10222 10221 ASSERT(p != NULL);
10223 10222 ASSERT(p->p_tr_lgrpid != LGRP_NONE);
10224 10223 lgrp_id = p->p_t1_lgrpid;
10225 10224 if (lgrp_id == LGRP_NONE) {
10226 10225 return;
|
↓ open down ↓ |
204 lines elided |
↑ open up ↑ |
10227 10226 }
10228 10227 ASSERT(lgrp_id < NLGRPS_MAX);
10229 10228 if (svd->tr_policy_info.mem_lgrpid == lgrp_id) {
10230 10229 return;
10231 10230 }
10232 10231
10233 10232 /*
10234 10233 * Use tryenter locking since we are locking as/seg and svntr hash
10235 10234 * lock in reverse from syncrounous thread order.
10236 10235 */
10237 - if (!AS_LOCK_TRYENTER(as, &as->a_lock, RW_READER)) {
10236 + if (!AS_LOCK_TRYENTER(as, RW_READER)) {
10238 10237 SEGVN_TR_ADDSTAT(nolock);
10239 10238 if (segvn_lgrp_trthr_migrs_snpsht) {
10240 10239 segvn_lgrp_trthr_migrs_snpsht = 0;
10241 10240 }
10242 10241 return;
10243 10242 }
10244 10243 if (!SEGVN_LOCK_TRYENTER(seg->s_as, &svd->lock, RW_WRITER)) {
10245 - AS_LOCK_EXIT(as, &as->a_lock);
10244 + AS_LOCK_EXIT(as);
10246 10245 SEGVN_TR_ADDSTAT(nolock);
10247 10246 if (segvn_lgrp_trthr_migrs_snpsht) {
10248 10247 segvn_lgrp_trthr_migrs_snpsht = 0;
10249 10248 }
10250 10249 return;
10251 10250 }
10252 10251 size = seg->s_size;
10253 10252 if (svntrp->tr_amp[lgrp_id] == NULL) {
10254 10253 size_t trmem = atomic_add_long_nv(&segvn_textrepl_bytes, size);
10255 10254 if (trmem > segvn_textrepl_max_bytes) {
10256 10255 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10257 - AS_LOCK_EXIT(as, &as->a_lock);
10256 + AS_LOCK_EXIT(as);
10258 10257 atomic_add_long(&segvn_textrepl_bytes, -size);
10259 10258 SEGVN_TR_ADDSTAT(normem);
10260 10259 return;
10261 10260 }
10262 10261 if (anon_try_resv_zone(size, NULL) == 0) {
10263 10262 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10264 - AS_LOCK_EXIT(as, &as->a_lock);
10263 + AS_LOCK_EXIT(as);
10265 10264 atomic_add_long(&segvn_textrepl_bytes, -size);
10266 10265 SEGVN_TR_ADDSTAT(noanon);
10267 10266 return;
10268 10267 }
10269 10268 amp = anonmap_alloc(size, size, KM_NOSLEEP);
10270 10269 if (amp == NULL) {
10271 10270 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10272 - AS_LOCK_EXIT(as, &as->a_lock);
10271 + AS_LOCK_EXIT(as);
10273 10272 atomic_add_long(&segvn_textrepl_bytes, -size);
10274 10273 anon_unresv_zone(size, NULL);
10275 10274 SEGVN_TR_ADDSTAT(nokmem);
10276 10275 return;
10277 10276 }
10278 10277 ASSERT(amp->refcnt == 1);
10279 10278 amp->a_szc = seg->s_szc;
10280 10279 svntrp->tr_amp[lgrp_id] = amp;
10281 10280 }
10282 10281 /*
10283 10282 * We don't need to drop the bucket lock but here we give other
10284 10283 * threads a chance. svntr and svd can't be unlinked as long as
10285 10284 * segment lock is held as a writer and AS held as well. After we
10286 10285 * retake bucket lock we'll continue from where we left. We'll be able
10287 10286 * to reach the end of either list since new entries are always added
10288 10287 * to the beginning of the lists.
10289 10288 */
10290 10289 mutex_exit(&svntr_hashtab[hash].tr_lock);
10291 10290 hat_unload_callback(as->a_hat, seg->s_base, size, 0, NULL);
10292 10291 mutex_enter(&svntr_hashtab[hash].tr_lock);
10293 10292
|
↓ open down ↓ |
11 lines elided |
↑ open up ↑ |
10294 10293 ASSERT(svd->tr_state == SEGVN_TR_ON);
10295 10294 ASSERT(svd->amp != NULL);
10296 10295 ASSERT(svd->tr_policy_info.mem_policy == LGRP_MEM_POLICY_NEXT_SEG);
10297 10296 ASSERT(svd->tr_policy_info.mem_lgrpid != lgrp_id);
10298 10297 ASSERT(svd->amp != svntrp->tr_amp[lgrp_id]);
10299 10298
10300 10299 svd->tr_policy_info.mem_lgrpid = lgrp_id;
10301 10300 svd->amp = svntrp->tr_amp[lgrp_id];
10302 10301 p->p_tr_lgrpid = NLGRPS_MAX;
10303 10302 SEGVN_LOCK_EXIT(seg->s_as, &svd->lock);
10304 - AS_LOCK_EXIT(as, &as->a_lock);
10303 + AS_LOCK_EXIT(as);
10305 10304
10306 10305 ASSERT(svntrp->tr_refcnt != 0);
10307 10306 ASSERT(svd->vp == svntrp->tr_vp);
10308 10307 ASSERT(svd->tr_policy_info.mem_lgrpid == lgrp_id);
10309 10308 ASSERT(svd->amp != NULL && svd->amp == svntrp->tr_amp[lgrp_id]);
10310 10309 ASSERT(svd->seg == seg);
10311 10310 ASSERT(svd->tr_state == SEGVN_TR_ON);
10312 10311
10313 10312 SEGVN_TR_ADDSTAT(asyncrepl);
10314 10313 }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX