Subzero: Add -Wshadow to the build.

src/IceRegAlloc.h

 //===- subzero/src/IceRegAlloc.h - Linear-scan reg. allocation --*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
@@ skipping 10 matching lines @@
 #include "IceTypes.h"
 
 namespace Ice {
 
 class LinearScan {
   LinearScan() = delete;
   LinearScan(const LinearScan &) = delete;
   LinearScan &operator=(const LinearScan &) = delete;
 
 public:
-  explicit LinearScan(Cfg *Func) : Func(Func) {}
+  explicit LinearScan(Cfg *MyFunc) : Func(MyFunc) {}
   void init(RegAllocKind Kind);
   void scan(const llvm::SmallBitVector &RegMask, bool Randomized);
-  void dump(Cfg *Func) const;
+  void dump() const;
 
 private:
   typedef std::vector<Variable *> OrderedRanges;
   typedef std::vector<Variable *> UnorderedRanges;
 
   void initForGlobal();
   void initForInfOnly();
   /// Move an item from the From set to the To set.  From[Index] is
   /// pushed onto the end of To[], then the item is efficiently removed
   /// from From[] by effectively swapping it with the last item in
@@ skipping 17 matching lines @@
   bool FindOverlap = false;
   // TODO(stichnot): We're not really using FindOverlap yet, but we
   // may want a flavor of register allocation where FindPreference is
   // useful but we didn't want to initialize VMetadata with VMK_All
   // and therefore we can't safely allow overlap.
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICEREGALLOC_H