SkTLList throw on sk_malloc fail

src/core/SkTLList.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTLList_DEFINED
 #define SkTLList_DEFINED
 
@@ skipping 229 matching lines @@
     };
 
     size_t blockSize() const { return sizeof(Block) + sizeof(Node) * (fAllocCnt-1); }
 
     Node* createNode() {
         Node* node = fFreeList.head();
         if (node) {
             fFreeList.remove(node);
             ++node->fBlock->fNodesInUse;
         } else {
-            Block* block = reinterpret_cast<Block*>(sk_malloc_flags(this->blockSize(), 0));
+            Block* block = reinterpret_cast<Block*>(sk_malloc_throw(this->blockSize()));
             node = &block->fNodes[0];
             new (node) Node;
             node->fBlock = block;
             block->fNodesInUse = 1;
             for (int i = 1; i < fAllocCnt; ++i) {
                 new (block->fNodes + i) Node;
                 fFreeList.addToHead(block->fNodes + i);
                 block->fNodes[i].fBlock = block;
             }
         }
@@ skipping 133 matching lines @@
 #define SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args) \
     (new ((list), SkTLList< type_name >::kAfter_Placement, (location)) type_name args)
 
 #define SkNEW_INSERT_AT_LLIST_HEAD(list, type_name, args) \
     SkNEW_INSERT_IN_LLIST_BEFORE((list), (list)->headIter(), type_name, args)
 
 #define SkNEW_INSERT_AT_LLIST_TAIL(list, type_name, args) \
     SkNEW_INSERT_IN_LLIST_AFTER((list), (list)->tailIter(), type_name, args)
 
 #endif