Rev 2787 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2787 | Rev 3425 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2005 Jakub Jermar |
2 | * Copyright (c) 2005 Jakub Jermar |
3 | * Copyright (c) 2005 Sergey Bondari |
3 | * Copyright (c) 2005 Sergey Bondari |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | /** @addtogroup genericmm |
30 | /** @addtogroup genericmm |
31 | * @{ |
31 | * @{ |
32 | */ |
32 | */ |
33 | /** @file |
33 | /** @file |
34 | */ |
34 | */ |
35 | 35 | ||
36 | #ifndef KERN_FRAME_H_ |
36 | #ifndef KERN_FRAME_H_ |
37 | #define KERN_FRAME_H_ |
37 | #define KERN_FRAME_H_ |
38 | 38 | ||
39 | #include <arch/types.h> |
39 | #include <arch/types.h> |
40 | #include <adt/list.h> |
40 | #include <adt/list.h> |
41 | #include <synch/spinlock.h> |
41 | #include <synch/spinlock.h> |
42 | #include <mm/buddy.h> |
42 | #include <mm/buddy.h> |
43 | #include <arch/mm/page.h> |
43 | #include <arch/mm/page.h> |
44 | #include <arch/mm/frame.h> |
44 | #include <arch/mm/frame.h> |
45 | 45 | ||
46 | #define ONE_FRAME 0 |
46 | #define ONE_FRAME 0 |
47 | #define TWO_FRAMES 1 |
47 | #define TWO_FRAMES 1 |
48 | #define FOUR_FRAMES 2 |
48 | #define FOUR_FRAMES 2 |
49 | 49 | ||
50 | 50 | ||
51 | #ifdef ARCH_STACK_FRAMES |
51 | #ifdef ARCH_STACK_FRAMES |
52 | #define STACK_FRAMES ARCH_STACK_FRAMES |
52 | #define STACK_FRAMES ARCH_STACK_FRAMES |
53 | #else |
53 | #else |
54 | #define STACK_FRAMES ONE_FRAME |
54 | #define STACK_FRAMES ONE_FRAME |
55 | #endif |
55 | #endif |
56 | 56 | ||
57 | /** Maximum number of zones in system. */ |
57 | /** Maximum number of zones in system. */ |
58 | #define ZONES_MAX 16 |
58 | #define ZONES_MAX 16 |
59 | 59 | ||
60 | /** If possible, merge with neighbouring zones. */ |
- | |
61 | #define ZONE_JOIN 0x1 |
- | |
62 | - | ||
63 | /** Convert the frame address to kernel va. */ |
60 | /** Convert the frame address to kernel va. */ |
64 | #define FRAME_KA 0x1 |
61 | #define FRAME_KA 0x1 |
65 | /** Do not panic and do not sleep on failure. */ |
62 | /** Do not panic and do not sleep on failure. */ |
66 | #define FRAME_ATOMIC 0x2 |
63 | #define FRAME_ATOMIC 0x2 |
67 | /** Do not start reclaiming when no free memory. */ |
64 | /** Do not start reclaiming when no free memory. */ |
68 | #define FRAME_NO_RECLAIM 0x4 |
65 | #define FRAME_NO_RECLAIM 0x4 |
- | 66 | /** Do not allocate above 4 GiB. */ |
|
- | 67 | #define FRAME_LOW_4_GiB 0x8 |
|
69 | 68 | ||
70 | static inline uintptr_t PFN2ADDR(pfn_t frame) |
69 | static inline uintptr_t PFN2ADDR(pfn_t frame) |
71 | { |
70 | { |
72 | return (uintptr_t) (frame << FRAME_WIDTH); |
71 | return (uintptr_t) (frame << FRAME_WIDTH); |
73 | } |
72 | } |
74 | 73 | ||
75 | static inline pfn_t ADDR2PFN(uintptr_t addr) |
74 | static inline pfn_t ADDR2PFN(uintptr_t addr) |
76 | { |
75 | { |
77 | return (pfn_t) (addr >> FRAME_WIDTH); |
76 | return (pfn_t) (addr >> FRAME_WIDTH); |
78 | } |
77 | } |
79 | 78 | ||
80 | static inline count_t SIZE2FRAMES(size_t size) |
79 | static inline count_t SIZE2FRAMES(size_t size) |
81 | { |
80 | { |
82 | if (!size) |
81 | if (!size) |
83 | return 0; |
82 | return 0; |
84 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1; |
83 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1; |
85 | } |
84 | } |
86 | 85 | ||
87 | static inline size_t FRAMES2SIZE(count_t frames) |
86 | static inline size_t FRAMES2SIZE(count_t frames) |
88 | { |
87 | { |
89 | return (size_t) (frames << FRAME_WIDTH); |
88 | return (size_t) (frames << FRAME_WIDTH); |
90 | } |
89 | } |
91 | 90 | ||
92 | #define IS_BUDDY_ORDER_OK(index, order) \ |
91 | #define IS_BUDDY_ORDER_OK(index, order) \ |
93 | ((~(((unative_t) -1) << (order)) & (index)) == 0) |
92 | ((~(((unative_t) -1) << (order)) & (index)) == 0) |
94 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \ |
93 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \ |
95 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
94 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
96 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \ |
95 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \ |
97 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
96 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
98 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \ |
97 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \ |
99 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
98 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
100 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \ |
99 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \ |
101 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
100 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
102 | 101 | ||
103 | #define frame_alloc(order, flags) \ |
102 | #define frame_alloc(order, flags) \ |
104 | frame_alloc_generic(order, flags, NULL) |
103 | frame_alloc_generic(order, flags, NULL) |
105 | 104 | ||
106 | extern void frame_init(void); |
105 | extern void frame_init(void); |
107 | extern void *frame_alloc_generic(uint8_t order, int flags, unsigned int *pzone); |
106 | extern void *frame_alloc_generic(uint8_t, int, unsigned int *); |
108 | extern void frame_free(uintptr_t frame); |
107 | extern void frame_free(uintptr_t); |
109 | extern void frame_reference_add(pfn_t pfn); |
108 | extern void frame_reference_add(pfn_t); |
110 | 109 | ||
111 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
110 | extern int zone_create(pfn_t, count_t, pfn_t, int); |
112 | extern void *frame_get_parent(pfn_t frame, unsigned int hint); |
111 | extern void *frame_get_parent(pfn_t, unsigned int); |
113 | extern void frame_set_parent(pfn_t frame, void *data, unsigned int hint); |
112 | extern void frame_set_parent(pfn_t, void *, unsigned int); |
114 | extern void frame_mark_unavailable(pfn_t start, count_t count); |
113 | extern void frame_mark_unavailable(pfn_t, count_t); |
115 | extern uintptr_t zone_conf_size(count_t count); |
114 | extern uintptr_t zone_conf_size(count_t); |
116 | extern void zone_merge(unsigned int z1, unsigned int z2); |
115 | extern void zone_merge(unsigned int, unsigned int); |
117 | extern void zone_merge_all(void); |
116 | extern void zone_merge_all(void); |
118 | extern uint64_t zone_total_size(void); |
117 | extern uint64_t zone_total_size(void); |
119 | 118 | ||
120 | /* |
119 | /* |
121 | * Console functions |
120 | * Console functions |
122 | */ |
121 | */ |
123 | extern void zone_print_list(void); |
122 | extern void zone_print_list(void); |
124 | extern void zone_print_one(unsigned int znum); |
123 | extern void zone_print_one(unsigned int); |
125 | 124 | ||
126 | #endif |
125 | #endif |
127 | 126 | ||
128 | /** @} |
127 | /** @} |
129 | */ |
128 | */ |
130 | 129 |