similar to: [LLVMdev] install-time optimization

Displaying 20 results from an estimated 100000 matches similar to: "[LLVMdev] install-time optimization"

2008 Nov 28
2
[LLVMdev] Disable optimization
Hi Eli, I want to disable optimizations because, i'm going to implement a framework in JAVA for educational purposes. I have planned to do followings: 1) Create LLVM-IR and export it as Assembly (without optimizing the source-code) 2) Transform the LLVM-Assembly to a data-structure, similar to LLVM data structure (Module, Function, BB ...) but implemented in Java 3) Optimizing
2008 Nov 27
2
[LLVMdev] Disable optimization
Hello together, although i use the "-O0" flag as follow, the llvm perform dead code elimination. How can i disable optimizing completely? KR Raad llvm-gcc -O0 -emit-llvm main.cpp -S -o main.s -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20081127/c4ef8aac/attachment.html>
2008 Nov 27
0
[LLVMdev] Disable optimization
On Thu, Nov 27, 2008 at 6:14 AM, RAAD B <raad_7007 at yahoo.com> wrote: > Hello together, > > although i use the "-O0" flag as follow, the llvm perform dead code > elimination. > How can i disable optimizing completely? Sorry, it's not possible; the gcc front-end does some optimizations which the LLVM backend can't do anything about, and dead code
2008 Nov 28
0
[LLVMdev] Disable optimization
On Fri, Nov 28, 2008 at 12:36 AM, RAAD B <raad_7007 at yahoo.com> wrote: > Hi Eli, > > I want to disable optimizations because, i'm going to implement a framework > in JAVA for educational purposes. > > I have planned to do followings: > > 1) Create LLVM-IR and export it as Assembly (without optimizing the > source-code) > 2) Transform the
2009 Feb 17
1
[LLVMdev] information-transfer between analysis-pases
Ok, but what about a pass like alias-analysis. How are the results stored, so that other passes can use them. -Raad ________________________________ From: Eli Friedman <eli.friedman at gmail.com> To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> Sent: Tuesday, February 17, 2009 9:52:58 AM Subject: Re: [LLVMdev] information-transfer between analysis-pases On Tue, Feb 17,
2009 Mar 13
2
[LLVMdev] store the LLVM-bitcode from a pass
Hi Duncan, thanks for the answer. But "opt -load ..../Decorator.so -dec <prog.bc> new_prog.bc" creates an invalid file. When i use "lli", i get "lli: error loading program 'new_prog.bc': Invalid bitcode signature" I have done the followings: 1) used "opt -p -load ..../Decorator.so -dec <prog.bc> new_prog.bc" 2) copied the output
2009 Mar 06
0
[LLVMdev] Inserting annotations
Hi, As far as I know, Instruction class does not inherit "Annotable" Class. Only Function inherits annotable according to the documentation of annotable class. What you are asking would require adding annotations at instruction level, which does not seem to be possible. You can maintain external maps between instructions and your annotations, --Kapil On Thu, Mar 5, 2009 at 7:17 PM,
2009 Mar 06
3
[LLVMdev] Inserting annotations
Hello together, how can i insert annotations in IR ? I want actually write something like: CallInst *call = CallInst::Create( ??? , aBasicBlock); in my pass. Regards Raad -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090305/cd1db761/attachment.html>
2009 Feb 17
3
[LLVMdev] information-transfer between analysis-pases
Hello together, I have seen that the analysis-results are stored in llvm-IR as annotations. For example <; preds = %entry> in basicBlock level and <; <i32*> [#uses=2]> for a variable. Is there any documentation about annotations? Regards Raad -------------- next part -------------- An HTML attachment was scrubbed... URL:
2008 Dec 11
0
[LLVMdev] Implementing Java bindings to LLVM
Hello. I read following article in this ML. I'm implementing the library similar with RAAD's plan. - AST node classes for LLVM-IR - LLVM-Assembly writer class - 100% pure Java - Without any optimizations - Without any frontends (parsers) I would like to release my library publicly if all problems below could be solved. (Although it is in the early stage) My library is the mixture of my
2009 Feb 17
0
[LLVMdev] information-transfer between analysis-pases
On Tue, Feb 17, 2009 at 12:46 AM, RAAD B <raad_7007 at yahoo.com> wrote: > Hello together, > > I have seen that the analysis-results are stored in llvm-IR as annotations. > For example <; preds = %entry> in basicBlock level and <; <i32*> [#uses=2]> > for a variable. > > Is there any documentation about annotations? That isn't really analysis;
2009 Mar 13
2
[LLVMdev] store the LLVM-bitcode from a pass
These are the contents of the generated file. Start >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> ; ModuleID = '<stdin>' target datalayout =
2009 Apr 15
1
[LLVMdev] IR from multiple source-files
Hi, how can I create the IR-representation from multiple source-files? Regards Raad -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090415/9040f657/attachment.html>
2015 Dec 02
5
Is there a way to pass Optimization passes to clang?
0 down vote favorite <http://stackoverflow.com/questions/34049511/how-to-pass-optimization-passes-to-clang#> I'm trying to debug an issue for a new target where a testcase fails with -O1 optimization and passes with -O0 optimization. I got a list of optimization passes being performed when 'clang -O1' is called like this: llvm-as < /dev/null | opt -O1 -disable-output
2009 Mar 19
1
[LLVMdev] sample-code for alias-analysis
Hi, i need a sample-code, for which the llvm alias-analysis finds a *must-aliases*. I have tried codes like followings. In all cases, i see just *may-aliases* when i use "opt -aa-eval -print-all-alias-modref-info foo.bc": Regards Raad 1 ========================================== void foo() { int i = 2; int& r = i; } 2 =========================================== void
2013 Oct 06
0
[LLVMdev] Suggestion on simple optimization pass for a beginner?
On 10/6/13 7:23 AM, Rekha R wrote: > Hello, > > I am a beginner in LLVM development with the aim of writing a new > optimization pass. But then before I could do that, I thought of > writing simple passes. I could successfully implement the Hello pass > as given in the doc. Then I wrote a simple Constant Folding pass - > evaluate instructions of the form c=10+20 and
2013 Oct 06
3
[LLVMdev] Suggestion on simple optimization pass for a beginner?
Hello, I am a beginner in LLVM development with the aim of writing a new optimization pass. But then before I could do that, I thought of writing simple passes. I could successfully implement the Hello pass as given in the doc. Then I wrote a simple Constant Folding pass - evaluate instructions of the form c=10+20 and replace all uses of c with 30. Only later did I realize that Clang does this
2013 Oct 08
0
[LLVMdev] Suggestion on simple optimization pass for a beginner?
This sounds good. Similar to Constant folding. Noted :-) Rekha On Tue, Oct 8, 2013 at 1:33 PM, David Tweed <david.tweed at arm.com> wrote: > Hi,**** > > ** ** > > If you're looking for something incredibly simple to get started with it > might be fruitful to implement replacement of particular function calls of > constant arguments with the appropriate result.
2008 Oct 07
0
[LLVMdev] mem2reg optimization
Hi Chris, Sounds like an excellent generic approach. I'd love to lend a hand to implement it but I'm afraid it involves a little more in-depth LLVM knowledge than what I currently master, so I'll leave it to Dave and you for now... Talking about performance, for me this optimization was the difference between mem2reg taking 63% of execution time, and having it totally
2008 Jul 23
2
[LLVMdev] Optimization passes and debug info
On Jul 22, 2008, at 10:33 PM, Chris Lattner wrote: > 1. I agree with Alexandre Oliva that the compiler should never "lie" > in debug info. If it has some information that is not accurate, it > should respond with "I don't know" instead of making a wrong guess. > This means that the debugger either says "your variable is certainly > here" or it