source: mainline/generic/include/mm/frame.h@ cf585c9

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since cf585c9 was 328f2934, checked in by Sergey Bondari <bondari@…>, 20 years ago

Buddy allocator for physical memory complete implementation.
Tested on IA32, AMD64, MIPS32. RWLock Test #5 is not passed.
NOTE: Other architectures could be broken (but should not be)

  • Property mode set to 100644
File size: 4.5 KB
RevLine 
[f761f1eb]1/*
2 * Copyright (C) 2005 Jakub Jermar
[30187eb]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
30#ifndef __FRAME_H__
31#define __FRAME_H__
32
33#include <arch/types.h>
[2b50d7c]34#include <typedefs.h>
[7b43e11]35#include <list.h>
36#include <synch/spinlock.h>
[6e8b3c8]37#include <mm/buddy.h>
[f761f1eb]38
39#define FRAME_KA 1 /* skip frames conflicting with user address space */
40#define FRAME_PANIC 2 /* panic on failure */
41
[30187eb]42#define FRAME2ADDR(zone, frame) ((zone)->base + ((frame) - (zone)->frames) * FRAME_SIZE)
43#define ADDR2FRAME(zone, addr) (&((zone)->frames[((addr) - (zone)->base) / FRAME_SIZE]))
44#define FRAME_INDEX(zone, frame) ((count_t)((frame) - (zone)->frames))
[328f2934]45#define FRAME_INDEX_VALID(zone, index) (((index) >= 0) && ((index) < ((zone)->free_count + (zone)->busy_count)))
46#define IS_BUDDY_LEFT_BLOCK(zone, frame) ((FRAME_INDEX((zone), (frame)) % (1 << ((frame)->buddy_order + 1))) == 0)
47#define IS_BUDDY_RIGHT_BLOCK(zone, frame) ((FRAME_INDEX((zone), (frame)) % (1 << ((frame)->buddy_order + 1))) == (1 << (frame)->buddy_order))
[30187eb]48
[328f2934]49#define ZONE_BLACKLIST_SIZE 3
[6e8b3c8]50
[e456008]51struct zone {
52 link_t link; /**< link to previous and next zone */
[7b43e11]53
[e158717]54 spinlock_t lock; /**< this lock protects everything below */
55 __address base; /**< physical address of the first frame in the frames array */
56 frame_t *frames; /**< array of frame_t structures in this zone */
57 link_t free_head; /**< list of free frame_t structures */
58 count_t free_count; /**< number of frame_t structures in free list */
[4841104]59 count_t busy_count; /**< number of frame_t structures not in free list */
[6e8b3c8]60
[30187eb]61 buddy_system_t * buddy_system; /**< buddy system for the zone */
[7b43e11]62 int flags;
63};
64
65struct frame {
[4841104]66 count_t refcount; /**< when == 0, the frame is in free list */
67 link_t link; /**< link to zone free list when refcount == 0 */
[30187eb]68 __u8 buddy_order; /**< buddy system block order */
[6e8b3c8]69 link_t buddy_link; /**< link to the next free block inside one order*/
[adecf496]70};
[7b43e11]71
[328f2934]72struct region {
73 __address base;
74 size_t size;
75};
76
77extern region_t zone_blacklist[];
78extern count_t zone_blacklist_count;
79extern void frame_region_not_free(__address base, size_t size);
80extern void zone_create_in_region(__address base, size_t size);
81
[e456008]82extern spinlock_t zone_head_lock; /**< this lock protects zone_head list */
83extern link_t zone_head; /**< list of all zones in the system */
[7b43e11]84
[84dd253]85extern void zone_init(void);
86extern zone_t *zone_create(__address start, size_t size, int flags);
87extern void zone_attach(zone_t *zone);
[f761f1eb]88
89extern void frame_init(void);
[84dd253]90extern void frame_initialize(frame_t *frame, zone_t *zone);
[328f2934]91__address frame_alloc(int flags, __u8 order);
[f761f1eb]92extern void frame_free(__address addr);
[30187eb]93zone_t * get_zone_by_frame(frame_t * frame);
[f761f1eb]94
[6e8b3c8]95/*
96 * Buddy system operations
97 */
[594a468]98link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * buddy);
99link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block);
100link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * buddy_l, link_t * buddy_r);
101void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order);
102__u8 zone_buddy_get_order(buddy_system_t *b, link_t * block);
[328f2934]103void zone_buddy_mark_busy(buddy_system_t *b, link_t * block);
[6e8b3c8]104
[e456008]105/*
106 * TODO: Implement the following functions.
107 */
108extern frame_t *frame_reference(frame_t *frame);
109extern void frame_release(frame_t *frame);
110
[f761f1eb]111#endif
Note: See TracBrowser for help on using the repository browser.