Bit Right Rotate Through Carry implementation "C#"

Question

I know there is similar questions to my question, however, they aren't the same. All of them are just normal shifts, circular shifts etc. not having a through Carry flag.

I am trying to implement a method that does a right rotate through carry flag, carry flag being 1, current code:

public static int RotateRight(int value, int count = 2)
{
   uint val = (uint)value;
   return (int)((val >> count) | (val << (32 - count)));
}

However, this works only as normal shift, an input of 16 returns 4. How would one create a carry flag?

Before an admin points to this question C# bitwise rotate left and rotate right this does a normal rotate without a through carry flag.

Rotate through carry

Another example of this:

10 >> 2 with carry through flag of 1

1   00010000    
Rotate with carry   >>  2   
0   10001000    
0   01000100

Answer 1

If I'm understanding you correctly, here my really straigth-forward, off the top of my head, totally unoptimized way of doing it:

int RotateRightThroughCarry(uint value, int count, ref uint carry)
{
  // width assumed to be 32 bits
  // carry assumed to be either 0 or 1    
  for(int i = 0; i < count; i++)
    value = RotateRightOneBitThroughCarry(value, ref carry);
  return value;
}

int RotateRightOneBitThroughCarry(uint value, ref uint carry)
{
  int newCarry = value & 1;
  int newValue = (value >> 1) | (carry << 31);
  carry = newCarry;
  return newValue;
}