/*
* 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
*/
/**
* This class represents a local variable within a method. It contains its
* scope, name and type. The generated LocalVariable object can be obtained
* with getLocalVariable which needs the instruction list and the constant
* pool as parameters.
*
* @author <A HREF="mailto:markus.dahm@berlin.de">M. Dahm</A>
* @see LocalVariable
* @see MethodGen
*/
public class LocalVariableGen
{
private final int index;
/**
* Generate a local variable that with index `index'. Note that double and long
* variables need two indexs. Index indices have to be provided by the user.
*
* @param index index of local variable
* @param name its name
* @param type its type
* @param start from where the instruction is valid (null means from the start)
* @param end until where the instruction is valid (null means to the end)
*/
}
/**
* Get LocalVariable object.
*
* This relies on that the instruction list has already been dumped to byte code or
* or that the `setPositions' methods has been called for the instruction list.
*
* Note that for local variables whose scope end at the last
* instruction of the method's code, the JVM specification is ambiguous:
* both a start_pc+length ending at the last instruction and
* start_pc+length ending at first index beyond the end of the code are
* valid.
*
* @param il instruction list (byte code) which this variable belongs to
* @param cp constant pool
*/
if(length > 0)
}
/**
* Remove this from any known HashSet in which it might be registered.
*/
void notifyTargetChanging() {
// hashCode depends on 'index', 'start', and 'end'.
// Therefore before changing any of these values we
// need to unregister 'this' from any HashSet where
// this is registered, and then we need to add it
// back...
// Unregister 'this' from the HashSet held by 'start'.
// Since hashCode() is going to change we need to unregister
// 'this' both form 'start' and 'end'.
// Unregister 'this' from the HashSet held by 'end'.
}
}
/**
* Add back 'this' in all HashSet in which it should be registered.
**/
void notifyTargetChanged() {
// hashCode depends on 'index', 'start', and 'end'.
// Therefore before changing any of these values we
// need to unregister 'this' from any HashSet where
// this is registered, and then we need to add it
// back...
// Register 'this' in the HashSet held by start.
// Since hashCode() has changed we need to register
// 'this' again in 'end'.
// Add back 'this' in the HashSet held by 'end'.
}
}
// Call notifyTargetChanging *before* modifying this,
// as the code triggered by notifyTargetChanging
// depends on this pointing to the 'old' start.
// call notifyTargetChanged *after* modifying this,
// as the code triggered by notifyTargetChanged
// depends on this pointing to the 'new' start.
}
// call notifyTargetChanging *before* modifying this,
// as the code triggered by notifyTargetChanging
// depends on this pointing to the 'old' end.
// Unregister 'this' from the HashSet held by the 'old' end.
// call notifyTargetChanged *after* modifying this,
// as the code triggered by notifyTargetChanged
// depends on this pointing to the 'new' end.
// Register 'this' in the HashSet held by the 'new' end.
}
/**
* @param old_ih old target, either start or end
* @param new_ih new target
*/
boolean targeted = false;
targeted = true;
}
targeted = true;
}
if(!targeted)
end + "}");
}
/**
* @return true, if ih is target of this variable
*/
}
/**
* We consider two local variables to be equal, if they use the same index and
* are valid in the same range.
*/
if (o==this)
return true;
if(!(o instanceof LocalVariableGen))
return false;
LocalVariableGen l = (LocalVariableGen)o;
}
public int hashCode() {
int hash = 7;
return hash;
}
}
try {
return super.clone();
} catch(CloneNotSupportedException e) {
return null;
}
}
}