Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site sjuvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!astrovax!sjuvax!jss
From: jss@sjuvax.UUCP (Jonathan Shapiro)
Newsgroups: net.lang
Subject: Optimization technique wanted...
Message-ID: <601@sjuvax.UUCP>
Date: Tue, 6-Nov-84 02:37:09 EST
Article-I.D.: sjuvax.601
Posted: Tue Nov  6 02:37:09 1984
Date-Received: Wed, 7-Nov-84 08:06:06 EST
Distribution: net
Organization: Saint Josephs Univ. Phila., Pa.
Lines: 20

[Aren't you hungry...?]

	I have a questino about optimizing assembler source... Given that
one is generating relocatable code on a microprocessor which has
offsets whose length in bytes is dependent on the offset amount - i.e.
jumping 63 bytes can be accomplished with a one byte relative address
value, while jumping 64 bytes needs a two byte relative address - how does
one handle the case of:

	B: <code>
	...
	JUMP C
	JUMP A
	JUMP B
	...
	A: <code>
	...
	C: <code>

Any thoughts???