similar to: How to identify a library function call in IR?

> On May 22, 2016, at 10:31 AM, Lorenzo Laneve via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > My idea is an API where anyone can build a Runtime Library for any backend, including a set of functions people can inline/rename creating functions the frontend can include in the IR. > > For example implementing a cross-platform runtime function that allocates memory

Hello, I found a function call Function::isDeclaration() in llvm 2.5 (I know that's ancient...), which is useful to me, but I can't find it in the later version 3.3, nor the latest 3.7.....Therefore, is there an alternative way to check whether the function is just a declaration or a definition ? PS: I read the source code of llvm 2.5, and found isDeclaration is simply to check if the

Hi, I have an analysis pass which collects information about functions based on their call sites. There are problems I'm facing with processing virtual function calls, namely . How identify virtual call sites in my pass? . How Identify candidate callees for the given virtual call site? For the following example, the information I want to get would be identify call of F and as a possible

I know, that's the problem. We can assume all of the system calls as runtime functions: such as I/O, allocations etc. and create a set of function implemented for all the architectures. For example, let's think about the mem allocation again: we can provide a primitive function with the same name for all archs (e.g. __alloc() ) and then people can include this function __alloc() in their

+cc Artem, who added the LinkOnlyNeeded flag. On Wed, Apr 20, 2016 at 9:18 AM, Mehdi Amini via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hi Neil, > > On Apr 20, 2016, at 5:20 AM, Neil Henning via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > TL;DR - when linking from a lazily loaded module and using > Linker::LinkOnlyNeeded, bodies of used functions

TL;DR - when linking from a lazily loaded module and using Linker::LinkOnlyNeeded, bodies of used functions aren't being copied during linking. Previously on one of our products, we would lazily load our runtime module (around 9000 functions), and link some user module into this (which is in all practical use cases much smaller). Then, post linking, we have a pass that runs over the

Dear R community. I am using the identify() function to identify outliers in my dataset. This is the code I am using: #################################################################### # Function to allow identifying points in the QQ plot (by mouseclicking) qqInteractive <- function(..., IDENTIFY = TRUE) { qqplot(...) -> X abline(a=0,b=1) if(IDENTIFY) return(identify(X))

Hi Trevor, > Converting my ModulePass to a CallGraphSCCPass doesn't seem feasible, so I'll > use llvm::scc_iterator. Here's what I have so far: > > bool MyModulePass::isRecursive() { > CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot(); > for (scc_iterator<CallGraphNode*> SCCI = scc_begin(rootNode), E = > scc_end(rootNode); SCCI != E; ++SCCI)

On Oct 30, 2010, at 4:38 AM, Duncan Sands wrote: >> Is there any facility in LLVM to identify recursion in a call graph? ... > use the facilities in SCCIterator.h, or declare your pass to be a > CallGraphSCCPass in which case it will work one strongly connected > component at a time. Converting my ModulePass to a CallGraphSCCPass doesn't seem feasible, so I'll use

Also, could you write this in a separate pass, and obtain the results from getAnalysis()? I think others would find it useful to discover if a Function may be called recursively. -Jeff Kunkel On Tue, Nov 2, 2010 at 2:38 PM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > Hi you basically need to find a cycles in the call graph. Do do this just > search google for a graph algorithm, then

The purpose of this patch is to add support for the matahari qmf agent package (http://git.et.redhat.com/?p=matahari.git;a=summary) to the node. The following actions are taken: 1. Deprecate ovirt-identify-node and ovirt-listen-awake by removing them from the autotools scripts, the rpm spec and the node startup scripts. 2. Remove ovirt-listen-awake and ovirt-identify-node completely. 3. Add

Hi, Is there any facility in LLVM to identify recursion in a call graph? I realize this is undecidable in the general case due to function pointers, but at least the static cases could be identified. I don't even care about whole-program recursion, just looking at a single module would suffice. But I don't see anything like this already in LLVM, so do I simply write some code to

Hi Trevor, > Is there any facility in LLVM to identify recursion in a call graph? I > realize this is undecidable in the general case due to function > pointers, but at least the static cases could be identified. I don't > even care about whole-program recursion, just looking at a single > module would suffice. But I don't see anything like this already in > LLVM, so do

using: identify(...., plot=FALSE) allows identifying points in a graph without printing the corresponding label in the graph. This works fine in R for Windows. However, when I copy the graph as metafile into Word, the corresponding label appears in black font in the copied picture. Obviously, identify() prints the label anyway, in "invisible" font or so, in the graph, and this

Hi you basically need to find a cycles in the call graph. Do do this just search google for a graph algorithm, then make it for your problem. See http://en.wikipedia.org/wiki/Cycle_detection. Jeff Kunkel On Tue, Nov 2, 2010 at 4:27 AM, Duncan Sands <baldrick at free.fr> wrote: > Hi Trevor, > > > Converting my ModulePass to a CallGraphSCCPass doesn't seem feasible, so >

Hi again, next problem I have is: I want to write an application which connects via manager api and displays the current telephone state. I know I have the action id to identify events which belong together. But if I have a call going inside asterisk and asterisk rings a phone these are two channels with different action ids. How can I know that these channels belong together? I know there are

This gives me: Assertion failed: (0 && "Unable to find on the fly pass"), function getOnTheFlyPass, file PassManager.cpp #include "llvm/Module.h" #include "llvm/Analysis/MemoryDependenceAnalysis.h" #include "llvm/Support/raw_ostream.h" using namespace llvm; struct Hello: public FunctionPass { public: static char ID; Hello(): FunctionPass(ID) {

Guys, In this case, I wanted to hack globalopt pass to require ScalarEvolution analysis. It seems ScalarEvolution is not released after globalopt pass, and it will hold a reference to the basicblocks. Later when the function is removed(by inline pass), coredump happened: opt test.bc -mem2reg -globalopt -inline -loop-unroll -debug-pass Details -o out.bc >& log So it seems to me if a pass

Hello, I'm currently developing a tool based on LLVM to understand how the LLVM IR changes after optimization passes are run. Today it's a tedious but automatic process at a function level in my language, where I first dump the IR before running any passes, and then do it for the 10 or so passes I care about one-at-a-time to understand which pass affected the change. There are two

Hi, I am using the -debug-ir pass in LLVM-3.5 opt tool to map binary information back to the IR instead of the source files. I use the opt tool to generate a .ll file. But when I run the llc tool on it to generate an assembly (or object) file, it gives me the following warning warning: ignoring debug info with an invalid version (0) in How can I use the debug-ir functionality to achieve a