home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.compilers
- Path: sparky!uunet!think.com!spdcc!iecc!compilers-sender
- From: jeremy@sw.oz.au (Jeremy Fitzhardinge)
- Subject: Re: Code optimization questions
- Reply-To: jeremy@sw.oz.au (Jeremy Fitzhardinge)
- Organization: Softway Pty Ltd
- Date: Mon, 16 Nov 1992 08:10:20 GMT
- Approved: compilers@iecc.cambridge.ma.us
- Message-ID: <92-11-082@comp.compilers>
- Keywords: optimize, bibliography
- References: <92-11-015@comp.compilers>
- Sender: compilers-sender@iecc.cambridge.ma.us
- Lines: 42
-
- cse264ce@cs.ucsd.edu (What Is) writes:
- >[1] Is there any info on optimizers that take advantage of profiler
- > information?
-
- There is the Coagulating Code Generator which uses basic-block level
- profiling information to order the code generation phase. The idea used
- is that most used code should get first choice in registers etc. It also
- uses profiling information of control flow between basic blocks to
- generate optimal linkages between them. It does that at all levels (from
- basic blocks to procedures). It can also arrange for a code sequence to
- take inputs in multiple ways depending on how control is passed to it.
-
- The Mips C compiler will use pixie output to arrange code in a
- cache-friendly way.
-
- @inproceedings{karr84,
- AUTHOR = {Karr, Michael},
- BOOKTITLE = {SIGPLAN notices},
- MONTH = {June},
- ORGANIZATION = {ACM},
- PAGES = {11},
- PUBLISHER = {ACM},
- TITLE = {Code Generation by Coagulation},
- YEAR = {1984}
- }
-
- @inproceedings{morris91,
- title="CCG: A Prototype Coagulating Code Generator",
- booktitle="Proceedings of the ACM SIGPLAN '91 Conference on Programming
- Language Design and Implementation",
- month=June,
- pages="45--58",
- author="W.G. Morris",
- year=1991
- }
-
- J
- --
- jeremy@sw.oz.au ph:+61 2 698 2322-x122 fax:+61 2 699 9174
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-