blob: 7493fc512c5a0a7cd25d111e20ddfc97a546f141 (
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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/trace/bufferpage.H $ */
/* */
/* IBM CONFIDENTIAL */
/* */
/* COPYRIGHT International Business Machines Corp. 2012 */
/* */
/* 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 otherwise */
/* divested of its trade secrets, irrespective of what has been */
/* deposited with the U.S. Copyright Office. */
/* */
/* Origin: 30 */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __TRACE_BUFFERPAGE_H
#define __TRACE_BUFFERPAGE_H
#include <trace/interface.H>
namespace TRACE
{
class Entry;
/** @struct BufferPage
*
* A structure which can be overlaid onto a page of memory to allocate
* entries within the page.
*/
struct BufferPage
{
BufferPage* next; //< Linked-list 'next' ptr.
BufferPage* prev; //< Linked-list 'prev' ptr.
uint32_t commonPage; //< Status used by daemon pages.
uint32_t usedSize; //< Size already allocated for entries.
char data[0]; //< Data for entries.
/** @brief Lockless-ly claim an entry from the page.
*
* @param[in] i_size - Size in bytes.
*
* @return Entry* or NULL, if not enough space.
*/
Entry* claimEntry(size_t i_size);
/** @brief Utility function to allocate a page.
*
* @param[in] i_common - Page is "common" from a daemon perspective.
*
* @return Pointer to page.
*/
static BufferPage* allocate(bool i_common = false);
/** @brief Utility function to free a page.
*
* @param[in] i_page - Page to deallocate.
*/
static void deallocate(BufferPage* i_page);
};
}
#endif
|
