Related articles |
---|
[4 earlier articles] |
Re: Inlining functions with loops ayers@apollo.hp.com (1995-11-30) |
Re: Inlining functions with loops cdg@nullstone.com (1995-12-01) |
Re: Inlining functions with loops jeremy@suede.sw.oz.au (1995-12-01) |
Inlining functions with loops dave@occl-cam.demon.co.uk (Dave Lloyd) (1995-12-01) |
Re: Inlining functions with loops serrano@ardeche.IRO.UMontreal.CA (1995-12-01) |
Re: Inlining functions with loops tore@lis.pitt.edu (1995-12-09) |
Re: Inlining functions with loops preston@tera.com (1995-12-09) |
Re: Inlining functions with loops ball@Eng.Sun.COM (1995-12-09) |
Re: Inlining functions with loops ok@cs.rmit.edu.au (1995-12-09) |
Re: Inlining functions with loops jsa@organon.com (1995-12-09) |
Re: Inlining functions with loops cdg@nullstone.com (1995-12-17) |
From: | preston@tera.com (Preston Briggs) |
Newsgroups: | comp.compilers |
Date: | 9 Dec 1995 19:15:14 -0500 |
Organization: | Compilers Central |
References: | 95-11-241 95-12-013 |
Keywords: | optimize, C++ |
jeremy@suede.sw.oz.au (Jeremy Fitzhardinge) writes:
[on the benefits of inlining]
>If you do alias analysis you get "interprocedural"
>alias analysis for free.
Not really. Inlining gives you "free" interprocedural analysis, but
only across call sites where you actually perform inlining. If we
have a constant parameter introduced as main() calls some routine, and
that same parameter is passed down through many levels of calling,
then you'd have to inline all of them to notice the constant.
Preston Briggs
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.