low hanging calloc fruit

src/core/SkTDynamicHash.h

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTDynamicHash_DEFINED
 #define SkTDynamicHash_DEFINED
 
@@ skipping 74 matching lines @@
         SkASSERT(0); // countCollisions: should be unreachable
         return -1;
     }
 
 private:
     // We have two special values to indicate an empty or deleted entry.
     static T* Empty()   { return reinterpret_cast<T*>(0); }  // i.e. NULL
     static T* Deleted() { return reinterpret_cast<T*>(1); }  // Also an invalid pointer.
 
     static T** AllocArray(int capacity) {
-        T** array = (T**)sk_malloc_throw(sizeof(T*) * capacity);
-        sk_bzero(array, sizeof(T*) * capacity);  // All cells == Empty().
-        return array;
+        return (T**)sk_calloc_throw(sizeof(T*) * capacity);  // All cells == Empty().
     }
 
     void reset(int capacity) {
         fCount = 0;
         fDeleted = 0;
         fCapacity = capacity;
         fArray = AllocArray(fCapacity);
     }
 
     bool validate() const {
@@ skipping 124 matching lines @@
         return (index + round + 1) & this->hashMask();
     }
 
     int fCount;     // Number of non Empty(), non Deleted() entries in fArray.
     int fDeleted;   // Number of Deleted() entries in fArray.
     int fCapacity;  // Number of entries in fArray.  Always a power of 2.
     T** fArray;
 };
 
 #endif