1. Bits and Bytes

2. BITWISE OPERATORS

3. Recall boolean logical operators in Java… boolean logical operators: &, |, ^ not: ! Show truth tables.

4. Recall boolean logical operators in Java… boolean logical operators: &, |, ^ not: ! Also conditional operators: &&, || – Difference between & and &&. – Differences between | and ||. – How can we demonstrate this?

5. RECALL BITWISE (INTEGER) OPERATORS

6. Bitwise integer operators HLL such as Java and C/C++ support many bitwise integer operators. Java: – bitwise:&, ^, |, -, ~ – shift: >, >>> (Note: C/C++ supports all of the above except >>>.)

7. Bitwise integer operators 1.Note: In Java and C/C++ as in Assembler, the bitwise operators can be applied to any of the integer data types (char, short, int, and long). 2.Note: All of the following examples employ 8-bit (byte) or 16-bit (short) integers but the ideas can and are extended to other integer data sizes. 3.Note: All of the following examples represent numbers in hex and binary for convenience. These rules apply to decimal numbers as well.

8. Bitwise & (and)

14. Bitwise | (or)

16. Bitwise ^ (xor)

18. ~ (1’s complement) Given 0x3a, what is ~0x3a? Given 0x0022, what is ~0x0022?

19. - (2’s complement) Given 0x3a, what is -0x3a? Given 0x0022, what is -0x0022?

20. Shift operators 1.Left shift: A << B 2.Signed right shift: A >> B(sign extension) 3.Unsigned right shift: A >>> B(zero extension) A = value to be shifted B = shift distance

21. Shift operators Left shift:A << B

22. Shift operators Signed right shift:A >> B(sign extension)

23. Shift operators Unsigned right shift:A >>> B(zero extension)

24. Examples 10 << 1 7 << 3 -1 << 2

25. Examples 10 << 120 7 << 356 -1 << 2-4

26. Examples 10 >> 1 27 >> 3 -50 >> 2

27. Examples 10 >> 150000 1010 >> 1 = 0000 0101 27 >> 330001 1011 >> 3 = 0000 0011 -50 >> 2-131100 1110 >> 2 = 1111 0011 What is 1111 0011? 0000 1100 + 1 = 0000 1101 = 13 So 1111 0011 = -13 Preserves sign.

28. Examples -50 >>> 2 0xff >>> 4

29. Examples -50 >>> 2511100 1110 >>> 2 = 0011 0011 0xff >>> 4151111 1111 >>> 4 = 0000 1111 Does not preserve sign.

30. Examples byte b = ~12; flags = flags & ~0xf; 10 & 7 if ((flags & 0xf) != 0)

31. Examples 10 | 7 flags = flags | 0xf; flags |= 0xa; 10 ^ 7 ~0x97

32. Examples int bits = 1; bits = bits << 1; bits = bits << 2; bits = bits >> 3;

33. Examples int b1 = 0x65; int b2 = 0xaf; int x = b1 & b2; int y = b1 ^ b2; int z = b1 | b2;

34. Problem 1 How can we determine if an int is odd or even?

35. Problem 2 Using bitwise operators, write a program in Java that converts an int from its current endian-ness to the other.

36. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// What does this indicate? // How do I indicate that student #7 took the quiz?

37. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz // How do I indicate that student #4 took the quiz?

38. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz // Oops! Student #7 didn’t take the quiz. Turn it off.

39. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off.

40. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0;// let’s give another quiz! …// indicate students that took quiz 2 // How can we determine if student #4 took both?

41. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0;// let’s give another quiz! …// indicate students that took quiz 2 // determine if student #4 took both final int s7 = 1<<7; if ( (quiz1&s7) != 0 && (quiz2&s7) != 0 ) { …//student 7 took both }

42. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0;// let’s give another quiz! …// indicate students that took quiz 2 // How can we print out all students that took either quiz 1 or quiz 2 // (but not both)?

43. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0;// let’s give another quiz! …// indicate students that took quiz 2 // determine whether a student took either quiz 1 or quiz 2 (but not both) int oneOrTheOther = quiz1 ^ quiz2; // How do we print the students out?

44. Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0;// indicate that no one took the quiz quiz1 |= 1 << 7;// indicate that student #7 took the quiz quiz1 |= 1 << 4;// indicate that student #4 took the quiz quiz1 &= ~(1 << 7);// Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0;// let’s give another quiz! …// indicate students that took quiz 2 // determine whether a student took either quiz 1 or quiz 2 (but not both) int oneOrTheOther = quiz1 ^ quiz2; // print out the students if ( (oneOrTheOther & 1) != 0 )System.out.println( “one” ); oneOrTheOther >>>= oneOrTheOther; if ( (oneOrTheOther & 1) != 0 )System.out.println( “two” ); …

45. END RECALL

46. IA32 BITWISE LOGICAL INSTRUCTIONS

47. AND

48. Operation: DEST ← DEST AND SRC; Flags Affected: – The OF and CF flags are cleared. – the SF, ZF, and PF flags are set according to the result. – The state of the AF flag is undefined.

49. NEG

50. NEG (2’s) Operation: IF DEST = 0 THEN CF ← 0 ELSE CF ← 1; FI; DEST ← – (DEST) Flags Affected: – The CF flag set to 0 if the source operand is 0; otherwise it is set to 1. – The OF, SF, ZF, AF, and PF flags are set according to the result.

51. NOT

52. NOT (1’s) Operation: DEST ← NOT DEST; Flags Affected: – None.

53. OR

54. Operation: DEST ← DEST OR SRC; Flags Affected: – The OF and CF flags are cleared. – The SF, ZF, and PF flags are set according to the result. – The state of the AF flag is undefined.

55. XOR

56. Operation: DEST ← DEST XOR SRC; Flags Affected: – The OF and CF flags are cleared. – The SF, ZF, and PF flags are set according to the result. – The state of the AF flag is undefined.

57. BIT SHIFT INSTRUCTIONS: ROTATE

58. Rotate left instructions

59. Rotate right instructions

60. Rotate

61. Rotate instructions notes (Recall CL is the CL register (recall ECX, CX, CH, CL).) “The count operand is an unsigned integer that can be an immediate or a value in the CL register. The processor restricts the count to a number between 0 and 31 by masking all the bits in the count operand except the 5 least significant bits.” from IA-32 Intel Architecture Software Developer’s Manual Volume 2B: Instruction Set Reference, N-Z

62. Rotate instruction notes Flags Affected: – The CF flag contains the value of the bit shifted into it. – The OF flag is affected only for singlebit rotates (see reference); it is undefined for multi- bit rotates. – The SF, ZF, AF, and PF flags are not affected.

63. BIT SHIFT INSTRUCTIONS: SHIFTS

64. Shifts Notes: – SAL and SHL are exactly the same. – SAR preserves the sign. – SHR always shift in a zero to the sign bit so neg will become pos.

65. Shifts Notes: – SAL and SHL are exactly the same.

66. Shifts Notes: – SAR preserves the sign. – SHR always shift in a zero to the sign bit so neg will become pos.

67. SHL/SAL (same) example

69. SHR example

70. SAR example (preserving sign)

71. Another SAR example (preserving sign)

72. Shift instructions notes Flags Affected: – The CF flag contains the value of the last bit shifted out of the destination operand; it is undefined for SHL and SHR instructions where the count is greater than or equal to the size (in bits) of the destination operand. – The OF flag is affected only for 1-bit shifts (see reference); otherwise, it is undefined. – The SF, ZF, and PF flags are set according to the result. – If the count is 0, the flags are not affected. – For a non-zero count, the AF flag is undefined.

73. SOME INTERESTING ALGORITHMS

74. Some interesting algorithms We can zero something by xor’ing it with itself.

75. Some interesting algorithms How does one swap a and b using a temporary variable? One can perform memory-less swap using xor x = x ^ y; y = x ^ y; x = x ^ y; Note: A^B == B^A. So: x ^= y; y ^= x; x ^= y; Does Java actually have such an operator?

76. Some interesting algorithms How does one swap a and b using a temporary variable? One can perform memory-less swap using xor x = x ^ y; y = x ^ y; x = x ^ y; Note: A^B == B^A. So: x ^= y; y ^= x; x ^= y; Does Java actually have such an operator? Try:x = 1011 y = 0110

77. Operator precedence The closer to the top of the table an operator appears, the higher its precedence. The closer to the top of the table an operator appears, the higher its precedence. Operators with higher precedence are evaluated before operators with relatively lower precedence. Operators with higher precedence are evaluated before operators with relatively lower precedence. Operators on the same line have equal precedence. When operators of equal precedence appear in the same expression, a rule must govern which is evaluated first. All binary operators except for the assignment operators are evaluated from left to right; assignment operators are evaluated right to left. Operators on the same line have equal precedence. When operators of equal precedence appear in the same expression, a rule must govern which is evaluated first. All binary operators except for the assignment operators are evaluated from left to right; assignment operators are evaluated right to left. http://download.oracle.com/javase/ tutorial/java/nutsandbolts/operators.html http://download.oracle.com/javase/ tutorial/java/nutsandbolts/operators.html

78. Some interesting algorithms We can implement modulo 0xff (or 0xf, 0xff, 0xfff, 0xffff, …) counters via: inceax andeax, 0FFh

79. Some interesting algorithms We can multiply by powers of 2 by shifting to the left. More generally, some multiplies can be replaced by shifts and adds. (These may be more efficient.) i*2 == i<<1 i*3 == (i<<1) + i; i*10 == (i<<3) + (i<<1) We can divide by powers of 2 by shifting to the right.

80. Timing operations in Java //use the following below to compare the following (do not worry about overflow): //i+i and the equivalent in terms of multiplication //i+i and the equivalent in terms of bit shift //i/2 and the equivalent in terms of bit shift //i*i*i and the equivalent in terms of Math.pow() class MyTime { public static void main ( String[] args ) { long start = System.currentTimeMillis(); for (int i=0; i<2000000000; i++) { //repeat 2 billion times //insert operation(s) to be repeated here } long stop = System.currentTimeMillis(); System.out.println( "elapsed time=" + (stop-start)/1000.0 + "s" ); } See also nanoTime().

81. MULTIPLICATION SANS MULTIPLY (SANS!? THAT FANCY!)

82. Multiplication sans multiply What if we don’t (our processor doesn’t) have a multiply instruction? – (Or, how might multiply be implemented in microcode?)

83. Recall: Multiplication (decimal)

84. Recall: Multiplication (binary)

85. It’s interesting to note that binary multiplication is a sequence of shifts and adds of the first term (depending on the bits in the second term. 110100 is missing here because the corresponding bit in the second terms is 0.

86. Recall: Multiplication (binary) Algorithm for r = a x b: r = 0 t = a loop over n bits: shift b one bit k to right if k was set then r += t shift t one bit to the left go to loop 110100 is missing here because the corresponding bit in the second terms is 0.

87. Advanced instructions BSWAP - byte swap BT - bit test XCHG - exchange register/memory with register – Atomic! BTS - bit test and set – Not atomic! LOCK – makes the next instruction atomic