Previous topic |
Next topic |
Contents |
Contact z/OS |
Library |
PDF
Binary self-defining term HLASM Language Reference SC26-4940-06 |
|
A binary self-defining term is written as an unsigned sequence of 1s and 0s enclosed in apostrophes and preceded by the letter B; for example, B'10001101'. A binary term can have up to 32 bits, not counting leading zero bits. This allows a range of values from -2,147,483,648 through 2,147,483,647. When used as an absolute term in an expression, a binary self-defining term has a negative value if the term is 32 bits long and the high-order bit is 1. Binary representation is used primarily in designating bit patterns of masks or in logical operations. The following shows a binary term used as a mask in a Test Under
Mask (TM) instruction. The contents of GAMMA are to be
tested, bit by bit, against the pattern of bits represented by the
binary term.
|
Copyright IBM Corporation 1990, 2014
|