truffle: graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/phases/TailDuplicationPhase.java annotate

author	Lukas Stadler <lukas.stadler@jku.at>
date	Fri, 06 Jul 2012 16:28:12 +0200
parents
children	fa6ed51ac198

rev	line source
5786 f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	1 /*
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	2 * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	4 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	5 * This code is free software; you can redistribute it and/or modify it
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	6 * under the terms of the GNU General Public License version 2 only, as
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	7 * published by the Free Software Foundation.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	8 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	9 * This code is distributed in the hope that it will be useful, but WITHOUT
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	12 * version 2 for more details (a copy is included in the LICENSE file that
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	13 * accompanied this code).
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	14 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	15 * You should have received a copy of the GNU General Public License version
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	16 * 2 along with this work; if not, write to the Free Software Foundation,
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	18 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	20 * or visit www.oracle.com if you need additional information or have any
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	21 * questions.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	22 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	23 package com.oracle.graal.compiler.phases;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	24
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	25 import java.util.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	26
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	27 import com.oracle.graal.compiler.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	28 import com.oracle.graal.debug.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	29 import com.oracle.graal.graph.Graph.DuplicationReplacement;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	30 import com.oracle.graal.graph.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	31 import com.oracle.graal.nodes.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	32 import com.oracle.graal.nodes.VirtualState.NodeClosure;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	33 import com.oracle.graal.nodes.extended.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	34 import com.oracle.graal.nodes.java.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	35 import com.oracle.graal.nodes.type.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	36 import com.oracle.graal.nodes.util.*;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	37
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	38 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	39 * This class is a phase that looks for opportunities for tail duplication. The static method
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	40 * {@link #tailDuplicate(MergeNode, TailDuplicationDecision, List)} can also be used to drive tail duplication from
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	41 * other places, e.g., inlining.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	42 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	43 public class TailDuplicationPhase extends Phase {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	44
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	45 /*
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	46 * Various metrics on the circumstances in which tail duplication was/wasn't performed.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	47 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	48 private static final DebugMetric metricDuplicationMonitors = Debug.metric("DuplicationMonitors");
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	49 private static final DebugMetric metricDuplicationEnd = Debug.metric("DuplicationEnd");
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	50 private static final DebugMetric metricDuplicationEndPerformed = Debug.metric("DuplicationEndPerformed");
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	51 private static final DebugMetric metricDuplicationOther = Debug.metric("DuplicationOther");
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	52 private static final DebugMetric metricDuplicationOtherPerformed = Debug.metric("DuplicationOtherPerformed");
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	53
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	54 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	55 * This interface is used by tail duplication to let clients decide if tail duplication should be performed.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	56 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	57 public interface TailDuplicationDecision {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	58
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	59 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	60 * Queries if tail duplication should be performed at the given merge. If this method returns true then the tail
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	61 * duplication will be performed, because all other checks have happened before.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	62 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	63 * @param merge The merge at which tail duplication can be performed.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	64 * @param fixedNodeCount The size of the set of fixed nodes that forms the base for the duplicated set of nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	65 * @return true if the tail duplication should be performed, false otherwise.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	66 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	67 boolean doTransform(MergeNode merge, int fixedNodeCount);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	68 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	69
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	70 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	71 * A tail duplication decision closure that employs the default algorithm: Check if there are any phis on the merge
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	72 * whose stamps improve and that have usages within the duplicated set of fixed nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	73 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	74 public static final TailDuplicationDecision DEFAULT_DECISION = new TailDuplicationDecision() {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	75
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	76 public boolean doTransform(MergeNode merge, int fixedNodeCount) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	77 HashSet<PhiNode> improvements = new HashSet<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	78 for (PhiNode phi : merge.phis()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	79 Stamp phiStamp = phi.stamp();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	80 for (ValueNode input : phi.values()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	81 if (!input.stamp().equals(phiStamp)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	82 improvements.add(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	83 break;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	84 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	85 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	86 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	87 if (improvements.isEmpty()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	88 return false;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	89 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	90 FixedNode current = merge;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	91 int opportunities = 0;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	92 while (current instanceof FixedWithNextNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	93 current = ((FixedWithNextNode) current).next();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	94 for (PhiNode phi : improvements) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	95 if (current.inputs().contains(phi)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	96 opportunities++;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	97 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	98 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	99 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	100 return opportunities > 0;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	101 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	102 };
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	103
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	104 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	105 * A tail duplication decision closure that always returns true.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	106 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	107 public static final TailDuplicationDecision TRUE_DECISION = new TailDuplicationDecision() {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	108
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	109 @Override
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	110 public boolean doTransform(MergeNode merge, int fixedNodeCount) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	111 return true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	112 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	113 };
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	114
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	115 @Override
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	116 protected void run(StructuredGraph graph) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	117 // A snapshot is taken here, so that new MergeNode instances aren't considered for tail duplication.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	118 for (MergeNode merge : graph.getNodes(MergeNode.class).snapshot()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	119 if (!(merge instanceof LoopBeginNode) && merge.probability() >= GraalOptions.TailDuplicationProbability) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	120 tailDuplicate(merge, DEFAULT_DECISION, null);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	121 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	122 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	123 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	124
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	125 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	126 * This method attempts to duplicate the tail of the given merge. The merge must not be a {@link LoopBeginNode}. If
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	127 * the merge is eligible for duplication (at least one fixed node in its tail, no {@link MonitorEnterNode}/
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	128 * {@link MonitorExitNode}, non-null {@link MergeNode#stateAfter()}) then the decision callback is used to determine
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	129 * whether the tail duplication should actually be performed. If replacements is non-null, then this list of
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	130 * {@link PiNode}s is used to replace one value per merge end.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	131 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	132 * @param merge The merge whose tail should be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	133 * @param decision A callback that can make the final decision if tail duplication should occur or not.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	134 * @param replacements A list of {@link PiNode}s, or null. If this list is non-null then its size needs to match the
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	135 * merge's end count. Each entry can either be null or a {@link PiNode}, and is used to replace
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	136 * {@link PiNode#object()} with the {@link PiNode} in the duplicated branch that corresponds to the
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	137 * entry.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	138 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	139 public static void tailDuplicate(MergeNode merge, TailDuplicationDecision decision, List<PiNode> replacements) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	140 assert !(merge instanceof LoopBeginNode);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	141 assert replacements == null \|\| replacements.size() == merge.forwardEndCount();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	142 FixedNode fixed = merge;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	143 int fixedCount = 0;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	144 boolean containsMonitor = false;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	145 while (fixed instanceof FixedWithNextNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	146 if (fixed instanceof MonitorEnterNode \|\| fixed instanceof MonitorExitNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	147 containsMonitor = true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	148 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	149 fixed = ((FixedWithNextNode) fixed).next();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	150 fixedCount++;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	151 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	152 if (containsMonitor) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	153 // cannot currently be handled
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	154 // TODO (ls) re-evaluate this limitation after changes to the lock representation and the LIR generator
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	155 metricDuplicationMonitors.increment();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	156 } else if (fixedCount > 1) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	157 if (fixed instanceof EndNode && !(((EndNode) fixed).merge() instanceof LoopBeginNode)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	158 metricDuplicationEnd.increment();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	159 if (decision.doTransform(merge, fixedCount)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	160 metricDuplicationEndPerformed.add(fixedCount);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	161 new DuplicationOperation(merge, replacements).duplicate();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	162 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	163 } else if (merge.stateAfter() != null) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	164 metricDuplicationOther.increment();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	165 if (decision.doTransform(merge, fixedCount)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	166 metricDuplicationOtherPerformed.add(fixedCount);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	167 new DuplicationOperation(merge, replacements).duplicate();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	168 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	169 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	170 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	171 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	172
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	173 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	174 * This class encapsulates one tail duplication operation on a specific {@link MergeNode}.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	175 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	176 private static class DuplicationOperation {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	177
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	178 private final MergeNode merge;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	179 private final StructuredGraph graph;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	180
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	181 private final HashMap<ValueNode, PhiNode> bottomPhis = new HashMap<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	182 private final List<PiNode> replacements;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	183
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	184 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	185 * Initializes the tail duplication operation without actually performing any work.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	186 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	187 * @param merge The merge whose tail should be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	188 * @param replacements A list of replacement {@link PiNode}s, or null. If this is non-null, then the size of the
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	189 * list needs to match the number of end nodes at the merge.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	190 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	191 public DuplicationOperation(MergeNode merge, List<PiNode> replacements) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	192 this.merge = merge;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	193 this.replacements = replacements;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	194 this.graph = (StructuredGraph) merge.graph();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	195 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	196
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	197 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	198 * Performs the actual tail duplication:
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	199 * <ul>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	200 * <li>Creates a new {@link ValueAnchorNode} at the beginning of the duplicated area, an transfers all
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	201 * dependencies from the merge to this anchor.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	202 * <li>Determines the set of fixed nodes to be duplicated.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	203 * <li>Creates the new merge at the bottom of the duplicated area.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	204 * <li>Determines the complete set of duplicated nodes.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	205 * <li>Performs the actual duplication.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	206 * </ul>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	207 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	208 private void duplicate() {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	209 Debug.log("tail duplication at merge %s in %s (prob %f)", merge, graph.method(), merge.probability());
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	210
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	211 ValueAnchorNode anchor = addValueAnchor();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	212
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	213 // determine the fixed nodes that should be duplicated (currently: all nodes up until the first control
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	214 // split, end node, deopt or return.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	215 ArrayList<FixedNode> fixedNodes = new ArrayList<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	216 FixedNode fixed = merge.next();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	217 FrameState stateAfter = merge.stateAfter();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	218 while (fixed instanceof FixedWithNextNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	219 fixedNodes.add(fixed);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	220 if (fixed instanceof StateSplit && ((StateSplit) fixed).stateAfter() != null) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	221 stateAfter = ((StateSplit) fixed).stateAfter();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	222 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	223 fixed = ((FixedWithNextNode) fixed).next();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	224 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	225
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	226 EndNode endAfter = createNewMerge(fixed, stateAfter);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	227 MergeNode mergeAfter = endAfter.merge();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	228 fixedNodes.add(endAfter);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	229 final HashSet<Node> duplicatedNodes = buildDuplicatedNodeSet(fixedNodes, stateAfter);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	230 mergeAfter.clearEnds();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	231 expandDuplicated(duplicatedNodes, mergeAfter);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	232
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	233 List<EndNode> endSnapshot = merge.forwardEnds().snapshot();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	234 List<PhiNode> phiSnapshot = merge.phis().snapshot();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	235
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	236 int endIndex = 0;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	237 for (final EndNode forwardEnd : merge.forwardEnds()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	238 Map<Node, Node> duplicates;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	239 if (replacements == null \|\| replacements.get(endIndex) == null) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	240 duplicates = graph.addDuplicates(duplicatedNodes, (DuplicationReplacement) null);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	241 } else {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	242 HashMap<Node, Node> replace = new HashMap<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	243 replace.put(replacements.get(endIndex).object(), replacements.get(endIndex));
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	244 duplicates = graph.addDuplicates(duplicatedNodes, replace);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	245 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	246 for (Map.Entry<ValueNode, PhiNode> phi : bottomPhis.entrySet()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	247 phi.getValue().initializeValueAt(merge.forwardEndIndex(forwardEnd), (ValueNode) duplicates.get(phi.getKey()));
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	248 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	249 mergeAfter.addForwardEnd((EndNode) duplicates.get(endAfter));
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	250
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	251 // re-wire the duplicated ValueAnchorNode to the predecessor of the corresponding EndNode
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	252 FixedNode anchorDuplicate = (FixedNode) duplicates.get(anchor);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	253 ((FixedWithNextNode) forwardEnd.predecessor()).setNext(anchorDuplicate);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	254 // move dependencies on the ValueAnchorNode to the previous BeginNode
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	255 BeginNode prevBegin = BeginNode.prevBegin(anchorDuplicate);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	256 anchorDuplicate.replaceAtUsages(prevBegin);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	257
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	258 // re-wire the phi duplicates to the correct input
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	259 for (PhiNode phi : phiSnapshot) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	260 PhiNode phiDuplicate = (PhiNode) duplicates.get(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	261 for (Node usage : phiDuplicate.usages()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	262 if (usage instanceof ValueNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	263 ((ValueNode) usage).dependencies().add(prevBegin);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	264 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	265 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	266 phiDuplicate.replaceAtUsages(phi.valueAt(forwardEnd));
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	267 phiDuplicate.safeDelete();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	268 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	269 endIndex++;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	270 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	271 GraphUtil.killCFG(merge);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	272 for (EndNode forwardEnd : endSnapshot) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	273 forwardEnd.safeDelete();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	274 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	275 for (PhiNode phi : phiSnapshot) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	276 // these phis should go away, but they still need to be anchored to a merge to be valid...
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	277 if (phi.isAlive()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	278 phi.setMerge(mergeAfter);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	279 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	280 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	281 Debug.dump(graph, "After tail duplication at %s", merge);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	282 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	283
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	284 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	285 * Inserts a new ValueAnchorNode after the merge and transfers all dependency-usages (not phis) to this
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	286 * ValueAnchorNode.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	287 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	288 * @return The new {@link ValueAnchorNode} that was created.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	289 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	290 private ValueAnchorNode addValueAnchor() {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	291 ValueAnchorNode anchor = graph.add(new ValueAnchorNode());
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	292 graph.addAfterFixed(merge, anchor);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	293 for (Node usage : merge.usages().snapshot()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	294 if (usage instanceof PhiNode && ((PhiNode) usage).merge() == merge) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	295 // nothing to do
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	296 } else {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	297 usage.replaceFirstInput(merge, anchor);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	298 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	299 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	300 return anchor;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	301 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	302
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	303 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	304 * Given a set of fixed nodes, this method determines the set of fixed and floating nodes that needs to be
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	305 * duplicated, i.e., all nodes that due to data flow and other dependencies needs to be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	306 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	307 * @param fixedNodes The set of fixed nodes that should be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	308 * @param stateAfter The frame state of the merge that follows the set of fixed nodes. All {@link ValueNode}s
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	309 * reachable from this state are considered to be reachable from within the duplicated set of nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	310 * @return The set of nodes that need to be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	311 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	312 private HashSet<Node> buildDuplicatedNodeSet(final ArrayList<FixedNode> fixedNodes, FrameState stateAfter) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	313 final NodeBitMap aboveBound = graph.createNodeBitMap();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	314 final NodeBitMap belowBound = graph.createNodeBitMap();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	315
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	316 final Deque<Node> worklist = new ArrayDeque<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	317
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	318 // Build the set of nodes that have (transitive) usages within the duplicatedNodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	319 // This is achieved by iterating all nodes that are reachable via inputs from the the fixed nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	320 aboveBound.markAll(fixedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	321 worklist.addAll(fixedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	322
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	323 // the phis at the original merge should always be duplicated
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	324 for (PhiNode phi : merge.phis()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	325 aboveBound.mark(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	326 worklist.add(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	327 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	328
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	329 NodeClosure<Node> aboveClosure = new NodeClosure<Node>() {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	330
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	331 @Override
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	332 public void apply(Node usage, Node node) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	333 if (node instanceof PhiNode && !fixedNodes.contains(((PhiNode) node).merge())) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	334 // stop iterating: phis belonging to outside merges are known to be outside.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	335 } else if (node instanceof FixedNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	336 // stop iterating: fixed nodes within the given set are traversal roots anyway, and all other
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	337 // fixed nodes are known to be outside.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	338 } else if (!aboveBound.isMarked(node)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	339 worklist.add(node);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	340 aboveBound.mark(node);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	341 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	342 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	343 };
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	344
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	345 if (stateAfter != null) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	346 stateAfter.applyToNonVirtual(aboveClosure);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	347 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	348 while (!worklist.isEmpty()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	349 Node current = worklist.remove();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	350 for (Node input : current.inputs()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	351 aboveClosure.apply(current, input);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	352 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	353 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	354
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	355 // Build the set of nodes that have (transitive) inputs within the duplicatedNodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	356 // This is achieved by iterating all nodes that are reachable via usages from the fixed nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	357 belowBound.markAll(fixedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	358 worklist.addAll(fixedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	359
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	360 // the phis at the original merge should always be duplicated
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	361 for (PhiNode phi : merge.phis()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	362 belowBound.mark(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	363 worklist.add(phi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	364 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	365
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	366 while (!worklist.isEmpty()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	367 Node current = worklist.remove();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	368 for (Node usage : current.usages()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	369 if (usage instanceof PhiNode && !fixedNodes.contains(((PhiNode) usage).merge())) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	370 // stop iterating: phis belonging to outside merges are known to be outside.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	371 } else if (usage instanceof FixedNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	372 // stop iterating: fixed nodes within the given set are traversal roots anyway, and all other
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	373 // fixed nodes are known to be outside.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	374 } else if (!belowBound.isMarked(usage)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	375 worklist.add(usage);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	376 belowBound.mark(usage);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	377 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	378 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	379 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	380
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	381 // build the intersection
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	382 belowBound.intersect(aboveBound);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	383 HashSet<Node> result = new HashSet<>();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	384 for (Node node : belowBound) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	385 result.add(node);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	386 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	387 return result;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	388 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	389
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	390 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	391 * Creates a new merge and end node construct at the end of the duplicated area. While it is useless in itself
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	392 * (merge with only one end) it simplifies the later duplication step.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	393 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	394 * @param successor The successor of the duplicated set of nodes, i.e., the first node that should not be
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	395 * duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	396 * @param stateAfterMerge The frame state that should be used for the merge.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	397 * @return The newly created end node.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	398 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	399 private EndNode createNewMerge(FixedNode successor, FrameState stateAfterMerge) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	400 MergeNode newBottomMerge = graph.add(new MergeNode());
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	401 newBottomMerge.setProbability(successor.probability());
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	402 EndNode newBottomEnd = graph.add(new EndNode());
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	403 newBottomMerge.addForwardEnd(newBottomEnd);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	404 newBottomMerge.setStateAfter(stateAfterMerge);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	405 ((FixedWithNextNode) successor.predecessor()).setNext(newBottomEnd);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	406 newBottomMerge.setNext(successor);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	407 return newBottomEnd;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	408 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	409
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	410 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	411 * Expands the set of nodes to be duplicated by looking at a number of conditions:
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	412 * <ul>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	413 * <li>{@link ValueNode}s that have usages on the outside need to be replaced with phis for the outside usages.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	414 * <li>Non-{@link ValueNode} nodes that have outside usages (frame states, virtual object states, ...) need to
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	415 * be cloned immediately for the outside usages.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	416 * <li>Nodes that have a {@link StampFactory#extension()} or {@link StampFactory#condition()} stamp need to be
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	417 * cloned immediately for the outside usages.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	418 * <li>Dependencies into the duplicated nodes will be replaced with dependencies on the merge.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	419 * <li>Outside non-{@link ValueNode}s with usages within the duplicated set of nodes need to also be duplicated.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	420 * </li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	421 * <li>Outside {@link ValueNode}s with {@link StampFactory#extension()} or {@link StampFactory#condition()}
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	422 * stamps that have usages within the duplicated set of nodes need to also be duplicated.</li>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	423 * </ul>
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	424 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	425 * @param duplicatedNodes The set of duplicated nodes that will be modified (expanded).
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	426 * @param newBottomMerge The merge that follows the duplicated set of nodes. It will be used for newly created
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	427 * phis and to as a target for dependencies that pointed into the duplicated set of nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	428 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	429 private void expandDuplicated(HashSet<Node> duplicatedNodes, MergeNode newBottomMerge) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	430 Deque<Node> worklist = new ArrayDeque<>(duplicatedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	431
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	432 while (!worklist.isEmpty()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	433 Node duplicated = worklist.remove();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	434 if (hasUsagesOutside(duplicated, duplicatedNodes)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	435 boolean cloneForOutsideUsages = false;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	436 if (duplicated instanceof ValueNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	437 ValueNode node = (ValueNode) duplicated;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	438 if (node.stamp() == StampFactory.dependency()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	439 // re-route dependencies to the merge
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	440 replaceUsagesOutside(node, newBottomMerge, duplicatedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	441 // TODO(ls) maybe introduce phis for dependencies
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	442 } else if (node.stamp() == StampFactory.extension() \|\| node.stamp() == StampFactory.condition()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	443 cloneForOutsideUsages = true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	444 } else {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	445 // introduce a new phi
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	446 PhiNode newPhi = bottomPhis.get(node);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	447 if (newPhi == null) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	448 newPhi = graph.add(new PhiNode(node.kind(), newBottomMerge));
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	449 bottomPhis.put(node, newPhi);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	450 newPhi.addInput(node);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	451 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	452 replaceUsagesOutside(node, newPhi, duplicatedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	453 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	454 } else {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	455 cloneForOutsideUsages = true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	456 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	457 if (cloneForOutsideUsages) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	458 // clone the offending node to the outside
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	459 Node newOutsideClone = duplicated.copyWithInputs();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	460 replaceUsagesOutside(duplicated, newOutsideClone, duplicatedNodes);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	461 // this might cause other nodes to have outside usages, we need to look at those as well
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	462 for (Node input : newOutsideClone.inputs()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	463 if (duplicatedNodes.contains(input)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	464 worklist.add(input);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	465 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	466 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	467 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	468 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	469 // check if this node has an input that lies outside and cannot be shared
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	470 for (Node input : duplicated.inputs()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	471 if (!duplicatedNodes.contains(input)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	472 boolean duplicateInput = false;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	473 if (input instanceof VirtualState) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	474 duplicateInput = true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	475 } else if (input instanceof ValueNode) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	476 Stamp inputStamp = ((ValueNode) input).stamp();
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	477 if (inputStamp == StampFactory.extension() \|\| inputStamp == StampFactory.condition()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	478 duplicateInput = true;
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	479 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	480 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	481 if (duplicateInput) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	482 duplicatedNodes.add(input);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	483 worklist.add(input);
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	484 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	485 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	486 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	487 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	488 }
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	489
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	490 /**
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	491 * Checks if the given node has usages that are not within the given set of nodes.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	492 *
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	493 * @param node The node whose usages are checked.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	494 * @param nodeSet The set of nodes that are considered to be "within".
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	495 * @return true if the given node has usages on the outside, false otherwise.
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	496 */
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	497 private static boolean hasUsagesOutside(Node node, HashSet<Node> nodeSet) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	498 for (Node usage : node.usages()) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	499 if (!nodeSet.contains(usage)) {
f69a406355b2 new tail duplication phase Lukas Stadler <lukas.stadler@jku.at> parents: diff changeset	500 return true;

5786

f69a406355b2 new tail duplication phase