mirror of
https://github.com/2006-Scape/Parabot.git
synced 2026-07-03 00:37:55 +00:00
78 lines
2.5 KiB
Java
78 lines
2.5 KiB
Java
/***
|
|
* ASM: a very small and fast Java bytecode manipulation framework
|
|
* Copyright (c) 2000-2011 INRIA, France Telecom
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
|
* THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
package org.objectweb.asm.tree;
|
|
|
|
import java.util.Map;
|
|
|
|
import org.objectweb.asm.Label;
|
|
import org.objectweb.asm.MethodVisitor;
|
|
|
|
/**
|
|
* An {@link AbstractInsnNode} that encapsulates a {@link Label}.
|
|
*/
|
|
public class LabelNode extends AbstractInsnNode {
|
|
|
|
private Label label;
|
|
|
|
public LabelNode() {
|
|
super(-1);
|
|
}
|
|
|
|
public LabelNode(final Label label) {
|
|
super(-1);
|
|
this.label = label;
|
|
}
|
|
|
|
@Override
|
|
public int getType() {
|
|
return LABEL;
|
|
}
|
|
|
|
public Label getLabel() {
|
|
if (label == null) {
|
|
label = new Label();
|
|
}
|
|
return label;
|
|
}
|
|
|
|
@Override
|
|
public void accept(final MethodVisitor cv) {
|
|
cv.visitLabel(getLabel());
|
|
}
|
|
|
|
@Override
|
|
public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) {
|
|
return labels.get(this);
|
|
}
|
|
|
|
public void resetLabel() {
|
|
label = null;
|
|
}
|
|
} |