Subzero: Add the "llvm2ice -ffunction-sections" argument.

src/IceIntrinsics.cpp

 //===- subzero/src/IceIntrinsics.cpp - Functions related to intrinsics ----===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file implements the Intrinsics utilities for matching and
@@ skipping 161 matching lines @@
     SqrtInit(IceType_f32, "f32"),
     SqrtInit(IceType_f64, "f64"),
 #undef SqrtInit
     { { { Intrinsics::Stacksave, true }, { IceType_i32 }, 1 }, "stacksave" },
     { { { Intrinsics::Stackrestore, true }, { IceType_void, IceType_i32 }, 2 },
       "stackrestore" },
     { { { Intrinsics::Trap, true }, { IceType_void }, 1 }, "trap" }
   };
 const size_t IceIntrinsicsTableSize = llvm::array_lengthof(IceIntrinsicsTable);
 
-} // end of namespace
+} // end of anonymous namespace
 
 Intrinsics::Intrinsics() {
   for (size_t I = 0; I < IceIntrinsicsTableSize; ++I) {
     const struct IceIntrinsicsEntry_ &Entry = IceIntrinsicsTable[I];
     assert(Entry.Info.NumTypes <= kMaxIntrinsicParameters);
     map.insert(std::make_pair(IceString(Entry.IntrinsicName), Entry.Info));
   }
 }
 
 Intrinsics::~Intrinsics() {}
 
 const Intrinsics::FullIntrinsicInfo *
 Intrinsics::find(const IceString &Name) const {
   IntrinsicMap::const_iterator it = map.find(Name);
   if (it == map.end())
     return NULL;
   return &it->second;
 }
 
 bool Intrinsics::VerifyMemoryOrder(uint64_t Order) {
   // There is only one memory ordering for atomics allowed right now.
   return Order == Intrinsics::MemoryOrderSequentiallyConsistent;
 }
 
 } // end of namespace Ice