blob: eeed535e021038cceeca15e92de6684c8723d33f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/include/kernel/pagemgr.H $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2010 - 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#ifndef __KERNEL_PAGEMGR_H
#define __KERNEL_PAGEMGR_H
#include <stdint.h>
#include <limits.h>
#include <util/lockfree/stack.H>
#include <kernel/vmmmgr.H>
/** @class PageManager
* @brief Manages the allocation of memory pages.
*/
class PageManager
{
public:
static void init();
static void* allocatePage(size_t n = 1);
static void freePage(void*, size_t n = 1);
enum
{
MEMLEN = VmmManager::HTABORG,
BUCKETS = 16,
};
protected:
PageManager();
~PageManager() {};
private:
void* _allocatePage(size_t);
void _freePage(void*, size_t);
/** Statistics on number of free pages (for debug) */
uint64_t iv_pagesAvail;
struct page_t
{
page_t* next;
};
Util::Lockfree::Stack<page_t> first_page[BUCKETS];
page_t* pop_bucket(size_t);
void push_bucket(page_t*, size_t);
};
#endif
|
