mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-03 18:13:01 +00:00
461cc5c003
Sync VEX/LICENSE.GPL with top-level COPYING file. We used 3 different addresses for writing to the FSF to receive a copy of the GPL. Replace all different variants with an URL <http://www.gnu.org/licenses/>. The following files might still have some slightly different (L)GPL copyright notice because they were derived from other programs: - files under coregrind/m_demangle which come from libiberty: cplus-dem.c, d-demangle.c, demangle.h, rust-demangle.c, safe-ctype.c and safe-ctype.h - coregrind/m_demangle/dyn-string.[hc] derived from GCC. - coregrind/m_demangle/ansidecl.h derived from glibc. - VEX files for FMA detived from glibc: host_generic_maddf.h and host_generic_maddf.c - files under coregrin/m_debuginfo derived from LZO: lzoconf.h, lzodefs.h, minilzo-inl.c and minilzo.h - files under coregrind/m_gdbserver detived from GDB: gdb/signals.h, inferiors.c, regcache.c, regcache.h, regdef.h, remote-utils.c, server.c, server.h, signals.c, target.c, target.h and utils.c Plus the following test files: - none/tests/ppc32/testVMX.c derived from testVMX. - ppc tests derived from QEMU: jm-insns.c, ppc64_helpers.h and test_isa_3_0.c - tests derived from bzip2 (with embedded GPL text in code): hackedbz2.c, origin5-bz2.c, varinfo6.c - tests detived from glibc: str_tester.c, pth_atfork1.c - test detived from GCC libgomp: tc17_sembar.c - performance tests derived from bzip2 or tinycc (with embedded GPL text in code): bz2.c, test_input_for_tinycc.c and tinycc.c
126 lines
4.1 KiB
C
126 lines
4.1 KiB
C
/*
|
|
This file is part of drd, a thread error detector.
|
|
|
|
Copyright (C) 2006-2017 Bart Van Assche <bvanassche@acm.org>.
|
|
|
|
This program 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 2 of the
|
|
License, or (at your option) any later version.
|
|
|
|
This program 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.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
The GNU General Public License is contained in the file COPYING.
|
|
*/
|
|
|
|
|
|
#ifndef __DRD_VC_H
|
|
#define __DRD_VC_H
|
|
|
|
|
|
/*
|
|
* DRD vector clock implementation:
|
|
* - One counter per thread.
|
|
* - A vector clock is implemented as multiple pairs of (thread id, counter).
|
|
* - Pairs are stored in an array sorted by thread id.
|
|
*
|
|
* Semantics:
|
|
* - Each time a thread performs an action that implies an ordering between
|
|
* intra-thread events, the counter of that thread is incremented.
|
|
* - Vector clocks are compared by comparing all counters of all threads.
|
|
* - When a thread synchronization action is performed that guarantees that
|
|
* new actions of the current thread are executed after the actions of the
|
|
* other thread, the vector clock of the synchronization object and the
|
|
* current thread are combined (by taking the component-wise maximum).
|
|
* - A vector clock is incremented during actions such as
|
|
* pthread_create(), pthread_mutex_unlock(), sem_post(). (Actions where
|
|
* an inter-thread ordering "arrow" starts).
|
|
*/
|
|
|
|
|
|
#include "pub_tool_basics.h" /* Addr, SizeT */
|
|
#include "drd_basics.h" /* DrdThreadId */
|
|
#include "pub_tool_libcassert.h" /* tl_assert() */
|
|
|
|
|
|
#define VC_PREALLOCATED 8
|
|
|
|
|
|
/** Vector clock element. */
|
|
typedef struct
|
|
{
|
|
DrdThreadId threadid;
|
|
UInt count;
|
|
} VCElem;
|
|
|
|
typedef struct
|
|
{
|
|
unsigned capacity; /**< number of elements allocated for array vc. */
|
|
unsigned size; /**< number of elements used of array vc. */
|
|
VCElem* vc; /**< vector clock elements. */
|
|
VCElem preallocated[VC_PREALLOCATED];
|
|
} VectorClock;
|
|
|
|
|
|
void DRD_(vc_init)(VectorClock* const vc,
|
|
const VCElem* const vcelem,
|
|
const unsigned size);
|
|
void DRD_(vc_cleanup)(VectorClock* const vc);
|
|
void DRD_(vc_copy)(VectorClock* const new, const VectorClock* const rhs);
|
|
void DRD_(vc_assign)(VectorClock* const lhs, const VectorClock* const rhs);
|
|
void DRD_(vc_increment)(VectorClock* const vc, DrdThreadId const tid);
|
|
static __inline__
|
|
Bool DRD_(vc_lte)(const VectorClock* const vc1,
|
|
const VectorClock* const vc2);
|
|
Bool DRD_(vc_ordered)(const VectorClock* const vc1,
|
|
const VectorClock* const vc2);
|
|
void DRD_(vc_min)(VectorClock* const result,
|
|
const VectorClock* const rhs);
|
|
void DRD_(vc_combine)(VectorClock* const result,
|
|
const VectorClock* const rhs);
|
|
void DRD_(vc_print)(const VectorClock* const vc);
|
|
HChar* DRD_(vc_aprint)(const VectorClock* const vc);
|
|
void DRD_(vc_check)(const VectorClock* const vc);
|
|
void DRD_(vc_test)(void);
|
|
|
|
|
|
|
|
/**
|
|
* @return True if all thread id's that are present in vc1 also exist in
|
|
* vc2, and if additionally all corresponding counters in v2 are higher or
|
|
* equal.
|
|
*/
|
|
static __inline__
|
|
Bool DRD_(vc_lte)(const VectorClock* const vc1, const VectorClock* const vc2)
|
|
{
|
|
unsigned i;
|
|
unsigned j = 0;
|
|
|
|
for (i = 0; i < vc1->size; i++)
|
|
{
|
|
while (j < vc2->size && vc2->vc[j].threadid < vc1->vc[i].threadid)
|
|
j++;
|
|
if (j >= vc2->size || vc2->vc[j].threadid > vc1->vc[i].threadid)
|
|
return False;
|
|
#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
|
|
/*
|
|
* This assert statement has been commented out because of performance
|
|
* reasons.
|
|
*/
|
|
tl_assert(j < vc2->size && vc2->vc[j].threadid == vc1->vc[i].threadid);
|
|
#endif
|
|
if (vc1->vc[i].count > vc2->vc[j].count)
|
|
return False;
|
|
}
|
|
return True;
|
|
}
|
|
|
|
|
|
#endif /* __DRD_VC_H */
|