move GrMalloc, GrFree, Gr_bzero to their sk equivalents

src/gpu/GrMemoryPool.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "GrMemoryPool.h"
 
 #ifdef SK_DEBUG
@@ skipping 86 matching lines @@
             block->fFreeSize += (block->fCurrPtr - block->fPrevPtr);
             block->fCurrPtr = block->fPrevPtr;
         }
     }
     SkDEBUGCODE(--fAllocationCnt);
     VALIDATE;
 }
 
 GrMemoryPool::BlockHeader* GrMemoryPool::CreateBlock(size_t size) {
     BlockHeader* block =
-        reinterpret_cast<BlockHeader*>(GrMalloc(size + kHeaderSize));
+        reinterpret_cast<BlockHeader*>(sk_malloc_throw(size + kHeaderSize));
     // we assume malloc gives us aligned memory
     SkASSERT(!(reinterpret_cast<intptr_t>(block) % kAlignment));
     block->fLiveCount = 0;
     block->fFreeSize = size;
     block->fCurrPtr = reinterpret_cast<intptr_t>(block) + kHeaderSize;
     block->fPrevPtr = 0; // gcc warns on assigning NULL to an intptr_t.
     return block;
 }
 
 void GrMemoryPool::DeleteBlock(BlockHeader* block) {
-    GrFree(block);
+    sk_free(block);
 }
 
 void GrMemoryPool::validate() {
 #ifdef SK_DEBUG
     BlockHeader* block = fHead;
     BlockHeader* prev = NULL;
     SkASSERT(block);
     int allocCount = 0;
     do {
         allocCount += block->fLiveCount;
@@ skipping 23 matching lines @@
             SkASSERT(userStart == block->fCurrPtr);
         } else {
             SkASSERT(block == *reinterpret_cast<BlockHeader**>(userStart));
         }
         prev = block;
     } while ((block = block->fNext));
     SkASSERT(allocCount == fAllocationCnt);
     SkASSERT(prev == fTail);
 #endif
 }