11,412,833 members (74,134 online)

# An introduction to bitwise operators

, 8 May 2002 CPOL
 Rate this:

## Introduction

I have noticed that some people seem to have problems with bitwise operators, so I decided to write this brief tutorial on how to use them.

## An Introduction to bits

Bits, what are they you may ask?

Well, simply put, bits are the individual ones and zeros that make up every thing we do with computers. All the data you use is stored in your computer using bits. A BYTE is made up of eight bits, a WORD is two BYTEs, or sixteen bits. And a DWORD is two WORDS, or thirty two bits.

``` 0 1 0 0 0 1 1 1 1 0 0 0 0 1 1 1 0 1 1 1 0 1 0 0 0 1 1 1 1 0 0 0
||              |               |               |              ||
|+- bit 31      |               |               |       bit 0 -+|
|               |               |               |               |
+-- BYTE 3 -----+--- BYTE 2 ----+--- BYTE 1 ----+-- BYTE 0 -----+
|                               |                               |
+----------- WORD 1 ------------+----------- WORD 0 ------------+
|                                                               |
+--------------------------- DWORD -----------------------------+
```

The beauty of having bitwise operators is that you can use a BYTE, WORD or DWORD as a small array or structure. Using bitwise operators you can check or set the values of individual bits or even a group of bits.

## Hexadecimal numbers and how they relate to bits

When working with bits, it is kind of hard to express every number using just ones and zeros, which is known as binary notation. To get around this we use hexadecimal (base 16) numbers.

As you may or may not know, it takes four bits to cover all the numbers from zero to fifteen, which also happens to be the range of a single digit hexadecimal number. This group of four bits, or half a BYTE, is called a nibble. As there are two nibbles in a BYTE, we can use two hexadecimal digits to show the value of one BYTE.

```NIBBLE   HEX VALUE
======   =========
0000        0
0001        1
0010        2
0011        3
0100        4
0101        5
0110        6
0111        7
1000        8
1001        9
1010        A
1011        B
1100        C
1101        D
1110        E
1111        F```

So if we had one BYTE containing the letter 'r' (ASCII code 114) it would look like this:

```0111 0010    binary

We could write it as '0x72'

## Bitwise operators

There are six bitwise operators. They are:
&   The AND operator
|   The OR operator
^   The XOR operator
~   The Ones Complement or Inversion operator
>>   The Right Shift operator
<<   The Left Shift operator.

### The & operator

The & (AND) operator compares two values, and returns a value that has its bits set if, and only if, the two values being compared both have their corresponding bits set. The bits are compared using the following table

```   1   &   1   ==   1
1   &   0   ==   0
0   &   1   ==   0
0   &   0   ==   0```

An ideal use for this is to set up a mask to check the values of certain bits. Say we have a BYTE that contains some bit flags, and we want to check if bit four bit is set.

```BYTE b = 50;
if ( b & 0x10 )
cout << "Bit four is set" << endl;
else
cout << "Bit four is clear" << endl;```

This would result in the following calculation

```    00110010  - b
& 00010000  - & 0x10
----------
00010000  - result```

So we see that bit four is set.

### The | operator

The | (OR) operator compares two values, and returns a value that has its bits set if one or the other values, or both, have their corresponding bits set. The bits are compared using the following table

```   1   |   1   ==   1
1   |   0   ==   1
0   |   1   ==   1
0   |   0   ==   0```

An ideal use for this is to ensure that certain bits are set. Say we want to ensure that bit three of some value is set

```BYTE b = 50;
BYTE c = b | 0x04;
cout << "c = " << c << endl;```

This would result in the following calculation

```    00110010  - b
| 00000100  - | 0x04
----------
00110110  - result```

### The ^ operator

The ^ (XOR) operator compares two values, and returns a value that has its bits set if one or the other value has its corresponding bits set, but not both. The bits are compared using the following table

```   1   ^   1   ==   0
1   ^   0   ==   1
0   ^   1   ==   1
0   ^   0   ==   0```

An ideal use for this is to toggle certain bits. Say we want toggle the bits three and four

```BYTE b = 50;
cout << "b = " << b << endl;
b = b ^ 0x18;
cout << "b = " << b << endl;
b = b ^ 0x18;
cout << "b = " << b << endl;```

This would result in the following calculations

```    00110010  - b
^ 00011000  - ^ 0x18
----------
00101010  - result

00101010  - b
^ 00011000  - ^ 0x18
----------
00110010  - result```

### The ~ operator

The ~ (Ones Complement or inversion) operator acts only on one value and it inverts it, turning all the ones int zeros, and all the zeros into ones. An ideal use of this would be to set certain bytes to zero, and ensuring all other bytes are set to one, regardless of the size of the data. Say we want to set all the bits to one except bits zero and one

```BYTE b = ~0x03;
cout << "b = " << b << endl;
WORD w = ~0x03;
cout << "w = " << w << endl;```

This would result in the following calculations

```    00000011  - 0x03
11111100  - ~0x03  b

0000000000000011  - 0x03
1111111111111100  - ~0x03  w```

Another ideal use, is to combine it with the & operator to ensure that certain bits are set to zero. Say we want to clear bit four

```BYTE b = 50;
cout << "b = " << b << endl;
BYTE c = b & ~0x10;
cout << "c = " << c << endl;```

This would result in the following calculations

```    00110010  - b
& 11101111  - ~0x10
----------
00100010  - result```

### The >> and << operators

The >> (Right shift) and << (left shift) operators move the bits the number of bit positions specified. The >> operator shifts the bits from the high bit to the low bit. The << operator shifts the bits from the low bit to the high bit. One use for these operators is to align the bits for whatever reason (check out the MAKEWPARAM, HIWORD, and LOWORD macros)

```BYTE b = 12;
cout << "b = " << b << endl;
BYTE c = b << 2;
cout << "c = " << c << endl;
c = b >> 2;
cout << "c = " << c << endl;```

This would result in the following calculations

```    00001100  - b
00110000  - b << 2
00000011  - b >> 2```

## Bit Fields

Another interesting thing that can be done using bits is to have bit fields. With bit fields you can set up minature structures within a BYTE, WORD or DWORD. Say, for example, we want to keep track of dates, but we want to use the least amount of memory as possible. We could declare our structure this way

```struct date_struct {
BYTE day   : 5,   // 1 to 31
month : 4,   // 1 to 12
year  : 14;  // 0 to 9999
} date;```

In this example, the day field takes up the lowest 5 bits, month the next four, and year the next 14 bits. So we can store the date structure in twenty three bits, which is contained in three BYTEs. The twenty fourth bit is ignored. If I had declared it using an integer for each field, the structure would have taken up 12 BYTEs.

```|0 0 0 0 0 0 0 0|0 0 0 0 0 0 0 0|0 0 0 0 0 0 0 0|
|                           |       |         |
+------ year ---------------+ month +-- day --+```

Now lets pick this declaration apart to see what we are doing.

First we will look at the data type we are using for the bit field structure. In this case we used a BYTE. A BYTE is 8 bits, and by using it, the compiler will allocate one BYTE for storage. If however, we use more than 8 bits in our structure, the compiler will allocate another BYTE, as many BYTEs as it takes to hold our structure. If we had used a WORD or DWORD, the compiler would have allocated a total of 32 bits to hold our structure.

Now lets look at how the various fields are declared. First we have the variable (day, month, and year), followed by a colon that separates the variable from the number of bits that it contains. Each bit field is separated by a comma, and the list is ended with a semicolon.

Now we get to the struct declaration. We put the bit fields into a struct like this so that we can use convention structure accessing notation to get at the structure members. Also, since we can not get the addresses of bit fields, we can now use the address of the structure.

```date.day = 12;

dateptr = &date;
dateptr->year = 1852;```

## Share

President
No Biography provided

 First PrevNext
 ERROR Atul Khanduri at 16-Feb-14 16:27 Atul Khanduri 16-Feb-14 16:27
 Nice article.... Atul Khanduri at 30-Dec-13 4:14 Atul Khanduri 30-Dec-13 4:14
 My vote of 5 Aris79 at 4-Nov-13 7:30 Aris79 4-Nov-13 7:30
 My vote of 5 Member 9783018 at 5-Feb-13 11:41 Member 9783018 5-Feb-13 11:41
 Useful Topic duccuongpx at 22-Jun-12 9:47 duccuongpx 22-Jun-12 9:47
 My vote of 4 wangxj_nemo at 16-May-12 19:14 wangxj_nemo 16-May-12 19:14
 My vote of 4 yogesh muchhal at 23-Nov-11 18:33 yogesh muchhal 23-Nov-11 18:33
 My vote of 5 kamiccolo at 1-Jun-11 6:04 kamiccolo 1-Jun-11 6:04
 My vote of 4 VitStepanek at 1-Aug-10 22:02 VitStepanek 1-Aug-10 22:02
 Excellant, Very down to earth and insighful Member 849910 at 28-Jul-10 6:05 Member 849910 28-Jul-10 6:05
 thank you Member 3078414 at 8-May-10 3:00 Member 3078414 8-May-10 3:00
 bitwise with floating point numbers Roman Tarasov at 1-Dec-09 3:33 Roman Tarasov 1-Dec-09 3:33
 Re: bitwise with floating point numbers PJ Arends at 4-Dec-09 6:52 PJ Arends 4-Dec-09 6:52
 useful article islandscape at 14-Oct-09 3:54 islandscape 14-Oct-09 3:54
 is here an error? langzhengyi at 31-May-09 21:53 langzhengyi 31-May-09 21:53
 Re: is here an error? spacevector at 10-Jul-12 22:13 spacevector 10-Jul-12 22:13
 Re: is here an error? Atul Khanduri at 16-Feb-14 16:19 Atul Khanduri 16-Feb-14 16:19
 Helpful article Ravi003 at 27-Jan-09 0:10 Ravi003 27-Jan-09 0:10
 nice thanks moonbinary at 10-Jan-09 19:15 moonbinary 10-Jan-09 19:15
 good AlexanderBX at 3-Nov-08 19:58 AlexanderBX 3-Nov-08 19:58
 Nice work! Thank you ! cometdlut at 2-Oct-08 22:38 cometdlut 2-Oct-08 22:38
 Reading from file and adding values to array Srinivas3279 B at 20-Nov-07 0:27 Srinivas3279 B 20-Nov-07 0:27
 Convert back a shift operator wira1guys at 1-Oct-07 19:20 wira1guys 1-Oct-07 19:20
 Re: Convert back a shift operator PJ Arends at 2-Oct-07 6:55 PJ Arends 2-Oct-07 6:55
 Re: Convert back a shift operator [modified] wira1guys at 2-Oct-07 20:01 wira1guys 2-Oct-07 20:01
 Nice hxkolo at 7-Jun-07 1:10 hxkolo 7-Jun-07 1:10
 Extend my Knowledge... Shi Jun at 14-May-07 17:22 Shi Jun 14-May-07 17:22
 Good place to start brahmma at 17-Nov-06 21:47 brahmma 17-Nov-06 21:47
 Re: Good place to start ant-dog at 11-Jan-08 5:38 ant-dog 11-Jan-08 5:38
 Re: Good place to start xlyz.os at 31-Oct-09 21:47 xlyz.os 31-Oct-09 21:47
 Good LeeSharp at 15-Jun-06 6:37 LeeSharp 15-Jun-06 6:37
 Very Nice vijayakumar_akm at 10-May-05 18:15 vijayakumar_akm 10-May-05 18:15
 nice article ,u can add how bitwise ops can be combined Anonymous at 20-Sep-04 1:07 Anonymous 20-Sep-04 1:07
 Can i use the declaration? mahmutarik at 22-Mar-04 4:32 mahmutarik 22-Mar-04 4:32
 error C2034: 'year' : type of bit field too small for number of bits Lee McKenzie at 13-Mar-04 4:50 Lee McKenzie 13-Mar-04 4:50
 Re: error C2034: 'year' : type of bit field too small for number of bits leekillestein at 17-Jun-04 12:52 leekillestein 17-Jun-04 12:52
 Re: error C2034: 'year' : type of bit field too small for number of bits John R. Shaw at 14-May-07 19:49 John R. Shaw 14-May-07 19:49
 Re: error C2034: 'year' : type of bit field too small for number of bits islandscape at 14-Oct-09 4:03 islandscape 14-Oct-09 4:03
 Re: error C2034: 'year' : type of bit field too small for number of bits Atul Khanduri at 17-Feb-14 6:37 Atul Khanduri 17-Feb-14 6:37
 Nice Article saurabhbajaj at 27-Nov-03 23:17 saurabhbajaj 27-Nov-03 23:17
 I Get something in this article AfxMessageBox at 8-Sep-03 4:44 AfxMessageBox 8-Sep-03 4:44
 TKS xhight at 2-Sep-03 9:16 xhight 2-Sep-03 9:16
 Re: TKS PJ Arends at 2-Sep-03 9:33 PJ Arends 2-Sep-03 9:33
 Great MessnerEW at 23-Jul-03 21:36 MessnerEW 23-Jul-03 21:36
 Re: Great manzoor10 at 12-Dec-08 5:12 manzoor10 12-Dec-08 5:12
 we did it again Jeremy Falcon at 25-Jun-03 6:33 Jeremy Falcon 25-Jun-03 6:33
 Last Visit: 31-Dec-99 19:00     Last Update: 26-Apr-15 17:35 Refresh 123 Next »