Re: optimizing compiler against iaverage assembly programmer.

Charles Fiterman <cef@geodesic.com>
4 Jul 1997 14:45:01 -0400

          From comp.compilers
Related articles
[11 earlier articles]
Re: optimizing compiler against iaverage assembly programmer. WStreett@shell.monmouth.com (1997-06-30)
Re: optimizing compiler against iaverage assembly programmer. creedy@mitretek.org (1997-06-30)
Re: optimizing compiler against iaverage assembly programmer. als@tusc.com.au (1997-07-04)
Re: optimizing compiler against iaverage assembly programmer. conway@mundook.cs.mu.OZ.AU (1997-07-04)
Re: optimizing compiler against iaverage assembly programmer. als@tusc.com.au (1997-07-04)
Re: optimizing compiler against iaverage assembly programmer. dietz@interaccess.com (1997-07-04)
Re: optimizing compiler against iaverage assembly programmer. cef@geodesic.com (Charles Fiterman) (1997-07-04)
Re: optimizing compiler against iaverage assembly programmer. johncl@online.no (1997-07-04)
| List of all articles for this month |
From: Charles Fiterman <cef@geodesic.com>
Newsgroups: comp.compilers,comp.lang.asm.x86
Date: 4 Jul 1997 14:45:01 -0400
Organization: Geodesic Systems
References: 97-06-071 97-06-081 97-06-101 97-06-134
Keywords: optimize, practice

The need to code even small parts of programs is vanishing. We sell a
conservative garbage collector. On some platforms the central scan
loop is coded in assembler. But consider what this is. Programs linked
to the collector spend a substantial portion of their time in a loop
of code shorter than this letter.


The entire collector isn't assembler, only a tiny loop.


-
Charles Fiterman Geodesic Systems
414 North Orleans Suite 410 Phone 312 832 1221 x223
Chicago IL 60610-4418 FAX 312 832 1230
http://www.geodesic.com
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.