crc8高位在左低位在右，使用时请注意高低位顺序

小结前人的成果 :原码

/* Return CRC-8 of the data, using x^8 + x^2 + x + 1 polynomial. A * table-based algorithm would be faster, but for only a few bytes it isn't * worth the code size. */
uint8_t Crc8(const void* vptr, int len) 
{    
const uint8_t *data = (uint8_t*)vptr;    
unsigned crc = 0;    
int i, j;    
for (j = len; j; j--, data++)
 {        
crc ^= (*data << 8);        
for(i = 8; i; i--) 
{            
if (crc & 0x8000) {crc ^= (0x1070 << 3);}
        crc <<= 1;        
}    
}   
 return (uint8_t)(crc >> 8);
}

int main(int argc, char *argv[])
{     
 	uint8_t c[5]= {0x04,0x03,0x00,0x01,0x00};    
 	qDebug("Crc8=0x%0x",Crc8(c,5));
}

 如下图:程序代码截图

如下图:是网站的结果对比