Rev 2089 | Rev 2725 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2089 | Rev 2122 | ||
---|---|---|---|
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 | 48 | ||
49 | #ifdef ARCH_STACK_FRAMES |
49 | #ifdef ARCH_STACK_FRAMES |
50 | #define STACK_FRAMES ARCH_STACK_FRAMES |
50 | #define STACK_FRAMES ARCH_STACK_FRAMES |
51 | #else |
51 | #else |
52 | #define STACK_FRAMES ONE_FRAME |
52 | #define STACK_FRAMES ONE_FRAME |
53 | #endif |
53 | #endif |
54 | 54 | ||
55 | /** Maximum number of zones in system. */ |
55 | /** Maximum number of zones in system. */ |
56 | #define ZONES_MAX 16 |
56 | #define ZONES_MAX 16 |
57 | 57 | ||
58 | /** If possible, merge with neighbouring zones. */ |
58 | /** If possible, merge with neighbouring zones. */ |
59 | #define ZONE_JOIN 0x1 |
59 | #define ZONE_JOIN 0x1 |
60 | 60 | ||
61 | /** Convert the frame address to kernel va. */ |
61 | /** Convert the frame address to kernel va. */ |
62 | #define FRAME_KA 0x1 |
62 | #define FRAME_KA 0x1 |
63 | /** Do not panic and do not sleep on failure. */ |
63 | /** Do not panic and do not sleep on failure. */ |
64 | #define FRAME_ATOMIC 0x2 |
64 | #define FRAME_ATOMIC 0x2 |
65 | /** Do not start reclaiming when no free memory. */ |
65 | /** Do not start reclaiming when no free memory. */ |
66 | #define FRAME_NO_RECLAIM 0x4 |
66 | #define FRAME_NO_RECLAIM 0x4 |
67 | 67 | ||
68 | static inline uintptr_t PFN2ADDR(pfn_t frame) |
68 | static inline uintptr_t PFN2ADDR(pfn_t frame) |
69 | { |
69 | { |
70 | return (uintptr_t) (frame << FRAME_WIDTH); |
70 | return (uintptr_t) (frame << FRAME_WIDTH); |
71 | } |
71 | } |
72 | 72 | ||
73 | static inline pfn_t ADDR2PFN(uintptr_t addr) |
73 | static inline pfn_t ADDR2PFN(uintptr_t addr) |
74 | { |
74 | { |
75 | return (pfn_t) (addr >> FRAME_WIDTH); |
75 | return (pfn_t) (addr >> FRAME_WIDTH); |
76 | } |
76 | } |
77 | 77 | ||
78 | static inline count_t SIZE2FRAMES(size_t size) |
78 | static inline count_t SIZE2FRAMES(size_t size) |
79 | { |
79 | { |
80 | if (!size) |
80 | if (!size) |
81 | return 0; |
81 | return 0; |
82 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1; |
82 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1; |
83 | } |
83 | } |
84 | 84 | ||
85 | #define IS_BUDDY_ORDER_OK(index, order) \ |
85 | #define IS_BUDDY_ORDER_OK(index, order) \ |
86 | ((~(((unative_t) -1) << (order)) & (index)) == 0) |
86 | ((~(((unative_t) -1) << (order)) & (index)) == 0) |
87 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \ |
87 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \ |
88 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
88 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
89 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \ |
89 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \ |
90 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
90 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
91 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \ |
91 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \ |
92 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
92 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
93 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \ |
93 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \ |
94 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
94 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
95 | 95 | ||
96 | #define frame_alloc(order, flags) \ |
96 | #define frame_alloc(order, flags) \ |
97 | frame_alloc_generic(order, flags, NULL) |
97 | frame_alloc_generic(order, flags, NULL) |
98 | 98 | ||
99 | extern void frame_init(void); |
99 | extern void frame_init(void); |
100 | extern void *frame_alloc_generic(uint8_t order, int flags, int *pzone); |
100 | extern void *frame_alloc_generic(uint8_t order, int flags, unsigned int *pzone); |
101 | extern void frame_free(uintptr_t frame); |
101 | extern void frame_free(uintptr_t frame); |
102 | extern void frame_reference_add(pfn_t pfn); |
102 | extern void frame_reference_add(pfn_t pfn); |
103 | 103 | ||
104 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
104 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
105 | void *frame_get_parent(pfn_t frame, int hint); |
105 | void *frame_get_parent(pfn_t frame, unsigned int hint); |
106 | void frame_set_parent(pfn_t frame, void *data, int hint); |
106 | void frame_set_parent(pfn_t frame, void *data, unsigned int hint); |
107 | void frame_mark_unavailable(pfn_t start, count_t count); |
107 | void frame_mark_unavailable(pfn_t start, count_t count); |
108 | uintptr_t zone_conf_size(count_t count); |
108 | uintptr_t zone_conf_size(count_t count); |
109 | void zone_merge(int z1, int z2); |
109 | void zone_merge(unsigned int z1, unsigned int z2); |
110 | void zone_merge_all(void); |
110 | void zone_merge_all(void); |
111 | 111 | ||
112 | /* |
112 | /* |
113 | * Console functions |
113 | * Console functions |
114 | */ |
114 | */ |
115 | extern void zone_print_list(void); |
115 | extern void zone_print_list(void); |
116 | void zone_print_one(int znum); |
116 | void zone_print_one(unsigned int znum); |
117 | 117 | ||
118 | #endif |
118 | #endif |
119 | 119 | ||
120 | /** @} |
120 | /** @} |
121 | */ |
121 | */ |
122 | 122 |