Add new style of string interpolation optimization: new nodes, working constant folding.

runtime/vm/flow_graph_optimizer.cc

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/flow_graph_optimizer.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cha.h"
 #include "vm/dart_entry.h"
 #include "vm/flow_graph_builder.h"
@@ skipping 6198 matching lines @@
   SetValue(instr, non_constant_);
 }
 
 
 void ConstantPropagator::VisitStringFromCharCode(
     StringFromCharCodeInstr* instr) {
   SetValue(instr, non_constant_);
 }
 
 
+void ConstantPropagator::VisitStringInterpolate(StringInterpolateInstr* instr) {
+  if (IsNonConstant(instr->constant_value())) {
+    // Do not bother with costly analysis if we already know that the
+    // instruction is not a constant.
+    SetValue(instr, non_constant_);
+    return;
+  }
+  // If all inputs are constant strings, numbers, booleans or null, then
+  // constant fold.
+  // TODO(srdjan): Also constant fold an interval of constant arguments.
+  //   v2 <- CreateArray(v0)
+  //   StoreIndexed(v2, v3, v4)   -- v3:constant index, v4: value.
+  //   ..
+  //   v8 <- StringInterpolate(v2)
+  CreateArrayInstr* create_array =
+      instr->value()->definition()->AsCreateArray();
+  ASSERT(create_array != NULL);
+
+  // Check if the string interpolation has only constant inputs.
+  for (Value::Iterator it(create_array->input_use_list());
+       !it.Done();
+       it.Advance()) {
+    Instruction* curr = it.Current()->instruction();
+    if (curr != instr) {
+      StoreIndexedInstr* store = curr->AsStoreIndexed();
+      ASSERT(store != NULL);
+      const Object& value = store->value()->definition()->constant_value();
+      if (IsNonConstant(value)) {
+        SetValue(instr, non_constant_);
+        return;
+      } else if (IsUnknown(value)) {
+        ASSERT(IsUnknown(instr->constant_value()));
+        return;
+      }
+    }
+  }
+  // Interpolate string at compile time.
+  const Array& value_arr =
+      Array::Handle(Array::New(create_array->num_elements()));
+  // Build array of literal values to interpolate.
+  for (Value::Iterator it(create_array->input_use_list());
+       !it.Done();
+       it.Advance()) {
+    Instruction* curr = it.Current()->instruction();
+    // Skip StringInterpolateInstr.
+    if (curr != instr) {
+      StoreIndexedInstr* store = curr->AsStoreIndexed();
+      ASSERT(store != NULL);
+      Value* index_value = store->index();
+      ASSERT(index_value->BindsToConstant() && index_value->IsSmiValue());
+      const intptr_t ix = Smi::Cast(index_value->BoundConstant()).Value();
+      ASSERT(IsConstant(store->value()->definition()->constant_value()));
+      value_arr.SetAt(ix, store->value()->definition()->constant_value());
+    }
+  }
+  // Build argument array to pass to the interpolation function.
+  const Array& interpolate_arg = Array::Handle(Array::New(1));
+  interpolate_arg.SetAt(0, value_arr);
+  // Call interpolation function.
+  String& concatenated = String::ZoneHandle();
+  concatenated ^=
+      DartEntry::InvokeFunction(instr->CallFunction(), interpolate_arg);
+  if (concatenated.IsUnhandledException()) {
+    SetValue(instr, non_constant_);
+    return;
+  }
+
+  concatenated = Symbols::New(concatenated);
+  SetValue(instr, concatenated);
+}
+
+
 void ConstantPropagator::VisitLoadIndexed(LoadIndexedInstr* instr) {
   SetValue(instr, non_constant_);
 }
 
 
 void ConstantPropagator::VisitStoreIndexed(StoreIndexedInstr* instr) {
   SetValue(instr, instr->value()->definition()->constant_value());
 }
 
 
@@ skipping 752 matching lines @@
           !defn->IsStoreStaticField() &&
           !defn->IsStoreVMField()) {
         if (FLAG_trace_constant_propagation) {
           OS::Print("Constant v%" Pd " = %s\n",
                     defn->ssa_temp_index(),
                     defn->constant_value().ToCString());
         }
         ConstantInstr* constant = graph_->GetConstant(defn->constant_value());
         defn->ReplaceUsesWith(constant);
         i.RemoveCurrentFromGraph();
+        if (defn->IsStringInterpolate()) {
+          CreateArrayInstr* create_array = defn->AsStringInterpolate()->
+              value()->definition()->AsCreateArray();
+          for (Value* use = create_array->input_use_list();
+              use != NULL;
+              use = create_array->input_use_list()) {
+            use->instruction()->RemoveFromGraph();
+          }
+          create_array->RemoveFromGraph();
+        }
       }
     }
 
     // Replace branches where one target is unreachable with jumps.
     BranchInstr* branch = block->last_instruction()->AsBranch();
     if (branch != NULL) {
       TargetEntryInstr* if_true = branch->true_successor();
       TargetEntryInstr* if_false = branch->false_successor();
       JoinEntryInstr* join = NULL;
       Instruction* next = NULL;
@@ skipping 665 matching lines @@
   }
 
   // Insert materializations at environment uses.
   for (intptr_t i = 0; i < exits.length(); i++) {
     CreateMaterializationAt(exits[i], alloc, alloc->cls(), *fields);
   }
 }
 
 
 }  // namespace dart