The VirtualTreeView tries to make the fields of the (packed) record
aligned at dword boundary by grouping together smaller (one or two
byte fields) or adding dummy fields. Does this trick overrides the
unaligned memory access?
Of course it is always a good idea to sort the members of a record
according to their size (if size is 2**n: order from big to small). As
there is no definition about how the compiler is to place the record
elements in a record, IMHO the compiler should do this automatically,
unless the record is defined as (bit-)packed.
-Michael
_______________________________________________
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
