File: crc_slow.h

package info (click to toggle)
scummvm 2.9.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 450,580 kB
  • sloc: cpp: 4,299,825; asm: 28,322; python: 12,901; sh: 11,302; java: 9,289; xml: 7,895; perl: 2,639; ansic: 2,465; yacc: 1,670; javascript: 1,020; makefile: 933; lex: 578; awk: 275; objc: 82; sed: 11; php: 1
file content (173 lines) | stat: -rw-r--r-- 4,624 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
/* ScummVM - Graphic Adventure Engine
 *
 * ScummVM is the legal property of its developers, whose names
 * are too numerous to list here. Please refer to the COPYRIGHT
 * file distributed with this source distribution.
 *
 * 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 3 of the License, or
 * (at your option) any later version.
 *
 * 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, see <http://www.gnu.org/licenses/>.
 *
 */

/**********************************************************************
 *
 * Filename:    crc.c
 *
 * Description: Slow implementation of the CRC standards.
 *
 * Notes:
 *
 *
 * Copyright (c) 2000 by Michael Barr.  This software is placed into
 * the public domain and may be used for any purpose.  However, this
 * notice must not be changed or removed and no warranty is either
 * expressed or implied by its publication or distribution.
 **********************************************************************/

#ifndef COMMON_CRC_SLOW_H
#define COMMON_CRC_SLOW_H

#include "common/system.h" // For types.

namespace Common {

template <typename T>
class CRCSlow {
public:
	CRCSlow(T poly, T init_remainder, T final_xor, bool need_reflect);
	T crcSlow(byte const message[], int nBytes) const;

protected:
	const T _poly;
	const T _init_remainder;
	const T _final_xor;

	const int _width;
	const int _topbit;

	const bool _reflect;

	template<typename R>
	static R reflect(R data);

	byte reflectData(byte x) const { return _reflect ? reflect<byte>(x) : x; }
	T reflectRemainder(T x) const { return _reflect ? reflect<T>(x) : x; }
};

/*********************************************************************
 *
 * Function:    reflect()
 *
 * Description: Reorder the bits of a binary sequence, by reflecting
 *              them about the middle position.
 *
 * Notes:       No checking is done that nBits <= 32.
 *
 * Returns:     The reflection of the original data.
 *
 *********************************************************************/
template<typename T> template<typename R>
R CRCSlow<T>::reflect(R data) {
	R reflection = 0;

	/*
	 * Reflect the data about the center bit.
	 */
	for (byte bit = 0; bit < sizeof(R) * 8; ++bit) {
		/*
		 * If the LSB bit is set, set the reflection of it.
		 */
		if (data & 0x01) {
			reflection |= (1 << ((sizeof(R) * 8 - 1) - bit));
		}

		data = (data >> 1);
	}

	return reflection;
}


/*********************************************************************
 *
 * Function:    crcSlow()
 *
 * Description: Compute the CRC of a given message.
 *
 * Notes:
 *
 * Returns:     The CRC of the message.
 *
 *********************************************************************/
template<typename T>
T CRCSlow<T>::crcSlow(byte const message[], int nBytes) const {
	T remainder = _init_remainder;

	/*
	 * Perform modulo-2 division, a byte at a time.
	 */
	for (int b = 0; b < nBytes; ++b) {
		/*
		 * Bring the next byte into the remainder.
		 */
		remainder ^= reflectData(message[b]) << (_width - 8);

		/*
		 * Perform modulo-2 division, a bit at a time.
		 */
		for (byte bit = 8; bit > 0; --bit) {
			/*
			 * Try to divide the current data bit.
			 */
			if (remainder & _topbit) {
				remainder = (remainder << 1) ^ _poly;
			} else {
				remainder = (remainder << 1);
			}
		}
	}

	/*
	 * The final remainder is the CRC result.
	 */
	return reflectRemainder(remainder) ^ _final_xor;
}


template<typename T>
CRCSlow<T>::CRCSlow(T poly, T init_remainder, T final_xor, bool need_reflect) :
	_poly(poly), _init_remainder(init_remainder), _final_xor(final_xor), _width(8 * sizeof(T)), _topbit(1 << (8 * sizeof(T) - 1)), _reflect(need_reflect) {}

class CRC_CCITT_Slow : public CRCSlow<uint16> {
public:
	CRC_CCITT_Slow() : CRCSlow<uint16>(0x1021, 0xFFFF, 0x0000, false) {}
};

class CRC_BINHEX_Slow : public CRCSlow<uint16> {
public:
	CRC_BINHEX_Slow() : CRCSlow<uint16>(0x1021, 0x0000, 0x0000, false) {}
};

class CRC16_Slow : public CRCSlow<uint16> {
public:
	CRC16_Slow() : CRCSlow<uint16>(0x8005, 0x0000, 0x0000, true) {}
};

class CRC32_Slow : public CRCSlow<uint32> {
public:
	CRC32_Slow() : CRCSlow<uint32>(0x04C11DB7, 0xFFFFFFFF, 0xFFFFFFFF, true) {}
};

} // End of namespace Common

#endif