Mercurial > hg > graal-compiler
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/extended/SwitchNode.java @ 5501:d89b20486d87
Renaming CiConstant => RiConstant.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 07 Jun 2012 17:07:05 +0200 |
parents | 141817e206d4 |
children | 764db9ada24f |
line wrap: on
line source
/* * Copyright (c) 2009, 2011, 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.nodes.extended; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.type.*; /** * The {@code SwitchNode} class is the base of both lookup and table switches. */ public abstract class SwitchNode extends ControlSplitNode { @Input private ValueNode value; public ValueNode value() { return value; } /** * Constructs a new Switch. * @param value the instruction that provides the value to be switched over * @param successors the list of successors of this switch * @param stateAfter the state after the switch */ public SwitchNode(ValueNode value, BeginNode[] successors, double[] probability) { super(StampFactory.forVoid(), successors, probability); this.value = value; } /** * Gets the number of cases that this switch covers (excluding the default case). * @return the number of cases */ public int numberOfCases() { return blockSuccessorCount() - 1; } }