CPSC 355 Lecture Notes - Lecture 11: Truth Table, Bitwise Operation, Bit Array

• School: University of Calgary
• Department: Computer Science
• Course: CPSC 355
• Professor: Leonard Manzara

Document Summary

Ands sets or clears m and z flags according to the result (v and c always. Cpsc 355 - lecture 11 oct 5th cleared: eg: test if bit 3 is set in x20 bitset: bitclear ands x19, x20, 0x8 b. eq bitclear. Tst is an alias for ands: form (64-bit): tst, alias for , eg: ands. Xn, xm xzr, xn, xm bitset bitclear x20, 0x8 tst b. eq bitclear. 1: form (64-bit): orr xd, xn, xm. 32-bit and immediate forms also exist: eg: set bits 4 and 5 in x19 mov x19, 0xaa mov x20, 0x30 orr x19, x19, x20. // 1011 1010: mov is an alias of orr. 0: form (64-bit): eor xd, xn, xm. 32-bit and immediate forms also exist: eg: toggle bits 0-3 in w20 mov w20, 0x55 eor w20, w20, 0x0f. Bit clear: is actually and not, truth table: a. 0: form (64-bit): bic xd, xn, xm.