Cleanup the AST code by removing unused parts and get rid of the...

src/rewriter.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 88 matching lines @@
   node->cond()->set_no_negative_zero(true);
   Visit(node->cond());
   Visit(node->body());
 }
 
 
 void AstOptimizer::VisitWhileStatement(WhileStatement* node) {
   has_function_literal_ = false;
   node->cond()->set_no_negative_zero(true);
   Visit(node->cond());
-  node->may_have_function_literal_ = has_function_literal_;
+  node->set_may_have_function_literal(has_function_literal_);
   Visit(node->body());
 }
 
 
 void AstOptimizer::VisitForStatement(ForStatement* node) {
   if (node->init() != NULL) {
     Visit(node->init());
   }
   if (node->cond() != NULL) {
     has_function_literal_ = false;
     node->cond()->set_no_negative_zero(true);
     Visit(node->cond());
-    node->may_have_function_literal_ = has_function_literal_;
+    node->set_may_have_function_literal(has_function_literal_);
   }
   Visit(node->body());
   if (node->next() != NULL) {
     Visit(node->next());
   }
 }
 
 
 void AstOptimizer::VisitForInStatement(ForInStatement* node) {
   Visit(node->each());
@@ skipping 528 matching lines @@
       }
       if (node->right()->type()->IsUnknown()) {
         node->right()->type()->SetAsLikelySmi();
         Visit(node->right());
       }
     }
   }
 }
 
 
+void AstOptimizer::VisitCompareToNull(CompareToNull* node) {
+  Visit(node->expression());
+}
+
+
 void AstOptimizer::VisitThisFunction(ThisFunction* node) {
   USE(node);
 }
 
 
 class Processor: public AstVisitor {
  public:
   explicit Processor(VariableProxy* result)
       : result_(result),
         result_assigned_(false),
@@ skipping 272 matching lines @@
   UNREACHABLE();
 }
 
 
 void Processor::VisitCompareOperation(CompareOperation* node) {
   USE(node);
   UNREACHABLE();
 }
 
 
+void Processor::VisitCompareToNull(CompareToNull* node) {
+  USE(node);
+  UNREACHABLE();
+}
+
+
 void Processor::VisitThisFunction(ThisFunction* node) {
   USE(node);
   UNREACHABLE();
 }
 
 
 bool Rewriter::Process(FunctionLiteral* function) {
   HistogramTimerScope timer(&Counters::rewriting);
   Scope* scope = function->scope();
   if (scope->is_function_scope()) return true;
@@ skipping 20 matching lines @@
     optimizer.Optimize(body);
     if (optimizer.HasStackOverflow()) {
       return false;
     }
   }
   return true;
 }
 
 
 } }  // namespace v8::internal