🚀 go-pugleaf

In article <13589@nsc.nsc.com>, amos@nsc.nsc.com (Amos Shapir) writes:
> In article <WAYNE.90Feb11165528@dsndata.uucp> wayne@dsndata.uucp (Wayne Schlitt) writes:
> >instruction path        see data path
> >
> 
> Not so fast.  Each byte in the instruction space was put there by a human,
> or translated from code written by a human. I-space is the only(?) factor
> whose growth will always be linear rather than exponential.

It is frequently the case that very long loops can be unrolled.  Also, in
some heavily branched situations, it is possible to combine multiple branches
as a single branch, and to use a transfer table.  It may even be advantageous
to have a fixed spacing between the branch addresses, which can add size to
the instruction code.  Thus, code written by a human can easily translate
into 2^20 or more instructions.
-- 
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907
Phone: (317)494-6054
hrubin@l.cc.purdue.edu (Internet, bitnet, UUCP)