Explain the following C++ method

#define XL     33           
#define OR      113          
#define NOR     313     
#define TN     344  

int to_bits(int critn,char *mask)
{
       unsigned int x;
       int begin;

       if (critn < XL)           begin = 1;
       else if (critn < OR)      begin = XL;
       else if (critn < NOR)     begin = OR;
       else if (critn <= TN)    begin = NOR;
       else                        begin = 0;
       x = critn - begin;

       *mask = (char)(0x80 >> (x % 8));

       return (int)(x >> 3);    // fast divide by 8  
}

I don't have any kn开发者_StackOverflow社区owledge of C++ code. Can any one explain what this method is doing in the last 2 lines?

Thanks

---

The last two lines are bit shifting.

mask is taking 0x80 and shifting it (x to the mod of 8) positions eg 5 >> 2 will give you 1.

x >> 3 is as it says, dividing it by 8, its taking x and moving all the bits 3 positions to the right (so thats 1,2,4), as a result, 8 will become 1 etc. its a little like integer div, but would be faster (as the comment says, fast divide by 8)

---

  *mask = (char)(0x80 >> (x % 8));  

The value x is masked so that only the lower three bits remain. The value 0x80 is shifted to right by the remaining number. The result is assigned to the value where mask points to.

   return (int)(x >> 3);    // fast divide by 8     

x is divided by eight. The result is the reutrn value of the method.

---

>> is right shift operator.

for e.g 8 > 3 will give you 1, right shift binary value of 8 by 3 places

1000(binary of 8) right shift by 3 places = 0001 (1 in decimal)

---

In C++, just like most programming languages, you can only return one value. To "return" two values, it's a common C/C++ practice to return one and pass a pointer to an object and modify that object via the pointer (mask in this case).

The object that mask point to will be assigned a bitmask with exactly one bit set. This is done be taking the hexadecimal value 0x80 (1000 0000 in binary form) and right shift it 0 to 7 steps. The exact number of steps is decided by x, which is computer using some application-specific logic.

The value returned is the x / 8.

You can see the routine as a division routine that returns x/8 and the remainder (like x modulo 8, but expressed as a bit mask rather than an integer value).