1*60d18d3fSSimon Glass /* 2*60d18d3fSSimon Glass * Copyright (c) 2013 Google, Inc 3*60d18d3fSSimon Glass * 4*60d18d3fSSimon Glass * SPDX-License-Identifier: GPL-2.0+ 5*60d18d3fSSimon Glass */ 6*60d18d3fSSimon Glass 7*60d18d3fSSimon Glass 8*60d18d3fSSimon Glass #ifndef __linux_crc8_h 9*60d18d3fSSimon Glass #define __linux_crc8_h 10*60d18d3fSSimon Glass 11*60d18d3fSSimon Glass /** 12*60d18d3fSSimon Glass * crc8() - Calculate and return CRC-8 of the data 13*60d18d3fSSimon Glass * 14*60d18d3fSSimon Glass * This uses an x^8 + x^2 + x + 1 polynomial. A table-based algorithm would 15*60d18d3fSSimon Glass * be faster, but for only a few bytes it isn't worth the code size 16*60d18d3fSSimon Glass * 17*60d18d3fSSimon Glass * @vptr: Buffer to checksum 18*60d18d3fSSimon Glass * @len: Length of buffer in bytes 19*60d18d3fSSimon Glass * @return CRC8 checksum 20*60d18d3fSSimon Glass */ 21*60d18d3fSSimon Glass unsigned int crc8(const unsigned char *vptr, int len); 22*60d18d3fSSimon Glass 23*60d18d3fSSimon Glass #endif 24