[Isolates] Merge crankshaft (r5922 from bleeding_edge).

src/data-flow.cc

 // Copyright 2010 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 15 matching lines @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "v8.h"
 
 #include "data-flow.h"
 #include "scopes.h"
 
 namespace v8 {
 namespace internal {
 
-
 #ifdef DEBUG
 void BitVector::Print() {
   bool first = true;
   PrintF("{");
   for (int i = 0; i < length(); i++) {
     if (Contains(i)) {
       if (!first) PrintF(",");
       first = false;
       PrintF("%d", i);
     }
   }
   PrintF("}");
 }
 #endif
 
 
+void BitVector::Iterator::Advance() {
+  current_++;
+  uint32_t val = current_value_;
+  while (val == 0) {
+    current_index_++;
+    if (Done()) return;
+    val = target_->data_[current_index_];
+    current_ = current_index_ << 5;
+  }
+  val = SkipZeroBytes(val);
+  val = SkipZeroBits(val);
+  current_value_ = val >> 1;
+}
+
+
 bool AssignedVariablesAnalyzer::Analyze(CompilationInfo* info) {
-  info_ = info;
   Scope* scope = info->scope();
-  int variables = scope->num_parameters() + scope->num_stack_slots();
-  if (variables == 0) return true;
-  av_.ExpandTo(variables);
-  VisitStatements(info->function()->body());
+  int size = scope->num_parameters() + scope->num_stack_slots();
+  if (size == 0) return true;
+  AssignedVariablesAnalyzer analyzer(info, size);
+  return analyzer.Analyze();
+}
+
+
+AssignedVariablesAnalyzer::AssignedVariablesAnalyzer(CompilationInfo* info,
+                                                     int size)
+    : info_(info), av_(size) {
+}
+
+
+bool AssignedVariablesAnalyzer::Analyze() {
+  ASSERT(av_.length() > 0);
+  VisitStatements(info_->function()->body());
   return !HasStackOverflow();
 }
 
 
 Variable* AssignedVariablesAnalyzer::FindSmiLoopVariable(ForStatement* stmt) {
   // The loop must have all necessary parts.
   if (stmt->init() == NULL || stmt->cond() == NULL || stmt->next() == NULL) {
     return NULL;
   }
   // The initialization statement has to be a simple assignment.
@@ skipping 241 matching lines @@
   av_.Clear();
   Visit(expr->then_expression());
   result.Union(av_);
 
   av_.Clear();
   Visit(expr->else_expression());
   av_.Union(result);
 }
 
 
-void AssignedVariablesAnalyzer::VisitSlot(Slot* expr) {
-  UNREACHABLE();
-}
-
-
 void AssignedVariablesAnalyzer::VisitVariableProxy(VariableProxy* expr) {
   // Nothing to do.
   ASSERT(av_.IsEmpty());
 }
 
 
 void AssignedVariablesAnalyzer::VisitLiteral(Literal* expr) {
   // Nothing to do.
   ASSERT(av_.IsEmpty());
 }
@@ skipping 180 matching lines @@
   ASSERT(av_.IsEmpty());
 }
 
 
 void AssignedVariablesAnalyzer::VisitDeclaration(Declaration* decl) {
   UNREACHABLE();
 }
 
 
 } }  // namespace v8::internal