This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: Fw: [PATCH] ipa aliasing analysis
- From: Steven Bosscher <stevenb at suse dot de>
- To: gcc-patches at gcc dot gnu dot org
- Cc: Olga Golovanevsky <OLGA at il dot ibm dot com>, jh at suse dot cz
- Date: Mon, 2 May 2005 02:29:22 +0200
- Subject: Re: Fw: [PATCH] ipa aliasing analysis
- References: <OFFA09A947.DF0ED00B-ONC2256FF3.004BA130-C2256FF3.004C43A6@il.ibm.com> <200505011359.21573.stevenb@suse.de>
On Sunday 01 May 2005 13:59, Steven Bosscher wrote:
> On Saturday 30 April 2005 15:53, Olga Golovanevsky wrote:
> > This patch is an initial version of interprocedural
> > alias analysis (ipaa) for tree-profilinf branch. It is
> > based on the paper by Cooper and Kennedy:
> >
> > http://www.cs.wisc.edu/~cs701-1/PAPERS/CooperKennedyPOPL89.pdf
>
> Unfortunately this link is broken :-( I can't find another PS/PDF
> reference...
Did you also use this paper by Mayer and Wolfe,
"InterProcedural Alias Analysis: Implementation and Empirical Results"?
It mentions a mistake in Cooper's paper. They also use a worklist
instead of the pair-binding graph (Pi-graph, whatever). What does your
implementation use?
Mayer&Wolfe can be downloaded from Citeseer here:
http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol23/issue11/spe859.pdf
Gr.
Steven