/* Copyright (C) 2012 Connor Olding
 *
 * This program is licensed under the terms of the MIT License, and
 * is distributed without any warranty.  You should have received a
 * copy of the license along with this program; see the file LICENSE.
 */

typedef unsigned long ulong;
#include "crc32.h"

int crc_big_endian = 0;
ulong crc_polynomial = 0x04C11DB7;

enum {
	TABLE_SIZE = 0x100
};

ulong crc_reflect(ulong input)
{
	ulong reflected = 0;
	int i;
	for (i = 0; i < 4 * 8; i++) {
		reflected <<= 1;
		reflected |= input & 1;
		input >>= 1;
	}
	return reflected;
}

/* TODO: test returning array */
void crc_fill_table(ulong *table, int big, ulong polynomial)
{
	ulong lsb = (big) ? 1 << 31 : 1; /* least significant bit */
	ulong poly = (big) ? polynomial : crc_reflect(polynomial);
	int c, i;

	for (c = 0; c < TABLE_SIZE; c++, table++) {
		*table = (big) ? c << 24 : c;
		for (i = 0; i < 8; i++) {
			if (*table & lsb) {
				*table = (big) ? *table << 1 : *table >> 1;
				*table ^= poly;
			} else {
				*table = (big) ? *table << 1 : *table >> 1;
			}
			*table &= 0xFFFFFFFF;
		}
	}
}

void crc_be_cycle(ulong *table, ulong *remainder, char c)
{
	ulong byte = table[((*remainder) >> 24) ^ c];
	*remainder = (((*remainder) << 8) ^ byte) & 0xFFFFFFFF;
}

void crc_le_cycle(ulong *table, ulong *remainder, char c)
{
	ulong byte = table[((*remainder) ^ c) & 0xFF];
	*remainder = ((*remainder) >> 8) ^ byte;
}