File: bit-store-upper-sub-hi.mir

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (21 lines) | stat: -rw-r--r-- 655 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
# RUN: llc -march=hexagon -run-pass=hexagon-bit-simplify -o - %s | FileCheck %s

# This test checks if the HexagonBitSimplify pass correctly replaces a
# S2_storerh_io with a S2_storerf_io that stores the upper halfword
# of a high subregister using appropriate subregister boundaries.

# CHECK: S2_storerf_io %0, 28, %{{[0-9]+}}.isub_hi
# CHECK-NOT: S2_storerf_io %0, 28, %{{[0-9]+}}.isub_lo

---
name: test_store
tracksRegLiveness: true
body:             |
  bb.0:
    liveins: $r0
    %0:intregs = COPY $r0
    %1:doubleregs = IMPLICIT_DEF
    %2:doubleregs = IMPLICIT_DEF
    %3:doubleregs = S2_shuffoh %2, %1
    S2_storerh_io %0, 28, %3.isub_hi
...