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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* Copyright (C) 2008, 2009, 2011 Free Software Foundation, Inc.
Contributed by Richard Henderson <rth@redhat.com>.
This file is part of the GNU Transactional Memory Library (libitm).
Libitm is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Libitm is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License for
more details.
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.
You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
<http://www.gnu.org/licenses/>. */
#include "libitm_i.h"
namespace GTM HIDDEN {
struct gtm_undolog_entry
{
void *addr;
size_t len;
char saved[];
};
void
gtm_thread::commit_undolog ()
{
size_t i, n = undolog.size();
if (n > 0)
{
for (i = 0; i < n; ++i)
free (undolog[i]);
this->undolog.clear();
}
}
void
gtm_thread::rollback_undolog (size_t until_size)
{
size_t i, n = undolog.size();
if (n > 0)
{
for (i = n; i-- > until_size; )
{
gtm_undolog_entry *u = *undolog.pop();
if (u)
{
memcpy (u->addr, u->saved, u->len);
free (u);
}
}
}
}
/* Forget any references to PTR in the local log. */
void
gtm_thread::drop_references_undolog (const void *ptr, size_t len)
{
size_t i, n = undolog.size();
if (n > 0)
{
for (i = n; i > 0; i--)
{
gtm_undolog_entry *u = undolog[i];
/* ?? Do we need such granularity, or can we get away with
just comparing PTR and LEN. ?? */
if ((const char *)u->addr >= (const char *)ptr
&& ((const char *)u->addr + u->len <= (const char *)ptr + len))
{
free (u);
undolog[i] = NULL;
}
}
}
}
void ITM_REGPARM
GTM_LB (const void *ptr, size_t len)
{
gtm_thread *tx = gtm_thr();
gtm_undolog_entry *undo;
undo = (gtm_undolog_entry *)
xmalloc (sizeof (struct gtm_undolog_entry) + len);
undo->addr = (void *) ptr;
undo->len = len;
tx->undolog.push()[0] = undo;
memcpy (undo->saved, ptr, len);
}
} // namespace GTM
using namespace GTM;
/* ??? Use configure to determine if aliases are supported. Or convince
the compiler to not just tail call this, but actually generate the
same_body_alias itself. */
void ITM_REGPARM
_ITM_LB (const void *ptr, size_t len)
{
GTM_LB (ptr, len);
}
#define ITM_LOG_DEF(T) \
void ITM_REGPARM _ITM_L##T (const _ITM_TYPE_##T *ptr) \
{ GTM_LB (ptr, sizeof (*ptr)); }
ITM_LOG_DEF(U1)
ITM_LOG_DEF(U2)
ITM_LOG_DEF(U4)
ITM_LOG_DEF(U8)
ITM_LOG_DEF(F)
ITM_LOG_DEF(D)
ITM_LOG_DEF(E)
ITM_LOG_DEF(CF)
ITM_LOG_DEF(CD)
ITM_LOG_DEF(CE)
|
