blob: 520b1ffb90680a7a5ca00e58210032efd77dc293 [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
Denis Vlasenkodb12d1d2008-12-07 00:52:58 +000015 *
Denys Vlasenko0ef64bd2010-08-16 20:14:46 +020016 * Licensed under GPLv2, see file LICENSE in this source tree.
Rob Landleyc57ec372006-04-10 17:07:15 +000017 */
18
Rob Landleyc57ec372006-04-10 17:07:15 +000019#include "libbb.h"
20
Denis Vlasenkodefc1ea2008-06-27 02:52:20 +000021uint32_t* FAST_FUNC crc32_filltable(uint32_t *crc_table, int endian)
Rob Landleyd921b2e2006-08-03 15:41:12 +000022{
Rob Landleyc57ec372006-04-10 17:07:15 +000023 uint32_t polynomial = endian ? 0x04c11db7 : 0xedb88320;
24 uint32_t c;
25 int i, j;
Denis Vlasenko9213a9e2006-09-17 16:28:10 +000026
Denis Vlasenkoc6758a02007-04-10 21:40:19 +000027 if (!crc_table)
28 crc_table = xmalloc(256 * sizeof(uint32_t));
29
Rob Landleyc57ec372006-04-10 17:07:15 +000030 for (i = 0; i < 256; i++) {
31 c = endian ? (i << 24) : i;
32 for (j = 8; j; j--) {
33 if (endian)
34 c = (c&0x80000000) ? ((c << 1) ^ polynomial) : (c << 1);
35 else
36 c = (c&1) ? ((c >> 1) ^ polynomial) : (c >> 1);
37 }
38 *crc_table++ = c;
39 }
40
41 return crc_table - 256;
42}