| vm_pager.c (12767) | vm_pager.c (12820) |
|---|---|
| 1/* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 47 unchanged lines hidden (view full) --- 56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 57 * School of Computer Science 58 * Carnegie Mellon University 59 * Pittsburgh PA 15213-3890 60 * 61 * any improvements or extensions that they make and grant Carnegie the 62 * rights to redistribute these changes. 63 * | 1/* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 47 unchanged lines hidden (view full) --- 56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 57 * School of Computer Science 58 * Carnegie Mellon University 59 * Pittsburgh PA 15213-3890 60 * 61 * any improvements or extensions that they make and grant Carnegie the 62 * rights to redistribute these changes. 63 * |
| 64 * $Id: vm_pager.c,v 1.19 1995/12/07 12:48:26 davidg Exp $ | 64 * $Id: vm_pager.c,v 1.20 1995/12/11 04:58:29 dyson Exp $ |
| 65 */ 66 67/* 68 * Paging space routine stubs. Emulates a matchmaker-like interface 69 * for builtin pagers. 70 */ 71 72#include <sys/param.h> --- 32 unchanged lines hidden (view full) --- 105 * XXX needs to be large enough to support the number of pending async 106 * cleaning requests (NPENDINGIO == 64) * the maximum swap cluster size 107 * (MAXPHYS == 64k) if you want to get the most efficiency. 108 */ 109#define PAGER_MAP_SIZE (8 * 1024 * 1024) 110 111int pager_map_size = PAGER_MAP_SIZE; 112vm_map_t pager_map; | 65 */ 66 67/* 68 * Paging space routine stubs. Emulates a matchmaker-like interface 69 * for builtin pagers. 70 */ 71 72#include <sys/param.h> --- 32 unchanged lines hidden (view full) --- 105 * XXX needs to be large enough to support the number of pending async 106 * cleaning requests (NPENDINGIO == 64) * the maximum swap cluster size 107 * (MAXPHYS == 64k) if you want to get the most efficiency. 108 */ 109#define PAGER_MAP_SIZE (8 * 1024 * 1024) 110 111int pager_map_size = PAGER_MAP_SIZE; 112vm_map_t pager_map; |
| 113boolean_t pager_map_wanted; 114int bswneeded; 115vm_offset_t swapbkva; /* swap buffers kva */ | 113static int bswneeded; 114static vm_offset_t swapbkva; /* swap buffers kva */ |
| 116 117void 118vm_pager_init() 119{ 120 struct pagerops **pgops; 121 122 /* 123 * Initialize known pagers --- 242 unchanged lines hidden --- | 115 116void 117vm_pager_init() 118{ 119 struct pagerops **pgops; 120 121 /* 122 * Initialize known pagers --- 242 unchanged lines hidden --- |