Subversion Repositories HelenOS-historic

Rev

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