public int countPossibleVals() {
		int count0 = 0;
		for (byte element : mask) {
			byte m = element;
			for (int j = 0; j < 8; j++) {
				if ((m & 0x80) == 0) {
					count0++;
				}
				m <<= 1;
			}
		}
		return 1 << count0;
	}
Counts the total number of known bits in the pattern

<p>
At a slightly lower level, counts the number of 1-bits in the mask.

@return the count
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/assembler/sleigh/sem/AssemblyPatternBlock.java