This is the mail archive of the
mailing list for the binutils project.
Re: optimization by as
- From: Ian Lance Taylor <iant at google dot com>
- To: Matthew Fortune <Matthew dot Fortune at imgtec dot com>
- Cc: Virendra Kumar Pathak <kumarvir dot pathak at gmail dot com>, Andrew Bennett <Andrew dot Bennett at imgtec dot com>, "binutils at sourceware dot org" <binutils at sourceware dot org>
- Date: Tue, 11 Aug 2015 07:22:08 -0700
- Subject: Re: optimization by as
- Authentication-results: sourceware.org; auth=none
- References: <CAEDvCBS2RdGBwpirseB5Bne1_tOw=68O-5V9Q-S+AmZM7+vWog at mail dot gmail dot com> <0DA23CC379F5F945ACB41CF394B982772110532C at LEMAIL01 dot le dot imgtec dot org> <CAEDvCBS4m4UkNo+XcAPLZ7i9PYdV3XSp-XxGUvoEvHN9RWEnfQ at mail dot gmail dot com> <6D39441BF12EF246A7ABCE6654B023532120CF37 at LEMAIL01 dot le dot imgtec dot org>
On Mon, Aug 10, 2015 at 6:22 AM, Matthew Fortune
> Virendra Kumar Pathak <firstname.lastname@example.org> writes:
>> What other types of optimization can be handled by the assembler ?
>> Are they capable of re-ordering the instructions ?
>> For example inserting other instruction between two loads (on machine
>> with one load unit) to avoid pipeline stall.
> No, that would then be a compiler/recompiler as it needs to do so much
> analysis for safety. You 'can' do anything you like in the assembler
> but probably shouldn't as it is not geared up for that kind of processing.
Although for a while there was the MAO project:
http://code.google.com/p/mao/ . As far as I know, though, it is dead.