1 /*
   2  * Copyright (c) 2011, 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.nodes.spi;
  24 
  25 import org.graalvm.compiler.nodes.ValueNodeInterface;
  26 
  27 /**
  28  * Interface implemented by nodes that can replace themselves with lower level nodes during a phase
  29  * that transforms a graph to replace higher level nodes with lower level nodes.
  30  */
  31 public interface Lowerable extends ValueNodeInterface {
  32 
  33     /**
  34      * Expand this node into lower level nodes expressing the same semantics. If the introduced
  35      * nodes are themselves lowerable, they should be recursively lowered as part of this call.
  36      */
  37     void lower(LoweringTool tool);
  38 }