[Atomics] Make Atomics.compareExchange a builtin using TF

src/compiler/machine-graph-verifier.cc

 // Copyright 2016 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/machine-graph-verifier.h"
 
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/machine-operator.h"
@@ skipping 134 matching lines @@
             break;
           }
           case IrOpcode::kAtomicStore:
             representation_vector_[node->id()] =
                 PromoteRepresentation(AtomicStoreRepresentationOf(node->op()));
             break;
           case IrOpcode::kAtomicExchange:
             representation_vector_[node->id()] = PromoteRepresentation(
                 AtomicExchangeRepresentationOf(node->op()).representation());
             break;
+          case IrOpcode::kAtomicCompareExchange:
+            representation_vector_[node->id()] = PromoteRepresentation(
+                AtomicCompareExchangeRepresentationOf(node->op())
+                    .representation());
+            break;
           case IrOpcode::kStore:
           case IrOpcode::kProtectedStore:
             representation_vector_[node->id()] = PromoteRepresentation(
                 StoreRepresentationOf(node->op()).representation());
             break;
           case IrOpcode::kCheckedStore:
             representation_vector_[node->id()] =
                 PromoteRepresentation(CheckedStoreRepresentationOf(node->op()));
             break;
           case IrOpcode::kUnalignedStore:
@@ skipping 286 matching lines @@
               case MachineRepresentation::kTagged:
               case MachineRepresentation::kTaggedPointer:
               case MachineRepresentation::kTaggedSigned:
                 CheckValueInputIsTagged(node, 2);
                 break;
               default:
                 CheckValueInputRepresentationIs(
                     node, 2, inferrer_->GetRepresentation(node));
             }
             break;
+          case IrOpcode::kAtomicCompareExchange:
+            CheckValueInputIsTaggedOrPointer(node, 0);
+            CheckValueInputRepresentationIs(
+                node, 1, MachineType::PointerRepresentation());
+            switch (inferrer_->GetRepresentation(node)) {
+              case MachineRepresentation::kTagged:
+              case MachineRepresentation::kTaggedPointer:
+              case MachineRepresentation::kTaggedSigned:
+                CheckValueInputIsTagged(node, 2);
+                CheckValueInputIsTagged(node, 3);
+                break;
+              default:
+                CheckValueInputRepresentationIs(
+                    node, 2, inferrer_->GetRepresentation(node));
+                CheckValueInputRepresentationIs(
+                    node, 3, inferrer_->GetRepresentation(node));
+            }
+            break;
           case IrOpcode::kPhi:
             switch (inferrer_->GetRepresentation(node)) {
               case MachineRepresentation::kTagged:
               case MachineRepresentation::kTaggedPointer:
               case MachineRepresentation::kTaggedSigned:
                 for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
                   CheckValueInputIsTagged(node, i);
                 }
                 break;
               case MachineRepresentation::kWord32:
@@ skipping 329 matching lines @@
   MachineRepresentationInferrer representation_inferrer(schedule, graph,
                                                         linkage, temp_zone);
   MachineRepresentationChecker checker(schedule, &representation_inferrer,
                                        is_stub, name);
   checker.Run();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8