You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

crc32.c 1.5KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. /*
  2. * Little-endian CRC32 implementation.
  3. *
  4. * Copyright (c) 2009 Joshua Oreman <oremanj@rwcr.net>.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License as
  8. * published by the Free Software Foundation; either version 2 of the
  9. * License, or any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  19. * 02110-1301, USA.
  20. */
  21. FILE_LICENCE ( GPL2_OR_LATER );
  22. #include <ipxe/crc32.h>
  23. #define CRCPOLY 0xedb88320
  24. /**
  25. * Calculate 32-bit little-endian CRC checksum
  26. *
  27. * @v seed Initial value
  28. * @v data Data to checksum
  29. * @v len Length of data
  30. *
  31. * Usually @a seed is initially zero or all one bits, depending on the
  32. * protocol. To continue a CRC checksum over multiple calls, pass the
  33. * return value from one call as the @a seed parameter to the next.
  34. */
  35. u32 crc32_le ( u32 seed, const void *data, size_t len )
  36. {
  37. u32 crc = seed;
  38. const u8 *src = data;
  39. u32 mult;
  40. int i;
  41. while ( len-- ) {
  42. crc ^= *src++;
  43. for ( i = 0; i < 8; i++ ) {
  44. mult = ( crc & 1 ) ? CRCPOLY : 0;
  45. crc = ( crc >> 1 ) ^ mult;
  46. }
  47. }
  48. return crc;
  49. }