Experimental: periodic merge of the bleeding_edge branch to 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 225 matching lines @@
 
 
 void AstOptimizer::VisitObjectLiteral(ObjectLiteral* node) {
   for (int i = 0; i < node->properties()->length(); i++) {
     Visit(node->properties()->at(i)->key());
     Visit(node->properties()->at(i)->value());
   }
 }
 
 
+void AstOptimizer::VisitCatchExtensionObject(CatchExtensionObject* node) {
+  Visit(node->key());
+  Visit(node->value());
+}
+
+
 void AstOptimizer::VisitAssignment(Assignment* node) {
   switch (node->op()) {
     case Token::INIT_VAR:
     case Token::INIT_CONST:
     case Token::ASSIGN:
       // No type can be infered from the general assignment.
       break;
     case Token::ASSIGN_BIT_OR:
     case Token::ASSIGN_BIT_XOR:
     case Token::ASSIGN_BIT_AND:
@@ skipping 19 matching lines @@
       break;
   }
 
   Visit(node->target());
   Visit(node->value());
 
   switch (node->op()) {
     case Token::INIT_VAR:
     case Token::INIT_CONST:
     case Token::ASSIGN:
-      // Pure assigment copies the type from the value.
+      // Pure assignment copies the type from the value.
       node->type()->CopyFrom(node->value()->type());
       break;
     case Token::ASSIGN_BIT_OR:
     case Token::ASSIGN_BIT_XOR:
     case Token::ASSIGN_BIT_AND:
     case Token::ASSIGN_SHL:
     case Token::ASSIGN_SAR:
     case Token::ASSIGN_SHR:
       // Should have been setup above already.
       break;
@@ skipping 117 matching lines @@
   // After visiting the operand nodes we have to check if this node's type
   // can be updated. If it does, then we can push that information down
   // towards the leafs again if the new information is an upgrade over the
   // previous type of the operand nodes.
   if (node->type()->IsUnknown()) {
     if (node->left()->type()->IsLikelySmi() ||
         node->right()->type()->IsLikelySmi()) {
       node->type()->SetAsLikelySmi();
     }
     if (node->type()->IsLikelySmi()) {
-      // The type of this node changed to LIKELY_SMI. Propagate this knowlege
+      // The type of this node changed to LIKELY_SMI. Propagate this knowledge
       // down through the nodes.
       if (node->left()->type()->IsUnknown()) {
         node->left()->type()->SetAsLikelySmi();
         Visit(node->left());
       }
       if (node->right()->type()->IsUnknown()) {
         node->right()->type()->SetAsLikelySmi();
         Visit(node->right());
       }
     }
@@ skipping 14 matching lines @@
   // After visiting the operand nodes we have to check if this node's type
   // can be updated. If it does, then we can push that information down
   // towards the leafs again if the new information is an upgrade over the
   // previous type of the operand nodes.
   if (node->type()->IsUnknown()) {
     if (node->left()->type()->IsLikelySmi() ||
         node->right()->type()->IsLikelySmi()) {
       node->type()->SetAsLikelySmi();
     }
     if (node->type()->IsLikelySmi()) {
-      // The type of this node changed to LIKELY_SMI. Propagate this knowlege
+      // The type of this node changed to LIKELY_SMI. Propagate this knowledge
       // down through the nodes.
       if (node->left()->type()->IsUnknown()) {
         node->left()->type()->SetAsLikelySmi();
         Visit(node->left());
       }
       if (node->right()->type()->IsUnknown()) {
         node->right()->type()->SetAsLikelySmi();
         Visit(node->right());
       }
     }
@@ skipping 208 matching lines @@
   UNREACHABLE();
 }
 
 
 void Processor::VisitObjectLiteral(ObjectLiteral* node) {
   USE(node);
   UNREACHABLE();
 }
 
 
+void Processor::VisitCatchExtensionObject(CatchExtensionObject* node) {
+  USE(node);
+  UNREACHABLE();
+}
+
+
 void Processor::VisitAssignment(Assignment* node) {
   USE(node);
   UNREACHABLE();
 }
 
 
 void Processor::VisitThrow(Throw* node) {
   USE(node);
   UNREACHABLE();
 }
@@ skipping 87 matching lines @@
       if (optimizer.HasStackOverflow()) {
         return false;
       }
     }
   }
   return true;
 }
 
 
 } }  // namespace v8::internal