diff --git a/lib/Target/X86/X86ISelDAGToDAG.cpp b/lib/Target/X86/X86ISelDAGToDAG.cpp
index 7834f6e..b76d3e2 100644
--- a/lib/Target/X86/X86ISelDAGToDAG.cpp
+++ b/lib/Target/X86/X86ISelDAGToDAG.cpp
@@ -314,7 +314,7 @@
 
 
 bool X86DAGToDAGISel::CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root) const {
-  if (FastISel) return false;
+  if (Fast) return false;
 
   // If U use can somehow reach N through another path then U can't fold N or
   // it will create a cycle. e.g. In the following diagram, U can reach N
@@ -579,7 +579,7 @@
   CurBB = BB;  // BB can change as result of isel.
 
   DEBUG(BB->dump());
-  if (!FastISel)
+  if (!Fast)
     PreprocessForRMW(DAG);
 
   // FIXME: This should only happen when not -fast.
diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp
index c9ca971..9f0f155 100644
--- a/utils/TableGen/DAGISelEmitter.cpp
+++ b/utils/TableGen/DAGISelEmitter.cpp
@@ -429,7 +429,7 @@
       NumInputRootOps = N->getNumChildren();
 
       if (DisablePatternForFastISel(N, CGP))
-        emitCheck("!FastISel");
+        emitCheck("!Fast");
 
       std::string PredicateCheck;
       for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {