@@ -520,14 +520,13 @@ void RuntimePointerChecking::groupChecks(
520
520
Pointers[I].IsWritePtr );
521
521
522
522
SmallVector<RuntimeCheckingPtrGroup, 2 > Groups;
523
- auto LeaderI = DepCands.findValue (DepCands.getLeaderValue (Access));
524
523
525
524
// Because DepCands is constructed by visiting accesses in the order in
526
525
// which they appear in alias sets (which is deterministic) and the
527
526
// iteration order within an equivalence class member is only dependent on
528
527
// the order in which unions and insertions are performed on the
529
528
// equivalence class, the iteration order is deterministic.
530
- for (auto MI = DepCands.member_begin (LeaderI ), ME = DepCands.member_end ();
529
+ for (auto MI = DepCands.findLeader (Access ), ME = DepCands.member_end ();
531
530
MI != ME; ++MI) {
532
531
auto PointerI = PositionMap.find (MI->getPointer ());
533
532
assert (PointerI != PositionMap.end () &&
@@ -2264,13 +2263,9 @@ bool MemoryDepChecker::areDepsSafe(const DepCandidates &AccessSets,
2264
2263
if (Visited.count (CurAccess))
2265
2264
continue ;
2266
2265
2267
- // Get the relevant memory access set.
2268
- EquivalenceClasses<MemAccessInfo>::iterator I =
2269
- AccessSets.findValue (AccessSets.getLeaderValue (CurAccess));
2270
-
2271
2266
// Check accesses within this set.
2272
2267
EquivalenceClasses<MemAccessInfo>::member_iterator AI =
2273
- AccessSets.member_begin (I );
2268
+ AccessSets.findLeader (CurAccess );
2274
2269
EquivalenceClasses<MemAccessInfo>::member_iterator AE =
2275
2270
AccessSets.member_end ();
2276
2271
0 commit comments