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
|
/*
* Mach Operating System
* Copyright (c) 1991,1990,1989,1988 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 Mellon
* the rights to redistribute these changes.
*/
/*
* File: vm/vm_user.c
* Author: Avadis Tevanian, Jr., Michael Wayne Young
*
* User-exported virtual memory functions.
*/
#include <mach/boolean.h>
#include <mach/kern_return.h>
#include <mach/mach_types.h> /* to get vm_address_t */
#include <mach/memory_object.h>
#include <mach/std_types.h> /* to get pointer_t */
#include <mach/vm_attributes.h>
#include <mach/vm_param.h>
#include <mach/vm_statistics.h>
#include <kern/host.h>
#include <kern/task.h>
#include <vm/vm_fault.h>
#include <vm/vm_kern.h>
#include <vm/vm_map.h>
#include <vm/vm_object.h>
#include <vm/vm_page.h>
vm_statistics_data_t vm_stat;
/*
* vm_allocate allocates "zero fill" memory in the specfied
* map.
*/
kern_return_t vm_allocate(map, addr, size, anywhere)
register vm_map_t map;
register vm_offset_t *addr;
register vm_size_t size;
boolean_t anywhere;
{
kern_return_t result;
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
if (size == 0) {
*addr = 0;
return(KERN_SUCCESS);
}
if (anywhere)
*addr = vm_map_min(map);
else
*addr = trunc_page(*addr);
size = round_page(size);
result = vm_map_enter(
map,
addr,
size,
(vm_offset_t)0,
anywhere,
VM_OBJECT_NULL,
(vm_offset_t)0,
FALSE,
VM_PROT_DEFAULT,
VM_PROT_ALL,
VM_INHERIT_DEFAULT);
return(result);
}
/*
* vm_deallocate deallocates the specified range of addresses in the
* specified address map.
*/
kern_return_t vm_deallocate(map, start, size)
register vm_map_t map;
vm_offset_t start;
vm_size_t size;
{
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
if (size == (vm_offset_t) 0)
return(KERN_SUCCESS);
return(vm_map_remove(map, trunc_page(start), round_page(start+size)));
}
/*
* vm_inherit sets the inheritance of the specified range in the
* specified map.
*/
kern_return_t vm_inherit(map, start, size, new_inheritance)
register vm_map_t map;
vm_offset_t start;
vm_size_t size;
vm_inherit_t new_inheritance;
{
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
switch (new_inheritance) {
case VM_INHERIT_NONE:
case VM_INHERIT_COPY:
case VM_INHERIT_SHARE:
break;
default:
return(KERN_INVALID_ARGUMENT);
}
/*Check if range includes projected buffer;
user is not allowed direct manipulation in that case*/
if (projected_buffer_in_range(map, start, start+size))
return(KERN_INVALID_ARGUMENT);
return(vm_map_inherit(map,
trunc_page(start),
round_page(start+size),
new_inheritance));
}
/*
* vm_protect sets the protection of the specified range in the
* specified map.
*/
kern_return_t vm_protect(map, start, size, set_maximum, new_protection)
register vm_map_t map;
vm_offset_t start;
vm_size_t size;
boolean_t set_maximum;
vm_prot_t new_protection;
{
if ((map == VM_MAP_NULL) ||
(new_protection & ~(VM_PROT_ALL|VM_PROT_NOTIFY)))
return(KERN_INVALID_ARGUMENT);
/*Check if range includes projected buffer;
user is not allowed direct manipulation in that case*/
if (projected_buffer_in_range(map, start, start+size))
return(KERN_INVALID_ARGUMENT);
return(vm_map_protect(map,
trunc_page(start),
round_page(start+size),
new_protection,
set_maximum));
}
kern_return_t vm_statistics(map, stat)
vm_map_t map;
vm_statistics_data_t *stat;
{
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
*stat = vm_stat;
stat->pagesize = PAGE_SIZE;
stat->free_count = vm_page_free_count;
stat->active_count = vm_page_active_count;
stat->inactive_count = vm_page_inactive_count;
stat->wire_count = vm_page_wire_count;
return(KERN_SUCCESS);
}
/*
* Handle machine-specific attributes for a mapping, such
* as cachability, migrability, etc.
*/
kern_return_t vm_machine_attribute(map, address, size, attribute, value)
vm_map_t map;
vm_address_t address;
vm_size_t size;
vm_machine_attribute_t attribute;
vm_machine_attribute_val_t* value; /* IN/OUT */
{
extern kern_return_t vm_map_machine_attribute();
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
/*Check if range includes projected buffer;
user is not allowed direct manipulation in that case*/
if (projected_buffer_in_range(map, address, address+size))
return(KERN_INVALID_ARGUMENT);
return vm_map_machine_attribute(map, address, size, attribute, value);
}
kern_return_t vm_read(map, address, size, data, data_size)
vm_map_t map;
vm_address_t address;
vm_size_t size;
pointer_t *data;
vm_size_t *data_size;
{
kern_return_t error;
vm_map_copy_t ipc_address;
if (map == VM_MAP_NULL)
return(KERN_INVALID_ARGUMENT);
if ((error = vm_map_copyin(map,
address,
size,
FALSE, /* src_destroy */
&ipc_address)) == KERN_SUCCESS) {
*data = (pointer_t) ipc_address;
*data_size = size;
}
return(error);
}
kern_return_t vm_write(map, address, data, size)
vm_map_t map;
vm_address_t address;
pointer_t data;
vm_size_t size;
{
if (map == VM_MAP_NULL)
return KERN_INVALID_ARGUMENT;
return vm_map_copy_overwrite(map, address, (vm_map_copy_t) data,
FALSE /* interruptible XXX */);
}
kern_return_t vm_copy(map, source_address, size, dest_address)
vm_map_t map;
vm_address_t source_address;
vm_size_t size;
vm_address_t dest_address;
{
vm_map_copy_t copy;
kern_return_t kr;
if (map == VM_MAP_NULL)
return KERN_INVALID_ARGUMENT;
kr = vm_map_copyin(map, source_address, size,
FALSE, ©);
if (kr != KERN_SUCCESS)
return kr;
kr = vm_map_copy_overwrite(map, dest_address, copy,
FALSE /* interruptible XXX */);
if (kr != KERN_SUCCESS) {
vm_map_copy_discard(copy);
return kr;
}
return KERN_SUCCESS;
}
/*
* Routine: vm_map
*/
kern_return_t vm_map(
target_map,
address, size, mask, anywhere,
memory_object, offset,
copy,
cur_protection, max_protection, inheritance)
vm_map_t target_map;
vm_offset_t *address;
vm_size_t size;
vm_offset_t mask;
boolean_t anywhere;
ipc_port_t memory_object;
vm_offset_t offset;
boolean_t copy;
vm_prot_t cur_protection;
vm_prot_t max_protection;
vm_inherit_t inheritance;
{
register
vm_object_t object;
register
kern_return_t result;
if ((target_map == VM_MAP_NULL) ||
(cur_protection & ~VM_PROT_ALL) ||
(max_protection & ~VM_PROT_ALL))
return(KERN_INVALID_ARGUMENT);
switch (inheritance) {
case VM_INHERIT_NONE:
case VM_INHERIT_COPY:
case VM_INHERIT_SHARE:
break;
default:
return(KERN_INVALID_ARGUMENT);
}
*address = trunc_page(*address);
size = round_page(size);
if (!IP_VALID(memory_object)) {
object = VM_OBJECT_NULL;
offset = 0;
copy = FALSE;
} else if ((object = vm_object_enter(memory_object, size, FALSE))
== VM_OBJECT_NULL)
return(KERN_INVALID_ARGUMENT);
/*
* Perform the copy if requested
*/
if (copy) {
vm_object_t new_object;
vm_offset_t new_offset;
result = vm_object_copy_strategically(object, offset, size,
&new_object, &new_offset,
©);
/*
* Throw away the reference to the
* original object, as it won't be mapped.
*/
vm_object_deallocate(object);
if (result != KERN_SUCCESS)
return (result);
object = new_object;
offset = new_offset;
}
if ((result = vm_map_enter(target_map,
address, size, mask, anywhere,
object, offset,
copy,
cur_protection, max_protection, inheritance
)) != KERN_SUCCESS)
vm_object_deallocate(object);
return(result);
}
/*
* Specify that the range of the virtual address space
* of the target task must not cause page faults for
* the indicated accesses.
*
* [ To unwire the pages, specify VM_PROT_NONE. ]
*/
kern_return_t vm_wire(host, map, start, size, access)
host_t host;
register vm_map_t map;
vm_offset_t start;
vm_size_t size;
vm_prot_t access;
{
if (host == HOST_NULL)
return KERN_INVALID_HOST;
if (map == VM_MAP_NULL)
return KERN_INVALID_TASK;
if (access & ~VM_PROT_ALL)
return KERN_INVALID_ARGUMENT;
/*Check if range includes projected buffer;
user is not allowed direct manipulation in that case*/
if (projected_buffer_in_range(map, start, start+size))
return(KERN_INVALID_ARGUMENT);
return vm_map_pageable_user(map,
trunc_page(start),
round_page(start+size),
access);
}
|