[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <C1B3152F-C462-445E-BBC8-79F704DBF363@gmail.com>
Date: Sun, 10 May 2015 09:24:34 +0800
From: Lei Zhang <zhanglei.april@...il.com>
To: john-dev@...ts.openwall.com
Subject: Re: Adding OpenMP support to SunMD5
> On May 10, 2015, at 2:26 AM, magnum <john.magnum@...hmail.com> wrote:
>
> On 2015-05-09 16:39, Lei Zhang wrote:
>> Dynamic arrays have slower accessing than static arrays.
>
> Is that necessarily a fact? Why?
Not necessary, but sometimes.
The base address of a dynamic array must be determined at run time, while the address of a static array can be determined at compile time.
For a static array, when accessing some element, say a[5], the compiler can compute this address at compile time. For a dynamic array, however, the computation of this address has to happen at run time.
If the index is a dynamic value, the two should have same performance though.
Lei
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
