mirror of
https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git
synced 2024-12-27 05:21:08 +01:00
05f0fdd26a
Reviewed by: davidg
119 lines
4.0 KiB
C
119 lines
4.0 KiB
C
/*
|
|
* 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 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.
|
|
*
|
|
* from: @(#)vm_pageout.h 8.2 (Berkeley) 1/12/94
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Author: Avadis Tevanian, Jr.
|
|
*
|
|
* 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.
|
|
*
|
|
* $Id: vm_pageout.h,v 1.5 1994/08/21 07:19:45 paul Exp $
|
|
*/
|
|
|
|
#ifndef _VM_VM_PAGEOUT_H_
|
|
#define _VM_VM_PAGEOUT_H_
|
|
|
|
/*
|
|
* Header file for pageout daemon.
|
|
*/
|
|
|
|
/*
|
|
* Exported data structures.
|
|
*/
|
|
|
|
extern int vm_pages_needed; /* should be some "event" structure */
|
|
simple_lock_data_t vm_pages_needed_lock;
|
|
extern int vm_pageout_pages_needed;
|
|
|
|
#define VM_PAGEOUT_ASYNC 0
|
|
#define VM_PAGEOUT_SYNC 1
|
|
#define VM_PAGEOUT_FORCE 2
|
|
|
|
/*
|
|
* Exported routines.
|
|
*/
|
|
|
|
/*
|
|
* Signal pageout-daemon and wait for it.
|
|
*/
|
|
|
|
#define VM_WAIT vm_wait()
|
|
|
|
inline static void vm_wait() {
|
|
int s;
|
|
s = splhigh();
|
|
if (curproc == pageproc) {
|
|
vm_pageout_pages_needed = 1;
|
|
tsleep((caddr_t) &vm_pageout_pages_needed, PSWP, "vmwait", 0);
|
|
vm_pageout_pages_needed = 0;
|
|
} else {
|
|
wakeup((caddr_t) &vm_pages_needed);
|
|
tsleep((caddr_t) &cnt.v_free_count, PVM, "vmwait", 0);
|
|
}
|
|
splx(s);
|
|
}
|
|
|
|
|
|
#ifdef KERNEL
|
|
int vm_pageout_scan __P((void));
|
|
void vm_pageout_page __P((vm_page_t, vm_object_t));
|
|
void vm_pageout_cluster __P((vm_page_t, vm_object_t));
|
|
int vm_pageout_clean __P((vm_page_t, int));
|
|
#endif
|
|
|
|
#endif
|