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