|Conversion Optimization email@example.com (2004-12-01)|
|Re: Conversion Optimization firstname.lastname@example.org (TOUATI Sid) (2004-12-11)|
|Re: Conversion Optimization email@example.com (2004-12-13)|
|From:||firstname.lastname@example.org (Ben L. Titzer)|
|Date:||1 Dec 2004 23:15:50 -0500|
|Posted-Date:||01 Dec 2004 23:15:50 EST|
I am working on a domain specific language where the basic data types
included unstructured bit patterns. For example, it is possible to
extract individual bits, bit ranges, etc from these unstructured bit
patterns. It turns out to be pretty convenient for the types of things
that I am doing.
I am compiling to Java source code. Obviously the bit patterns, which
currently are all smaller than 64 bits, must be represented in the
primitive type system of Java, which includes byte, short, int, long,
char, and boolean (I do not support floating point yet).
Is there any work, or any languages, for optimizing the conversion of
bit patterns. For example, signed / unsigned extension, truncation,
My goal is to write everything in bit patterns and have the compiler
do the job of scheduling the necessary conversions to / from various
primitive types as well as masking, shifting, etc.
Thanks for any help!
Return to the
Search the comp.compilers archives again.