Integrate the Irregexp Regular Expression Engine.

runtime/vm/intermediate_language.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/intermediate_language.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cpu.h"
 #include "vm/dart_entry.h"
 #include "vm/flow_graph_allocator.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/flow_graph_compiler.h"
 #include "vm/flow_graph_optimizer.h"
 #include "vm/flow_graph_range_analysis.h"
 #include "vm/locations.h"
 #include "vm/method_recognizer.h"
 #include "vm/object.h"
 #include "vm/object_store.h"
 #include "vm/os.h"
+#include "vm/regexp_assembler.h"
 #include "vm/resolver.h"
 #include "vm/scopes.h"
 #include "vm/stub_code.h"
 #include "vm/symbols.h"
 
 #include "vm/il_printer.h"
 
 namespace dart {
 
 DEFINE_FLAG(bool, propagate_ic_data, true,
@@ skipping 414 matching lines @@
 }
 
 
 GraphEntryInstr::GraphEntryInstr(const ParsedFunction* parsed_function,
                                  TargetEntryInstr* normal_entry,
                                  intptr_t osr_id)
     : BlockEntryInstr(0, CatchClauseNode::kInvalidTryIndex),
       parsed_function_(parsed_function),
       normal_entry_(normal_entry),
       catch_entries_(),
+      indirect_entries_(),
       initial_definitions_(),
       osr_id_(osr_id),
       entry_count_(0),
       spill_slot_count_(0),
       fixed_slot_count_(0) {
 }
 
 
 ConstantInstr* GraphEntryInstr::constant_null() {
   ASSERT(initial_definitions_.length() > 0);
@@ skipping 2078 matching lines @@
     compiler->AddCurrentDescriptor(RawPcDescriptors::kDeopt,
                                    GetDeoptId(),
                                    Scanner::kNoSourcePos);
   }
   if (HasParallelMove()) {
     compiler->parallel_move_resolver()->EmitNativeCode(parallel_move());
   }
 }
 
 
+void IndirectGotoInstr::ComputeOffsetTable(Isolate* isolate) {
+  if (GetBlock()->offset() < 0) {
+    // Don't generate a table when contained in an unreachable block.
+    return;
+  }
+  ASSERT(SuccessorCount() == offsets_.Capacity());
+  offsets_.SetLength(SuccessorCount());
+  for (intptr_t i = 0; i < SuccessorCount(); i++) {
+    TargetEntryInstr* target = SuccessorAt(i);
+    intptr_t offset = target->offset();
+
+    // The intermediate block might be compacted, if so, use the indirect entry.
+    if (offset < 0) {
+      // Optimizations might have modified the immediate target block, but it
+      // must end with a goto to the indirect entry. Also, we can't use
+      // last_instruction because 'target' is compacted/unreachable.
+      Instruction* last = target->next();
+      while (last != NULL && !last->IsGoto()) {
+        last = last->next();
+      }
+      ASSERT(last);
+      IndirectEntryInstr* ientry =
+          last->AsGoto()->successor()->AsIndirectEntry();
+      ASSERT(ientry != NULL);
+      ASSERT(ientry->indirect_id() == i);
+      offset = ientry->offset();
+    }
+
+    ASSERT(offset > 0);
+    offset -= Assembler::EntryPointToPcMarkerOffset();
+    offsets_.SetAt(i, Smi::ZoneHandle(isolate, Smi::New(offset)));
+  }
+}
+
+
+LocationSummary* IndirectEntryInstr::MakeLocationSummary(
+    Isolate* isolate, bool optimizing) const {
+  return JoinEntryInstr::MakeLocationSummary(isolate, optimizing);
+}
+
+
+void IndirectEntryInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
+  JoinEntryInstr::EmitNativeCode(compiler);
+}
+
+
 LocationSummary* PhiInstr::MakeLocationSummary(Isolate* isolate,
                                                bool optimizing) const {
   UNREACHABLE();
   return NULL;
 }
 
 
 void PhiInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
   UNREACHABLE();
 }
@@ skipping 770 matching lines @@
     case kIllegal:       return "illegal";
     case kSin:           return "sin";
     case kCos:           return "cos";
     case kSqrt:          return "sqrt";
     case kDoubleSquare:  return "double-square";
   }
   UNREACHABLE();
   return "";
 }
 
+typedef RawBool* (*CaseInsensitiveCompareUC16Function) (
+    RawString* string_raw,
+    RawSmi* lhs_index_raw,
+    RawSmi* rhs_index_raw,
+    RawSmi* length_raw);
+
+
+extern const RuntimeEntry kCaseInsensitiveCompareUC16RuntimeEntry(
+    "CaseInsensitiveCompareUC16", reinterpret_cast<RuntimeFunction>(
+        static_cast<CaseInsensitiveCompareUC16Function>(
+        &IRRegExpMacroAssembler::CaseInsensitiveCompareUC16)), 4, true, false);
+
+
+const RuntimeEntry& CaseInsensitiveCompareUC16Instr::TargetFunction() const {
+  return kCaseInsensitiveCompareUC16RuntimeEntry;
+}
+
 
 MergedMathInstr::MergedMathInstr(ZoneGrowableArray<Value*>* inputs,
                                  intptr_t deopt_id,
                                  MergedMathInstr::Kind kind)
     : PureDefinition(deopt_id),
       inputs_(inputs),
       kind_(kind) {
   ASSERT(inputs_->length() == InputCountFor(kind_));
   for (intptr_t i = 0; i < inputs_->length(); ++i) {
     ASSERT((*inputs)[i] != NULL);
@@ skipping 17 matching lines @@
     case Token::kTRUNCDIV: return 0;
     case Token::kMOD: return 1;
     default: UNIMPLEMENTED(); return -1;
   }
 }
 
 
 #undef __
 
 }  // namespace dart