File: inline-cost-dead-users.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 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 (32 lines) | stat: -rw-r--r-- 950 bytes parent folder | download | duplicates (12)
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
30
31
32
; Test to ensure that the inlining cost model isn't tripped up by dead constant users.
; In this case, the call to g via a bitcasted function pointer is canonicalized to
; a direct call to g with bitcasted arguments, leaving the original bitcast
; as a dead use of g.

; RUN: opt < %s  -passes='function(instcombine),cgscc(inline)' -pass-remarks=inline -S 2>&1 \
; RUN:     | FileCheck %s

; Inline costs of f and g should be the same.

; CHECK: 'f' inlined into 'h' with (cost=[[EXPECTED_COST:.+]], threshold={{.+}})
; CHECK: 'g' inlined into 'h' with (cost=[[EXPECTED_COST]], threshold={{.+}})

%0 = type { i64, i64, i64 }
%1 = type { i64, i64, i64 }

define internal void @f(ptr align 8 %a) unnamed_addr {
start:
  ret void
}

define internal void @g(ptr align 8 %a) unnamed_addr {
start:
  ret void
}

define void @h(ptr align 8 %a, ptr align 8 %b) unnamed_addr {
start:
  call void @f(ptr align 8 %a)
  call void @g(ptr align 8 %b)
  ret void
}