Mercurial > hg > graal-compiler
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/virtual/CommitAllocationNode.java @ 11881:da9db8331658
moved Canonicalizable and Simplifiable to the com.oracle.graal.graph project (GRAAL-506)
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Tue, 01 Oct 2013 20:38:25 +0200 |
parents | 9d341b6e47e5 |
children | 23ccaa863eda |
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.virtual; import java.util.*; import com.oracle.graal.api.meta.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.spi.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; @NodeInfo(nameTemplate = "Alloc {i#virtualObjects}") public final class CommitAllocationNode extends FixedWithNextNode implements VirtualizableAllocation, Lowerable, Simplifiable { @Input private final NodeInputList<VirtualObjectNode> virtualObjects = new NodeInputList<>(this); @Input private final NodeInputList<ValueNode> values = new NodeInputList<>(this); private List<int[]> locks = new ArrayList<>(); public CommitAllocationNode() { super(StampFactory.forVoid()); } public List<VirtualObjectNode> getVirtualObjects() { return virtualObjects; } public List<ValueNode> getValues() { return values; } public List<int[]> getLocks() { return locks; } @Override public boolean verify() { assertTrue(virtualObjects.size() == locks.size(), "lockCounts size doesn't match " + virtualObjects + ", " + locks); int valueCount = 0; for (VirtualObjectNode virtual : virtualObjects) { valueCount += virtual.entryCount(); } assertTrue(values.size() == valueCount, "values size doesn't match"); return super.verify(); } @Override public void lower(LoweringTool tool) { tool.getRuntime().lower(this, tool); } @Override public void afterClone(Node other) { locks = new ArrayList<>(((CommitAllocationNode) other).locks); } @Override public void virtualize(VirtualizerTool tool) { int pos = 0; for (int i = 0; i < virtualObjects.size(); i++) { VirtualObjectNode virtualObject = virtualObjects.get(i); int entryCount = virtualObject.entryCount(); tool.createVirtualObject(virtualObject, values.subList(pos, pos + entryCount).toArray(new ValueNode[entryCount]), locks.get(i)); pos += entryCount; } tool.delete(); } @Override public Map<Object, Object> getDebugProperties(Map<Object, Object> map) { Map<Object, Object> properties = super.getDebugProperties(map); int valuePos = 0; for (int objIndex = 0; objIndex < virtualObjects.size(); objIndex++) { VirtualObjectNode virtual = virtualObjects.get(objIndex); StringBuilder s = new StringBuilder(); s.append(MetaUtil.toJavaName(virtual.type(), false)).append("["); for (int i = 0; i < virtual.entryCount(); i++) { ValueNode value = values.get(valuePos++); s.append(i == 0 ? "" : ",").append(value == null ? "_" : value.toString(Verbosity.Id)); } s.append("]"); if (locks.get(objIndex).length > 0) { s.append(" locked(").append(Arrays.toString(locks.get(objIndex))).append(")"); } properties.put("object(" + virtual.toString(Verbosity.Id) + ")", s.toString()); } return properties; } @Override public void simplify(SimplifierTool tool) { boolean[] used = new boolean[virtualObjects.size()]; int usedCount = 0; for (Node usage : usages()) { AllocatedObjectNode addObject = (AllocatedObjectNode) usage; int index = virtualObjects.indexOf(addObject.getVirtualObject()); assert !used[index]; used[index] = true; usedCount++; } boolean progress; do { progress = false; int valuePos = 0; for (int objIndex = 0; objIndex < virtualObjects.size(); objIndex++) { VirtualObjectNode virtualObject = virtualObjects.get(objIndex); if (used[objIndex]) { for (int i = 0; i < virtualObject.entryCount(); i++) { int index = virtualObjects.indexOf(values.get(valuePos + i)); if (index != -1 && !used[index]) { progress = true; used[index] = true; usedCount++; } } } valuePos += virtualObject.entryCount(); } } while (progress); if (usedCount < virtualObjects.size()) { List<VirtualObjectNode> newVirtualObjects = new ArrayList<>(usedCount); List<int[]> newLocks = new ArrayList<>(usedCount); List<ValueNode> newValues = new ArrayList<>(); int valuePos = 0; for (int objIndex = 0; objIndex < virtualObjects.size(); objIndex++) { VirtualObjectNode virtualObject = virtualObjects.get(objIndex); if (used[objIndex]) { newVirtualObjects.add(virtualObject); newLocks.add(locks.get(objIndex)); newValues.addAll(values.subList(valuePos, valuePos + virtualObject.entryCount())); } valuePos += virtualObject.entryCount(); } virtualObjects.clear(); virtualObjects.addAll(newVirtualObjects); locks.clear(); locks.addAll(newLocks); values.clear(); values.addAll(newValues); } } }