Home
last modified time | relevance | path

Searched refs:newIfNode (Results 1 – 14 of 14) sorted by relevance

/dports/sysutils/istio/istio-1.6.7/vendor/github.com/open-policy-agent/opa/vendor/github.com/mna/pigeon/examples/indentation/
H A Dindentation.peg21 … { return newIfNode(arg.(LogicalExpressionNode),s.(StatementsNode)) }
H A Dindentation_ast.go99 func newIfNode(arg LogicalExpressionNode, stmts StatementsNode) (IfNode, error) { func
H A Dindentation.go645 return newIfNode(arg.(LogicalExpressionNode), s.(StatementsNode))
/dports/graphics/ampasCTL/CTL-57b48a2/lib/IlmCtlSimd/
H A DCtlSimdLContext.h146 virtual IfNodePtr newIfNode
H A DCtlSimdLContext.cpp256 SimdLContext::newIfNode in newIfNode() function in Ctl::SimdLContext
/dports/graphics/ampasCTL/CTL-57b48a2/lib/IlmCtl/
H A DCtlLContext.h177 virtual IfNodePtr newIfNode
H A DCtlParser.cpp1390 return _lcontext.newIfNode in parseIfStatement()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java593 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
599 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
1002 …IfNode newIfNode = graph().add(new IfNode(result, trueBegin, falseBegin, trueSuccessorProbability)… in splitIfAtPhi() local
1003 newIfNode.setNodeSourcePosition(getNodeSourcePosition()); in splitIfAtPhi()
1005 ((FixedWithNextNode) end.predecessor()).setNext(newIfNode); in splitIfAtPhi()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java593 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
599 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
1002 …IfNode newIfNode = graph().add(new IfNode(result, trueBegin, falseBegin, trueSuccessorProbability)… in splitIfAtPhi() local
1003 newIfNode.setNodeSourcePosition(getNodeSourcePosition()); in splitIfAtPhi()
1005 ((FixedWithNextNode) end.predecessor()).setNext(newIfNode); in splitIfAtPhi()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java594 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
600 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
1093 …IfNode newIfNode = graph().add(new IfNode(result, trueBegin, falseBegin, trueSuccessorProbability)… in splitIfAtPhi() local
1094 newIfNode.setNodeSourcePosition(getNodeSourcePosition()); in splitIfAtPhi()
1096 ((FixedWithNextNode) end.predecessor()).setNext(newIfNode); in splitIfAtPhi()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java593 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
599 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
1061 …IfNode newIfNode = graph().add(new IfNode(result, trueBegin, falseBegin, trueSuccessorProbability)… in splitIfAtPhi() local
1062 newIfNode.setNodeSourcePosition(getNodeSourcePosition()); in splitIfAtPhi()
1064 ((FixedWithNextNode) end.predecessor()).setNext(newIfNode); in splitIfAtPhi()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java674 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
680 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
719 … IfNode newIfNode = graph().add(new IfNode(below, trueSucc, falseSucc, trueSuccessorProbability)); in checkForUnsignedCompare() local
725 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java674 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
680 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
719 … IfNode newIfNode = graph().add(new IfNode(below, trueSucc, falseSucc, trueSuccessorProbability)); in checkForUnsignedCompare() local
725 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DIfNode.java665 …IfNode newIfNode = graph().add(new IfNode(below, falseSucc, trueSucc, 1 - trueSuccessorProbability… in checkForUnsignedCompare() local
671 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()
710 … IfNode newIfNode = graph().add(new IfNode(below, trueSucc, falseSucc, trueSuccessorProbability)); in checkForUnsignedCompare() local
716 ifNode2.predecessor().replaceFirstSuccessor(ifNode2, newIfNode); in checkForUnsignedCompare()