David Majnemer 662809578e Make MDNode::intersect faster than O(n * m) ...

It is pretty easy to get it down to O(nlogn + mlogm).  This
implementation has the added benefit of automatically deduplicating
entries between the two sets.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@278837 91177308-0d34-0410-b5e6-96231b3b80d8

2016-08-16 18:48:37 +00:00

..

loopversioningLICM1.ll

Make MDNode::intersect faster than O(n * m)

2016-08-16 18:48:37 +00:00

loopversioningLICM2.ll

Make MDNode::intersect faster than O(n * m)

2016-08-16 18:48:37 +00:00

loopversioningLICM3.ll

Corrected tests for Loop Versioning LICM, by adding “REQUIRES: asserts”.

2016-02-06 12:34:41 +00:00

metadata.ll

[LoopVersioningLICM] Add test coverage for llvm.loop.licm_versioning.disable

2016-04-22 18:34:50 +00:00