Silviu Baranga 5b50110192 Cleanup after r241809 - remove uncessary call to std::sort ... Summary: The iteration order within a member of DepCands is deterministic and therefore we don't have to sort the accesses within a member. We also don't have to copy the indices of the pointers into a vector, since we can iterate over the members of the class. Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D11145 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@242033 91177308-0d34-0410-b5e6-96231b3b80d8		2015-07-13 14:48:24 +00:00
..
backward-dep-different-types.ll
non-wrapping-pointer.ll	[LAA] Try to prove non-wrapping of pointers if SCEV cannot	2015-06-26 17:25:43 +00:00
number-of-memchecks.ll	Cleanup after r241809 - remove uncessary call to std::sort	2015-07-13 14:48:24 +00:00
pointer-with-unknown-bounds.ll	[LAA] Revert a small part of r239295	2015-07-08 22:58:48 +00:00
resort-to-memchecks-only.ll	[LAA] Merge memchecks for accesses separated by a constant offset	2015-07-08 09:16:33 +00:00
safe-no-checks.ll
store-to-invariant-check1.ll
store-to-invariant-check2.ll
store-to-invariant-check3.ll
stride-access-dependence.ll	[LoopAccessAnalysis] Teach LAA to check the memory dependence between strided accesses.	2015-06-08 04:48:37 +00:00
underlying-objects-1.ll
underlying-objects-2.ll
unsafe-and-rt-checks.ll	Cleanup after r241809 - remove uncessary call to std::sort	2015-07-13 14:48:24 +00:00