| 1 | /*
|
|---|
| 2 | * Copyright (c) 2005 Jakub Jermar
|
|---|
| 3 | * Copyright (c) 2005 Sergey Bondari
|
|---|
| 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 |
|
|---|
| 30 | /** @addtogroup genericmm
|
|---|
| 31 | * @{
|
|---|
| 32 | */
|
|---|
| 33 | /** @file
|
|---|
| 34 | */
|
|---|
| 35 |
|
|---|
| 36 | #ifndef KERN_FRAME_H_
|
|---|
| 37 | #define KERN_FRAME_H_
|
|---|
| 38 |
|
|---|
| 39 | #include <arch/types.h>
|
|---|
| 40 | #include <adt/list.h>
|
|---|
| 41 | #include <synch/spinlock.h>
|
|---|
| 42 | #include <mm/buddy.h>
|
|---|
| 43 | #include <arch/mm/page.h>
|
|---|
| 44 | #include <arch/mm/frame.h>
|
|---|
| 45 |
|
|---|
| 46 | #define ONE_FRAME 0
|
|---|
| 47 | #define TWO_FRAMES 1
|
|---|
| 48 | #define FOUR_FRAMES 2
|
|---|
| 49 |
|
|---|
| 50 |
|
|---|
| 51 | #ifdef ARCH_STACK_FRAMES
|
|---|
| 52 | #define STACK_FRAMES ARCH_STACK_FRAMES
|
|---|
| 53 | #else
|
|---|
| 54 | #define STACK_FRAMES ONE_FRAME
|
|---|
| 55 | #endif
|
|---|
| 56 |
|
|---|
| 57 | /** Maximum number of zones in system. */
|
|---|
| 58 | #define ZONES_MAX 16
|
|---|
| 59 |
|
|---|
| 60 | /** Convert the frame address to kernel va. */
|
|---|
| 61 | #define FRAME_KA 0x1
|
|---|
| 62 | /** Do not panic and do not sleep on failure. */
|
|---|
| 63 | #define FRAME_ATOMIC 0x2
|
|---|
| 64 | /** Do not start reclaiming when no free memory. */
|
|---|
| 65 | #define FRAME_NO_RECLAIM 0x4
|
|---|
| 66 | /** Do not allocate above 4 GiB. */
|
|---|
| 67 | #define FRAME_LOW_4_GiB 0x8
|
|---|
| 68 |
|
|---|
| 69 | static inline uintptr_t PFN2ADDR(pfn_t frame)
|
|---|
| 70 | {
|
|---|
| 71 | return (uintptr_t) (frame << FRAME_WIDTH);
|
|---|
| 72 | }
|
|---|
| 73 |
|
|---|
| 74 | static inline pfn_t ADDR2PFN(uintptr_t addr)
|
|---|
| 75 | {
|
|---|
| 76 | return (pfn_t) (addr >> FRAME_WIDTH);
|
|---|
| 77 | }
|
|---|
| 78 |
|
|---|
| 79 | static inline count_t SIZE2FRAMES(size_t size)
|
|---|
| 80 | {
|
|---|
| 81 | if (!size)
|
|---|
| 82 | return 0;
|
|---|
| 83 | return (count_t) ((size - 1) >> FRAME_WIDTH) + 1;
|
|---|
| 84 | }
|
|---|
| 85 |
|
|---|
| 86 | static inline size_t FRAMES2SIZE(count_t frames)
|
|---|
| 87 | {
|
|---|
| 88 | return (size_t) (frames << FRAME_WIDTH);
|
|---|
| 89 | }
|
|---|
| 90 |
|
|---|
| 91 | #define IS_BUDDY_ORDER_OK(index, order) \
|
|---|
| 92 | ((~(((unative_t) -1) << (order)) & (index)) == 0)
|
|---|
| 93 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) \
|
|---|
| 94 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)
|
|---|
| 95 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \
|
|---|
| 96 | (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)
|
|---|
| 97 | #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \
|
|---|
| 98 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)
|
|---|
| 99 | #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \
|
|---|
| 100 | (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)
|
|---|
| 101 |
|
|---|
| 102 | #define frame_alloc(order, flags) \
|
|---|
| 103 | frame_alloc_generic(order, flags, NULL)
|
|---|
| 104 |
|
|---|
| 105 | extern void frame_init(void);
|
|---|
| 106 | extern void *frame_alloc_generic(uint8_t, int, unsigned int *);
|
|---|
| 107 | extern void frame_free(uintptr_t);
|
|---|
| 108 | extern void frame_reference_add(pfn_t);
|
|---|
| 109 |
|
|---|
| 110 | extern int zone_create(pfn_t, count_t, pfn_t, int);
|
|---|
| 111 | extern void *frame_get_parent(pfn_t, unsigned int);
|
|---|
| 112 | extern void frame_set_parent(pfn_t, void *, unsigned int);
|
|---|
| 113 | extern void frame_mark_unavailable(pfn_t, count_t);
|
|---|
| 114 | extern uintptr_t zone_conf_size(count_t);
|
|---|
| 115 | extern void zone_merge(unsigned int, unsigned int);
|
|---|
| 116 | extern void zone_merge_all(void);
|
|---|
| 117 | extern uint64_t zone_total_size(void);
|
|---|
| 118 |
|
|---|
| 119 | /*
|
|---|
| 120 | * Console functions
|
|---|
| 121 | */
|
|---|
| 122 | extern void zone_print_list(void);
|
|---|
| 123 | extern void zone_print_one(unsigned int);
|
|---|
| 124 |
|
|---|
| 125 | #endif
|
|---|
| 126 |
|
|---|
| 127 | /** @}
|
|---|
| 128 | */
|
|---|