1 /* 2 * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 package org.graalvm.compiler.loop.phases; 24 25 import org.graalvm.compiler.debug.Debug; 26 import org.graalvm.compiler.debug.Debug.Scope; 27 import org.graalvm.compiler.loop.LoopEx; 28 import org.graalvm.compiler.loop.LoopsData; 29 import org.graalvm.compiler.nodes.StructuredGraph; 30 import org.graalvm.compiler.phases.Phase; 31 32 public class ReassociateInvariantPhase extends Phase { 33 34 @SuppressWarnings("try") 35 @Override 36 protected void run(StructuredGraph graph) { 37 if (graph.hasLoops()) { 38 final LoopsData dataReassociate = new LoopsData(graph); 39 try (Scope s = Debug.scope("ReassociateInvariants")) { 40 for (LoopEx loop : dataReassociate.loops()) { 41 loop.reassociateInvariants(); 42 } 43 } catch (Throwable e) { 44 throw Debug.handle(e); 45 } 46 dataReassociate.deleteUnusedNodes(); 47 } 48 } 49 }