<html><body><div style="color:#000; background-color:#fff; font-family:arial, helvetica, sans-serif;font-size:10pt"><div><span>Only because in my next passes I change the CFG significantly and it is very hard to maintain the values of the 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 9:36 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 08:35 AM, Jimborean Alexandra wrote:<br>> Hello Tobi,<br>><br>> You are right, we need to run some other passes before running the<br>> scalar evolution pass. The sequence that I run for this example is -O3<br>> -loop-simplify -reg2mem. This is why I did not obtain the expressions<br>> depending on the loop indices. So I removed the reg2mem pass and scalar<br>> evolution computes the correct functions.<br>><br>> However, I need to run the reg2mem pass (or any other that would<br>> eliminate the phi nodes) before calling my own passes. So probably we<br>> are going to run the scalar evolution on the code containing the phi<br>> nodes, run reg2mem and try to identify the original variables in the new<br>> code built after
reg2mem.<br><br>Just out of interest. Why do you need to run the reg2mem pass?<br><br>Cheers<br>Tobi<br><br><br></div></div></div></body></html>