Hi,
I am reading the code of autovect branch and curious about how to deal
with the dependencies of virtual defs/uses. In the function
vect_analyze_scalar_cycles( ), I found the statement "Skip virtual
phi's. The data dependences that are associated with virtual defs/uses
( i.e., memory accesses)
Thanks! In fact, I should ask how to deal with idiom (such as
reduction, induction) recognition for virtual defs/uses.
Jiahua
2007/2/12, Daniel Berlin <[EMAIL PROTECTED]>:
On 2/12/07, Jiahua He <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I am reading the code of autovect branch
t;
> 2007/2/12, Daniel Berlin <[EMAIL PROTECTED]>:
> > On 2/12/07, Jiahua He <[EMAIL PROTECTED]> wrote:
> > > Hi,
> > >
> > > I am reading the code of autovect branch and curious about how to
deal
> > > with the dependencies of virtual defs/uses. In
2007/2/15, Dorit Nuzman <[EMAIL PROTECTED]>:
"Jiahua He" <[EMAIL PROTECTED]> wrote on 12/02/2007 22:54:08:
> Oh, I see. For reduction and induction, you don't need to deal with
> the condition with vdef. I am considering how to implement an idiom
> with vdef
Hi All,
I am looking for an open source compiler, such as GCC, Open64, Scale
and SUIF, as the infrastructure of my research. Though I have read
some of their documents, they are still complicate to me and it is
difficult to decide which one is better. Can you please help me to
compare these compi
2007/6/25, Basile STARYNKEVITCH <[EMAIL PROTECTED]>:
Jiahua He wrote:
> Hi All,
>
> I am looking for an open source compiler, such as GCC, Open64, Scale
> and SUIF, as the infrastructure of my research. Though I have read
> some of their documents, they are still compl
