Propagation of choice start set.

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 1527 matching lines @@
   void set_table(DispatchTable* value) { table_ = value; }
   void set_choice_index(int value) { choice_index_ = value; }
 };
 
 
 void Analysis::VisitEnd(EndNode* that) {
   // nothing to do
 }
 
 
+class AddDispatchRange {
+ public:
+  AddDispatchRange(Analysis* analysis) : analysis_(analysis) { }
+  void Call(uc32 from, DispatchTable::Entry entry);
+ private:
+  Analysis* analysis_;
+};
+
+
+void AddDispatchRange::Call(uc32 from, DispatchTable::Entry entry) {
+  CharacterRange range(from, entry.to());
+  analysis_->table()->AddRange(range, analysis_->choice_index());
+}
+
+
 void Analysis::VisitChoice(ChoiceNode* node) {
   if (node->visited()) return;
   node->set_visited(true);
   ZoneList<GuardedAlternative>* choices = node->choices();
   AnalysisBuilder data(this);
   data.set_table(node->table());
   for (int i = 0; i < choices->length(); i++) {
     data.set_choice_index(i);
     data.Analyze(choices->at(i).node());
   }
   node->set_visited(false);
+  if (table() != NULL) {
+    data.table()->ForEach(AddDispatchRange(this));
+  }
 }
 
 
 void Analysis::VisitBackreference(BackreferenceNode* that) {
   UNIMPLEMENTED();
 }
 
 
 void Analysis::VisitCharacterClass(CharacterClassNode* that) {
   if (table() != NULL) {
@@ skipping 39 matching lines @@
 RegExpNode* RegExpEngine::Compile(RegExpParseResult* input) {
   RegExpCompiler compiler(input->capture_count);
   RegExpNode* node = compiler.Compile(input->tree,
                                       EndNode::GetAccept(),
                                       EndNode::GetBacktrack());
   return node;
 }
 
 
 }}  // namespace v8::internal