Skip to content

Commit 275baed

Browse files
authored
[LAA] Consider accessed addrspace when mapping underlying obj to access. (#129087)
In some cases, it is possible for the same underlying object to be accessed via pointers to different address spaces. This could lead to pointers from different address spaces ending up in the same dependency set, which isn't allowed (and triggers an assertion). Update the mapping from underlying object -> last access to also include the accessing address space. Fixes #124759. PR: #129087
1 parent 23efe73 commit 275baed

File tree

2 files changed

+47
-4
lines changed

2 files changed

+47
-4
lines changed

llvm/lib/Analysis/LoopAccessAnalysis.cpp

+8-4
Original file line numberDiff line numberDiff line change
@@ -1362,8 +1362,10 @@ void AccessAnalysis::processMemAccesses() {
13621362

13631363
bool SetHasWrite = false;
13641364

1365-
// Map of pointers to last access encountered.
1366-
typedef DenseMap<const Value*, MemAccessInfo> UnderlyingObjToAccessMap;
1365+
// Map of (pointer to underlying objects, accessed address space) to last
1366+
// access encountered.
1367+
typedef DenseMap<std::pair<const Value *, unsigned>, MemAccessInfo>
1368+
UnderlyingObjToAccessMap;
13671369
UnderlyingObjToAccessMap ObjToLastAccess;
13681370

13691371
// Set of access to check after all writes have been processed.
@@ -1443,8 +1445,10 @@ void AccessAnalysis::processMemAccesses() {
14431445
UnderlyingObj->getType()->getPointerAddressSpace()))
14441446
continue;
14451447

1446-
auto [It, Inserted] =
1447-
ObjToLastAccess.try_emplace(UnderlyingObj, Access);
1448+
auto [It, Inserted] = ObjToLastAccess.try_emplace(
1449+
{UnderlyingObj,
1450+
cast<PointerType>(Ptr->getType())->getAddressSpace()},
1451+
Access);
14481452
if (!Inserted) {
14491453
DepCands.unionSets(Access, It->second);
14501454
It->second = Access;
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
2+
; RUN: opt -passes='print<access-info>' -disable-output %s 2>&1 | FileCheck %s
3+
4+
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
5+
6+
; Test case for https://github.com/llvm/llvm-project/issues/124759. The same
7+
; underlying object is access through pointers with different address spaces.
8+
define void @same_underlying_object_different_address_spaces(ptr %dst1.as1, ptr %dst2.as1) {
9+
; CHECK-LABEL: 'same_underlying_object_different_address_spaces'
10+
; CHECK-NEXT: loop:
11+
; CHECK-NEXT: Report: cannot identify array bounds
12+
; CHECK-NEXT: Dependences:
13+
; CHECK-NEXT: Run-time memory checks:
14+
; CHECK-NEXT: Grouped accesses:
15+
; CHECK-EMPTY:
16+
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
17+
; CHECK-NEXT: SCEV assumptions:
18+
; CHECK-EMPTY:
19+
; CHECK-NEXT: Expressions re-written:
20+
;
21+
entry:
22+
%alloc = alloca i8, i64 0, align 128
23+
%as3 = addrspacecast ptr %alloc to ptr addrspace(3)
24+
%as4 = addrspacecast ptr %alloc to ptr addrspace(4)
25+
br label %loop
26+
27+
loop:
28+
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
29+
store i32 0, ptr addrspace(4) %as4, align 4
30+
store i32 0, ptr %dst1.as1, align 4
31+
%l = load i64, ptr addrspace(3) %as3, align 4
32+
store i64 %l, ptr %dst2.as1, align 4
33+
%iv.next = add i64 %iv, 1
34+
%c = icmp eq i64 %iv.next, 100
35+
br i1 %c, label %loop, label %exit
36+
37+
exit:
38+
ret void
39+
}

0 commit comments

Comments
 (0)