Changed statement ZoneList to a ZoneChunkList

src/crankshaft/hydrogen-bce.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/crankshaft/hydrogen-bce.h"
 
 namespace v8 {
 namespace internal {
 
 
@@ skipping 76 matching lines @@
 // Traversing the dominator tree we keep a stack (implemented as a singly
 // linked list) of "data" for each basic block that contains a relevant check
 // with the same key (the dictionary holds the head of the list).
 // We also keep all the "data" created for a given basic block in a list, and
 // use it to "clean up" the dictionary when backtracking in the dominator tree
 // traversal.
 // Doing this each dictionary entry always directly points to the check that
 // is dominating the code being examined now.
 // We also track the current "offset" of the index expression and use it to
 // decide if any check is already "covered" (so it can be removed) or not.
-class BoundsCheckBbData: public ZoneObject {
+class BoundsCheckBbData : public ZoneObject {
  public:
   BoundsCheckKey* Key() const { return key_; }
   int32_t LowerOffset() const { return lower_offset_; }
   int32_t UpperOffset() const { return upper_offset_; }
   HBasicBlock* BasicBlock() const { return basic_block_; }
   HBoundsCheck* LowerCheck() const { return lower_check_; }
   HBoundsCheck* UpperCheck() const { return upper_check_; }
   BoundsCheckBbData* NextInBasicBlock() const { return next_in_bb_; }
   BoundsCheckBbData* FatherInDominatorTree() const { return father_in_dt_; }
 
@@ skipping 361 matching lines @@
       table_.Insert(data->Key(), data->FatherInDominatorTree(), zone());
     } else {
       table_.Delete(data->Key());
     }
     data = data->NextInBasicBlock();
   }
 }
 
 }  // namespace internal
 }  // namespace v8