[turbofan] Rename *Unless to *IfNot in the graph assembler.

Bug: v8:5267
Change-Id: I0a94b1c2df3d5d0871e36c0f688a5d7d88179a09
Reviewed-on: https://chromium-review.googlesource.com/640370
Commit-Queue: Jaroslav Sevcik <jarin@chromium.org>
Commit-Queue: Benedikt Meurer <bmeurer@chromium.org>
Reviewed-by: Benedikt Meurer <bmeurer@chromium.org>
Cr-Commit-Position: refs/heads/master@{#47660}

src/compiler/graph-assembler.cc

@@ -172,18 +172,18 @@ Node* GraphAssembler::DeoptimizeIf(DeoptimizeReason reason, Node* condition,
              frame_state, current_effect_, current_control_);
 }
 
-Node* GraphAssembler::DeoptimizeUnless(DeoptimizeKind kind,
-                                       DeoptimizeReason reason, Node* condition,
-                                       Node* frame_state) {
+Node* GraphAssembler::DeoptimizeIfNot(DeoptimizeKind kind,
+                                      DeoptimizeReason reason, Node* condition,
+                                      Node* frame_state) {
   return current_control_ = current_effect_ = graph()->NewNode(
              common()->DeoptimizeUnless(kind, reason), condition, frame_state,
              current_effect_, current_control_);
 }
 
-Node* GraphAssembler::DeoptimizeUnless(DeoptimizeReason reason, Node* condition,
-                                       Node* frame_state) {
-  return DeoptimizeUnless(DeoptimizeKind::kEager, reason, condition,
-                          frame_state);
+Node* GraphAssembler::DeoptimizeIfNot(DeoptimizeReason reason, Node* condition,
+                                      Node* frame_state) {
+  return DeoptimizeIfNot(DeoptimizeKind::kEager, reason, condition,
+                         frame_state);
 }
 
 void GraphAssembler::Branch(Node* condition, GraphAssemblerLabel<0u>* if_true,

src/compiler/graph-assembler.h

@@ -202,10 +202,10 @@ class GraphAssembler {
 
   Node* DeoptimizeIf(DeoptimizeReason reason, Node* condition,
                      Node* frame_state);
-  Node* DeoptimizeUnless(DeoptimizeKind kind, DeoptimizeReason reason,
-                         Node* condition, Node* frame_state);
-  Node* DeoptimizeUnless(DeoptimizeReason reason, Node* condition,
-                         Node* frame_state);
+  Node* DeoptimizeIfNot(DeoptimizeKind kind, DeoptimizeReason reason,
+                        Node* condition, Node* frame_state);
+  Node* DeoptimizeIfNot(DeoptimizeReason reason, Node* condition,
+                        Node* frame_state);
   template <typename... Args>
   Node* Call(const CallDescriptor* desc, Args... args);
   template <typename... Args>
@@ -227,10 +227,10 @@ class GraphAssembler {
   void GotoIf(Node* condition, GraphAssemblerLabel<sizeof...(Vars)>* label,
               Vars...);
 
-  // {GotoUnless(c, l)} is equivalent to {Branch(c, templ, l);Bind(templ)}.
+  // {GotoIfNot(c, l)} is equivalent to {Branch(c, templ, l);Bind(templ)}.
   template <typename... Vars>
-  void GotoUnless(Node* condition, GraphAssemblerLabel<sizeof...(Vars)>* label,
-                  Vars...);
+  void GotoIfNot(Node* condition, GraphAssemblerLabel<sizeof...(Vars)>* label,
+                 Vars...);
 
   // Extractors (should be only used when destructing/resetting the assembler).
   Node* ExtractCurrentControl();
@@ -353,9 +353,9 @@ void GraphAssembler::GotoIf(Node* condition,
 }
 
 template <typename... Vars>
-void GraphAssembler::GotoUnless(Node* condition,
-                                GraphAssemblerLabel<sizeof...(Vars)>* label,
-                                Vars... vars) {
+void GraphAssembler::GotoIfNot(Node* condition,
+                               GraphAssemblerLabel<sizeof...(Vars)>* label,
+                               Vars... vars) {
   BranchHint hint = label->IsDeferred() ? BranchHint::kTrue : BranchHint::kNone;
   Node* branch =
       graph()->NewNode(common()->Branch(hint), condition, current_control_);

src/compiler/memory-optimizer.cc

@@ -215,7 +215,7 @@ void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) {
                     machine()->Is64() ? __ ChangeInt32ToInt64(size) : size),
           limit);
 
-      __ GotoUnless(check, &call_runtime);
+      __ GotoIfNot(check, &call_runtime);
       __ Goto(&done, top);
 
       __ Bind(&call_runtime);
@@ -267,7 +267,7 @@ void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) {
 
     // Check if we can do bump pointer allocation here.
     Node* check = __ UintLessThan(new_top, limit);
-    __ GotoUnless(check, &call_runtime);
+    __ GotoIfNot(check, &call_runtime);
     __ Store(StoreRepresentation(MachineType::PointerRepresentation(),
                                  kNoWriteBarrier),
              top_address, __ IntPtrConstant(0), new_top);