[f761f1eb] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2005 Jakub Jermar
|
---|
| 3 | * Copyright (c) 2005 Sergey Bondari
|
---|
[f761f1eb] | 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 |
|
---|
[32fffef0] | 30 | /** @addtogroup genericmm
|
---|
[b45c443] | 31 | * @{
|
---|
| 32 | */
|
---|
| 33 | /** @file
|
---|
| 34 | */
|
---|
| 35 |
|
---|
[32fffef0] | 36 | #ifndef KERN_FRAME_H_
|
---|
| 37 | #define KERN_FRAME_H_
|
---|
[f761f1eb] | 38 |
|
---|
| 39 | #include <arch/types.h>
|
---|
[2b50d7c] | 40 | #include <typedefs.h>
|
---|
[5c9a08b] | 41 | #include <adt/list.h>
|
---|
[7b43e11] | 42 | #include <synch/spinlock.h>
|
---|
[6e8b3c8] | 43 | #include <mm/buddy.h>
|
---|
[085d973] | 44 | #include <arch/mm/page.h>
|
---|
[a82500ce] | 45 | #include <arch/mm/frame.h>
|
---|
[f761f1eb] | 46 |
|
---|
[d43d2f7] | 47 | #define ONE_FRAME 0
|
---|
[a82500ce] | 48 | #define TWO_FRAMES 1
|
---|
| 49 |
|
---|
| 50 | #ifdef ARCH_STACK_FRAMES
|
---|
| 51 | #define STACK_FRAMES ARCH_STACK_FRAMES
|
---|
| 52 | #else
|
---|
| 53 | #define STACK_FRAMES ONE_FRAME
|
---|
| 54 | #endif
|
---|
| 55 |
|
---|
[b43eaba0] | 56 | /** Maximum number of zones in system. */
|
---|
| 57 | #define ZONES_MAX 16
|
---|
[085d973] | 58 |
|
---|
[b43eaba0] | 59 | /** If possible, merge with neighbouring zones. */
|
---|
| 60 | #define ZONE_JOIN 0x1
|
---|
[085d973] | 61 |
|
---|
[b43eaba0] | 62 | /** Convert the frame address to kernel va. */
|
---|
| 63 | #define FRAME_KA 0x1
|
---|
| 64 | /** Do not panic and do not sleep on failure. */
|
---|
| 65 | #define FRAME_ATOMIC 0x2
|
---|
| 66 | /** Do not start reclaiming when no free memory. */
|
---|
| 67 | #define FRAME_NO_RECLAIM 0x4
|
---|
[f275cb3] | 68 |
|
---|
[7f1c620] | 69 | static inline uintptr_t PFN2ADDR(pfn_t frame)
|
---|
[085d973] | 70 | {
|
---|
[b43eaba0] | 71 | return (uintptr_t) (frame << FRAME_WIDTH);
|
---|
[085d973] | 72 | }
|
---|
| 73 |
|
---|
[7f1c620] | 74 | static inline pfn_t ADDR2PFN(uintptr_t addr)
|
---|
[085d973] | 75 | {
|
---|
[b43eaba0] | 76 | return (pfn_t) (addr >> FRAME_WIDTH);
|
---|
[085d973] | 77 | }
|
---|
| 78 |
|
---|
[42744880] | 79 | static inline count_t SIZE2FRAMES(size_t size)
|
---|
[085d973] | 80 | {
|
---|
| 81 | if (!size)
|
---|
| 82 | return 0;
|
---|
[b43eaba0] | 83 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1;
|
---|
[085d973] | 84 | }
|
---|
| 85 |
|
---|
[b43eaba0] | 86 | #define IS_BUDDY_ORDER_OK(index, order) \
|
---|
| 87 | ((~(((unative_t) -1) << (order)) & (index)) == 0)
|
---|
| 88 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \
|
---|
| 89 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)
|
---|
| 90 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \
|
---|
| 91 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)
|
---|
| 92 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \
|
---|
| 93 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)
|
---|
| 94 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \
|
---|
| 95 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)
|
---|
[30187eb] | 96 |
|
---|
[b43eaba0] | 97 | #define frame_alloc(order, flags) \
|
---|
| 98 | frame_alloc_generic(order, flags, NULL)
|
---|
[9b9e385] | 99 |
|
---|
[f761f1eb] | 100 | extern void frame_init(void);
|
---|
[b43eaba0] | 101 | extern void *frame_alloc_generic(uint8_t order, int flags, int *pzone);
|
---|
[7f1c620] | 102 | extern void frame_free(uintptr_t frame);
|
---|
[f3ac636] | 103 | extern void frame_reference_add(pfn_t pfn);
|
---|
[f275cb3] | 104 |
|
---|
[bb68433] | 105 | extern int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags);
|
---|
[b43eaba0] | 106 | void *frame_get_parent(pfn_t frame, int hint);
|
---|
[085d973] | 107 | void frame_set_parent(pfn_t frame, void *data, int hint);
|
---|
[42744880] | 108 | void frame_mark_unavailable(pfn_t start, count_t count);
|
---|
[7f1c620] | 109 | uintptr_t zone_conf_size(count_t count);
|
---|
[bb68433] | 110 | void zone_merge(int z1, int z2);
|
---|
| 111 | void zone_merge_all(void);
|
---|
[dfd9186] | 112 |
|
---|
| 113 | /*
|
---|
| 114 | * Console functions
|
---|
| 115 | */
|
---|
| 116 | extern void zone_print_list(void);
|
---|
[085d973] | 117 | void zone_print_one(int znum);
|
---|
[dfd9186] | 118 |
|
---|
[f761f1eb] | 119 | #endif
|
---|
[b45c443] | 120 |
|
---|
[32fffef0] | 121 | /** @}
|
---|
[b45c443] | 122 | */
|
---|