Change implementation of eval to make an exact distinction between direct eva...

src/usage-analyzer.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 21 matching lines @@
 #include "usage-analyzer.h"
 
 namespace v8 { namespace internal {
 
 // Weight boundaries
 static const int MinWeight = 1;
 static const int MaxWeight = 1000000;
 static const int InitialWeight = 100;
 
 
-class UsageComputer: public Visitor {
+class UsageComputer: public AstVisitor {
  public:
   static bool Traverse(Node* node);
 
   void VisitBlock(Block* node);
   void VisitDeclaration(Declaration* node);
   void VisitExpressionStatement(ExpressionStatement* node);
   void VisitEmptyStatement(EmptyStatement* node);
   void VisitIfStatement(IfStatement* node);
   void VisitContinueStatement(ContinueStatement* node);
   void VisitBreakStatement(BreakStatement* node);
@@ skipping 13 matching lines @@
   void VisitVariable(Variable* node);
   void VisitVariableProxy(VariableProxy* node);
   void VisitLiteral(Literal* node);
   void VisitRegExpLiteral(RegExpLiteral* node);
   void VisitObjectLiteral(ObjectLiteral* node);
   void VisitArrayLiteral(ArrayLiteral* node);
   void VisitAssignment(Assignment* node);
   void VisitThrow(Throw* node);
   void VisitProperty(Property* node);
   void VisitCall(Call* node);
+  void VisitCallEval(CallEval* node);
   void VisitCallNew(CallNew* node);
   void VisitCallRuntime(CallRuntime* node);
   void VisitUnaryOperation(UnaryOperation* node);
   void VisitCountOperation(CountOperation* node);
   void VisitBinaryOperation(BinaryOperation* node);
   void VisitCompareOperation(CompareOperation* node);
   void VisitThisFunction(ThisFunction* node);
 
  private:
   int weight_;
@@ skipping 228 matching lines @@
   }
 }
 
 
 void UsageComputer::VisitCall(Call* node) {
   Read(node->expression());
   ReadList(node->arguments());
 }
 
 
+void UsageComputer::VisitCallEval(CallEval* node) {
+  VisitCall(node);
+}
+
+
 void UsageComputer::VisitCallNew(CallNew* node) {
   VisitCall(node);
 }
 
 
 void UsageComputer::VisitCallRuntime(CallRuntime* node) {
   ReadList(node->arguments());
 }
 
 
@@ skipping 95 matching lines @@
 
 // ----------------------------------------------------------------------------
 // Interface to variable usage analysis
 
 bool AnalyzeVariableUsage(FunctionLiteral* lit) {
   if (!FLAG_usage_computation) return true;
   return UsageComputer::Traverse(lit);
 }
 
 } }  // namespace v8::internal