Subzero: Validate phi instructions after CFG construction.

src/IceCfg.cpp

@@ -232,6 +232,10 @@ void Cfg::computeInOutEdges() {
     }
   }
   Nodes.resize(Dest);
+
+  TimerMarker T(TimerStack::TT_phiValidation, this);
+  for (CfgNode *Node : Nodes)
+    Node->validatePhis();
 }
 
 void Cfg::renumberInstructions() {

src/IceCfgNode.cpp

@@ -80,6 +80,46 @@ void CfgNode::computeSuccessors() {
   OutEdges = Insts.rbegin()->getTerminatorEdges();
 }
 
+// Validate each Phi instruction in the node with respect to control flow.  For
+// every phi argument, its label must appear in the predecessor list.  For each
+// predecessor, there must be a phi argument with that label.  We don't check
+// that phi arguments with the same label have the same value.
+void CfgNode::validatePhis() {
+  for (Inst &Instr : Phis) {
+    auto *Phi = llvm::cast<InstPhi>(&Instr);
+    // We do a simple O(N^2) algorithm to check for consistency.  Even so, it
+    // shows up as only about 0.2% of the total translation time.  But if
+    // necessary, we could improve the complexity by using a hash table to count
+    // how many times each node is referenced in the Phi instruction, and how
+    // many times each node is referenced in the incoming edge list, and compare
+    // the two for equality.
+    for (SizeT i = 0; i < Phi->getSrcSize(); ++i) {
+      CfgNode *Label = Phi->getLabel(i);
+      bool Found = false;
+      for (CfgNode *InNode : getInEdges()) {
+        if (InNode == Label) {
+          Found = true;
+          break;
+        }
+      }
+      if (!Found)
+        llvm::report_fatal_error("Phi error: label for bad incoming edge");
+    }
+    for (CfgNode *InNode : getInEdges()) {
+      bool Found = false;
+      for (SizeT i = 0; i < Phi->getSrcSize(); ++i) {
+        CfgNode *Label = Phi->getLabel(i);
+        if (InNode == Label) {
+          Found = true;
+          break;
+        }
+      }
+      if (!Found)
+        llvm::report_fatal_error("Phi error: missing label for incoming edge");
+    }
+  }
+}
+
 // This does part 1 of Phi lowering, by creating a new dest variable
 // for each Phi instruction, replacing the Phi instruction's dest with
 // that variable, and adding an explicit assignment of the old dest to

src/IceCfgNode.h

@@ -90,6 +90,7 @@ public:
   CfgNode *splitIncomingEdge(CfgNode *Pred, SizeT InEdgeIndex);
   /// @}
 
+  void validatePhis();
   void placePhiLoads();
   void placePhiStores();
   void deletePhis();

src/IceTimerTree.def

@@ -46,6 +46,7 @@
   X(parseModule)               \
   X(parseModuleValuesymtabs)   \
   X(parseTypes)                \
+  X(phiValidation)             \
   X(placePhiLoads)             \
   X(placePhiStores)            \
   X(regAlloc)                  \

tests_lit/llvm2ice_tests/Input/phi-invalid.tbc

+65535,8,2;
+1,1;
+65535,17,2;
+1,5;
+7,32;
+2;
+7,1;
+21,0,1;
+21,0,1,0;
+65534;
+8,3,0,0,0;
+8,4,0,0,0;
+65535,19,2;
+5,0;
+65534;
+65535,14,2;
+1,0,76,111,111,112,67,97,114,114,105,101,100,68,101,112;
+1,1,66,97,99,107,66,114,97,110,99,104;
+65534;
+65535,12,2;
+1,2;
+65535,11,2;
+1,0;
+4,2;
+4,4;
+65534;
+2,2,1,0;
+11,1;
+43,6,0;
+16,0,2,0,3,0;
+2,1,4,0;
+11,1;
+65534;
+65535,12,2;
+1,7;
+65535,11,2;
+1,2;
+4,3;
+65534;
+11,4;
+43,7,0;
+2,2,4294967293,0;
+11,6;
+43,8,0;
+2,3,4294967293,0;
+11,6;
+2,4,4294967295,0;
+11,6;
+2,5,5,0;
+11,1,5,5;
+2,1,6,0;
+11,2,3,6;
+10;
+65534;
+65534;

tests_lit/llvm2ice_tests/phi_invalid.test

+; Test that a bad phi instruction is caught.
+; https://code.google.com/p/nativeclient/issues/detail?id=4304
+
+RUN: %p2i --expect-fail --tbc -i %p/Input/phi-invalid.tbc --insts 2>&1 \
+RUN:        | FileCheck --check-prefix=BADPHI %s
+
+; BADPHI: Phi error: