Rev 72 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #ifndef __VM_H__ |
||
30 | #define __VM_H__ |
||
31 | |||
32 | #include <arch/mm/vm.h> |
||
33 | #include <arch/types.h> |
||
34 | #include <typedefs.h> |
||
35 | #include <synch/spinlock.h> |
||
36 | #include <list.h> |
||
37 | |||
38 | #define KERNEL_ADDRESS_SPACE_START KERNEL_ADDRESS_SPACE_START_ARCH |
||
39 | #define KERNEL_ADDRESS_SPACE_END KERNEL_ADDRESS_SPACE_END_ARCH |
||
40 | #define USER_ADDRESS_SPACE_START USER_ADDRESS_SPACE_START_ARCH |
||
41 | #define USER_ADDRESS_SPACE_END USER_ADDRESS_SPACE_END_ARCH |
||
42 | |||
43 | #define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END) |
||
44 | |||
45 | #define UTEXT_ADDRESS UTEXT_ADDRESS_ARCH |
||
46 | #define USTACK_ADDRESS USTACK_ADDRESS_ARCH |
||
47 | #define UDATA_ADDRESS UDATA_ADDRESS_ARCH |
||
48 | |||
49 | enum vm_type { |
||
50 | VMA_TEXT = 1, VMA_DATA, VMA_STACK |
||
51 | }; |
||
52 | |||
53 | /* |
||
54 | * Each vm_area structure describes one continuous area of virtual memory. |
||
55 | * In the future, it should not be difficult to support shared areas of vm. |
||
56 | */ |
||
57 | struct vm_area { |
||
58 | spinlock_t lock; |
||
59 | link_t link; |
||
60 | vm_type_t type; |
||
61 | int size; |
||
62 | __address address; |
||
63 | __address *mapping; |
||
64 | }; |
||
65 | |||
66 | /* |
||
67 | * vm_mapping_t contains the list of vm_areas of userspace accessible |
||
68 | * pages for one or more tasks. Ranges of kernel memory pages are not |
||
69 | * supposed to figure in the list as they are shared by all tasks and |
||
70 | * set up during system initialization. |
||
71 | */ |
||
72 | struct vm { |
||
73 | spinlock_t lock; |
||
74 | link_t vm_area_head; |
||
75 | }; |
||
76 | |||
77 | extern vm_t * vm_create(void); |
||
78 | extern void vm_destroy(vm_t *m); |
||
79 | |||
80 | extern vm_area_t *vm_area_create(vm_t *m, vm_type_t type, int size, __address addr); |
||
81 | extern void vm_area_destroy(vm_area_t *a); |
||
82 | |||
83 | extern void vm_area_map(vm_area_t *a); |
||
84 | extern void vm_area_unmap(vm_area_t *a); |
||
85 | |||
86 | extern void vm_install(vm_t *m); |
||
87 | extern void vm_uninstall(vm_t *m); |
||
88 | |||
89 | #endif |