| Tom Rini | 10e4779 | 2018-05-06 17:58:06 -0400 | [diff] [blame] | 1 | /* SPDX-License-Identifier: GPL-2.0+ */ |
| Simon Glass | 46e0bc9 | 2013-11-10 10:26:47 -0700 | [diff] [blame] | 2 | /* |
| 3 | * Copyright (c) 2013 Google, Inc |
| Simon Glass | 46e0bc9 | 2013-11-10 10:26:47 -0700 | [diff] [blame] | 4 | */ |
| 5 | |
| 6 | |
| 7 | #ifndef __linux_crc8_h |
| 8 | #define __linux_crc8_h |
| 9 | |
| 10 | /** |
| 11 | * crc8() - Calculate and return CRC-8 of the data |
| 12 | * |
| 13 | * This uses an x^8 + x^2 + x + 1 polynomial. A table-based algorithm would |
| 14 | * be faster, but for only a few bytes it isn't worth the code size |
| 15 | * |
| Stefan Roese | a0d9b99 | 2016-04-08 15:56:29 +0200 | [diff] [blame] | 16 | * @crc_start: CRC8 start value |
| Simon Glass | 46e0bc9 | 2013-11-10 10:26:47 -0700 | [diff] [blame] | 17 | * @vptr: Buffer to checksum |
| 18 | * @len: Length of buffer in bytes |
| 19 | * @return CRC8 checksum |
| 20 | */ |
| Stefan Roese | a0d9b99 | 2016-04-08 15:56:29 +0200 | [diff] [blame] | 21 | unsigned int crc8(unsigned int crc_start, const unsigned char *vptr, int len); |
| Simon Glass | 46e0bc9 | 2013-11-10 10:26:47 -0700 | [diff] [blame] | 22 | |
| 23 | #endif |