In find_first_bit() there exists this the sequence:
shll $3,%%edi
addl %%edi,%%eax
LEA knows how to multiply by small powers of 2 and add all in one shot very
efficiently:
leal (%%eax,%%edi,8),%%eax
In find_first_zero_bit() the sequence:
shll $3,%%edi
addl %%edi,%%edx
could similarly become:
leal (%%edx,%%edi,8),%%edx
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]