search for: nicacio

...The below image illustrate this: [image: XORChain.png] In order to do that I am adding an additional function call to "visitXor()" in Instruction Combining. My Optimization function is attached as a patch file. (the diff was made using the 2.9 release version of llvm). Thanks Daniel Nicacio -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110728/a5bc09cf/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: XORChain.png Type: image/png Size: 59953...

...rgy-efficient, so it should be preferred when the compiler can statically infer that its usage is correct. > - Is there a straight forward way to know if an instruction belongs to a > loop? (just curiosity) I'll defer to others on this one. > > Thanks very much > > Daniel Nicacio Best, Matt

...oops, like for 4, 8, and 16. Does anyone knows which function gives the information that for 32 unrolled steps it is possible to optimize but not for smaller numbers? I also would like to see why the "XOR A, -1" is not turned into a NOT, any hints on that are welcome. Thanks, Daniel Nicacio 2011/7/26 Daniel Nicácio <dnicacios at gmail.com> > Hi Duncan, > > when I run "opt -std-compile-opts" on the original source code it has the > same output of O3. > when I run "opt -std-compile-opts" on the -O3 optimized code, things get > even more wei...

2011/7/26 Daniel Nicácio <dnicacios at gmail.com>: > > I also would like to see why the "XOR  A,  -1" is not turned into a NOT, any > Probably because NOT (like NEG) doesn't exist :) <http://llvm.org/docs/LangRef.html#instref> I assume the decision was made that it wasn't worth adding the extra...

...timization that could do something here but is not being triggered for some reason?? - Do you know why a OR instruction is used for increments? instead of using a INC or ADD? - Is there a straight forward way to know if an instruction belongs to a loop? (just curiosity) Thanks very much Daniel Nicacio -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110725/6955c76b/attachment.html>

...e a backend generating circuitry (programming FPGAs). > > > - Is there a straight forward way to know if an instruction belongs to > a > > loop? (just curiosity) > > I'll defer to others on this one. > > > > > Thanks very much > > > > Daniel Nicacio > Best, > Matt > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > -------------- next part -------------- An HTML attachment wa...

Hi folks, I am going to submit a project to Google Summer of Code, the Project is below to anyone it might interest. Any critics and suggestions are welcome. If anyone is interested mentoring this project please contact me. Building and Executing Traces on LLVM Daniel Nicacio IC-UNICAMP, Brazil April 5, 2011 1 Objective The objective of this project is to augment LLVM with dynamic pro ling ca- pabilities. Interpreted code will be instrumented so that LLVM will be able to dynamically nd, build and execute traces of more frequently executed basic blocks. This way, futur...

Hi Duncan, when I run "opt -std-compile-opts" on the original source code it has the same output of O3. when I run "opt -std-compile-opts" on the -O3 optimized code, things get even more weird, it outputs the following code: while.body: ; preds = %while.body, %entry %indvar = phi i32 [ 0, %entry ], [ %indvar.next.3, %while.body ] %tmp

Hi Daniel, > Precisely. The code generated by unrolling can be folded into a single XOR and > SHL. And even if it was not inside a loop, it can still be optimized. What I > want to know is: is there any optimization supposed to optimize this code, but > for some reason it thinks it is not possible, or there is no optimization for > that situation at all? it could be a phase