lshl : long integer shift left : index : visitInsn()

Description

Pops a long integer and an int from the stack. Shifts value2 (the long integer) left by the amount indicated in the low six bits of value1 (an int). The long integer result is then pushed back onto the stack.

This is the same as computing the expression:

x * 2<sup>s

where s is value1 and x is value2.</sup>

Example

; This is like the Java code:
;      long x;
;      x <<= 3;
;
lload_1          ; load long integer in local variable 1 onto stack
iconst_3         ; push the integer 3 onto the stack
lshl             ; shift left
lstore_1         ; store the long result in local variable 1

See also

ishl ishr iushr lshr lushr iand land ior lor ixor lxor

Stack

Before	After
value1	result-word1
value2-word1	result-word2
value2-word2	...
...	...

Bytecode

Type	Description
u1	lshl opcode = 0x79 (121)