130 lines
2.9 KiB
C++
130 lines
2.9 KiB
C++
|
/* 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;
|
||
|
|
|
||
|
|
void _ITM_LB (const void *ptr, size_t len) ITM_REGPARM
|
||
|
|
__attribute__((alias("GTM_LB")));
|
||
|
|
|
||
|
|
#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)
|