|
5 | 5 | // CHECK-LABEL: @array_load
|
6 | 6 | #[no_mangle]
|
7 | 7 | pub fn array_load(a: &[u8; 4]) -> [u8; 4] {
|
8 |
| - // CHECK: %_0 = alloca [4 x i8], align 1 |
9 |
| - // CHECK: %[[TEMP1:.+]] = load <4 x i8>, ptr %a, align 1 |
10 |
| - // CHECK: store <4 x i8> %[[TEMP1]], ptr %_0, align 1 |
11 |
| - // CHECK: %[[TEMP2:.+]] = load i32, ptr %_0, align 1 |
12 |
| - // CHECK: ret i32 %[[TEMP2]] |
| 8 | + // CHECK-NOT: alloca |
| 9 | + // CHECK: %[[ALLOCA:.+]] = alloca [4 x i8], align 1 |
| 10 | + // CHECK-NOT: alloca |
| 11 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %[[ALLOCA]], ptr align 1 %a, {{.+}} 4, i1 false) |
| 12 | + // CHECK: %[[TEMP:.+]] = load i32, ptr %[[ALLOCA]], align 1 |
| 13 | + // CHECK: ret i32 %[[TEMP]] |
13 | 14 | *a
|
14 | 15 | }
|
15 | 16 |
|
16 | 17 | // CHECK-LABEL: @array_store
|
17 | 18 | #[no_mangle]
|
18 | 19 | pub fn array_store(a: [u8; 4], p: &mut [u8; 4]) {
|
| 20 | + // CHECK-NOT: alloca |
| 21 | + // CHECK: %[[TEMP:.+]] = alloca i32, [[TEMPALIGN:align [0-9]+]] |
| 22 | + // CHECK-NOT: alloca |
19 | 23 | // CHECK: %a = alloca [4 x i8]
|
20 |
| - // CHECK: %[[TEMP:.+]] = load <4 x i8>, ptr %a, align 1 |
21 |
| - // CHECK-NEXT: store <4 x i8> %[[TEMP]], ptr %p, align 1 |
| 24 | + // CHECK-NOT: alloca |
| 25 | + // store i32 %0, ptr %[[TEMP]] |
| 26 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %a, ptr [[TEMPALIGN]] %[[TEMP]], {{.+}} 4, i1 false) |
| 27 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %p, ptr align 1 %a, {{.+}} 4, i1 false) |
22 | 28 | *p = a;
|
23 | 29 | }
|
24 | 30 |
|
25 | 31 | // CHECK-LABEL: @array_copy
|
26 | 32 | #[no_mangle]
|
27 | 33 | pub fn array_copy(a: &[u8; 4], p: &mut [u8; 4]) {
|
| 34 | + // CHECK-NOT: alloca |
28 | 35 | // CHECK: %[[LOCAL:.+]] = alloca [4 x i8], align 1
|
29 |
| - // CHECK: %[[TEMP1:.+]] = load <4 x i8>, ptr %a, align 1 |
30 |
| - // CHECK: store <4 x i8> %[[TEMP1]], ptr %[[LOCAL]], align 1 |
31 |
| - // CHECK: %[[TEMP2:.+]] = load <4 x i8>, ptr %[[LOCAL]], align 1 |
32 |
| - // CHECK: store <4 x i8> %[[TEMP2]], ptr %p, align 1 |
| 36 | + // CHECK-NOT: alloca |
| 37 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %[[LOCAL]], ptr align 1 %a, {{.+}} 4, i1 false) |
| 38 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %p, ptr align 1 %[[LOCAL]], {{.+}} 4, i1 false) |
33 | 39 | *p = *a;
|
34 | 40 | }
|
35 | 41 |
|
36 | 42 | // CHECK-LABEL: @array_copy_1_element
|
37 | 43 | #[no_mangle]
|
38 | 44 | pub fn array_copy_1_element(a: &[u8; 1], p: &mut [u8; 1]) {
|
| 45 | + // CHECK-NOT: alloca |
39 | 46 | // CHECK: %[[LOCAL:.+]] = alloca [1 x i8], align 1
|
40 |
| - // CHECK: %[[TEMP1:.+]] = load i8, ptr %a, align 1 |
41 |
| - // CHECK: store i8 %[[TEMP1]], ptr %[[LOCAL]], align 1 |
42 |
| - // CHECK: %[[TEMP2:.+]] = load i8, ptr %[[LOCAL]], align 1 |
43 |
| - // CHECK: store i8 %[[TEMP2]], ptr %p, align 1 |
| 47 | + // CHECK-NOT: alloca |
| 48 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %[[LOCAL]], ptr align 1 %a, {{.+}} 1, i1 false) |
| 49 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %p, ptr align 1 %[[LOCAL]], {{.+}} 1, i1 false) |
44 | 50 | *p = *a;
|
45 | 51 | }
|
46 | 52 |
|
47 | 53 | // CHECK-LABEL: @array_copy_2_elements
|
48 | 54 | #[no_mangle]
|
49 | 55 | pub fn array_copy_2_elements(a: &[u8; 2], p: &mut [u8; 2]) {
|
| 56 | + // CHECK-NOT: alloca |
50 | 57 | // CHECK: %[[LOCAL:.+]] = alloca [2 x i8], align 1
|
51 |
| - // CHECK: %[[TEMP1:.+]] = load <2 x i8>, ptr %a, align 1 |
52 |
| - // CHECK: store <2 x i8> %[[TEMP1]], ptr %[[LOCAL]], align 1 |
53 |
| - // CHECK: %[[TEMP2:.+]] = load <2 x i8>, ptr %[[LOCAL]], align 1 |
54 |
| - // CHECK: store <2 x i8> %[[TEMP2]], ptr %p, align 1 |
| 58 | + // CHECK-NOT: alloca |
| 59 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %[[LOCAL]], ptr align 1 %a, {{.+}} 2, i1 false) |
| 60 | + // CHECK: call void @llvm.memcpy.{{.+}}(ptr align 1 %p, ptr align 1 %[[LOCAL]], {{.+}} 2, i1 false) |
55 | 61 | *p = *a;
|
56 | 62 | }
|
0 commit comments