46 lines
1.4 KiB
LLVM
46 lines
1.4 KiB
LLVM
|
; RUN: opt < %s -passes=print-callgraph -disable-output 2>&1 | FileCheck %s
|
||
|
|
|
||
|
|
; The test will report used1 and used2 functions as used on the grounds
|
||
|
|
; of llvm.*.used references. Passing IgnoreLLVMUsed = true into the
|
||
|
|
; Function::hasAddressTaken() in the CallGraph::addToCallGraph() has to
|
||
|
|
; change their uses to zero.
|
||
|
|
|
||
|
|
; CHECK: Call graph node <<null function>><<{{.*}}>> #uses=0
|
||
|
|
; CHECK-NEXT: CS<None> calls function 'used1'
|
||
|
|
; CHECK-NEXT: CS<None> calls function 'used2'
|
||
|
|
; CHECK-NEXT: CS<None> calls function 'used_addrspace1'
|
||
|
|
; CHECK-NEXT: CS<None> calls function 'unused'
|
||
|
|
; CHECK-EMPTY:
|
||
|
|
; CHECK-NEXT: Call graph node for function: 'unused'<<{{.*}}>> #uses=1
|
||
|
|
; CHECK-EMPTY:
|
||
|
|
; CHECK-NEXT: Call graph node for function: 'used1'<<{{.*}}>> #uses=1
|
||
|
|
; CHECK-EMPTY:
|
||
|
|
; CHECK-NEXT: Call graph node for function: 'used2'<<{{.*}}>> #uses=1
|
||
|
|
; CHECK-EMPTY:
|
||
|
|
; CHECK-NEXT: Call graph node for function: 'used_addrspace1'<<{{.*}}>> #uses=1
|
||
|
|
; CHECK-EMPTY:
|
||
|
|
|
||
|
|
@llvm.used = appending global [2 x ptr] [ptr @used1, ptr addrspacecast (ptr addrspace(1) @used_addrspace1 to ptr)]
|
||
|
|
@llvm.compiler.used = appending global [1 x ptr] [ptr @used2]
|
||
|
|
@array = appending global [1 x ptr] [ptr @unused]
|
||
|
|
|
||
|
|
define internal void @used1() {
|
||
|
|
entry:
|
||
|
|
ret void
|
||
|
|
}
|
||
|
|
|
||
|
|
define internal void @used2() {
|
||
|
|
entry:
|
||
|
|
ret void
|
||
|
|
}
|
||
|
|
|
||
|
|
define internal void @used_addrspace1() addrspace(1) {
|
||
|
|
entry:
|
||
|
|
ret void
|
||
|
|
}
|
||
|
|
|
||
|
|
define internal void @unused() {
|
||
|
|
entry:
|
||
|
|
ret void
|
||
|
|
}
|