我有65个不同位长的参数,我需要填写一个八进制字符串。参数将连续地以八进制字符串填充。例如,假设第一个参数是1位长,因此它将被填充在八进制字符串的第一个八进制的第0位位置。现在,第二个参数假设为9位长。因此,这个参数的前7位将被填充在相同的八位位中,接下来的2位应该被填充到下一个八进制的第0位和第1位位置。类似地,其他参数将被填充到八进制字符串中。我试图编写一个函数,在其中,我将指针传递给当前的八进制、位位置和源指针,从那里复制数据。但我发现逻辑实现很困难。我尝试过许多逻辑(位操作、位移位、旋转等等)。但没能得到正确的答案。如果有人能在"C“中给我一个逻辑/函数,我将非常感激。您也可以使用不同的功能原型。
我编写了16位代码如下:
void set16BitVal(U8** p_buf, U8* bitPos, U16 src)
{
U16 ctr;
U16 bitVal;
U16 srcBitVal;
U16 tempSrc = src;
U8 temp = **p_buf;
printf("\n temp = %d\n", temp);
for(ctr=0; ctr<16; ctr++)
{
bitVal = 1;
bitVal = bitVal << ctr;
srcBitVal = src & bitVal;
temp = temp | srcBitVal;
**p_buf = temp;
if(srcBitVal)
srcBitVal = 1;
else
srcBitVal = 0;
printf("\n bit = %d, p_buf = %x \t p_buf=%d bitPos=%d ctr=%d srcBitVal = %d\n",\
tempSrc, *p_buf, **p_buf, *bitPos, ctr, srcBitVal);
*bitPos = (*bitPos+1)%8; /*wrap around after bitPos:7 */
if(0 == *bitPos)
{
(*p_buf)++; /*jump to next octet*/
temp = **p_buf;
printf("\n Value of temp = %d\n", temp);
}
//printf("\n ctr=%d srcBitVal = %d", ctr, srcBitVal);
printf("\n");
}
}但问题是,假设我通过了src=54647,就会得到以下输出:
温度=0
位= 54647,p_buf = bf84da4b p_buf=1 bitPos=0 ctr=0 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=3 bitPos=1 ctr=1 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=7 bitPos=2 ctr=2 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=7 bitPos=3 ctr=3 srcBitVal =0
位= 54647,p_buf = bf84da4b p_buf=23 bitPos=4 ctr=4 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=55 bitPos=5 ctr=5 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=119 bitPos=6 ctr=6 srcBitVal =1
位= 54647,p_buf = bf84da4b p_buf=119 bitPos=7 ctr=7 srcBitVal =0
温度值=0
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=0 ctr=8 srcBitVal =1
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=1 ctr=9 srcBitVal =0
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=2 ctr=10 srcBitVal =1
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=3 ctr=11 srcBitVal =0
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=4 ctr=12 srcBitVal =1
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=5 ctr=13 srcBitVal =0
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=6 ctr=14 srcBitVal =1
位= 54647,p_buf = bf84da4c p_buf=0 bitPos=7 ctr=15 srcBitVal =1
温度值=0
但是,预期的输出是:下一个字节应该开始填充src的值8位。
谁能帮我解决这个问题吗?
发布于 2013-01-09 11:56:32
你很幸运。由于我喜欢一些旋转,所以我为您编写了一个BitBuffer的通用实现。我还没有对它进行彻底的测试(例如,并非所有令人讨厌的角落案例),但正如您将看到的,它通过了我添加到下面代码中的简单测试。
#include <assert.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
struct BitBuffer {
unsigned length; // No of bits used in buffer
unsigned capacity; // No of bits available in buffer
uint8_t buffer[];
};
struct BitBuffer * newBitBuffer (
unsigned capacityInBits
) {
int capacityInBytes;
struct BitBuffer * result;
capacityInBytes = (capacityInBits / 8);
if (capacityInBits % 8 != 0) {
capacityInBytes++;
}
result = malloc(sizeof(*result) + capacityInBytes);
if (result) {
result->length = 0;
result->capacity = capacityInBits;
}
return result;
}
bool addBitsToBuffer (
struct BitBuffer * bbuffer, const void * bits, unsigned bitCount
) {
unsigned tmpBuf;
unsigned tmpBufLen;
unsigned tmpBufMask;
uint8_t * nextBufBytePtr;
const uint8_t * nextBitsBytePtr;
// Verify input parameters are sane
if (!bbuffer || !bits) {
// Evil!
return false;
}
if (bitCount == 0) {
// No data to add? Nothing to do.
return true;
}
// Verify we have enough space available
if (bbuffer->length + bitCount > bbuffer->capacity) {
// Won't fit!
return false;
}
// Get the first byte we start writing bits to
nextBufBytePtr = bbuffer->buffer + (bbuffer->length / 8);
// Shortcut:
// If we happen to be at a byte boundary,
// we can simply use memcpy and save us a lot of headache.
if (bbuffer->length % 8 == 0) {
unsigned byteCount;
byteCount = bitCount / 8;
if (bitCount % 8 != 0) {
byteCount++;
}
memcpy(nextBufBytePtr, bits, byteCount);
bbuffer->length += bitCount;
return true;
}
// Let the bit twiddling begin
nextBitsBytePtr = bits;
tmpBuf = *nextBufBytePtr;
tmpBufLen = bbuffer->length % 8;
tmpBuf >>= 8 - tmpBufLen;
tmpBufMask = (~0u) >> ((sizeof(unsigned) * 8) - tmpBufLen);
// tmpBufMask has the first tmpBufLen bits set to 1.
// E.g. "tmpBufLen == 3" ==> "tmpBufMask == 0b111 (7)"
// or "tmpBufLen == 6" ==> "tmpBufMask = 0b111111 (63)", and so on.
// Beyond this point we will neither access bbuffer->length again, nor
// can this function fail anymore, so we set the final length already.
bbuffer->length += bitCount;
// Process input bits in byte chunks as long as possible
while (bitCount >= 8) {
// Add 8 bits to tmpBuf
tmpBuf = (tmpBuf << 8) | *nextBitsBytePtr;
// tmpBuf now has "8 + tmpBufLen" bits set
// Add the highest 8 bits of tmpBuf to our BitBuffer
*nextBufBytePtr = (uint8_t)(tmpBuf >> tmpBufLen);
// Cut off the highest 8 bits of tmpBuf
tmpBuf &= tmpBufMask;
// tmpBuf now has tmpBufLen bits set again
// Skip to next input/output byte
bitCount -= 8;
nextBufBytePtr++;
nextBitsBytePtr++;
}
// Test if we still have bits left. That will be the case
// if the input bit count was no integral multiple of 8.
if (bitCount != 0) {
// Add bitCount bits to tmpBuf
tmpBuf = (tmpBuf << bitCount) | (*nextBitsBytePtr >> (8 - bitCount));
tmpBufLen += bitCount;
}
// tmpBufLen is never 0 here, it must have a value in the range [1, 14].
// We add zero bits to it so that tmpBuf has 16 bits set.
tmpBuf <<= (16 - tmpBufLen);
// Now we only need to add one or two more bytes from tmpBuf to our
// BitBuffer, depending on its length prior to adding the zero bits.
*nextBufBytePtr = (uint8_t)(tmpBuf >> 8);
if (tmpBufLen > 8) {
*(++nextBufBytePtr) = (uint8_t)(tmpBuf & 0xFF);
}
return true;
}
int main ()
{
bool res;
uint8_t testData[4];
struct BitBuffer * buf;
buf = newBitBuffer(1024); // Can hold up to 1024 bits
assert(buf);
// Let's add some test data.
// Add 1 bit "1" => Buffer "1"
testData[0] = 0xFF;
res = addBitsToBuffer(buf, testData, 1);
assert(res);
// Add 6 bits "0101 01" => Buffer "1010 101"
testData[0] = 0x54;
res = addBitsToBuffer(buf, testData, 6);
assert(res);
// Add 4 Bits "1100" => Buffer "1010 1011 100"
testData[0] = 0xC0;
res = addBitsToBuffer(buf, testData, 4);
assert(res);
// Add 16 Bits "0111 1010 0011 0110"
// ==> Buffer "1010 1011 1000 1111 0100 0110 110
testData[0] = 0x7A;
testData[1] = 0x36;
res = addBitsToBuffer(buf, testData, 16);
assert(res);
// Add 5 Bits "0001 1"
// ==> Buffer "1010 1011 1000 1111 0100 0110 1100 0011"
testData[0] = 0x18;
res = addBitsToBuffer(buf, testData, 5);
assert(res);
// Buffer should now have exactly a length of 32 bits
assert(buf->length == 32);
// And it should have the value 0xAB8F46C3
testData[0] = 0xAB;
testData[1] = 0x8F;
testData[2] = 0x46;
testData[3] = 0xC3;
assert(memcmp(buf->buffer, testData, 4) == 0);
free(buf);
return 0;
}代码并没有优化到最大的性能,但我想它还是应该有一个不错的性能。任何额外的性能调整都会显着地增加代码大小,我希望保持代码的简单性。有些人可能会争辩说,使用>> 3而不是/ 8和& 0x7来代替% 8会带来更好的性能,但是如果您使用一个很好的C编译器,那么如果您启用优化,编译器将在内部完成这一任务,因此我更愿意让代码更易读。
附加说明
当您将指针传递到多字节数据类型时,请注意字节顺序!例如,以下代码
uint16_t x16 = ...;
addBitsToBuffer(buf, &x16, ...);
uint32_t x32 = ...;
addBitsToBuffer(buf, &x32, ...);在大型终端计算机(PPC )上工作得很好,但它可能无法给出在小型终端计算机(例如x86 CPU)上的预期结果。在一台小小的endian机器上,您必须首先交换字节顺序。为此,您可以使用htons和htonl:
uint16_t x16 = ...;
uint16_t x16be = htons(x16);
addBitsToBuffer(buf, &x16be, ...);
uint32_t x32 = ...;
uint32_t x32be = htonl(x32);
addBitsToBuffer(buf, &x32be, ...);在大端机器上,htonX函数/宏通常什么都不做,因为值已经是“网络字节顺序”(大端字节),而在小终端机器上,它们将交换字节顺序。
传递一个uint8_t指针总是可以在任何一台机器上工作,它只是一个字节,因此没有字节顺序。
https://stackoverflow.com/questions/14231464
复制相似问题