brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.4 KiB · 326ec8b Raw
119 lines · plain
1; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s2;3; Ensures that atomic loads count as MemoryDefs4 5; CHECK-LABEL: define i32 @foo6define i32 @foo(ptr %a, ptr %b) {7; CHECK: 1 = MemoryDef(liveOnEntry)8; CHECK-NEXT: store i32 49  store i32 4, ptr %a, align 410; CHECK: 2 = MemoryDef(1)11; CHECK-NEXT: %1 = load atomic i3212  %1 = load atomic i32, ptr %b acquire, align 413; CHECK: MemoryUse(2)14; CHECK-NEXT: %2 = load i3215  %2 = load i32, ptr %a, align 416  %3 = add i32 %1, %217  ret i32 %318}19 20; CHECK-LABEL: define void @bar21define void @bar(ptr %a) {22; CHECK: MemoryUse(liveOnEntry)23; CHECK-NEXT: load atomic i32, ptr %a unordered, align 424  load atomic i32, ptr %a unordered, align 425; CHECK: 1 = MemoryDef(liveOnEntry)26; CHECK-NEXT: load atomic i32, ptr %a monotonic, align 427  load atomic i32, ptr %a monotonic, align 428; CHECK: 2 = MemoryDef(1)29; CHECK-NEXT: load atomic i32, ptr %a acquire, align 430  load atomic i32, ptr %a acquire, align 431; CHECK: 3 = MemoryDef(2)32; CHECK-NEXT: load atomic i32, ptr %a seq_cst, align 433  load atomic i32, ptr %a seq_cst, align 434  ret void35}36 37; CHECK-LABEL: define void @baz38define void @baz(ptr %a) {39; CHECK: 1 = MemoryDef(liveOnEntry)40; CHECK-NEXT: %1 = load atomic i3241  %1 = load atomic i32, ptr %a acquire, align 442; CHECK: MemoryUse(1)43; CHECK-NEXT: %2 = load atomic i32, ptr %a unordered, align 444  %2 = load atomic i32, ptr %a unordered, align 445; CHECK: 2 = MemoryDef(1)46; CHECK-NEXT: %3 = load atomic i32, ptr %a monotonic, align 447  %3 = load atomic i32, ptr %a monotonic, align 448  ret void49}50 51; CHECK-LABEL: define void @fences52define void @fences(ptr %a) {53; CHECK: 1 = MemoryDef(liveOnEntry)54; CHECK-NEXT: fence acquire55  fence acquire56; CHECK: MemoryUse(1)57; CHECK-NEXT: %1 = load i32, ptr %a58  %1 = load i32, ptr %a59 60; CHECK: 2 = MemoryDef(1)61; CHECK-NEXT: fence release62  fence release63; CHECK: MemoryUse(2)64; CHECK-NEXT: %2 = load i32, ptr %a65  %2 = load i32, ptr %a66 67; CHECK: 3 = MemoryDef(2)68; CHECK-NEXT: fence acq_rel69  fence acq_rel70; CHECK: MemoryUse(3)71; CHECK-NEXT: %3 = load i32, ptr %a72  %3 = load i32, ptr %a73 74; CHECK: 4 = MemoryDef(3)75; CHECK-NEXT: fence seq_cst76  fence seq_cst77; CHECK: MemoryUse(4)78; CHECK-NEXT: %4 = load i32, ptr %a79  %4 = load i32, ptr %a80  ret void81}82 83; CHECK-LABEL: define void @seq_cst_clobber84define void @seq_cst_clobber(ptr noalias %a, ptr noalias %b) {85; CHECK: 1 = MemoryDef(liveOnEntry)86; CHECK-NEXT: %1 = load atomic i32, ptr %a monotonic, align 487  load atomic i32, ptr %a monotonic, align 488 89; CHECK: 2 = MemoryDef(1)90; CHECK-NEXT: %2 = load atomic i32, ptr %a seq_cst, align 491  load atomic i32, ptr %a seq_cst, align 492 93; CHECK: 3 = MemoryDef(2)94; CHECK-NEXT: load atomic i32, ptr %a monotonic, align 495  load atomic i32, ptr %a monotonic, align 496 97  ret void98}99 100; Ensure that AA hands us MRI_Mod on unreorderable atomic ops.101;102; This test is a bit implementation-specific. In particular, it depends on that103; we pass cmpxchg-load queries to AA, without trying to reason about them on104; our own.105;106; If AA gets more aggressive, we can find another way.107;108; CHECK-LABEL: define void @check_aa_is_sane109define void @check_aa_is_sane(ptr noalias %a, ptr noalias %b) {110; CHECK: 1 = MemoryDef(liveOnEntry)111; CHECK-NEXT: cmpxchg ptr %a, i32 0, i32 1 acquire acquire112  cmpxchg ptr %a, i32 0, i32 1 acquire acquire113; CHECK: MemoryUse(1)114; CHECK-NEXT: load i32, ptr %b, align 4115  load i32, ptr %b, align 4116 117  ret void118}119