-
Notifications
You must be signed in to change notification settings - Fork 24
/
uvm_pdaemon.c
1033 lines (854 loc) · 23.3 KB
/
uvm_pdaemon.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* $NetBSD: uvm_pdaemon.c,v 1.92 2008/02/29 20:35:23 yamt Exp $ */
/*
* Copyright (c) 1997 Charles D. Cranor and Washington University.
* Copyright (c) 1991, 1993, The Regents of the University of California.
*
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* The Mach Operating System project at Carnegie-Mellon University.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Charles D. Cranor,
* Washington University, the University of California, Berkeley and
* its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)vm_pageout.c 8.5 (Berkeley) 2/14/94
* from: Id: uvm_pdaemon.c,v 1.1.2.32 1998/02/06 05:26:30 chs Exp
*
*
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
* All rights reserved.
*
* Permission to use, copy, modify and distribute this software and
* its documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*/
/*
* uvm_pdaemon.c: the page daemon
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: uvm_pdaemon.c,v 1.92 2008/02/29 20:35:23 yamt Exp $");
#include "opt_uvmhist.h"
#include "opt_readahead.h"
#include <sys/param.h>
#include <sys/proc.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/pool.h>
#include <sys/buf.h>
#include <uvm/uvm.h>
#include <uvm/uvm_pdpolicy.h>
/*
* UVMPD_NUMDIRTYREACTS is how many dirty pages the pagedaemon will reactivate
* in a pass thru the inactive list when swap is full. the value should be
* "small"... if it's too large we'll cycle the active pages thru the inactive
* queue too quickly to for them to be referenced and avoid being freed.
*/
#define UVMPD_NUMDIRTYREACTS 16
#define UVMPD_NUMTRYLOCKOWNER 16
/*
* local prototypes
*/
static void uvmpd_scan(void);
static void uvmpd_scan_queue(void);
static void uvmpd_tune(void);
unsigned int uvm_pagedaemon_waiters;
/*
* XXX hack to avoid hangs when large processes fork.
*/
int uvm_extrapages;
/*
* uvm_wait: wait (sleep) for the page daemon to free some pages
*
* => should be called with all locks released
* => should _not_ be called by the page daemon (to avoid deadlock)
*/
void
uvm_wait(const char *wmsg)
{
int timo = 0;
mutex_spin_enter(&uvm_fpageqlock);
/*
* check for page daemon going to sleep (waiting for itself)
*/
if (curlwp == uvm.pagedaemon_lwp && uvmexp.paging == 0) {
/*
* now we have a problem: the pagedaemon wants to go to
* sleep until it frees more memory. but how can it
* free more memory if it is asleep? that is a deadlock.
* we have two options:
* [1] panic now
* [2] put a timeout on the sleep, thus causing the
* pagedaemon to only pause (rather than sleep forever)
*
* note that option [2] will only help us if we get lucky
* and some other process on the system breaks the deadlock
* by exiting or freeing memory (thus allowing the pagedaemon
* to continue). for now we panic if DEBUG is defined,
* otherwise we hope for the best with option [2] (better
* yet, this should never happen in the first place!).
*/
printf("pagedaemon: deadlock detected!\n");
timo = hz >> 3; /* set timeout */
#if defined(DEBUG)
/* DEBUG: panic so we can debug it */
panic("pagedaemon deadlock");
#endif
}
uvm_pagedaemon_waiters++;
wakeup(&uvm.pagedaemon); /* wake the daemon! */
UVM_UNLOCK_AND_WAIT(&uvmexp.free, &uvm_fpageqlock, false, wmsg, timo);
}
/*
* uvm_kick_pdaemon: perform checks to determine if we need to
* give the pagedaemon a nudge, and do so if necessary.
*
* => called with uvm_fpageqlock held.
*/
void
uvm_kick_pdaemon(void)
{
KASSERT(mutex_owned(&uvm_fpageqlock));
if (uvmexp.free + uvmexp.paging < uvmexp.freemin ||
(uvmexp.free + uvmexp.paging < uvmexp.freetarg &&
uvmpdpol_needsscan_p())) {
wakeup(&uvm.pagedaemon);
}
}
/*
* uvmpd_tune: tune paging parameters
*
* => called when ever memory is added (or removed?) to the system
* => caller must call with page queues locked
*/
static void
uvmpd_tune(void)
{
UVMHIST_FUNC("uvmpd_tune"); UVMHIST_CALLED(pdhist);
uvmexp.freemin = uvmexp.npages / 20;
/* between 16k and 256k */
/* XXX: what are these values good for? */
uvmexp.freemin = MAX(uvmexp.freemin, (16*1024) >> PAGE_SHIFT);
uvmexp.freemin = MIN(uvmexp.freemin, (256*1024) >> PAGE_SHIFT);
/* Make sure there's always a user page free. */
if (uvmexp.freemin < uvmexp.reserve_kernel + 1)
uvmexp.freemin = uvmexp.reserve_kernel + 1;
uvmexp.freetarg = (uvmexp.freemin * 4) / 3;
if (uvmexp.freetarg <= uvmexp.freemin)
uvmexp.freetarg = uvmexp.freemin + 1;
uvmexp.freetarg += uvm_extrapages;
uvm_extrapages = 0;
uvmexp.wiredmax = uvmexp.npages / 3;
UVMHIST_LOG(pdhist, "<- done, freemin=%d, freetarg=%d, wiredmax=%d",
uvmexp.freemin, uvmexp.freetarg, uvmexp.wiredmax, 0);
}
/*
* uvm_pageout: the main loop for the pagedaemon
*/
void
uvm_pageout(void *arg)
{
int bufcnt, npages = 0;
int extrapages = 0;
struct pool *pp;
uint64_t where;
UVMHIST_FUNC("uvm_pageout"); UVMHIST_CALLED(pdhist);
UVMHIST_LOG(pdhist,"<starting uvm pagedaemon>", 0, 0, 0, 0);
/*
* ensure correct priority and set paging parameters...
*/
uvm.pagedaemon_lwp = curlwp;
mutex_enter(&uvm_pageqlock);
npages = uvmexp.npages;
uvmpd_tune();
mutex_exit(&uvm_pageqlock);
/*
* main loop
*/
for (;;) {
bool needsscan;
mutex_spin_enter(&uvm_fpageqlock);
if (uvm_pagedaemon_waiters == 0 || uvmexp.paging > 0) {
UVMHIST_LOG(pdhist," <<SLEEPING>>",0,0,0,0);
UVM_UNLOCK_AND_WAIT(&uvm.pagedaemon,
&uvm_fpageqlock, false, "pgdaemon", 0);
uvmexp.pdwoke++;
UVMHIST_LOG(pdhist," <<WOKE UP>>",0,0,0,0);
} else {
mutex_spin_exit(&uvm_fpageqlock);
}
/*
* now lock page queues and recompute inactive count
*/
mutex_enter(&uvm_pageqlock);
if (npages != uvmexp.npages || extrapages != uvm_extrapages) {
npages = uvmexp.npages;
extrapages = uvm_extrapages;
mutex_spin_enter(&uvm_fpageqlock);
uvmpd_tune();
mutex_spin_exit(&uvm_fpageqlock);
}
uvmpdpol_tune();
/*
* Estimate a hint. Note that bufmem are returned to
* system only when entire pool page is empty.
*/
mutex_spin_enter(&uvm_fpageqlock);
bufcnt = uvmexp.freetarg - uvmexp.free;
if (bufcnt < 0)
bufcnt = 0;
UVMHIST_LOG(pdhist," free/ftarg=%d/%d",
uvmexp.free, uvmexp.freetarg, 0,0);
needsscan = uvmexp.free + uvmexp.paging < uvmexp.freetarg ||
uvmpdpol_needsscan_p();
mutex_spin_exit(&uvm_fpageqlock);
/*
* scan if needed
*/
if (needsscan)
uvmpd_scan();
/*
* if there's any free memory to be had,
* wake up any waiters.
*/
mutex_spin_enter(&uvm_fpageqlock);
if (uvmexp.free > uvmexp.reserve_kernel ||
uvmexp.paging == 0) {
wakeup(&uvmexp.free);
uvm_pagedaemon_waiters = 0;
}
mutex_spin_exit(&uvm_fpageqlock);
/*
* scan done. unlock page queues (the only lock we are holding)
*/
mutex_exit(&uvm_pageqlock);
/*
* start draining pool resources now that we're not
* holding any locks.
*/
pool_drain_start(&pp, &where);
/*
* kill unused metadata buffers.
*/
mutex_enter(&bufcache_lock);
buf_drain(bufcnt << PAGE_SHIFT);
mutex_exit(&bufcache_lock);
/*
* complete draining the pools.
*/
pool_drain_end(pp, where);
}
/*NOTREACHED*/
}
/*
* uvm_aiodone_worker: a workqueue callback for the aiodone daemon.
*/
void
uvm_aiodone_worker(struct work *wk, void *dummy)
{
struct buf *bp = (void *)wk;
KASSERT(&bp->b_work == wk);
/*
* process an i/o that's done.
*/
(*bp->b_iodone)(bp);
}
void
uvm_pageout_start(int npages)
{
mutex_spin_enter(&uvm_fpageqlock);
uvmexp.paging += npages;
mutex_spin_exit(&uvm_fpageqlock);
}
void
uvm_pageout_done(int npages)
{
mutex_spin_enter(&uvm_fpageqlock);
KASSERT(uvmexp.paging >= npages);
uvmexp.paging -= npages;
/*
* wake up either of pagedaemon or LWPs waiting for it.
*/
if (uvmexp.free <= uvmexp.reserve_kernel) {
wakeup(&uvm.pagedaemon);
} else {
wakeup(&uvmexp.free);
uvm_pagedaemon_waiters = 0;
}
mutex_spin_exit(&uvm_fpageqlock);
}
/*
* uvmpd_trylockowner: trylock the page's owner.
*
* => called with pageq locked.
* => resolve orphaned O->A loaned page.
* => return the locked mutex on success. otherwise, return NULL.
*/
kmutex_t *
uvmpd_trylockowner(struct vm_page *pg)
{
struct uvm_object *uobj = pg->uobject;
kmutex_t *slock;
KASSERT(mutex_owned(&uvm_pageqlock));
if (uobj != NULL) {
slock = &uobj->vmobjlock;
} else {
struct vm_anon *anon = pg->uanon;
KASSERT(anon != NULL);
slock = &anon->an_lock;
}
if (!mutex_tryenter(slock)) {
return NULL;
}
if (uobj == NULL) {
/*
* set PQ_ANON if it isn't set already.
*/
if ((pg->pqflags & PQ_ANON) == 0) {
KASSERT(pg->loan_count > 0);
pg->loan_count--;
pg->pqflags |= PQ_ANON;
/* anon now owns it */
}
}
return slock;
}
#if defined(VMSWAP)
struct swapcluster {
int swc_slot;
int swc_nallocated;
int swc_nused;
struct vm_page *swc_pages[howmany(MAXPHYS, MIN_PAGE_SIZE)];
};
static void
swapcluster_init(struct swapcluster *swc)
{
swc->swc_slot = 0;
swc->swc_nused = 0;
}
static int
swapcluster_allocslots(struct swapcluster *swc)
{
int slot;
int npages;
if (swc->swc_slot != 0) {
return 0;
}
/* Even with strange MAXPHYS, the shift
implicitly rounds down to a page. */
npages = MAXPHYS >> PAGE_SHIFT;
slot = uvm_swap_alloc(&npages, true);
if (slot == 0) {
return ENOMEM;
}
swc->swc_slot = slot;
swc->swc_nallocated = npages;
swc->swc_nused = 0;
return 0;
}
static int
swapcluster_add(struct swapcluster *swc, struct vm_page *pg)
{
int slot;
struct uvm_object *uobj;
KASSERT(swc->swc_slot != 0);
KASSERT(swc->swc_nused < swc->swc_nallocated);
KASSERT((pg->pqflags & PQ_SWAPBACKED) != 0);
slot = swc->swc_slot + swc->swc_nused;
uobj = pg->uobject;
if (uobj == NULL) {
KASSERT(mutex_owned(&pg->uanon->an_lock));
pg->uanon->an_swslot = slot;
} else {
int result;
KASSERT(mutex_owned(&uobj->vmobjlock));
result = uao_set_swslot(uobj, pg->offset >> PAGE_SHIFT, slot);
if (result == -1) {
return ENOMEM;
}
}
swc->swc_pages[swc->swc_nused] = pg;
swc->swc_nused++;
return 0;
}
static void
swapcluster_flush(struct swapcluster *swc, bool now)
{
int slot;
int nused;
int nallocated;
int error;
if (swc->swc_slot == 0) {
return;
}
KASSERT(swc->swc_nused <= swc->swc_nallocated);
slot = swc->swc_slot;
nused = swc->swc_nused;
nallocated = swc->swc_nallocated;
/*
* if this is the final pageout we could have a few
* unused swap blocks. if so, free them now.
*/
if (nused < nallocated) {
if (!now) {
return;
}
uvm_swap_free(slot + nused, nallocated - nused);
}
/*
* now start the pageout.
*/
if (nused > 0) {
uvmexp.pdpageouts++;
uvm_pageout_start(nused);
error = uvm_swap_put(slot, swc->swc_pages, nused, 0);
KASSERT(error == 0 || error == ENOMEM);
}
/*
* zero swslot to indicate that we are
* no longer building a swap-backed cluster.
*/
swc->swc_slot = 0;
swc->swc_nused = 0;
}
static int
swapcluster_nused(struct swapcluster *swc)
{
return swc->swc_nused;
}
/*
* uvmpd_dropswap: free any swap allocated to this page.
*
* => called with owner locked.
* => return true if a page had an associated slot.
*/
static bool
uvmpd_dropswap(struct vm_page *pg)
{
bool result = false;
struct vm_anon *anon = pg->uanon;
if ((pg->pqflags & PQ_ANON) && anon->an_swslot) {
uvm_swap_free(anon->an_swslot, 1);
anon->an_swslot = 0;
pg->flags &= ~PG_CLEAN;
result = true;
} else if (pg->pqflags & PQ_AOBJ) {
int slot = uao_set_swslot(pg->uobject,
pg->offset >> PAGE_SHIFT, 0);
if (slot) {
uvm_swap_free(slot, 1);
pg->flags &= ~PG_CLEAN;
result = true;
}
}
return result;
}
/*
* uvmpd_trydropswap: try to free any swap allocated to this page.
*
* => return true if a slot is successfully freed.
*/
bool
uvmpd_trydropswap(struct vm_page *pg)
{
kmutex_t *slock;
bool result;
if ((pg->flags & PG_BUSY) != 0) {
return false;
}
/*
* lock the page's owner.
*/
slock = uvmpd_trylockowner(pg);
if (slock == NULL) {
return false;
}
/*
* skip this page if it's busy.
*/
if ((pg->flags & PG_BUSY) != 0) {
mutex_exit(slock);
return false;
}
result = uvmpd_dropswap(pg);
mutex_exit(slock);
return result;
}
#endif /* defined(VMSWAP) */
/*
* uvmpd_scan_queue: scan an replace candidate list for pages
* to clean or free.
*
* => called with page queues locked
* => we work on meeting our free target by converting inactive pages
* into free pages.
* => we handle the building of swap-backed clusters
*/
static void
uvmpd_scan_queue(void)
{
struct vm_page *p;
struct uvm_object *uobj;
struct vm_anon *anon;
#if defined(VMSWAP)
struct swapcluster swc;
#endif /* defined(VMSWAP) */
int dirtyreacts;
int lockownerfail;
kmutex_t *slock;
UVMHIST_FUNC("uvmpd_scan_queue"); UVMHIST_CALLED(pdhist);
/*
* swslot is non-zero if we are building a swap cluster. we want
* to stay in the loop while we have a page to scan or we have
* a swap-cluster to build.
*/
#if defined(VMSWAP)
swapcluster_init(&swc);
#endif /* defined(VMSWAP) */
dirtyreacts = 0;
lockownerfail = 0;
uvmpdpol_scaninit();
while (/* CONSTCOND */ 1) {
/*
* see if we've met the free target.
*/
if (uvmexp.free + uvmexp.paging
#if defined(VMSWAP)
+ swapcluster_nused(&swc)
#endif /* defined(VMSWAP) */
>= uvmexp.freetarg << 2 ||
dirtyreacts == UVMPD_NUMDIRTYREACTS) {
UVMHIST_LOG(pdhist," met free target: "
"exit loop", 0, 0, 0, 0);
break;
}
p = uvmpdpol_selectvictim();
if (p == NULL) {
break;
}
KASSERT(uvmpdpol_pageisqueued_p(p));
KASSERT(p->wire_count == 0);
/*
* we are below target and have a new page to consider.
*/
anon = p->uanon;
uobj = p->uobject;
/*
* first we attempt to lock the object that this page
* belongs to. if our attempt fails we skip on to
* the next page (no harm done). it is important to
* "try" locking the object as we are locking in the
* wrong order (pageq -> object) and we don't want to
* deadlock.
*
* the only time we expect to see an ownerless page
* (i.e. a page with no uobject and !PQ_ANON) is if an
* anon has loaned a page from a uvm_object and the
* uvm_object has dropped the ownership. in that
* case, the anon can "take over" the loaned page
* and make it its own.
*/
slock = uvmpd_trylockowner(p);
if (slock == NULL) {
/*
* yield cpu to make a chance for an LWP holding
* the lock run. otherwise we can busy-loop too long
* if the page queue is filled with a lot of pages
* from few objects.
*/
lockownerfail++;
if (lockownerfail > UVMPD_NUMTRYLOCKOWNER) {
mutex_exit(&uvm_pageqlock);
/* XXX Better than yielding but inadequate. */
kpause("livelock", false, 1, NULL);
mutex_enter(&uvm_pageqlock);
lockownerfail = 0;
}
continue;
}
if (p->flags & PG_BUSY) {
mutex_exit(slock);
uvmexp.pdbusy++;
continue;
}
/* does the page belong to an object? */
if (uobj != NULL) {
uvmexp.pdobscan++;
} else {
#if defined(VMSWAP)
KASSERT(anon != NULL);
uvmexp.pdanscan++;
#else /* defined(VMSWAP) */
panic("%s: anon", __func__);
#endif /* defined(VMSWAP) */
}
/*
* we now have the object and the page queues locked.
* if the page is not swap-backed, call the object's
* pager to flush and free the page.
*/
#if defined(READAHEAD_STATS)
if ((p->pqflags & PQ_READAHEAD) != 0) {
p->pqflags &= ~PQ_READAHEAD;
uvm_ra_miss.ev_count++;
}
#endif /* defined(READAHEAD_STATS) */
if ((p->pqflags & PQ_SWAPBACKED) == 0) {
KASSERT(uobj != NULL);
mutex_exit(&uvm_pageqlock);
(void) (uobj->pgops->pgo_put)(uobj, p->offset,
p->offset + PAGE_SIZE, PGO_CLEANIT|PGO_FREE);
mutex_enter(&uvm_pageqlock);
continue;
}
/*
* the page is swap-backed. remove all the permissions
* from the page so we can sync the modified info
* without any race conditions. if the page is clean
* we can free it now and continue.
*/
pmap_page_protect(p, VM_PROT_NONE);
if ((p->flags & PG_CLEAN) && pmap_clear_modify(p)) {
p->flags &= ~(PG_CLEAN);
}
if (p->flags & PG_CLEAN) {
int slot;
int pageidx;
pageidx = p->offset >> PAGE_SHIFT;
uvm_pagefree(p);
uvmexp.pdfreed++;
/*
* for anons, we need to remove the page
* from the anon ourselves. for aobjs,
* pagefree did that for us.
*/
if (anon) {
KASSERT(anon->an_swslot != 0);
anon->an_page = NULL;
slot = anon->an_swslot;
} else {
slot = uao_find_swslot(uobj, pageidx);
}
mutex_exit(slock);
if (slot > 0) {
/* this page is now only in swap. */
mutex_enter(&uvm_swap_data_lock);
KASSERT(uvmexp.swpgonly < uvmexp.swpginuse);
uvmexp.swpgonly++;
mutex_exit(&uvm_swap_data_lock);
}
continue;
}
#if defined(VMSWAP)
/*
* this page is dirty, skip it if we'll have met our
* free target when all the current pageouts complete.
*/
if (uvmexp.free + uvmexp.paging > uvmexp.freetarg << 2) {
mutex_exit(slock);
continue;
}
/*
* free any swap space allocated to the page since
* we'll have to write it again with its new data.
*/
uvmpd_dropswap(p);
/*
* if all pages in swap are only in swap,
* the swap space is full and we can't page out
* any more swap-backed pages. reactivate this page
* so that we eventually cycle all pages through
* the inactive queue.
*/
if (uvm_swapisfull()) {
dirtyreacts++;
uvm_pageactivate(p);
mutex_exit(slock);
continue;
}
/*
* start new swap pageout cluster (if necessary).
*/
if (swapcluster_allocslots(&swc)) {
mutex_exit(slock);
dirtyreacts++; /* XXX */
continue;
}
/*
* at this point, we're definitely going reuse this
* page. mark the page busy and delayed-free.
* we should remove the page from the page queues
* so we don't ever look at it again.
* adjust counters and such.
*/
p->flags |= PG_BUSY;
UVM_PAGE_OWN(p, "scan_queue");
p->flags |= PG_PAGEOUT;
uvm_pagedequeue(p);
uvmexp.pgswapout++;
mutex_exit(&uvm_pageqlock);
/*
* add the new page to the cluster.
*/
if (swapcluster_add(&swc, p)) {
p->flags &= ~(PG_BUSY|PG_PAGEOUT);
UVM_PAGE_OWN(p, NULL);
mutex_enter(&uvm_pageqlock);
dirtyreacts++;
uvm_pageactivate(p);
mutex_exit(slock);
continue;
}
mutex_exit(slock);
swapcluster_flush(&swc, false);
mutex_enter(&uvm_pageqlock);
/*
* the pageout is in progress. bump counters and set up
* for the next loop.
*/
uvmexp.pdpending++;
#else /* defined(VMSWAP) */
uvm_pageactivate(p);
mutex_exit(slock);
#endif /* defined(VMSWAP) */
}
#if defined(VMSWAP)
mutex_exit(&uvm_pageqlock);
swapcluster_flush(&swc, true);
mutex_enter(&uvm_pageqlock);
#endif /* defined(VMSWAP) */
}
/*
* uvmpd_scan: scan the page queues and attempt to meet our targets.
*
* => called with pageq's locked
*/
static void
uvmpd_scan(void)
{
int swap_shortage, pages_freed;
UVMHIST_FUNC("uvmpd_scan"); UVMHIST_CALLED(pdhist);
uvmexp.pdrevs++;
#ifndef __SWAP_BROKEN
/*
* swap out some processes if we are below our free target.
* we need to unlock the page queues for this.
*/
if (uvmexp.free < uvmexp.freetarg && uvmexp.nswapdev != 0 &&
uvm.swapout_enabled) {
uvmexp.pdswout++;
UVMHIST_LOG(pdhist," free %d < target %d: swapout",
uvmexp.free, uvmexp.freetarg, 0, 0);
mutex_exit(&uvm_pageqlock);
uvm_swapout_threads();
mutex_enter(&uvm_pageqlock);
}
#endif
/*
* now we want to work on meeting our targets. first we work on our
* free target by converting inactive pages into free pages. then
* we work on meeting our inactive target by converting active pages
* to inactive ones.
*/
UVMHIST_LOG(pdhist, " starting 'free' loop",0,0,0,0);
pages_freed = uvmexp.pdfreed;
uvmpd_scan_queue();
pages_freed = uvmexp.pdfreed - pages_freed;
/*
* detect if we're not going to be able to page anything out
* until we free some swap resources from active pages.
*/
swap_shortage = 0;
if (uvmexp.free < uvmexp.freetarg &&
uvmexp.swpginuse >= uvmexp.swpgavail &&
!uvm_swapisfull() &&
pages_freed == 0) {
swap_shortage = uvmexp.freetarg - uvmexp.free;
}
uvmpdpol_balancequeue(swap_shortage);
}
/*
* uvm_reclaimable: decide whether to wait for pagedaemon.
*
* => return true if it seems to be worth to do uvm_wait.
*
* XXX should be tunable.
* XXX should consider pools, etc?
*/
bool
uvm_reclaimable(void)
{
int filepages;
int active, inactive;
/*
* if swap is not full, no problem.
*/
if (!uvm_swapisfull()) {