🚀 go-pugleaf

In article <4jr74b$h95@solutions.solon.com>, ok@cs.rmit.edu.au (Richard A. O'Keefe) writes:

[catches my error] Just checking if you're all awake! :)

|> >Furthermore, in yesterdays posting making the size of the cell sizeof (unsigned)
|> >is arbitrary; in particular, it has nothing to do with the fact that the
|> >type of the bitfield is unsigned.  In the environment I am currently
|> >computing in, a cell size of sizeof (void *) would be more likely to make
|> >the cell size equal to the machine word length.
|> 
|> There are machines in which sizeof (void *) greatly exceeds the size of
|> any integral type.

Rumour has it that the AS/400 uses pointers of length 128 bytes, which contain
not only addressing information but capabilities as well.
How is C implemented on such a machine, in particular, how are pointers
or arrays implemented?  (If the full 128 bytes are accessed for every pointer
and there is no such integral type, it must be fantastically slow.)

Konrad Schwarz