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