annotate src/libmad-0.15.1b/bit.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 545efbb81310
children
rev   line source
cannam@85 1 /*
cannam@85 2 * libmad - MPEG audio decoder library
cannam@85 3 * Copyright (C) 2000-2004 Underbit Technologies, Inc.
cannam@85 4 *
cannam@85 5 * This program is free software; you can redistribute it and/or modify
cannam@85 6 * it under the terms of the GNU General Public License as published by
cannam@85 7 * the Free Software Foundation; either version 2 of the License, or
cannam@85 8 * (at your option) any later version.
cannam@85 9 *
cannam@85 10 * This program is distributed in the hope that it will be useful,
cannam@85 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@85 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@85 13 * GNU General Public License for more details.
cannam@85 14 *
cannam@85 15 * You should have received a copy of the GNU General Public License
cannam@85 16 * along with this program; if not, write to the Free Software
cannam@85 17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
cannam@85 18 *
cannam@85 19 * $Id: bit.c,v 1.12 2004/01/23 09:41:32 rob Exp $
cannam@85 20 */
cannam@85 21
cannam@85 22 # ifdef HAVE_CONFIG_H
cannam@85 23 # include "config.h"
cannam@85 24 # endif
cannam@85 25
cannam@85 26 # include "global.h"
cannam@85 27
cannam@85 28 # ifdef HAVE_LIMITS_H
cannam@85 29 # include <limits.h>
cannam@85 30 # else
cannam@85 31 # define CHAR_BIT 8
cannam@85 32 # endif
cannam@85 33
cannam@85 34 # include "bit.h"
cannam@85 35
cannam@85 36 /*
cannam@85 37 * This is the lookup table for computing the CRC-check word.
cannam@85 38 * As described in section 2.4.3.1 and depicted in Figure A.9
cannam@85 39 * of ISO/IEC 11172-3, the generator polynomial is:
cannam@85 40 *
cannam@85 41 * G(X) = X^16 + X^15 + X^2 + 1
cannam@85 42 */
cannam@85 43 static
cannam@85 44 unsigned short const crc_table[256] = {
cannam@85 45 0x0000, 0x8005, 0x800f, 0x000a, 0x801b, 0x001e, 0x0014, 0x8011,
cannam@85 46 0x8033, 0x0036, 0x003c, 0x8039, 0x0028, 0x802d, 0x8027, 0x0022,
cannam@85 47 0x8063, 0x0066, 0x006c, 0x8069, 0x0078, 0x807d, 0x8077, 0x0072,
cannam@85 48 0x0050, 0x8055, 0x805f, 0x005a, 0x804b, 0x004e, 0x0044, 0x8041,
cannam@85 49 0x80c3, 0x00c6, 0x00cc, 0x80c9, 0x00d8, 0x80dd, 0x80d7, 0x00d2,
cannam@85 50 0x00f0, 0x80f5, 0x80ff, 0x00fa, 0x80eb, 0x00ee, 0x00e4, 0x80e1,
cannam@85 51 0x00a0, 0x80a5, 0x80af, 0x00aa, 0x80bb, 0x00be, 0x00b4, 0x80b1,
cannam@85 52 0x8093, 0x0096, 0x009c, 0x8099, 0x0088, 0x808d, 0x8087, 0x0082,
cannam@85 53
cannam@85 54 0x8183, 0x0186, 0x018c, 0x8189, 0x0198, 0x819d, 0x8197, 0x0192,
cannam@85 55 0x01b0, 0x81b5, 0x81bf, 0x01ba, 0x81ab, 0x01ae, 0x01a4, 0x81a1,
cannam@85 56 0x01e0, 0x81e5, 0x81ef, 0x01ea, 0x81fb, 0x01fe, 0x01f4, 0x81f1,
cannam@85 57 0x81d3, 0x01d6, 0x01dc, 0x81d9, 0x01c8, 0x81cd, 0x81c7, 0x01c2,
cannam@85 58 0x0140, 0x8145, 0x814f, 0x014a, 0x815b, 0x015e, 0x0154, 0x8151,
cannam@85 59 0x8173, 0x0176, 0x017c, 0x8179, 0x0168, 0x816d, 0x8167, 0x0162,
cannam@85 60 0x8123, 0x0126, 0x012c, 0x8129, 0x0138, 0x813d, 0x8137, 0x0132,
cannam@85 61 0x0110, 0x8115, 0x811f, 0x011a, 0x810b, 0x010e, 0x0104, 0x8101,
cannam@85 62
cannam@85 63 0x8303, 0x0306, 0x030c, 0x8309, 0x0318, 0x831d, 0x8317, 0x0312,
cannam@85 64 0x0330, 0x8335, 0x833f, 0x033a, 0x832b, 0x032e, 0x0324, 0x8321,
cannam@85 65 0x0360, 0x8365, 0x836f, 0x036a, 0x837b, 0x037e, 0x0374, 0x8371,
cannam@85 66 0x8353, 0x0356, 0x035c, 0x8359, 0x0348, 0x834d, 0x8347, 0x0342,
cannam@85 67 0x03c0, 0x83c5, 0x83cf, 0x03ca, 0x83db, 0x03de, 0x03d4, 0x83d1,
cannam@85 68 0x83f3, 0x03f6, 0x03fc, 0x83f9, 0x03e8, 0x83ed, 0x83e7, 0x03e2,
cannam@85 69 0x83a3, 0x03a6, 0x03ac, 0x83a9, 0x03b8, 0x83bd, 0x83b7, 0x03b2,
cannam@85 70 0x0390, 0x8395, 0x839f, 0x039a, 0x838b, 0x038e, 0x0384, 0x8381,
cannam@85 71
cannam@85 72 0x0280, 0x8285, 0x828f, 0x028a, 0x829b, 0x029e, 0x0294, 0x8291,
cannam@85 73 0x82b3, 0x02b6, 0x02bc, 0x82b9, 0x02a8, 0x82ad, 0x82a7, 0x02a2,
cannam@85 74 0x82e3, 0x02e6, 0x02ec, 0x82e9, 0x02f8, 0x82fd, 0x82f7, 0x02f2,
cannam@85 75 0x02d0, 0x82d5, 0x82df, 0x02da, 0x82cb, 0x02ce, 0x02c4, 0x82c1,
cannam@85 76 0x8243, 0x0246, 0x024c, 0x8249, 0x0258, 0x825d, 0x8257, 0x0252,
cannam@85 77 0x0270, 0x8275, 0x827f, 0x027a, 0x826b, 0x026e, 0x0264, 0x8261,
cannam@85 78 0x0220, 0x8225, 0x822f, 0x022a, 0x823b, 0x023e, 0x0234, 0x8231,
cannam@85 79 0x8213, 0x0216, 0x021c, 0x8219, 0x0208, 0x820d, 0x8207, 0x0202
cannam@85 80 };
cannam@85 81
cannam@85 82 # define CRC_POLY 0x8005
cannam@85 83
cannam@85 84 /*
cannam@85 85 * NAME: bit->init()
cannam@85 86 * DESCRIPTION: initialize bit pointer struct
cannam@85 87 */
cannam@85 88 void mad_bit_init(struct mad_bitptr *bitptr, unsigned char const *byte)
cannam@85 89 {
cannam@85 90 bitptr->byte = byte;
cannam@85 91 bitptr->cache = 0;
cannam@85 92 bitptr->left = CHAR_BIT;
cannam@85 93 }
cannam@85 94
cannam@85 95 /*
cannam@85 96 * NAME: bit->length()
cannam@85 97 * DESCRIPTION: return number of bits between start and end points
cannam@85 98 */
cannam@85 99 unsigned int mad_bit_length(struct mad_bitptr const *begin,
cannam@85 100 struct mad_bitptr const *end)
cannam@85 101 {
cannam@85 102 return begin->left +
cannam@85 103 CHAR_BIT * (end->byte - (begin->byte + 1)) + (CHAR_BIT - end->left);
cannam@85 104 }
cannam@85 105
cannam@85 106 /*
cannam@85 107 * NAME: bit->nextbyte()
cannam@85 108 * DESCRIPTION: return pointer to next unprocessed byte
cannam@85 109 */
cannam@85 110 unsigned char const *mad_bit_nextbyte(struct mad_bitptr const *bitptr)
cannam@85 111 {
cannam@85 112 return bitptr->left == CHAR_BIT ? bitptr->byte : bitptr->byte + 1;
cannam@85 113 }
cannam@85 114
cannam@85 115 /*
cannam@85 116 * NAME: bit->skip()
cannam@85 117 * DESCRIPTION: advance bit pointer
cannam@85 118 */
cannam@85 119 void mad_bit_skip(struct mad_bitptr *bitptr, unsigned int len)
cannam@85 120 {
cannam@85 121 bitptr->byte += len / CHAR_BIT;
cannam@85 122 bitptr->left -= len % CHAR_BIT;
cannam@85 123
cannam@85 124 if (bitptr->left > CHAR_BIT) {
cannam@85 125 bitptr->byte++;
cannam@85 126 bitptr->left += CHAR_BIT;
cannam@85 127 }
cannam@85 128
cannam@85 129 if (bitptr->left < CHAR_BIT)
cannam@85 130 bitptr->cache = *bitptr->byte;
cannam@85 131 }
cannam@85 132
cannam@85 133 /*
cannam@85 134 * NAME: bit->read()
cannam@85 135 * DESCRIPTION: read an arbitrary number of bits and return their UIMSBF value
cannam@85 136 */
cannam@85 137 unsigned long mad_bit_read(struct mad_bitptr *bitptr, unsigned int len)
cannam@85 138 {
cannam@85 139 register unsigned long value;
cannam@85 140
cannam@85 141 if (bitptr->left == CHAR_BIT)
cannam@85 142 bitptr->cache = *bitptr->byte;
cannam@85 143
cannam@85 144 if (len < bitptr->left) {
cannam@85 145 value = (bitptr->cache & ((1 << bitptr->left) - 1)) >>
cannam@85 146 (bitptr->left - len);
cannam@85 147 bitptr->left -= len;
cannam@85 148
cannam@85 149 return value;
cannam@85 150 }
cannam@85 151
cannam@85 152 /* remaining bits in current byte */
cannam@85 153
cannam@85 154 value = bitptr->cache & ((1 << bitptr->left) - 1);
cannam@85 155 len -= bitptr->left;
cannam@85 156
cannam@85 157 bitptr->byte++;
cannam@85 158 bitptr->left = CHAR_BIT;
cannam@85 159
cannam@85 160 /* more bytes */
cannam@85 161
cannam@85 162 while (len >= CHAR_BIT) {
cannam@85 163 value = (value << CHAR_BIT) | *bitptr->byte++;
cannam@85 164 len -= CHAR_BIT;
cannam@85 165 }
cannam@85 166
cannam@85 167 if (len > 0) {
cannam@85 168 bitptr->cache = *bitptr->byte;
cannam@85 169
cannam@85 170 value = (value << len) | (bitptr->cache >> (CHAR_BIT - len));
cannam@85 171 bitptr->left -= len;
cannam@85 172 }
cannam@85 173
cannam@85 174 return value;
cannam@85 175 }
cannam@85 176
cannam@85 177 # if 0
cannam@85 178 /*
cannam@85 179 * NAME: bit->write()
cannam@85 180 * DESCRIPTION: write an arbitrary number of bits
cannam@85 181 */
cannam@85 182 void mad_bit_write(struct mad_bitptr *bitptr, unsigned int len,
cannam@85 183 unsigned long value)
cannam@85 184 {
cannam@85 185 unsigned char *ptr;
cannam@85 186
cannam@85 187 ptr = (unsigned char *) bitptr->byte;
cannam@85 188
cannam@85 189 /* ... */
cannam@85 190 }
cannam@85 191 # endif
cannam@85 192
cannam@85 193 /*
cannam@85 194 * NAME: bit->crc()
cannam@85 195 * DESCRIPTION: compute CRC-check word
cannam@85 196 */
cannam@85 197 unsigned short mad_bit_crc(struct mad_bitptr bitptr, unsigned int len,
cannam@85 198 unsigned short init)
cannam@85 199 {
cannam@85 200 register unsigned int crc;
cannam@85 201
cannam@85 202 for (crc = init; len >= 32; len -= 32) {
cannam@85 203 register unsigned long data;
cannam@85 204
cannam@85 205 data = mad_bit_read(&bitptr, 32);
cannam@85 206
cannam@85 207 crc = (crc << 8) ^ crc_table[((crc >> 8) ^ (data >> 24)) & 0xff];
cannam@85 208 crc = (crc << 8) ^ crc_table[((crc >> 8) ^ (data >> 16)) & 0xff];
cannam@85 209 crc = (crc << 8) ^ crc_table[((crc >> 8) ^ (data >> 8)) & 0xff];
cannam@85 210 crc = (crc << 8) ^ crc_table[((crc >> 8) ^ (data >> 0)) & 0xff];
cannam@85 211 }
cannam@85 212
cannam@85 213 switch (len / 8) {
cannam@85 214 case 3: crc = (crc << 8) ^
cannam@85 215 crc_table[((crc >> 8) ^ mad_bit_read(&bitptr, 8)) & 0xff];
cannam@85 216 case 2: crc = (crc << 8) ^
cannam@85 217 crc_table[((crc >> 8) ^ mad_bit_read(&bitptr, 8)) & 0xff];
cannam@85 218 case 1: crc = (crc << 8) ^
cannam@85 219 crc_table[((crc >> 8) ^ mad_bit_read(&bitptr, 8)) & 0xff];
cannam@85 220
cannam@85 221 len %= 8;
cannam@85 222
cannam@85 223 case 0: break;
cannam@85 224 }
cannam@85 225
cannam@85 226 while (len--) {
cannam@85 227 register unsigned int msb;
cannam@85 228
cannam@85 229 msb = mad_bit_read(&bitptr, 1) ^ (crc >> 15);
cannam@85 230
cannam@85 231 crc <<= 1;
cannam@85 232 if (msb & 1)
cannam@85 233 crc ^= CRC_POLY;
cannam@85 234 }
cannam@85 235
cannam@85 236 return crc & 0xffff;
cannam@85 237 }