llvm dev - Mar 2008 - [LLVMdev] What is "strong phi elimination"

Do you mean that "normal" SSA phi elimination algorithm is
DemotePHI()?

Thx,
Seung

---- Original message ----
>Date: Mon, 24 Mar 2008 21:43:06 -0700
>From: Chris Lattner <sabre at nondot.org>  
>Subject: Re: [LLVMdev] What is "strong phi elimination"  
>To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu>
>Cc: Christopher Lamb <christopher.lamb at gmail.com>
>
>
>On Mar 24, 2008, at 9:22 PM, Owen Anderson wrote:
>> Ask an ye shall receive.  From the .cpp file:
>> Basically, it's PHI elimination with built-in coallescing.
>
>You mean "coalescing" (tips hat to Gabor :).
>
>Another way to look at it is that it is the "normal" SSA phi  
>elimination algorithm, which is normally implemented in terms of an  
>interference graph, without the IG.  Not using an IG saves having to  
>build an awful N^2 data structure, which is possible through clever  
>use of SSA properties.
>
>-Chris
>
>_______________________________________________
>LLVM Developers mailing list
>LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
>http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev

On Mar 24, 2008, at 10:25 PM, Seung Jae Lee wrote:
> Do you mean that "normal" SSA phi elimination algorithm is  
> DemotePHI()?
No, DemotePHI doesn't build an interference graph, and is not part of  
the code generator.

-Chris