com.sun.org.apache.bcel.internal.generic.IFGT Java Examples
The following examples show how to use
com.sun.org.apache.bcel.internal.generic.IFGT.
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example #1
| Source File: Key.java From hottub with GNU General Public License v2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+STRING_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #2
| Source File: BooleanType.java From openjdk-jdk8u-backup with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #3
| Source File: ForEach.java From Bytecoder with Apache License 2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final List<Sort> sortObjects = new ArrayList<>();
Iterator<SyntaxTreeNode> children = elements();
while (children.hasNext()) {
final SyntaxTreeNode child = children.next();
if (child instanceof Sort) {
sortObjects.add((Sort)child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #4
| Source File: Key.java From Bytecoder with Apache License 2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+STRING_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #5
| Source File: IntType.java From Bytecoder with Apache License 2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #6
| Source File: BooleanType.java From Bytecoder with Apache License 2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #7
| Source File: ForEach.java From openjdk-jdk9 with GNU General Public License v2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final Vector sortObjects = new Vector();
Iterator<SyntaxTreeNode> children = elements();
while (children.hasNext()) {
final Object child = children.next();
if (child instanceof Sort) {
sortObjects.addElement(child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #8
| Source File: Key.java From openjdk-jdk9 with GNU General Public License v2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+STRING_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #9
| Source File: IntType.java From openjdk-jdk9 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #10
| Source File: BooleanType.java From openjdk-jdk9 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #11
| Source File: ForEach.java From hottub with GNU General Public License v2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final Vector sortObjects = new Vector();
Iterator<SyntaxTreeNode> children = elements();
while (children.hasNext()) {
final SyntaxTreeNode child = children.next();
if (child instanceof Sort) {
sortObjects.addElement(child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #12
| Source File: IntType.java From openjdk-jdk8u-backup with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #13
| Source File: IntType.java From hottub with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #14
| Source File: BooleanType.java From hottub with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #15
| Source File: ForEach.java From openjdk-8-source with GNU General Public License v2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final Vector sortObjects = new Vector();
Enumeration children = elements();
while (children.hasMoreElements()) {
final Object child = children.nextElement();
if (child instanceof Sort) {
sortObjects.addElement(child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #16
| Source File: Key.java From openjdk-8-source with GNU General Public License v2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+OBJECT_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #17
| Source File: IntType.java From openjdk-8-source with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #18
| Source File: BooleanType.java From openjdk-8-source with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #19
| Source File: ForEach.java From openjdk-8 with GNU General Public License v2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final Vector sortObjects = new Vector();
Enumeration children = elements();
while (children.hasMoreElements()) {
final Object child = children.nextElement();
if (child instanceof Sort) {
sortObjects.addElement(child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #20
| Source File: Key.java From openjdk-8 with GNU General Public License v2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+OBJECT_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #21
| Source File: IntType.java From openjdk-8 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #22
| Source File: BooleanType.java From openjdk-8 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #23
| Source File: BooleanType.java From jdk8u60 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #24
| Source File: Key.java From jdk1.8-source-analysis with Apache License 2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+STRING_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #25
| Source File: IntType.java From jdk1.8-source-analysis with Apache License 2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #26
| Source File: BooleanType.java From jdk1.8-source-analysis with Apache License 2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #27
| Source File: ForEach.java From TencentKona-8 with GNU General Public License v2.0 | 4 votes |
|
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
// Save current node and current iterator on the stack
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Collect sort objects associated with this instruction
final Vector sortObjects = new Vector();
Iterator<SyntaxTreeNode> children = elements();
while (children.hasNext()) {
final SyntaxTreeNode child = children.next();
if (child instanceof Sort) {
sortObjects.addElement(child);
}
}
if ((_type != null) && (_type instanceof ResultTreeType)) {
// Store existing DOM on stack - must be restored when loop is done
il.append(methodGen.loadDOM());
// <xsl:sort> cannot be applied to a result tree - issue warning
if (sortObjects.size() > 0) {
ErrorMsg msg = new ErrorMsg(ErrorMsg.RESULT_TREE_SORT_ERR,this);
getParser().reportError(WARNING, msg);
}
// Put the result tree on the stack (DOM)
_select.translate(classGen, methodGen);
// Get an iterator for the whole DOM - excluding the root node
_type.translateTo(classGen, methodGen, Type.NodeSet);
// Store the result tree as the default DOM
il.append(SWAP);
il.append(methodGen.storeDOM());
}
else {
// Compile node iterator
if (sortObjects.size() > 0) {
Sort.translateSortIterator(classGen, methodGen,
_select, sortObjects);
}
else {
_select.translate(classGen, methodGen);
}
if (_type instanceof ReferenceType == false) {
il.append(methodGen.loadContextNode());
il.append(methodGen.setStartNode());
}
}
// Overwrite current iterator
il.append(methodGen.storeIterator());
// Give local variables (if any) default values before starting loop
initializeVariables(classGen, methodGen);
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
translateContents(classGen, methodGen);
nextNode.setTarget(il.append(methodGen.loadIterator()));
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current DOM (if result tree was used instead for this loop)
if ((_type != null) && (_type instanceof ResultTreeType)) {
il.append(methodGen.storeDOM());
}
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
}
Example #28
| Source File: Key.java From TencentKona-8 with GNU General Public License v2.0 | 4 votes |
|
/**
* Gather all nodes that match the expression in the attribute "match"
* and add one (or more) entries in this key's index.
*/
public void translate(ClassGenerator classGen, MethodGenerator methodGen) {
final ConstantPoolGen cpg = classGen.getConstantPool();
final InstructionList il = methodGen.getInstructionList();
final int current = methodGen.getLocalIndex("current");
// AbstractTranslet.buildKeyIndex(name,node_id,value) => void
final int key = cpg.addMethodref(TRANSLET_CLASS,
"buildKeyIndex",
"("+STRING_SIG+"I"+STRING_SIG+")V");
// AbstractTranslet.SetKeyIndexDom(name, Dom) => void
final int keyDom = cpg.addMethodref(TRANSLET_CLASS,
"setKeyIndexDom",
"("+STRING_SIG+DOM_INTF_SIG+")V");
final int getNodeIdent = cpg.addInterfaceMethodref(DOM_INTF,
"getNodeIdent",
"(I)"+NODE_SIG);
// DOM.getAxisIterator(root) => NodeIterator
final int git = cpg.addInterfaceMethodref(DOM_INTF,
"getAxisIterator",
"(I)"+NODE_ITERATOR_SIG);
il.append(methodGen.loadCurrentNode());
il.append(methodGen.loadIterator());
// Get an iterator for all nodes in the DOM
il.append(methodGen.loadDOM());
il.append(new PUSH(cpg,Axis.DESCENDANT));
il.append(new INVOKEINTERFACE(git, 2));
// Reset the iterator to start with the root node
il.append(methodGen.loadCurrentNode());
il.append(methodGen.setStartNode());
il.append(methodGen.storeIterator());
// Loop for traversing all nodes in the DOM
final BranchHandle nextNode = il.append(new GOTO(null));
final InstructionHandle loop = il.append(NOP);
// Check if the current node matches the pattern in "match"
il.append(methodGen.loadCurrentNode());
_match.translate(classGen, methodGen);
_match.synthesize(classGen, methodGen); // Leaves 0 or 1 on stack
final BranchHandle skipNode = il.append(new IFEQ(null));
// If this is a node-set we must go through each node in the set
if (_useType instanceof NodeSetType) {
// Pass current node as parameter (we're indexing on that node)
il.append(methodGen.loadCurrentNode());
traverseNodeSet(classGen, methodGen, key);
}
else {
il.append(classGen.loadTranslet());
il.append(DUP);
il.append(new PUSH(cpg, _name.toString()));
il.append(DUP_X1);
il.append(methodGen.loadCurrentNode());
_use.translate(classGen, methodGen);
il.append(new INVOKEVIRTUAL(key));
il.append(methodGen.loadDOM());
il.append(new INVOKEVIRTUAL(keyDom));
}
// Get the next node from the iterator and do loop again...
final InstructionHandle skip = il.append(NOP);
il.append(methodGen.loadIterator());
il.append(methodGen.nextNode());
il.append(DUP);
il.append(methodGen.storeCurrentNode());
il.append(new IFGT(loop));
// Restore current node and current iterator from the stack
il.append(methodGen.storeIterator());
il.append(methodGen.storeCurrentNode());
nextNode.setTarget(skip);
skipNode.setTarget(skip);
}
Example #29
| Source File: IntType.java From TencentKona-8 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
Example #30
| Source File: BooleanType.java From TencentKona-8 with GNU General Public License v2.0 | 4 votes |
|
public BranchInstruction GT(boolean tozero) {
return tozero ? (BranchInstruction) new IFGT(null) :
(BranchInstruction) new IF_ICMPGT(null);
}
