I have this code in C (it's for study only):
char x;
uint64_t total = 0;
for(x = 20; x < 30; x++){
total = (((((1 << x) * x) / 64) + 1) * sizeof(uint64_t));
printf("%d - %llu\n", x, total);
}
What is printed:
20 - 2621448
21 - 5505032
22 - 11534344
23 - 24117256
24 - 50331656
25 - 104857608
26 - 218103816
27 - 18446744073625665544
28 - 18446744073575333896
29 - 18446744073508225032
Why at x > 26 do I have those strange values? I'm at gcc 4.6.1 on Ubuntu 10.10 64 bits.
Because
1
is anint
, 32 bits, so(1 << 27)*27
overflows. Use1ull
.Regarding your comment, if
x
is auint64_t
, then1 << x
is still anint
, but for the multiplication it would be cast touint64_t
, so there'd be no overflow. However, ifx >= 31
,1 << x
would be undefined behaviour (as the resulting value cannot be represented by a signed 32 bit integer type).I guess your problem is, you calculate with 32bit and assign it later to a 64 bit value
division by 64 is the same as not shift 6 bit
not compiled yet