Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!caip!lll-crg!seismo!rochester!pt.cs.cmu.edu!g.cs.cmu.edu!hjelm
From: hjelm@g.cs.cmu.edu (Mark Hjelm)
Newsgroups: net.lang.c
Subject: Pointers on weird architectures
Message-ID: <1007@g.cs.cmu.edu>
Date: Thu, 3-Jul-86 00:03:26 EDT
Article-I.D.: g.1007
Posted: Thu Jul  3 00:03:26 1986
Date-Received: Fri, 4-Jul-86 06:49:08 EDT
Organization: Carnegie-Mellon University, CS/RI
Lines: 17

I am currently writing some code which pokes around memory
and examines data structures at run time using a type description.
The code is only given the type description and a generic pointer
and must do all the alignment and whatever else itself.  This is
pretty easy on Vaxes and RTs and such.  My question is: how are
C data structures and pointers implemented on less traditional
architectures?  I would like to parameterize the differences
as much as possible, so I need several different examples.
So... if you are familiar with any alternative architectures
(segmented, tagged, ???), please help me out.

Thanks,
Mark

ARPA:   hjelm@g.cs.cmu.edu
UUCP:   seismo!g.cs.cmu.edu!hjelm
CSNET:  hjelm%a.cs.cmu.edu@csnet-relay