001/*
002 * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.loop.phases;
024
025import com.oracle.graal.debug.*;
026import com.oracle.graal.debug.Debug.*;
027
028import com.oracle.graal.loop.*;
029import com.oracle.graal.nodes.*;
030import com.oracle.graal.phases.*;
031
032public class ReassociateInvariantPhase extends Phase {
033
034    @Override
035    protected void run(StructuredGraph graph) {
036        if (graph.hasLoops()) {
037            final LoopsData dataReassociate = new LoopsData(graph);
038            try (Scope s = Debug.scope("ReassociateInvariants")) {
039                for (LoopEx loop : dataReassociate.loops()) {
040                    loop.reassociateInvariants();
041                }
042            } catch (Throwable e) {
043                throw Debug.handle(e);
044            }
045            dataReassociate.deleteUnusedNodes();
046        }
047    }
048}