Code Generation for Short/Long Address Machines.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
Many machine languages have different instruction formats which allow addressing of nearby operands with a short instruction e.g. one word, while faraway operands require a long format e.g. two words. Because the size of object code may depend upon the formats used, the formats of different instructions may be dependent on each other. An efficient algorithm is given for optimally assigning formats to instructions in a given program, and an implementation will be discussed which is practical in space as well as time. The more sophisticated problem of arranging operands within programs is discussed. Unfortunately, it is unlikely that an efficient algorithm can even guarantee good approximations for this problem. Finally, implications of this problem on hardware and software designs are considered. Author
- Computer Programming and Software