<html><body><div style="color:#000; background-color:#fff; font-family:arial, helvetica, sans-serif;font-size:10pt"><div><span>Ok, thank you, I will have a look and reply with questions if necessary. Does it take into consideration the existing phi nodes?</span></div><div><br><span></span></div><div><span>Alexandra<br></span></div><div><br></div><div style="font-family: arial, helvetica, sans-serif; font-size: 10pt;"><div style="font-family: times new roman, new york, times, serif; font-size: 12pt;"><font face="Arial" size="2"><hr size="1"><b><span style="font-weight:bold;">From:</span></b> Tobias Grosser <tobias@grosser.es><br><b><span style="font-weight: bold;">To:</span></b> Jimborean Alexandra <xinfinity_a@yahoo.com><br><b><span style="font-weight: bold;">Cc:</span></b> "llvmdev@cs.uiuc.edu" <llvmdev@cs.uiuc.edu>; "luismastrangelo@gmail.com" <luismastrangelo@gmail.com><br><b><span style="font-weight: bold;">Sent:</span></b>
Wednesday, August 3, 2011 11:26 AM<br><b><span style="font-weight: bold;">Subject:</span></b> Re: [LLVMdev] scalar evolution to determine access functions in arays<br></font><br>On 08/03/2011 10:22 AM, Jimborean Alexandra wrote:<br>> Only because in my next passes I change the CFG significantly and it is<br>> very hard to maintain the values of the Phi nodes.<br><br>OK. In Polly we developed a pass called, 'independent-blocks-pass'. It basically creates basic blocks, that can easily be rescheduled without stopping the scalar evolution analysis to work. Maybe something similar can help you. Details about this pass are available in my thesis.<br><br>Cheers<br>Tobi<br><br><br></div></div></div></body></html>