Java Virtual Machine (Java Series)

iadd

iadd Stack

Pops two integers from the operand stack, adds them, and pushes the integer result back onto the stack. On overflow, iadd produces a result whose low order bits are correct, but whose sign bit may be incorrect.

Example

bipush 5 ; push first int bipush 4 ; push second int iadd ; add integers ; the top of the stack now ; contains the integer 9

Bytecode

ladd, fadd, dadd

Java Virtual Machine, by Jon Meyer and Troy Downing, O'Reilly Associates