Newsgroups: rec.arts.int-fiction
Path: news.duke.edu!newsgate.duke.edu!nntp-out.monmouth.com!newspeer.monmouth.com!feed2.onemain.com!feed1.onemain.com!uunet!dca.uu.net!ash.uu.net!world!buzzard
From: buzzard@world.std.com (Sean T Barrett)
Subject: Re: Z-Machine
Message-ID: <GGzGo2.Iu7@world.std.com>
Date: Tue, 24 Jul 2001 15:07:14 GMT
References: <2xn57.49227$WS4.7531669@news6-win.server.ntlworld.com> <tlptsqk315gn71@corp.supernews.com> <GGzBJ8.8y5@world.std.com> <GGzFs6.4M4@world.std.com>
Organization: The World Public Access UNIX, Brookline, MA
Lines: 14
Xref: news.duke.edu rec.arts.int-fiction:90141

Sean T Barrett <buzzard@world.std.com> wrote:
>This would make "pointer arithmetic" on byte arrays impossible,
>but I don't know whether people currently do that.

Assuming pointer arithmetic on word arrays is unnecessary
too, you could start using "dword addressing"--forcing
word arrays onto four-byte boundaries, and have common
properties still take the same total space as I just
proposed (4 bytes: 2 for ID & size, 2 for the data), but
with more careful (mis-)alignment, and extra padding for
larger properties; this would allow you to grow quadruple
dynamic memory (for properties and word arrays) to 256K.

SeanB
