mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-26 14:58:59 -04:00
6c5abe88bf
This avoids generating two gep's for common array operations. Before we would generate something like: %tmp = load i32* %X.addr ; <i32> [#uses=1] %arraydecay = getelementptr inbounds [100 x i32]* %A, i32 0, i32 0 ; <i32*> [#uses=1] %arrayidx = getelementptr inbounds i32* %arraydecay, i32 %tmp ; <i32*> [#uses=1] %tmp1 = load i32* %arrayidx ; <i32> [#uses=1] Now we generate: %tmp = load i32* %X.addr ; <i32> [#uses=1] %arrayidx = getelementptr inbounds [100 x i32]* %A, i32 0, i32 %tmp ; <i32*> [#uses=1] %tmp1 = load i32* %arrayidx ; <i32> [#uses=1] Less IR is better at -O0. llvm-svn: 106966
43 lines
1009 B
C
43 lines
1009 B
C
// RUN: %clang_cc1 -emit-llvm %s -o - | FileCheck %s
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(2)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
// CHECK: addrspace(1)
|
|
|
|
// Check that we don't lose the address space when accessing an array element
|
|
// inside a structure.
|
|
|
|
#define __addr1 __attribute__((address_space(1)))
|
|
#define __addr2 __attribute__((address_space(2)))
|
|
|
|
typedef struct S {
|
|
int arr[ 3 ];
|
|
} S;
|
|
|
|
void test_addrspace(__addr1 S* p1, __addr2 S*p2, int* val, int n) {
|
|
for (int i=0; i < 3; ++i) {
|
|
int t = val[i];
|
|
p1->arr[i] = p2->arr[i];
|
|
}
|
|
}
|