hjelm@g.cs.cmu.edu (Mark Hjelm) (07/03/86)
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