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; 034import io.ebean.enhance.asm.Type; 035 036import java.util.Map; 037 038/** 039 * A node that represents a MULTIANEWARRAY instruction. 040 * 041 * @author Eric Bruneton 042 */ 043public class MultiANewArrayInsnNode extends AbstractInsnNode { 044 045 /** 046 * An array type descriptor (see {@link Type}). 047 */ 048 public String desc; 049 050 /** 051 * Number of dimensions of the array to allocate. 052 */ 053 public int dims; 054 055 /** 056 * Constructs a new {@link MultiANewArrayInsnNode}. 057 * 058 * @param desc 059 * an array type descriptor (see {@link Type}). 060 * @param dims 061 * number of dimensions of the array to allocate. 062 */ 063 public MultiANewArrayInsnNode(final String desc, final int dims) { 064 super(Opcodes.MULTIANEWARRAY); 065 this.desc = desc; 066 this.dims = dims; 067 } 068 069 @Override 070 public int getType() { 071 return MULTIANEWARRAY_INSN; 072 } 073 074 @Override 075 public void accept(final MethodVisitor mv) { 076 mv.visitMultiANewArrayInsn(desc, dims); 077 acceptAnnotations(mv); 078 } 079 080 @Override 081 public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) { 082 return new MultiANewArrayInsnNode(desc, dims).cloneAnnotations(this); 083 } 084 085}