David Majnemer 00940fb854 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.

llvm-svn: 278837

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

…

metadata.ll

…