VM: Re-format to use at most one newline between functions

runtime/vm/regexp.cc

 // Copyright (c) 2014, 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/regexp.h"
 
 #include "vm/dart_entry.h"
 #include "vm/regexp_assembler.h"
 #include "vm/regexp_assembler_bytecode.h"
 #include "vm/regexp_assembler_ir.h"
 #include "vm/regexp_ast.h"
+#include "vm/symbols.h"
+#include "vm/thread.h"
 #include "vm/unibrow-inl.h"
 #include "vm/unicode.h"
-#include "vm/symbols.h"
-#include "vm/thread.h"
 
 #define Z (zone())
 
 namespace dart {
 
 // Default to generating optimized regexp code.
 static const bool kRegexpOptimization = true;
 
 // More makes code generation slower, less makes V8 benchmark score lower.
 static const intptr_t kMaxLookaheadForBoyerMoore = 8;
@@ skipping 163 matching lines @@
 //   string.  Therefore code generated for a non-trivial trace is specialized
 //   to that trace.  The code generator therefore has the ability to generate
 //   code for each node several times.  In order to limit the size of the
 //   generated code there is an arbitrary limit on how many specialized sets of
 //   code may be generated for a given node.  If the limit is reached, the
 //   trace is flushed and a generic version of the code for a node is emitted.
 //   This is subsequently used for that node.  The code emitted for non-generic
 //   trace is not recorded in the node and so it cannot currently be reused in
 //   the event that code generation is requested for an identical trace.
 
-
 void RegExpTree::AppendToText(RegExpText* text) {
   UNREACHABLE();
 }
 
-
 void RegExpAtom::AppendToText(RegExpText* text) {
   text->AddElement(TextElement::Atom(this));
 }
 
-
 void RegExpCharacterClass::AppendToText(RegExpText* text) {
   text->AddElement(TextElement::CharClass(this));
 }
 
-
 void RegExpText::AppendToText(RegExpText* text) {
   for (intptr_t i = 0; i < elements()->length(); i++)
     text->AddElement((*elements())[i]);
 }
 
-
 TextElement TextElement::Atom(RegExpAtom* atom) {
   return TextElement(ATOM, atom);
 }
 
-
 TextElement TextElement::CharClass(RegExpCharacterClass* char_class) {
   return TextElement(CHAR_CLASS, char_class);
 }
 
-
 intptr_t TextElement::length() const {
   switch (text_type()) {
     case ATOM:
       return atom()->length();
 
     case CHAR_CLASS:
       return 1;
   }
   UNREACHABLE();
   return 0;
 }
 
-
 class FrequencyCollator : public ValueObject {
  public:
   FrequencyCollator() : total_samples_(0) {
     for (intptr_t i = 0; i < RegExpMacroAssembler::kTableSize; i++) {
       frequencies_[i] = CharacterFrequency(i);
     }
   }
 
   void CountCharacter(intptr_t character) {
     intptr_t index = (character & RegExpMacroAssembler::kTableMask);
@@ skipping 22 matching lines @@
     intptr_t counter() { return counter_; }
     intptr_t character() { return character_; }
 
    private:
     intptr_t counter_;
     intptr_t character_;
 
     DISALLOW_ALLOCATION();
   };
 
-
  private:
   CharacterFrequency frequencies_[RegExpMacroAssembler::kTableSize];
   intptr_t total_samples_;
 };
 
-
 class RegExpCompiler : public ValueObject {
  public:
   RegExpCompiler(intptr_t capture_count, bool ignore_case, bool is_one_byte);
 
   intptr_t AllocateRegister() { return next_register_++; }
 
 #if !defined(DART_PRECOMPILED_RUNTIME)
   RegExpEngine::CompilationResult Assemble(IRRegExpMacroAssembler* assembler,
                                            RegExpNode* start,
                                            intptr_t capture_count,
@@ skipping 42 matching lines @@
   intptr_t recursion_depth_;
   RegExpMacroAssembler* macro_assembler_;
   bool ignore_case_;
   bool is_one_byte_;
   bool reg_exp_too_big_;
   intptr_t current_expansion_factor_;
   FrequencyCollator frequency_collator_;
   Zone* zone_;
 };
 
-
 class RecursionCheck : public ValueObject {
  public:
   explicit RecursionCheck(RegExpCompiler* compiler) : compiler_(compiler) {
     compiler->IncrementRecursionDepth();
   }
   ~RecursionCheck() { compiler_->DecrementRecursionDepth(); }
 
  private:
   RegExpCompiler* compiler_;
 };
 
-
 static RegExpEngine::CompilationResult IrregexpRegExpTooBig() {
   return RegExpEngine::CompilationResult("RegExp too big");
 }
 
-
 // Attempts to compile the regexp using an Irregexp code generator.  Returns
 // a fixed array or a null handle depending on whether it succeeded.
 RegExpCompiler::RegExpCompiler(intptr_t capture_count,
                                bool ignore_case,
                                bool is_one_byte)
     : next_register_(2 * (capture_count + 1)),
       work_list_(NULL),
       recursion_depth_(0),
       ignore_case_(ignore_case),
       is_one_byte_(is_one_byte),
       reg_exp_too_big_(false),
       current_expansion_factor_(1),
       zone_(Thread::Current()->zone()) {
   accept_ = new (Z) EndNode(EndNode::ACCEPT, Z);
 }
 
-
 #if !defined(DART_PRECOMPILED_RUNTIME)
 RegExpEngine::CompilationResult RegExpCompiler::Assemble(
     IRRegExpMacroAssembler* macro_assembler,
     RegExpNode* start,
     intptr_t capture_count,
     const String& pattern) {
   macro_assembler->set_slow_safe(false /* use_slow_safe_regexp_compiler */);
   macro_assembler_ = macro_assembler;
 
   ZoneGrowableArray<RegExpNode*> work_list(0);
@@ skipping 12 matching lines @@
   macro_assembler->GenerateBacktrackBlock();
   macro_assembler->FinalizeRegistersArray();
 
   return RegExpEngine::CompilationResult(
       macro_assembler->backtrack_goto(), macro_assembler->graph_entry(),
       macro_assembler->num_blocks(), macro_assembler->num_stack_locals(),
       next_register_);
 }
 #endif
 
-
 RegExpEngine::CompilationResult RegExpCompiler::Assemble(
     BytecodeRegExpMacroAssembler* macro_assembler,
     RegExpNode* start,
     intptr_t capture_count,
     const String& pattern) {
   macro_assembler->set_slow_safe(false /* use_slow_safe_regexp_compiler */);
   macro_assembler_ = macro_assembler;
 
   ZoneGrowableArray<RegExpNode*> work_list(0);
   work_list_ = &work_list;
   BlockLabel fail;
   macro_assembler_->PushBacktrack(&fail);
   Trace new_trace;
   start->Emit(this, &new_trace);
   macro_assembler_->BindBlock(&fail);
   macro_assembler_->Fail();
   while (!work_list.is_empty()) {
     work_list.RemoveLast()->Emit(this, &new_trace);
   }
   if (reg_exp_too_big_) return IrregexpRegExpTooBig();
 
   TypedData& bytecode = TypedData::ZoneHandle(macro_assembler->GetBytecode());
   return RegExpEngine::CompilationResult(&bytecode, next_register_);
 }
 
-
 bool Trace::DeferredAction::Mentions(intptr_t that) {
   if (action_type() == ActionNode::CLEAR_CAPTURES) {
     Interval range = static_cast<DeferredClearCaptures*>(this)->range();
     return range.Contains(that);
   } else {
     return reg() == that;
   }
 }
 
-
 bool Trace::mentions_reg(intptr_t reg) {
   for (DeferredAction* action = actions_; action != NULL;
        action = action->next()) {
     if (action->Mentions(reg)) return true;
   }
   return false;
 }
 
-
 bool Trace::GetStoredPosition(intptr_t reg, intptr_t* cp_offset) {
   ASSERT(*cp_offset == 0);
   for (DeferredAction* action = actions_; action != NULL;
        action = action->next()) {
     if (action->Mentions(reg)) {
       if (action->action_type() == ActionNode::STORE_POSITION) {
         *cp_offset = static_cast<DeferredCapture*>(action)->cp_offset();
         return true;
       } else {
         return false;
       }
     }
   }
   return false;
 }
 
-
 // This is called as we come into a loop choice node and some other tricky
 // nodes.  It normalizes the state of the code generator to ensure we can
 // generate generic code.
 intptr_t Trace::FindAffectedRegisters(OutSet* affected_registers, Zone* zone) {
   intptr_t max_register = RegExpCompiler::kNoRegister;
   for (DeferredAction* action = actions_; action != NULL;
        action = action->next()) {
     if (action->action_type() == ActionNode::CLEAR_CAPTURES) {
       Interval range = static_cast<DeferredClearCaptures*>(action)->range();
       for (intptr_t i = range.from(); i <= range.to(); i++)
         affected_registers->Set(i, zone);
       if (range.to() > max_register) max_register = range.to();
     } else {
       affected_registers->Set(action->reg(), zone);
       if (action->reg() > max_register) max_register = action->reg();
     }
   }
   return max_register;
 }
 
-
 void Trace::RestoreAffectedRegisters(RegExpMacroAssembler* assembler,
                                      intptr_t max_register,
                                      const OutSet& registers_to_pop,
                                      const OutSet& registers_to_clear) {
   for (intptr_t reg = max_register; reg >= 0; reg--) {
     if (registers_to_pop.Get(reg)) {
       assembler->PopRegister(reg);
     } else if (registers_to_clear.Get(reg)) {
       intptr_t clear_to = reg;
       while (reg > 0 && registers_to_clear.Get(reg - 1)) {
         reg--;
       }
       assembler->ClearRegisters(reg, clear_to);
     }
   }
 }
 
-
 void Trace::PerformDeferredActions(RegExpMacroAssembler* assembler,
                                    intptr_t max_register,
                                    const OutSet& affected_registers,
                                    OutSet* registers_to_pop,
                                    OutSet* registers_to_clear,
                                    Zone* zone) {
   for (intptr_t reg = 0; reg <= max_register; reg++) {
     if (!affected_registers.Get(reg)) {
       continue;
     }
@@ skipping 94 matching lines @@
     } else if (clear) {
       assembler->ClearRegisters(reg, reg);
     } else if (absolute) {
       assembler->SetRegister(reg, value);
     } else if (value != 0) {
       assembler->AdvanceRegister(reg, value);
     }
   }
 }
 
-
 // This is called as we come into a loop choice node and some other tricky
 // nodes.  It normalizes the state of the code generator to ensure we can
 // generate generic code.
 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
 
   ASSERT(!is_trivial());
 
   if (actions_ == NULL && backtrack() == NULL) {
     // Here we just have some deferred cp advances to fix and we are back to
@@ skipping 36 matching lines @@
   RestoreAffectedRegisters(assembler, max_register, registers_to_pop,
                            registers_to_clear);
   if (backtrack() == NULL) {
     assembler->Backtrack();
   } else {
     assembler->PopCurrentPosition();
     assembler->GoTo(backtrack());
   }
 }
 
-
 void NegativeSubmatchSuccess::Emit(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
 
   // Omit flushing the trace. We discard the entire stack frame anyway.
 
   if (!label()->IsBound()) {
     // We are completely independent of the trace, since we ignore it,
     // so this code can be used as the generic version.
     assembler->BindBlock(label());
   }
 
   // Throw away everything on the backtrack stack since the start
   // of the negative submatch and restore the character position.
   assembler->ReadCurrentPositionFromRegister(current_position_register_);
   assembler->ReadStackPointerFromRegister(stack_pointer_register_);
   if (clear_capture_count_ > 0) {
     // Clear any captures that might have been performed during the success
     // of the body of the negative look-ahead.
     int clear_capture_end = clear_capture_start_ + clear_capture_count_ - 1;
     assembler->ClearRegisters(clear_capture_start_, clear_capture_end);
   }
   // Now that we have unwound the stack we find at the top of the stack the
   // backtrack that the BeginSubmatch node got.
   assembler->Backtrack();
 }
 
-
 void EndNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   if (!trace->is_trivial()) {
     trace->Flush(compiler, this);
     return;
   }
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   if (!label()->IsBound()) {
     assembler->BindBlock(label());
   }
   switch (action_) {
     case ACCEPT:
       assembler->Succeed();
       return;
     case BACKTRACK:
       assembler->GoTo(trace->backtrack());
       return;
     case NEGATIVE_SUBMATCH_SUCCESS:
       // This case is handled in a different virtual method.
       UNREACHABLE();
   }
   UNIMPLEMENTED();
 }
 
-
 void GuardedAlternative::AddGuard(Guard* guard, Zone* zone) {
   if (guards_ == NULL) guards_ = new (zone) ZoneGrowableArray<Guard*>(1);
   guards_->Add(guard);
 }
 
-
 ActionNode* ActionNode::SetRegister(intptr_t reg,
                                     intptr_t val,
                                     RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(SET_REGISTER, on_success);
   result->data_.u_store_register.reg = reg;
   result->data_.u_store_register.value = val;
   return result;
 }
 
-
 ActionNode* ActionNode::IncrementRegister(intptr_t reg,
                                           RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(INCREMENT_REGISTER, on_success);
   result->data_.u_increment_register.reg = reg;
   return result;
 }
 
-
 ActionNode* ActionNode::StorePosition(intptr_t reg,
                                       bool is_capture,
                                       RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(STORE_POSITION, on_success);
   result->data_.u_position_register.reg = reg;
   result->data_.u_position_register.is_capture = is_capture;
   return result;
 }
 
-
 ActionNode* ActionNode::ClearCaptures(Interval range, RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(CLEAR_CAPTURES, on_success);
   result->data_.u_clear_captures.range_from = range.from();
   result->data_.u_clear_captures.range_to = range.to();
   return result;
 }
 
-
 ActionNode* ActionNode::BeginSubmatch(intptr_t stack_reg,
                                       intptr_t position_reg,
                                       RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(BEGIN_SUBMATCH, on_success);
   result->data_.u_submatch.stack_pointer_register = stack_reg;
   result->data_.u_submatch.current_position_register = position_reg;
   return result;
 }
 
-
 ActionNode* ActionNode::PositiveSubmatchSuccess(intptr_t stack_reg,
                                                 intptr_t position_reg,
                                                 intptr_t clear_register_count,
                                                 intptr_t clear_register_from,
                                                 RegExpNode* on_success) {
   ActionNode* result = new (on_success->zone())
       ActionNode(POSITIVE_SUBMATCH_SUCCESS, on_success);
   result->data_.u_submatch.stack_pointer_register = stack_reg;
   result->data_.u_submatch.current_position_register = position_reg;
   result->data_.u_submatch.clear_register_count = clear_register_count;
   result->data_.u_submatch.clear_register_from = clear_register_from;
   return result;
 }
 
-
 ActionNode* ActionNode::EmptyMatchCheck(intptr_t start_register,
                                         intptr_t repetition_register,
                                         intptr_t repetition_limit,
                                         RegExpNode* on_success) {
   ActionNode* result =
       new (on_success->zone()) ActionNode(EMPTY_MATCH_CHECK, on_success);
   result->data_.u_empty_match_check.start_register = start_register;
   result->data_.u_empty_match_check.repetition_register = repetition_register;
   result->data_.u_empty_match_check.repetition_limit = repetition_limit;
   return result;
 }
 
-
 #define DEFINE_ACCEPT(Type)                                                    \
   void Type##Node::Accept(NodeVisitor* visitor) { visitor->Visit##Type(this); }
 FOR_EACH_NODE_TYPE(DEFINE_ACCEPT)
 #undef DEFINE_ACCEPT
 
-
 void LoopChoiceNode::Accept(NodeVisitor* visitor) {
   visitor->VisitLoopChoice(this);
 }
 
-
 // -------------------------------------------------------------------
 // Emit code.
 
-
 void ChoiceNode::GenerateGuard(RegExpMacroAssembler* macro_assembler,
                                Guard* guard,
                                Trace* trace) {
   switch (guard->op()) {
     case Guard::LT:
       ASSERT(!trace->mentions_reg(guard->reg()));
       macro_assembler->IfRegisterGE(guard->reg(), guard->value(),
                                     trace->backtrack());
       break;
     case Guard::GEQ:
       ASSERT(!trace->mentions_reg(guard->reg()));
       macro_assembler->IfRegisterLT(guard->reg(), guard->value(),
                                     trace->backtrack());
       break;
   }
 }
 
-
 // Returns the number of characters in the equivalence class, omitting those
 // that cannot occur in the source string because it is ASCII.
 static intptr_t GetCaseIndependentLetters(uint16_t character,
                                           bool one_byte_subject,
                                           int32_t* letters) {
   unibrow::Mapping<unibrow::Ecma262UnCanonicalize> jsregexp_uncanonicalize;
   intptr_t length = jsregexp_uncanonicalize.get(character, '\0', letters);
   // Unibrow returns 0 or 1 for characters where case independence is
   // trivial.
   if (length == 0) {
     letters[0] = character;
     length = 1;
   }
   if (!one_byte_subject || character <= Symbols::kMaxOneCharCodeSymbol) {
     return length;
   }
 
   // The standard requires that non-ASCII characters cannot have ASCII
   // character codes in their equivalence class.
   // TODO(dcarney): issue 3550 this is not actually true for Latin1 anymore,
   // is it?  For example, \u00C5 is equivalent to \u212B.
   return 0;
 }
 
-
 static inline bool EmitSimpleCharacter(Zone* zone,
                                        RegExpCompiler* compiler,
                                        uint16_t c,
                                        BlockLabel* on_failure,
                                        intptr_t cp_offset,
                                        bool check,
                                        bool preloaded) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   bool bound_checked = false;
   if (!preloaded) {
     assembler->LoadCurrentCharacter(cp_offset, on_failure, check);
     bound_checked = true;
   }
   assembler->CheckNotCharacter(c, on_failure);
   return bound_checked;
 }
 
-
 // Only emits non-letters (things that don't have case).  Only used for case
 // independent matches.
 static inline bool EmitAtomNonLetter(Zone* zone,
                                      RegExpCompiler* compiler,
                                      uint16_t c,
                                      BlockLabel* on_failure,
                                      intptr_t cp_offset,
                                      bool check,
                                      bool preloaded) {
   RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
@@ skipping 15 matching lines @@
     }
     if (!preloaded) {
       macro_assembler->LoadCurrentCharacter(cp_offset, on_failure, check);
       checked = check;
     }
     macro_assembler->CheckNotCharacter(c, on_failure);
   }
   return checked;
 }
 
-
 static bool ShortCutEmitCharacterPair(RegExpMacroAssembler* macro_assembler,
                                       bool one_byte,
                                       uint16_t c1,
                                       uint16_t c2,
                                       BlockLabel* on_failure) {
   uint16_t char_mask;
   if (one_byte) {
     char_mask = Symbols::kMaxOneCharCodeSymbol;
   } else {
     char_mask = Utf16::kMaxCodeUnit;
@@ skipping 16 matching lines @@
     // trick.  We avoid the theoretical case where negative numbers are
     // involved in order to simplify code generation.
     uint16_t mask = char_mask ^ diff;
     macro_assembler->CheckNotCharacterAfterMinusAnd(c1 - diff, diff, mask,
                                                     on_failure);
     return true;
   }
   return false;
 }
 
-
 typedef bool EmitCharacterFunction(Zone* zone,
                                    RegExpCompiler* compiler,
                                    uint16_t c,
                                    BlockLabel* on_failure,
                                    intptr_t cp_offset,
                                    bool check,
                                    bool preloaded);
 
 // Only emits letters (things that have case).  Only used for case independent
 // matches.
@@ skipping 36 matching lines @@
       macro_assembler->CheckNotCharacter(chars[2], on_failure);
       macro_assembler->BindBlock(&ok);
       break;
     default:
       UNREACHABLE();
       break;
   }
   return true;
 }
 
-
 static void EmitBoundaryTest(RegExpMacroAssembler* masm,
                              intptr_t border,
                              BlockLabel* fall_through,
                              BlockLabel* above_or_equal,
                              BlockLabel* below) {
   if (below != fall_through) {
     masm->CheckCharacterLT(border, below);
     if (above_or_equal != fall_through) masm->GoTo(above_or_equal);
   } else {
     masm->CheckCharacterGT(border - 1, above_or_equal);
   }
 }
 
-
 static void EmitDoubleBoundaryTest(RegExpMacroAssembler* masm,
                                    intptr_t first,
                                    intptr_t last,
                                    BlockLabel* fall_through,
                                    BlockLabel* in_range,
                                    BlockLabel* out_of_range) {
   if (in_range == fall_through) {
     if (first == last) {
       masm->CheckNotCharacter(first, out_of_range);
     } else {
       masm->CheckCharacterNotInRange(first, last, out_of_range);
     }
   } else {
     if (first == last) {
       masm->CheckCharacter(first, in_range);
     } else {
       masm->CheckCharacterInRange(first, last, in_range);
     }
     if (out_of_range != fall_through) masm->GoTo(out_of_range);
   }
 }
 
-
 // even_label is for ranges[i] to ranges[i + 1] where i - start_index is even.
 // odd_label is for ranges[i] to ranges[i + 1] where i - start_index is odd.
 static void EmitUseLookupTable(RegExpMacroAssembler* masm,
                                ZoneGrowableArray<int>* ranges,
                                intptr_t start_index,
                                intptr_t end_index,
                                intptr_t min_char,
                                BlockLabel* fall_through,
                                BlockLabel* even_label,
                                BlockLabel* odd_label) {
@@ skipping 39 matching lines @@
   // TODO(erikcorry): Cache these.
   const TypedData& ba = TypedData::ZoneHandle(
       masm->zone(), TypedData::New(kTypedDataUint8ArrayCid, kSize, Heap::kOld));
   for (intptr_t i = 0; i < kSize; i++) {
     ba.SetUint8(i, templ[i]);
   }
   masm->CheckBitInTable(ba, on_bit_set);
   if (on_bit_clear != fall_through) masm->GoTo(on_bit_clear);
 }
 
-
 static void CutOutRange(RegExpMacroAssembler* masm,
                         ZoneGrowableArray<int>* ranges,
                         intptr_t start_index,
                         intptr_t end_index,
                         intptr_t cut_index,
                         BlockLabel* even_label,
                         BlockLabel* odd_label) {
   bool odd = (((cut_index - start_index) & 1) == 1);
   BlockLabel* in_range_label = odd ? odd_label : even_label;
   BlockLabel dummy;
   EmitDoubleBoundaryTest(masm, ranges->At(cut_index),
                          ranges->At(cut_index + 1) - 1, &dummy, in_range_label,
                          &dummy);
   ASSERT(!dummy.IsLinked());
   // Cut out the single range by rewriting the array.  This creates a new
   // range that is a merger of the two ranges on either side of the one we
   // are cutting out.  The oddity of the labels is preserved.
   for (intptr_t j = cut_index; j > start_index; j--) {
     (*ranges)[j] = ranges->At(j - 1);
   }
   for (intptr_t j = cut_index + 1; j < end_index; j++) {
     (*ranges)[j] = ranges->At(j + 1);
   }
 }
 
-
 // Unicode case.  Split the search space into kSize spaces that are handled
 // with recursion.
 static void SplitSearchSpace(ZoneGrowableArray<int>* ranges,
                              intptr_t start_index,
                              intptr_t end_index,
                              intptr_t* new_start_index,
                              intptr_t* new_end_index,
                              intptr_t* border) {
   static const intptr_t kSize = RegExpMacroAssembler::kTableSize;
   static const intptr_t kMask = RegExpMacroAssembler::kTableMask;
@@ skipping 45 matching lines @@
   if (ranges->At(*new_end_index) == *border) {
     (*new_end_index)--;
   }
   if (*border >= ranges->At(end_index)) {
     *border = ranges->At(end_index);
     *new_start_index = end_index;  // Won't be used.
     *new_end_index = end_index - 1;
   }
 }
 
-
 // Gets a series of segment boundaries representing a character class.  If the
 // character is in the range between an even and an odd boundary (counting from
 // start_index) then go to even_label, otherwise go to odd_label.  We already
 // know that the character is in the range of min_char to max_char inclusive.
 // Either label can be NULL indicating backtracking.  Either label can also be
 // equal to the fall_through label.
 static void GenerateBranches(RegExpMacroAssembler* masm,
                              ZoneGrowableArray<int>* ranges,
                              intptr_t start_index,
                              intptr_t end_index,
@@ skipping 100 matching lines @@
 
   if (handle_rest.IsLinked()) {
     masm->BindBlock(&handle_rest);
     bool flip = (new_start_index & 1) != (start_index & 1);
     GenerateBranches(masm, ranges, new_start_index, end_index, border, max_char,
                      &dummy, flip ? odd_label : even_label,
                      flip ? even_label : odd_label);
   }
 }
 
-
 static void EmitCharClass(RegExpMacroAssembler* macro_assembler,
                           RegExpCharacterClass* cc,
                           bool one_byte,
                           BlockLabel* on_failure,
                           intptr_t cp_offset,
                           bool check_offset,
                           bool preloaded,
                           Zone* zone) {
   ZoneGrowableArray<CharacterRange>* ranges = cc->ranges();
   if (!CharacterRange::IsCanonical(ranges)) {
@@ skipping 45 matching lines @@
     if (check_offset) {
       macro_assembler->CheckPosition(cp_offset, on_failure);
     }
     return;
   }
 
   if (!preloaded) {
     macro_assembler->LoadCurrentCharacter(cp_offset, on_failure, check_offset);
   }
 
-  if (cc->is_standard() &&
-      macro_assembler->CheckSpecialCharacterClass(cc->standard_type(),
-                                                  on_failure)) {
+  if (cc->is_standard() && macro_assembler->CheckSpecialCharacterClass(
+                               cc->standard_type(), on_failure)) {
     return;
   }
 
-
   // A new list with ascending entries.  Each entry is a code unit
   // where there is a boundary between code units that are part of
   // the class and code units that are not.  Normally we insert an
   // entry at zero which goes to the failure label, but if there
   // was already one there we fall through for success on that entry.
   // Subsequent entries have alternating meaning (success/failure).
   ZoneGrowableArray<int>* range_boundaries =
       new (zone) ZoneGrowableArray<int>(last_valid_range);
 
   bool zeroth_entry_is_failure = !cc->is_negated();
@@ skipping 17 matching lines @@
   GenerateBranches(macro_assembler, range_boundaries,
                    0,  // start_index.
                    end_index,
                    0,  // min_char.
                    max_char, &fall_through,
                    zeroth_entry_is_failure ? &fall_through : on_failure,
                    zeroth_entry_is_failure ? on_failure : &fall_through);
   macro_assembler->BindBlock(&fall_through);
 }
 
-
 RegExpNode::~RegExpNode() {}
 
-
 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler,
                                                   Trace* trace) {
   // If we are generating a greedy loop then don't stop and don't reuse code.
   if (trace->stop_node() != NULL) {
     return CONTINUE;
   }
 
   RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
   if (trace->is_trivial()) {
     if (label_.IsBound()) {
@@ skipping 22 matching lines @@
     return CONTINUE;
   }
 
   // If we get here code has been generated for this node too many times or
   // recursion is too deep.  Time to switch to a generic version.  The code for
   // generic versions above can handle deep recursion properly.
   trace->Flush(compiler, this);
   return DONE;
 }
 
-
 intptr_t ActionNode::EatsAtLeast(intptr_t still_to_find,
                                  intptr_t budget,
                                  bool not_at_start) {
   if (budget <= 0) return 0;
   if (action_type_ == POSITIVE_SUBMATCH_SUCCESS) return 0;  // Rewinds input!
   return on_success()->EatsAtLeast(still_to_find, budget - 1, not_at_start);
 }
 
-
 void ActionNode::FillInBMInfo(intptr_t offset,
                               intptr_t budget,
                               BoyerMooreLookahead* bm,
                               bool not_at_start) {
   if (action_type_ == BEGIN_SUBMATCH) {
     bm->SetRest(offset);
   } else if (action_type_ != POSITIVE_SUBMATCH_SUCCESS) {
     on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start);
   }
   SaveBMInfo(bm, not_at_start, offset);
 }
 
-
 intptr_t AssertionNode::EatsAtLeast(intptr_t still_to_find,
                                     intptr_t budget,
                                     bool not_at_start) {
   if (budget <= 0) return 0;
   // If we know we are not at the start and we are asked "how many characters
   // will you match if you succeed?" then we can answer anything since false
   // implies false.  So lets just return the max answer (still_to_find) since
   // that won't prevent us from preloading a lot of characters for the other
   // branches in the node graph.
   if (assertion_type() == AT_START && not_at_start) return still_to_find;
   return on_success()->EatsAtLeast(still_to_find, budget - 1, not_at_start);
 }
 
-
 void AssertionNode::FillInBMInfo(intptr_t offset,
                                  intptr_t budget,
                                  BoyerMooreLookahead* bm,
                                  bool not_at_start) {
   // Match the behaviour of EatsAtLeast on this node.
   if (assertion_type() == AT_START && not_at_start) return;
   on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start);
   SaveBMInfo(bm, not_at_start, offset);
 }
 
-
 intptr_t BackReferenceNode::EatsAtLeast(intptr_t still_to_find,
                                         intptr_t budget,
                                         bool not_at_start) {
   if (budget <= 0) return 0;
   return on_success()->EatsAtLeast(still_to_find, budget - 1, not_at_start);
 }
 
-
 intptr_t TextNode::EatsAtLeast(intptr_t still_to_find,
                                intptr_t budget,
                                bool not_at_start) {
   intptr_t answer = Length();
   if (answer >= still_to_find) return answer;
   if (budget <= 0) return answer;
   // We are not at start after this node so we set the last argument to 'true'.
   return answer +
          on_success()->EatsAtLeast(still_to_find - answer, budget - 1, true);
 }
 
-
 intptr_t NegativeLookaheadChoiceNode::EatsAtLeast(intptr_t still_to_find,
                                                   intptr_t budget,
                                                   bool not_at_start) {
   if (budget <= 0) return 0;
   // Alternative 0 is the negative lookahead, alternative 1 is what comes
   // afterwards.
   RegExpNode* node = (*alternatives_)[1].node();
   return node->EatsAtLeast(still_to_find, budget - 1, not_at_start);
 }
 
-
 void NegativeLookaheadChoiceNode::GetQuickCheckDetails(
     QuickCheckDetails* details,
     RegExpCompiler* compiler,
     intptr_t filled_in,
     bool not_at_start) {
   // Alternative 0 is the negative lookahead, alternative 1 is what comes
   // afterwards.
   RegExpNode* node = (*alternatives_)[1].node();
   return node->GetQuickCheckDetails(details, compiler, filled_in, not_at_start);
 }
 
-
 intptr_t ChoiceNode::EatsAtLeastHelper(intptr_t still_to_find,
                                        intptr_t budget,
                                        RegExpNode* ignore_this_node,
                                        bool not_at_start) {
   if (budget <= 0) return 0;
   intptr_t min = 100;
   intptr_t choice_count = alternatives_->length();
   budget = (budget - 1) / choice_count;
   for (intptr_t i = 0; i < choice_count; i++) {
     RegExpNode* node = (*alternatives_)[i].node();
     if (node == ignore_this_node) continue;
     intptr_t node_eats_at_least =
         node->EatsAtLeast(still_to_find, budget, not_at_start);
     if (node_eats_at_least < min) min = node_eats_at_least;
     if (min == 0) return 0;
   }
   return min;
 }
 
-
 intptr_t LoopChoiceNode::EatsAtLeast(intptr_t still_to_find,
                                      intptr_t budget,
                                      bool not_at_start) {
   return EatsAtLeastHelper(still_to_find, budget - 1, loop_node_, not_at_start);
 }
 
-
 intptr_t ChoiceNode::EatsAtLeast(intptr_t still_to_find,
                                  intptr_t budget,
                                  bool not_at_start) {
   return EatsAtLeastHelper(still_to_find, budget, NULL, not_at_start);
 }
 
-
 // Takes the left-most 1-bit and smears it out, setting all bits to its right.
 static inline uint32_t SmearBitsRight(uint32_t v) {
   v |= v >> 1;
   v |= v >> 2;
   v |= v >> 4;
   v |= v >> 8;
   v |= v >> 16;
   return v;
 }
 
-
 bool QuickCheckDetails::Rationalize(bool asc) {
   bool found_useful_op = false;
   uint32_t char_mask;
   if (asc) {
     char_mask = Symbols::kMaxOneCharCodeSymbol;
   } else {
     char_mask = Utf16::kMaxCodeUnit;
   }
   mask_ = 0;
   value_ = 0;
   intptr_t char_shift = 0;
   for (intptr_t i = 0; i < characters_; i++) {
     Position* pos = &positions_[i];
     if ((pos->mask & Symbols::kMaxOneCharCodeSymbol) != 0) {
       found_useful_op = true;
     }
     mask_ |= (pos->mask & char_mask) << char_shift;
     value_ |= (pos->value & char_mask) << char_shift;
     char_shift += asc ? 8 : 16;
   }
   return found_useful_op;
 }
 
-
 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler,
                                 Trace* bounds_check_trace,
                                 Trace* trace,
                                 bool preload_has_checked_bounds,
                                 BlockLabel* on_possible_success,
                                 QuickCheckDetails* details,
                                 bool fall_through_on_failure) {
   if (details->characters() == 0) return false;
   GetQuickCheckDetails(details, compiler, 0,
                        trace->at_start() == Trace::FALSE_VALUE);
@@ skipping 10 matching lines @@
     ASSERT(trace->cp_offset() == bounds_check_trace->cp_offset());
     // We are attempting to preload the minimum number of characters
     // any choice would eat, so if the bounds check fails, then none of the
     // choices can succeed, so we can just immediately backtrack, rather
     // than go to the next choice.
     assembler->LoadCurrentCharacter(
         trace->cp_offset(), bounds_check_trace->backtrack(),
         !preload_has_checked_bounds, details->characters());
   }
 
-
   bool need_mask = true;
 
   if (details->characters() == 1) {
     // If number of characters preloaded is 1 then we used a byte or 16 bit
     // load so the value is already masked down.
     uint32_t char_mask;
     if (compiler->one_byte()) {
       char_mask = Symbols::kMaxOneCharCodeSymbol;
     } else {
       char_mask = Utf16::kMaxCodeUnit;
@@ skipping 21 matching lines @@
   } else {
     if (need_mask) {
       assembler->CheckNotCharacterAfterAnd(value, mask, trace->backtrack());
     } else {
       assembler->CheckNotCharacter(value, trace->backtrack());
     }
   }
   return true;
 }
 
-
 // Here is the meat of GetQuickCheckDetails (see also the comment on the
 // super-class in the .h file).
 //
 // We iterate along the text object, building up for each character a
 // mask and value that can be used to test for a quick failure to match.
 // The masks and values for the positions will be combined into a single
 // machine word for the current character width in order to be used in
 // generating a quick check.
 void TextNode::GetQuickCheckDetails(QuickCheckDetails* details,
                                     RegExpCompiler* compiler,
@@ skipping 143 matching lines @@
       }
     }
   }
   ASSERT(characters_filled_in != details->characters());
   if (!details->cannot_match()) {
     on_success()->GetQuickCheckDetails(details, compiler, characters_filled_in,
                                        true);
   }
 }
 
-
 void QuickCheckDetails::Clear() {
   for (int i = 0; i < characters_; i++) {
     positions_[i].mask = 0;
     positions_[i].value = 0;
     positions_[i].determines_perfectly = false;
   }
   characters_ = 0;
 }
 
-
 void QuickCheckDetails::Advance(intptr_t by, bool one_byte) {
   ASSERT(by >= 0);
   if (by >= characters_) {
     Clear();
     return;
   }
   for (intptr_t i = 0; i < characters_ - by; i++) {
     positions_[i] = positions_[by + i];
   }
   for (intptr_t i = characters_ - by; i < characters_; i++) {
     positions_[i].mask = 0;
     positions_[i].value = 0;
     positions_[i].determines_perfectly = false;
   }
   characters_ -= by;
   // We could change mask_ and value_ here but we would never advance unless
   // they had already been used in a check and they won't be used again because
   // it would gain us nothing.  So there's no point.
 }
 
-
 void QuickCheckDetails::Merge(QuickCheckDetails* other, intptr_t from_index) {
   ASSERT(characters_ == other->characters_);
   if (other->cannot_match_) {
     return;
   }
   if (cannot_match_) {
     *this = *other;
     return;
   }
   for (intptr_t i = from_index; i < characters_; i++) {
     QuickCheckDetails::Position* pos = positions(i);
     QuickCheckDetails::Position* other_pos = other->positions(i);
     if (pos->mask != other_pos->mask || pos->value != other_pos->value ||
         !other_pos->determines_perfectly) {
       // Our mask-compare operation will be approximate unless we have the
       // exact same operation on both sides of the alternation.
       pos->determines_perfectly = false;
     }
     pos->mask &= other_pos->mask;
     pos->value &= pos->mask;
     other_pos->value &= pos->mask;
     uint16_t differing_bits = (pos->value ^ other_pos->value);
     pos->mask &= ~differing_bits;
     pos->value &= pos->mask;
   }
 }
 
-
 class VisitMarker : public ValueObject {
  public:
   explicit VisitMarker(NodeInfo* info) : info_(info) {
     ASSERT(!info->visited);
     info->visited = true;
   }
   ~VisitMarker() { info_->visited = false; }
 
  private:
   NodeInfo* info_;
 };
 
-
 RegExpNode* SeqRegExpNode::FilterOneByte(intptr_t depth, bool ignore_case) {
   if (info()->replacement_calculated) return replacement();
   if (depth < 0) return this;
   ASSERT(!info()->visited);
   VisitMarker marker(info());
   return FilterSuccessor(depth - 1, ignore_case);
 }
 
-
 RegExpNode* SeqRegExpNode::FilterSuccessor(intptr_t depth, bool ignore_case) {
   RegExpNode* next = on_success_->FilterOneByte(depth - 1, ignore_case);
   if (next == NULL) return set_replacement(NULL);
   on_success_ = next;
   return set_replacement(this);
 }
 
-
 // We need to check for the following characters: 0x39c 0x3bc 0x178.
 static inline bool RangeContainsLatin1Equivalents(CharacterRange range) {
   // TODO(dcarney): this could be a lot more efficient.
   return range.Contains(0x39c) || range.Contains(0x3bc) ||
          range.Contains(0x178);
 }
 
-
 static bool RangesContainLatin1Equivalents(
     ZoneGrowableArray<CharacterRange>* ranges) {
   for (intptr_t i = 0; i < ranges->length(); i++) {
     // TODO(dcarney): this could be a lot more efficient.
     if (RangeContainsLatin1Equivalents(ranges->At(i))) return true;
   }
   return false;
 }
 
-
 static uint16_t ConvertNonLatin1ToLatin1(uint16_t c) {
   ASSERT(c > Symbols::kMaxOneCharCodeSymbol);
   switch (c) {
     // This are equivalent characters in unicode.
     case 0x39c:
     case 0x3bc:
       return 0xb5;
     // This is an uppercase of a Latin-1 character
     // outside of Latin-1.
     case 0x178:
       return 0xff;
   }
   return 0;
 }
 
-
 RegExpNode* TextNode::FilterOneByte(intptr_t depth, bool ignore_case) {
   if (info()->replacement_calculated) return replacement();
   if (depth < 0) return this;
   ASSERT(!info()->visited);
   VisitMarker marker(info());
   intptr_t element_count = elms_->length();
   for (intptr_t i = 0; i < element_count; i++) {
     TextElement elm = elms_->At(i);
     if (elm.text_type() == TextElement::ATOM) {
       ZoneGrowableArray<uint16_t>* quarks = elm.atom()->data();
@@ skipping 31 matching lines @@
           // This will be handled in a later filter.
           if (ignore_case && RangesContainLatin1Equivalents(ranges)) continue;
           return set_replacement(NULL);
         }
       }
     }
   }
   return FilterSuccessor(depth - 1, ignore_case);
 }
 
-
 RegExpNode* LoopChoiceNode::FilterOneByte(intptr_t depth, bool ignore_case) {
   if (info()->replacement_calculated) return replacement();
   if (depth < 0) return this;
   if (info()->visited) return this;
   {
     VisitMarker marker(info());
 
     RegExpNode* continue_replacement =
         continue_node_->FilterOneByte(depth - 1, ignore_case);
     // If we can't continue after the loop then there is no sense in doing the
     // loop.
     if (continue_replacement == NULL) return set_replacement(NULL);
   }
 
   return ChoiceNode::FilterOneByte(depth - 1, ignore_case);
 }
 
-
 RegExpNode* ChoiceNode::FilterOneByte(intptr_t depth, bool ignore_case) {
   if (info()->replacement_calculated) return replacement();
   if (depth < 0) return this;
   if (info()->visited) return this;
   VisitMarker marker(info());
   intptr_t choice_count = alternatives_->length();
 
   for (intptr_t i = 0; i < choice_count; i++) {
     GuardedAlternative alternative = alternatives_->At(i);
     if (alternative.guards() != NULL && alternative.guards()->length() != 0) {
@@ skipping 30 matching lines @@
         (*alternatives_)[i].node()->FilterOneByte(depth - 1, ignore_case);
     if (replacement != NULL) {
       (*alternatives_)[i].set_node(replacement);
       new_alternatives->Add((*alternatives_)[i]);
     }
   }
   alternatives_ = new_alternatives;
   return this;
 }
 
-
 RegExpNode* NegativeLookaheadChoiceNode::FilterOneByte(intptr_t depth,
                                                        bool ignore_case) {
   if (info()->replacement_calculated) return replacement();
   if (depth < 0) return this;
   if (info()->visited) return this;
   VisitMarker marker(info());
   // Alternative 0 is the negative lookahead, alternative 1 is what comes
   // afterwards.
   RegExpNode* node = (*alternatives_)[1].node();
   RegExpNode* replacement = node->FilterOneByte(depth - 1, ignore_case);
   if (replacement == NULL) return set_replacement(NULL);
   (*alternatives_)[1].set_node(replacement);
 
   RegExpNode* neg_node = (*alternatives_)[0].node();
   RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1, ignore_case);
   // If the negative lookahead is always going to fail then
   // we don't need to check it.
   if (neg_replacement == NULL) return set_replacement(replacement);
   (*alternatives_)[0].set_node(neg_replacement);
   return set_replacement(this);
 }
 
-
 void LoopChoiceNode::GetQuickCheckDetails(QuickCheckDetails* details,
                                           RegExpCompiler* compiler,
                                           intptr_t characters_filled_in,
                                           bool not_at_start) {
   if (body_can_be_zero_length_ || info()->visited) return;
   VisitMarker marker(info());
   return ChoiceNode::GetQuickCheckDetails(details, compiler,
                                           characters_filled_in, not_at_start);
 }
 
-
 void LoopChoiceNode::FillInBMInfo(intptr_t offset,
                                   intptr_t budget,
                                   BoyerMooreLookahead* bm,
                                   bool not_at_start) {
   if (body_can_be_zero_length_ || budget <= 0) {
     bm->SetRest(offset);
     SaveBMInfo(bm, not_at_start, offset);
     return;
   }
   ChoiceNode::FillInBMInfo(offset, budget - 1, bm, not_at_start);
   SaveBMInfo(bm, not_at_start, offset);
 }
 
-
 void ChoiceNode::GetQuickCheckDetails(QuickCheckDetails* details,
                                       RegExpCompiler* compiler,
                                       intptr_t characters_filled_in,
                                       bool not_at_start) {
   not_at_start = (not_at_start || not_at_start_);
   intptr_t choice_count = alternatives_->length();
   ASSERT(choice_count > 0);
   (*alternatives_)[0].node()->GetQuickCheckDetails(
       details, compiler, characters_filled_in, not_at_start);
   for (intptr_t i = 1; i < choice_count; i++) {
     QuickCheckDetails new_details(details->characters());
     RegExpNode* node = (*alternatives_)[i].node();
     node->GetQuickCheckDetails(&new_details, compiler, characters_filled_in,
                                not_at_start);
     // Here we merge the quick match details of the two branches.
     details->Merge(&new_details, characters_filled_in);
   }
 }
 
-
 // Check for [0-9A-Z_a-z].
 static void EmitWordCheck(RegExpMacroAssembler* assembler,
                           BlockLabel* word,
                           BlockLabel* non_word,
                           bool fall_through_on_word) {
   if (assembler->CheckSpecialCharacterClass(
           fall_through_on_word ? 'w' : 'W',
           fall_through_on_word ? non_word : word)) {
     // Optimized implementation available.
     return;
   }
   assembler->CheckCharacterGT('z', non_word);
   assembler->CheckCharacterLT('0', non_word);
   assembler->CheckCharacterGT('a' - 1, word);
   assembler->CheckCharacterLT('9' + 1, word);
   assembler->CheckCharacterLT('A', non_word);
   assembler->CheckCharacterLT('Z' + 1, word);
   if (fall_through_on_word) {
     assembler->CheckNotCharacter('_', non_word);
   } else {
     assembler->CheckCharacter('_', word);
   }
 }
 
-
 // Emit the code to check for a ^ in multiline mode (1-character lookbehind
 // that matches newline or the start of input).
 static void EmitHat(RegExpCompiler* compiler,
                     RegExpNode* on_success,
                     Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   // We will be loading the previous character into the current character
   // register.
   Trace new_trace(*trace);
   new_trace.InvalidateCurrentCharacter();
@@ skipping 13 matching lines @@
     if (!compiler->one_byte()) {
       assembler->CheckCharacterAfterAnd(0x2028, 0xfffe, &ok);
     }
     assembler->CheckCharacter('\n', &ok);
     assembler->CheckNotCharacter('\r', new_trace.backtrack());
   }
   assembler->BindBlock(&ok);
   on_success->Emit(compiler, &new_trace);
 }
 
-
 // Emit the code to handle \b and \B (word-boundary or non-word-boundary).
 void AssertionNode::EmitBoundaryCheck(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   Trace::TriBool next_is_word_character = Trace::UNKNOWN;
   bool not_at_start = (trace->at_start() == Trace::FALSE_VALUE);
   BoyerMooreLookahead* lookahead = bm_info(not_at_start);
   if (lookahead == NULL) {
     intptr_t eats_at_least =
         Utils::Minimum(kMaxLookaheadForBoyerMoore,
                        EatsAtLeast(kMaxLookaheadForBoyerMoore, kRecursionBudget,
@@ skipping 34 matching lines @@
     BacktrackIfPrevious(compiler, trace, at_boundary ? kIsWord : kIsNonWord);
     assembler->BindBlock(&ok);
   } else if (next_is_word_character == Trace::TRUE_VALUE) {
     BacktrackIfPrevious(compiler, trace, at_boundary ? kIsWord : kIsNonWord);
   } else {
     ASSERT(next_is_word_character == Trace::FALSE_VALUE);
     BacktrackIfPrevious(compiler, trace, at_boundary ? kIsNonWord : kIsWord);
   }
 }
 
-
 void AssertionNode::BacktrackIfPrevious(
     RegExpCompiler* compiler,
     Trace* trace,
     AssertionNode::IfPrevious backtrack_if_previous) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   Trace new_trace(*trace);
   new_trace.InvalidateCurrentCharacter();
 
   BlockLabel fall_through, dummy;
 
@@ skipping 11 matching lines @@
   }
   // We already checked that we are not at the start of input so it must be
   // OK to load the previous character.
   assembler->LoadCurrentCharacter(new_trace.cp_offset() - 1, &dummy, false);
   EmitWordCheck(assembler, word, non_word, backtrack_if_previous == kIsNonWord);
 
   assembler->BindBlock(&fall_through);
   on_success()->Emit(compiler, &new_trace);
 }
 
-
 void AssertionNode::GetQuickCheckDetails(QuickCheckDetails* details,
                                          RegExpCompiler* compiler,
                                          intptr_t filled_in,
                                          bool not_at_start) {
   if (assertion_type_ == AT_START && not_at_start) {
     details->set_cannot_match();
     return;
   }
   return on_success()->GetQuickCheckDetails(details, compiler, filled_in,
                                             not_at_start);
 }
 
-
 void AssertionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   switch (assertion_type_) {
     case AT_END: {
       BlockLabel ok;
       assembler->CheckPosition(trace->cp_offset(), &ok);
       assembler->GoTo(trace->backtrack());
       assembler->BindBlock(&ok);
       break;
     }
@@ skipping 15 matching lines @@
       return;
     case AT_BOUNDARY:
     case AT_NON_BOUNDARY: {
       EmitBoundaryCheck(compiler, trace);
       return;
     }
   }
   on_success()->Emit(compiler, trace);
 }
 
-
 static bool DeterminedAlready(QuickCheckDetails* quick_check, intptr_t offset) {
   if (quick_check == NULL) return false;
   if (offset >= quick_check->characters()) return false;
   return quick_check->positions(offset)->determines_perfectly;
 }
 
-
 static void UpdateBoundsCheck(intptr_t index, intptr_t* checked_up_to) {
   if (index > *checked_up_to) {
     *checked_up_to = index;
   }
 }
 
-
 // We call this repeatedly to generate code for each pass over the text node.
 // The passes are in increasing order of difficulty because we hope one
 // of the first passes will fail in which case we are saved the work of the
 // later passes.  for example for the case independent regexp /%[asdfghjkl]a/
 // we will check the '%' in the first pass, the case independent 'a' in the
 // second pass and the character class in the last pass.
 //
 // The passes are done from right to left, so for example to test for /bar/
 // we will first test for an 'r' with offset 2, then an 'a' with offset 1
 // and then a 'b' with offset 0.  This means we can avoid the end-of-input
@@ skipping 70 matching lines @@
         if (DeterminedAlready(quick_check, elm.cp_offset())) continue;
         RegExpCharacterClass* cc = elm.char_class();
         EmitCharClass(assembler, cc, one_byte, backtrack, cp_offset,
                       *checked_up_to < cp_offset, preloaded, Z);
         UpdateBoundsCheck(cp_offset, checked_up_to);
       }
     }
   }
 }
 
-
 intptr_t TextNode::Length() {
   TextElement elm = elms_->Last();
   ASSERT(elm.cp_offset() >= 0);
   return elm.cp_offset() + elm.length();
 }
 
-
 bool TextNode::SkipPass(intptr_t intptr_t_pass, bool ignore_case) {
   TextEmitPassType pass = static_cast<TextEmitPassType>(intptr_t_pass);
   if (ignore_case) {
     return pass == SIMPLE_CHARACTER_MATCH;
   } else {
     return pass == NON_LETTER_CHARACTER_MATCH || pass == CASE_CHARACTER_MATCH;
   }
 }
 
-
 // This generates the code to match a text node.  A text node can contain
 // straight character sequences (possibly to be matched in a case-independent
 // way) and character classes.  For efficiency we do not do this in a single
 // pass from left to right.  Instead we pass over the text node several times,
 // emitting code for some character positions every time.  See the comment on
 // TextEmitPass for details.
 void TextNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   LimitResult limit_result = LimitVersions(compiler, trace);
   if (limit_result == DONE) return;
   ASSERT(limit_result == CONTINUE);
@@ skipping 31 matching lines @@
     }
   }
 
   Trace successor_trace(*trace);
   successor_trace.set_at_start(false);
   successor_trace.AdvanceCurrentPositionInTrace(Length(), compiler);
   RecursionCheck rc(compiler);
   on_success()->Emit(compiler, &successor_trace);
 }
 
-
 void Trace::InvalidateCurrentCharacter() {
   characters_preloaded_ = 0;
 }
 
-
 void Trace::AdvanceCurrentPositionInTrace(intptr_t by,
                                           RegExpCompiler* compiler) {
   ASSERT(by > 0);
   // We don't have an instruction for shifting the current character register
   // down or for using a shifted value for anything so lets just forget that
   // we preloaded any characters into it.
   characters_preloaded_ = 0;
   // Adjust the offsets of the quick check performed information.  This
   // information is used to find out what we already determined about the
   // characters by means of mask and compare.
   quick_check_performed_.Advance(by, compiler->one_byte());
   cp_offset_ += by;
   if (cp_offset_ > RegExpMacroAssembler::kMaxCPOffset) {
     compiler->SetRegExpTooBig();
     cp_offset_ = 0;
   }
   bound_checked_up_to_ =
       Utils::Maximum(static_cast<intptr_t>(0), bound_checked_up_to_ - by);
 }
 
-
 void TextNode::MakeCaseIndependent(bool is_one_byte) {
   intptr_t element_count = elms_->length();
   for (intptr_t i = 0; i < element_count; i++) {
     TextElement elm = elms_->At(i);
     if (elm.text_type() == TextElement::CHAR_CLASS) {
       RegExpCharacterClass* cc = elm.char_class();
       // None of the standard character classes is different in the case
       // independent case and it slows us down if we don't know that.
       if (cc->is_standard()) continue;
       ZoneGrowableArray<CharacterRange>* ranges = cc->ranges();
       intptr_t range_count = ranges->length();
       for (intptr_t j = 0; j < range_count; j++) {
         (*ranges)[j].AddCaseEquivalents(ranges, is_one_byte, Z);
       }
     }
   }
 }
 
-
 intptr_t TextNode::GreedyLoopTextLength() {
   TextElement elm = elms_->At(elms_->length() - 1);
   return elm.cp_offset() + elm.length();
 }
 
-
 RegExpNode* TextNode::GetSuccessorOfOmnivorousTextNode(
     RegExpCompiler* compiler) {
   if (elms_->length() != 1) return NULL;
   TextElement elm = elms_->At(0);
   if (elm.text_type() != TextElement::CHAR_CLASS) return NULL;
   RegExpCharacterClass* node = elm.char_class();
   ZoneGrowableArray<CharacterRange>* ranges = node->ranges();
   if (!CharacterRange::IsCanonical(ranges)) {
     CharacterRange::Canonicalize(ranges);
   }
   if (node->is_negated()) {
     return ranges->length() == 0 ? on_success() : NULL;
   }
   if (ranges->length() != 1) return NULL;
   uint32_t max_char;
   if (compiler->one_byte()) {
     max_char = Symbols::kMaxOneCharCodeSymbol;
   } else {
     max_char = Utf16::kMaxCodeUnit;
   }
   return ranges->At(0).IsEverything(max_char) ? on_success() : NULL;
 }
 
-
 // Finds the fixed match length of a sequence of nodes that goes from
 // this alternative and back to this choice node.  If there are variable
 // length nodes or other complications in the way then return a sentinel
 // value indicating that a greedy loop cannot be constructed.
 intptr_t ChoiceNode::GreedyLoopTextLengthForAlternative(
     GuardedAlternative* alternative) {
   intptr_t length = 0;
   RegExpNode* node = alternative->node();
   // Later we will generate code for all these text nodes using recursion
   // so we have to limit the max number.
   intptr_t recursion_depth = 0;
   while (node != this) {
     if (recursion_depth++ > RegExpCompiler::kMaxRecursion) {
       return kNodeIsTooComplexForGreedyLoops;
     }
     intptr_t node_length = node->GreedyLoopTextLength();
     if (node_length == kNodeIsTooComplexForGreedyLoops) {
       return kNodeIsTooComplexForGreedyLoops;
     }
     length += node_length;
     SeqRegExpNode* seq_node = static_cast<SeqRegExpNode*>(node);
     node = seq_node->on_success();
   }
   return length;
 }
 
-
 void LoopChoiceNode::AddLoopAlternative(GuardedAlternative alt) {
   ASSERT(loop_node_ == NULL);
   AddAlternative(alt);
   loop_node_ = alt.node();
 }
 
-
 void LoopChoiceNode::AddContinueAlternative(GuardedAlternative alt) {
   ASSERT(continue_node_ == NULL);
   AddAlternative(alt);
   continue_node_ = alt.node();
 }
 
-
 void LoopChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
   if (trace->stop_node() == this) {
     // Back edge of greedy optimized loop node graph.
     intptr_t text_length =
         GreedyLoopTextLengthForAlternative(&((*alternatives_)[0]));
     ASSERT(text_length != kNodeIsTooComplexForGreedyLoops);
     // Update the counter-based backtracking info on the stack.  This is an
     // optimization for greedy loops (see below).
     ASSERT(trace->cp_offset() == text_length);
     macro_assembler->AdvanceCurrentPosition(text_length);
     macro_assembler->GoTo(trace->loop_label());
     return;
   }
   ASSERT(trace->stop_node() == NULL);
   if (!trace->is_trivial()) {
     trace->Flush(compiler, this);
     return;
   }
   ChoiceNode::Emit(compiler, trace);
 }
 
-
 intptr_t ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler,
                                                 intptr_t eats_at_least) {
   intptr_t preload_characters =
       Utils::Minimum(static_cast<intptr_t>(4), eats_at_least);
   if (compiler->macro_assembler()->CanReadUnaligned()) {
     bool one_byte = compiler->one_byte();
     if (one_byte) {
       if (preload_characters > 4) preload_characters = 4;
       // We can't preload 3 characters because there is no machine instruction
       // to do that.  We can't just load 4 because we could be reading
       // beyond the end of the string, which could cause a memory fault.
       if (preload_characters == 3) preload_characters = 2;
     } else {
       if (preload_characters > 2) preload_characters = 2;
     }
   } else {
     if (preload_characters > 1) preload_characters = 1;
   }
   return preload_characters;
 }
 
-
 // This structure is used when generating the alternatives in a choice node.  It
 // records the way the alternative is being code generated.
 struct AlternativeGeneration {
   AlternativeGeneration()
       : possible_success(),
         expects_preload(false),
         after(),
         quick_check_details() {}
   BlockLabel possible_success;
   bool expects_preload;
   BlockLabel after;
   QuickCheckDetails quick_check_details;
 };
 
-
 // Creates a list of AlternativeGenerations.  If the list has a reasonable
 // size then it is on the stack, otherwise the excess is on the heap.
 class AlternativeGenerationList {
  public:
   explicit AlternativeGenerationList(intptr_t count) : alt_gens_(count) {
     for (intptr_t i = 0; i < count && i < kAFew; i++) {
       alt_gens_.Add(a_few_alt_gens_ + i);
     }
     for (intptr_t i = kAFew; i < count; i++) {
       alt_gens_.Add(new AlternativeGeneration());
     }
   }
   ~AlternativeGenerationList() {
     for (intptr_t i = kAFew; i < alt_gens_.length(); i++) {
       delete alt_gens_[i];
       alt_gens_[i] = NULL;
     }
   }
 
   AlternativeGeneration* at(intptr_t i) { return alt_gens_[i]; }
 
  private:
   static const intptr_t kAFew = 10;
   GrowableArray<AlternativeGeneration*> alt_gens_;
   AlternativeGeneration a_few_alt_gens_[kAFew];
 
   DISALLOW_ALLOCATION();
 };
 
-
 // The '2' variant is inclusive from and exclusive to.
 // This covers \s as defined in ECMA-262 5.1, 15.10.2.12,
 // which include WhiteSpace (7.2) or LineTerminator (7.3) values.
 static const intptr_t kSpaceRanges[] = {
     '\t',   '\r' + 1, ' ',    ' ' + 1, 0x00A0, 0x00A1, 0x1680, 0x1681,
     0x180E, 0x180F,   0x2000, 0x200B,  0x2028, 0x202A, 0x202F, 0x2030,
     0x205F, 0x2060,   0x3000, 0x3001,  0xFEFF, 0xFF00, 0x10000};
 static const intptr_t kSpaceRangeCount = ARRAY_SIZE(kSpaceRanges);
 static const intptr_t kWordRanges[] = {'0',     '9' + 1, 'A',     'Z' + 1, '_',
                                        '_' + 1, 'a',     'z' + 1, 0x10000};
 static const intptr_t kWordRangeCount = ARRAY_SIZE(kWordRanges);
 static const intptr_t kDigitRanges[] = {'0', '9' + 1, 0x10000};
 static const intptr_t kDigitRangeCount = ARRAY_SIZE(kDigitRanges);
 static const intptr_t kSurrogateRanges[] = {0xd800, 0xe000, 0x10000};
 static const intptr_t kSurrogateRangeCount = ARRAY_SIZE(kSurrogateRanges);
 static const intptr_t kLineTerminatorRanges[] = {0x000A, 0x000B, 0x000D, 0x000E,
                                                  0x2028, 0x202A, 0x10000};
 static const intptr_t kLineTerminatorRangeCount =
     ARRAY_SIZE(kLineTerminatorRanges);
 
-
 void BoyerMoorePositionInfo::Set(intptr_t character) {
   SetInterval(Interval(character, character));
 }
 
-
 void BoyerMoorePositionInfo::SetInterval(const Interval& interval) {
   s_ = AddRange(s_, kSpaceRanges, kSpaceRangeCount, interval);
   w_ = AddRange(w_, kWordRanges, kWordRangeCount, interval);
   d_ = AddRange(d_, kDigitRanges, kDigitRangeCount, interval);
   surrogate_ =
       AddRange(surrogate_, kSurrogateRanges, kSurrogateRangeCount, interval);
   if (interval.to() - interval.from() >= kMapSize - 1) {
     if (map_count_ != kMapSize) {
       map_count_ = kMapSize;
       for (intptr_t i = 0; i < kMapSize; i++)
         (*map_)[i] = true;
     }
     return;
   }
   for (intptr_t i = interval.from(); i <= interval.to(); i++) {
     intptr_t mod_character = (i & kMask);
     if (!map_->At(mod_character)) {
       map_count_++;
       (*map_)[mod_character] = true;
     }
     if (map_count_ == kMapSize) return;
   }
 }
 
-
 void BoyerMoorePositionInfo::SetAll() {
   s_ = w_ = d_ = kLatticeUnknown;
   if (map_count_ != kMapSize) {
     map_count_ = kMapSize;
     for (intptr_t i = 0; i < kMapSize; i++)
       (*map_)[i] = true;
   }
 }
 
-
 BoyerMooreLookahead::BoyerMooreLookahead(intptr_t length,
                                          RegExpCompiler* compiler,
                                          Zone* zone)
     : length_(length), compiler_(compiler) {
   if (compiler->one_byte()) {
     max_char_ = Symbols::kMaxOneCharCodeSymbol;
   } else {
     max_char_ = Utf16::kMaxCodeUnit;
   }
   bitmaps_ = new (zone) ZoneGrowableArray<BoyerMoorePositionInfo*>(length);
   for (intptr_t i = 0; i < length; i++) {
     bitmaps_->Add(new (zone) BoyerMoorePositionInfo(zone));
   }
 }
 
-
 // Find the longest range of lookahead that has the fewest number of different
 // characters that can occur at a given position.  Since we are optimizing two
 // different parameters at once this is a tradeoff.
 bool BoyerMooreLookahead::FindWorthwhileInterval(intptr_t* from, intptr_t* to) {
   intptr_t biggest_points = 0;
   // If more than 32 characters out of 128 can occur it is unlikely that we can
   // be lucky enough to step forwards much of the time.
   const intptr_t kMaxMax = 32;
   for (intptr_t max_number_of_chars = 4; max_number_of_chars < kMaxMax;
        max_number_of_chars *= 2) {
     biggest_points =
         FindBestInterval(max_number_of_chars, biggest_points, from, to);
   }
   if (biggest_points == 0) return false;
   return true;
 }
 
-
 // Find the highest-points range between 0 and length_ where the character
 // information is not too vague.  'Too vague' means that there are more than
 // max_number_of_chars that can occur at this position.  Calculates the number
 // of points as the product of width-of-the-range and
 // probability-of-finding-one-of-the-characters, where the probability is
 // calculated using the frequency distribution of the sample subject string.
 intptr_t BoyerMooreLookahead::FindBestInterval(intptr_t max_number_of_chars,
                                                intptr_t old_biggest_points,
                                                intptr_t* from,
                                                intptr_t* to) {
@@ skipping 39 matching lines @@
     intptr_t points = (i - remembered_from) * probability;
     if (points > biggest_points) {
       *from = remembered_from;
       *to = i - 1;
       biggest_points = points;
     }
   }
   return biggest_points;
 }
 
-
 // Take all the characters that will not prevent a successful match if they
 // occur in the subject string in the range between min_lookahead and
 // max_lookahead (inclusive) measured from the current position.  If the
 // character at max_lookahead offset is not one of these characters, then we
 // can safely skip forwards by the number of characters in the range.
 intptr_t BoyerMooreLookahead::GetSkipTable(
     intptr_t min_lookahead,
     intptr_t max_lookahead,
     const TypedData& boolean_skip_table) {
   const intptr_t kSize = RegExpMacroAssembler::kTableSize;
@@ skipping 11 matching lines @@
     for (intptr_t j = 0; j < kSize; j++) {
       if (map->at(j)) {
         boolean_skip_table.SetUint8(j, kDontSkipArrayEntry);
       }
     }
   }
 
   return skip;
 }
 
-
 // See comment above on the implementation of GetSkipTable.
 void BoyerMooreLookahead::EmitSkipInstructions(RegExpMacroAssembler* masm) {
   const intptr_t kSize = RegExpMacroAssembler::kTableSize;
 
   intptr_t min_lookahead = 0;
   intptr_t max_lookahead = 0;
 
   if (!FindWorthwhileInterval(&min_lookahead, &max_lookahead)) return;
 
   bool found_single_character = false;
@@ skipping 50 matching lines @@
   masm->CheckPreemption(/*is_backtrack=*/false);
   masm->LoadCurrentCharacter(max_lookahead, &cont, true);
   masm->CheckBitInTable(boolean_skip_table, &cont);
   masm->AdvanceCurrentPosition(skip_distance);
   masm->GoTo(&again);
   masm->BindBlock(&cont);
 
   return;
 }
 
-
 /* Code generation for choice nodes.
  *
  * We generate quick checks that do a mask and compare to eliminate a
  * choice.  If the quick check succeeds then it jumps to the continuation to
  * do slow checks and check subsequent nodes.  If it fails (the common case)
  * it falls through to the next choice.
  *
  * Here is the desired flow graph.  Nodes directly below each other imply
  * fallthrough.  Alternatives 1 and 2 have quick checks.  Alternative
  * 3 doesn't have a quick check so we have to call the slow check.
@@ skipping 59 matching lines @@
  *       S|     /
  *        V  F /
  *        S2--/
  */
 
 GreedyLoopState::GreedyLoopState(bool not_at_start) {
   counter_backtrack_trace_.set_backtrack(&label_);
   if (not_at_start) counter_backtrack_trace_.set_at_start(false);
 }
 
-
 void ChoiceNode::AssertGuardsMentionRegisters(Trace* trace) {
 #ifdef DEBUG
   intptr_t choice_count = alternatives_->length();
   for (intptr_t i = 0; i < choice_count - 1; i++) {
     GuardedAlternative alternative = alternatives_->At(i);
     ZoneGrowableArray<Guard*>* guards = alternative.guards();
     intptr_t guard_count = (guards == NULL) ? 0 : guards->length();
     for (intptr_t j = 0; j < guard_count; j++) {
       ASSERT(!trace->mentions_reg(guards->At(j)->reg()));
     }
   }
 #endif
 }
 
-
 void ChoiceNode::SetUpPreLoad(RegExpCompiler* compiler,
                               Trace* current_trace,
                               PreloadState* state) {
   if (state->eats_at_least_ == PreloadState::kEatsAtLeastNotYetInitialized) {
     // Save some time by looking at most one machine word ahead.
     state->eats_at_least_ =
         EatsAtLeast(compiler->one_byte() ? 4 : 2, kRecursionBudget,
                     current_trace->at_start() == Trace::FALSE_VALUE);
   }
   state->preload_characters_ =
       CalculatePreloadCharacters(compiler, state->eats_at_least_);
 
   state->preload_is_current_ =
       (current_trace->characters_preloaded() == state->preload_characters_);
   state->preload_has_checked_bounds_ = state->preload_is_current_;
 }
 
-
 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   intptr_t choice_count = alternatives_->length();
 
   AssertGuardsMentionRegisters(trace);
 
   LimitResult limit_result = LimitVersions(compiler, trace);
   if (limit_result == DONE) return;
   ASSERT(limit_result == CONTINUE);
 
   // For loop nodes we already flushed (see LoopChoiceNode::Emit), but for
@@ skipping 85 matching lines @@
 
   macro_assembler->BindBlock(greedy_loop_state->label());
   // If we have unwound to the bottom then backtrack.
   macro_assembler->CheckGreedyLoop(trace->backtrack());
   // Otherwise try the second priority at an earlier position.
   macro_assembler->AdvanceCurrentPosition(-text_length);
   macro_assembler->GoTo(&second_choice);
   return new_trace;
 }
 
-
 intptr_t ChoiceNode::EmitOptimizedUnanchoredSearch(RegExpCompiler* compiler,
                                                    Trace* trace) {
   intptr_t eats_at_least = PreloadState::kEatsAtLeastNotYetInitialized;
   if (alternatives_->length() != 2) return eats_at_least;
 
   GuardedAlternative alt1 = alternatives_->At(1);
   if (alt1.guards() != NULL && alt1.guards()->length() != 0) {
     return eats_at_least;
   }
   RegExpNode* eats_anything_node = alt1.node();
@@ skipping 27 matching lines @@
       GuardedAlternative alt0 = alternatives_->At(0);
       alt0.node()->FillInBMInfo(0, kRecursionBudget, bm, false);
     }
   }
   if (bm != NULL) {
     bm->EmitSkipInstructions(macro_assembler);
   }
   return eats_at_least;
 }
 
-
 void ChoiceNode::EmitChoices(RegExpCompiler* compiler,
                              AlternativeGenerationList* alt_gens,
                              intptr_t first_choice,
                              Trace* trace,
                              PreloadState* preload) {
   RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
   SetUpPreLoad(compiler, trace, preload);
 
   // For now we just call all choices one after the other.  The idea ultimately
   // is to use the Dispatch table to try only the relevant ones.
@@ skipping 64 matching lines @@
       for (intptr_t j = 0; j < guard_count; j++) {
         GenerateGuard(macro_assembler, guards->At(j), &new_trace);
       }
       alternative.node()->Emit(compiler, &new_trace);
       preload->preload_is_current_ = false;
     }
     macro_assembler->BindBlock(&alt_gen->after);
   }
 }
 
-
 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler,
                                            Trace* trace,
                                            GuardedAlternative alternative,
                                            AlternativeGeneration* alt_gen,
                                            intptr_t preload_characters,
                                            bool next_expects_preload) {
   if (!alt_gen->possible_success.IsLinked()) return;
 
   RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
   macro_assembler->BindBlock(&alt_gen->possible_success);
@@ skipping 19 matching lines @@
     macro_assembler->GoTo(&(alt_gen->after));
   } else {
     out_of_line_trace.set_backtrack(&(alt_gen->after));
     for (intptr_t j = 0; j < guard_count; j++) {
       GenerateGuard(macro_assembler, guards->At(j), &out_of_line_trace);
     }
     alternative.node()->Emit(compiler, &out_of_line_trace);
   }
 }
 
-
 void ActionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   LimitResult limit_result = LimitVersions(compiler, trace);
   if (limit_result == DONE) return;
   ASSERT(limit_result == CONTINUE);
 
   RecursionCheck rc(compiler);
 
   switch (action_type_) {
     case STORE_POSITION: {
@@ skipping 100 matching lines @@
 
       ASSERT(trace->backtrack() == NULL);
       assembler->Backtrack();
       return;
     }
     default:
       UNREACHABLE();
   }
 }
 
-
 void BackReferenceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
   RegExpMacroAssembler* assembler = compiler->macro_assembler();
   if (!trace->is_trivial()) {
     trace->Flush(compiler, this);
     return;
   }
 
   LimitResult limit_result = LimitVersions(compiler, trace);
   if (limit_result == DONE) return;
   ASSERT(limit_result == CONTINUE);
 
   RecursionCheck rc(compiler);
 
   ASSERT(start_reg_ + 1 == end_reg_);
   if (compiler->ignore_case()) {
     assembler->CheckNotBackReferenceIgnoreCase(start_reg_, trace->backtrack());
   } else {
     assembler->CheckNotBackReference(start_reg_, trace->backtrack());
   }
   on_success()->Emit(compiler, trace);
 }
 
-
 // -------------------------------------------------------------------
 // Dot/dotty output
 
-
 #ifdef DEBUG
 
-
 class DotPrinter : public NodeVisitor {
  public:
   explicit DotPrinter(bool ignore_case) {}
   void PrintNode(const char* label, RegExpNode* node);
   void Visit(RegExpNode* node);
   void PrintAttributes(RegExpNode* from);
   void PrintOnFailure(RegExpNode* from, RegExpNode* to);
 #define DECLARE_VISIT(Type) virtual void Visit##Type(Type##Node* that);
   FOR_EACH_NODE_TYPE(DECLARE_VISIT)
 #undef DECLARE_VISIT
 };
 
-
 void DotPrinter::PrintNode(const char* label, RegExpNode* node) {
   OS::Print("digraph G {\n  graph [label=\"");
   for (intptr_t i = 0; label[i]; i++) {
     switch (label[i]) {
       case '\\':
         OS::Print("\\\\");
         break;
       case '"':
         OS::Print("\"");
         break;
       default:
         OS::Print("%c", label[i]);
         break;
     }
   }
   OS::Print("\"];\n");
   Visit(node);
   OS::Print("}\n");
 }
 
-
 void DotPrinter::Visit(RegExpNode* node) {
   if (node->info()->visited) return;
   node->info()->visited = true;
   node->Accept(this);
 }
 
-
 void DotPrinter::PrintOnFailure(RegExpNode* from, RegExpNode* on_failure) {
   OS::Print("  n%p -> n%p [style=dotted];\n", from, on_failure);
   Visit(on_failure);
 }
 
-
 class AttributePrinter : public ValueObject {
  public:
   AttributePrinter() : first_(true) {}
   void PrintSeparator() {
     if (first_) {
       first_ = false;
     } else {
       OS::Print("|");
     }
   }
   void PrintBit(const char* name, bool value) {
     if (!value) return;
     PrintSeparator();
     OS::Print("{%s}", name);
   }
   void PrintPositive(const char* name, intptr_t value) {
     if (value < 0) return;
     PrintSeparator();
     OS::Print("{%s|%" Pd "}", name, value);
   }
 
  private:
   bool first_;
 };
 
-
 void DotPrinter::PrintAttributes(RegExpNode* that) {
   OS::Print(
       "  a%p [shape=Mrecord, color=grey, fontcolor=grey, "
       "margin=0.1, fontsize=10, label=\"{",
       that);
   AttributePrinter printer;
   NodeInfo* info = that->info();
   printer.PrintBit("NI", info->follows_newline_interest);
   printer.PrintBit("WI", info->follows_word_interest);
   printer.PrintBit("SI", info->follows_start_interest);
   BlockLabel* label = that->label();
   if (label->IsBound()) printer.PrintPositive("@", label->Position());
   OS::Print(
       "}\"];\n"
       "  a%p -> n%p [style=dashed, color=grey, arrowhead=none];\n",
       that, that);
 }
 
-
 void DotPrinter::VisitChoice(ChoiceNode* that) {
   OS::Print("  n%p [shape=Mrecord, label=\"?\"];\n", that);
   for (intptr_t i = 0; i < that->alternatives()->length(); i++) {
     GuardedAlternative alt = that->alternatives()->At(i);
     OS::Print("  n%p -> n%p", that, alt.node());
   }
   for (intptr_t i = 0; i < that->alternatives()->length(); i++) {
     GuardedAlternative alt = that->alternatives()->At(i);
     alt.node()->Accept(this);
   }
 }
 
-
 void DotPrinter::VisitText(TextNode* that) {
   OS::Print("  n%p [label=\"", that);
   for (intptr_t i = 0; i < that->elements()->length(); i++) {
     if (i > 0) OS::Print(" ");
     TextElement elm = that->elements()->At(i);
     switch (elm.text_type()) {
       case TextElement::ATOM: {
         ZoneGrowableArray<uint16_t>* data = elm.atom()->data();
         for (intptr_t i = 0; i < data->length(); i++) {
           OS::Print("%c", static_cast<char>(data->At(i)));
@@ skipping 16 matching lines @@
       default:
         UNREACHABLE();
     }
   }
   OS::Print("\", shape=box, peripheries=2];\n");
   PrintAttributes(that);
   OS::Print("  n%p -> n%p;\n", that, that->on_success());
   Visit(that->on_success());
 }
 
-
 void DotPrinter::VisitBackReference(BackReferenceNode* that) {
   OS::Print("  n%p [label=\"$%" Pd "..$%" Pd "\", shape=doubleoctagon];\n",
             that, that->start_register(), that->end_register());
   PrintAttributes(that);
   OS::Print("  n%p -> n%p;\n", that, that->on_success());
   Visit(that->on_success());
 }
 
-
 void DotPrinter::VisitEnd(EndNode* that) {
   OS::Print("  n%p [style=bold, shape=point];\n", that);
   PrintAttributes(that);
 }
 
-
 void DotPrinter::VisitAssertion(AssertionNode* that) {
   OS::Print("  n%p [", that);
   switch (that->assertion_type()) {
     case AssertionNode::AT_END:
       OS::Print("label=\"$\", shape=septagon");
       break;
     case AssertionNode::AT_START:
       OS::Print("label=\"^\", shape=septagon");
       break;
     case AssertionNode::AT_BOUNDARY:
       OS::Print("label=\"\\b\", shape=septagon");
       break;
     case AssertionNode::AT_NON_BOUNDARY:
       OS::Print("label=\"\\B\", shape=septagon");
       break;
     case AssertionNode::AFTER_NEWLINE:
       OS::Print("label=\"(?<=\\n)\", shape=septagon");
       break;
   }
   OS::Print("];\n");
   PrintAttributes(that);
   RegExpNode* successor = that->on_success();
   OS::Print("  n%p -> n%p;\n", that, successor);
   Visit(successor);
 }
 
-
 void DotPrinter::VisitAction(ActionNode* that) {
   OS::Print("  n%p [", that);
   switch (that->action_type_) {
     case ActionNode::SET_REGISTER:
       OS::Print("label=\"$%" Pd ":=%" Pd "\", shape=octagon",
                 that->data_.u_store_register.reg,
                 that->data_.u_store_register.value);
       break;
     case ActionNode::INCREMENT_REGISTER:
       OS::Print("label=\"$%" Pd "++\", shape=octagon",
@@ skipping 23 matching lines @@
       break;
     }
   }
   OS::Print("];\n");
   PrintAttributes(that);
   RegExpNode* successor = that->on_success();
   OS::Print("  n%p -> n%p;\n", that, successor);
   Visit(successor);
 }
 
-
 void RegExpEngine::DotPrint(const char* label,
                             RegExpNode* node,
                             bool ignore_case) {
   DotPrinter printer(ignore_case);
   printer.PrintNode(label, node);
 }
 
-
 #endif  // DEBUG
 
-
 // -------------------------------------------------------------------
 // Tree to graph conversion
 
 // The zone in which we allocate graph nodes.
 #define OZ (on_success->zone())
 
 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler,
                                RegExpNode* on_success) {
   ZoneGrowableArray<TextElement>* elms =
       new (OZ) ZoneGrowableArray<TextElement>(1);
   elms->Add(TextElement::Atom(this));
   return new (OZ) TextNode(elms, on_success);
 }
 
-
 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler,
                                RegExpNode* on_success) {
   ZoneGrowableArray<TextElement>* elms =
       new (OZ) ZoneGrowableArray<TextElement>(1);
   for (intptr_t i = 0; i < elements()->length(); i++) {
     elms->Add(elements()->At(i));
   }
   return new (OZ) TextNode(elms, on_success);
 }
 
-
 static bool CompareInverseRanges(ZoneGrowableArray<CharacterRange>* ranges,
                                  const intptr_t* special_class,
                                  intptr_t length) {
   length--;  // Remove final 0x10000.
   ASSERT(special_class[length] == 0x10000);
   ASSERT(ranges->length() != 0);
   ASSERT(length != 0);
   ASSERT(special_class[0] != 0);
   if (ranges->length() != (length >> 1) + 1) {
     return false;
@@ skipping 10 matching lines @@
     if (special_class[i + 1] != range.from()) {
       return false;
     }
   }
   if (range.to() != 0xffff) {
     return false;
   }
   return true;
 }
 
-
 static bool CompareRanges(ZoneGrowableArray<CharacterRange>* ranges,
                           const intptr_t* special_class,
                           intptr_t length) {
   length--;  // Remove final 0x10000.
   ASSERT(special_class[length] == 0x10000);
   if (ranges->length() * 2 != length) {
     return false;
   }
   for (intptr_t i = 0; i < length; i += 2) {
     CharacterRange range = ranges->At(i >> 1);
     if (range.from() != special_class[i] ||
         range.to() != special_class[i + 1] - 1) {
       return false;
     }
   }
   return true;
 }
 
-
 bool RegExpCharacterClass::is_standard() {
   // TODO(lrn): Remove need for this function, by not throwing away information
   // along the way.
   if (is_negated_) {
     return false;
   }
   if (set_.is_standard()) {
     return true;
   }
   if (CompareRanges(set_.ranges(), kSpaceRanges, kSpaceRangeCount)) {
@@ skipping 18 matching lines @@
     set_.set_standard_set_type('w');
     return true;
   }
   if (CompareInverseRanges(set_.ranges(), kWordRanges, kWordRangeCount)) {
     set_.set_standard_set_type('W');
     return true;
   }
   return false;
 }
 
-
 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler,
                                          RegExpNode* on_success) {
   return new (OZ) TextNode(this, on_success);
 }
 
-
 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler,
                                       RegExpNode* on_success) {
   ZoneGrowableArray<RegExpTree*>* alternatives = this->alternatives();
   intptr_t length = alternatives->length();
   ChoiceNode* result = new (OZ) ChoiceNode(length, OZ);
   for (intptr_t i = 0; i < length; i++) {
     GuardedAlternative alternative(
         alternatives->At(i)->ToNode(compiler, on_success));
     result->AddAlternative(alternative);
   }
   return result;
 }
 
-
 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler,
                                      RegExpNode* on_success) {
   return ToNode(min(), max(), is_greedy(), body(), compiler, on_success);
 }
 
-
 // Scoped object to keep track of how much we unroll quantifier loops in the
 // regexp graph generator.
 class RegExpExpansionLimiter : public ValueObject {
  public:
   static const intptr_t kMaxExpansionFactor = 6;
   RegExpExpansionLimiter(RegExpCompiler* compiler, intptr_t factor)
       : compiler_(compiler),
         saved_expansion_factor_(compiler->current_expansion_factor()),
         ok_to_expand_(saved_expansion_factor_ <= kMaxExpansionFactor) {
     ASSERT(factor > 0);
@@ skipping 17 matching lines @@
   bool ok_to_expand() { return ok_to_expand_; }
 
  private:
   RegExpCompiler* compiler_;
   intptr_t saved_expansion_factor_;
   bool ok_to_expand_;
 
   DISALLOW_IMPLICIT_CONSTRUCTORS(RegExpExpansionLimiter);
 };
 
-
 RegExpNode* RegExpQuantifier::ToNode(intptr_t min,
                                      intptr_t max,
                                      bool is_greedy,
                                      RegExpTree* body,
                                      RegExpCompiler* compiler,
                                      RegExpNode* on_success,
                                      bool not_at_start) {
   // x{f, t} becomes this:
   //
   //             (r++)<-.
@@ skipping 116 matching lines @@
     center->AddContinueAlternative(rest_alt);
     center->AddLoopAlternative(body_alt);
   }
   if (needs_counter) {
     return ActionNode::SetRegister(reg_ctr, 0, center);
   } else {
     return center;
   }
 }
 
-
 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler,
                                     RegExpNode* on_success) {
   switch (assertion_type()) {
     case START_OF_LINE:
       return AssertionNode::AfterNewline(on_success);
     case START_OF_INPUT:
       return AssertionNode::AtStart(on_success);
     case BOUNDARY:
       return AssertionNode::AtBoundary(on_success);
     case NON_BOUNDARY:
@@ skipping 28 matching lines @@
       GuardedAlternative end_alternative(AssertionNode::AtEnd(on_success));
       result->AddAlternative(end_alternative);
       return result;
     }
     default:
       UNREACHABLE();
   }
   return on_success;
 }
 
-
 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler,
                                         RegExpNode* on_success) {
   return new (OZ)
       BackReferenceNode(RegExpCapture::StartRegister(index()),
                         RegExpCapture::EndRegister(index()), on_success);
 }
 
-
 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler,
                                 RegExpNode* on_success) {
   return on_success;
 }
 
-
 RegExpNode* RegExpLookahead::ToNode(RegExpCompiler* compiler,
                                     RegExpNode* on_success) {
   intptr_t stack_pointer_register = compiler->AllocateRegister();
   intptr_t position_register = compiler->AllocateRegister();
 
   const intptr_t registers_per_capture = 2;
   const intptr_t register_of_first_capture = 2;
   intptr_t register_count = capture_count_ * registers_per_capture;
   intptr_t register_start =
       register_of_first_capture + capture_from_ * registers_per_capture;
@@ skipping 23 matching lines @@
         body()->ToNode(compiler, success = new (OZ) NegativeSubmatchSuccess(
                                      stack_pointer_register, position_register,
                                      register_count, register_start, OZ)));
     ChoiceNode* choice_node = new (OZ) NegativeLookaheadChoiceNode(
         body_alt, GuardedAlternative(on_success), OZ);
     return ActionNode::BeginSubmatch(stack_pointer_register, position_register,
                                      choice_node);
   }
 }
 
-
 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler,
                                   RegExpNode* on_success) {
   return ToNode(body(), index(), compiler, on_success);
 }
 
-
 RegExpNode* RegExpCapture::ToNode(RegExpTree* body,
                                   intptr_t index,
                                   RegExpCompiler* compiler,
                                   RegExpNode* on_success) {
   intptr_t start_reg = RegExpCapture::StartRegister(index);
   intptr_t end_reg = RegExpCapture::EndRegister(index);
   RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success);
   RegExpNode* body_node = body->ToNode(compiler, store_end);
   return ActionNode::StorePosition(start_reg, true, body_node);
 }
 
-
 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler,
                                       RegExpNode* on_success) {
   ZoneGrowableArray<RegExpTree*>* children = nodes();
   RegExpNode* current = on_success;
   for (intptr_t i = children->length() - 1; i >= 0; i--) {
     current = children->At(i)->ToNode(compiler, current);
   }
   return current;
 }
 
-
 static void AddClass(const intptr_t* elmv,
                      intptr_t elmc,
                      ZoneGrowableArray<CharacterRange>* ranges) {
   elmc--;
   ASSERT(elmv[elmc] == 0x10000);
   for (intptr_t i = 0; i < elmc; i += 2) {
     ASSERT(elmv[i] < elmv[i + 1]);
     ranges->Add(CharacterRange(elmv[i], elmv[i + 1] - 1));
   }
 }
 
-
 static void AddClassNegated(const intptr_t* elmv,
                             intptr_t elmc,
                             ZoneGrowableArray<CharacterRange>* ranges) {
   elmc--;
   ASSERT(elmv[elmc] == 0x10000);
   ASSERT(elmv[0] != 0x0000);
   ASSERT(elmv[elmc - 1] != Utf16::kMaxCodeUnit);
   uint16_t last = 0x0000;
   for (intptr_t i = 0; i < elmc; i += 2) {
     ASSERT(last <= elmv[i] - 1);
     ASSERT(elmv[i] < elmv[i + 1]);
     ranges->Add(CharacterRange(last, elmv[i] - 1));
     last = elmv[i + 1];
   }
   ranges->Add(CharacterRange(last, Utf16::kMaxCodeUnit));
 }
 
-
 void CharacterRange::AddClassEscape(uint16_t type,
                                     ZoneGrowableArray<CharacterRange>* ranges) {
   switch (type) {
     case 's':
       AddClass(kSpaceRanges, kSpaceRangeCount, ranges);
       break;
     case 'S':
       AddClassNegated(kSpaceRanges, kSpaceRangeCount, ranges);
       break;
     case 'w':
@@ skipping 20 matching lines @@
     // This is the set of characters matched by the $ and ^ symbols
     // in multiline mode.
     case 'n':
       AddClass(kLineTerminatorRanges, kLineTerminatorRangeCount, ranges);
       break;
     default:
       UNREACHABLE();
   }
 }
 
-
 void CharacterRange::AddCaseEquivalents(
     ZoneGrowableArray<CharacterRange>* ranges,
     bool is_one_byte,
     Zone* zone) {
   uint16_t bottom = from();
   uint16_t top = to();
   if (is_one_byte && !RangeContainsLatin1Equivalents(*this)) {
     if (bottom > Symbols::kMaxOneCharCodeSymbol) return;
     if (top > Symbols::kMaxOneCharCodeSymbol) {
       top = Symbols::kMaxOneCharCodeSymbol;
@@ skipping 51 matching lines @@
         uint16_t range_to = c - (block_end - end);
         if (!(bottom <= range_from && range_to <= top)) {
           ranges->Add(CharacterRange(range_from, range_to));
         }
       }
       pos = end + 1;
     }
   }
 }
 
-
 bool CharacterRange::IsCanonical(ZoneGrowableArray<CharacterRange>* ranges) {
   ASSERT(ranges != NULL);
   intptr_t n = ranges->length();
   if (n <= 1) return true;
   intptr_t max = ranges->At(0).to();
   for (intptr_t i = 1; i < n; i++) {
     CharacterRange next_range = ranges->At(i);
     if (next_range.from() <= max + 1) return false;
     max = next_range.to();
   }
   return true;
 }
 
-
 ZoneGrowableArray<CharacterRange>* CharacterSet::ranges() {
   if (ranges_ == NULL) {
     ranges_ = new ZoneGrowableArray<CharacterRange>(2);
     CharacterRange::AddClassEscape(standard_set_type_, ranges_);
   }
   return ranges_;
 }
 
-
 // Move a number of elements in a zone array to another position
 // in the same array. Handles overlapping source and target areas.
 static void MoveRanges(ZoneGrowableArray<CharacterRange>* list,
                        intptr_t from,
                        intptr_t to,
                        intptr_t count) {
   // Ranges are potentially overlapping.
   if (from < to) {
     for (intptr_t i = count - 1; i >= 0; i--) {
       (*list)[to + i] = list->At(from + i);
     }
   } else {
     for (intptr_t i = 0; i < count; i++) {
       (*list)[to + i] = list->At(from + i);
     }
   }
 }
 
-
 static intptr_t InsertRangeInCanonicalList(
     ZoneGrowableArray<CharacterRange>* list,
     intptr_t count,
     CharacterRange insert) {
   // Inserts a range into list[0..count[, which must be sorted
   // by from value and non-overlapping and non-adjacent, using at most
   // list[0..count] for the result. Returns the number of resulting
   // canonicalized ranges. Inserting a range may collapse existing ranges into
   // fewer ranges, so the return value can be anything in the range 1..count+1.
   uint16_t from = insert.from();
@@ skipping 38 matching lines @@
 
   intptr_t new_from = Utils::Minimum(list->At(start_pos).from(), from);
   intptr_t new_to = Utils::Maximum(list->At(end_pos - 1).to(), to);
   if (end_pos < count) {
     MoveRanges(list, end_pos, start_pos + 1, count - end_pos);
   }
   (*list)[start_pos] = CharacterRange(new_from, new_to);
   return count - (end_pos - start_pos) + 1;
 }
 
-
 void CharacterSet::Canonicalize() {
   // Special/default classes are always considered canonical. The result
   // of calling ranges() will be sorted.
   if (ranges_ == NULL) return;
   CharacterRange::Canonicalize(ranges_);
 }
 
-
 void CharacterRange::Canonicalize(
     ZoneGrowableArray<CharacterRange>* character_ranges) {
   if (character_ranges->length() <= 1) return;
   // Check whether ranges are already canonical (increasing, non-overlapping,
   // non-adjacent).
   intptr_t n = character_ranges->length();
   intptr_t max = character_ranges->At(0).to();
   intptr_t i = 1;
   while (i < n) {
     CharacterRange current = character_ranges->At(i);
@@ skipping 16 matching lines @@
   do {
     num_canonical = InsertRangeInCanonicalList(character_ranges, num_canonical,
                                                character_ranges->At(read));
     read++;
   } while (read < n);
   character_ranges->TruncateTo(num_canonical);
 
   ASSERT(CharacterRange::IsCanonical(character_ranges));
 }
 
-
 void CharacterRange::Negate(ZoneGrowableArray<CharacterRange>* ranges,
                             ZoneGrowableArray<CharacterRange>* negated_ranges) {
   ASSERT(CharacterRange::IsCanonical(ranges));
   ASSERT(negated_ranges->length() == 0);
   intptr_t range_count = ranges->length();
   uint16_t from = 0;
   intptr_t i = 0;
   if (range_count > 0 && ranges->At(0).from() == 0) {
     from = ranges->At(0).to();
     i = 1;
   }
   while (i < range_count) {
     CharacterRange range = ranges->At(i);
     negated_ranges->Add(CharacterRange(from + 1, range.from() - 1));
     from = range.to();
     i++;
   }
   if (from < Utf16::kMaxCodeUnit) {
     negated_ranges->Add(CharacterRange(from + 1, Utf16::kMaxCodeUnit));
   }
 }
 
-
 // -------------------------------------------------------------------
 // Splay tree
 
-
 // Workaround for the fact that ZoneGrowableArray does not have contains().
 static bool ArrayContains(ZoneGrowableArray<unsigned>* array, unsigned value) {
   for (intptr_t i = 0; i < array->length(); i++) {
     if (array->At(i) == value) {
       return true;
     }
   }
   return false;
 }
 
-
 void OutSet::Set(unsigned value, Zone* zone) {
   if (value < kFirstLimit) {
     first_ |= (1 << value);
   } else {
     if (remaining_ == NULL)
       remaining_ = new (zone) ZoneGrowableArray<unsigned>(1);
 
     bool remaining_contains_value = ArrayContains(remaining_, value);
     if (remaining_->is_empty() || !remaining_contains_value) {
       remaining_->Add(value);
     }
   }
 }
 
-
 bool OutSet::Get(unsigned value) const {
   if (value < kFirstLimit) {
     return (first_ & (1 << value)) != 0;
   } else if (remaining_ == NULL) {
     return false;
   } else {
     return ArrayContains(remaining_, value);
   }
 }
 
-
 // -------------------------------------------------------------------
 // Analysis
 
-
 void Analysis::EnsureAnalyzed(RegExpNode* that) {
   if (that->info()->been_analyzed || that->info()->being_analyzed) return;
   that->info()->being_analyzed = true;
   that->Accept(this);
   that->info()->being_analyzed = false;
   that->info()->been_analyzed = true;
 }
 
-
 void Analysis::VisitEnd(EndNode* that) {
   // nothing to do
 }
 
-
 void TextNode::CalculateOffsets() {
   intptr_t element_count = elements()->length();
   // Set up the offsets of the elements relative to the start.  This is a fixed
   // quantity since a TextNode can only contain fixed-width things.
   intptr_t cp_offset = 0;
   for (intptr_t i = 0; i < element_count; i++) {
     TextElement& elm = (*elements())[i];
     elm.set_cp_offset(cp_offset);
     cp_offset += elm.length();
   }
 }
 
-
 void Analysis::VisitText(TextNode* that) {
   if (ignore_case_) {
     that->MakeCaseIndependent(is_one_byte_);
   }
   EnsureAnalyzed(that->on_success());
   if (!has_failed()) {
     that->CalculateOffsets();
   }
 }
 
-
 void Analysis::VisitAction(ActionNode* that) {
   RegExpNode* target = that->on_success();
   EnsureAnalyzed(target);
   if (!has_failed()) {
     // If the next node is interested in what it follows then this node
     // has to be interested too so it can pass the information on.
     that->info()->AddFromFollowing(target->info());
   }
 }
 
-
 void Analysis::VisitChoice(ChoiceNode* that) {
   NodeInfo* info = that->info();
   for (intptr_t i = 0; i < that->alternatives()->length(); i++) {
     RegExpNode* node = (*that->alternatives())[i].node();
     EnsureAnalyzed(node);
     if (has_failed()) return;
     // Anything the following nodes need to know has to be known by
     // this node also, so it can pass it on.
     info->AddFromFollowing(node->info());
   }
 }
 
-
 void Analysis::VisitLoopChoice(LoopChoiceNode* that) {
   NodeInfo* info = that->info();
   for (intptr_t i = 0; i < that->alternatives()->length(); i++) {
     RegExpNode* node = (*that->alternatives())[i].node();
     if (node != that->loop_node()) {
       EnsureAnalyzed(node);
       if (has_failed()) return;
       info->AddFromFollowing(node->info());
     }
   }
   // Check the loop last since it may need the value of this node
   // to get a correct result.
   EnsureAnalyzed(that->loop_node());
   if (!has_failed()) {
     info->AddFromFollowing(that->loop_node()->info());
   }
 }
 
-
 void Analysis::VisitBackReference(BackReferenceNode* that) {
   EnsureAnalyzed(that->on_success());
 }
 
-
 void Analysis::VisitAssertion(AssertionNode* that) {
   EnsureAnalyzed(that->on_success());
 }
 
-
 void BackReferenceNode::FillInBMInfo(intptr_t offset,
                                      intptr_t budget,
                                      BoyerMooreLookahead* bm,
                                      bool not_at_start) {
   // Working out the set of characters that a backreference can match is too
   // hard, so we just say that any character can match.
   bm->SetRest(offset);
   SaveBMInfo(bm, not_at_start, offset);
 }
 
-
 COMPILE_ASSERT(BoyerMoorePositionInfo::kMapSize ==
                RegExpMacroAssembler::kTableSize);
 
-
 void ChoiceNode::FillInBMInfo(intptr_t offset,
                               intptr_t budget,
                               BoyerMooreLookahead* bm,
                               bool not_at_start) {
   ZoneGrowableArray<GuardedAlternative>* alts = alternatives();
   budget = (budget - 1) / alts->length();
   for (intptr_t i = 0; i < alts->length(); i++) {
     GuardedAlternative& alt = (*alts)[i];
     if (alt.guards() != NULL && alt.guards()->length() != 0) {
       bm->SetRest(offset);  // Give up trying to fill in info.
       SaveBMInfo(bm, not_at_start, offset);
       return;
     }
     alt.node()->FillInBMInfo(offset, budget, bm, not_at_start);
   }
   SaveBMInfo(bm, not_at_start, offset);
 }
 
-
 void TextNode::FillInBMInfo(intptr_t initial_offset,
                             intptr_t budget,
                             BoyerMooreLookahead* bm,
                             bool not_at_start) {
   if (initial_offset >= bm->length()) return;
   intptr_t offset = initial_offset;
   intptr_t max_char = bm->max_char();
   for (intptr_t i = 0; i < elements()->length(); i++) {
     if (offset >= bm->length()) {
       if (initial_offset == 0) set_bm_info(not_at_start, bm);
@@ skipping 40 matching lines @@
   }
   if (offset >= bm->length()) {
     if (initial_offset == 0) set_bm_info(not_at_start, bm);
     return;
   }
   on_success()->FillInBMInfo(offset, budget - 1, bm,
                              true);  // Not at start after a text node.
   if (initial_offset == 0) set_bm_info(not_at_start, bm);
 }
 
-
 #if !defined(DART_PRECOMPILED_RUNTIME)
 RegExpEngine::CompilationResult RegExpEngine::CompileIR(
     RegExpCompileData* data,
     const ParsedFunction* parsed_function,
     const ZoneGrowableArray<const ICData*>& ic_data_array,
     intptr_t osr_id) {
   ASSERT(!FLAG_interpret_irregexp);
   Zone* zone = Thread::Current()->zone();
 
   const Function& function = parsed_function->function();
@@ skipping 91 matching lines @@
       compiler.Assemble(macro_assembler, node, data->capture_count, pattern);
 
   if (FLAG_trace_irregexp) {
     macro_assembler->PrintBlocks();
   }
 
   return result;
 }
 #endif  // !defined(DART_PRECOMPILED_RUNTIME)
 
-
 RegExpEngine::CompilationResult RegExpEngine::CompileBytecode(
     RegExpCompileData* data,
     const RegExp& regexp,
     bool is_one_byte,
     bool is_sticky,
     Zone* zone) {
   ASSERT(FLAG_interpret_irregexp);
   const String& pattern = String::Handle(zone, regexp.pattern());
 
   ASSERT(!regexp.IsNull());
@@ skipping 82 matching lines @@
   RegExpEngine::CompilationResult result =
       compiler.Assemble(macro_assembler, node, data->capture_count, pattern);
 
   if (FLAG_trace_irregexp) {
     macro_assembler->PrintBlocks();
   }
 
   return result;
 }
 
-
 static void CreateSpecializedFunction(Thread* thread,
                                       Zone* zone,
                                       const RegExp& regexp,
                                       intptr_t specialization_cid,
                                       bool sticky,
                                       const Object& owner) {
   const intptr_t kParamCount = RegExpMacroAssembler::kParamCount;
 
   Function& fn =
       Function::Handle(zone, Function::New(Symbols::ColonMatcher(),
@@ skipping 27 matching lines @@
 
   // Cache the result.
   regexp.set_function(specialization_cid, sticky, fn);
 
   fn.SetRegExpData(regexp, specialization_cid, sticky);
   fn.set_is_debuggable(false);
 
   // The function is compiled lazily during the first call.
 }
 
-
 RawRegExp* RegExpEngine::CreateRegExp(Thread* thread,
                                       const String& pattern,
                                       bool multi_line,
                                       bool ignore_case) {
   Zone* zone = thread->zone();
   const RegExp& regexp = RegExp::Handle(RegExp::New());
 
   regexp.set_pattern(pattern);
 
   if (multi_line) {
@@ skipping 18 matching lines @@
       CreateSpecializedFunction(thread, zone, regexp, cid, /*sticky=*/false,
                                 owner);
       CreateSpecializedFunction(thread, zone, regexp, cid, /*sticky=*/true,
                                 owner);
     }
   }
 
   return regexp.raw();
 }
 
-
 }  // namespace dart