/*
* reserved comment block
* DO NOT REMOVE OR ALTER!
*/
/* ====================================================================
* 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
* 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 apache@apache.org.
*
* 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
*/
/**
* Instances of this class give users a handle to the instructions contained in
* an InstructionList. Instruction objects may be used more than once within a
* list, this is useful because it saves memory and may be much faster.
*
* Within an InstructionList an InstructionHandle object is wrapped
* around all instructions, i.e., it implements a cell in a
* doubly-linked list. From the outside only the next and the
* previous instruction (handle) are accessible. One
* can traverse the list via an Enumeration returned by
* InstructionList.elements().
*
* @author <A HREF="mailto:markus.dahm@berlin.de">M. Dahm</A>
* @see Instruction
* @see BranchHandle
* @see InstructionList
*/
/**
* Replace current instruction contained in this handle.
* Old instruction is disposed using Instruction.dispose().
*/
if(i == null)
throw new ClassGenException("Assigning null to handle");
if(instruction != null)
instruction = i;
}
/**
* Temporarily swap the current instruction, without disturbing
* anything. Meant to be used by a debugger, implementing
* breakpoints. Current instruction is returned.
*/
instruction = i;
return oldInstruction;
}
setInstruction(i);
}
/** Factory method.
*/
return new InstructionHandle(i);
else {
ih.setInstruction(i);
return ih;
}
}
/**
* Called by InstructionList.setPositions when setting the position for every
* instruction. In the presence of variable length instructions `setPositions()'
* performs multiple passes over the instruction list to calculate the
* correct (byte) positions and offsets by calling this function.
*
* @param offset additional offset caused by preceding (variable length) instructions
* @param max_offset the maximum offset that may be caused by these instructions
* @return additional offset caused by possible change of this instruction's length
*/
i_position += offset;
return 0;
}
/** @return the position, i.e., the byte code offset of the contained
* instruction. This is accurate only after
* InstructionList.setPositions() has been called.
*/
/** Set the position, i.e., the byte code offset of the contained
* instruction.
*/
/** Overridden in BranchHandle
*/
protected void addHandle() {
ih_list = this;
}
/**
* Delete contents, i.e., remove user access and make handle reusable.
*/
void dispose() {
instruction = null;
i_position = -1;
attributes = null;
addHandle();
}
/** Remove all targeters, if any.
*/
public void removeAllTargeters() {
}
/**
* Denote this handle isn't referenced anymore by t.
*/
}
/**
* Denote this handle is being referenced by t.
*/
//if(!targeters.contains(t))
}
public boolean hasTargeters() {
}
/**
* @return null, if there are no targeters
*/
if(!hasTargeters())
return null;
return t;
}
/** @return a (verbose) string representation of the contained instruction.
*/
}
/** @return a string representation of the contained instruction.
*/
return toString(true);
}
/** Add an attribute to an instruction handle.
*
* @param attr the attribute to associate with this handle
*/
if(attributes == null)
}
/** Delete an attribute of an instruction handle.
*
* @param key the key object to retrieve the attribute
*/
if(attributes != null)
}
/** Get attribute of an instruction handle.
*
*/
if(attributes != null)
return null;
}
/** @return all attributes associated with this handle
*/
return attributes.values();
}
/** Convenience method, simply calls accept() on the contained instruction.
*
* @param v Visitor object
*/
instruction.accept(v);
}
}