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.
/**
* Copyright (c) 2016 - 2018 Syncleus, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
Copyright (c) 2010-2011, Advanced Micro Devices, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of conditions and the following
disclaimer.
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.
Neither the name of the copyright holder 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 HOLDER 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.
If you use the software (in whole or in part), you shall adhere to all applicable U.S., European, and other export
laws, including but not limited to the U.S. Export Administration Regulations ("EAR"), (15 C.F.R. Sections 730 through
774), and E.U. Council Regulation (EC) No 1334/2000 of 22 June 2000. Further, pursuant to Section 740.6 of the EAR,
you hereby certify that, except pursuant to a license granted by the United States Department of Commerce Bureau of
Industry and Security or as otherwise permitted pursuant to a License Exception under the U.S. Export Administration
Regulations ("EAR"), you will not (1) export, re-export or release to a national of a country in Country Groups D:1,
E:1 or E:2 any restricted technology, software, or source code you receive hereunder, or (2) export to Country Groups
D:1, E:1 or E:2 the direct product of such technology or software, if such foreign produced direct product is subject
to national security controls as identified on the Commerce Control List (currently found in Supplement 1 to Part 774
of EAR). For the most current Country Group listings, or for additional information about the EAR or your obligations
under those regulations, please refer to the U.S. Bureau of Industry and Security's website at http://www.bis.doc.gov/.
*/
package com.aparapi.internal.instruction;
import java.util.LinkedList;
import com.aparapi.internal.instruction.InstructionSet.Branch;
import com.aparapi.internal.instruction.InstructionSet.ByteCode;
import com.aparapi.internal.instruction.InstructionSet.CompositeInstruction;
import com.aparapi.internal.instruction.InstructionSet.ConditionalBranch;
import com.aparapi.internal.model.MethodModel;
import com.aparapi.internal.reader.ByteReader;
/**
* Initially represents a single Java bytecode instruction.
*
* Instructions for each bytecode are created when the bytecode is first scanned.
*
* Each Instruction will contain a pc (program counter) offset from the beginning of the sequence of bytecode and the length will be determined by the information gleaned from InstructionSet.BYTECODE.
*
*
* @author gfrost
*
*/
public abstract class Instruction{
protected MethodModel method;
private final ByteCode byteCode;
private int length;
protected int pc;
abstract String getDescription();
private Instruction nextPC = null;
private Instruction prevPC = null;
private Instruction nextExpr = null;
private Instruction prevExpr = null;
private Instruction parentExpr = null;
private LinkedList forwardConditionalBranchTargets;
private LinkedList reverseConditionalBranchTargets;
private LinkedList forwardUnconditionalBranchTargets;
private LinkedList reverseUnconditionalBranchTargets;
private Instruction firstChild = null;
private Instruction lastChild = null;
public void setChildren(Instruction _firstChild, Instruction _lastChild) {
if ((_firstChild == null) || (_lastChild == null)) {
throw new IllegalStateException("null children added");
}
firstChild = _firstChild;
lastChild = _lastChild;
for (Instruction i = firstChild; i != lastChild; i = i.getNextExpr()) {
if (i == null) {
throw new IllegalStateException("child list broken ");
}
i.setParentExpr(this);
}
lastChild.setParentExpr(this);
}
public Instruction getPrevExpr() {
return (prevExpr);
}
public Instruction getNextExpr() {
return (nextExpr);
}
public void setNextPC(Instruction _nextByPC) {
nextPC = _nextByPC;
}
public void setPrevPC(Instruction _prevByPC) {
prevPC = _prevByPC;
}
public void setPrevExpr(Instruction _prevExpr) {
prevExpr = _prevExpr;
}
public void setNextExpr(Instruction _nextExpr) {
nextExpr = _nextExpr;
}
public Instruction toInstruction() {
return (this);
}
public int getLength() {
return (length);
}
public void setLength(int _length) {
length = _length;
}
public final ByteCode getByteCode() {
return (byteCode);
}
public int getThisPC() {
return (pc);
}
public int getStartPC() {
return (getFirstChild() == null ? pc : getFirstChild().getStartPC());
}
protected Instruction(MethodModel _method, ByteCode _byteCode, int _pc) {
method = _method;
pc = _pc;
byteCode = _byteCode;
}
protected Instruction(MethodModel _method, ByteCode _byteCode, ByteReader _byteReader, boolean _wide) {
this(_method, _byteCode, _wide ? _byteReader.getOffset() - 2 : _byteReader.getOffset() - 1);
}
// This works for most cases (except calls whose operand count depends upon the signature) so all call instructions therefore override this method
public int getStackConsumeCount() {
return (byteCode.getPop().getStackAdjust());
}
public int getStackProduceCount() {
return (byteCode.getPush().getStackAdjust());
}
public int getStackDelta() {
return (getStackProduceCount() - getStackConsumeCount());
}
@Override public String toString() {
return pc + " " + byteCode.getName();
}
public boolean isBranch() {
return (this instanceof Branch);
}
public int compareTo(Instruction _other) {
return (pc - _other.pc);
}
public boolean isAfter(Instruction _other) {
return (compareTo(_other) > 0);
}
public boolean isAfterOrEqual(Instruction _other) {
return (compareTo(_other) >= 0);
}
public boolean isBefore(Instruction _other) {
return (compareTo(_other) < 0);
}
public boolean isBeforeOrEqual(Instruction _other) {
return (compareTo(_other) <= 0);
}
public Instruction getFirstChild() {
return (firstChild);
}
public Instruction getLastChild() {
return (lastChild);
}
public Instruction getStartInstruction() {
return (getFirstChild() == null ? this : getFirstChild().getStartInstruction());
}
public MethodModel getMethod() {
return (method);
}
public Instruction getNextPC() {
return (nextPC);
}
public Instruction getPrevPC() {
return (prevPC);
}
public void setParentExpr(Instruction _parentExpr) {
parentExpr = _parentExpr;
}
public Instruction getParentExpr() {
return (parentExpr);
}
public Instruction getRootExpr() {
return (parentExpr == null ? this : parentExpr.getRootExpr());
}
public boolean isReverseConditionalBranchTarget() {
return ((reverseConditionalBranchTargets != null) && (reverseConditionalBranchTargets.size() > 0));
}
public boolean isForwardConditionalBranchTarget() {
return ((forwardConditionalBranchTargets != null) && (forwardConditionalBranchTargets.size() > 0));
}
public boolean isReverseUnconditionalBranchTarget() {
return ((reverseUnconditionalBranchTargets != null) && (reverseUnconditionalBranchTargets.size() > 0));
}
public boolean isForwardUnconditionalBranchTarget() {
return ((forwardUnconditionalBranchTargets != null) && (forwardUnconditionalBranchTargets.size() > 0));
}
public boolean isReverseBranchTarget() {
return (isReverseConditionalBranchTarget() || isReverseUnconditionalBranchTarget());
}
public boolean isConditionalBranchTarget() {
return (isReverseConditionalBranchTarget() || isForwardConditionalBranchTarget());
}
public boolean isUnconditionalBranchTarget() {
return (isReverseUnconditionalBranchTarget() || isForwardUnconditionalBranchTarget());
}
public boolean isForwardBranchTarget() {
return (isForwardConditionalBranchTarget() || isForwardUnconditionalBranchTarget());
}
public boolean isBranchTarget() {
return (isForwardBranchTarget() || isReverseBranchTarget());
}
public boolean producesStack() {
return ((this instanceof CompositeInstruction) || (getStackProduceCount() > 0));
}
public Instruction getReal() {
return (this);
}
public Branch asBranch() {
return ((Branch) this);
}
public boolean consumesStack() {
return (getStackConsumeCount() > 0);
}
public void addBranchTarget(Branch _branch) {
if (_branch.isReverse()) {
if (_branch.isConditional()) {
if (reverseConditionalBranchTargets == null) {
reverseConditionalBranchTargets = new LinkedList();
}
reverseConditionalBranchTargets.add((ConditionalBranch) _branch);
} else {
if (reverseUnconditionalBranchTargets == null) {
reverseUnconditionalBranchTargets = new LinkedList();
}
reverseUnconditionalBranchTargets.add(_branch);
}
} else {
if (_branch.isConditional()) {
if (forwardConditionalBranchTargets == null) {
forwardConditionalBranchTargets = new LinkedList();
}
forwardConditionalBranchTargets.add((ConditionalBranch) _branch);
} else {
if (forwardUnconditionalBranchTargets == null) {
forwardUnconditionalBranchTargets = new LinkedList();
}
forwardUnconditionalBranchTargets.add(_branch);
}
}
}
public void removeBranchTarget(Branch _branch) {
if (_branch.isReverse()) {
if (_branch.isConditional()) {
if (reverseConditionalBranchTargets != null) {
reverseConditionalBranchTargets.remove(_branch);
if (reverseConditionalBranchTargets.size() == 0) {
reverseConditionalBranchTargets = null;
}
}
} else {
if (reverseUnconditionalBranchTargets != null) {
reverseUnconditionalBranchTargets.remove(_branch);
if (reverseUnconditionalBranchTargets.size() == 0) {
reverseUnconditionalBranchTargets = null;
}
}
}
} else {
if (_branch.isConditional()) {
if (forwardConditionalBranchTargets != null) {
forwardConditionalBranchTargets.remove(_branch);
if (forwardConditionalBranchTargets.size() == 0) {
forwardConditionalBranchTargets = null;
}
}
} else {
if (forwardUnconditionalBranchTargets != null) {
forwardUnconditionalBranchTargets.remove(_branch);
if (forwardUnconditionalBranchTargets.size() == 0) {
forwardUnconditionalBranchTargets = null;
}
}
}
}
}
public LinkedList getForwardUnconditionalBranches() {
return (forwardUnconditionalBranchTargets);
}
public LinkedList getForwardConditionalBranches() {
return (forwardConditionalBranchTargets);
}
public LinkedList getReverseUnconditionalBranches() {
return (reverseUnconditionalBranchTargets);
}
public LinkedList getReverseConditionalBranches() {
return (reverseConditionalBranchTargets);
}
public boolean isForwardBranch() {
return (isBranch() && asBranch().isForward());
}
public boolean sameAs(Instruction _other) {
return (equals(_other));
}
}
