This is the mail archive of the
mailing list for the binutils project.
Re: optimization by as
- From: <Paul_Koning at Dell dot com>
- To: <kumarvir dot pathak at gmail dot com>
- Cc: <Andrew dot Bennett at imgtec dot com>, <binutils at sourceware dot org>
- Date: Mon, 10 Aug 2015 14:53:11 +0000
- 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>
> On Aug 10, 2015, at 2:41 AM, Virendra Kumar Pathak <email@example.com> wrote:
> Hi Andrew,
> Thanks for the reply.
> 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.
Good assemblers donât do optimization; that is the job of the compiler (or, in the uncommon case of hand-written assembly language, the programmer). The MIPS assembler is an aberration, fortunately a rare one. Note that this âoptimizationâ machinery is turned off by recent compilers when they feed generated code to the assembler, because it gets in the way of the compiler doing a better job.