[Hexagon] Avoid repeated hash lookups (NFC) (#127578)

kazutakahirata · web-flow · commit 06829f4f8fc0 · 2025-02-18T08:40:03.000-08:00
diff --git a/llvm/lib/Target/Hexagon/HexagonVectorCombine.cpp b/llvm/lib/Target/Hexagon/HexagonVectorCombine.cpp
@@ -1174,8 +1174,8 @@ auto AlignVectors::realignLoadGroup(IRBuilderBase &Builder,
   for (const ByteSpan::Block &B : VSpan) {
     ByteSpan ASection = ASpan.section(B.Pos, B.Seg.Size);
     for (const ByteSpan::Block &S : ASection) {
-      EarliestUser[S.Seg.Val] = std::min(
-          EarliestUser[S.Seg.Val], earliestUser(B.Seg.Val->uses()), isEarlier);
+      auto &EU = EarliestUser[S.Seg.Val];
+      EU = std::min(EU, earliestUser(B.Seg.Val->uses()), isEarlier);
     }
   }
 

Original file line number	Diff line number	Diff line change
`@@ -1174,8 +1174,8 @@ auto AlignVectors::realignLoadGroup(IRBuilderBase &Builder,`
`1174`	`1174`	`for (const ByteSpan::Block &B : VSpan) {`
`1175`	`1175`	`ByteSpan ASection = ASpan.section(B.Pos, B.Seg.Size);`
`1176`	`1176`	`for (const ByteSpan::Block &S : ASection) {`
`1177`		`- EarliestUser[S.Seg.Val] = std::min(`
`1178`		`- EarliestUser[S.Seg.Val], earliestUser(B.Seg.Val->uses()), isEarlier);`
	`1177`	`+ auto &EU = EarliestUser[S.Seg.Val];`
	`1178`	`+ EU = std::min(EU, earliestUser(B.Seg.Val->uses()), isEarlier);`
`1179`	`1179`	`}`
`1180`	`1180`	`}`
`1181`	`1181`