Mercurial > hg > truffle
view graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopFragmentWhole.java @ 20959:bb7e95512781
SL: fix calls produce less nodes now.
author | Christian Humer <christian.humer@gmail.com> |
---|---|
date | Tue, 14 Apr 2015 23:13:47 +0200 |
parents | f57d86eb036f |
children |
line wrap: on
line source
/* * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.loop; import com.oracle.graal.compiler.common.cfg.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.Graph.DuplicationReplacement; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.cfg.*; public class LoopFragmentWhole extends LoopFragment { public LoopFragmentWhole(LoopEx loop) { super(loop); } public LoopFragmentWhole(LoopFragmentWhole original) { super(null, original); } @Override public LoopFragmentWhole duplicate() { LoopFragmentWhole loopFragmentWhole = new LoopFragmentWhole(this); loopFragmentWhole.reify(); return loopFragmentWhole; } private void reify() { assert this.isDuplicate(); patchNodes(null); mergeEarlyExits(); } @Override public NodeBitMap nodes() { if (nodes == null) { Loop<Block> loop = loop().loop(); nodes = LoopFragment.computeNodes(graph(), LoopFragment.toHirBlocks(loop.getBlocks()), LoopFragment.toHirExits(loop.getExits())); } return nodes; } @Override protected ValueNode prim(ValueNode b) { return getDuplicatedNode(b); } @Override protected DuplicationReplacement getDuplicationReplacement() { final FixedNode entry = loop().entryPoint(); final Graph graph = this.graph(); return new DuplicationReplacement() { private EndNode endNode; @Override public Node replacement(Node o) { if (o == entry) { if (endNode == null) { endNode = graph.add(new EndNode()); } return endNode; } return o; } }; } public FixedNode entryPoint() { if (isDuplicate()) { LoopBeginNode newLoopBegin = getDuplicatedNode(original().loop().loopBegin()); return newLoopBegin.forwardEnd(); } return loop().entryPoint(); } @Override protected void finishDuplication() { // TODO (gd) ? } @Override public void insertBefore(LoopEx loop) { // TODO Auto-generated method stub } }