Silviu Baranga f283cd9acf Don't rely on the DepCands iteration order when constructing checking pointer groups ... Summary: The checking pointer group construction algorithm relied on the iteration on DepCands. We would need the same leaders across runs and the same iteration order over the underlying std::set for determinism. This changes the algorithm to process the pointers in the order in which they were added to the runtime check, which is deterministic. We need to update the tests, since the order in which pointers appear has changed. No new tests were added, since it is impossible to test for non-determinism. Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D11064 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@241809 91177308-0d34-0410-b5e6-96231b3b80d8		2015-07-09 15:18:25 +00:00
..
AssumptionCache
BasicAA
BlockFrequencyInfo
BranchProbabilityInfo
CallGraph	[CallGraph] Given -print-callgraph a stable printing order.	2015-06-19 23:20:31 +00:00
CFLAliasAnalysis
CostModel	[X86][SSE] Vectorized i64 uniform constant SRA shifts	2015-07-06 22:35:19 +00:00
Delinearization
DependenceAnalysis
DivergenceAnalysis/NVPTX
Dominators	Move the personality function from LandingPadInst to Function	2015-06-17 20:52:32 +00:00
GlobalsModRef
LazyCallGraph	[LazyCallGraph] Port test case from r240039 to LCG.	2015-07-02 02:03:58 +00:00
Lint	Move the personality function from LandingPadInst to Function	2015-06-17 20:52:32 +00:00
LoopAccessAnalysis	Don't rely on the DepCands iteration order when constructing checking pointer groups	2015-07-09 15:18:25 +00:00
LoopInfo
MemoryDependenceAnalysis
PostDominators
RegionInfo
ScalarEvolution
ScopedNoAliasAA
TypeBasedAliasAnalysis
ValueTracking