001/*
002 * Copyright (c) 2011, 2015, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.nodes.java;
024
025import jdk.internal.jvmci.meta.*;
026
027import com.oracle.graal.compiler.common.type.*;
028import com.oracle.graal.graph.*;
029import com.oracle.graal.nodeinfo.*;
030import com.oracle.graal.nodes.*;
031import com.oracle.graal.nodes.memory.*;
032import com.oracle.graal.nodes.spi.*;
033
034/**
035 * Represents an atomic compare-and-swap operation The result is a boolean that contains whether the
036 * value matched the expected value.
037 */
038@NodeInfo(allowedUsageTypes = {InputType.Memory})
039public final class CompareAndSwapNode extends AbstractMemoryCheckpoint implements Lowerable, MemoryCheckpoint.Single {
040
041    public static final NodeClass<CompareAndSwapNode> TYPE = NodeClass.create(CompareAndSwapNode.class);
042    @Input ValueNode object;
043    @Input ValueNode offset;
044    @Input ValueNode expected;
045    @Input ValueNode newValue;
046
047    protected final Kind valueKind;
048    protected final LocationIdentity locationIdentity;
049
050    public CompareAndSwapNode(ValueNode object, ValueNode offset, ValueNode expected, ValueNode newValue, Kind valueKind, LocationIdentity locationIdentity) {
051        super(TYPE, StampFactory.forKind(Kind.Boolean.getStackKind()));
052        assert expected.stamp().isCompatible(newValue.stamp());
053        this.object = object;
054        this.offset = offset;
055        this.expected = expected;
056        this.newValue = newValue;
057        this.valueKind = valueKind;
058        this.locationIdentity = locationIdentity;
059    }
060
061    public ValueNode object() {
062        return object;
063    }
064
065    public ValueNode offset() {
066        return offset;
067    }
068
069    public ValueNode expected() {
070        return expected;
071    }
072
073    public ValueNode newValue() {
074        return newValue;
075    }
076
077    public Kind getValueKind() {
078        return valueKind;
079    }
080
081    @Override
082    public LocationIdentity getLocationIdentity() {
083        return locationIdentity;
084    }
085
086    @Override
087    public void lower(LoweringTool tool) {
088        tool.getLowerer().lower(this, tool);
089    }
090}