File: subword.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (29 lines) | stat: -rw-r--r-- 905 bytes parent folder | download | duplicates (23) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
 
; RUN: llc < %s -mtriple=lanai-unknown-unknown | FileCheck %s

; Test scheduling of subwords.

%struct.X = type { i16, i16 }

define void @f(%struct.X* inreg nocapture %c) #0 {
entry:
  %a = getelementptr inbounds %struct.X, %struct.X* %c, i32 0, i32 0
  %0 = load i16, i16* %a, align 2
  %inc = add i16 %0, 1
  store i16 %inc, i16* %a, align 2
  %b = getelementptr inbounds %struct.X, %struct.X* %c, i32 0, i32 1
  %1 = load i16, i16* %b, align 2
  %dec = add i16 %1, -1
  store i16 %dec, i16* %b, align 2
  ret void
}

; Verify that the two loads occur before the stores. Without memory
; disambiguation and subword schedule, the resultant code was a per subword
; load-modify-store sequence instead of the more optimal schedule where all
; loads occurred before modification and storage.
; CHECK:      uld.h
; CHECK-NEXT: uld.h
; CHECK-NEXT: add
; CHECK-NEXT: st.h
; CHECK-NEXT: sub
; CHECK-NEXT: st.h