2.2. Bit patterns

Bit patterns are used to specify both filters and search patterns. Both of these terms are described later in this chapter.

A bit pattern is 16 bits that can have any of three states:

1

Requires a matching word to have a 1 in that bit position.

0

Requires a matching word to have a 0 in that bit position

x

Specifies that you don't care what the value of that bit position is.

Normally bit patterns come in sets. A bit pattern set can either represent a group of bit patterns, any of which can match to trigger the filter or search match, or a sequence, which requires a sequence of words in the buffer to sequentially match all the bit patterns in the set to trigger the filter or search.