Fix typos in source code. Patch by Dmitriy (olshevskiy87@bk.ru).
Fixes BZ #349874
git-svn-id: svn://svn.valgrind.org/valgrind/trunk@15394 a5019735-40e9-0310-863c-91ae7b9d1cf9
diff --git a/helgrind/hg_basics.h b/helgrind/hg_basics.h
index 737cfa0..41ee803 100644
--- a/helgrind/hg_basics.h
+++ b/helgrind/hg_basics.h
@@ -80,7 +80,7 @@
1: "approx": collect one stack trace per (notional) segment, that
is, collect a stack trace for a thread every time its vector
- clock changes. This faciliates showing the bounds of the
+ clock changes. This facilitates showing the bounds of the
conflicting segment(s), with relatively small overhead.
2: "full": collect a stack trace every time the constraints for a
diff --git a/helgrind/hg_errors.c b/helgrind/hg_errors.c
index d2058d5..4941454 100644
--- a/helgrind/hg_errors.c
+++ b/helgrind/hg_errors.c
@@ -1212,7 +1212,7 @@
if (xe->XE.Race.h1_ct_mbsegendEC) {
VG_(pp_ExeContext)( xe->XE.Race.h1_ct_mbsegendEC );
} else {
- emit( " <auxwhat>(the end of the the thread)</auxwhat>\n" );
+ emit( " <auxwhat>(the end of the thread)</auxwhat>\n" );
}
}
@@ -1256,7 +1256,7 @@
if (xe->XE.Race.h1_ct_mbsegendEC) {
VG_(pp_ExeContext)( xe->XE.Race.h1_ct_mbsegendEC );
} else {
- emit( " (the end of the the thread)\n" );
+ emit( " (the end of the thread)\n" );
}
}
diff --git a/helgrind/hg_main.c b/helgrind/hg_main.c
index ccf1a56..b1a0aa3 100644
--- a/helgrind/hg_main.c
+++ b/helgrind/hg_main.c
@@ -3310,7 +3310,7 @@
{
/* TID declares that any happens-before edges notionally stored in
USERTAG can be deleted. If (as would normally be the case) a
- SO is associated with USERTAG, then the assocation is removed
+ SO is associated with USERTAG, then the association is removed
and all resources associated with SO are freed. Importantly,
that frees up any VTSs stored in SO. */
if (SHOW_EVENTS >= 1)
diff --git a/helgrind/libhb_core.c b/helgrind/libhb_core.c
index bbc1985..96f731c 100644
--- a/helgrind/libhb_core.c
+++ b/helgrind/libhb_core.c
@@ -143,7 +143,7 @@
a pair, (Thr*, ULong), but that takes 16 bytes on a 64-bit target.
We pack it into 64 bits by representing the Thr* using a ThrID, a
small integer (18 bits), and a 46 bit integer for the timestamp
- number. The 46/18 split is arbitary, but has the effect that
+ number. The 46/18 split is arbitrary, but has the effect that
Helgrind can only handle programs that create 2^18 or fewer threads
over their entire lifetime, and have no more than 2^46 timestamp
ticks (synchronisation operations on the same thread).
@@ -3014,7 +3014,7 @@
/* Now figure out when the next GC should be. We'll allow the
number of VTSs to double before GCing again. Except of course
that since we can't (or, at least, don't) shrink vts_tab, we
- can't set the threshhold value smaller than it. */
+ can't set the threshold value smaller than it. */
tl_assert(nFreed <= nTab);
nLive = nTab - nFreed;
tl_assert(nLive >= 0 && nLive <= nTab);
@@ -4306,7 +4306,7 @@
/* Find 'ec' in the RCEC list whose head pointer lives at 'headp' and
- move it one step closer the the front of the list, so as to make
+ move it one step closer to the front of the list, so as to make
subsequent searches for it cheaper. */
static void move_RCEC_one_step_forward ( RCEC** headp, RCEC* ec )
{
@@ -4354,7 +4354,7 @@
return a pointer to the copy. The caller can safely have 'example'
on its stack, since we will always return a pointer to a copy of
it, not to the original. Note that the inserted node will have .rc
- of zero and so the caller must immediatly increment it. */
+ of zero and so the caller must immediately increment it. */
__attribute__((noinline))
static RCEC* ctxt__find_or_add ( RCEC* example )
{
@@ -7067,7 +7067,7 @@
do_RCEC_GC();
/* If there are still no entries available (all the table entries are full),
- and we hit the threshhold point, then do a GC */
+ and we hit the threshold point, then do a GC */
Bool vts_tab_GC = vts_tab_freelist == VtsID_INVALID
&& VG_(sizeXA)( vts_tab ) >= vts_next_GC_at;
if (UNLIKELY (vts_tab_GC))