1 /* 2 * Copyright (c) 2011, 2016, 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 24 25 package org.graalvm.compiler.nodes.java; 26 27 import static org.graalvm.compiler.nodeinfo.InputType.Memory; 28 import static org.graalvm.compiler.nodeinfo.InputType.Value; 29 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_8; 30 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_8; 31 32 import org.graalvm.compiler.core.common.type.StampFactory; 33 import org.graalvm.compiler.graph.NodeClass; 34 import org.graalvm.compiler.nodeinfo.NodeInfo; 35 import org.graalvm.compiler.nodes.NodeView; 36 import org.graalvm.compiler.nodes.ValueNode; 37 import org.graalvm.compiler.nodes.memory.AbstractMemoryCheckpoint; 38 import org.graalvm.compiler.nodes.memory.MemoryCheckpoint; 39 import org.graalvm.compiler.nodes.spi.Lowerable; 40 import org.graalvm.compiler.nodes.spi.LoweringTool; 41 import jdk.internal.vm.compiler.word.LocationIdentity; 42 43 import jdk.vm.ci.meta.JavaKind; 44 45 /** 46 * Represents an atomic compare-and-swap operation. The result is a boolean that contains whether 47 * the value matched the expected value. 48 */ 49 @NodeInfo(allowedUsageTypes = {Value, Memory}, cycles = CYCLES_8, size = SIZE_8) 50 public final class UnsafeCompareAndSwapNode extends AbstractMemoryCheckpoint implements Lowerable, MemoryCheckpoint.Single { 51 52 public static final NodeClass<UnsafeCompareAndSwapNode> TYPE = NodeClass.create(UnsafeCompareAndSwapNode.class); 53 @Input ValueNode object; 54 @Input ValueNode offset; 55 @Input ValueNode expected; 56 @Input ValueNode newValue; 57 58 private final JavaKind valueKind; 59 private final LocationIdentity locationIdentity; 60 61 public UnsafeCompareAndSwapNode(ValueNode object, ValueNode offset, ValueNode expected, ValueNode newValue, JavaKind valueKind, LocationIdentity locationIdentity) { 62 super(TYPE, StampFactory.forKind(JavaKind.Boolean.getStackKind())); 63 assert expected.stamp(NodeView.DEFAULT).isCompatible(newValue.stamp(NodeView.DEFAULT)); 64 this.object = object; 65 this.offset = offset; 66 this.expected = expected; 67 this.newValue = newValue; 68 this.valueKind = valueKind; 69 this.locationIdentity = locationIdentity; 70 } 71 72 public ValueNode object() { 73 return object; 74 } 75 76 public ValueNode offset() { 77 return offset; 78 } 79 80 public ValueNode expected() { 81 return expected; 82 } 83 84 public ValueNode newValue() { 85 return newValue; 86 } 87 88 public JavaKind getValueKind() { 89 return valueKind; 90 } 91 92 @Override 93 public LocationIdentity getLocationIdentity() { 94 return locationIdentity; 95 } 96 97 @Override 98 public void lower(LoweringTool tool) { 99 tool.getLowerer().lower(this, tool); 100 } 101 }