blob: 7eda6ae25cf39a4f88973bf98b720037eaa9fdf7 (
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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/usr/trace/tracebuffer.C $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 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
#include <limits.h>
#include "tracebuffer.H"
TracePage* TracePage::setNext(TracePage* new_next)
{
return __sync_val_compare_and_swap(&this->next, NULL, new_next);
}
traceEntry* TracePage::claimEntry(size_t size)
{
// this->size will eventually wrap and it will suddenly look like there
// is free space?
size_t position = __sync_fetch_and_add(&this->size, size);
if (position > (PAGE_SIZE - sizeof(TracePage)))
{
return NULL;
}
else
{
return (traceEntry*)&((uint8_t*)this)[sizeof(TracePage) + position];
}
}
traceEntry* TraceBuffer::claimEntry(size_t size)
{
traceEntry* result = NULL;
TracePage* page = last;
while (result == NULL)
{
result = page->claimEntry(size);
if (NULL == result)
{
if (NULL != page->getNext())
{
__sync_bool_compare_and_swap(&this->last,
page, page->getNext());
page = page->getNext();
}
else
{
TracePage* new_page = new (malloc(PAGE_SIZE)) TracePage();
TracePage* prev = page;
while(prev != NULL)
{
prev = prev->setNext(new_page);
}
}
}
}
return result;
}
|
