Model exceptional edges from call nodes in TurboFan.

src/compiler/verifier.cc

 // Copyright 2014 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/verifier.h"
 
 #include <algorithm>
 #include <deque>
 #include <queue>
 #include <sstream>
@@ skipping 210 matching lines @@
       CheckNotTyped(node);
       break;
     }
     case IrOpcode::kIfTrue:
     case IrOpcode::kIfFalse:
       CHECK_EQ(IrOpcode::kBranch,
                NodeProperties::GetControlInput(node, 0)->opcode());
       // Type is empty.
       CheckNotTyped(node);
       break;
+    case IrOpcode::kIfException:
+    case IrOpcode::kIfSuccess: {
+      // IfException and IfSuccess continuation only on throwing nodes.
+      Node* input = NodeProperties::GetControlInput(node, 0);
+      CHECK(!input->op()->HasProperty(Operator::kNoThrow));
+      // Type is empty.
+      CheckNotTyped(node);
+      break;
+    }
     case IrOpcode::kSwitch: {
       // Switch uses are Case.
       std::vector<bool> uses;
       uses.resize(node->UseCount());
       for (auto use : node->uses()) {
         CHECK_EQ(IrOpcode::kCase, use->opcode());
         size_t const index = CaseIndexOf(use->op());
         CHECK_LT(index, uses.size());
         CHECK(!uses[index]);
         uses[index] = true;
@@ skipping 781 matching lines @@
     // Check inputs for all nodes in the block.
     for (size_t i = 0; i < block->NodeCount(); i++) {
       Node* node = block->NodeAt(i);
       CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
     }
   }
 }
 }
 }
 }  // namespace v8::internal::compiler