For some memory masking operations I need a bitwise-rotation functionality for unsigned integral types. I came across to the solutions based on the wiki article, but have not found a variation for a function for bitwise-rotation within an "arbitrary" field of bits. Therefore, I have extended the solution of John Regehr, and now I want some feedback from you. I would also appreciate of using mechanisms provided by the C++ core-language upto C++14 (without the use of the std-namespace)

#include <iostream>
#include <vector>
#include <bitset>

uint64_t CircShift (uint64_t x, uint8_t n, uint8_t bitwidth)
{
  return ((x<<n)&((1<<bitwidth)-1)) | (x>>(bitwidth-n));
}

int main()
{
    uint64_t var=0b000110100110;
    var=CircShift(var,2,9);
    std::cout<<std::bitset<12>(var);
   
}


 

For some memory masking operations I need a bitwise-rotation functionality for unsigned integral types. I came across solutions based on the wiki article, but have not found a variation for a function for bitwise-rotation within an "arbitrary" field of bits. Therefore, I have extended the solution of John Regehr, and now I want some feedback from you. I would also appreciate any advice on using mechanisms provided by the C++ core language up to C++14 (without the use of the std namespace).

#include <iostream>
#include <vector>
#include <bitset>

uint64_t CircShift (uint64_t x, uint8_t n, uint8_t bitwidth)
{
  return ((x<<n)&((1<<bitwidth)-1)) | (x>>(bitwidth-n));
}

int main()
{
    uint64_t var=0b000110100110;
    var=CircShift(var,2,9);
    std::cout<<std::bitset<12>(var);
   
}

For some memory masking operations I need a bitwise-rotation functionality for unsigned integral types. I came across to the solutions based on the wiki article, but have not found a variation for a function for bitwise-rotation within an "arbitrary" field of bits. Therefore, I have extended the solution of John Regehr, and now I want some feedback from you. I would also appreciate of using mechanisms provided by the C++ core-language upto C++14 (without the use of the std-namespace)

#include <iostream>
#include <vector>
#include <bitset>

//

uint64 CircShift (uint64 f_val_u64, uint8 f_shiftSize_u8, uint8 f_bitwidth_u8)
{
// bitwidth defines the length, in which the bits are free to rotate
// left-shift the required f_shiftSize_u8 and mask the result with the desired bitwidth
// to ignore the falling bits outside of bitwidth
// right shift f_val_u64 so that the left-shifted bits are moved to the lsb
  return ((f_val_u64<<f_shiftSize_u8)&((1<<f_bitwidth_u8)-1)) | (f_val_u64>>(f_bitwidth_u8-f_shiftSize_u8));
}

int main()
{
    uint64_t var=0b000110100110;
    var=CircShift(var,2,9);
    std::cout<<std::bitset<12>(var);
   
}


 

For some memory masking operations I need a bitwise-rotation functionality for unsigned integral types. I came across to the solutions based on the wiki article, but have not found a variation for a function for bitwise-rotation within an "arbitrary" field of bits. Therefore, I have extended the solution of John Regehr, and now I want some feedback from you. I would also appreciate of using mechanisms provided by the C++ core-language upto C++14 (without the use of the std-namespace)

#include <iostream>
#include <vector>
#include <bitset>

uint64_t CircShift (uint64_t x, uint8_t n, uint8_t bitwidth)
{
  return ((x<<n)&((1<<bitwidth)-1)) | (x>>(bitwidth-n));
}

int main()
{
    uint64_t var=0b000110100110;
    var=CircShift(var,2,9);
    std::cout<<std::bitset<12>(var);
   
}