similar to: Interprocedural register allocation. Status?

Hi Everyone, Can Someone tell me all the interprocedural optimizations that LLVM 2.1 supports. Thank You, Naineet Patel CSE IITB

Dear all, Is anyone aware of any implementation of an inter procedural slicing algorithm for LLVM? I am mostly interested in a static algorithm but a dynamic one can be helpful too. Thanks, Silviu Ganceanu Research Student, Ecole Polytechique Federale de Luasanne -------------- next part -------------- An HTML attachment was scrubbed... URL:

We have done a few class projects on static interprocedural slicing but they are all of "course project" quality. I will put you in touch with some of the students who did those, if you're interested? --Vikram Associate Professor, Computer Science University of Illinois at Urbana-Champaign http://llvm.org/~vadve On Aug 15, 2008, at 8:48 AM, Silviu-Ionut Ganceanu wrote:

Hello, I had a look at the global variable optimizer. In my opinion it handles a few special cases, when global variables can be replaced by local variables or be removed completely. Basically I think that this problem could be solved with an interprocedural live value analysis for global variables more generally. An assignment to a global variable can be removed, if this global variable is dead

Hi All, Are there any known implementations of static inter-procedural slicing for LLVM (especially forward slicing)? I did find a few references to it in the archives dating back to 2008, but am not sure what the current status is. Any pointers would be highly appreciated. Thanks Rohit Grad Student Middleware Security and Testing Group http://cs.wisc.edu/mist University of Wisconsin-Madison

Hello, I need interprocedural alias analysis while I'm using GVN for infeasible path analysis. So, I've tried "-steens-aa" from poolalloc project, but it doesn't seem to be working as I expected. For example, int global; int bar(void) { return 5; } int foo(void) { int a; scanf("%d", &a); if(global) a = bar(); return a; } In this case, I

Hi, all: I am considering contructing Interprocedural Control Flow Graph(ICFG) in LLVM, but really have no idea about how much work should I do? Is there someone have done this work before? Expecting your suggestions. Thanks. --William -------------- next part -------------- An HTML attachment was scrubbed... URL:

If I turn on one of the llvm interprocedural optimizations without turning on the analysis it uses. will the analysis be turned on automatically ? Thanks Xin

There is/are implicit dependency for the optimization on its analysis. So, if you run the optimization, the analysis will be turned on implicitly, through the PassManager. Chuck On 2/12/2012 10:10 AM, Xin Tong wrote: > If I turn on one of the llvm interprocedural optimizations without > turning on the analysis it uses. will the analysis be turned on > automatically ? > > Thanks

On Oct 4, 2012, at 2:27 PM, "Madhusudan C.S" <madhusudancs at gmail.com> wrote: > Basically, the PrologEpilogInsertion pass will add a bit mask to MachineModuleInfo describing which registers are clobbered by the function being compiled. Later, when compiling the callers, that bit mask is used to initialize the regmask operands on call instructions. > > So the idea is to

http://dl.acm.org/citation.cfm?id=2843863 Luke Jones, Ryan Whelan, Jeremy Blackthorne, and Graham Baker. 2015. Flowtables: Program Skeletal Inversion for Defeat of Interprocedural Analysis with Unique Metamorphism. In Proceedings of the 5th Program Protection and Reverse Engineering Workshop (PPREW-5). ACM, New York, NY, USA, , Article 6 , 11 pages. DOI=http://dx.doi.org/10.1145/2843859.2843863

On Tue, Jul 26, 2016 at 3:05 PM Dounia Khaldi via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Thanks for your reply. > > Yes, I was about to recurse over the use list of the argument in the > called function. I did not want to pursue that because with this solution, > I am going to implement the interprocedural part myself and was wondering > if that was not already

> > > FWIW, I didn’t make any claim on actual complexity (I think? :)). We just > didn't try it and didn’t have time to fit that into the schedule of an > outliner for an internship. > > I'm disappointed you didn't have time to try to solve major open computer science problems in an internship. What are you even doing over there? -------------- next part

Dear Jin, I've talked with Vikram, and we agree that having this code (and a dynamic backwards slicing pass that Swarup and I wrote) in a publicly available SVN repository is a good thing. I'll try to get you a copy of the static slicing code some time next week (I should be able to work on it Monday morning) so that you can start working with it right away. I can work on making a

Hello John et al - I have been struggling to implement static backwards slicing with LLVM. After digging llvmdev postings for some time, I see that other people were having similar difficulties and John's got almost complete code that may be shared. May I get a copy of it, too? Better yet, it would be helpful for many other people if the code were checked in to an example directory or

On Oct 4, 2012, at 2:47 AM, Madhusudan C.S <madhusudancs at gmail.com> wrote: > However, I was reading the DeveloperPolicy page and the policy for making major > changes asks the developers to discuss the work here before proceeding. So, I am > writing this mail to kickoff a discussion. I would really like to contribute to LLVM and > I think this is a good place for me to start.

Thanks for your reply. Yes, I was about to recurse over the use list of the argument in the called function. I did not want to pursue that because with this solution, I am going to implement the interprocedural part myself and was wondering if that was not already done. I was not also 100% sure that this will work for any type of arguments. If, based on your response, this is my only solution

Hello, I have been using the USE class to access the use-def chains of different values. However, what I have noticed is that the set of users of a particular value is limited for the appearance of that variable in the current function. How can I get the interprocedural use of a particular value? For example, if a variable *a* is used as an argument in a function call *foo*, the USE analysis

On 6/26/12 5:07 PM, amruth.rd wrote: > Hello, > > I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a

John, Thanks for your quick reply. Firstly, I'd like to employ a slicer for our benchmarking work (in one word, reducing the long-time irrelevant computing). I find the giri project and the LLVMSlicer[1]. However, the giri doesn't seem a complete implementation to me. I admit that I have not finished reading document/discussion, e.g. the previous threads in this mailing list. While the