RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-24 04:32:09 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Typos. NFC.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@274038 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chad Rosier 2016-06-28 17:19:10 +00:00
parent 558b25ffb5
commit 8c043bfa10
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/Analysis/MemoryDependenceAnalysis.cpp
View File

@ -402,7 +402,7 @@ MemDepResult MemoryDependenceResults::getSimplePointerDependencyFrom(
bool isInvariantLoad = false;
// We must be careful with atomic accesses, as they may allow another thread
// to touch this location, cloberring it. We are conservative: if the
// to touch this location, clobbering it. We are conservative: if the
// QueryInst is not a simple (non-atomic) memory access, we automatically
// return getClobber.
// If it is simple, we know based on the results of
@ -423,9 +423,9 @@ MemDepResult MemoryDependenceResults::getSimplePointerDependencyFrom(
// with synchronization from 1 to 2 and from 3 to 4, resulting in %val
// being 42. A key property of this program however is that if either
// 1 or 4 were missing, there would be a race between the store of 42
// either the store of 0 or the load (making the whole progam racy).
// either the store of 0 or the load (making the whole program racy).
// The paper mentioned above shows that the same property is respected
// by every program that can detect any optimisation of that kind: either
// by every program that can detect any optimization of that kind: either
// it is racy (undefined) or there is a release followed by an acquire
// between the pair of accesses under consideration.