blob: c2f1a85b33aff728ab99c6b435e2d276d2a38dd4 [file] [log] [blame]
sewardjaf44c822007-11-25 14:01:38 +00001/*
bart86562bd2009-02-16 19:43:56 +00002 This file is part of drd, a thread error detector.
sewardjaf44c822007-11-25 14:01:38 +00003
bart922304f2011-03-13 12:02:44 +00004 Copyright (C) 2006-2011 Bart Van Assche <bvanassche@acm.org>.
sewardjaf44c822007-11-25 14:01:38 +00005
6 This program is free software; you can redistribute it and/or
7 modify it under the terms of the GNU General Public License as
8 published by the Free Software Foundation; either version 2 of the
9 License, or (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
19 02111-1307, USA.
20
21 The GNU General Public License is contained in the file COPYING.
22*/
23
24
25#include "drd_error.h"
bart09dc13f2009-02-14 15:13:31 +000026#include "drd_barrier.h"
bartd2c5eae2009-02-21 15:27:04 +000027#include "drd_clientobj.h"
bart09dc13f2009-02-14 15:13:31 +000028#include "drd_cond.h"
29#include "drd_mutex.h"
sewardjaf44c822007-11-25 14:01:38 +000030#include "drd_segment.h"
bart09dc13f2009-02-14 15:13:31 +000031#include "drd_semaphore.h"
sewardjaf44c822007-11-25 14:01:38 +000032#include "drd_suppression.h"
33#include "drd_thread.h"
bart82195c12008-04-13 17:35:08 +000034#include "pub_tool_vki.h"
sewardjaf44c822007-11-25 14:01:38 +000035#include "pub_tool_basics.h" // Addr, SizeT
sewardjaf44c822007-11-25 14:01:38 +000036#include "pub_tool_libcassert.h" // tl_assert()
37#include "pub_tool_libcbase.h" // VG_(strlen)()
38#include "pub_tool_libcprint.h" // VG_(printf)()
bart82195c12008-04-13 17:35:08 +000039#include "pub_tool_libcproc.h" // VG_(getenv)()
sewardjaf44c822007-11-25 14:01:38 +000040#include "pub_tool_machine.h"
41#include "pub_tool_mallocfree.h" // VG_(malloc)(), VG_(free)()
sewardj85642922008-01-14 11:54:56 +000042#include "pub_tool_options.h" // VG_(clo_backtrace_size)
sewardjaf44c822007-11-25 14:01:38 +000043#include "pub_tool_threadstate.h" // VG_(get_pthread_id)()
44
bart32ba2082008-06-05 08:53:42 +000045
sewardjaf44c822007-11-25 14:01:38 +000046
bart324a23b2009-02-15 12:14:52 +000047/* Local functions. */
sewardjaf44c822007-11-25 14:01:38 +000048
bart86a87df2009-03-04 19:26:47 +000049static void thread_append_segment(const DrdThreadId tid, Segment* const sg);
50static void thread_discard_segment(const DrdThreadId tid, Segment* const sg);
51static void thread_compute_conflict_set(struct bitmap** conflict_set,
52 const DrdThreadId tid);
bart8f822af2009-06-08 18:20:42 +000053static Bool thread_conflict_set_up_to_date(const DrdThreadId tid);
sewardjaf44c822007-11-25 14:01:38 +000054
55
bart324a23b2009-02-15 12:14:52 +000056/* Local variables. */
sewardjaf44c822007-11-25 14:01:38 +000057
bart86a87df2009-03-04 19:26:47 +000058static ULong s_context_switch_count;
59static ULong s_discard_ordered_segments_count;
bart54803fe2009-06-21 09:26:27 +000060static ULong s_compute_conflict_set_count;
bart86a87df2009-03-04 19:26:47 +000061static ULong s_update_conflict_set_count;
barte5214662009-06-21 11:51:23 +000062static ULong s_update_conflict_set_new_sg_count;
63static ULong s_update_conflict_set_sync_count;
64static ULong s_update_conflict_set_join_count;
bart86a87df2009-03-04 19:26:47 +000065static ULong s_conflict_set_bitmap_creation_count;
66static ULong s_conflict_set_bitmap2_creation_count;
67static ThreadId s_vg_running_tid = VG_INVALID_THREADID;
bart324a23b2009-02-15 12:14:52 +000068DrdThreadId DRD_(g_drd_running_tid) = DRD_INVALID_THREADID;
69ThreadInfo DRD_(g_threadinfo)[DRD_N_THREADS];
70struct bitmap* DRD_(g_conflict_set);
bart86a87df2009-03-04 19:26:47 +000071static Bool s_trace_context_switches = False;
72static Bool s_trace_conflict_set = False;
bart8f822af2009-06-08 18:20:42 +000073static Bool s_trace_conflict_set_bm = False;
bart86a87df2009-03-04 19:26:47 +000074static Bool s_trace_fork_join = False;
75static Bool s_segment_merging = True;
bart8f822af2009-06-08 18:20:42 +000076static Bool s_new_segments_since_last_merge;
bart6f1d7162009-06-24 18:34:10 +000077static int s_segment_merge_interval = 10;
bart6d956dc2011-07-28 09:54:37 +000078static unsigned s_join_list_vol = 10;
79static unsigned s_deletion_head;
80static unsigned s_deletion_tail;
sewardjaf44c822007-11-25 14:01:38 +000081
82
bart324a23b2009-02-15 12:14:52 +000083/* Function definitions. */
sewardjaf44c822007-11-25 14:01:38 +000084
bart86a87df2009-03-04 19:26:47 +000085/** Enables/disables context switch tracing. */
bart62a784c2009-02-15 13:11:14 +000086void DRD_(thread_trace_context_switches)(const Bool t)
bart26f73e12008-02-24 18:37:08 +000087{
bartbedfd232009-03-26 19:07:15 +000088 tl_assert(t == False || t == True);
89 s_trace_context_switches = t;
bart26f73e12008-02-24 18:37:08 +000090}
91
bart86a87df2009-03-04 19:26:47 +000092/** Enables/disables conflict set tracing. */
bart62a784c2009-02-15 13:11:14 +000093void DRD_(thread_trace_conflict_set)(const Bool t)
bart26f73e12008-02-24 18:37:08 +000094{
bartbedfd232009-03-26 19:07:15 +000095 tl_assert(t == False || t == True);
96 s_trace_conflict_set = t;
bart26f73e12008-02-24 18:37:08 +000097}
98
bart8f822af2009-06-08 18:20:42 +000099/** Enables/disables conflict set bitmap tracing. */
100void DRD_(thread_trace_conflict_set_bm)(const Bool t)
101{
102 tl_assert(t == False || t == True);
103 s_trace_conflict_set_bm = t;
104}
105
bart86a87df2009-03-04 19:26:47 +0000106/** Report whether fork/join tracing is enabled. */
bart09dc13f2009-02-14 15:13:31 +0000107Bool DRD_(thread_get_trace_fork_join)(void)
108{
bartbedfd232009-03-26 19:07:15 +0000109 return s_trace_fork_join;
bart09dc13f2009-02-14 15:13:31 +0000110}
111
bart86a87df2009-03-04 19:26:47 +0000112/** Enables/disables fork/join tracing. */
bart09dc13f2009-02-14 15:13:31 +0000113void DRD_(thread_set_trace_fork_join)(const Bool t)
114{
bartbedfd232009-03-26 19:07:15 +0000115 tl_assert(t == False || t == True);
116 s_trace_fork_join = t;
bart09dc13f2009-02-14 15:13:31 +0000117}
118
bart86a87df2009-03-04 19:26:47 +0000119/** Enables/disables segment merging. */
bart62a784c2009-02-15 13:11:14 +0000120void DRD_(thread_set_segment_merging)(const Bool m)
barta9c37392008-03-22 09:38:48 +0000121{
bartbedfd232009-03-26 19:07:15 +0000122 tl_assert(m == False || m == True);
123 s_segment_merging = m;
barta9c37392008-03-22 09:38:48 +0000124}
125
bart8f822af2009-06-08 18:20:42 +0000126/** Get the segment merging interval. */
127int DRD_(thread_get_segment_merge_interval)(void)
128{
129 return s_segment_merge_interval;
130}
131
132/** Set the segment merging interval. */
133void DRD_(thread_set_segment_merge_interval)(const int i)
134{
135 s_segment_merge_interval = i;
136}
137
bart6d956dc2011-07-28 09:54:37 +0000138void DRD_(thread_set_join_list_vol)(const int jlv)
139{
140 s_join_list_vol = jlv;
141}
142
barte278ab52012-01-24 18:28:55 +0000143void DRD_(thread_init)(void)
144{
barte278ab52012-01-24 18:28:55 +0000145}
146
sewardjaf44c822007-11-25 14:01:38 +0000147/**
bart86a87df2009-03-04 19:26:47 +0000148 * Convert Valgrind's ThreadId into a DrdThreadId.
149 *
150 * @return DRD thread ID upon success and DRD_INVALID_THREADID if the passed
151 * Valgrind ThreadId does not yet exist.
bart324a23b2009-02-15 12:14:52 +0000152 */
bart62a784c2009-02-15 13:11:14 +0000153DrdThreadId DRD_(VgThreadIdToDrdThreadId)(const ThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000154{
bartbedfd232009-03-26 19:07:15 +0000155 int i;
sewardjaf44c822007-11-25 14:01:38 +0000156
bartbedfd232009-03-26 19:07:15 +0000157 if (tid == VG_INVALID_THREADID)
158 return DRD_INVALID_THREADID;
sewardjaf44c822007-11-25 14:01:38 +0000159
bartbedfd232009-03-26 19:07:15 +0000160 for (i = 1; i < DRD_N_THREADS; i++)
161 {
162 if (DRD_(g_threadinfo)[i].vg_thread_exists == True
163 && DRD_(g_threadinfo)[i].vg_threadid == tid)
164 {
165 return i;
166 }
167 }
sewardjaf44c822007-11-25 14:01:38 +0000168
bartbedfd232009-03-26 19:07:15 +0000169 return DRD_INVALID_THREADID;
sewardjaf44c822007-11-25 14:01:38 +0000170}
171
bart86a87df2009-03-04 19:26:47 +0000172/** Allocate a new DRD thread ID for the specified Valgrind thread ID. */
bart62a784c2009-02-15 13:11:14 +0000173static DrdThreadId DRD_(VgThreadIdToNewDrdThreadId)(const ThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000174{
bartbedfd232009-03-26 19:07:15 +0000175 int i;
sewardjaf44c822007-11-25 14:01:38 +0000176
bartbedfd232009-03-26 19:07:15 +0000177 tl_assert(DRD_(VgThreadIdToDrdThreadId)(tid) == DRD_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +0000178
bartbedfd232009-03-26 19:07:15 +0000179 for (i = 1; i < DRD_N_THREADS; i++)
180 {
bart6d956dc2011-07-28 09:54:37 +0000181 if (!DRD_(g_threadinfo)[i].valid)
bartbedfd232009-03-26 19:07:15 +0000182 {
183 tl_assert(! DRD_(IsValidDrdThreadId)(i));
bart86a87df2009-03-04 19:26:47 +0000184
bart6d956dc2011-07-28 09:54:37 +0000185 DRD_(g_threadinfo)[i].valid = True;
bartbedfd232009-03-26 19:07:15 +0000186 DRD_(g_threadinfo)[i].vg_thread_exists = True;
187 DRD_(g_threadinfo)[i].vg_threadid = tid;
188 DRD_(g_threadinfo)[i].pt_threadid = INVALID_POSIX_THREADID;
189 DRD_(g_threadinfo)[i].stack_min = 0;
190 DRD_(g_threadinfo)[i].stack_min_min = 0;
191 DRD_(g_threadinfo)[i].stack_startup = 0;
192 DRD_(g_threadinfo)[i].stack_max = 0;
bartd45d9952009-05-31 18:53:54 +0000193 DRD_(thread_set_name)(i, "");
bart383d6132010-09-02 14:43:18 +0000194 DRD_(g_threadinfo)[i].on_alt_stack = False;
bartd45d9952009-05-31 18:53:54 +0000195 DRD_(g_threadinfo)[i].is_recording_loads = True;
196 DRD_(g_threadinfo)[i].is_recording_stores = True;
bartdd75cdf2009-07-24 08:20:10 +0000197 DRD_(g_threadinfo)[i].pthread_create_nesting_level = 0;
bartbedfd232009-03-26 19:07:15 +0000198 DRD_(g_threadinfo)[i].synchr_nesting = 0;
bart6d956dc2011-07-28 09:54:37 +0000199 DRD_(g_threadinfo)[i].deletion_seq = s_deletion_tail - 1;
bart91b7ec32012-01-25 20:36:27 +0000200 tl_assert(DRD_(g_threadinfo)[i].sg_first == NULL);
201 tl_assert(DRD_(g_threadinfo)[i].sg_last == NULL);
bart86a87df2009-03-04 19:26:47 +0000202
bartbedfd232009-03-26 19:07:15 +0000203 tl_assert(DRD_(IsValidDrdThreadId)(i));
bart86a87df2009-03-04 19:26:47 +0000204
bartbedfd232009-03-26 19:07:15 +0000205 return i;
206 }
207 }
sewardjaf44c822007-11-25 14:01:38 +0000208
bart3c9afb12009-07-24 11:11:30 +0000209 VG_(printf)(
210"\nSorry, but the maximum number of threads supported by DRD has been exceeded."
211"Aborting.\n");
212
bartbedfd232009-03-26 19:07:15 +0000213 tl_assert(False);
sewardjaf44c822007-11-25 14:01:38 +0000214
bartbedfd232009-03-26 19:07:15 +0000215 return DRD_INVALID_THREADID;
sewardjaf44c822007-11-25 14:01:38 +0000216}
217
bart86a87df2009-03-04 19:26:47 +0000218/** Convert a POSIX thread ID into a DRD thread ID. */
bart62a784c2009-02-15 13:11:14 +0000219DrdThreadId DRD_(PtThreadIdToDrdThreadId)(const PThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000220{
bartbedfd232009-03-26 19:07:15 +0000221 int i;
sewardjaf44c822007-11-25 14:01:38 +0000222
bartb48bde22009-07-31 08:26:17 +0000223 if (tid != INVALID_POSIX_THREADID)
bartbedfd232009-03-26 19:07:15 +0000224 {
bartb48bde22009-07-31 08:26:17 +0000225 for (i = 1; i < DRD_N_THREADS; i++)
bartbedfd232009-03-26 19:07:15 +0000226 {
bartb48bde22009-07-31 08:26:17 +0000227 if (DRD_(g_threadinfo)[i].posix_thread_exists
228 && DRD_(g_threadinfo)[i].pt_threadid == tid)
229 {
230 return i;
231 }
bartbedfd232009-03-26 19:07:15 +0000232 }
233 }
234 return DRD_INVALID_THREADID;
sewardjaf44c822007-11-25 14:01:38 +0000235}
236
bart86a87df2009-03-04 19:26:47 +0000237/** Convert a DRD thread ID into a Valgrind thread ID. */
bart62a784c2009-02-15 13:11:14 +0000238ThreadId DRD_(DrdThreadIdToVgThreadId)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000239{
bartbedfd232009-03-26 19:07:15 +0000240 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
241 && tid != DRD_INVALID_THREADID);
bart8f822af2009-06-08 18:20:42 +0000242
bartbedfd232009-03-26 19:07:15 +0000243 return (DRD_(g_threadinfo)[tid].vg_thread_exists
244 ? DRD_(g_threadinfo)[tid].vg_threadid
245 : VG_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +0000246}
247
bart8f822af2009-06-08 18:20:42 +0000248#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
bart324a23b2009-02-15 12:14:52 +0000249/**
250 * Sanity check of the doubly linked list of segments referenced by a
251 * ThreadInfo struct.
252 * @return True if sane, False if not.
sewardjaf44c822007-11-25 14:01:38 +0000253 */
bart62a784c2009-02-15 13:11:14 +0000254static Bool DRD_(sane_ThreadInfo)(const ThreadInfo* const ti)
sewardjaf44c822007-11-25 14:01:38 +0000255{
bartbedfd232009-03-26 19:07:15 +0000256 Segment* p;
bart8f822af2009-06-08 18:20:42 +0000257
bartbedfd232009-03-26 19:07:15 +0000258 for (p = ti->first; p; p = p->next) {
259 if (p->next && p->next->prev != p)
260 return False;
261 if (p->next == 0 && p != ti->last)
262 return False;
263 }
264 for (p = ti->last; p; p = p->prev) {
265 if (p->prev && p->prev->next != p)
266 return False;
267 if (p->prev == 0 && p != ti->first)
268 return False;
269 }
270 return True;
sewardjaf44c822007-11-25 14:01:38 +0000271}
bart23d3a4e2008-04-05 12:53:00 +0000272#endif
sewardjaf44c822007-11-25 14:01:38 +0000273
bart439c55f2009-02-15 10:38:37 +0000274/**
275 * Create the first segment for a newly started thread.
276 *
277 * This function is called from the handler installed via
278 * VG_(track_pre_thread_ll_create)(). The Valgrind core invokes this handler
279 * from the context of the creator thread, before the new thread has been
280 * created.
bart86a87df2009-03-04 19:26:47 +0000281 *
282 * @param[in] creator DRD thread ID of the creator thread.
283 * @param[in] vg_created Valgrind thread ID of the created thread.
284 *
285 * @return DRD thread ID of the created thread.
bart439c55f2009-02-15 10:38:37 +0000286 */
bart62a784c2009-02-15 13:11:14 +0000287DrdThreadId DRD_(thread_pre_create)(const DrdThreadId creator,
288 const ThreadId vg_created)
sewardjaf44c822007-11-25 14:01:38 +0000289{
bartbedfd232009-03-26 19:07:15 +0000290 DrdThreadId created;
sewardjaf44c822007-11-25 14:01:38 +0000291
bartbedfd232009-03-26 19:07:15 +0000292 tl_assert(DRD_(VgThreadIdToDrdThreadId)(vg_created) == DRD_INVALID_THREADID);
293 created = DRD_(VgThreadIdToNewDrdThreadId)(vg_created);
294 tl_assert(0 <= (int)created && created < DRD_N_THREADS
295 && created != DRD_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +0000296
bart91b7ec32012-01-25 20:36:27 +0000297 tl_assert(DRD_(g_threadinfo)[created].sg_first == NULL);
298 tl_assert(DRD_(g_threadinfo)[created].sg_last == NULL);
bart8f822af2009-06-08 18:20:42 +0000299 /* Create an initial segment for the newly created thread. */
bartbedfd232009-03-26 19:07:15 +0000300 thread_append_segment(created, DRD_(sg_new)(creator, created));
sewardjaf44c822007-11-25 14:01:38 +0000301
bartbedfd232009-03-26 19:07:15 +0000302 return created;
sewardjaf44c822007-11-25 14:01:38 +0000303}
304
bart439c55f2009-02-15 10:38:37 +0000305/**
bart86a87df2009-03-04 19:26:47 +0000306 * Initialize DRD_(g_threadinfo)[] for a newly created thread. Must be called
307 * after the thread has been created and before any client instructions are run
bart439c55f2009-02-15 10:38:37 +0000308 * on the newly created thread, e.g. from the handler installed via
309 * VG_(track_pre_thread_first_insn)().
bart86a87df2009-03-04 19:26:47 +0000310 *
311 * @param[in] vg_created Valgrind thread ID of the newly created thread.
312 *
313 * @return DRD thread ID for the new thread.
bart439c55f2009-02-15 10:38:37 +0000314 */
bart62a784c2009-02-15 13:11:14 +0000315DrdThreadId DRD_(thread_post_create)(const ThreadId vg_created)
bart439c55f2009-02-15 10:38:37 +0000316{
bartbedfd232009-03-26 19:07:15 +0000317 const DrdThreadId created = DRD_(VgThreadIdToDrdThreadId)(vg_created);
bart439c55f2009-02-15 10:38:37 +0000318
bartbedfd232009-03-26 19:07:15 +0000319 tl_assert(0 <= (int)created && created < DRD_N_THREADS
320 && created != DRD_INVALID_THREADID);
bart439c55f2009-02-15 10:38:37 +0000321
bartbedfd232009-03-26 19:07:15 +0000322 DRD_(g_threadinfo)[created].stack_max
323 = VG_(thread_get_stack_max)(vg_created);
324 DRD_(g_threadinfo)[created].stack_startup
325 = DRD_(g_threadinfo)[created].stack_max;
326 DRD_(g_threadinfo)[created].stack_min
327 = DRD_(g_threadinfo)[created].stack_max;
328 DRD_(g_threadinfo)[created].stack_min_min
329 = DRD_(g_threadinfo)[created].stack_max;
330 DRD_(g_threadinfo)[created].stack_size
331 = VG_(thread_get_stack_size)(vg_created);
332 tl_assert(DRD_(g_threadinfo)[created].stack_max != 0);
bart439c55f2009-02-15 10:38:37 +0000333
bartbedfd232009-03-26 19:07:15 +0000334 return created;
bart439c55f2009-02-15 10:38:37 +0000335}
bart09dc13f2009-02-14 15:13:31 +0000336
bart6d956dc2011-07-28 09:54:37 +0000337static void DRD_(thread_delayed_delete)(const DrdThreadId tid)
338{
339 int j;
340
341 DRD_(g_threadinfo)[tid].vg_thread_exists = False;
342 DRD_(g_threadinfo)[tid].posix_thread_exists = False;
343 DRD_(g_threadinfo)[tid].deletion_seq = s_deletion_head++;
344#if 0
345 VG_(message)(Vg_DebugMsg, "Adding thread %d to the deletion list\n", tid);
346#endif
347 if (s_deletion_head - s_deletion_tail >= s_join_list_vol) {
348 for (j = 0; j < DRD_N_THREADS; ++j) {
349 if (DRD_(IsValidDrdThreadId)(j)
350 && DRD_(g_threadinfo)[j].deletion_seq == s_deletion_tail)
351 {
352 s_deletion_tail++;
353#if 0
354 VG_(message)(Vg_DebugMsg, "Delayed delete of thread %d\n", j);
355#endif
356 DRD_(thread_delete)(j, False);
357 break;
358 }
359 }
360 }
361}
362
bart324a23b2009-02-15 12:14:52 +0000363/**
364 * Process VG_USERREQ__POST_THREAD_JOIN. This client request is invoked just
365 * after thread drd_joiner joined thread drd_joinee.
366 */
bart09dc13f2009-02-14 15:13:31 +0000367void DRD_(thread_post_join)(DrdThreadId drd_joiner, DrdThreadId drd_joinee)
368{
bartbedfd232009-03-26 19:07:15 +0000369 tl_assert(DRD_(IsValidDrdThreadId)(drd_joiner));
370 tl_assert(DRD_(IsValidDrdThreadId)(drd_joinee));
bart7627be32009-06-06 12:26:05 +0000371
bartbedfd232009-03-26 19:07:15 +0000372 DRD_(thread_new_segment)(drd_joiner);
bart8f822af2009-06-08 18:20:42 +0000373 DRD_(thread_combine_vc_join)(drd_joiner, drd_joinee);
bart7627be32009-06-06 12:26:05 +0000374 DRD_(thread_new_segment)(drd_joinee);
bart09dc13f2009-02-14 15:13:31 +0000375
bartbedfd232009-03-26 19:07:15 +0000376 if (s_trace_fork_join)
377 {
378 const ThreadId joiner = DRD_(DrdThreadIdToVgThreadId)(drd_joiner);
bartbedfd232009-03-26 19:07:15 +0000379 const unsigned msg_size = 256;
380 char* msg;
bart09dc13f2009-02-14 15:13:31 +0000381
bartbedfd232009-03-26 19:07:15 +0000382 msg = VG_(malloc)("drd.main.dptj.1", msg_size);
383 tl_assert(msg);
384 VG_(snprintf)(msg, msg_size,
bart63c92ea2009-07-19 17:53:56 +0000385 "drd_post_thread_join joiner = %d, joinee = %d",
386 drd_joiner, drd_joinee);
bartbedfd232009-03-26 19:07:15 +0000387 if (joiner)
388 {
bart8f822af2009-06-08 18:20:42 +0000389 char* vc;
390
391 vc = DRD_(vc_aprint)(DRD_(thread_get_vc)(drd_joiner));
bartbedfd232009-03-26 19:07:15 +0000392 VG_(snprintf)(msg + VG_(strlen)(msg), msg_size - VG_(strlen)(msg),
bart8f822af2009-06-08 18:20:42 +0000393 ", new vc: %s", vc);
394 VG_(free)(vc);
bartbedfd232009-03-26 19:07:15 +0000395 }
bartad994e82011-10-13 18:04:30 +0000396 DRD_(trace_msg)("%pS", msg);
bartbedfd232009-03-26 19:07:15 +0000397 VG_(free)(msg);
398 }
bart09dc13f2009-02-14 15:13:31 +0000399
bartbedfd232009-03-26 19:07:15 +0000400 if (! DRD_(get_check_stack_accesses)())
401 {
402 DRD_(finish_suppression)(DRD_(thread_get_stack_max)(drd_joinee)
403 - DRD_(thread_get_stack_size)(drd_joinee),
404 DRD_(thread_get_stack_max)(drd_joinee));
405 }
406 DRD_(clientobj_delete_thread)(drd_joinee);
bart6d956dc2011-07-28 09:54:37 +0000407 DRD_(thread_delayed_delete)(drd_joinee);
bart09dc13f2009-02-14 15:13:31 +0000408}
409
bart324a23b2009-02-15 12:14:52 +0000410/**
411 * NPTL hack: NPTL allocates the 'struct pthread' on top of the stack,
412 * and accesses this data structure from multiple threads without locking.
413 * Any conflicting accesses in the range stack_startup..stack_max will be
414 * ignored.
415 */
bart62a784c2009-02-15 13:11:14 +0000416void DRD_(thread_set_stack_startup)(const DrdThreadId tid,
417 const Addr stack_startup)
sewardjaf44c822007-11-25 14:01:38 +0000418{
bartbedfd232009-03-26 19:07:15 +0000419 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
420 && tid != DRD_INVALID_THREADID);
421 tl_assert(DRD_(g_threadinfo)[tid].stack_min <= stack_startup);
422 tl_assert(stack_startup <= DRD_(g_threadinfo)[tid].stack_max);
423 DRD_(g_threadinfo)[tid].stack_startup = stack_startup;
sewardjaf44c822007-11-25 14:01:38 +0000424}
425
bart86a87df2009-03-04 19:26:47 +0000426/** Return the stack pointer for the specified thread. */
bart62a784c2009-02-15 13:11:14 +0000427Addr DRD_(thread_get_stack_min)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000428{
bartbedfd232009-03-26 19:07:15 +0000429 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
430 && tid != DRD_INVALID_THREADID);
431 return DRD_(g_threadinfo)[tid].stack_min;
sewardjaf44c822007-11-25 14:01:38 +0000432}
433
bart86a87df2009-03-04 19:26:47 +0000434/**
435 * Return the lowest value that was ever assigned to the stack pointer
436 * for the specified thread.
437 */
bart62a784c2009-02-15 13:11:14 +0000438Addr DRD_(thread_get_stack_min_min)(const DrdThreadId tid)
bartcac53462008-03-29 09:27:08 +0000439{
bartbedfd232009-03-26 19:07:15 +0000440 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
441 && tid != DRD_INVALID_THREADID);
442 return DRD_(g_threadinfo)[tid].stack_min_min;
bartcac53462008-03-29 09:27:08 +0000443}
444
bart86a87df2009-03-04 19:26:47 +0000445/** Return the top address for the stack of the specified thread. */
bart62a784c2009-02-15 13:11:14 +0000446Addr DRD_(thread_get_stack_max)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000447{
bartbedfd232009-03-26 19:07:15 +0000448 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
449 && tid != DRD_INVALID_THREADID);
450 return DRD_(g_threadinfo)[tid].stack_max;
sewardjaf44c822007-11-25 14:01:38 +0000451}
452
bart86a87df2009-03-04 19:26:47 +0000453/** Return the maximum stack size for the specified thread. */
bart62a784c2009-02-15 13:11:14 +0000454SizeT DRD_(thread_get_stack_size)(const DrdThreadId tid)
bartcac53462008-03-29 09:27:08 +0000455{
bartbedfd232009-03-26 19:07:15 +0000456 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
457 && tid != DRD_INVALID_THREADID);
458 return DRD_(g_threadinfo)[tid].stack_size;
bartcac53462008-03-29 09:27:08 +0000459}
460
bart383d6132010-09-02 14:43:18 +0000461Bool DRD_(thread_get_on_alt_stack)(const DrdThreadId tid)
462{
463 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
464 && tid != DRD_INVALID_THREADID);
465 return DRD_(g_threadinfo)[tid].on_alt_stack;
466}
467
468void DRD_(thread_set_on_alt_stack)(const DrdThreadId tid,
469 const Bool on_alt_stack)
470{
471 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
472 && tid != DRD_INVALID_THREADID);
473 tl_assert(on_alt_stack == !!on_alt_stack);
474 DRD_(g_threadinfo)[tid].on_alt_stack = on_alt_stack;
475}
476
477Int DRD_(thread_get_threads_on_alt_stack)(void)
478{
479 int i, n = 0;
480
481 for (i = 1; i < DRD_N_THREADS; i++)
482 n += DRD_(g_threadinfo)[i].on_alt_stack;
483 return n;
484}
485
bart09dc13f2009-02-14 15:13:31 +0000486/**
bart6d956dc2011-07-28 09:54:37 +0000487 * Clean up thread-specific data structures.
sewardjaf44c822007-11-25 14:01:38 +0000488 */
bart9194e932011-02-09 11:55:12 +0000489void DRD_(thread_delete)(const DrdThreadId tid, const Bool detached)
sewardjaf44c822007-11-25 14:01:38 +0000490{
bartbedfd232009-03-26 19:07:15 +0000491 Segment* sg;
492 Segment* sg_prev;
sewardjaf44c822007-11-25 14:01:38 +0000493
bartbedfd232009-03-26 19:07:15 +0000494 tl_assert(DRD_(IsValidDrdThreadId)(tid));
bart86a87df2009-03-04 19:26:47 +0000495
bartbedfd232009-03-26 19:07:15 +0000496 tl_assert(DRD_(g_threadinfo)[tid].synchr_nesting >= 0);
bart91b7ec32012-01-25 20:36:27 +0000497 for (sg = DRD_(g_threadinfo)[tid].sg_last; sg; sg = sg_prev) {
498 sg_prev = sg->thr_prev;
499 sg->thr_next = NULL;
500 sg->thr_prev = NULL;
bartbedfd232009-03-26 19:07:15 +0000501 DRD_(sg_put)(sg);
502 }
bart6d956dc2011-07-28 09:54:37 +0000503 DRD_(g_threadinfo)[tid].valid = False;
bartbedfd232009-03-26 19:07:15 +0000504 DRD_(g_threadinfo)[tid].vg_thread_exists = False;
505 DRD_(g_threadinfo)[tid].posix_thread_exists = False;
bart9194e932011-02-09 11:55:12 +0000506 if (detached)
507 DRD_(g_threadinfo)[tid].detached_posix_thread = False;
508 else
509 tl_assert(!DRD_(g_threadinfo)[tid].detached_posix_thread);
bart91b7ec32012-01-25 20:36:27 +0000510 DRD_(g_threadinfo)[tid].sg_first = NULL;
511 DRD_(g_threadinfo)[tid].sg_last = NULL;
bart86a87df2009-03-04 19:26:47 +0000512
bart91b7ec32012-01-25 20:36:27 +0000513 tl_assert(!DRD_(IsValidDrdThreadId)(tid));
sewardjaf44c822007-11-25 14:01:38 +0000514}
515
bart324a23b2009-02-15 12:14:52 +0000516/**
517 * Called after a thread performed its last memory access and before
518 * thread_delete() is called. Note: thread_delete() is only called for
519 * joinable threads, not for detached threads.
520 */
bart62a784c2009-02-15 13:11:14 +0000521void DRD_(thread_finished)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000522{
bartbedfd232009-03-26 19:07:15 +0000523 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
524 && tid != DRD_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +0000525
bartbedfd232009-03-26 19:07:15 +0000526 DRD_(g_threadinfo)[tid].vg_thread_exists = False;
sewardjaf44c822007-11-25 14:01:38 +0000527
bartbedfd232009-03-26 19:07:15 +0000528 if (DRD_(g_threadinfo)[tid].detached_posix_thread)
529 {
530 /*
531 * Once a detached thread has finished, its stack is deallocated and
532 * should no longer be taken into account when computing the conflict set.
533 */
534 DRD_(g_threadinfo)[tid].stack_min = DRD_(g_threadinfo)[tid].stack_max;
sewardjaf44c822007-11-25 14:01:38 +0000535
bartbedfd232009-03-26 19:07:15 +0000536 /*
537 * For a detached thread, calling pthread_exit() invalidates the
538 * POSIX thread ID associated with the detached thread. For joinable
539 * POSIX threads however, the POSIX thread ID remains live after the
540 * pthread_exit() call until pthread_join() is called.
541 */
542 DRD_(g_threadinfo)[tid].posix_thread_exists = False;
543 }
sewardjaf44c822007-11-25 14:01:38 +0000544}
545
bart5c7e6b62011-02-03 17:47:50 +0000546/** Called just after fork() in the child process. */
547void DRD_(drd_thread_atfork_child)(const DrdThreadId tid)
548{
549 unsigned i;
550
551 for (i = 1; i < DRD_N_THREADS; i++)
552 {
553 if (i == tid)
554 continue;
555 if (DRD_(IsValidDrdThreadId(i)))
bart9194e932011-02-09 11:55:12 +0000556 DRD_(thread_delete)(i, True);
bart5c7e6b62011-02-03 17:47:50 +0000557 tl_assert(!DRD_(IsValidDrdThreadId(i)));
bartf7a5b3f2011-12-11 20:34:03 +0000558 }
bart5c7e6b62011-02-03 17:47:50 +0000559}
560
bart9b2974a2008-09-27 12:35:31 +0000561/** Called just before pthread_cancel(). */
bart62a784c2009-02-15 13:11:14 +0000562void DRD_(thread_pre_cancel)(const DrdThreadId tid)
bartaf0691b2008-09-27 12:26:50 +0000563{
bartbedfd232009-03-26 19:07:15 +0000564 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
565 && tid != DRD_INVALID_THREADID);
566 tl_assert(DRD_(g_threadinfo)[tid].pt_threadid != INVALID_POSIX_THREADID);
bartaf0691b2008-09-27 12:26:50 +0000567
bart0c0cd772011-03-03 19:59:20 +0000568 if (DRD_(thread_get_trace_fork_join)())
bartad994e82011-10-13 18:04:30 +0000569 DRD_(trace_msg)("[%d] drd_thread_pre_cancel %d",
bartb92ff0f2011-10-08 08:29:29 +0000570 DRD_(g_drd_running_tid), tid);
bartaf0691b2008-09-27 12:26:50 +0000571}
572
barte7dff242009-04-23 17:12:39 +0000573/**
574 * Store the POSIX thread ID for the specified thread.
575 *
576 * @note This function can be called two times for the same thread -- see also
577 * the comment block preceding the pthread_create() wrapper in
578 * drd_pthread_intercepts.c.
579 */
bart62a784c2009-02-15 13:11:14 +0000580void DRD_(thread_set_pthreadid)(const DrdThreadId tid, const PThreadId ptid)
sewardjaf44c822007-11-25 14:01:38 +0000581{
bartbedfd232009-03-26 19:07:15 +0000582 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
583 && tid != DRD_INVALID_THREADID);
barte7dff242009-04-23 17:12:39 +0000584 tl_assert(DRD_(g_threadinfo)[tid].pt_threadid == INVALID_POSIX_THREADID
585 || DRD_(g_threadinfo)[tid].pt_threadid == ptid);
bartbedfd232009-03-26 19:07:15 +0000586 tl_assert(ptid != INVALID_POSIX_THREADID);
587 DRD_(g_threadinfo)[tid].posix_thread_exists = True;
588 DRD_(g_threadinfo)[tid].pt_threadid = ptid;
sewardjaf44c822007-11-25 14:01:38 +0000589}
590
bart86a87df2009-03-04 19:26:47 +0000591/** Returns true for joinable threads and false for detached threads. */
bart62a784c2009-02-15 13:11:14 +0000592Bool DRD_(thread_get_joinable)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000593{
bartbedfd232009-03-26 19:07:15 +0000594 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
595 && tid != DRD_INVALID_THREADID);
596 return ! DRD_(g_threadinfo)[tid].detached_posix_thread;
sewardjaf44c822007-11-25 14:01:38 +0000597}
598
bart86a87df2009-03-04 19:26:47 +0000599/** Store the thread mode: joinable or detached. */
bart62a784c2009-02-15 13:11:14 +0000600void DRD_(thread_set_joinable)(const DrdThreadId tid, const Bool joinable)
sewardjaf44c822007-11-25 14:01:38 +0000601{
bartbedfd232009-03-26 19:07:15 +0000602 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
603 && tid != DRD_INVALID_THREADID);
604 tl_assert(!! joinable == joinable);
605 tl_assert(DRD_(g_threadinfo)[tid].pt_threadid != INVALID_POSIX_THREADID);
bart8f822af2009-06-08 18:20:42 +0000606
bartbedfd232009-03-26 19:07:15 +0000607 DRD_(g_threadinfo)[tid].detached_posix_thread = ! joinable;
sewardjaf44c822007-11-25 14:01:38 +0000608}
609
bartdd75cdf2009-07-24 08:20:10 +0000610/** Tells DRD that the calling thread is about to enter pthread_create(). */
611void DRD_(thread_entering_pthread_create)(const DrdThreadId tid)
612{
613 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
614 && tid != DRD_INVALID_THREADID);
615 tl_assert(DRD_(g_threadinfo)[tid].pt_threadid != INVALID_POSIX_THREADID);
616 tl_assert(DRD_(g_threadinfo)[tid].pthread_create_nesting_level >= 0);
617
618 DRD_(g_threadinfo)[tid].pthread_create_nesting_level++;
619}
620
621/** Tells DRD that the calling thread has left pthread_create(). */
622void DRD_(thread_left_pthread_create)(const DrdThreadId tid)
623{
624 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
625 && tid != DRD_INVALID_THREADID);
626 tl_assert(DRD_(g_threadinfo)[tid].pt_threadid != INVALID_POSIX_THREADID);
627 tl_assert(DRD_(g_threadinfo)[tid].pthread_create_nesting_level > 0);
628
629 DRD_(g_threadinfo)[tid].pthread_create_nesting_level--;
630}
631
bartd45d9952009-05-31 18:53:54 +0000632/** Obtain the thread number and the user-assigned thread name. */
633const char* DRD_(thread_get_name)(const DrdThreadId tid)
634{
635 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
636 && tid != DRD_INVALID_THREADID);
637
638 return DRD_(g_threadinfo)[tid].name;
639}
640
641/** Set the name of the specified thread. */
642void DRD_(thread_set_name)(const DrdThreadId tid, const char* const name)
643{
644 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
645 && tid != DRD_INVALID_THREADID);
bart31b983d2010-02-21 14:52:59 +0000646
bartd45d9952009-05-31 18:53:54 +0000647 if (name == NULL || name[0] == 0)
648 VG_(snprintf)(DRD_(g_threadinfo)[tid].name,
649 sizeof(DRD_(g_threadinfo)[tid].name),
650 "Thread %d",
651 tid);
652 else
653 VG_(snprintf)(DRD_(g_threadinfo)[tid].name,
654 sizeof(DRD_(g_threadinfo)[tid].name),
655 "Thread %d (%s)",
656 tid, name);
657 DRD_(g_threadinfo)[tid].name[sizeof(DRD_(g_threadinfo)[tid].name) - 1] = 0;
658}
659
bart86a87df2009-03-04 19:26:47 +0000660/**
661 * Update s_vg_running_tid, DRD_(g_drd_running_tid) and recalculate the
662 * conflict set.
663 */
bart62a784c2009-02-15 13:11:14 +0000664void DRD_(thread_set_vg_running_tid)(const ThreadId vg_tid)
sewardjaf44c822007-11-25 14:01:38 +0000665{
bartbedfd232009-03-26 19:07:15 +0000666 tl_assert(vg_tid != VG_INVALID_THREADID);
sewardj8b09d4f2007-12-04 21:27:18 +0000667
bartbedfd232009-03-26 19:07:15 +0000668 if (vg_tid != s_vg_running_tid)
669 {
670 DRD_(thread_set_running_tid)(vg_tid,
671 DRD_(VgThreadIdToDrdThreadId)(vg_tid));
672 }
sewardj8b09d4f2007-12-04 21:27:18 +0000673
bartbedfd232009-03-26 19:07:15 +0000674 tl_assert(s_vg_running_tid != VG_INVALID_THREADID);
675 tl_assert(DRD_(g_drd_running_tid) != DRD_INVALID_THREADID);
sewardj8b09d4f2007-12-04 21:27:18 +0000676}
677
bart86a87df2009-03-04 19:26:47 +0000678/**
679 * Update s_vg_running_tid, DRD_(g_drd_running_tid) and recalculate the
680 * conflict set.
681 */
bart62a784c2009-02-15 13:11:14 +0000682void DRD_(thread_set_running_tid)(const ThreadId vg_tid,
683 const DrdThreadId drd_tid)
sewardj8b09d4f2007-12-04 21:27:18 +0000684{
bartbedfd232009-03-26 19:07:15 +0000685 tl_assert(vg_tid != VG_INVALID_THREADID);
686 tl_assert(drd_tid != DRD_INVALID_THREADID);
bart31b983d2010-02-21 14:52:59 +0000687
bartbedfd232009-03-26 19:07:15 +0000688 if (vg_tid != s_vg_running_tid)
689 {
690 if (s_trace_context_switches
691 && DRD_(g_drd_running_tid) != DRD_INVALID_THREADID)
692 {
693 VG_(message)(Vg_DebugMsg,
bart63c92ea2009-07-19 17:53:56 +0000694 "Context switch from thread %d to thread %d;"
sewardj1e29ebc2009-07-15 14:49:17 +0000695 " segments: %llu\n",
bart63c92ea2009-07-19 17:53:56 +0000696 DRD_(g_drd_running_tid), drd_tid,
bartbedfd232009-03-26 19:07:15 +0000697 DRD_(sg_get_segments_alive_count)());
698 }
699 s_vg_running_tid = vg_tid;
700 DRD_(g_drd_running_tid) = drd_tid;
701 thread_compute_conflict_set(&DRD_(g_conflict_set), drd_tid);
702 s_context_switch_count++;
703 }
sewardj8b09d4f2007-12-04 21:27:18 +0000704
bartbedfd232009-03-26 19:07:15 +0000705 tl_assert(s_vg_running_tid != VG_INVALID_THREADID);
706 tl_assert(DRD_(g_drd_running_tid) != DRD_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +0000707}
708
bart86a87df2009-03-04 19:26:47 +0000709/**
710 * Increase the synchronization nesting counter. Must be called before the
711 * client calls a synchronization function.
712 */
bart62a784c2009-02-15 13:11:14 +0000713int DRD_(thread_enter_synchr)(const DrdThreadId tid)
bart0268dfa2008-03-11 20:10:21 +0000714{
bartbedfd232009-03-26 19:07:15 +0000715 tl_assert(DRD_(IsValidDrdThreadId)(tid));
716 return DRD_(g_threadinfo)[tid].synchr_nesting++;
bart0268dfa2008-03-11 20:10:21 +0000717}
718
bart86a87df2009-03-04 19:26:47 +0000719/**
720 * Decrease the synchronization nesting counter. Must be called after the
721 * client left a synchronization function.
722 */
bart62a784c2009-02-15 13:11:14 +0000723int DRD_(thread_leave_synchr)(const DrdThreadId tid)
bart0268dfa2008-03-11 20:10:21 +0000724{
bartbedfd232009-03-26 19:07:15 +0000725 tl_assert(DRD_(IsValidDrdThreadId)(tid));
726 tl_assert(DRD_(g_threadinfo)[tid].synchr_nesting >= 1);
727 return --DRD_(g_threadinfo)[tid].synchr_nesting;
bart0268dfa2008-03-11 20:10:21 +0000728}
729
bart86a87df2009-03-04 19:26:47 +0000730/** Returns the synchronization nesting counter. */
bart62a784c2009-02-15 13:11:14 +0000731int DRD_(thread_get_synchr_nesting_count)(const DrdThreadId tid)
bart0268dfa2008-03-11 20:10:21 +0000732{
bartbedfd232009-03-26 19:07:15 +0000733 tl_assert(DRD_(IsValidDrdThreadId)(tid));
734 return DRD_(g_threadinfo)[tid].synchr_nesting;
bart0268dfa2008-03-11 20:10:21 +0000735}
736
bart1a473c72008-03-13 19:03:38 +0000737/** Append a new segment at the end of the segment list. */
bart62a784c2009-02-15 13:11:14 +0000738static
bart86a87df2009-03-04 19:26:47 +0000739void thread_append_segment(const DrdThreadId tid, Segment* const sg)
sewardjaf44c822007-11-25 14:01:38 +0000740{
bartbedfd232009-03-26 19:07:15 +0000741 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
742 && tid != DRD_INVALID_THREADID);
bart8f822af2009-06-08 18:20:42 +0000743
744#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
745 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[tid]));
746#endif
747
bart91b7ec32012-01-25 20:36:27 +0000748 // add at tail
749 sg->thr_prev = DRD_(g_threadinfo)[tid].sg_last;
750 sg->thr_next = NULL;
751 if (DRD_(g_threadinfo)[tid].sg_last)
752 DRD_(g_threadinfo)[tid].sg_last->thr_next = sg;
753 DRD_(g_threadinfo)[tid].sg_last = sg;
754 if (DRD_(g_threadinfo)[tid].sg_first == NULL)
755 DRD_(g_threadinfo)[tid].sg_first = sg;
bart8f822af2009-06-08 18:20:42 +0000756
757#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
758 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[tid]));
759#endif
sewardjaf44c822007-11-25 14:01:38 +0000760}
761
bart324a23b2009-02-15 12:14:52 +0000762/**
763 * Remove a segment from the segment list of thread threadid, and free the
764 * associated memory.
sewardjaf44c822007-11-25 14:01:38 +0000765 */
bart62a784c2009-02-15 13:11:14 +0000766static
bart86a87df2009-03-04 19:26:47 +0000767void thread_discard_segment(const DrdThreadId tid, Segment* const sg)
sewardjaf44c822007-11-25 14:01:38 +0000768{
bartbedfd232009-03-26 19:07:15 +0000769 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
770 && tid != DRD_INVALID_THREADID);
bart8f822af2009-06-08 18:20:42 +0000771
772#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
773 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[tid]));
774#endif
bart26f73e12008-02-24 18:37:08 +0000775
bart91b7ec32012-01-25 20:36:27 +0000776 if (sg->thr_prev)
777 sg->thr_prev->thr_next = sg->thr_next;
778 if (sg->thr_next)
779 sg->thr_next->thr_prev = sg->thr_prev;
780 if (sg == DRD_(g_threadinfo)[tid].sg_first)
781 DRD_(g_threadinfo)[tid].sg_first = sg->thr_next;
782 if (sg == DRD_(g_threadinfo)[tid].sg_last)
783 DRD_(g_threadinfo)[tid].sg_last = sg->thr_prev;
bartbedfd232009-03-26 19:07:15 +0000784 DRD_(sg_put)(sg);
bart3f749672008-03-22 09:49:40 +0000785
bart8f822af2009-06-08 18:20:42 +0000786#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
787 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[tid]));
788#endif
sewardjaf44c822007-11-25 14:01:38 +0000789}
790
bart86a87df2009-03-04 19:26:47 +0000791/**
792 * Returns a pointer to the vector clock of the most recent segment associated
793 * with thread 'tid'.
794 */
bart62a784c2009-02-15 13:11:14 +0000795VectorClock* DRD_(thread_get_vc)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +0000796{
bart91b7ec32012-01-25 20:36:27 +0000797 Segment* latest_sg;
barte278ab52012-01-24 18:28:55 +0000798
bartbedfd232009-03-26 19:07:15 +0000799 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
800 && tid != DRD_INVALID_THREADID);
bart91b7ec32012-01-25 20:36:27 +0000801 latest_sg = DRD_(g_threadinfo)[tid].sg_last;
802 tl_assert(latest_sg);
803 return &latest_sg->vc;
sewardjaf44c822007-11-25 14:01:38 +0000804}
805
bart324a23b2009-02-15 12:14:52 +0000806/**
807 * Return the latest segment of thread 'tid' and increment its reference count.
barta2b6e1b2008-03-17 18:32:39 +0000808 */
bart62a784c2009-02-15 13:11:14 +0000809void DRD_(thread_get_latest_segment)(Segment** sg, const DrdThreadId tid)
barta2b6e1b2008-03-17 18:32:39 +0000810{
bart91b7ec32012-01-25 20:36:27 +0000811 Segment* latest_sg;
barte278ab52012-01-24 18:28:55 +0000812
bartbedfd232009-03-26 19:07:15 +0000813 tl_assert(sg);
814 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
815 && tid != DRD_INVALID_THREADID);
bart91b7ec32012-01-25 20:36:27 +0000816 latest_sg = DRD_(g_threadinfo)[tid].sg_last;
817 tl_assert(latest_sg);
barta2b6e1b2008-03-17 18:32:39 +0000818
bartbedfd232009-03-26 19:07:15 +0000819 DRD_(sg_put)(*sg);
bart91b7ec32012-01-25 20:36:27 +0000820 *sg = DRD_(sg_get)(latest_sg);
barta2b6e1b2008-03-17 18:32:39 +0000821}
822
sewardjaf44c822007-11-25 14:01:38 +0000823/**
824 * Compute the minimum of all latest vector clocks of all threads
825 * (Michiel Ronsse calls this "clock snooping" in his papers about DIOTA).
bart86a87df2009-03-04 19:26:47 +0000826 *
sewardjaf44c822007-11-25 14:01:38 +0000827 * @param vc pointer to a vectorclock, holds result upon return.
828 */
bart62a784c2009-02-15 13:11:14 +0000829static void DRD_(thread_compute_minimum_vc)(VectorClock* vc)
sewardjaf44c822007-11-25 14:01:38 +0000830{
bartbedfd232009-03-26 19:07:15 +0000831 unsigned i;
832 Bool first;
833 Segment* latest_sg;
sewardjaf44c822007-11-25 14:01:38 +0000834
bartbedfd232009-03-26 19:07:15 +0000835 first = True;
bart8f822af2009-06-08 18:20:42 +0000836 for (i = 0; i < DRD_N_THREADS; i++)
bartbedfd232009-03-26 19:07:15 +0000837 {
bart91b7ec32012-01-25 20:36:27 +0000838 latest_sg = DRD_(g_threadinfo)[i].sg_last;
839 if (latest_sg) {
bartbedfd232009-03-26 19:07:15 +0000840 if (first)
841 DRD_(vc_assign)(vc, &latest_sg->vc);
842 else
843 DRD_(vc_min)(vc, &latest_sg->vc);
844 first = False;
845 }
846 }
sewardjaf44c822007-11-25 14:01:38 +0000847}
848
bart86a87df2009-03-04 19:26:47 +0000849/**
850 * Compute the maximum of all latest vector clocks of all threads.
851 *
852 * @param vc pointer to a vectorclock, holds result upon return.
853 */
bart62a784c2009-02-15 13:11:14 +0000854static void DRD_(thread_compute_maximum_vc)(VectorClock* vc)
sewardjaf44c822007-11-25 14:01:38 +0000855{
bartbedfd232009-03-26 19:07:15 +0000856 unsigned i;
857 Bool first;
858 Segment* latest_sg;
sewardjaf44c822007-11-25 14:01:38 +0000859
bartbedfd232009-03-26 19:07:15 +0000860 first = True;
bart8f822af2009-06-08 18:20:42 +0000861 for (i = 0; i < DRD_N_THREADS; i++)
bartbedfd232009-03-26 19:07:15 +0000862 {
bart91b7ec32012-01-25 20:36:27 +0000863 latest_sg = DRD_(g_threadinfo)[i].sg_last;
864 if (latest_sg) {
bartbedfd232009-03-26 19:07:15 +0000865 if (first)
866 DRD_(vc_assign)(vc, &latest_sg->vc);
867 else
868 DRD_(vc_combine)(vc, &latest_sg->vc);
869 first = False;
870 }
871 }
sewardjaf44c822007-11-25 14:01:38 +0000872}
873
874/**
bart5bd9f2d2008-03-03 20:31:58 +0000875 * Discard all segments that have a defined order against the latest vector
bart86a87df2009-03-04 19:26:47 +0000876 * clock of all threads -- these segments can no longer be involved in a
sewardjaf44c822007-11-25 14:01:38 +0000877 * data race.
878 */
bart8f822af2009-06-08 18:20:42 +0000879static void thread_discard_ordered_segments(void)
sewardjaf44c822007-11-25 14:01:38 +0000880{
bartbedfd232009-03-26 19:07:15 +0000881 unsigned i;
882 VectorClock thread_vc_min;
sewardjaf44c822007-11-25 14:01:38 +0000883
bartbedfd232009-03-26 19:07:15 +0000884 s_discard_ordered_segments_count++;
sewardjaf44c822007-11-25 14:01:38 +0000885
bartbedfd232009-03-26 19:07:15 +0000886 DRD_(vc_init)(&thread_vc_min, 0, 0);
887 DRD_(thread_compute_minimum_vc)(&thread_vc_min);
888 if (DRD_(sg_get_trace)())
889 {
bart8f822af2009-06-08 18:20:42 +0000890 char *vc_min, *vc_max;
bartbedfd232009-03-26 19:07:15 +0000891 VectorClock thread_vc_max;
sewardjaf44c822007-11-25 14:01:38 +0000892
bartbedfd232009-03-26 19:07:15 +0000893 DRD_(vc_init)(&thread_vc_max, 0, 0);
894 DRD_(thread_compute_maximum_vc)(&thread_vc_max);
bart8f822af2009-06-08 18:20:42 +0000895 vc_min = DRD_(vc_aprint)(&thread_vc_min);
896 vc_max = DRD_(vc_aprint)(&thread_vc_max);
897 VG_(message)(Vg_DebugMsg,
sewardj1e29ebc2009-07-15 14:49:17 +0000898 "Discarding ordered segments -- min vc is %s, max vc is %s\n",
bart8f822af2009-06-08 18:20:42 +0000899 vc_min, vc_max);
900 VG_(free)(vc_min);
901 VG_(free)(vc_max);
bartbedfd232009-03-26 19:07:15 +0000902 DRD_(vc_cleanup)(&thread_vc_max);
903 }
sewardjaf44c822007-11-25 14:01:38 +0000904
bart91b7ec32012-01-25 20:36:27 +0000905 for (i = 0; i < DRD_N_THREADS; i++) {
bartbedfd232009-03-26 19:07:15 +0000906 Segment* sg;
907 Segment* sg_next;
barte278ab52012-01-24 18:28:55 +0000908
bart91b7ec32012-01-25 20:36:27 +0000909 for (sg = DRD_(g_threadinfo)[i].sg_first;
910 sg && (sg_next = sg->thr_next)
911 && DRD_(vc_lte)(&sg->vc, &thread_vc_min);
912 sg = sg_next)
913 {
bartbedfd232009-03-26 19:07:15 +0000914 thread_discard_segment(i, sg);
915 }
916 }
917 DRD_(vc_cleanup)(&thread_vc_min);
sewardjaf44c822007-11-25 14:01:38 +0000918}
919
bart324a23b2009-02-15 12:14:52 +0000920/**
bart8f822af2009-06-08 18:20:42 +0000921 * An implementation of the property 'equiv(sg1, sg2)' as defined in the paper
922 * by Mark Christiaens e.a. The property equiv(sg1, sg2) holds if and only if
923 * all segments in the set CS are ordered consistently against both sg1 and
924 * sg2. The set CS is defined as the set of segments that can immediately
925 * precede future segments via inter-thread synchronization operations. In
926 * DRD the set CS consists of the latest segment of each thread combined with
927 * all segments for which the reference count is strictly greater than one.
928 * The code below is an optimized version of the following:
929 *
930 * for (i = 0; i < DRD_N_THREADS; i++)
931 * {
932 * Segment* sg;
933 *
934 * for (sg = DRD_(g_threadinfo)[i].first; sg; sg = sg->next)
935 * {
936 * if (sg == DRD_(g_threadinfo)[i].last || DRD_(sg_get_refcnt)(sg) > 1)
937 * {
938 * if ( DRD_(vc_lte)(&sg1->vc, &sg->vc)
939 * != DRD_(vc_lte)(&sg2->vc, &sg->vc)
940 * || DRD_(vc_lte)(&sg->vc, &sg1->vc)
941 * != DRD_(vc_lte)(&sg->vc, &sg2->vc))
942 * {
943 * return False;
944 * }
945 * }
946 * }
947 * }
948 */
949static Bool thread_consistent_segment_ordering(const DrdThreadId tid,
950 Segment* const sg1,
951 Segment* const sg2)
952{
953 unsigned i;
954
bart91b7ec32012-01-25 20:36:27 +0000955 tl_assert(sg1->thr_next);
956 tl_assert(sg2->thr_next);
957 tl_assert(sg1->thr_next == sg2);
bart8f822af2009-06-08 18:20:42 +0000958 tl_assert(DRD_(vc_lte)(&sg1->vc, &sg2->vc));
959
960 for (i = 0; i < DRD_N_THREADS; i++)
961 {
962 Segment* sg;
963
bart91b7ec32012-01-25 20:36:27 +0000964 for (sg = DRD_(g_threadinfo)[i].sg_first; sg; sg = sg->thr_next) {
965 if (!sg->thr_next || DRD_(sg_get_refcnt)(sg) > 1) {
bart8f822af2009-06-08 18:20:42 +0000966 if (DRD_(vc_lte)(&sg2->vc, &sg->vc))
967 break;
968 if (DRD_(vc_lte)(&sg1->vc, &sg->vc))
969 return False;
970 }
971 }
bart91b7ec32012-01-25 20:36:27 +0000972 for (sg = DRD_(g_threadinfo)[i].sg_last; sg; sg = sg->thr_prev) {
973 if (!sg->thr_next || DRD_(sg_get_refcnt)(sg) > 1) {
bart8f822af2009-06-08 18:20:42 +0000974 if (DRD_(vc_lte)(&sg->vc, &sg1->vc))
975 break;
976 if (DRD_(vc_lte)(&sg->vc, &sg2->vc))
977 return False;
978 }
979 }
980 }
981 return True;
982}
983
984/**
bart324a23b2009-02-15 12:14:52 +0000985 * Merge all segments that may be merged without triggering false positives
986 * or discarding real data races. For the theoretical background of segment
bart8f822af2009-06-08 18:20:42 +0000987 * merging, see also the following paper: Mark Christiaens, Michiel Ronsse
988 * and Koen De Bosschere. Bounding the number of segment histories during
989 * data race detection. Parallel Computing archive, Volume 28, Issue 9,
990 * pp 1221-1238, September 2002. This paper contains a proof that merging
991 * consecutive segments for which the property equiv(s1,s2) holds can be
992 * merged without reducing the accuracy of datarace detection. Furthermore
993 * it is also proven that the total number of all segments will never grow
994 * unbounded if all segments s1, s2 for which equiv(s1, s2) holds are merged
995 * every time a new segment is created. The property equiv(s1, s2) is defined
996 * as follows: equiv(s1, s2) <=> for all segments in the set CS, the vector
997 * clocks of segments s and s1 are ordered in the same way as those of segments
998 * s and s2. The set CS is defined as the set of existing segments s that have
999 * the potential to conflict with not yet created segments, either because the
1000 * segment s is the latest segment of a thread or because it can become the
1001 * immediate predecessor of a new segment due to a synchronization operation.
barta9c37392008-03-22 09:38:48 +00001002 */
1003static void thread_merge_segments(void)
1004{
bartbedfd232009-03-26 19:07:15 +00001005 unsigned i;
barta9c37392008-03-22 09:38:48 +00001006
bart8f822af2009-06-08 18:20:42 +00001007 s_new_segments_since_last_merge = 0;
1008
1009 for (i = 0; i < DRD_N_THREADS; i++)
bartbedfd232009-03-26 19:07:15 +00001010 {
1011 Segment* sg;
barta9c37392008-03-22 09:38:48 +00001012
bart8f822af2009-06-08 18:20:42 +00001013#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
1014 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[i]));
1015#endif
barta9c37392008-03-22 09:38:48 +00001016
bart91b7ec32012-01-25 20:36:27 +00001017 for (sg = DRD_(g_threadinfo)[i].sg_first; sg; sg = sg->thr_next) {
1018 if (DRD_(sg_get_refcnt)(sg) == 1 && sg->thr_next) {
1019 Segment* const sg_next = sg->thr_next;
barte278ab52012-01-24 18:28:55 +00001020 if (DRD_(sg_get_refcnt)(sg_next) == 1
bart91b7ec32012-01-25 20:36:27 +00001021 && sg_next->thr_next
barte278ab52012-01-24 18:28:55 +00001022 && thread_consistent_segment_ordering(i, sg, sg_next))
1023 {
1024 /* Merge sg and sg_next into sg. */
1025 DRD_(sg_merge)(sg, sg_next);
1026 thread_discard_segment(i, sg_next);
1027 }
bartbedfd232009-03-26 19:07:15 +00001028 }
barta9c37392008-03-22 09:38:48 +00001029 }
barta9c37392008-03-22 09:38:48 +00001030
bart8f822af2009-06-08 18:20:42 +00001031#ifdef ENABLE_DRD_CONSISTENCY_CHECKS
1032 tl_assert(DRD_(sane_ThreadInfo)(&DRD_(g_threadinfo)[i]));
1033#endif
bartbedfd232009-03-26 19:07:15 +00001034 }
barta9c37392008-03-22 09:38:48 +00001035}
1036
bart324a23b2009-02-15 12:14:52 +00001037/**
bart324a23b2009-02-15 12:14:52 +00001038 * Create a new segment for the specified thread, and discard any segments
1039 * that cannot cause races anymore.
sewardjaf44c822007-11-25 14:01:38 +00001040 */
bart62a784c2009-02-15 13:11:14 +00001041void DRD_(thread_new_segment)(const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +00001042{
bart8f822af2009-06-08 18:20:42 +00001043 Segment* last_sg;
bartbedfd232009-03-26 19:07:15 +00001044 Segment* new_sg;
bartd66e3a82008-04-06 15:02:17 +00001045
bartbedfd232009-03-26 19:07:15 +00001046 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1047 && tid != DRD_INVALID_THREADID);
bart8f822af2009-06-08 18:20:42 +00001048 tl_assert(thread_conflict_set_up_to_date(DRD_(g_drd_running_tid)));
sewardjaf44c822007-11-25 14:01:38 +00001049
bart91b7ec32012-01-25 20:36:27 +00001050 last_sg = DRD_(g_threadinfo)[tid].sg_last;
bartbedfd232009-03-26 19:07:15 +00001051 new_sg = DRD_(sg_new)(tid, tid);
1052 thread_append_segment(tid, new_sg);
bart8f822af2009-06-08 18:20:42 +00001053 if (tid == DRD_(g_drd_running_tid) && last_sg)
barte5214662009-06-21 11:51:23 +00001054 {
bart8f822af2009-06-08 18:20:42 +00001055 DRD_(thread_update_conflict_set)(tid, &last_sg->vc);
barte5214662009-06-21 11:51:23 +00001056 s_update_conflict_set_new_sg_count++;
1057 }
bartd66e3a82008-04-06 15:02:17 +00001058
bart8f822af2009-06-08 18:20:42 +00001059 tl_assert(thread_conflict_set_up_to_date(DRD_(g_drd_running_tid)));
sewardjaf44c822007-11-25 14:01:38 +00001060
bart8f822af2009-06-08 18:20:42 +00001061 if (s_segment_merging
1062 && ++s_new_segments_since_last_merge >= s_segment_merge_interval)
bartbedfd232009-03-26 19:07:15 +00001063 {
bart8f822af2009-06-08 18:20:42 +00001064 thread_discard_ordered_segments();
bartbedfd232009-03-26 19:07:15 +00001065 thread_merge_segments();
1066 }
sewardjaf44c822007-11-25 14:01:38 +00001067}
1068
bart26f73e12008-02-24 18:37:08 +00001069/** Call this function after thread 'joiner' joined thread 'joinee'. */
bart8f822af2009-06-08 18:20:42 +00001070void DRD_(thread_combine_vc_join)(DrdThreadId joiner, DrdThreadId joinee)
sewardjaf44c822007-11-25 14:01:38 +00001071{
bartbedfd232009-03-26 19:07:15 +00001072 tl_assert(joiner != joinee);
1073 tl_assert(0 <= (int)joiner && joiner < DRD_N_THREADS
1074 && joiner != DRD_INVALID_THREADID);
1075 tl_assert(0 <= (int)joinee && joinee < DRD_N_THREADS
1076 && joinee != DRD_INVALID_THREADID);
bart91b7ec32012-01-25 20:36:27 +00001077 tl_assert(DRD_(g_threadinfo)[joiner].sg_first);
1078 tl_assert(DRD_(g_threadinfo)[joiner].sg_last);
1079 tl_assert(DRD_(g_threadinfo)[joinee].sg_first);
1080 tl_assert(DRD_(g_threadinfo)[joinee].sg_last);
bart8f822af2009-06-08 18:20:42 +00001081
1082 if (DRD_(sg_get_trace)())
1083 {
1084 char *str1, *str2;
bartc6bf1842012-01-22 08:40:42 +00001085 str1 = DRD_(vc_aprint)(DRD_(thread_get_vc)(joiner));
1086 str2 = DRD_(vc_aprint)(DRD_(thread_get_vc)(joinee));
sewardj1e29ebc2009-07-15 14:49:17 +00001087 VG_(message)(Vg_DebugMsg, "Before join: joiner %s, joinee %s\n",
bart8f822af2009-06-08 18:20:42 +00001088 str1, str2);
1089 VG_(free)(str1);
1090 VG_(free)(str2);
1091 }
bartae37e6d2012-01-22 08:58:31 +00001092 if (joiner == DRD_(g_drd_running_tid)) {
barte5214662009-06-21 11:51:23 +00001093 VectorClock old_vc;
1094
bartc6bf1842012-01-22 08:40:42 +00001095 DRD_(vc_copy)(&old_vc, DRD_(thread_get_vc)(joiner));
1096 DRD_(vc_combine)(DRD_(thread_get_vc)(joiner),
1097 DRD_(thread_get_vc)(joinee));
barte5214662009-06-21 11:51:23 +00001098 DRD_(thread_update_conflict_set)(joiner, &old_vc);
1099 s_update_conflict_set_join_count++;
1100 DRD_(vc_cleanup)(&old_vc);
bartae37e6d2012-01-22 08:58:31 +00001101 } else {
bartc6bf1842012-01-22 08:40:42 +00001102 DRD_(vc_combine)(DRD_(thread_get_vc)(joiner),
1103 DRD_(thread_get_vc)(joinee));
barte5214662009-06-21 11:51:23 +00001104 }
1105
1106 thread_discard_ordered_segments();
1107
bartae37e6d2012-01-22 08:58:31 +00001108 if (DRD_(sg_get_trace)()) {
bart8f822af2009-06-08 18:20:42 +00001109 char* str;
bartae37e6d2012-01-22 08:58:31 +00001110
bartc6bf1842012-01-22 08:40:42 +00001111 str = DRD_(vc_aprint)(DRD_(thread_get_vc)(joiner));
sewardj1e29ebc2009-07-15 14:49:17 +00001112 VG_(message)(Vg_DebugMsg, "After join: %s\n", str);
bart8f822af2009-06-08 18:20:42 +00001113 VG_(free)(str);
1114 }
sewardjaf44c822007-11-25 14:01:38 +00001115}
1116
bart324a23b2009-02-15 12:14:52 +00001117/**
bart8f822af2009-06-08 18:20:42 +00001118 * Update the vector clock of the last segment of thread tid with the
bartf6ec1fe2009-06-21 18:07:35 +00001119 * the vector clock of segment sg.
bart26f73e12008-02-24 18:37:08 +00001120 */
bartf6ec1fe2009-06-21 18:07:35 +00001121static void thread_combine_vc_sync(DrdThreadId tid, const Segment* sg)
sewardjaf44c822007-11-25 14:01:38 +00001122{
bart8f822af2009-06-08 18:20:42 +00001123 const VectorClock* const vc = &sg->vc;
1124
bartbedfd232009-03-26 19:07:15 +00001125 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1126 && tid != DRD_INVALID_THREADID);
bart91b7ec32012-01-25 20:36:27 +00001127 tl_assert(DRD_(g_threadinfo)[tid].sg_first);
1128 tl_assert(DRD_(g_threadinfo)[tid].sg_last);
bart8f822af2009-06-08 18:20:42 +00001129 tl_assert(sg);
bartbedfd232009-03-26 19:07:15 +00001130 tl_assert(vc);
bart8f822af2009-06-08 18:20:42 +00001131
bartae37e6d2012-01-22 08:58:31 +00001132 if (tid != sg->tid) {
bart8f822af2009-06-08 18:20:42 +00001133 VectorClock old_vc;
1134
bartc6bf1842012-01-22 08:40:42 +00001135 DRD_(vc_copy)(&old_vc, DRD_(thread_get_vc)(tid));
1136 DRD_(vc_combine)(DRD_(thread_get_vc)(tid), vc);
bartae37e6d2012-01-22 08:58:31 +00001137 if (DRD_(sg_get_trace)()) {
bart8f822af2009-06-08 18:20:42 +00001138 char *str1, *str2;
1139 str1 = DRD_(vc_aprint)(&old_vc);
bartc6bf1842012-01-22 08:40:42 +00001140 str2 = DRD_(vc_aprint)(DRD_(thread_get_vc)(tid));
sewardj1e29ebc2009-07-15 14:49:17 +00001141 VG_(message)(Vg_DebugMsg, "thread %d: vc %s -> %s\n", tid, str1, str2);
bart8f822af2009-06-08 18:20:42 +00001142 VG_(free)(str1);
1143 VG_(free)(str2);
1144 }
barte5214662009-06-21 11:51:23 +00001145
bart8f822af2009-06-08 18:20:42 +00001146 thread_discard_ordered_segments();
barte5214662009-06-21 11:51:23 +00001147
bart8f822af2009-06-08 18:20:42 +00001148 DRD_(thread_update_conflict_set)(tid, &old_vc);
barte5214662009-06-21 11:51:23 +00001149 s_update_conflict_set_sync_count++;
1150
bart8f822af2009-06-08 18:20:42 +00001151 DRD_(vc_cleanup)(&old_vc);
bartae37e6d2012-01-22 08:58:31 +00001152 } else {
bartc6bf1842012-01-22 08:40:42 +00001153 tl_assert(DRD_(vc_lte)(vc, DRD_(thread_get_vc)(tid)));
bart8f822af2009-06-08 18:20:42 +00001154 }
sewardjaf44c822007-11-25 14:01:38 +00001155}
1156
bart324a23b2009-02-15 12:14:52 +00001157/**
bartf6ec1fe2009-06-21 18:07:35 +00001158 * Create a new segment for thread tid and update the vector clock of the last
1159 * segment of this thread with the the vector clock of segment sg. Call this
1160 * function after thread tid had to wait because of thread synchronization
1161 * until the memory accesses in the segment sg finished.
1162 */
1163void DRD_(thread_new_segment_and_combine_vc)(DrdThreadId tid, const Segment* sg)
1164{
1165 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1166 && tid != DRD_INVALID_THREADID);
1167 tl_assert(thread_conflict_set_up_to_date(DRD_(g_drd_running_tid)));
1168 tl_assert(sg);
1169
1170 thread_append_segment(tid, DRD_(sg_new)(tid, tid));
1171
1172 thread_combine_vc_sync(tid, sg);
1173
1174 if (s_segment_merging
1175 && ++s_new_segments_since_last_merge >= s_segment_merge_interval)
1176 {
1177 thread_discard_ordered_segments();
1178 thread_merge_segments();
1179 }
1180}
1181
1182/**
bart324a23b2009-02-15 12:14:52 +00001183 * Call this function whenever a thread is no longer using the memory
1184 * [ a1, a2 [, e.g. because of a call to free() or a stack pointer
1185 * increase.
bart26f73e12008-02-24 18:37:08 +00001186 */
bart23ef19d2011-03-12 12:34:44 +00001187void DRD_(thread_stop_using_mem)(const Addr a1, const Addr a2)
sewardjaf44c822007-11-25 14:01:38 +00001188{
bart178b6862011-07-29 12:30:43 +00001189 Segment* p;
sewardjaf44c822007-11-25 14:01:38 +00001190
bart91b7ec32012-01-25 20:36:27 +00001191 for (p = DRD_(g_sg_list); p; p = p->g_next)
barte278ab52012-01-24 18:28:55 +00001192 DRD_(bm_clear)(DRD_(sg_bm)(p), a1, a2);
sewardjaf44c822007-11-25 14:01:38 +00001193
bart178b6862011-07-29 12:30:43 +00001194 DRD_(bm_clear)(DRD_(g_conflict_set), a1, a2);
sewardjaf44c822007-11-25 14:01:38 +00001195}
1196
bartd45d9952009-05-31 18:53:54 +00001197/** Specify whether memory loads should be recorded. */
1198void DRD_(thread_set_record_loads)(const DrdThreadId tid, const Bool enabled)
bart0268dfa2008-03-11 20:10:21 +00001199{
bartbedfd232009-03-26 19:07:15 +00001200 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1201 && tid != DRD_INVALID_THREADID);
bartd45d9952009-05-31 18:53:54 +00001202 tl_assert(enabled == !! enabled);
1203
1204 DRD_(g_threadinfo)[tid].is_recording_loads = enabled;
bart0268dfa2008-03-11 20:10:21 +00001205}
1206
bartd45d9952009-05-31 18:53:54 +00001207/** Specify whether memory stores should be recorded. */
1208void DRD_(thread_set_record_stores)(const DrdThreadId tid, const Bool enabled)
bart0268dfa2008-03-11 20:10:21 +00001209{
bartbedfd232009-03-26 19:07:15 +00001210 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1211 && tid != DRD_INVALID_THREADID);
bartd45d9952009-05-31 18:53:54 +00001212 tl_assert(enabled == !! enabled);
1213
1214 DRD_(g_threadinfo)[tid].is_recording_stores = enabled;
bart0268dfa2008-03-11 20:10:21 +00001215}
1216
bart86a87df2009-03-04 19:26:47 +00001217/**
1218 * Print the segment information for all threads.
1219 *
1220 * This function is only used for debugging purposes.
1221 */
bart62a784c2009-02-15 13:11:14 +00001222void DRD_(thread_print_all)(void)
sewardjaf44c822007-11-25 14:01:38 +00001223{
bartbedfd232009-03-26 19:07:15 +00001224 unsigned i;
1225 Segment* p;
sewardjaf44c822007-11-25 14:01:38 +00001226
bart8f822af2009-06-08 18:20:42 +00001227 for (i = 0; i < DRD_N_THREADS; i++)
bartbedfd232009-03-26 19:07:15 +00001228 {
bart91b7ec32012-01-25 20:36:27 +00001229 p = DRD_(g_threadinfo)[i].sg_first;
1230 if (p) {
bartbedfd232009-03-26 19:07:15 +00001231 VG_(printf)("**************\n"
bart6d956dc2011-07-28 09:54:37 +00001232 "* thread %3d (%d/%d/%d/%d/0x%lx/%d) *\n"
bartbedfd232009-03-26 19:07:15 +00001233 "**************\n",
1234 i,
bart6d956dc2011-07-28 09:54:37 +00001235 DRD_(g_threadinfo)[i].valid,
bartbedfd232009-03-26 19:07:15 +00001236 DRD_(g_threadinfo)[i].vg_thread_exists,
1237 DRD_(g_threadinfo)[i].vg_threadid,
1238 DRD_(g_threadinfo)[i].posix_thread_exists,
1239 DRD_(g_threadinfo)[i].pt_threadid,
1240 DRD_(g_threadinfo)[i].detached_posix_thread);
bart91b7ec32012-01-25 20:36:27 +00001241 for ( ; p; p = p->thr_next)
bartbedfd232009-03-26 19:07:15 +00001242 DRD_(sg_print)(p);
sewardjaf44c822007-11-25 14:01:38 +00001243 }
bartbedfd232009-03-26 19:07:15 +00001244 }
sewardjaf44c822007-11-25 14:01:38 +00001245}
1246
bart86a87df2009-03-04 19:26:47 +00001247/** Show a call stack involved in a data race. */
barte7086002011-10-11 19:08:39 +00001248static void show_call_stack(const DrdThreadId tid, ExeContext* const callstack)
sewardjaf44c822007-11-25 14:01:38 +00001249{
bartbedfd232009-03-26 19:07:15 +00001250 const ThreadId vg_tid = DRD_(DrdThreadIdToVgThreadId)(tid);
sewardjaf44c822007-11-25 14:01:38 +00001251
barte7086002011-10-11 19:08:39 +00001252 if (vg_tid != VG_INVALID_THREADID) {
bartbedfd232009-03-26 19:07:15 +00001253 if (callstack)
bartbedfd232009-03-26 19:07:15 +00001254 VG_(pp_ExeContext)(callstack);
bartbedfd232009-03-26 19:07:15 +00001255 else
bartbedfd232009-03-26 19:07:15 +00001256 VG_(get_and_pp_StackTrace)(vg_tid, VG_(clo_backtrace_size));
barte7086002011-10-11 19:08:39 +00001257 } else {
1258 if (!VG_(clo_xml))
1259 VG_(message)(Vg_UserMsg,
1260 " (thread finished, call stack no longer available)\n");
bartbedfd232009-03-26 19:07:15 +00001261 }
sewardjaf44c822007-11-25 14:01:38 +00001262}
1263
bart86a87df2009-03-04 19:26:47 +00001264/** Print information about the segments involved in a data race. */
sewardjaf44c822007-11-25 14:01:38 +00001265static void
1266thread_report_conflicting_segments_segment(const DrdThreadId tid,
1267 const Addr addr,
1268 const SizeT size,
1269 const BmAccessTypeT access_type,
1270 const Segment* const p)
1271{
bartbedfd232009-03-26 19:07:15 +00001272 unsigned i;
sewardjaf44c822007-11-25 14:01:38 +00001273
bartbedfd232009-03-26 19:07:15 +00001274 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1275 && tid != DRD_INVALID_THREADID);
1276 tl_assert(p);
sewardjaf44c822007-11-25 14:01:38 +00001277
bart91b7ec32012-01-25 20:36:27 +00001278 for (i = 0; i < DRD_N_THREADS; i++) {
1279 if (i != tid) {
bartbedfd232009-03-26 19:07:15 +00001280 Segment* q;
barte278ab52012-01-24 18:28:55 +00001281
bart91b7ec32012-01-25 20:36:27 +00001282 for (q = DRD_(g_threadinfo)[i].sg_last; q; q = q->thr_prev) {
bartbedfd232009-03-26 19:07:15 +00001283 /*
bart31b983d2010-02-21 14:52:59 +00001284 * Since q iterates over the segments of thread i in order of
1285 * decreasing vector clocks, if q->vc <= p->vc, then
bartbedfd232009-03-26 19:07:15 +00001286 * q->next->vc <= p->vc will also hold. Hence, break out of the
1287 * loop once this condition is met.
1288 */
1289 if (DRD_(vc_lte)(&q->vc, &p->vc))
1290 break;
bart91b7ec32012-01-25 20:36:27 +00001291 if (!DRD_(vc_lte)(&p->vc, &q->vc)) {
bart8f822af2009-06-08 18:20:42 +00001292 if (DRD_(bm_has_conflict_with)(DRD_(sg_bm)(q), addr, addr + size,
bart91b7ec32012-01-25 20:36:27 +00001293 access_type)) {
barte278ab52012-01-24 18:28:55 +00001294 Segment* q_next;
1295
bartbedfd232009-03-26 19:07:15 +00001296 tl_assert(q->stacktrace);
barte7086002011-10-11 19:08:39 +00001297 if (VG_(clo_xml))
1298 VG_(printf_xml)(" <other_segment_start>\n");
1299 else
1300 VG_(message)(Vg_UserMsg,
1301 "Other segment start (thread %d)\n", i);
1302 show_call_stack(i, q->stacktrace);
1303 if (VG_(clo_xml))
1304 VG_(printf_xml)(" </other_segment_start>\n"
1305 " <other_segment_end>\n");
1306 else
1307 VG_(message)(Vg_UserMsg,
1308 "Other segment end (thread %d)\n", i);
bart91b7ec32012-01-25 20:36:27 +00001309 q_next = q->thr_next;
barte278ab52012-01-24 18:28:55 +00001310 show_call_stack(i, q_next ? q_next->stacktrace : 0);
barte7086002011-10-11 19:08:39 +00001311 if (VG_(clo_xml))
1312 VG_(printf_xml)(" </other_segment_end>\n");
bartbedfd232009-03-26 19:07:15 +00001313 }
1314 }
1315 }
sewardjaf44c822007-11-25 14:01:38 +00001316 }
bartbedfd232009-03-26 19:07:15 +00001317 }
sewardjaf44c822007-11-25 14:01:38 +00001318}
1319
bart86a87df2009-03-04 19:26:47 +00001320/** Print information about all segments involved in a data race. */
bart62a784c2009-02-15 13:11:14 +00001321void DRD_(thread_report_conflicting_segments)(const DrdThreadId tid,
1322 const Addr addr,
1323 const SizeT size,
1324 const BmAccessTypeT access_type)
sewardjaf44c822007-11-25 14:01:38 +00001325{
bartbedfd232009-03-26 19:07:15 +00001326 Segment* p;
sewardjaf44c822007-11-25 14:01:38 +00001327
bartbedfd232009-03-26 19:07:15 +00001328 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1329 && tid != DRD_INVALID_THREADID);
sewardjaf44c822007-11-25 14:01:38 +00001330
bart91b7ec32012-01-25 20:36:27 +00001331 for (p = DRD_(g_threadinfo)[tid].sg_first; p; p = p->thr_next) {
bart8f822af2009-06-08 18:20:42 +00001332 if (DRD_(bm_has)(DRD_(sg_bm)(p), addr, addr + size, access_type))
bartbedfd232009-03-26 19:07:15 +00001333 thread_report_conflicting_segments_segment(tid, addr, size,
1334 access_type, p);
bartbedfd232009-03-26 19:07:15 +00001335 }
sewardjaf44c822007-11-25 14:01:38 +00001336}
sewardjaf44c822007-11-25 14:01:38 +00001337
bart324a23b2009-02-15 12:14:52 +00001338/**
bart8f822af2009-06-08 18:20:42 +00001339 * Verify whether the conflict set for thread tid is up to date. Only perform
1340 * the check if the environment variable DRD_VERIFY_CONFLICT_SET has been set.
1341 */
1342static Bool thread_conflict_set_up_to_date(const DrdThreadId tid)
1343{
1344 static int do_verify_conflict_set = -1;
1345 Bool result;
1346 struct bitmap* computed_conflict_set = 0;
1347
1348 if (do_verify_conflict_set < 0)
1349 do_verify_conflict_set = VG_(getenv)("DRD_VERIFY_CONFLICT_SET") != 0;
1350
1351 if (do_verify_conflict_set == 0)
1352 return True;
1353
1354 thread_compute_conflict_set(&computed_conflict_set, tid);
1355 result = DRD_(bm_equal)(DRD_(g_conflict_set), computed_conflict_set);
1356 if (! result)
1357 {
1358 VG_(printf)("actual conflict set:\n");
1359 DRD_(bm_print)(DRD_(g_conflict_set));
1360 VG_(printf)("\n");
1361 VG_(printf)("computed conflict set:\n");
1362 DRD_(bm_print)(computed_conflict_set);
1363 VG_(printf)("\n");
1364 }
1365 DRD_(bm_delete)(computed_conflict_set);
1366 return result;
1367}
1368
1369/**
1370 * Compute the conflict set: a bitmap that represents the union of all memory
1371 * accesses of all segments that are unordered to the current segment of the
1372 * thread tid.
sewardjaf44c822007-11-25 14:01:38 +00001373 */
bart86a87df2009-03-04 19:26:47 +00001374static void thread_compute_conflict_set(struct bitmap** conflict_set,
1375 const DrdThreadId tid)
sewardjaf44c822007-11-25 14:01:38 +00001376{
bartbedfd232009-03-26 19:07:15 +00001377 Segment* p;
sewardjaf44c822007-11-25 14:01:38 +00001378
bartbedfd232009-03-26 19:07:15 +00001379 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1380 && tid != DRD_INVALID_THREADID);
1381 tl_assert(tid == DRD_(g_drd_running_tid));
sewardjaf44c822007-11-25 14:01:38 +00001382
bart54803fe2009-06-21 09:26:27 +00001383 s_compute_conflict_set_count++;
bartbedfd232009-03-26 19:07:15 +00001384 s_conflict_set_bitmap_creation_count
1385 -= DRD_(bm_get_bitmap_creation_count)();
1386 s_conflict_set_bitmap2_creation_count
1387 -= DRD_(bm_get_bitmap2_creation_count)();
sewardjaf44c822007-11-25 14:01:38 +00001388
bartae37e6d2012-01-22 08:58:31 +00001389 if (*conflict_set) {
bartf6ec1fe2009-06-21 18:07:35 +00001390 DRD_(bm_cleanup)(*conflict_set);
1391 DRD_(bm_init)(*conflict_set);
bartae37e6d2012-01-22 08:58:31 +00001392 } else {
bartf6ec1fe2009-06-21 18:07:35 +00001393 *conflict_set = DRD_(bm_new)();
1394 }
bart26f73e12008-02-24 18:37:08 +00001395
bartae37e6d2012-01-22 08:58:31 +00001396 if (s_trace_conflict_set) {
bart8f822af2009-06-08 18:20:42 +00001397 char* str;
bart26f73e12008-02-24 18:37:08 +00001398
bartc6bf1842012-01-22 08:40:42 +00001399 str = DRD_(vc_aprint)(DRD_(thread_get_vc)(tid));
bart8f822af2009-06-08 18:20:42 +00001400 VG_(message)(Vg_DebugMsg,
bart63c92ea2009-07-19 17:53:56 +00001401 "computing conflict set for thread %d with vc %s\n",
1402 tid, str);
bart8f822af2009-06-08 18:20:42 +00001403 VG_(free)(str);
bartbedfd232009-03-26 19:07:15 +00001404 }
sewardjaf44c822007-11-25 14:01:38 +00001405
bart91b7ec32012-01-25 20:36:27 +00001406 p = DRD_(g_threadinfo)[tid].sg_last;
bartbedfd232009-03-26 19:07:15 +00001407 {
1408 unsigned j;
1409
bart91b7ec32012-01-25 20:36:27 +00001410 if (s_trace_conflict_set) {
bart8f822af2009-06-08 18:20:42 +00001411 char* vc;
bartbedfd232009-03-26 19:07:15 +00001412
bart8f822af2009-06-08 18:20:42 +00001413 vc = DRD_(vc_aprint)(&p->vc);
sewardj1e29ebc2009-07-15 14:49:17 +00001414 VG_(message)(Vg_DebugMsg, "conflict set: thread [%d] at vc %s\n",
bart8f822af2009-06-08 18:20:42 +00001415 tid, vc);
1416 VG_(free)(vc);
bart26f73e12008-02-24 18:37:08 +00001417 }
sewardjaf44c822007-11-25 14:01:38 +00001418
bart91b7ec32012-01-25 20:36:27 +00001419 for (j = 0; j < DRD_N_THREADS; j++) {
1420 if (j != tid && DRD_(IsValidDrdThreadId)(j)) {
bart8f822af2009-06-08 18:20:42 +00001421 Segment* q;
bart91b7ec32012-01-25 20:36:27 +00001422
1423 for (q = DRD_(g_threadinfo)[j].sg_last; q; q = q->thr_prev) {
1424 if (!DRD_(vc_lte)(&q->vc, &p->vc)
1425 && !DRD_(vc_lte)(&p->vc, &q->vc)) {
1426 if (s_trace_conflict_set) {
bart8f822af2009-06-08 18:20:42 +00001427 char* str;
1428
1429 str = DRD_(vc_aprint)(&q->vc);
1430 VG_(message)(Vg_DebugMsg,
sewardj1e29ebc2009-07-15 14:49:17 +00001431 "conflict set: [%d] merging segment %s\n",
bart8f822af2009-06-08 18:20:42 +00001432 j, str);
1433 VG_(free)(str);
bartbedfd232009-03-26 19:07:15 +00001434 }
bart8f822af2009-06-08 18:20:42 +00001435 DRD_(bm_merge2)(*conflict_set, DRD_(sg_bm)(q));
bart91b7ec32012-01-25 20:36:27 +00001436 } else {
1437 if (s_trace_conflict_set) {
bart8f822af2009-06-08 18:20:42 +00001438 char* str;
1439
1440 str = DRD_(vc_aprint)(&q->vc);
1441 VG_(message)(Vg_DebugMsg,
sewardj1e29ebc2009-07-15 14:49:17 +00001442 "conflict set: [%d] ignoring segment %s\n",
bart8f822af2009-06-08 18:20:42 +00001443 j, str);
1444 VG_(free)(str);
bartbedfd232009-03-26 19:07:15 +00001445 }
1446 }
1447 }
1448 }
1449 }
1450 }
sewardjaf44c822007-11-25 14:01:38 +00001451
bartbedfd232009-03-26 19:07:15 +00001452 s_conflict_set_bitmap_creation_count
1453 += DRD_(bm_get_bitmap_creation_count)();
1454 s_conflict_set_bitmap2_creation_count
1455 += DRD_(bm_get_bitmap2_creation_count)();
1456
bart91b7ec32012-01-25 20:36:27 +00001457 if (s_trace_conflict_set_bm) {
sewardj1e29ebc2009-07-15 14:49:17 +00001458 VG_(message)(Vg_DebugMsg, "[%d] new conflict set:\n", tid);
bartbedfd232009-03-26 19:07:15 +00001459 DRD_(bm_print)(*conflict_set);
sewardj1e29ebc2009-07-15 14:49:17 +00001460 VG_(message)(Vg_DebugMsg, "[%d] end of new conflict set.\n", tid);
bartbedfd232009-03-26 19:07:15 +00001461 }
sewardjaf44c822007-11-25 14:01:38 +00001462}
1463
bart8f822af2009-06-08 18:20:42 +00001464/**
1465 * Update the conflict set after the vector clock of thread tid has been
1466 * updated from old_vc to its current value, either because a new segment has
1467 * been created or because of a synchronization operation.
1468 */
1469void DRD_(thread_update_conflict_set)(const DrdThreadId tid,
1470 const VectorClock* const old_vc)
1471{
1472 const VectorClock* new_vc;
1473 Segment* p;
1474 unsigned j;
1475
1476 tl_assert(0 <= (int)tid && tid < DRD_N_THREADS
1477 && tid != DRD_INVALID_THREADID);
1478 tl_assert(old_vc);
1479 tl_assert(tid == DRD_(g_drd_running_tid));
1480 tl_assert(DRD_(g_conflict_set));
1481
bartae37e6d2012-01-22 08:58:31 +00001482 if (s_trace_conflict_set) {
bart8f822af2009-06-08 18:20:42 +00001483 char* str;
1484
bartc6bf1842012-01-22 08:40:42 +00001485 str = DRD_(vc_aprint)(DRD_(thread_get_vc)(tid));
bart8f822af2009-06-08 18:20:42 +00001486 VG_(message)(Vg_DebugMsg,
bart63c92ea2009-07-19 17:53:56 +00001487 "updating conflict set for thread %d with vc %s\n",
1488 tid, str);
bart8f822af2009-06-08 18:20:42 +00001489 VG_(free)(str);
1490 }
1491
bartc6bf1842012-01-22 08:40:42 +00001492 new_vc = DRD_(thread_get_vc)(tid);
bartf5fe4b62011-07-03 11:39:30 +00001493 tl_assert(DRD_(vc_lte)(old_vc, new_vc));
bart8f822af2009-06-08 18:20:42 +00001494
1495 DRD_(bm_unmark)(DRD_(g_conflict_set));
1496
1497 for (j = 0; j < DRD_N_THREADS; j++)
1498 {
1499 Segment* q;
1500
1501 if (j == tid || ! DRD_(IsValidDrdThreadId)(j))
1502 continue;
1503
bart91b7ec32012-01-25 20:36:27 +00001504 for (q = DRD_(g_threadinfo)[j].sg_last;
1505 q && !DRD_(vc_lte)(&q->vc, new_vc);
1506 q = q->thr_prev) {
1507 const Bool included_in_old_conflict_set
1508 = !DRD_(vc_lte)(old_vc, &q->vc);
1509 const Bool included_in_new_conflict_set
1510 = !DRD_(vc_lte)(new_vc, &q->vc);
bart178b6862011-07-29 12:30:43 +00001511
1512 if (UNLIKELY(s_trace_conflict_set)) {
1513 char* str;
1514
1515 str = DRD_(vc_aprint)(&q->vc);
1516 VG_(message)(Vg_DebugMsg,
1517 "conflict set: [%d] %s segment %s\n", j,
1518 included_in_old_conflict_set
1519 != included_in_new_conflict_set
1520 ? "merging" : "ignoring", str);
1521 VG_(free)(str);
1522 }
1523 if (included_in_old_conflict_set != included_in_new_conflict_set)
1524 DRD_(bm_mark)(DRD_(g_conflict_set), DRD_(sg_bm)(q));
1525 }
1526
bart91b7ec32012-01-25 20:36:27 +00001527 for ( ; q && !DRD_(vc_lte)(&q->vc, old_vc); q = q->thr_prev) {
1528 const Bool included_in_old_conflict_set
1529 = !DRD_(vc_lte)(old_vc, &q->vc);
1530 const Bool included_in_new_conflict_set
1531 = !DRD_(vc_lte)(&q->vc, new_vc)
1532 && !DRD_(vc_lte)(new_vc, &q->vc);
bart178b6862011-07-29 12:30:43 +00001533
1534 if (UNLIKELY(s_trace_conflict_set)) {
bartac5b95b2011-07-03 11:43:45 +00001535 char* str;
1536
1537 str = DRD_(vc_aprint)(&q->vc);
1538 VG_(message)(Vg_DebugMsg,
1539 "conflict set: [%d] %s segment %s\n", j,
1540 included_in_old_conflict_set
1541 != included_in_new_conflict_set
1542 ? "merging" : "ignoring", str);
1543 VG_(free)(str);
1544 }
bart8f822af2009-06-08 18:20:42 +00001545 if (included_in_old_conflict_set != included_in_new_conflict_set)
bart8f822af2009-06-08 18:20:42 +00001546 DRD_(bm_mark)(DRD_(g_conflict_set), DRD_(sg_bm)(q));
bart8f822af2009-06-08 18:20:42 +00001547 }
1548 }
1549
1550 DRD_(bm_clear_marked)(DRD_(g_conflict_set));
1551
bart91b7ec32012-01-25 20:36:27 +00001552 p = DRD_(g_threadinfo)[tid].sg_last;
1553 for (j = 0; j < DRD_N_THREADS; j++) {
1554 if (j != tid && DRD_(IsValidDrdThreadId)(j)) {
bart4b3fdb22011-07-03 11:40:49 +00001555 Segment* q;
bart91b7ec32012-01-25 20:36:27 +00001556 for (q = DRD_(g_threadinfo)[j].sg_last;
1557 q && !DRD_(vc_lte)(&q->vc, &p->vc);
1558 q = q->thr_prev) {
bart178b6862011-07-29 12:30:43 +00001559 if (!DRD_(vc_lte)(&p->vc, &q->vc))
bart4b3fdb22011-07-03 11:40:49 +00001560 DRD_(bm_merge2_marked)(DRD_(g_conflict_set), DRD_(sg_bm)(q));
bart8f822af2009-06-08 18:20:42 +00001561 }
1562 }
1563 }
1564
1565 DRD_(bm_remove_cleared_marked)(DRD_(g_conflict_set));
1566
bart54803fe2009-06-21 09:26:27 +00001567 s_update_conflict_set_count++;
bart8f822af2009-06-08 18:20:42 +00001568
1569 if (s_trace_conflict_set_bm)
1570 {
sewardj1e29ebc2009-07-15 14:49:17 +00001571 VG_(message)(Vg_DebugMsg, "[%d] updated conflict set:\n", tid);
bart8f822af2009-06-08 18:20:42 +00001572 DRD_(bm_print)(DRD_(g_conflict_set));
sewardj1e29ebc2009-07-15 14:49:17 +00001573 VG_(message)(Vg_DebugMsg, "[%d] end of updated conflict set.\n", tid);
bart8f822af2009-06-08 18:20:42 +00001574 }
1575
1576 tl_assert(thread_conflict_set_up_to_date(DRD_(g_drd_running_tid)));
1577}
1578
bart86a87df2009-03-04 19:26:47 +00001579/** Report the number of context switches performed. */
bart62a784c2009-02-15 13:11:14 +00001580ULong DRD_(thread_get_context_switch_count)(void)
sewardjaf44c822007-11-25 14:01:38 +00001581{
bartbedfd232009-03-26 19:07:15 +00001582 return s_context_switch_count;
sewardjaf44c822007-11-25 14:01:38 +00001583}
1584
bart86a87df2009-03-04 19:26:47 +00001585/** Report the number of ordered segments that have been discarded. */
bart62a784c2009-02-15 13:11:14 +00001586ULong DRD_(thread_get_discard_ordered_segments_count)(void)
sewardjaf44c822007-11-25 14:01:38 +00001587{
bartbedfd232009-03-26 19:07:15 +00001588 return s_discard_ordered_segments_count;
sewardjaf44c822007-11-25 14:01:38 +00001589}
1590
bart54803fe2009-06-21 09:26:27 +00001591/** Return how many times the conflict set has been updated entirely. */
1592ULong DRD_(thread_get_compute_conflict_set_count)()
sewardjaf44c822007-11-25 14:01:38 +00001593{
bart54803fe2009-06-21 09:26:27 +00001594 return s_compute_conflict_set_count;
1595}
1596
1597/** Return how many times the conflict set has been updated partially. */
1598ULong DRD_(thread_get_update_conflict_set_count)(void)
1599{
bartbedfd232009-03-26 19:07:15 +00001600 return s_update_conflict_set_count;
sewardjaf44c822007-11-25 14:01:38 +00001601}
1602
bart86a87df2009-03-04 19:26:47 +00001603/**
barte5214662009-06-21 11:51:23 +00001604 * Return how many times the conflict set has been updated partially
1605 * because a new segment has been created.
1606 */
1607ULong DRD_(thread_get_update_conflict_set_new_sg_count)(void)
1608{
1609 return s_update_conflict_set_new_sg_count;
1610}
1611
1612/**
1613 * Return how many times the conflict set has been updated partially
1614 * because of combining vector clocks due to synchronization operations
1615 * other than reader/writer lock or barrier operations.
1616 */
1617ULong DRD_(thread_get_update_conflict_set_sync_count)(void)
1618{
1619 return s_update_conflict_set_sync_count;
1620}
1621
1622/**
1623 * Return how many times the conflict set has been updated partially
1624 * because of thread joins.
1625 */
1626ULong DRD_(thread_get_update_conflict_set_join_count)(void)
1627{
1628 return s_update_conflict_set_join_count;
1629}
1630
1631/**
bart86a87df2009-03-04 19:26:47 +00001632 * Return the number of first-level bitmaps that have been created during
1633 * conflict set updates.
1634 */
bart62a784c2009-02-15 13:11:14 +00001635ULong DRD_(thread_get_conflict_set_bitmap_creation_count)(void)
sewardjaf44c822007-11-25 14:01:38 +00001636{
bartbedfd232009-03-26 19:07:15 +00001637 return s_conflict_set_bitmap_creation_count;
sewardjaf44c822007-11-25 14:01:38 +00001638}
1639
bart86a87df2009-03-04 19:26:47 +00001640/**
1641 * Return the number of second-level bitmaps that have been created during
1642 * conflict set updates.
1643 */
bart62a784c2009-02-15 13:11:14 +00001644ULong DRD_(thread_get_conflict_set_bitmap2_creation_count)(void)
sewardjaf44c822007-11-25 14:01:38 +00001645{
bartbedfd232009-03-26 19:07:15 +00001646 return s_conflict_set_bitmap2_creation_count;
sewardjaf44c822007-11-25 14:01:38 +00001647}