mirror of
https://github.com/notepad-plus-plus/notepad-plus-plus.git
synced 2025-12-14 09:14:57 +01:00
git-svn-id: svn://svn.tuxfamily.org/svnroot/notepadplus/repository/trunk@896 f5eea248-9336-0410-98b8-ebc06183d4e3
122 lines
3.8 KiB
C++
122 lines
3.8 KiB
C++
// This file is part of Notepad++ project
|
|
// Copyright (C)2003 Don HO <don.h@free.fr>
|
|
//
|
|
// This program is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU General Public License
|
|
// as published by the Free Software Foundation; either
|
|
// version 2 of the License, or (at your option) any later version.
|
|
//
|
|
// Note that the GPL places important restrictions on "derived works", yet
|
|
// it does not provide a detailed definition of that term. To avoid
|
|
// misunderstandings, we consider an application to constitute a
|
|
// "derivative work" for the purpose of this license if it does any of the
|
|
// following:
|
|
// 1. Integrates source code from Notepad++.
|
|
// 2. Integrates/includes/aggregates Notepad++ into a proprietary executable
|
|
// installer, such as those produced by InstallShield.
|
|
// 3. Links to a library or executes a program that does any of the above.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program; if not, write to the Free Software
|
|
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
|
#ifndef _CRC16_H_
|
|
#define _CRC16_H_
|
|
#include <assert.h>
|
|
|
|
class CRC16_ISO_3309
|
|
{
|
|
public :
|
|
CRC16_ISO_3309(unsigned short polynom = 0x1021, unsigned short initVal = 0xFFFF)
|
|
:_polynom(polynom), _initVal(initVal) {};
|
|
~CRC16_ISO_3309(){};
|
|
|
|
void set(unsigned short polynom, unsigned short initVal) {
|
|
_polynom = polynom;
|
|
_initVal = initVal;
|
|
};
|
|
|
|
unsigned short calculate(unsigned char *data, unsigned short count)
|
|
{
|
|
unsigned short fcs = _initVal;
|
|
unsigned short d, i, k;
|
|
for (i=0; i<count; i++)
|
|
{
|
|
d = *data++ << 8;
|
|
for (k=0; k<8; k++)
|
|
{
|
|
if ((fcs ^ d) & 0x8000)
|
|
fcs = (fcs << 1) ^ _polynom;
|
|
else
|
|
fcs = (fcs << 1);
|
|
d <<= 1;
|
|
}
|
|
}
|
|
return(fcs);
|
|
}
|
|
|
|
private :
|
|
unsigned short _polynom;
|
|
unsigned short _initVal;
|
|
|
|
};
|
|
|
|
const bool bits8 = true;
|
|
const bool bits16 = false;
|
|
|
|
class CRC16 : public CRC16_ISO_3309
|
|
{
|
|
public:
|
|
CRC16(){};
|
|
~CRC16(){};
|
|
unsigned short calculate(const unsigned char *data, unsigned short count)
|
|
{
|
|
assert(data != NULL);
|
|
assert(count != 0);
|
|
|
|
//unsigned short wordResult;
|
|
unsigned char *pBuffer = new unsigned char[count];
|
|
|
|
// Reverse all bits of the byte then copy the result byte by byte in the array
|
|
for (int i = 0 ; i < count ; i++)
|
|
pBuffer[i] = reverseByte<unsigned char>(data[i]);
|
|
|
|
// calculate CRC : by default polynom = 0x1021, init val = 0xFFFF)
|
|
unsigned short wordResult = CRC16_ISO_3309::calculate(pBuffer, count);
|
|
|
|
// Reverse the WORD bits
|
|
wordResult = reverseByte<unsigned short>(wordResult);
|
|
|
|
// XOR FFFF
|
|
wordResult ^= 0xFFFF;
|
|
|
|
// Invert MSB/LSB
|
|
wordResult = wordResult << 8 | wordResult >> 8 ;
|
|
|
|
delete [] pBuffer;
|
|
|
|
return wordResult;
|
|
};
|
|
|
|
private:
|
|
template <class IntType>
|
|
IntType reverseByte(IntType val2Reverses)
|
|
{
|
|
IntType reversedValue = 0;
|
|
long mask = 1;
|
|
int nBits = sizeof(val2Reverses) * 8;
|
|
for (int i = 0 ; i < nBits ; i++)
|
|
if ((mask << i) & val2Reverses)
|
|
reversedValue += (mask << (nBits - 1 - i));
|
|
|
|
return reversedValue;
|
|
};
|
|
};
|
|
|
|
#endif |