search for: vhscampos

Displaying 5 results from an estimated 5 matches for "vhscampos".

2015 Mar 11
2
[LLVMdev] how to know whether a function is a declaration or definition
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
2015 Oct 09
2
Get instance of CallGraph of a module in the pass
Hello, I want an instance of CallGraph in my pass. By looking at -dot-callgraph source, I've tried something like this: CallGraphWrapperPass *CGWP = new CallGraphWrapperPass(); PM.add(CGWP); CallGraph *CG = &CGWP->getCallGraph(); PM.add(new MyPass(CG)); I get the following error: /home/riyad/installs/llvm-3.7.0/include/llvm/PassSupport.h:95:38: error: no matching constructor for
2012 Apr 02
0
[LLVMdev] GSoC - Range Analysis
Hi, guys, thank you for all the feedback. I will try to answer your questions below. But, if you think that might not be a good GSoC project, do not hesitate to tell me. I can try to write a different proposal. Nevertheless, I would like to hear from you what you think is important to have in the range analysis. By reading your e-mails, I see that there are still a lot of things that we do
2012 Mar 30
3
[LLVMdev] GSoC - Range Analysis
> What version of LLVM does your analysis use currently? We are working with LLVM 3.0 (stable release) > It sounds like your analysis is fast. Can you show results on how fast it > is on various programs? Do you have measurements on how much memory it > uses? How large is the largest program you've compiled with it? Yes, we have a very extensive report about it. Take a look
2012 Mar 29
5
[LLVMdev] GSoC - Range Analysis
Dear LLVMers, I have been working on Douglas's range analysis, and today, after toiling with it for two years, we have a very mature and robust implementation, which is publicly available at http://code.google.com/p/range-analysis/. We can, at this point, perform range analysis on very large benchmarks in a few seconds. To give you an idea, we take less than 10 seconds to globally analyze