|Code generation for load/store packed data email@example.com (Nicolau Bogoevich) (2008-05-11)|
|Re: Code generation for load/store packed data firstname.lastname@example.org (cr88192) (2008-05-12)|
|From:||Nicolau Bogoevich <email@example.com>|
|Date:||Sun, 11 May 2008 20:27:04 -0700 (PDT)|
|Keywords:||architecture, optimize, question|
|Posted-Date:||11 May 2008 23:31:01 EDT|
I am very interested in to know how compilers generate optimized code
for loading or storing data at unaligned memory locations and that
located inside bitfields (i. e., like that generated by using GNU C
"packed attribute" or packed ANSI C bitfield type definitions).
I suppose that is a well-known subject that was solved by somebody a
long time ago. Do you know some well-known technique or literature
about that subject? I would appreciate some pointers.
Thanks in advance!
Return to the
Search the comp.compilers archives again.