Deleted Added
full compact
vm_param.h (1817) vm_param.h (5455)
1/*
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
9 * modification, are permitted provided that the following conditions

--- 25 unchanged lines hidden (view full) ---

35 *
36 * from: @(#)vm_param.h 8.1 (Berkeley) 6/11/93
37 *
38 *
39 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
40 * All rights reserved.
41 *
42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
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
9 * modification, are permitted provided that the following conditions

--- 25 unchanged lines hidden (view full) ---

35 *
36 * from: @(#)vm_param.h 8.1 (Berkeley) 6/11/93
37 *
38 *
39 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
40 * All rights reserved.
41 *
42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
43 *
43 *
44 * Permission to use, copy, modify and distribute this software and
45 * its documentation is hereby granted, provided that both the copyright
46 * notice and this permission notice appear in all copies of the
47 * software, derivative works or modified versions, and any portions
48 * thereof, and that both notices appear in supporting documentation.
44 * Permission to use, copy, modify and distribute this software and
45 * its documentation is hereby granted, provided that both the copyright
46 * notice and this permission notice appear in all copies of the
47 * software, derivative works or modified versions, and any portions
48 * thereof, and that both notices appear in supporting documentation.
49 *
50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
49 *
50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
53 *
53 *
54 * Carnegie Mellon requests users of this software to return to
55 *
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 *
54 * Carnegie Mellon requests users of this software to return to
55 *
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$
64 * $Id: vm_param.h,v 1.3 1994/08/02 07:55:37 davidg Exp $
65 */
66
67/*
68 * Machine independent virtual memory parameters.
69 */
70
71#ifndef _VM_PARAM_
72#define _VM_PARAM_
73
74#include <machine/vmparam.h>
75
76/*
77 * This belongs in types.h, but breaks too many existing programs.
78 */
65 */
66
67/*
68 * Machine independent virtual memory parameters.
69 */
70
71#ifndef _VM_PARAM_
72#define _VM_PARAM_
73
74#include <machine/vmparam.h>
75
76/*
77 * This belongs in types.h, but breaks too many existing programs.
78 */
79typedef int boolean_t;
79typedef int boolean_t;
80
80#define TRUE 1
81#define FALSE 0
82
83/*
84 * The machine independent pages are refered to as PAGES. A page
85 * is some number of hardware pages, depending on the target machine.
86 */
87#define DEFAULT_PAGE_SIZE 4096
88
89#if 0
90
91/*
92 * All references to the size of a page should be done with PAGE_SIZE
93 * or PAGE_SHIFT. The fact they are variables is hidden here so that
94 * we can easily make them constant if we so desire.
95 */
96#ifndef PAGE_SIZE
81#define TRUE 1
82#define FALSE 0
83
84/*
85 * The machine independent pages are refered to as PAGES. A page
86 * is some number of hardware pages, depending on the target machine.
87 */
88#define DEFAULT_PAGE_SIZE 4096
89
90#if 0
91
92/*
93 * All references to the size of a page should be done with PAGE_SIZE
94 * or PAGE_SHIFT. The fact they are variables is hidden here so that
95 * we can easily make them constant if we so desire.
96 */
97#ifndef PAGE_SIZE
97#define PAGE_SIZE cnt.v_page_size /* size of page */
98#define PAGE_SIZE cnt.v_page_size /* size of page */
98#endif
99#ifndef PAGE_MASK
99#endif
100#ifndef PAGE_MASK
100#define PAGE_MASK page_mask /* size of page - 1 */
101#define PAGE_MASK page_mask /* size of page - 1 */
101#endif
102#ifndef PAGE_SHIFT
102#endif
103#ifndef PAGE_SHIFT
103#define PAGE_SHIFT page_shift /* bits to shift for pages */
104#define PAGE_SHIFT page_shift /* bits to shift for pages */
104#endif
105
106#endif
107
108#ifdef KERNEL
105#endif
106
107#endif
108
109#ifdef KERNEL
109extern vm_size_t page_mask;
110extern int page_shift;
110extern vm_size_t page_mask;
111extern int page_shift;
112
111#endif
112
113/*
114 * CTL_VM identifiers
115 */
113#endif
114
115/*
116 * CTL_VM identifiers
117 */
116#define VM_METER 1 /* struct vmmeter */
117#define VM_LOADAVG 2 /* struct loadavg */
118#define VM_MAXID 3 /* number of valid vm ids */
118#define VM_METER 1 /* struct vmmeter */
119#define VM_LOADAVG 2 /* struct loadavg */
120#define VM_V_FREE_MIN 3 /* cnt.v_free_min */
121#define VM_V_FREE_TARGET 4 /* cnt.v_free_target */
122#define VM_V_FREE_RESERVED 5 /* cnt.v_free_reserved */
123#define VM_V_INACTIVE_TARGET 6 /* cnt.v_inactive_target */
124#define VM_V_CACHE_MIN 7 /* cnt.v_cache_max */
125#define VM_V_CACHE_MAX 8 /* cnt.v_cache_min */
126#define VM_V_PAGEOUT_FREE_MIN 9 /* cnt.v_pageout_free_min */
127#define VM_MAXID 10 /* number of valid vm ids */
119
120#define CTL_VM_NAMES { \
121 { 0, 0 }, \
122 { "vmmeter", CTLTYPE_STRUCT }, \
123 { "loadavg", CTLTYPE_STRUCT }, \
128
129#define CTL_VM_NAMES { \
130 { 0, 0 }, \
131 { "vmmeter", CTLTYPE_STRUCT }, \
132 { "loadavg", CTLTYPE_STRUCT }, \
133 { "v_free_min", CTLTYPE_INT }, \
134 { "v_free_target", CTLTYPE_INT }, \
135 { "v_free_reserved", CTLTYPE_INT }, \
136 { "v_inactive_target", CTLTYPE_INT }, \
137 { "v_cache_min", CTLTYPE_INT }, \
138 { "v_cache_max", CTLTYPE_INT }, \
139 { "v_pageout_free_min", CTLTYPE_INT}, \
124}
125
140}
141
126/*
142/*
127 * Return values from the VM routines.
128 */
129#define KERN_SUCCESS 0
130#define KERN_INVALID_ADDRESS 1
131#define KERN_PROTECTION_FAILURE 2
132#define KERN_NO_SPACE 3
133#define KERN_INVALID_ARGUMENT 4
134#define KERN_FAILURE 5
135#define KERN_RESOURCE_SHORTAGE 6
136#define KERN_NOT_RECEIVER 7
137#define KERN_NO_ACCESS 8
138
139#ifndef ASSEMBLER
140/*
141 * Convert addresses to pages and vice versa.
142 * No rounding is used.
143 */
144#ifdef KERNEL
143 * Return values from the VM routines.
144 */
145#define KERN_SUCCESS 0
146#define KERN_INVALID_ADDRESS 1
147#define KERN_PROTECTION_FAILURE 2
148#define KERN_NO_SPACE 3
149#define KERN_INVALID_ARGUMENT 4
150#define KERN_FAILURE 5
151#define KERN_RESOURCE_SHORTAGE 6
152#define KERN_NOT_RECEIVER 7
153#define KERN_NO_ACCESS 8
154
155#ifndef ASSEMBLER
156/*
157 * Convert addresses to pages and vice versa.
158 * No rounding is used.
159 */
160#ifdef KERNEL
145
146#if 0
147
148#ifndef atop
149#define atop(x) (((unsigned)(x)) >> PAGE_SHIFT)
150#endif
151#ifndef ptoa
152#define ptoa(x) ((vm_offset_t)((x) << PAGE_SHIFT))
153#endif
154
155/*
156 * Round off or truncate to the nearest page. These will work
157 * for either addresses or counts (i.e., 1 byte rounds to 1 page).
158 */
159#ifndef round_page
160#define round_page(x) \
161 ((vm_offset_t)((((vm_offset_t)(x)) + PAGE_MASK) & ~PAGE_MASK))
162#endif
163#ifndef trunc_page
164#define trunc_page(x) \
165 ((vm_offset_t)(((vm_offset_t)(x)) & ~PAGE_MASK))
166#endif
167#ifndef num_pages
168#define num_pages(x) \
169 ((vm_offset_t)((((vm_offset_t)(x)) + PAGE_MASK) >> PAGE_SHIFT))
161#define num_pages(x) \
162 ((vm_offset_t)((((vm_offset_t)(x)) + PAGE_MASK) >> PAGE_SHIFT))
170#endif
171
163
172#endif
173#define num_pages(x) \
174 ((vm_offset_t)((((vm_offset_t)(x)) + PAGE_MASK) >> PAGE_SHIFT))
175
176extern vm_size_t mem_size; /* size of physical memory (bytes) */
177extern vm_offset_t first_addr; /* first physical page */
178extern vm_offset_t last_addr; /* last physical page */
179
180#else
181#if 0
182/* out-of-kernel versions of round_page and trunc_page */
183#define round_page(x) \
184 ((((vm_offset_t)(x) + (vm_page_size - 1)) / vm_page_size) * vm_page_size)
185#define trunc_page(x) \
186 ((((vm_offset_t)(x)) / vm_page_size) * vm_page_size)
187#endif
188
189#endif /* KERNEL */
190#endif /* ASSEMBLER */
191#endif /* _VM_PARAM_ */
164extern vm_size_t mem_size; /* size of physical memory (bytes) */
165extern vm_offset_t first_addr; /* first physical page */
166extern vm_offset_t last_addr; /* last physical page */
167#endif /* KERNEL */
168#endif /* ASSEMBLER */
169#endif /* _VM_PARAM_ */