You can subscribe to this list here.
| 2002 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(1) |
Oct
(122) |
Nov
(152) |
Dec
(69) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2003 |
Jan
(6) |
Feb
(25) |
Mar
(73) |
Apr
(82) |
May
(24) |
Jun
(25) |
Jul
(10) |
Aug
(11) |
Sep
(10) |
Oct
(54) |
Nov
(203) |
Dec
(182) |
| 2004 |
Jan
(307) |
Feb
(305) |
Mar
(430) |
Apr
(312) |
May
(187) |
Jun
(342) |
Jul
(487) |
Aug
(637) |
Sep
(336) |
Oct
(373) |
Nov
(441) |
Dec
(210) |
| 2005 |
Jan
(385) |
Feb
(480) |
Mar
(636) |
Apr
(544) |
May
(679) |
Jun
(625) |
Jul
(810) |
Aug
(838) |
Sep
(634) |
Oct
(521) |
Nov
(965) |
Dec
(543) |
| 2006 |
Jan
(494) |
Feb
(431) |
Mar
(546) |
Apr
(411) |
May
(406) |
Jun
(322) |
Jul
(256) |
Aug
(401) |
Sep
(345) |
Oct
(542) |
Nov
(308) |
Dec
(481) |
| 2007 |
Jan
(427) |
Feb
(326) |
Mar
(367) |
Apr
(255) |
May
(244) |
Jun
(204) |
Jul
(223) |
Aug
(231) |
Sep
(354) |
Oct
(374) |
Nov
(497) |
Dec
(362) |
| 2008 |
Jan
(322) |
Feb
(482) |
Mar
(658) |
Apr
(422) |
May
(476) |
Jun
(396) |
Jul
(455) |
Aug
(267) |
Sep
(280) |
Oct
(253) |
Nov
(232) |
Dec
(304) |
| 2009 |
Jan
(486) |
Feb
(470) |
Mar
(458) |
Apr
(423) |
May
(696) |
Jun
(461) |
Jul
(551) |
Aug
(575) |
Sep
(134) |
Oct
(110) |
Nov
(157) |
Dec
(102) |
| 2010 |
Jan
(226) |
Feb
(86) |
Mar
(147) |
Apr
(117) |
May
(107) |
Jun
(203) |
Jul
(193) |
Aug
(238) |
Sep
(300) |
Oct
(246) |
Nov
(23) |
Dec
(75) |
| 2011 |
Jan
(133) |
Feb
(195) |
Mar
(315) |
Apr
(200) |
May
(267) |
Jun
(293) |
Jul
(353) |
Aug
(237) |
Sep
(278) |
Oct
(611) |
Nov
(274) |
Dec
(260) |
| 2012 |
Jan
(303) |
Feb
(391) |
Mar
(417) |
Apr
(441) |
May
(488) |
Jun
(655) |
Jul
(590) |
Aug
(610) |
Sep
(526) |
Oct
(478) |
Nov
(359) |
Dec
(372) |
| 2013 |
Jan
(467) |
Feb
(226) |
Mar
(391) |
Apr
(281) |
May
(299) |
Jun
(252) |
Jul
(311) |
Aug
(352) |
Sep
(481) |
Oct
(571) |
Nov
(222) |
Dec
(231) |
| 2014 |
Jan
(185) |
Feb
(329) |
Mar
(245) |
Apr
(238) |
May
(281) |
Jun
(399) |
Jul
(382) |
Aug
(500) |
Sep
(579) |
Oct
(435) |
Nov
(487) |
Dec
(256) |
| 2015 |
Jan
(338) |
Feb
(357) |
Mar
(330) |
Apr
(294) |
May
(191) |
Jun
(108) |
Jul
(142) |
Aug
(261) |
Sep
(190) |
Oct
(54) |
Nov
(83) |
Dec
(22) |
| 2016 |
Jan
(49) |
Feb
(89) |
Mar
(33) |
Apr
(50) |
May
(27) |
Jun
(34) |
Jul
(53) |
Aug
(53) |
Sep
(98) |
Oct
(206) |
Nov
(93) |
Dec
(53) |
| 2017 |
Jan
(65) |
Feb
(82) |
Mar
(102) |
Apr
(86) |
May
(187) |
Jun
(67) |
Jul
(23) |
Aug
(93) |
Sep
(65) |
Oct
(45) |
Nov
(35) |
Dec
(17) |
| 2018 |
Jan
(26) |
Feb
(35) |
Mar
(38) |
Apr
(32) |
May
(8) |
Jun
(43) |
Jul
(27) |
Aug
(30) |
Sep
(43) |
Oct
(42) |
Nov
(38) |
Dec
(67) |
| 2019 |
Jan
(32) |
Feb
(37) |
Mar
(53) |
Apr
(64) |
May
(49) |
Jun
(18) |
Jul
(14) |
Aug
(53) |
Sep
(25) |
Oct
(30) |
Nov
(49) |
Dec
(31) |
| 2020 |
Jan
(87) |
Feb
(45) |
Mar
(37) |
Apr
(51) |
May
(99) |
Jun
(36) |
Jul
(11) |
Aug
(14) |
Sep
(20) |
Oct
(24) |
Nov
(40) |
Dec
(23) |
| 2021 |
Jan
(14) |
Feb
(53) |
Mar
(85) |
Apr
(15) |
May
(19) |
Jun
(3) |
Jul
(14) |
Aug
(1) |
Sep
(57) |
Oct
(73) |
Nov
(56) |
Dec
(22) |
| 2022 |
Jan
(3) |
Feb
(22) |
Mar
(6) |
Apr
(55) |
May
(46) |
Jun
(39) |
Jul
(15) |
Aug
(9) |
Sep
(11) |
Oct
(34) |
Nov
(20) |
Dec
(36) |
| 2023 |
Jan
(79) |
Feb
(41) |
Mar
(99) |
Apr
(169) |
May
(48) |
Jun
(16) |
Jul
(16) |
Aug
(57) |
Sep
(19) |
Oct
|
Nov
|
Dec
|
| S | M | T | W | T | F | S |
|---|---|---|---|---|---|---|
|
|
|
|
|
|
1
(7) |
2
|
|
3
(1) |
4
(16) |
5
(6) |
6
(17) |
7
(18) |
8
(13) |
9
(7) |
|
10
(7) |
11
(15) |
12
(14) |
13
(10) |
14
(9) |
15
(17) |
16
(6) |
|
17
|
18
(18) |
19
(7) |
20
(20) |
21
(10) |
22
(8) |
23
(5) |
|
24
(2) |
25
(2) |
26
(10) |
27
|
28
|
29
|
30
|
|
31
(1) |
|
|
|
|
|
|
|
From: <sv...@va...> - 2010-10-25 18:19:13
|
Author: bart Date: 2010-10-25 19:18:54 +0100 (Mon, 25 Oct 2010) New Revision: 11477 Log: DRD: the help text does now indicate that lock contention detection is off by default / changed default value of the exclusive mutex threshold from 1000s to off. See also #255247. Modified: trunk/drd/drd_main.c trunk/drd/drd_mutex.c Modified: trunk/drd/drd_main.c =================================================================== --- trunk/drd/drd_main.c 2010-10-22 15:09:38 UTC (rev 11476) +++ trunk/drd/drd_main.c 2010-10-25 18:18:54 UTC (rev 11477) @@ -184,7 +184,8 @@ " --check-stack-var=yes|no Whether or not to report data races on\n" " stack variables [no].\n" " --exclusive-threshold=<n> Print an error message if any mutex or\n" -" writer lock is held longer than the specified time (in milliseconds).\n" +" writer lock is held longer than the specified\n" +" time (in milliseconds) [off].\n" " --first-race-only=yes|no Only report the first data race that occurs on\n" " a memory location instead of all races [no].\n" " --free-is-write=yes|no Whether to report races between freeing memory\n" @@ -201,7 +202,8 @@ " --segment-merging-interval=<n> Perform segment merging every time n new\n" " segments have been created. Default: %d.\n" " --shared-threshold=<n> Print an error message if a reader lock\n" -" is held longer than the specified time (in milliseconds).\n" +" is held longer than the specified time (in\n" +" milliseconds) [off]\n" " --show-confl-seg=yes|no Show conflicting segments in race reports [yes].\n" " --show-stack-usage=yes|no Print stack usage at thread exit time [no].\n" "\n" Modified: trunk/drd/drd_mutex.c =================================================================== --- trunk/drd/drd_mutex.c 2010-10-22 15:09:38 UTC (rev 11476) +++ trunk/drd/drd_mutex.c 2010-10-25 18:18:54 UTC (rev 11477) @@ -49,7 +49,7 @@ static Bool s_trace_mutex; static ULong s_mutex_lock_count; static ULong s_mutex_segment_creation_count; -static UInt s_mutex_lock_threshold_ms = 1000 * 1000; +static UInt s_mutex_lock_threshold_ms; /* Function definitions. */ |
|
From: Julian S. <js...@ac...> - 2010-10-25 07:30:11
|
> > Hmm, I'm not sure without further analysis. It might happen if your
> > program has a large number of locks at different addresses and it
> > locks them in a large number of different orders.
>
> What is exactly "a large number of locks at different addresses " :
> Doesn't each lock necessarily have its own address ?
The laog mechanism creates a directed graph, in which the locks are
nodes and an edge from lock A to lock B indicates that lock A must
be taken before lock B (for example).
When I say "the locks are nodes", I mean that nodes in the graph are
the addresses of the locks. If you allocate 100000 objects each with
its own lock and and then do { lock(A); lock(B); unlock(B); unlock(A); }
for a few million randomly chosen pairs (A,B) of those objects, then
you will end up with a graph with 100000 nodes and a few million edges.
What I am wondering is, maybe nodes are not removed from the graph when
memory is freed. So eventually the graph ends up with more and more
nodes. This is just a guess, I should point out.
J
|