Subzero: Fix MINIMAL build error.

src/IceLoopAnalyzer.cpp

 //===- subzero/src/IceLoopAnalyzer.cpp - Loop Analysis --------------------===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
@@ skipping 16 matching lines @@
 }
 
 NodeList::const_iterator LoopAnalyzer::LoopNode::successorsEnd() const {
   return BB->getOutEdges().end();
 }
 
 void LoopAnalyzer::LoopNode::incrementLoopNestDepth() {
   BB->incrementLoopNestDepth();
 }
 
-LoopAnalyzer::LoopAnalyzer(Cfg *Func) : Func(Func) {
+LoopAnalyzer::LoopAnalyzer(Cfg *Fn) : Func(Fn) {
   const NodeList &Nodes = Func->getNodes();
 
   // Allocate memory ahead of time. This is why a vector is used instead of a
   // stack which doesn't support reserving (or bulk erasure used below).
   AllNodes.reserve(Nodes.size());
   WorkStack.reserve(Nodes.size());
   LoopStack.reserve(Nodes.size());
 
   // Create the LoopNodes from the function's CFG
   for (CfgNode *Node : Nodes)
@@ skipping 85 matching lines @@
       ++NumDeletedNodes;
       LoopStack.erase(It.base() - 1, LoopStack.end());
       break;
     }
   }
 
   return nullptr;
 }
 
 } // end of namespace Ice