Rev 820 | Rev 827 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 820 | Rev 822 | ||
---|---|---|---|
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 | #ifndef __FRAME_H__ |
30 | #ifndef __FRAME_H__ |
31 | #define __FRAME_H__ |
31 | #define __FRAME_H__ |
32 | 32 | ||
33 | #include <arch/types.h> |
33 | #include <arch/types.h> |
34 | #include <typedefs.h> |
34 | #include <typedefs.h> |
35 | #include <adt/list.h> |
35 | #include <adt/list.h> |
36 | #include <synch/spinlock.h> |
36 | #include <synch/spinlock.h> |
37 | #include <mm/buddy.h> |
37 | #include <mm/buddy.h> |
38 | #include <arch/mm/page.h> |
38 | #include <arch/mm/page.h> |
39 | 39 | ||
40 | #define ONE_FRAME 0 |
40 | #define ONE_FRAME 0 |
41 | 41 | ||
42 | #define ZONES_MAX 16 /**< Maximum number of zones in system */ |
42 | #define ZONES_MAX 16 /**< Maximum number of zones in system */ |
43 | 43 | ||
44 | #define ZONE_JOIN 0x1 /**< If possible, merge with neighberhood zones */ |
44 | #define ZONE_JOIN 0x1 /**< If possible, merge with neighberhood zones */ |
45 | 45 | ||
46 | #define FRAME_KA 0x1 /* skip frames conflicting with user address space */ |
46 | #define FRAME_KA 0x1 /* skip frames conflicting with user address space */ |
47 | #define FRAME_PANIC 0x2 /* panic on failure */ |
47 | #define FRAME_PANIC 0x2 /* panic on failure */ |
48 | #define FRAME_ATOMIC 0x4 /* do not panic and do not sleep on failure */ |
48 | #define FRAME_ATOMIC 0x4 /* do not panic and do not sleep on failure */ |
49 | #define FRAME_NO_RECLAIM 0x8 /* do not start reclaiming when no free memory */ |
49 | #define FRAME_NO_RECLAIM 0x8 /* do not start reclaiming when no free memory */ |
50 | 50 | ||
51 | #define FRAME_OK 0 /* frame_alloc return status */ |
51 | #define FRAME_OK 0 /* frame_alloc return status */ |
52 | #define FRAME_NO_MEMORY 1 /* frame_alloc return status */ |
52 | #define FRAME_NO_MEMORY 1 /* frame_alloc return status */ |
53 | #define FRAME_ERROR 2 /* frame_alloc return status */ |
53 | #define FRAME_ERROR 2 /* frame_alloc return status */ |
54 | 54 | ||
55 | /* Return true if the interlvals overlap */ |
55 | /* Return true if the interlvals overlap */ |
56 | static inline int overlaps(__address s1,__address e1, __address s2, __address e2) |
56 | static inline int overlaps(__address s1,__address sz1, __address s2, __address sz2) |
57 | { |
57 | { |
- | 58 | __address e1 = s1+sz1; |
|
- | 59 | __address e2 = s2+sz2; |
|
58 | if (s1 >= s2 && s1 < e2) |
60 | if (s1 >= s2 && s1 < e2) |
59 | return 1; |
61 | return 1; |
60 | if (e1 >= s2 && e1 < e2) |
62 | if (e1 >= s2 && e1 < e2) |
61 | return 1; |
63 | return 1; |
62 | if ((s1 < s2) && (e1 >= e2)) |
64 | if ((s1 < s2) && (e1 >= e2)) |
63 | return 1; |
65 | return 1; |
64 | return 0; |
66 | return 0; |
65 | } |
67 | } |
66 | 68 | ||
67 | static inline __address PFN2ADDR(pfn_t frame) |
69 | static inline __address PFN2ADDR(pfn_t frame) |
68 | { |
70 | { |
69 | return (__address)(frame << FRAME_WIDTH); |
71 | return (__address)(frame << FRAME_WIDTH); |
70 | } |
72 | } |
71 | 73 | ||
72 | static inline pfn_t ADDR2PFN(__address addr) |
74 | static inline pfn_t ADDR2PFN(__address addr) |
73 | { |
75 | { |
74 | return (pfn_t)(addr >> FRAME_WIDTH); |
76 | return (pfn_t)(addr >> FRAME_WIDTH); |
75 | } |
77 | } |
76 | 78 | ||
77 | static inline count_t SIZE2FRAMES(size_t size) |
79 | static inline count_t SIZE2FRAMES(size_t size) |
78 | { |
80 | { |
79 | if (!size) |
81 | if (!size) |
80 | return 0; |
82 | return 0; |
81 | return (count_t)((size-1) >> FRAME_WIDTH)+1; |
83 | return (count_t)((size-1) >> FRAME_WIDTH)+1; |
82 | } |
84 | } |
83 | 85 | ||
84 | #define IS_BUDDY_ORDER_OK(index, order) ((~(((__native) -1) << (order)) & (index)) == 0) |
86 | #define IS_BUDDY_ORDER_OK(index, order) ((~(((__native) -1) << (order)) & (index)) == 0) |
85 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
87 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
86 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
88 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
87 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
89 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
88 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
90 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
89 | 91 | ||
90 | #define frame_alloc(order, flags) frame_alloc_generic(order, flags, NULL, NULL) |
92 | #define frame_alloc(order, flags) frame_alloc_generic(order, flags, NULL, NULL) |
91 | #define frame_alloc_rc(order, flags, status) frame_alloc_generic(order, flags, status, NULL) |
93 | #define frame_alloc_rc(order, flags, status) frame_alloc_generic(order, flags, status, NULL) |
92 | #define frame_alloc_rc_zone(order, flags, status, zone) frame_alloc_generic(order, flags, status, zone) |
94 | #define frame_alloc_rc_zone(order, flags, status, zone) frame_alloc_generic(order, flags, status, zone) |
93 | 95 | ||
94 | extern void frame_init(void); |
96 | extern void frame_init(void); |
95 | __address frame_alloc_generic(__u8 order, int flags, int * status, int *pzone); |
97 | __address frame_alloc_generic(__u8 order, int flags, int * status, int *pzone); |
96 | extern void frame_free(__address addr); |
98 | extern void frame_free(__address addr); |
97 | 99 | ||
98 | extern void zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
100 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
99 | - | ||
100 | void * frame_get_parent(pfn_t frame, int hint); |
101 | void * frame_get_parent(pfn_t frame, int hint); |
101 | void frame_set_parent(pfn_t frame, void *data, int hint); |
102 | void frame_set_parent(pfn_t frame, void *data, int hint); |
102 | void frame_mark_unavailable(pfn_t start, count_t count); |
103 | void frame_mark_unavailable(pfn_t start, count_t count); |
103 | __address zone_conf_size(pfn_t start, count_t count); |
104 | __address zone_conf_size(count_t count); |
- | 105 | void zone_merge(int z1, int z2); |
|
- | 106 | void zone_merge_all(void); |
|
104 | 107 | ||
105 | /* |
108 | /* |
106 | * Console functions |
109 | * Console functions |
107 | */ |
110 | */ |
108 | extern void zone_print_list(void); |
111 | extern void zone_print_list(void); |
109 | void zone_print_one(int znum); |
112 | void zone_print_one(int znum); |
110 | 113 | ||
111 | #endif |
114 | #endif |
112 | 115 |