search for: zwarich

On Feb 8, 2013, at 4:37 PM, Cameron Zwarich <zwarich at apple.com> wrote: > On Feb 8, 2013, at 4:20 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > >> On Feb 8, 2013, at 4:03 PM, Cameron Zwarich <zwarich at apple.com> wrote: >> >>> How much of the work is done here? I'd be happy to...

...Elimination. Hmm... does tweaking the value of BlockScanLimit in MemoryDependenceAnalysis.cpp help? -Eli > > > > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On > Behalf Of Michael Smith > Sent: Monday, November 21, 2011 12:20 PM > To: Cameron Zwarich > > Cc: llvmdev at cs.uiuc.edu > Subject: Re: [LLVMdev] Optimization of array access > > > > Dead Code Elimination. I’m going to try re-working it following some of the > insights Don Quixote provided. > > > > From: Cameron Zwarich [mailto:zwarich at apple.com] &...

On Feb 16, 2013, at 1:31 PM, Cameron Zwarich <zwarich at apple.com> wrote: > That's exactly the right place. Really? You don't want the expansion to be optimized? You want to specify a machine model for the pseudo's as if they're real instructions? You don't want to schedule or register allocate the real instruc...

On Mar 16, 2011, at 9:31 AM, Cameron Zwarich wrote: > Promoting the return value is unsafe for bool returns on x86-64, which in the latest revision of the ABI only guarantees that the top 7 bits of the 8-bit register are 0. My comment is a bit off, because the question of what type to make the return value is somewhat orthogonal to the q...

Tried 5 and 50, doesn't seem to make any difference. -----Original Message----- From: Eli Friedman [mailto:eli.friedman at gmail.com] Sent: Monday, November 21, 2011 1:20 PM To: Michael Smith Cc: Cameron Zwarich; llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] Optimization of array access On Mon, Nov 21, 2011 at 1:03 PM, Michael Smith <Michael.Smith at synopsys.com> wrote: > Sorry, Dead Store Elimination. Hmm... does tweaking the value of BlockScanLimit in MemoryDependenceAnalysis.cpp help? -Eli...

On Wed, Mar 16, 2011 at 12:35 PM, Cameron Zwarich <zwarich at apple.com> wrote: > On Mar 16, 2011, at 9:31 AM, Cameron Zwarich wrote: > >> Promoting the return value is unsafe for bool returns on x86-64, which >> in the latest revision of the ABI only guarantees that the top 7 bits of >> the 8-bit register are 0. >...

On Feb 8, 2013, at 4:45 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > On Feb 8, 2013, at 4:37 PM, Cameron Zwarich <zwarich at apple.com> wrote: > >> I'll try doing that. Did you ever add a way to update LiveIntervals quickly after splitting an edge or will that have to finally be added? I can skip the critical edge splitting for now. > > That doesn't exist yet, we'll need tha...

Dead Code Elimination. I’m going to try re-working it following some of the insights Don Quixote provided. From: Cameron Zwarich [mailto:zwarich at apple.com] Sent: Monday, November 21, 2011 12:17 PM To: Michael Smith Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] Optimization of array access Where does the -time-passes option say the time is going? Sent from my iPhone On Nov 21, 2011, at 8:58 AM, Michael Smith <Mic...

On Feb 8, 2013, at 4:03 PM, Cameron Zwarich <zwarich at apple.com> wrote: > How much of the work is done here? I'd be happy to do the phi elimination part, since I basically did that for StrongPhiElimination (RIP). Any help would be appreciated. I did a bit of the easy stuff in 2-addr, it has a LIS = getAnalysisIfAvailable&lt...

The allocator you are building, is it the Hack's and Goos's polynomial time algorithm? On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote: > There is nothing that currently handles this properly, as far as I know. If you have a phi > > c = phi(a, b) > > where a, b and c are all assigned distinct stack slots, then copies must be inserted in the predecessor. If registers have already be...

Sorry, Dead Store Elimination. From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Michael Smith Sent: Monday, November 21, 2011 12:20 PM To: Cameron Zwarich Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] Optimization of array access Dead Code Elimination. I’m going to try re-working it following some of the insights Don Quixote provided. From: Cameron Zwarich [mailto:zwarich at apple.com] Sent: Monday, November 21, 2011 12:17 PM To: Michael Smith...

On Feb 8, 2013, at 4:20 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > On Feb 8, 2013, at 4:03 PM, Cameron Zwarich <zwarich at apple.com> wrote: > >> How much of the work is done here? I'd be happy to do the phi elimination part, since I basically did that for StrongPhiElimination (RIP). > > Any help would be appreciated. > > I did a bit of the easy stuff in 2-addr, it has a LI...

On Feb 17, 2013, at 12:48 PM, Andrew Trick <atrick at apple.com> wrote: > On Feb 16, 2013, at 1:31 PM, Cameron Zwarich <zwarich at apple.com> wrote: > >> That's exactly the right place. > > Really? You don't want the expansion to be optimized? You want to specify a machine model for the pseudo's as if they're real instructions? You don't want to schedule or register alloca...

It looks like this problem only exists on nested loops, ideas? On Thu, Jan 12, 2012 at 11:44 AM, Ryan Taylor <ryta1203 at gmail.com> wrote: > Is it not a good idea to try and extract loops that have multiple exits? > > > On Thu, Jan 12, 2012 at 10:44 AM, Ryan Taylor <ryta1203 at gmail.com> wrote: > >> I am trying to use ExtractLoop() but I am getting segFaults:

...try that first: http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun10cc.pdf Cameron On Oct 5, 2010, at 7:43 PM, Jeff Kunkel wrote: > The allocator you are building, is it the Hack's and Goos's polynomial > time algorithm? > > On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote: >> There is nothing that currently handles this properly, as far as I know. If you have a phi >> >> c = phi(a, b) >> >> where a, b and c are all assigned distinct stack slots, then copies must be inserted in the predecessor. If reg...

...dy should at least have one label, right? In that case, some BB out of the loop can jump to the loop body, so the loop has more than on entry. Does LoopInfo guarantee to identify all natural loops? This property is very important for my pass. regards, Bo On Fri, Apr 29, 2011 at 11:50 PM, Cameron Zwarich <zwarich at apple.com> wrote: > A natural loop is one whose header dominates all of the nodes in the loop. > There is probably some block outside of the loop jumping to a block in the > loop body. > > Cameron > > On Apr 29, 2011, at 7:43 PM, Bo Wu <bwu at cs.wm.edu&gt...

...e reg17777 and reg18888 can both be on the stack. Then, at the end of the mbb 11, reg18888 must be stored not only in it's own slot, but also in reg16666's slot. I am wondering, do I need to communicate this information somehow? Thanks, Jeff Kunkel On Tue, Oct 5, 2010 at 4:35 PM, Cameron Zwarich <zwarich at apple.com> wrote: > At the moment, phi elimination happens before register allocation, so there can be no phis between memory locations. > > Cameron > > On Oct 5, 2010, at 4:19 PM, Jeff Kunkel wrote: > >> When doing phi elimination, does one have to communi...

...2, 2012, at 12:22 PM, Ryan Taylor wrote: > I'm not sure it's a bug. If I don't know if I am properly using it then how would I know it's a bug and not simply a user issue? If it sounds like a bug to you then I will file it. :) > > On Thu, Jan 12, 2012 at 12:18 PM, Cameron Zwarich <zwarich at apple.com> wrote: > Filing a bug with a test case would be a good start. > > Cameron > > On Jan 12, 2012, at 12:14 PM, Ryan Taylor <ryta1203 at gmail.com> wrote: > >> It looks like this problem only exists on nested loops, ideas? >> >>...

...39;m looking for? With > this current iteration method, I seem to sometimes get top down but other > times get bottom up and sometimes it starts top down then jumps to the > bottom and goes bottom up. Is there a reason for this randomness? > > On Sun, Nov 20, 2011 at 6:10 PM, Cameron Zwarich <zwarich at apple.com>wrote: > >> Your question is a bit vague, but you probably want >> ReversePostOrderTraversal from include/llvm/ADT/PostOrderIterator.h. >> >> Cameron >> >> On Nov 20, 2011, at 3:00 PM, Ryan Taylor wrote: >> >> > LLVMe...

On Jun 12, 2011, at 1:25 AM, Duncan Sands wrote: > Hi Sohail, > >> Is LLVM expressive enough to represent asynchronous exceptions? > > not currently. The first step in this direction is to get rid of the invoke > instruction and attach exception handling information to basic blocks. See > http://nondot.org/sabre/LLVMNotes/ExceptionHandlingChanges.txt > for a