在音频流解析过程中,常常会涉及到顺序读取某些bit的操作。

#include<stdio.h>

typedef struct _BIT_BUF {
unsigned char buffer[1024];
unsigned int byteSize;
unsigned int bytePosition;
unsigned int bitPosition;
unsigned int wBytePosition;
unsigned int wBitPosition;
}tBitBuffer;

//mask:baoliu保留低bit位,可用while 循环0x1右移bit-1 位。

unsigned int mask(unsigned int bit){
  switch (bit) {
    case 1:
      return 0x1;
    break;
    case 2:
      return 0x3;
    break;
    case 3:
      return 0x7;
    break;
    case 4:
      return 0xf;
    break;
    case 5:
      return 0x1f;
    break;
    case 6:
      return 0x3f;
    break;
    case 7:
      return 0x7f;
    break;
    case 8:
      return 0xff;
    break;

  case 9:
    return 0x1ff;
  break;
  case 10:
    return 0x3ff;
  break;
  case 11:
    return 0x7ff;
  break;
  case 12:
    return 0xfff;
  break;
  case 13:
    return 0x1fff;
  break;
  case 14:
    return 0x3fff;
  break;
  case 15:
    return 0x7fff;
  break;
  case 16:
    return 0xffff;
  break;

  }
}

//顺序读取bitbuffer 中的bits位,返回结果
unsigned long bitBuffer_readBits(tBitBuffer *pBitBuffer, unsigned int bits) {
  unsigned long result = 0;
  if (bits > 64) {
    return 0;
  }
  

  if (pBitBuffer->bytePosition * 8 + (pBitBuffer->bitPosition + bits ) >pBitBuffer->wBytePosition * 8 + pBitBuffer->wBitPosition) {
  printf("L%d, error,no data,bytePos:%d, bitPos:%d, wBytePos: %d, wBitPos:%d\n",__LINE__, pBitBuffer->bytePosition, pBitBuffer->bitPosition, pBitBuffer->wBytePosition,     pBitBuffer->wBitPosition);
  return 0;
}

  unsigned int bitsRemainning = 8 - pBitBuffer->bitPosition;
  while (bits != 0) {
    printf("bits:%d,bitPositon:%d, bitsRemainning:%d\n", bits, pBitBuffer->bitPosition, bitsRemainning);
    if (bitsRemainning > bits) {
      result <<= bits;
      pBitBuffer->bitPosition += bits;
      bitsRemainning -= bits;
      result |= (pBitBuffer->buffer[pBitBuffer->bytePosition] >> bitsRemainning) & mask(bits);
      printf("result:0x%x\n",result);
      bits = 0;
    }
    else {
      result <<= bitsRemainning;
      result |= pBitBuffer->buffer[pBitBuffer->bytePosition] & mask(bitsRemainning);
      printf("result:0x%x\n",result);
      bits -= bitsRemainning;
      pBitBuffer->bitPosition += bitsRemainning;
    }
    if (pBitBuffer->bitPosition == 8) {
      pBitBuffer->bitPosition = 0;
      bitsRemainning = 8;
      pBitBuffer->bytePosition++;
    }
  }
  return result;
}

//顺序向bitBuffer写bits位,其值为value

int bitBuffer_writeBits(tBitBuffer *pBitBuffer,unsigned int bits,unsigned int value) {

  unsigned int bitsRemainning = 8 - pBitBuffer->wBitPosition;
  while (bits != 0) {
    printf("bits:%d,bitPositon:%d, bitsRemainning:%d\n", bits, pBitBuffer->wBitPosition, bitsRemainning);
    if (bitsRemainning >= bits) {
      value <<= bitsRemainning - bits;
      pBitBuffer->buffer[pBitBuffer->wBytePosition] |= value;
      pBitBuffer->wBitPosition += bits;
      bitsRemainning -= bits;
      bits = 0;
      printf("L%d,value:0x%x, bits:%d, buffer[%d, 0x%x] \n",__LINE__, value, bits, pBitBuffer->wBytePosition, pBitBuffer->buffer[pBitBuffer->wBytePosition]);
    }
    else {
      pBitBuffer->buffer[pBitBuffer->wBytePosition] <<= bitsRemainning;
      pBitBuffer->buffer[pBitBuffer->wBytePosition] |= value >>(bits - bitsRemainning);
      value = value & mask(bits-bitsRemainning);
      bits -= bitsRemainning;
      pBitBuffer->wBitPosition += bitsRemainning;
      printf("L%d,value:%d, bits:%d, buffer[%d, 0x%x] \n",__LINE__, value, bits, pBitBuffer->wBytePosition, pBitBuffer->buffer[pBitBuffer->wBytePosition]);
    }
    if (pBitBuffer->wBitPosition == 8) {
      pBitBuffer->wBitPosition = 0;
      bitsRemainning = 8;
      pBitBuffer->wBytePosition++;
    }
  }
  printf("L%d,wBitPos:%d, wBytePos:%d \n",__LINE__, pBitBuffer->wBitPosition, pBitBuffer->wBytePosition);
  return 0;
}

//左移或右移bits位

int bitBuffer_shiftBits(tBitBuffer *pBitBuffer, int bits) {
  int absBits = bits > 0 ? bits : -bits;
  int shiftBytes = absBits / 8;
  int shiftBits = absBits % 8;
  int flag = bits > 0 ? 1 : 0;
  if ( flag ) {
    if (pBitBuffer->bitPosition + shiftBits > 8) {
      pBitBuffer->bytePosition += shiftBytes + 1;
      pBitBuffer->bitPosition += shiftBits -8;
    }
    else {
      pBitBuffer->bytePosition += shiftBytes ;
      pBitBuffer->bitPosition += shiftBits;
    }
  }
  else {
    if (pBitBuffer->bitPosition - shiftBits < 0) {
      pBitBuffer->bytePosition -= shiftBytes -1;
      pBitBuffer->bitPosition -= shiftBits -8;
    }
    else {
      pBitBuffer->bytePosition = shiftBytes ;
      pBitBuffer->bitPosition -= shiftBits ;

    }

  }
  if (pBitBuffer->bytePosition < 0 || pBitBuffer->bytePosition > 1024) {
    pBitBuffer->bytePosition = 0;
    pBitBuffer->bitPosition = 0;
    return -1;
  }
  else{
    return 0;
  }

}

//读取了多少位

int bitBuffer_getReadBits(tBitBuffer *pBitBuffer) {
  return 8 * pBitBuffer->bytePosition + pBitBuffer->bitPosition;
}

int bitBuffer_writeByte(tBitBuffer *pBitBuffer, unsigned char byte){
  pBitBuffer->buffer[pBitBuffer->wBytePosition ++] = byte;
  pBitBuffer->byteSize ++;
}

void main(void) {
  

  tBitBuffer *bitBuffer = (tBitBuffer*)malloc(sizeof(tBitBuffer));
  memset(bitBuffer, 0, sizeof(tBitBuffer));
  // bitBuffer_writeByte(bitBuffer, 0x56);
  // bitBuffer_writeByte(bitBuffer, 0xe2);
  bitBuffer_writeBits(bitBuffer, 11, 0x2b7);
  bitBuffer_writeBits(bitBuffer, 5, 0x2);

  unsigned long result = 0;

  bitBuffer_shiftBits(bitBuffer, 3);
  result = bitBuffer_readBits(bitBuffer, 6);
  int readBits = bitBuffer_getReadBits(bitBuffer);
  printf("result:0x%x, %d, bitPostion:%d, bytePosition:%d,byteSize:%d, wBytePosition:%d, readBits:%d\n", result,result, bitBuffer->bitPosition, bitBuffer->bytePosition, bitBuffer->byteSize, bitBuffer->wBytePosition,readBits );

  #if 0
  result = bitBuffer_readBits(&bitBuffer, 3);
  printf("result:0x%x, %d, bitPostion:%d, bytePosition:%d,byteSize:%d, wBytePosition:%d\n", result,result, bitBuffer.bitPosition, bitBuffer.bytePosition, bitBuffer.byteSize,   bitBuffer.wBytePosition);
  result = bitBuffer_readBits(&bitBuffer, 6);
  printf("result:0x%x, %d, bitPostion:%d, bytePosition:%d,byteSize:%d, wBytePosition:%d\n", result,result, bitBuffer.bitPosition, bitBuffer.bytePosition, bitBuffer.byteSize,   bitBuffer.wBytePosition);
  #endif
}

bit Buffer的更多相关文章

  1. Node.js:Buffer浅谈

    Javascript在客户端对于unicode编码的数据操作支持非常友好,但是对二进制数据的处理就不尽人意.Node.js为了能够处理二进制数据或非unicode编码的数据,便设计了Buffer类,该 ...

  2. java.IO输入输出流:过滤流:buffer流和data流

    java.io使用了适配器模式装饰模式等设计模式来解决字符流的套接和输入输出问题. 字节流只能一次处理一个字节,为了更方便的操作数据,便加入了套接流. 问题引入:缓冲流为什么比普通的文件字节流效率高? ...

  3. 一点公益商城开发系统模式Ring Buffer+

    一个队列如果只生产不消费肯定不行的,那么如何及时消费Ring Buffer的数据呢?简单的方案就是当Ring Buffer"写满"的时候一次性将数据"消费"掉. ...

  4. CSharpGL(38)带初始数据创建Vertex Buffer Object的情形汇总

    CSharpGL(38)带初始数据创建Vertex Buffer Object的情形汇总 开始 总的来说,OpenGL应用开发者会遇到为如下三种数据创建Vertex Buffer Object的情形: ...

  5. golang bytes.Buffer Reset

    func t() { a := []'} buf := new(bytes.Buffer) buf.Write(a) b := buf.Bytes() fmt.Println(b) buf.Reset ...

  6. 使用Ring Buffer构建高性能的文件写入程序

    最近常收到SOD框架的朋友报告的SOD的SQL日志功能报错:文件句柄丢失.经过分析得知,这些朋友使用SOD框架开发了访问量比较大的系统,由于忘记关闭SQL日志功能所以出现了很高频率的日志写入操作,从而 ...

  7. directx12中vetex buffer、index buffer和constant buffer绑定piple line的时机

    类别 时机 函数 建Heap vetex buffer 在Draw函数中 ID3D12GraphicsCommandList::IASetVertexBuffer 否 index buffer 在Dr ...

  8. JAVA NIO Buffer

    所谓的输入,输出,就是把数据移除或移入缓冲区.   硬件不能直接访问用户控件(JVM). 基于存储的硬件设备操控的是固定大小的数据块儿,用户请求的是任意大小的或非对齐的数据块儿.   虚拟内存:使用虚 ...

  9. Circular Buffer

    From:http://bradforj287.blogspot.com/2010/11/efficient-circular-buffer-in-java.html import java.util ...

  10. Buffer类

    输入流中可以通过缓冲区来加大读取的效率,sun公司感觉可以加快执行效率,他就为我们提供了一个类来操作缓存区. Buffer来头的类:所有缓冲流都是以Buffer开头的: 学习缓冲流的作用: Buffe ...

随机推荐

  1. PP: Sequence to sequence learning with neural networks

    From google institution; 1. Before this, DNN cannot be used to map sequences to sequences. In this p ...

  2. PHP中关于foreach使用引用变量的坑

    PHP版本为 5.6.12 代码如下:   1 2 3 4 5 6 7 8 9 10 11 12 <?php $arr = ['a', 'b', 'c', 'd', 'e']; foreach ...

  3. python调用HEG工具批量处理MODIS数据

    下面的代码主要用于使用python语言调用NASA官方的MODIS处理工具HEG进行投影坐标转换与重采样批量处理 主要参考 HEG的用户手册:https://newsroom.gsfc.nasa.go ...

  4. JS实现“隐藏与显示”功能(多种方法)

    1,通过按钮实现隐藏与显示: 这个是通过按钮点击实现的隐藏与显示,具体代码如下: ? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 ...

  5. phpstorm汉化包

    链接:https://pan.baidu.com/s/1dG7AWI87dOJJezra9veFrA 提取码:btmf 下载后放到lib目录中 即可

  6. IIS7.5 HTTP 错误 500 调用loadlibraryex失败的解决方法

    在IIS7.5打开网页的时候,提示: HTTP 错误 500.0 - Internal Server Error 调用 LoadLibraryEx 失败,在 ISAPI 筛选器 C:\Windows\ ...

  7. Spring Boot的27个注解【核心】

    导读[约定大于配置] Spring Boot方式的项目开发已经逐步成为Java应用开发领域的主流框架,它不仅可以方便地创建生产级的Spring应用程序,还能轻松地通过一些注解配置与目前比较火热的微服务 ...

  8. The number of set(位运算+状态dp)一道十分美妙的题目哦!!!!!!

    Given you n sets.All positive integers in sets are not less than 1 and not greater than m.If use the ...

  9. Openstack 简单梳理,(自用 慎点)

    这个图里面的彩色方块,就是OpenStack最核心的组件. 推荐几个大咖,大家可以百度找他们的博客来看:陈沙克.何明桂.孔令贤,Cloudman.

  10. Web API和Web Service

    首先,Web API是由Web Service演变而来,它们两者关系就是所有Web Service都是API,但并非所有API都是Web Service.其次,两者都有利于信息的传输,但Web API ...