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

runtime/vm/flow_graph.h

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef RUNTIME_VM_FLOW_GRAPH_H_
 #define RUNTIME_VM_FLOW_GRAPH_H_
 
 #include "vm/bit_vector.h"
 #include "vm/growable_array.h"
 #include "vm/hash_map.h"
@@ skipping 25 matching lines @@
 
   bool Done() const { return current_ >= block_order_.length(); }
 
   BlockEntryInstr* Current() const { return block_order_[current_]; }
 
  private:
   const GrowableArray<BlockEntryInstr*>& block_order_;
   intptr_t current_;
 };
 
-
 struct ConstantPoolTrait {
   typedef ConstantInstr* Value;
   typedef const Object& Key;
   typedef ConstantInstr* Pair;
 
   static Key KeyOf(Pair kv) { return kv->value(); }
 
   static Value ValueOf(Pair kv) { return kv; }
 
   static inline intptr_t Hashcode(Key key) {
@@ skipping 11 matching lines @@
       return String::Cast(key).Hash();
     }
     return key.GetClassId();
   }
 
   static inline bool IsKeyEqual(Pair kv, Key key) {
     return kv->value().raw() == key.raw();
   }
 };
 
-
 // Class to encapsulate the construction and manipulation of the flow graph.
 class FlowGraph : public ZoneAllocated {
  public:
   FlowGraph(const ParsedFunction& parsed_function,
             GraphEntryInstr* graph_entry,
             intptr_t max_block_id);
 
   // Function properties.
   const ParsedFunction& parsed_function() const { return parsed_function_; }
   const Function& function() const { return parsed_function_.function(); }
@@ skipping 324 matching lines @@
   ZoneGrowableArray<BlockEntryInstr*>* loop_headers_;
   ZoneGrowableArray<BitVector*>* loop_invariant_loads_;
   ZoneGrowableArray<const LibraryPrefix*>* deferred_prefixes_;
   ZoneGrowableArray<TokenPosition>* await_token_positions_;
   DirectChainedHashMap<ConstantPoolTrait> constant_instr_pool_;
   BitVector* captured_parameters_;
 
   intptr_t inlining_id_;
 };
 
-
 class LivenessAnalysis : public ValueObject {
  public:
   LivenessAnalysis(intptr_t variable_count,
                    const GrowableArray<BlockEntryInstr*>& postorder);
 
   void Analyze();
 
   virtual ~LivenessAnalysis() {}
 
   BitVector* GetLiveInSetAt(intptr_t postorder_number) const {
@@ skipping 54 matching lines @@
 
   // Kill sets for each block.  They contain indices of variables that
   // are defined by this block.
   GrowableArray<BitVector*> kill_;
 
   // Live-in sets for each block.  They contain indices of variables
   // that are used by this block or its successors.
   GrowableArray<BitVector*> live_in_;
 };
 
-
 // Information about side effect free paths between blocks.
 class BlockEffects : public ZoneAllocated {
  public:
   explicit BlockEffects(FlowGraph* flow_graph);
 
   // Return true if the given instruction is not affected by anything between
   // its current block and target block. Used by CSE to determine if
   // a computation is available in the given block.
   bool IsAvailableAt(Instruction* instr, BlockEntryInstr* block) const;
 
   // Return true if the given instruction is not affected by anything between
   // the given block and its current block. Used by LICM to determine if
   // a computation can be moved to loop's preheader and remain available at
   // its current location.
   bool CanBeMovedTo(Instruction* instr, BlockEntryInstr* block) const;
 
  private:
   // Returns true if from dominates to and all paths between from and to are
   // free of side effects.
   bool IsSideEffectFreePath(BlockEntryInstr* from, BlockEntryInstr* to) const;
 
   // Per block sets of available blocks. Block A is available at the block B if
   // and only if A dominates B and all paths from A to B are free of side
   // effects.
   GrowableArray<BitVector*> available_at_;
 };
 
-
 class DefinitionWorklist : public ValueObject {
  public:
   DefinitionWorklist(FlowGraph* flow_graph, intptr_t initial_capacity)
       : defs_(initial_capacity),
         contains_vector_(new BitVector(flow_graph->zone(),
                                        flow_graph->current_ssa_temp_index())) {}
 
   void Add(Definition* defn) {
     if (!Contains(defn)) {
       defs_.Add(defn);
@@ skipping 20 matching lines @@
   void Clear() {
     defs_.TruncateTo(0);
     contains_vector_->Clear();
   }
 
  private:
   GrowableArray<Definition*> defs_;
   BitVector* contains_vector_;
 };
 
-
 }  // namespace dart
 
 #endif  // RUNTIME_VM_FLOW_GRAPH_H_