Related articles |
---|
[8 earlier articles] |
Re: virtual machine efficiency cr88192@hotmail.com (cr88192) (2004-12-31) |
Re: virtual machine efficiency cr88192@hotmail.com (cr88192) (2004-12-31) |
Re: virtual machine efficiency strohm@airmail.net (John R. Strohm) (2005-01-01) |
Re: virtual machine efficiency kers@hpl.hp.com (Chris Dollin) (2005-01-12) |
Re: virtual machine efficiency cr88192@hotmail.com (cr88192) (2005-01-14) |
Re: virtual machine efficiency kers@hpl.hp.com (Chris Dollin) (2005-01-15) |
Re: virtual machine efficiency hannah@schlund.de (2005-01-30) |
From: | hannah@schlund.de (Hannah Schroeter) |
Newsgroups: | comp.compilers |
Date: | 30 Jan 2005 13:43:46 -0500 |
Organization: | Schlund + Partner AG |
References: | 04-12-151 04-12-163 |
Keywords: | VM, performance |
Posted-Date: | 30 Jan 2005 13:43:46 EST |
Hello!
VBDis <vbdis@aol.com> wrote:
>[...]
>Even if I know that on some machines misaligned reads are expensive,
>does anybody know of a concrete machine where reading a misaligned
>"word" will definitely take longer than reading the according number
>of individual bytes???
There are architectures that just don't do misaligned memory accesses
at all, producing a fault instead. The OS might handle the fault and
software-emulate the misaligned access, but handling faults is usually
*much* more expensive than
word = (a[0] << 24) | (a[1] << 16) | (a[2] << 8) | a[3]
Kind regards,
Hannah.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.