mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-28 22:20:37 +00:00
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
This commit is contained in:
parent
93042d1dc8
commit
d272fee398
@ -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;
|
||||
}
|
||||
};
|
||||
|
Loading…
Reference in New Issue
Block a user