Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package org.aspectj.apache.bcel.generic;
/* ====================================================================
* The Apache Software License, Version 1.1
*
* Copyright (c) 2001 The Apache Software Foundation. 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. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Apache" and "Apache Software Foundation" and
* "Apache BCEL" must not be used to endorse or promote products
* derived from this software without prior written permission. For
* written permission, please contact [email protected].
*
* 5. Products derived from this software may not be called "Apache",
* "Apache BCEL", nor may "Apache" appear in their name, without
* prior written permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 APACHE SOFTWARE FOUNDATION OR
* ITS 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.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation. For more
* information on the Apache Software Foundation, please see
* .
*/
import java.io.DataOutputStream;
import java.io.IOException;
import org.aspectj.apache.bcel.Constants;
import org.aspectj.apache.bcel.classfile.ConstantPool;
/**
* RET - Return from subroutine
*
*
* Stack: ..., -> ..., address
*
*
* @version $Id: RET.java,v 1.5 2009/10/05 17:35:36 aclement Exp $
* @author M. Dahm
*/
public class RET extends Instruction {
private boolean wide;
private int index; // index to local variable containing the return address
public RET(int index, boolean wide) {
super(Constants.RET);
this.index = index;
this.wide = wide;
// this.wide = index > org.aspectj.apache.bcel.Constants.MAX_BYTE;
}
public void dump(DataOutputStream out) throws IOException {
if (wide) {
out.writeByte(Constants.WIDE);
}
out.writeByte(opcode);
if (wide) {
out.writeShort(index);
} else {
out.writeByte(index);
}
}
public int getLength() {
if (wide) {
return 4;
} else {
return 2;
}
}
public final int getIndex() {
return index;
}
public final void setIndex(int index) {
this.index = index;
this.wide = index > Constants.MAX_BYTE;
}
public String toString(boolean verbose) {
return super.toString(verbose) + " " + index;
}
public Type getType(ConstantPool cp) {
return ReturnaddressType.NO_TARGET;
}
public boolean equals(Object other) {
if (!(other instanceof RET)) {
return false;
}
RET o = (RET) other;
return o.opcode == opcode && o.index == index;
}
public int hashCode() {
return opcode * 37 + index;
}
}