Added special case for atomic regular expressions.

src/jsregexp.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 14 matching lines @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "v8.h"
 
 #include "execution.h"
 #include "factory.h"
 #include "jsregexp.h"
 #include "third_party/jscre/pcre.h"
 #include "platform.h"
+#include "runtime.h"
 #include "top.h"
 
 namespace v8 { namespace internal {
 
 
 #define CAPTURE_INDEX 0
 #define INTERNAL_INDEX 1
 
 static Failure* malloc_failure;
 
@@ skipping 90 matching lines @@
     Factory::NewRawTwoByteString(flat_string->length(), TENURED);
   static StringInputBuffer convert_to_two_byte_buffer;
   convert_to_two_byte_buffer.Reset(*flat_string);
   for (int i = 0; convert_to_two_byte_buffer.has_more(); i++) {
     two_byte_string->Set(i, convert_to_two_byte_buffer.GetNext());
   }
   return two_byte_string;
 }
 
 
+unibrow::Predicate<unibrow::RegExpSpecialChar, 128> is_reg_exp_special_char;
+
+
+Handle<Object> RegExpImpl::Compile(Handle<JSRegExp> re,
+                                   Handle<String> pattern,
+                                   Handle<String> flags) {
+  bool is_atom = true;
+  for (int i = 0; is_atom && i < flags->length(); i++) {
+    if (flags->Get(i) == 'i')
+      is_atom = false;
+  }
+  for (int i = 0; is_atom && i < pattern->length(); i++) {
+    if (is_reg_exp_special_char.get(pattern->Get(i)))
+      is_atom = false;
+  }
+  Handle<Object> result;
+  if (is_atom) {
+    result = AtomCompile(re, pattern);
+  } else {
+    result = JsreCompile(re, pattern, flags);
+  }
+
+  LOG(RegExpCompileEvent(re));
+  return result;
+}
+
+
+Handle<Object> RegExpImpl::Exec(Handle<JSRegExp> regexp,
+                                Handle<String> subject,
+                                Handle<Object> index) {
+  switch (regexp->type_tag()) {
+    case JSRegExp::JSCRE:
+      return JsreExec(regexp, subject, index);
+    case JSRegExp::ATOM:
+      return AtomExec(regexp, subject, index);
+    default:
+      UNREACHABLE();
+      return Handle<Object>();
+  }
+}
+
+
+Handle<Object> RegExpImpl::ExecGlobal(Handle<JSRegExp> regexp,
+                                Handle<String> subject) {
+  switch (regexp->type_tag()) {
+    case JSRegExp::JSCRE:
+      return JsreExecGlobal(regexp, subject);
+    case JSRegExp::ATOM:
+      return AtomExecGlobal(regexp, subject);
+    default:
+      UNREACHABLE();
+      return Handle<Object>();
+  }
+}
+
+
+Handle<Object> RegExpImpl::AtomCompile(Handle<JSRegExp> re,
+                                       Handle<String> pattern) {
+  re->set_type_tag(JSRegExp::ATOM);
+  re->set_data(*pattern);
+  return re;
+}
+
+
+Handle<Object> RegExpImpl::AtomExec(Handle<JSRegExp> re,
+                                    Handle<String> subject,
+                                    Handle<Object> index) {
+  Handle<String> needle(String::cast(re->data()));
+
+  uint32_t start_index;
+  if (!Array::IndexFromObject(*index, &start_index)) {
+    return Handle<Smi>(Smi::FromInt(-1));
+  }
+
+  LOG(RegExpExecEvent(re, start_index, subject));
+  int value = Runtime::StringMatchKmp(*subject, *needle, start_index);
+  if (value == -1) return Factory::null_value();
+  Handle<JSArray> result = Factory::NewJSArray(2);
+  SetElement(result, 0, Handle<Smi>(Smi::FromInt(value)));
+  SetElement(result, 1, Handle<Smi>(Smi::FromInt(value + needle->length())));
+  return result;
+}
+
+
+Handle<Object> RegExpImpl::AtomExecGlobal(Handle<JSRegExp> re,
+                                          Handle<String> subject) {
+  Handle<String> needle(String::cast(re->data()));
+  Handle<JSArray> result = Factory::NewJSArray(1);
+  bool keep_going = true;
+  int index = 0;
+  int match_count = 0;
+  int needle_length = needle->length();
+  while (keep_going) {
+    LOG(RegExpExecEvent(re, index, subject));
+    int value = Runtime::StringMatchKmp(*subject, *needle, index);
+    if (value == -1) break;
+    HandleScope scope;
+    int end = value + needle_length;
+    Handle<JSArray> pair = Factory::NewJSArray(2);
+    SetElement(pair, 0, Handle<Smi>(Smi::FromInt(value)));
+    SetElement(pair, 1, Handle<Smi>(Smi::FromInt(end)));
+    SetElement(result, match_count, pair);
+    match_count++;
+    index = end;
+    if (needle_length == 0)
+      index++;
+  }
+  return result;
+}
+
+
 Handle<Object> RegExpImpl::JsreCompile(Handle<JSRegExp> re,
                                        Handle<String> pattern,
                                        Handle<String> flags) {
   JSRegExpIgnoreCaseOption case_option = JSRegExpDoNotIgnoreCase;
   JSRegExpMultilineOption multiline_option = JSRegExpSingleLine;
   FlattenString(flags);
   for (int i = 0; i < flags->length(); i++) {
     if (flags->Get(i) == 'i') case_option = JSRegExpIgnoreCase;
     if (flags->Get(i) == 'm') multiline_option = JSRegExpMultiline;
   }
@@ skipping 44 matching lines @@
   // Convert the return address to a ByteArray pointer.
   Handle<ByteArray> internal(
       ByteArray::FromDataStartAddress(reinterpret_cast<Address>(code)));
 
   Handle<FixedArray> value = Factory::NewFixedArray(2);
   value->set(CAPTURE_INDEX, Smi::FromInt(number_of_captures));
   value->set(INTERNAL_INDEX, *internal);
   re->set_type_tag(JSRegExp::JSCRE);
   re->set_data(*value);
 
-  LOG(RegExpCompileEvent(re));
-
   return re;
 }
 
 
 Handle<Object> RegExpImpl::JsreExecOnce(Handle<JSRegExp> regexp,
                                         int num_captures,
                                         Handle<String> subject,
                                         int previous_index,
                                         const uc16* two_byte_subject,
                                         int* offsets_vector,
@@ skipping 32 matching lines @@
     return Handle<Object>(Top::Throw(*regexp_err));
   }
 
   Handle<JSArray> result = Factory::NewJSArray(2 * (num_captures+1));
 
   // The captures come in (start, end+1) pairs.
   for (int i = 0; i < 2 * (num_captures+1); i += 2) {
     SetElement(result, i, Handle<Object>(Smi::FromInt(offsets_vector[i])));
     SetElement(result, i+1, Handle<Object>(Smi::FromInt(offsets_vector[i+1])));
   }
-
   return result;
 }
 
 
 class OffsetsVector {
  public:
   inline OffsetsVector(int num_captures) {
     offsets_vector_length_ = (num_captures + 1) * 3;
     if (offsets_vector_length_ > kStaticOffsetsVectorSize) {
       vector_ = NewArray<int>(offsets_vector_length_);
@@ skipping 105 matching lines @@
 }
 
 
 ByteArray* RegExpImpl::JsreInternal(Handle<JSRegExp> re) {
   Object* value = re->data();
   ASSERT(value->IsFixedArray());
   return ByteArray::cast(FixedArray::cast(value)->get(INTERNAL_INDEX));
 }
 
 }}  // namespace v8::internal