1 // ASM: a very small and fast Java bytecode manipulation framework 2 // Copyright (c) 2000-2011 INRIA, France Telecom 3 // All rights reserved. 4 // 5 // Redistribution and use in source and binary forms, with or without 6 // modification, are permitted provided that the following conditions 7 // are met: 8 // 1. Redistributions of source code must retain the above copyright 9 // notice, this list of conditions and the following disclaimer. 10 // 2. Redistributions in binary form must reproduce the above copyright 11 // notice, this list of conditions and the following disclaimer in the 12 // documentation and/or other materials provided with the distribution. 13 // 3. Neither the name of the copyright holders nor the names of its 14 // contributors may be used to endorse or promote products derived from 15 // this software without specific prior written permission. 16 // 17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 18 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 21 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 25 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 26 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 27 // THE POSSIBILITY OF SUCH DAMAGE. 28 package org.objectweb.asm.tree; 29 30 import java.util.Map; 31 import org.objectweb.asm.Label; 32 import org.objectweb.asm.MethodVisitor; 33 34 /** An {@link AbstractInsnNode} that encapsulates a {@link Label}. */ 35 public class LabelNode extends AbstractInsnNode { 36 37 private Label value; 38 LabelNode()39 public LabelNode() { 40 super(-1); 41 } 42 LabelNode(final Label label)43 public LabelNode(final Label label) { 44 super(-1); 45 this.value = label; 46 } 47 48 @Override getType()49 public int getType() { 50 return LABEL; 51 } 52 53 /** 54 * Returns the label encapsulated by this node. A new label is created and associated with this 55 * node if it was created without an encapsulated label. 56 * 57 * @return the label encapsulated by this node. 58 */ getLabel()59 public Label getLabel() { 60 if (value == null) { 61 value = new Label(); 62 } 63 return value; 64 } 65 66 @Override accept(final MethodVisitor methodVisitor)67 public void accept(final MethodVisitor methodVisitor) { 68 methodVisitor.visitLabel(getLabel()); 69 } 70 71 @Override clone(final Map<LabelNode, LabelNode> clonedLabels)72 public AbstractInsnNode clone(final Map<LabelNode, LabelNode> clonedLabels) { 73 return clonedLabels.get(this); 74 } 75 resetLabel()76 public void resetLabel() { 77 value = null; 78 } 79 } 80