blob: aec4470d26851e5b03eef4bbb45ff052652c0a06 (
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
// 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>
#include <builtins.h>
#include <kernel/console.H>
#include <util/align.H>
#include <sys/vfs.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);
/**
* Query state for available memory
* @returns percent of pages available
*/
static uint64_t queryAvail();
/**
* Coalesce adjacent free memory blocks
* @pre This function can only be called from kernel space and
* requires that all other processes are quiesced
*/
static void coalesce( void );
/**
* Retrieve the number of available pages
* @returns Number of free pages
*/
static uint64_t availPages();
enum
{
MEMLEN = VmmManager::HTABORG,
BUCKETS = 16,
};
protected:
PageManager();
~PageManager() {};
private:
void* _allocatePage(size_t);
void _freePage(void*, size_t);
void _coalesce( void ); //!< see coalesce()
/** see queryAvail() */
ALWAYS_INLINE uint64_t _queryAvail() const
{
return (100*iv_pagesAvail)/iv_pagesTotal;
}
ALWAYS_INLINE uint64_t firstPageAddr( void )
{
return ALIGN_PAGE(VFS_LAST_ADDRESS);
}
/** see availPages() */
ALWAYS_INLINE uint64_t _availPages() const
{
return iv_pagesAvail;
}
/** Statistics on number of free pages (for debug) */
uint64_t iv_pagesAvail;
/** Total number of pages */
uint64_t iv_pagesTotal;
static size_t cv_coalesce_count; //!< running coalesced counter
static size_t cv_low_page_count; //!< lowest page count
struct page_t
{
page_t* next; //!< Next block of pages
page_t* prev; //!< Prev block of pages
page_t* key; //!< Key for pqueue
};
Util::Lockfree::Stack<page_t> first_page[BUCKETS];
page_t* pop_bucket(size_t);
void push_bucket(page_t*, size_t);
};
#endif
|
