Displaying 3 results from an estimated 3 matches for "crc32le".
Did you mean:
crc32be
2018 Nov 06
4
Rather poor code optimisation of current clang/LLVM targeting Intel x86 (both -64 and -32)
...m
else // these 4 lines is
crc <<= 1; // rather poor!
}
return crc;
}
The same function for "little endian" byte order, using the "inverse"
or "mirrored" polynom:
unsigned int crc32le(unsigned char const *octets, unsigned int count)
{
unsigned int crc = ~0L;
unsigned int i;
while (count--) {
crc ^= *octets++;
for (i = 8; i > 0; i--)
if (crc & 1L) // the code generated
crc >>= 1, crc ^= 0x0...
2018 Nov 27
2
Rather poor code optimisation of current clang/LLVM targeting Intel x86 (both -64 and -32)
...crc <<= 1; // rather poor!
>> }
>> return crc;
>> }
>>
>> The same function for "little endian" byte order, using the "inverse"
>> or "mirrored" polynom:
>>
>> unsigned int crc32le(unsigned char const *octets, unsigned int count)
>> {
>> unsigned int crc = ~0L;
>> unsigned int i;
>>
>> while (count--) {
>> crc ^= *octets++;
>> for (i = 8; i > 0; i--)
>> if (crc & 1L)...
2018 Nov 28
2
Rather poor code optimisation of current clang/LLVM targeting Intel x86 (both -64 and -32)
...> >> }
>> >> return crc;
>> >> }
>> >>
>> >> The same function for "little endian" byte order, using the "inverse"
>> >> or "mirrored" polynom:
>> >>
>> >> unsigned int crc32le(unsigned char const *octets, unsigned int count)
>> >> {
>> >> unsigned int crc = ~0L;
>> >> unsigned int i;
>> >>
>> >> while (count--) {
>> >> crc ^= *octets++;
>> >> for (i = 8; i >...