001/***
002 * ASM: a very small and fast Java bytecode manipulation framework
003 * Copyright (c) 2000-2011 INRIA, France Telecom
004 * All rights reserved.
005 *
006 * Redistribution and use in source and binary forms, with or without
007 * modification, are permitted provided that the following conditions
008 * are met:
009 * 1. Redistributions of source code must retain the above copyright
010 *    notice, this list of conditions and the following disclaimer.
011 * 2. Redistributions in binary form must reproduce the above copyright
012 *    notice, this list of conditions and the following disclaimer in the
013 *    documentation and/or other materials provided with the distribution.
014 * 3. Neither the name of the copyright holders nor the names of its
015 *    contributors may be used to endorse or promote products derived from
016 *    this software without specific prior written permission.
017 *
018 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
019 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
020 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
021 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
022 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
023 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
024 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
025 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
026 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
027 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
028 * THE POSSIBILITY OF SUCH DAMAGE.
029 */
030package io.ebean.enhance.asm.tree;
031
032import io.ebean.enhance.asm.MethodVisitor;
033import io.ebean.enhance.asm.Opcodes;
034
035import java.util.Map;
036
037/**
038 * A node that represents an IINC instruction.
039 * 
040 * @author Eric Bruneton
041 */
042public class IincInsnNode extends AbstractInsnNode {
043
044    /**
045     * Index of the local variable to be incremented.
046     */
047    public int var;
048
049    /**
050     * Amount to increment the local variable by.
051     */
052    public int incr;
053
054    /**
055     * Constructs a new {@link IincInsnNode}.
056     * 
057     * @param var
058     *            index of the local variable to be incremented.
059     * @param incr
060     *            increment amount to increment the local variable by.
061     */
062    public IincInsnNode(final int var, final int incr) {
063        super(Opcodes.IINC);
064        this.var = var;
065        this.incr = incr;
066    }
067
068    @Override
069    public int getType() {
070        return IINC_INSN;
071    }
072
073    @Override
074    public void accept(final MethodVisitor mv) {
075        mv.visitIincInsn(var, incr);
076        acceptAnnotations(mv);
077    }
078
079    @Override
080    public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) {
081        return new IincInsnNode(var, incr).cloneAnnotations(this);
082    }
083}