blob: 1e4a57e8a27ef6d6f75ce5498102c42331930a53 [file] [log] [blame]
Rob Landleyc57ec372006-04-10 17:07:15 +00001/* vi: set sw=4 ts=4: */
2/*
3 * CRC32 table fill function
4 * Copyright (C) 2006 by Rob Sullivan <cogito.ergo.cogito@gmail.com>
5 * (I can't really claim much credit however, as the algorithm is
6 * very well-known)
7 *
8 * The following function creates a CRC32 table depending on whether
Denis Vlasenko9213a9e2006-09-17 16:28:10 +00009 * a big-endian (0x04c11db7) or little-endian (0xedb88320) CRC32 is
Rob Landleyc57ec372006-04-10 17:07:15 +000010 * required. Admittedly, there are other CRC32 polynomials floating
11 * around, but Busybox doesn't use them.
12 *
13 * endian = 1: big-endian
14 * endian = 0: little-endian
15 */
16
Rob Landleyc57ec372006-04-10 17:07:15 +000017#include "libbb.h"
18
Rob Landleyd921b2e2006-08-03 15:41:12 +000019uint32_t *crc32_filltable(int endian)
20{
Denis Vlasenko9213a9e2006-09-17 16:28:10 +000021
Rob Landleyc57ec372006-04-10 17:07:15 +000022 uint32_t *crc_table = xmalloc(256 * sizeof(uint32_t));
23 uint32_t polynomial = endian ? 0x04c11db7 : 0xedb88320;
24 uint32_t c;
25 int i, j;
Denis Vlasenko9213a9e2006-09-17 16:28:10 +000026
Rob Landleyc57ec372006-04-10 17:07:15 +000027 for (i = 0; i < 256; i++) {
28 c = endian ? (i << 24) : i;
29 for (j = 8; j; j--) {
30 if (endian)
31 c = (c&0x80000000) ? ((c << 1) ^ polynomial) : (c << 1);
32 else
33 c = (c&1) ? ((c >> 1) ^ polynomial) : (c >> 1);
34 }
35 *crc_table++ = c;
36 }
37
38 return crc_table - 256;
39}