Dear Heinrich,
In message <53dad1c7-7684-f975-1567-6ec5e03fa...@gmx.de> you wrote:
>
> If we want a fast algorithm to determine the last supported address even
> if the start or size is not a power of two:
Are you sure? How is this supposed to work?
Running it with start = 0 and size = 0xC0000000 it will test the
memory locations
0x80000000
0xA0000000
0xB0000000
0xB8000000
0xBC000000
0xBE000000
0xBF000000
0xBF800000
0xBFC00000
0xBFE00000
0xBFF00000
0xBFF80000
0xBFFC0000
0xBFFE0000
0xBFFF0000
0xBFFF8000
0xBFFFC000
0xBFFFE000
0xBFFFF000
0xBFFFF800
0xBFFFFC00
0xBFFFFE00
0xBFFFFF00
0xBFFFFF80
0xBFFFFFC0
0xBFFFFFE0
0xBFFFFFF0
0xBFFFFFF8
0xBFFFFFFC
0xBFFFFFFE
0xBFFFFFFF
What do you intend with such a sequence?
Best regards,
Wolfgang Denk
--
DENX Software Engineering GmbH, Managing Director: Wolfgang Denk
HRB 165235 Munich, Office: Kirchenstr.5, D-82194 Groebenzell, Germany
Phone: (+49)-8142-66989-10 Fax: (+49)-8142-66989-80 Email: w...@denx.de
The trouble with our times is that the future is not what it used to
be. - Paul Valery
