1 ; RUN: llc -mcpu=v2 -march=bpf < %s | FileCheck %s
2 ; RUN: llc -mcpu=v4 -march=bpf < %s | FileCheck %s
4 ; Zero extension instructions should be eliminated at instruction
5 ; selection phase for all test cases below.
7 ; In BPF zero extension is implemented as &= or a pair of <<=/>>=
8 ; instructions, hence simply check that &= and >>= do not exist in
9 ; generated code (<<= remains because %c is used by both call and
10 ; lshr in a few test cases).
15 define void @shl_lshr_same_bb(ptr %p) {
17 %a = load i8, ptr %p, align 1
18 %b = zext i8 %a to i64
21 %e = icmp eq i64 %d, 0
22 ; hasOneUse() is a common requirement for many CombineDAG
23 ; transofmations, make sure that it does not matter in this case.
24 call void @sink1(i8 %a, i64 %b, i64 %c, i64 %d, i1 %e)
28 define void @shl_lshr_diff_bb(ptr %p) {
30 %a = load i16, ptr %p, align 2
31 %b = zext i16 %a to i64
36 ; Jump to the new basic block creates a COPY instruction for %d, which
37 ; might be materialized as noop or as AND_ri (zero extension) at the
38 ; start of the basic block. The decision depends on TLI.isZExtFree()
39 ; results, see RegsForValue::getCopyToRegs(). Check below verifies
40 ; that COPY is materialized as noop.
42 %e = icmp eq i64 %d, 0
43 call void @sink2(i16 %a, i64 %b, i64 %c, i64 %d, i1 %e)
47 define void @load_zext_same_bb(ptr %p) {
49 %a = load i8, ptr %p, align 1
50 ; zext is implicit in this context
52 call void @sink3(i8 %a, i1 %b)
56 define void @load_zext_diff_bb(ptr %p) {
58 %a = load i8, ptr %p, align 1
63 call void @sink3(i8 %a, i1 %b)
67 define void @load_zext_diff_bb_2(ptr %p) {
69 %a = load i32, ptr %p, align 4
73 %b = icmp eq i32 %a, 0
74 call void @sink4(i32 %a, i1 %b)
78 declare void @sink1(i8, i64, i64, i64, i1);
79 declare void @sink2(i16, i64, i64, i64, i1);
80 declare void @sink3(i8, i1);
81 declare void @sink4(i32, i1);