search for: elliminate

Here is my formal proposal i have submitted in gsoc. Comments invited. About me: I am a final semester Dual Degree( B.Tech. M.Tech.) student from Indian Institute of Technology, Kanpur. I was looking forward to participate in this year's GSoC 2009.Starting Fall 2009 i shall be pursuing a Phd in compilers. I am having a good background in compilers. My current masters thesis is aimed at

On Apr 3, 2009, at 12:52 AM, Kshitiz Garg wrote: > Here is my formal proposal i have submitted in gsoc. Comments invited. > This sounds like a very interesting proposal. Many compilers clone loops and use dynamic checks to enforce invariants in one copy of the loop. Is this intended to be similar to that style of approach? -Chris > > About me: > > I am a final

Hello, Kshitiz > I was interested in taking up the project ideas on adding profile driven > optimization passes and improving alias analysis as this would give me a > chance to carry forward and improve my current work and also contribute > significantly in terms of tangibles. This sounds like a great idea. LLVM definitely lacks some profile-driven optimizations. -- With best

Hello, I am a final semester Dual Degree( B.Tech. M.Tech.) student from Indian Institute of Technology, Kanpur. I was looking forward to participate in this year's GSoC 2009.Starting Fall 2009 i shall be pursuing a Phd in compilers. I am having a good background in compilers. My current masters thesis is aimed at automatic parallel code from c programs target for the Cell Processor using

Am a newbee to Linux and am trying to evaluate various distros to see how they fit my needs. For this purpose I now have six trial Linux partitions on the same machine. My other criterions to replace XP as my main system have been passed by all the distros, but remains the last one: to be able to handle Lotus wk4-files. That is where I have my history. First tried installing Lotus 123 from

Hi, I have run into the following strange behavior and wanted to ask for some advice. For the C program below, function sum() gets inlined in foo() but the code generated looks very suboptimal (the code is an extract from a larger program). Below I show the 32-bit x86 assembly as produced by the demo page on the llvm home page ("Output A"). As you can see from the assembly, after

Dear Pals I think all of us in this business (or most) looking at the Corn Flakes Back Side , Wish to find a NAT Friendly VOIP solution. Thats ridiculous I know, but what about this wish list (Personal Point of view) Upnp support for Asterisk STUN Support for Asterisk Small Embedded Asterisk (just to redirect IAX) SIP-IAX , h.323-IAX or something like that , on the End Point. As a Nat

I don't know much about this, but maybe -mllvm -unroll-count=1 can be used as a workaround? /Patrik Hägglund -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Brent Walker Sent: den 28 mars 2012 03:18 To: llvmdev Subject: [LLVMdev] Suboptimal code due to excessive spilling Hi, I have run into the following strange behavior

...ready. I was hoping to switch to Solaris/ZFS to get checksums (which wouldn''t seem to account for slowness, because CPU stays under 25% during all this). I can temporarily scrape together an x64 machine with ICH7 SATA interface - I''ll try the same test with same drives on that to elliminate 32-bitness and PCI slowness from the equation. And while someone will say dd has little to do with real-life file server performance - it actually has a lot to do with it, because most of use of this server is to copy multi-gigabyte files to and fro a few times per day. Hardly any random access inv...