similar to: Andersens analysis ?

> You can solve andersens and steengaards and everything else using > standard dataflow solvers, and that's an implementation strategy, but > it will be really slow. > > Part of the tradeoff is how fast something runs, and approaches that > are orders of magnitude faster often change the calculus of what > people do. For example, before hardekopf's work, andersens

Oops thanks for the reminder. I did use another email address and am terribly sorry for it. Let me just post the link: https://docs.google.com/document/d/1Kvepb-v5Ta8ug_lLK1kZeexPNlpvj62K5iIF0fMuLyM/edit?usp=sharing On 03/25/2016 11:44 AM, John Criswell wrote: > Dear Jia, > > I don't see your proposal in the system. What is the title of your > proposal, and under what email

Hi Eric and thanks for your answer, What I mean is that I want to find the number of line on the IR code of a specific instruction. I found out that I can use: DebugLoc Loc = CurrentInstruction->getDebugLoc(); unsigned Line = Loc.getLine(); But this works only if DEBUGFLAG is True. I'd like to be able to get the Line number without being on a 'Debug' mode. Is

Thanks for the replies, Daniel and Matthijs. I added some code to generate the copy constraint, which I think (in the present form) is wrong (or at best not field sensitive): +void Andersens::visitGetResultInst(GetResultInst &GR) { + if (isa<PointerType>(GR.getType())) + { + // P1 = getresult P2 --> <Copy/P1/P2> +

> It is merely a demand-driven way of implementing existing > analyses, by extending those algorithms to track additional > "pointed-to-by" information. Laziness may help with the running > time of the cfl analysis when only partial points-to info is > needed, but if the client wants to do a whole-program analysis and > require whole-program

Hello Daniel, Thank you for your comments and sorry for my mistakes, I'll revise them. And I'll for sure read the paper you mentioned and survey the recent researches before deciding the implementation technique. To George: May I know the exact plan of your attempt for making cfl-aa interprocedural? I do think that this is the most valuable part of my proposal, but that makes no sense to

Hi list, Is it possible to retrieve the source/IR line number without being on a debug mode? Thank you in advance, -- irini

Hi all, Did someone forget to check-in a patch? I'm getting this error during compilation on PPC: /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/lib/Analysis/IPA/Andersens.cpp: In function 'void dumpToDOUT(llvm::SparseBitVector<128u>*)': /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/lib/Analysis/IPA/Andersens.cpp:1189: error: no

On Sep 24, 2007, at 2:29 PM, Bill Wendling wrote: > Hi all, > > Did someone forget to check-in a patch? I'm getting this error during > compilation on PPC: A recent checkout compiled fine for me (on x86). > /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ > lib/Analysis/IPA/Andersens.cpp: > In function 'void

A debug or release build? -bw On Sep 24, 2007, at 2:36 PM, Dale Johannesen wrote: > > On Sep 24, 2007, at 2:29 PM, Bill Wendling wrote: > >> Hi all, >> >> Did someone forget to check-in a patch? I'm getting this error during >> compilation on PPC: > > A recent checkout compiled fine for me (on x86). > >>

This is the beginning of a new implementation of Andersen's. So far, it has been converted to use a new solver algorithm, support field sensitivity (not yet implemented in the constraint building, but the solver supports it) and to use SparseBitVectors. It is roughly 100x faster than the old implementation on larger testcases. This is just the beginning, work is being done to change the

Dear all, I want to implement a pass that provides some kind of data flow integrity similar to Write Integrity Testing (https://www.doc.ic.ac.uk/~cristic/papers/wit-sp-ieee-08.pdf). This approach statically determines for each memory write the (conservative, overapproximated) points-to set of locations that can be written by the instruction. Further, it instruments the memory write instruction

Hello, How do apply the LLVM Andersens alias analysis direclty to a Module object. I'm trying to avoid using the PassManager. Max -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090518/aec81e30/attachment.html>

Hello, How do apply the LLVM Andersens alias analysis direclty to a Module object. I'm trying to avoid using the PassManager. Max -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090518/1a9d9a89/attachment.html>

Might I suggest the following patch, because this issue has bite me too? You're lured in by the initial good results from the Andersens alias analysis, only to discover the bugs later on. Robert Zeh On Aug 26, 2009, at 9:11 PM, Chris Lattner wrote: > On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: >> Hello, >> >> Does the LLVM Andersens alias analysis handle

Is there any pass that breaks an expression out of an instruction's operand into its own instruction, so that such nested instructions become explicit and are thus easier to work with in? e.g Following|call|instruction contains a|GEP|instruction as its first operand. Is there any pass which allows me to break up this: | %call = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([4

On 16/10/15 12:59, David Chisnall wrote: > On 16 Oct 2015, at 10:44, Irini Stavrakantonaki via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> Following call instruction contains a GEP instruction as its first operand > No it doesn’t. It contains a GEP constant expression. This is a bit confusing at first, especially when working with IRBuilder, which can sometimes give you

On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: > Hello, > > Does the LLVM Andersens alias analysis handle function pointers > precisely? I ran it and it looks like it says every function points > points to the universal set. Is this what I should expect? Hi Max, I don't know the answer offhand but please keep in mind that the current andersen's pass has many

Hello John, I've finished the first version of my proposal on enhancing alias analysis. The proposal can be downloaded at http://james0zan.github.io/resource/GSoC15-Proposal-AA.pdf. I hope I've successfully justified the necessity and benefits of this project. If possible, please find some time to review it and give me some more feedbacks. Thank you very much! P.S. I'm working on

On Sep 24, 2007, at 3:07 PM, Bill Wendling wrote: > A debug or release build? > > -bw Both, actually. > On Sep 24, 2007, at 2:36 PM, Dale Johannesen wrote: > >> >> On Sep 24, 2007, at 2:29 PM, Bill Wendling wrote: >> >>> Hi all, >>> >>> Did someone forget to check-in a patch? I'm getting this error >>> during