Pops two ints off the stack. Shifts value1 right by the amount indicated in the five low bits of value2. The int result is then pushed back onto the stack. value1 is shifted arithmetically (preserving the sign extension).

This is the same as computing the expression:

x / 2^s

^{where s is value1 and x is value2.}

Example

; This is like the Java code:
;      int x;
;      x >>= 3;
;
iload_1          ; load local variable 1 onto stack
iconst_3         ; push the integer 3 onto the stack
ishr             ; arithmetic shift right
istore_1         ; store the result in local variable 1