Re: Where are delayed branches handled?

Article View: net.arch

Article #2696

#2696

From: David M. Siegel
Date: Sat, 16 Aug 1986 14:01

14 lines
922 bytes

   From: steve@jplgodo.UUCP
   Newsgroups: net.arch
   Date: 13 Aug 86 16:45:20 GMT

   An optimizing assembler?  What a disaster that would be.  

Actually, optimzing assemblers are fairly common, since they are very
easy to write. If you have an existing compiler that doesn't optimize,
and you need to boost performance a bit, fiddling directly with the
assembler code output is the easiest thing to do.
-- 

					-Dave

Technical Details

Message-ID: <2695@mit-hermes.ARPA>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!caip!lll-crg!nike!think!mit-eddie!mit-hermes!dms

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!caip!lll-crg!nike!think!mit-eddie!mit-hermes!dms
From: dms@mit-hermes.ARPA (David M. Siegel)
Newsgroups: net.arch
Subject: Re: Where are delayed branches handled?
Message-ID: <2695@mit-hermes.ARPA>
Date: Sat, 16-Aug-86 10:01:58 EDT
Article-I.D.: mit-herm.2695
Posted: Sat Aug 16 10:01:58 1986
Date-Received: Sun, 17-Aug-86 10:20:19 EDT
Organization: The MIT AI Lab, Cambridge, MA
Lines: 14