Question

I have declared an array of bytes:

uint8_t memory[123];

which i have filled with:

memory[0]=0xFF;
memory[1]=0x00;
memory[2]=0xFF;
memory[3]=0x00;
memory[4]=0xFF;

And now i get requests from the user for specific bits. For example, i receive a request to send the bits in position 10:35, and i must return those bits combined in bytes. In that case i would need 4 bytes which contain.

response[0]=0b11000000;
responde[1]=0b00111111;
response[2]=0b11000000; 
response[3]=0b00000011; //padded with zeros for excess bits

This will be used for Modbus which is a big-endian protocol. I have come up with the following code:

for(int j=findByteINIT;j<(findByteFINAL);j++){

   aux[0]=(unsigned char) (memory[j]>>(startingbit-(8*findByteINIT)));
   aux[1]=(unsigned char) (memory[j+1]<<(startingbit-(8*findByteINIT)));

   response[h]=(unsigned char) (aux[0] | aux[1] );
   h++;

   aux[0]=0x00;//clean aux
   aux[1]=0x00;

        }

which does not work but should be close to the ideal solution. Any suggestions?

Était-ce utile?

La solution

I think this should do it.

int start_bit = 10, end_bit = 35; // input

int start_byte = start_bit / CHAR_BIT;
int shift = start_bit % CHAR_BIT;
int response_size = (end_bit - start_bit + (CHAR_BIT - 1)) / CHAR_BIT;
int zero_padding = response_size * CHAR_BIT - (end_bit - start_bit + 1);

for (int i = 0; i < response_size; ++i) {
  response[i] =
      static_cast<uint8_t>((memory[start_byte + i] >> shift) |
                           (memory[start_byte + i + 1] << (CHAR_BIT - shift)));
}
response[response_size - 1] &= static_cast<uint8_t>(~0) >> zero_padding;

If the input is a starting bit and a number of bits instead of a starting bit and an (inclusive) end bit, then you can use exactly the same code, but compute the above end_bit using:

int start_bit = 10, count = 9;  // input
int end_bit = start_bit + count - 1;
Licencié sous: CC-BY-SA avec attribution
Non affilié à StackOverflow
scroll top