public MaskedLong shiftRightLogical(long n) {
		if (n == 0) {
			return this;
		}
		// Zeros, not unknowns, fill in the left.
		long atleft = Long.MIN_VALUE >> (n - 1);
		return fromMaskAndValue((this.msk >>> n) | atleft, this.val >>> n);
	}
Shift the bits logically {@code n} positions right

<p>
This implements an unsigned shift.

@param n the number of positions.
@return the result.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/assembler/sleigh/expr/MaskedLong.java