Some notes on implementing bit-wise operations in CIVL:

Read C11 6.2.6 on Representation of Types, esp. integer types.

6.5.7 Bitwise shift operators

The integer promotions are performed on each of the operands.
The type of the result is that of the promoted left operand.
If the value of the right operand is negative or is
greater than or equal to the width of the promoted left operand,
the behavior is undefined.

The result of E1 << E2 is E1 left-shifted E2 bit positions;
vacated bits are filled with zeros. If E1 has an unsigned type,
the value of the result is E1 * 2^E2, reduced modulo one more
than the maximum value representable in the result type.
If E1 has a signed type and nonnegative value, and E1 * 2^E2
is representable in the result type, then that is the resulting
value; otherwise, the behavior is undefined.

The result of E1 >> E2 is E1 right-shifted E2 bit positions.
If E1 has an unsigned type or if E1 has a signed type and a
nonnegative value, the value of the result is the integral
part of the quotient of E1 / 2E2. If E1 has a signed type
and a negative value, the resulting value is
implementation-defined.

See 6.5.10--12 for the bit-wise and, inclusive or, exclusive or
operations.   But all it says is that these are the bit-wise
operations.