Improve use of CfgLocalAllocator and introduce containers that use it.

src/IceLoopAnalyzer.h

 //===- subzero/src/IceLoopAnalyzer.h - Loop Analysis ------------*- C++ -*-===//
 //
 //                     The LLVM Compiler Infrastructure
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
@@ skipping 70 matching lines @@
 
   private:
     CfgNode *BB;
     NodeList::const_iterator Succ;
     IndexT Index;
     IndexT LowLink;
     bool OnStack;
     bool Deleted = false;
   };
 
-  using LoopNodeList = std::vector<LoopNode, CfgLocalAllocator<LoopNode>>;
-  using LoopNodePtrList =
-      std::vector<LoopNode *, CfgLocalAllocator<LoopNode *>>;
+  using LoopNodeList = CfgVector<LoopNode>;
+  using LoopNodePtrList = CfgVector<LoopNode *>;
 
   /// Process the node as part as part of Tarjan's algorithm and return either a
   /// node to recurse into or nullptr when the node has been fully processed.
   LoopNode *processNode(LoopNode &Node);
 
   /// The function to analyze for loops.
   Cfg *const Func;
   /// A list of decorated nodes in the same order as Func->getNodes() which
   /// means the node's index will also be valid in this list.
   LoopNodeList AllNodes;
   /// This is used as a replacement for the call stack.
   LoopNodePtrList WorkStack;
   /// Track which loop a node belongs to.
   LoopNodePtrList LoopStack;
   /// The index to assign to the next visited node.
   IndexT NextIndex = FirstDefinedIndex;
   /// The number of nodes which have been marked deleted. This is used to track
   /// when the iteration should end.
   LoopNodePtrList::size_type NumDeletedNodes = 0;
 };
 
 } // end of namespace Ice
 
 #endif //  SUBZERO_SRC_ICELOOPANALYZER_H