Mercurial > hg > graal-compiler
view graal/com.oracle.max.graal.compiler/src/com/oracle/max/graal/compiler/ir/LoadIndexed.java @ 3211:76507b87dd25
global absolute probability analysis:
* added switch probability, changed branch probability from int to double
* absolute probability on each FixedNode computed by new ComputeProbabilityPhase
* loopFrequency estimation on LoopBegin nodes
* added GraalOptions.ProbabilityAnalysis flag: builds probability information and let inlining and escape analysis use it
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Tue, 12 Jul 2011 17:00:25 +0200 |
parents | 8044bdfaab06 |
children | d95db56f8deb |
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.max.graal.compiler.ir; import com.oracle.max.graal.compiler.debug.*; import com.oracle.max.graal.compiler.phases.*; import com.oracle.max.graal.compiler.phases.LoweringPhase.LoweringOp; import com.oracle.max.graal.graph.*; import com.sun.cri.ci.*; import com.sun.cri.ri.*; /** * The {@code LoadIndexed} instruction represents a read from an element of an array. */ public final class LoadIndexed extends AccessIndexed { private static final int INPUT_COUNT = 0; private static final int SUCCESSOR_COUNT = 0; /** * Creates a new LoadIndexed instruction. * @param array the instruction producing the array * @param index the instruction producing the index * @param length the instruction producing the length * @param elementKind the element type * @param graph */ public LoadIndexed(Value array, Value index, Value length, CiKind elementKind, Graph graph) { super(elementKind.stackKind(), array, index, length, elementKind, INPUT_COUNT, SUCCESSOR_COUNT, graph); } /** * Gets the declared type of this instruction's result. * @return the declared type */ @Override public RiType declaredType() { RiType arrayType = array().declaredType(); if (arrayType == null) { return null; } return arrayType.componentType(); } /** * Gets the exact type of this instruction's result. * @return the exact type */ @Override public RiType exactType() { RiType declared = declaredType(); return declared != null && declared.isResolved() ? declared.exactType() : null; } @Override public void accept(ValueVisitor v) { v.visitLoadIndexed(this); } @Override public void print(LogStream out) { out.print(array()).print('[').print(index()).print("] (").print(kind.typeChar).print(')'); } @Override public boolean needsStateAfter() { return false; } @SuppressWarnings("unchecked") @Override public <T extends Op> T lookup(Class<T> clazz) { if (clazz == LoweringOp.class) { return (T) LoweringPhase.DELEGATE_TO_RUNTIME; } return super.lookup(clazz); } @Override public Node copy(Graph into) { LoadIndexed x = new LoadIndexed(null, null, null, elementKind(), into); super.copyInto(x); return x; } }