sl@0: /* Portions Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
sl@0:  * All rights reserved.
sl@0:  */
sl@0: 
sl@0: /* crc32.cpp -- compute the CRC-32 of a data stream
sl@0:  * Copyright (C) 1995-2005 Mark Adler
sl@0:  * For conditions of distribution and use, see copyright notice in zlib.h
sl@0:  *
sl@0:  * Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster
sl@0:  * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
sl@0:  * tables for updating the shift register in one step with three exclusive-ors
sl@0:  * instead of four steps with four exclusive-ors.  This results in about a
sl@0:  * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.
sl@0:  */
sl@0: 
sl@0: /* @(#) $Id$ */
sl@0: 
sl@0: /*
sl@0:   Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore
sl@0:   protection on the static variables used to control the first-use generation
sl@0:   of the crc tables.  Therefore, if you #define DYNAMIC_CRC_TABLE, you should
sl@0:   first call get_crc_table() to initialize the tables before allowing more than
sl@0:   one thread to use crc32().
sl@0:  */
sl@0: 
sl@0: #ifdef MAKECRCH
sl@0: #  include <stdio.h>
sl@0: #  ifndef DYNAMIC_CRC_TABLE
sl@0: #    define DYNAMIC_CRC_TABLE
sl@0: #  endif /* !DYNAMIC_CRC_TABLE */
sl@0: #endif /* MAKECRCH */
sl@0: 
sl@0: /* These defines are usually taken from limits.h, however this file is not supported in Symbian. */
sl@0: #if (defined(__SYMBIAN32__) && !defined(__TOOLS2__) && !defined(__TOOLS__))  
sl@0:   #define UINT_MAX  0xffffffffU  /* Values taken from _limits.h:from PIPS  */
sl@0:   #define ULONG_MAX 0xffffffffUL /* Removing may slow down the crc operation */
sl@0:   typedef int ptrdiff_t;
sl@0: #endif /* __SYMBIAN32__ && !__TOOLS2__) && !__TOOLS__ */
sl@0: 
sl@0: #include "zutil.h"      /* for STDC and FAR definitions */
sl@0: 
sl@0: 
sl@0: /* Find a four-byte integer type for crc32_little() and crc32_big(). */
sl@0: #ifndef NOBYFOUR
sl@0: #  ifdef STDC           /* need ANSI C limits.h to determine sizes */
sl@0: #  	 if (!defined(__SYMBIAN32__) || defined(__TOOLS2__) || defined(__TOOLS__)) /* only include for Tools builds */
sl@0: #      include <limits.h>
sl@0: #    endif /* !__SYMBIAN32__ || __TOOLS2__) || __TOOLS__ */
sl@0: #    define BYFOUR
sl@0: #    if (UINT_MAX == 0xffffffffUL)
sl@0: 	   typedef unsigned int u4;
sl@0: #    else
sl@0: #      if (ULONG_MAX == 0xffffffffUL)
sl@0:          typedef unsigned long u4;
sl@0: #      else
sl@0: #        if (USHRT_MAX == 0xffffffffUL)
sl@0:            typedef unsigned short u4;
sl@0: #        else
sl@0: #          undef BYFOUR     /* can't find a four-byte integer type! */
sl@0: #        endif
sl@0: #      endif
sl@0: #    endif
sl@0: #  endif /* STDC */
sl@0: #endif /* !NOBYFOUR */
sl@0: 
sl@0: /* Definitions for doing the crc four data bytes at a time. */
sl@0: #ifdef BYFOUR
sl@0: #  define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \
sl@0:                 (((w)&0xff00)<<8)+(((w)&0xff)<<24))
sl@0:    local unsigned long crc32_little OF((unsigned long,
sl@0:                         const unsigned char FAR *, unsigned));
sl@0:    local unsigned long crc32_big OF((unsigned long,
sl@0:                         const unsigned char FAR *, unsigned));
sl@0: #  define TBLS 8
sl@0: #else
sl@0: #  define TBLS 1
sl@0: #endif /* BYFOUR */
sl@0: 
sl@0: /* Local functions for crc concatenation */
sl@0: local unsigned long gf2_matrix_times OF((unsigned long *mat,
sl@0:                                          unsigned long vec));
sl@0: local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));
sl@0: 
sl@0: #ifdef DYNAMIC_CRC_TABLE
sl@0: 
sl@0: local volatile int crc_table_empty = 1;
sl@0: local unsigned long FAR crc_table[TBLS][256];
sl@0: local void make_crc_table OF((void));
sl@0: #ifdef MAKECRCH
sl@0:    local void write_table OF((FILE *, const unsigned long FAR *));
sl@0: #endif /* MAKECRCH */
sl@0: /*
sl@0:   Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
sl@0:   x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.
sl@0: 
sl@0:   Polynomials over GF(2) are represented in binary, one bit per coefficient,
sl@0:   with the lowest powers in the most significant bit.  Then adding polynomials
sl@0:   is just exclusive-or, and multiplying a polynomial by x is a right shift by
sl@0:   one.  If we call the above polynomial p, and represent a byte as the
sl@0:   polynomial q, also with the lowest power in the most significant bit (so the
sl@0:   byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
sl@0:   where a mod b means the remainder after dividing a by b.
sl@0: 
sl@0:   This calculation is done using the shift-register method of multiplying and
sl@0:   taking the remainder.  The register is initialized to zero, and for each
sl@0:   incoming bit, x^32 is added mod p to the register if the bit is a one (where
sl@0:   x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by
sl@0:   x (which is shifting right by one and adding x^32 mod p if the bit shifted
sl@0:   out is a one).  We start with the highest power (least significant bit) of
sl@0:   q and repeat for all eight bits of q.
sl@0: 
sl@0:   The first table is simply the CRC of all possible eight bit values.  This is
sl@0:   all the information needed to generate CRCs on data a byte at a time for all
sl@0:   combinations of CRC register values and incoming bytes.  The remaining tables
sl@0:   allow for word-at-a-time CRC calculation for both big-endian and little-
sl@0:   endian machines, where a word is four bytes.
sl@0: */
sl@0: local void make_crc_table()
sl@0: {
sl@0:     unsigned long c;
sl@0:     int n, k;
sl@0:     unsigned long poly;                 /* polynomial exclusive-or pattern */
sl@0:     /* terms of polynomial defining this crc (except x^32): */
sl@0:     static volatile int first = 1;      /* flag to limit concurrent making */
sl@0:     static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
sl@0: 
sl@0:     /* See if another task is already doing this (not thread-safe, but better
sl@0:        than nothing -- significantly reduces duration of vulnerability in
sl@0:        case the advice about DYNAMIC_CRC_TABLE is ignored) */
sl@0:     if (first) {
sl@0:         first = 0;
sl@0: 
sl@0:         /* make exclusive-or pattern from polynomial (0xedb88320UL) */
sl@0:         poly = 0UL;
sl@0:         for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)
sl@0:             poly |= 1UL << (31 - p[n]);
sl@0: 
sl@0:         /* generate a crc for every 8-bit value */
sl@0:         for (n = 0; n < 256; n++) {
sl@0:             c = (unsigned long)n;
sl@0:             for (k = 0; k < 8; k++)
sl@0:                 c = c & 1 ? poly ^ (c >> 1) : c >> 1;
sl@0:             crc_table[0][n] = c;
sl@0:         }
sl@0: 
sl@0: #ifdef BYFOUR
sl@0:         /* generate crc for each value followed by one, two, and three zeros,
sl@0:            and then the byte reversal of those as well as the first table */
sl@0:         for (n = 0; n < 256; n++) {
sl@0:             c = crc_table[0][n];
sl@0:             crc_table[4][n] = REV(c);
sl@0:             for (k = 1; k < 4; k++) {
sl@0:                 c = crc_table[0][c & 0xff] ^ (c >> 8);
sl@0:                 crc_table[k][n] = c;
sl@0:                 crc_table[k + 4][n] = REV(c);
sl@0:             }
sl@0:         }
sl@0: #endif /* BYFOUR */
sl@0: 
sl@0:         crc_table_empty = 0;
sl@0:     }
sl@0:     else {      /* not first */
sl@0:         /* wait for the other guy to finish (not efficient, but rare) */
sl@0:         while (crc_table_empty)
sl@0:             ;
sl@0:     }
sl@0: 
sl@0: #ifdef MAKECRCH
sl@0:     /* write out CRC tables to crc32.h */
sl@0:     {
sl@0:         FILE *out;
sl@0: 
sl@0:         out = fopen("crc32.h", "w");
sl@0:         if (out == NULL) return;
sl@0:         fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");
sl@0:         fprintf(out, " * Generated automatically by crc32.c\n */\n\n");
sl@0:         fprintf(out, "local const unsigned long FAR ");
sl@0:         fprintf(out, "crc_table[TBLS][256] =\n{\n  {\n");
sl@0:         write_table(out, crc_table[0]);
sl@0: #  ifdef BYFOUR
sl@0:         fprintf(out, "#ifdef BYFOUR\n");
sl@0:         for (k = 1; k < 8; k++) {
sl@0:             fprintf(out, "  },\n  {\n");
sl@0:             write_table(out, crc_table[k]);
sl@0:         }
sl@0:         fprintf(out, "#endif\n");
sl@0: #  endif /* BYFOUR */
sl@0:         fprintf(out, "  }\n};\n");
sl@0:         fclose(out);
sl@0:     }
sl@0: #endif /* MAKECRCH */
sl@0: }
sl@0: 
sl@0: #ifdef MAKECRCH
sl@0: #ifdef __SYMBIAN32__
sl@0: local void write_table(FILE * out, const unsigned long FAR * table)
sl@0: #else	
sl@0: local void write_table(out, table)
sl@0:     FILE *out;
sl@0:     const unsigned long FAR *table;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0:     int n;
sl@0: 
sl@0:     for (n = 0; n < 256; n++)
sl@0:         fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : "    ", table[n],
sl@0:                 n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));
sl@0: }
sl@0: #endif /* MAKECRCH */
sl@0: 
sl@0: #else /* !DYNAMIC_CRC_TABLE */
sl@0: /* ========================================================================
sl@0:  * Tables of CRC-32s of all single-byte values, made by make_crc_table().
sl@0:  */
sl@0: #include "crc32.h"
sl@0: #endif /* DYNAMIC_CRC_TABLE */
sl@0: 
sl@0: /* =========================================================================
sl@0:  * This function can be used by asm versions of crc32()
sl@0:  */
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C  const unsigned long FAR *   get_crc_table_r()
sl@0: #else
sl@0: const unsigned long FAR * ZEXPORT get_crc_table()
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0: #ifdef DYNAMIC_CRC_TABLE
sl@0:     if (crc_table_empty)
sl@0:         make_crc_table();
sl@0: #endif /* DYNAMIC_CRC_TABLE */
sl@0:     return (const unsigned long FAR *)crc_table;
sl@0: }
sl@0: 
sl@0: /* ========================================================================= */
sl@0: #define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)
sl@0: #define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1
sl@0: 
sl@0: /* ========================================================================= */
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C unsigned long  crc32_r( unsigned long crc,  const unsigned char FAR *  buf,unsigned len)
sl@0: #else
sl@0: unsigned long ZEXPORT crc32(crc, buf, len)
sl@0:     unsigned long crc;
sl@0:     const unsigned char FAR *buf;
sl@0:     unsigned len;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0:     if (buf == Z_NULL) return 0UL;
sl@0: 
sl@0: #ifdef DYNAMIC_CRC_TABLE
sl@0:     if (crc_table_empty)
sl@0:         make_crc_table();
sl@0: #endif /* DYNAMIC_CRC_TABLE */
sl@0: 
sl@0: #ifdef BYFOUR
sl@0:     if (sizeof(void *) == sizeof(ptrdiff_t)) {
sl@0:         u4 endian;
sl@0: 
sl@0:         endian = 1;
sl@0:         if (*((unsigned char *)(&endian)))
sl@0:             return crc32_little(crc, buf, len);
sl@0:         else
sl@0:             return crc32_big(crc, buf, len);
sl@0:     }
sl@0:     else 
sl@0:     {    	
sl@0: #endif /* BYFOUR */
sl@0:     crc = crc ^ 0xffffffffUL;
sl@0:     while (len >= 8) {
sl@0:         DO8;
sl@0:         len -= 8;
sl@0:     }
sl@0:     if (len) do {
sl@0:         DO1;
sl@0:     } while (--len);
sl@0:     return crc ^ 0xffffffffUL;
sl@0:  #ifdef BYFOUR
sl@0:     }
sl@0:  #endif    
sl@0: }
sl@0: 
sl@0: 
sl@0: #ifdef BYFOUR
sl@0: 
sl@0: /* ========================================================================= */
sl@0: #define DOLIT4 c ^= *buf4++; \
sl@0:         c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \
sl@0:             crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]
sl@0: #define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4
sl@0: 
sl@0: /* ========================================================================= */
sl@0: #ifdef __SYMBIAN32__
sl@0: local unsigned long crc32_little(   unsigned long  crc,const unsigned char FAR *  buf,unsigned len)
sl@0: #else
sl@0: local unsigned long crc32_little(crc, buf, len)
sl@0:     unsigned long crc;
sl@0:     const unsigned char FAR *buf;
sl@0:     unsigned len;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0:     register u4 c;
sl@0:     register const u4 FAR *buf4;
sl@0: 
sl@0:     c = (u4)crc;
sl@0:     c = ~c;
sl@0:     while (len && ((ptrdiff_t)buf & 3)) {
sl@0:         c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
sl@0:         len--;
sl@0:     }
sl@0: 
sl@0:     buf4 = (const u4 FAR *)(const void FAR *)buf;
sl@0:     while (len >= 32) {
sl@0:         DOLIT32;
sl@0:         len -= 32;
sl@0:     }
sl@0:     while (len >= 4) {
sl@0:         DOLIT4;
sl@0:         len -= 4;
sl@0:     }
sl@0:     buf = (const unsigned char FAR *)buf4;
sl@0: 
sl@0:     if (len) do {
sl@0:         c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
sl@0:     } while (--len);
sl@0:     c = ~c;
sl@0:     return (unsigned long)c;
sl@0: }
sl@0: 
sl@0: /* ========================================================================= */
sl@0: #define DOBIG4 c ^= *++buf4; \
sl@0:         c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \
sl@0:             crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]
sl@0: #define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4
sl@0: 
sl@0: /* ========================================================================= */
sl@0: #ifdef __SYMBIAN32__
sl@0: local unsigned long crc32_big(    unsigned long crc,    const unsigned char FAR *  buf,unsigned  len)
sl@0: #else
sl@0: local unsigned long crc32_big(crc, buf, len)
sl@0:     unsigned long crc;
sl@0:     const unsigned char FAR *buf;
sl@0:     unsigned len;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0:     register u4 c;
sl@0:     register const u4 FAR *buf4;
sl@0: 
sl@0:     c = REV((u4)crc);
sl@0:     c = ~c;
sl@0:     while (len && ((ptrdiff_t)buf & 3)) {
sl@0:         c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
sl@0:         len--;
sl@0:     }
sl@0: 
sl@0:     buf4 = (const u4 FAR *)(const void FAR *)buf;
sl@0:     buf4--;
sl@0:     while (len >= 32) {
sl@0:         DOBIG32;
sl@0:         len -= 32;
sl@0:     }
sl@0:     while (len >= 4) {
sl@0:         DOBIG4;
sl@0:         len -= 4;
sl@0:     }
sl@0:     buf4++;
sl@0:     buf = (const unsigned char FAR *)buf4;
sl@0: 
sl@0:     if (len) do {
sl@0:         c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
sl@0:     } while (--len);
sl@0:     c = ~c;
sl@0:     return (unsigned long)(REV(c));
sl@0: }
sl@0: 
sl@0: #endif /* BYFOUR */
sl@0: 
sl@0: #define GF2_DIM 32      /* dimension of GF(2) vectors (length of CRC) */
sl@0: 
sl@0: /* ========================================================================= */
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: local unsigned long gf2_matrix_times( unsigned long * mat,  unsigned long vec)
sl@0: #else
sl@0: local unsigned long gf2_matrix_times(mat, vec)
sl@0:     unsigned long *mat;
sl@0:     unsigned long vec;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0:     unsigned long sum;
sl@0: 
sl@0:     sum = 0;
sl@0:     while (vec) {
sl@0:         if (vec & 1)
sl@0:             sum ^= *mat;
sl@0:         vec >>= 1;
sl@0:         mat++;
sl@0:     }
sl@0:     return sum;
sl@0: }
sl@0: 
sl@0: /* ========================================================================= */
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: local void gf2_matrix_square(    unsigned long * square,unsigned long * mat)
sl@0: #else
sl@0: local void gf2_matrix_square(square, mat)
sl@0:     unsigned long *square;
sl@0:     unsigned long *mat;
sl@0: #endif //__SYMBIAN32__	
sl@0: {
sl@0:     int n;
sl@0: 
sl@0:     for (n = 0; n < GF2_DIM; n++)
sl@0:         square[n] = gf2_matrix_times(mat, mat[n]);
sl@0: }
sl@0: 
sl@0: /* ========================================================================= */
sl@0: 
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C uLong crc32_combine_r(uLong crc1,uLong  crc2,z_off_t len2)
sl@0: #else
sl@0: uLong ZEXPORT crc32_combine(crc1, crc2, len2)
sl@0:     uLong crc1;
sl@0:     uLong crc2;
sl@0:     z_off_t len2;
sl@0: #endif //__SYMBIAN32__	
sl@0: {
sl@0:     int n;
sl@0:     unsigned long row;
sl@0:     unsigned long even[GF2_DIM];    /* even-power-of-two zeros operator */
sl@0:     unsigned long odd[GF2_DIM];     /* odd-power-of-two zeros operator */
sl@0: 
sl@0:     /* degenerate case */
sl@0:     if (len2 == 0)
sl@0:         return crc1;
sl@0: 
sl@0:     /* put operator for one zero bit in odd */
sl@0:     odd[0] = 0xedb88320L;           /* CRC-32 polynomial */
sl@0:     row = 1;
sl@0:     for (n = 1; n < GF2_DIM; n++) {
sl@0:         odd[n] = row;
sl@0:         row <<= 1;
sl@0:     }
sl@0: 
sl@0:     /* put operator for two zero bits in even */
sl@0:     gf2_matrix_square(even, odd);
sl@0: 
sl@0:     /* put operator for four zero bits in odd */
sl@0:     gf2_matrix_square(odd, even);
sl@0: 
sl@0:     /* apply len2 zeros to crc1 (first square will put the operator for one
sl@0:        zero byte, eight zero bits, in even) */
sl@0:     do {
sl@0:         /* apply zeros operator for this bit of len2 */
sl@0:         gf2_matrix_square(even, odd);
sl@0:         if (len2 & 1)
sl@0:             crc1 = gf2_matrix_times(even, crc1);
sl@0:         len2 >>= 1;
sl@0: 
sl@0:         /* if no more bits set, then done */
sl@0:         if (len2 == 0)
sl@0:             break;
sl@0: 
sl@0:         /* another iteration of the loop with odd and even swapped */
sl@0:         gf2_matrix_square(odd, even);
sl@0:         if (len2 & 1)
sl@0:             crc1 = gf2_matrix_times(odd, crc1);
sl@0:         len2 >>= 1;
sl@0: 
sl@0:         /* if no more bits set, then done */
sl@0:     } while (len2 != 0);
sl@0: 
sl@0:     /* return combined crc */
sl@0:     crc1 ^= crc2;
sl@0:     return crc1;
sl@0: }
sl@0: 
sl@0: