@@ -10267,7 +10267,7 @@ static std::pair<size_t, size_t> generateKeySubkey(
1026710267 } else {
1026810268 SubKey = hash_value(I->getOpcode());
1026910269 }
10270- Key = hash_combine(hash_value(I->getParent()), Key);
10270+ Key = hash_combine(hash_value(I->getParent()->getNumber() ), Key);
1027110271 }
1027210272 return std::make_pair(Key, SubKey);
1027310273}
@@ -13353,7 +13353,7 @@ void BoUpSLP::reorderGatherNode(TreeEntry &TE) {
1335313353 return;
1335413354
1335513355 auto GenerateLoadsSubkey = [&](size_t Key, LoadInst *LI) {
13356- Key = hash_combine(hash_value(LI->getParent()), Key);
13356+ Key = hash_combine(hash_value(LI->getParent()->getNumber() ), Key);
1335713357 Value *Ptr =
1335813358 getUnderlyingObject(LI->getPointerOperand(), RecursionMaxDepth);
1335913359 if (LoadKeyUsed.contains(Key)) {
@@ -26325,7 +26325,7 @@ class HorizontalReduction {
2632526325 SmallSet<size_t, 2> LoadKeyUsed;
2632626326
2632726327 auto GenerateLoadsSubkey = [&](size_t Key, LoadInst *LI) {
26328- Key = hash_combine(hash_value(LI->getParent()), Key);
26328+ Key = hash_combine(hash_value(LI->getParent()->getNumber() ), Key);
2632926329 Value *Ptr =
2633026330 getUnderlyingObject(LI->getPointerOperand(), RecursionMaxDepth);
2633126331 if (!LoadKeyUsed.insert(Key).second) {
0 commit comments