default void generateMpIntBinOp(JitCodeGenerator gen, MpIntJitType type,
			MethodVisitor mv) {
		/**
		 * We need temp locals to get things in order. Read in right operand, do the op as we pop
		 * each left op. Then push it all back.
		 * 
		 * No masking of the result is required, since both operands should already be masked, and
		 * the bitwise op cannot generate bits of more significance.
		 */
		// [lleg1,...,llegN,rleg1,rlegN] (N is least-significant leg)
		int legCount = type.legsAlloc();
		int firstIndex = gen.getAllocationModel().nextFreeLocal();
		Label start = new Label();
		Label end = new Label();
		mv.visitLabel(start);
		for (int i = 0; i < legCount; i++) {
			mv.visitLocalVariable("result" + i, Type.getDescriptor(int.class), null, start, end,
				firstIndex + i);
			mv.visitVarInsn(ISTORE, firstIndex + i);
			// NOTE: More significant legs have higher indices (reverse of stack)
		}
		for (int i = 0; i < legCount; i++) {
			// [lleg1,...,llegN:INT]
			mv.visitVarInsn(ILOAD, firstIndex + i);
			// [lleg1,...,llegN:INT,rlegN:INT]
			mv.visitInsn(intOpcode());
			// [lleg1,...,olegN:INT]
			mv.visitVarInsn(ISTORE, firstIndex + i);
			// [lleg1,...]
		}

		// Push it all back, in reverse order
		for (int i = 0; i < legCount; i++) {
			mv.visitVarInsn(ILOAD, firstIndex + legCount - i - 1);
		}
		mv.visitLabel(end);
	}
<b>WIP</b>: The implementation for multi-precision ints.

@param gen the code generator
@param type the type of each operand, including the reuslt
@param mv the visitor for the {@link JitCompiledPassage#run(int) run} method
Ghidra/Framework/Emulation/src/main/java/ghidra/pcode/emu/jit/gen/op/BitwiseBinOpGen.java