llvm-6502/test/Analysis/CallGraph/2008-09-09-DirectCall.ll

; RUN: opt < %s -print-callgraph -disable-output |& FileCheck %s

; CHECK: Call graph node <<null function>>
; CHECK:  CS<{{.*}}> calls function 'callee'
; CHECK: Call graph node for function: 'caller'
; CHECK:  CS<{{.*}}> calls function 'callee'

define internal void @callee(...) {
entry:
	unreachable
}

define void @caller() {
entry:
	call void (...)* @callee( void (...)* @callee )
	unreachable
}
FileCheck-ize these tests. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@155433 91177308-0d34-0410-b5e6-96231b3b80d8 2012-04-24 10:36:42 +00:00			`; RUN: opt < %s -print-callgraph -disable-output \|& FileCheck %s`

			`; CHECK: Call graph node <<null function>>`
			`; CHECK: CS<{{.*}}> calls function 'callee'`
			`; CHECK: Call graph node for function: 'caller'`
			`; CHECK: CS<{{.*}}> calls function 'callee'`
Correct callgraph construction. It has two problems: (1) code left over from the days of ConstantPointerRef: if a use of a function is a GlobalValue then that is not considered a reason to add an edge from the external node, even though the use may be as an initializer for an externally visible global! There might be some point to this behaviour when the use is by an alias (though the code predated aliases by some centuries), but I think PR2782 is a better way of handling that. (2) If function F calls function G, and also G is a parameter to the call, then an F->G edge is not added to the callgraph. While this doesn't seem to matter much, adding such an edge makes the callgraph more regular. In addition, the new code should be faster as well as simpler. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@55987 91177308-0d34-0410-b5e6-96231b3b80d8 2008-09-09 12:40:47 +00:00
			`define internal void @callee(...) {`
			`entry:`
			`unreachable`
			`}`

			`define void @caller() {`
			`entry:`
			`call void (...)* @callee( void (...)* @callee )`
			`unreachable`
			`}`