the sorting predicate should work for comparing an element

to itself, even though this isn't wildly useful.

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

diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp
index 46e4b09507d98fc20f196c32d981b2156de9e811..e0fa7c82f8cb273813fbeac56fd1fb0e88f7e6f7 100644 (file)
--- a/utils/TableGen/DAGISelEmitter.cpp
+++ b/utils/TableGen/DAGISelEmitter.cpp
@@ -180,7 +180,7 @@ struct PatternSortingPredicate {
     if (LHSPatSize > RHSPatSize) return false;
     
     // Sort based on the UID of the pattern, giving us a deterministic ordering.
-    assert(LHS->ID != RHS->ID);
+    assert(LHS == RHS || LHS->ID != RHS->ID);
     return LHS->ID < RHS->ID;
   }
 };