Searched refs:CGN (Results 1 – 8 of 8) sorted by relevance
145 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule() argument146 assert(CGN->empty() && "Cannot remove function from call " in removeFunctionFromModule()148 Function *F = CGN->getFunction(); // Get the function for the call graph node in removeFunctionFromModule()159 auto &CGN = FunctionMap[F]; in getOrInsertFunction() local160 if (CGN) in getOrInsertFunction()161 return CGN.get(); in getOrInsertFunction()164 CGN = std::make_unique<CallGraphNode>(this, const_cast<Function *>(F)); in getOrInsertFunction()165 return CGN.get(); in getOrInsertFunction()248 for (auto *CGN : OldCBs) in replaceCallEdge() local249 removeOneAbstractEdgeTo(CGN); in replaceCallEdge()[all …]
174 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()175 if (Function *F = CGN->getFunction()) { in RunPassOnSCC()210 for (CallGraphNode *CGN in RefreshCallGraph()211 : CurSCC) CGN->dump();); in RefreshCallGraph()220 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph() local221 Function *F = CGN->getFunction(); in RefreshCallGraph()231 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()237 CGN->removeCallEdge(I); in RefreshCallGraph()245 CGNEnd = CGN->end(); in RefreshCallGraph()250 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph()[all …]
484 for (auto *CGN : SCC) in CollectSCCMembership() local485 if (Function *F = CGN->getFunction()) in CollectSCCMembership()
144 LLVM_ABI Function *removeFunctionFromModule(CallGraphNode *CGN);151 LLVM_ABI void populateCallGraphNode(CallGraphNode *CGN);387 Function *removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule() argument388 return G->removeFunctionFromModule(CGN); in removeFunctionFromModule()420 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }440 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }468 static NodeRef getEntryNode(CallGraph *CGN) {469 return CGN->getExternalCallingNode(); // Start at the external node!495 static NodeRef getEntryNode(const CallGraph *CGN) {496 return CGN->getExternalCallingNode(); // Start at the external node!
245 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }255 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }262 static NodeType *getEntryNode(clang::CallGraph *CGN) {263 return CGN->getRoot(); // Start at the external node!288 static NodeType *getEntryNode(const clang::CallGraph *CGN) {289 return CGN->getRoot();
194 for (auto &&CGN : CGA) { in run()195 if (!isAcceleratorExecutionRoot(CGN.first)) in run()198 Reachable.insert(CGN.first); in run()200 SmallVector<const Function *> Tmp({CGN.first}); in run()
291 for (CallGraphNode *CGN : CurSCC) { in initialize()292 Function *F = CGN->getFunction(); in initialize()
266 const CallGraphNode *CGN = CG[Func]; in getNonKernelsWithLDSArguments() local267 if (!CGN) in getNonKernelsWithLDSArguments()269 for (auto &I : *CGN) { in getNonKernelsWithLDSArguments()