Mercurial > hg > truffle
view graal/GraalCompiler/src/com/sun/c1x/ir/AccessField.java @ 2703:42450f536d24
More cleanup towards separation of graphbuilding<>graph<>lirgeneration
author | Thomas Wuerthinger <thomas@wuerthinger.net> |
---|---|
date | Wed, 18 May 2011 17:04:47 +0200 |
parents | 569228710be8 |
children | bd17ac598c6e |
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.sun.c1x.ir; import java.lang.reflect.*; import com.oracle.graal.graph.*; import com.sun.cri.ci.*; import com.sun.cri.ri.*; /** * The base class of all instructions that access fields. */ public abstract class AccessField extends StateSplit { private static final int INPUT_COUNT = 1; private static final int INPUT_OBJECT = 0; private static final int SUCCESSOR_COUNT = 0; @Override protected int inputCount() { return super.inputCount() + INPUT_COUNT; } @Override protected int successorCount() { return super.successorCount() + SUCCESSOR_COUNT; } /** * The instruction that produces the receiver object of this field access (for instance field accesses). */ public Value object() { return (Value) inputs().get(super.inputCount() + INPUT_OBJECT); } public Value setObject(Value n) { return (Value) inputs().set(super.inputCount() + INPUT_OBJECT, n); } protected final RiField field; /** * Constructs a new access field object. * @param kind the result kind of the access * @param object the instruction producing the receiver object * @param field the compiler interface representation of the field * @param stateBefore the state before the field access * @param inputCount * @param successorCount * @param graph */ public AccessField(CiKind kind, Value object, RiField field, int inputCount, int successorCount, Graph graph) { super(kind, inputCount + INPUT_COUNT, successorCount + SUCCESSOR_COUNT, graph); assert object != null : "every field access must reference some object"; this.field = field; setObject(object); } /** * Gets the compiler interface field for this field access. * @return the compiler interface field for this field access */ public RiField field() { return field; } /** * Checks whether this field access is an access to a static field. * @return {@code true} if this field access is to a static field */ public boolean isStatic() { return Modifier.isStatic(field.accessFlags()); } /** * Checks whether the class of the field of this access is loaded. * @return {@code true} if the class is loaded */ public boolean isLoaded() { return field.isResolved(); } /** * Checks whether this field is declared volatile. * @return {@code true} if the field is resolved and declared volatile */ public boolean isVolatile() { return isLoaded() && Modifier.isVolatile(field.accessFlags()); } }