Re: Release of RosAsm V.2.025a
- From: Alex McDonald <alex_mcd@xxxxxxxxxxxxxxx>
- Date: Fri, 9 Sep 2005 08:49:00 +0000 (UTC)
Betov wrote:
And, if i may add, anyone wishing to develop an Assembler doing Jumps Size Optimizations, - in one single and simple additional Computation, taking almost no time , instead of the traditional Multi-Passes -, can take a lesson from RosAsm Source.
Backward jumps are trivial; the distance is known because the code has been generated. But how do you assess the jump distance for forward jumps without a second pass? This;
jmp B ...code... jmp A ...code... B: ...code... A: ...code...
requires that the jump to B is dependant on the length of the jump to A opcode. Can you describe how you optimise this in one pass?
-- Regards ALex McDonald .
- Follow-Ups:
- Re: Release of RosAsm V.2.025a
- From: Betov
- Re: Release of RosAsm V.2.025a
- References:
- Release of RosAsm V.2.025a
- From: Betov
- Re: Release of RosAsm V.2.025a
- From: randyhyde@xxxxxxxxxxxxx
- Re: Release of RosAsm V.2.025a
- From: randyhyde@xxxxxxxxxxxxx
- Re: Release of RosAsm V.2.025a
- From: Betov
- Release of RosAsm V.2.025a
- Prev by Date: No, POLL and WAIT
- Next by Date: Re: Burning Match
- Previous by thread: Re: Release of RosAsm V.2.025a
- Next by thread: Re: Release of RosAsm V.2.025a
- Index(es):
Relevant Pages
|