Rev 1766 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
||
480 | bondari | 3 | * Copyright (C) 2005 Sergey Bondari |
1 | jermar | 4 | * All rights reserved. |
5 | * |
||
6 | * Redistribution and use in source and binary forms, with or without |
||
7 | * modification, are permitted provided that the following conditions |
||
8 | * are met: |
||
9 | * |
||
10 | * - Redistributions of source code must retain the above copyright |
||
11 | * notice, this list of conditions and the following disclaimer. |
||
12 | * - Redistributions in binary form must reproduce the above copyright |
||
13 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
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 |
||
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | */ |
||
29 | |||
1702 | cejka | 30 | /** @addtogroup genericmm |
31 | * @{ |
||
32 | */ |
||
33 | /** @file |
||
34 | */ |
||
35 | |||
1 | jermar | 36 | #ifndef __FRAME_H__ |
37 | #define __FRAME_H__ |
||
38 | |||
39 | #include <arch/types.h> |
||
102 | jermar | 40 | #include <typedefs.h> |
788 | jermar | 41 | #include <adt/list.h> |
354 | jermar | 42 | #include <synch/spinlock.h> |
479 | bondari | 43 | #include <mm/buddy.h> |
814 | palkovsky | 44 | #include <arch/mm/page.h> |
935 | vana | 45 | #include <arch/mm/frame.h> |
1 | jermar | 46 | |
548 | jermar | 47 | #define ONE_FRAME 0 |
935 | vana | 48 | #define TWO_FRAMES 1 |
548 | jermar | 49 | |
935 | vana | 50 | #ifdef ARCH_STACK_FRAMES |
51 | #define STACK_FRAMES ARCH_STACK_FRAMES |
||
52 | #else |
||
53 | #define STACK_FRAMES ONE_FRAME |
||
54 | #endif |
||
55 | |||
814 | palkovsky | 56 | #define ZONES_MAX 16 /**< Maximum number of zones in system */ |
57 | |||
1138 | jermar | 58 | #define ZONE_JOIN 0x1 /**< If possible, merge with neighbouring zones */ |
814 | palkovsky | 59 | |
762 | palkovsky | 60 | #define FRAME_KA 0x1 /* skip frames conflicting with user address space */ |
1767 | palkovsky | 61 | #define FRAME_ATOMIC 0x2 /* do not panic and do not sleep on failure */ |
62 | #define FRAME_NO_RECLAIM 0x4 /* do not start reclaiming when no free memory */ |
||
1 | jermar | 63 | |
689 | bondari | 64 | #define FRAME_OK 0 /* frame_alloc return status */ |
65 | #define FRAME_NO_MEMORY 1 /* frame_alloc return status */ |
||
66 | #define FRAME_ERROR 2 /* frame_alloc return status */ |
||
67 | |||
814 | palkovsky | 68 | static inline __address PFN2ADDR(pfn_t frame) |
69 | { |
||
816 | jermar | 70 | return (__address)(frame << FRAME_WIDTH); |
814 | palkovsky | 71 | } |
72 | |||
73 | static inline pfn_t ADDR2PFN(__address addr) |
||
74 | { |
||
816 | jermar | 75 | return (pfn_t)(addr >> FRAME_WIDTH); |
814 | palkovsky | 76 | } |
77 | |||
820 | jermar | 78 | static inline count_t SIZE2FRAMES(size_t size) |
814 | palkovsky | 79 | { |
80 | if (!size) |
||
81 | return 0; |
||
820 | jermar | 82 | return (count_t)((size-1) >> FRAME_WIDTH)+1; |
814 | palkovsky | 83 | } |
84 | |||
564 | jermar | 85 | #define IS_BUDDY_ORDER_OK(index, order) ((~(((__native) -1) << (order)) & (index)) == 0) |
814 | palkovsky | 86 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
87 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
||
88 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0) |
||
89 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1) |
||
479 | bondari | 90 | |
1766 | palkovsky | 91 | #define frame_alloc(order, flags) frame_alloc_generic(order, flags, NULL) |
786 | bondari | 92 | |
1 | jermar | 93 | extern void frame_init(void); |
1766 | palkovsky | 94 | extern void * frame_alloc_generic(__u8 order, int flags, int *pzone); |
1760 | palkovsky | 95 | extern void frame_free(__address frame); |
1236 | jermar | 96 | extern void frame_reference_add(pfn_t pfn); |
689 | bondari | 97 | |
822 | palkovsky | 98 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags); |
814 | palkovsky | 99 | void * frame_get_parent(pfn_t frame, int hint); |
100 | void frame_set_parent(pfn_t frame, void *data, int hint); |
||
820 | jermar | 101 | void frame_mark_unavailable(pfn_t start, count_t count); |
822 | palkovsky | 102 | __address zone_conf_size(count_t count); |
103 | void zone_merge(int z1, int z2); |
||
104 | void zone_merge_all(void); |
||
479 | bondari | 105 | |
106 | /* |
||
676 | bondari | 107 | * Console functions |
108 | */ |
||
109 | extern void zone_print_list(void); |
||
814 | palkovsky | 110 | void zone_print_one(int znum); |
676 | bondari | 111 | |
1 | jermar | 112 | #endif |
1702 | cejka | 113 | |
114 | /** @} |
||
115 | */ |
||
116 |