static byte[] bitShiftRightByteArray(byte[] input, int amount) {
		byte[] newMask = new byte[input.length];
		for (int i = input.length - 1; i >= 0; i--) {
			// Add the lower bits of the next byte to the previously processed byte
			if (i < input.length - 1) {
				newMask[i + 1] = (byte) (newMask[i + 1] | ((input[i] << (8 - amount) & 0xff)));
			}

			// Shift down the bits of this byte
			newMask[i] = (byte) (((input[i]) & 0xff) >> amount);
		}
		return newMask;
	}
Set all bits that are known (1 in mask) in {@code other} to unknown.

<p>
Other must have the same or shorter length than this.

@param other the other pattern block whose mask bits are examined
@return a copy of this pattern with mask bits set to unknown
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/assembler/sleigh/sem/AssemblyPatternBlock.java