01: /***
02: * ASM: a very small and fast Java bytecode manipulation framework
03: * Copyright (c) 2000-2005 INRIA, France Telecom
04: * All rights reserved.
05: *
06: * Redistribution and use in source and binary forms, with or without
07: * modification, are permitted provided that the following conditions
08: * are met:
09: * 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: */package com.tc.asm.tree;
30:
31: import java.util.Map;
32:
33: import com.tc.asm.Label;
34: import com.tc.asm.MethodVisitor;
35:
36: /**
37: * An {@link AbstractInsnNode} that encapsulates a {@link Label}.
38: */
39: public class LabelNode extends AbstractInsnNode {
40:
41: private Label label;
42:
43: public LabelNode() {
44: super (-1);
45: }
46:
47: public LabelNode(final Label label) {
48: super (-1);
49: this .label = label;
50: }
51:
52: public int getType() {
53: return LABEL;
54: }
55:
56: public Label getLabel() {
57: if (label == null) {
58: label = new Label();
59: }
60: return label;
61: }
62:
63: public void accept(final MethodVisitor cv) {
64: cv.visitLabel(getLabel());
65: }
66:
67: public AbstractInsnNode clone(final Map labels) {
68: return (LabelNode) labels.get(this);
69: }
70: }
|