A few more isAsCheapAsAMove.

[oota-llvm.git] / lib / Target / TargetMachineRegistry.cpp

diff --git a/lib/Target/TargetMachineRegistry.cpp b/lib/Target/TargetMachineRegistry.cpp
index 62c76bbc5bf14ed2c93e71a7b1ccf1b2880adad1..c1a4777c63140304bbc2b412e877d967697e5b2f 100644 (file)
--- a/lib/Target/TargetMachineRegistry.cpp
+++ b/lib/Target/TargetMachineRegistry.cpp
@@ -18,13 +18,6 @@
 #include <algorithm>
 using namespace llvm;
 
-template<> Registry<TargetMachine>::node *Registry<TargetMachine>::Head = 0;
-template<> Registry<TargetMachine>::node *Registry<TargetMachine>::Tail = 0;
-template<> Registry<TargetMachine>::listener *Registry<TargetMachine>::
-ListenerHead = 0;
-template<> Registry<TargetMachine>::listener *Registry<TargetMachine>::
-ListenerTail = 0;
-
 /// getClosestStaticTargetForModule - Given an LLVM module, pick the best target
 /// that is compatible with the module.  If no close target can be found, this
 /// returns null and sets the Error string to a reason.
@@ -42,7 +35,7 @@ TargetMachineRegistry::getClosestStaticTargetForModule(const Module &M,
   } else if (UsableTargets.size() == 1)
     return UsableTargets.back().second;
 
-  // Otherwise, take the best target, but make sure we don't have to equally
+  // Otherwise, take the best target, but make sure we don't have two equally
   // good best targets.
   std::sort(UsableTargets.begin(), UsableTargets.end());
   if (UsableTargets.back().first ==UsableTargets[UsableTargets.size()-2].first){